Public Member Functions | |
template<typename I , typename S , typename V2 , typename C = ordered_less, typename P = ident, requires = (Sentinel<S, I>() && BinarySearchable<I, V2, C, P>())> | |
bool | operator() (I begin, S end, V2 const &val, C pred=C{}, P proj=P{}) const |
function template binary_search_fn::operator() More... | |
template<typename Rng , typename V2 , typename C = ordered_less, typename P = ident, typename I = iterator_t<Rng>, requires = (Range<Rng>() && BinarySearchable<I, V2, C, P>())> | |
bool | operator() (Rng &&rng, V2 const &val, C pred=C{}, P proj=P{}) const |
bool ranges::v3::binary_search_fn::operator() | ( | I | begin, |
S | end, | ||
V2 const & | val, | ||
C | pred = C{} , |
||
P | proj = P{} |
||
) | const |
function template binary_search_fn::operator()
range-based version of the binary_search
std algorithm
Rng
is a model of the Range
concept bool ranges::v3::binary_search_fn::operator() | ( | Rng && | rng, |
V2 const & | val, | ||
C | pred = C{} , |
||
P | proj = P{} |
||
) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.