std::upper_bound, but returns index (tools/upper_bound.hpp)

• View this file on GitHub
• View document part on GitHub
• Last update: 2022-05-30 15:17:45+09:00
• Include: #include "tools/upper_bound.hpp"

template <class ForwardIterator, class T>
typename ::std::iterator_traits<ForwardIterator>::difference_type upper_bound(ForwardIterator first, ForwardIterator last, T value);

It is identical to std::distance(first, std::upper_bound(first, last, value)).

Constraints

• None

Time Complexity

• Same as that of std::distance(first, std::upper_bound(first, last, value)).

License

• CC0

Author

• anqooqie

Code

#ifndef TOOLS_UPPER_BOUND_HPP
#define TOOLS_UPPER_BOUND_HPP

#include <iterator>
#include <algorithm>

namespace tools {

  template <class ForwardIterator, class T>
  auto upper_bound(ForwardIterator first, ForwardIterator last, const T& value) {
    return ::std::distance(first, ::std::upper_bound(first, last, value));
  }

  template <class ForwardIterator, class T, class Compare>
  auto upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp) {
    return ::std::distance(first, ::std::upper_bound(first, last, value, comp));
  }
}

#endif

#line 1 "tools/upper_bound.hpp"



#include <iterator>
#include <algorithm>

namespace tools {

  template <class ForwardIterator, class T>
  auto upper_bound(ForwardIterator first, ForwardIterator last, const T& value) {
    return ::std::distance(first, ::std::upper_bound(first, last, value));
  }

  template <class ForwardIterator, class T, class Compare>
  auto upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp) {
    return ::std::distance(first, ::std::upper_bound(first, last, value, comp));
  }
}

Back to top page