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 | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __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 4098 of file stl_algo.h.
References std::lower_bound().
bool std::binary_search | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __val | |||
) | [inline] |
Determines whether an element exists in a range.
Definition at line 4066 of file stl_algo.h.
References std::lower_bound().
pair<_ForwardIterator, _ForwardIterator> std::equal_range | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __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 4008 of file stl_algo.h.
References std::advance(), std::distance(), std::lower_bound(), and std::upper_bound().
pair<_ForwardIterator, _ForwardIterator> std::equal_range | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __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 3946 of file stl_algo.h.
References std::advance(), std::distance(), std::lower_bound(), and std::upper_bound().
_ForwardIterator std::lower_bound | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __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 2822 of file stl_algo.h.
References std::advance(), and std::distance().
Referenced by map::at(), and map::operator[]().
_ForwardIterator std::lower_bound | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __val | |||
) | [inline] |
Finds the first position in which val could be inserted without changing the ordering.
Definition at line 2767 of file stl_algo.h.
References std::advance(), and std::distance().
Referenced by std::binary_search(), and std::equal_range().
_ForwardIterator std::upper_bound | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __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 2921 of file stl_algo.h.
References std::advance(), and std::distance().
_ForwardIterator std::upper_bound | ( | _ForwardIterator | __first, | |
_ForwardIterator | __last, | |||
const _Tp & | __val | |||
) | [inline] |
Finds the last position in which val could be inserted without changing the ordering.
Definition at line 2869 of file stl_algo.h.
References std::advance(), and std::distance().
Referenced by std::equal_range().