Functions | |
template<typename ForwardIter, typename Type> | |
ForwardIter | std::lower_bound (ForwardIter first, ForwardIter last, const Type &__val) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIter, typename Type, typename Compare> | |
ForwardIter | std::lower_bound (ForwardIter first, ForwardIter last, const Type &__val, Compare comp) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIter, typename Type> | |
ForwardIter | std::upper_bound (ForwardIter first, ForwardIter last, const Type &__val) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename ForwardIter, typename Type, typename Compare> | |
ForwardIter | std::upper_bound (ForwardIter first, ForwardIter last, const Type &__val, Compare comp) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename ForwardIter, typename Type> | |
pair< ForwardIter, ForwardIter > | std::equal_range (ForwardIter first, ForwardIter last, const Type &__val) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIter, typename Type, typename Compare> | |
pair< ForwardIter, ForwardIter > | std::equal_range (ForwardIter first, ForwardIter last, const Type &__val, Compare comp) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIter, typename Type> | |
bool | std::binary_search (ForwardIter first, ForwardIter last, const Type &__val) |
Determines whether an element exists in a range. | |
template<typename ForwardIter, typename Type, typename Compare> | |
bool | std::binary_search (ForwardIter first, ForwardIter last, const Type &__val, Compare comp) |
Determines whether an element exists in a range. |
The number of comparisons will be logarithmic (and as few as possible). The number of steps through the sequence will be logarithmic for random-access iterators (e.g., pointers), and linear otherwise.
The LWG has passed Defect Report 270, which notes: The proposed resolution reinterprets binary search. Instead of thinking about searching for a value in a sorted range, we view that as an important special case of a more general algorithm: searching for the partition point in a partitioned range. We also add a guarantee that the old wording did not: we ensure that the upper bound is no earlier than the lower bound, that the pair returned by equal_range is a valid range, and that the first part of that pair is the lower bound.
The actual effect of the first sentence is that a comparison functor passed by the user doesn't necessarily need to induce a strict weak ordering relation. Rather, it partitions the range.
bool std::binary_search | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val, | |||
Compare | comp | |||
) | [inline] |
Determines whether an element exists in a range.
first | An iterator. | |
last | Another iterator. | |
val | The search term. | |
comp | A functor to use for comparisons. |
The comparison function should have the same effects on ordering as the function used for the initial sort.
Definition at line 3087 of file stl_algo.h.
References __glibcpp_function_requires, and std::lower_bound().
bool std::binary_search | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val | |||
) | [inline] |
Determines whether an element exists in a range.
Definition at line 3056 of file stl_algo.h.
References __glibcpp_function_requires, and std::lower_bound().
pair<ForwardIter, ForwardIter> std::equal_range | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val, | |||
Compare | comp | |||
) | [inline] |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering.
first | An iterator. | |
last | Another iterator. | |
val | The search term. | |
comp | A functor to use for comparisons. |
std::make_pair(lower_bound(first, last, val, comp), upper_bound(first, last, val, comp))
Definition at line 3007 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), std::distance(), std::lower_bound(), and std::upper_bound().
pair<ForwardIter, ForwardIter> std::equal_range | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val | |||
) | [inline] |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering.
std::make_pair(lower_bound(first, last, val), upper_bound(first, last, val))
Definition at line 2952 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), std::distance(), std::lower_bound(), and std::upper_bound().
ForwardIter std::lower_bound | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val, | |||
Compare | comp | |||
) | [inline] |
Finds the first position in which val could be inserted without changing the ordering.
first | An iterator. | |
last | Another iterator. | |
val | The search term. | |
comp | A functor to use for comparisons. |
Definition at line 2820 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), and std::distance().
ForwardIter std::lower_bound | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val | |||
) | [inline] |
Finds the first position in which val could be inserted without changing the ordering.
Definition at line 2772 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), and std::distance().
Referenced by std::__merge_adaptive(), std::__merge_without_buffer(), std::binary_search(), std::equal_range(), and __gnu_cxx::stl_next_prime().
ForwardIter std::upper_bound | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val, | |||
Compare | comp | |||
) | [inline] |
Finds the last position in which val could be inserted without changing the ordering.
first | An iterator. | |
last | Another iterator. | |
val | The search term. | |
comp | A functor to use for comparisons. |
Definition at line 2905 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), and std::distance().
ForwardIter std::upper_bound | ( | ForwardIter | first, | |
ForwardIter | last, | |||
const Type & | __val | |||
) | [inline] |
Finds the last position in which val could be inserted without changing the ordering.
Definition at line 2860 of file stl_algo.h.
References __glibcpp_function_requires, std::advance(), and std::distance().
Referenced by std::__merge_adaptive(), std::__merge_without_buffer(), and std::equal_range().