Horizon
Namespaces | Functions
binary_search.hpp File Reference
#include <functional>
#include <utility>
#include <range/v3/range_fwd.hpp>
#include <range/v3/algorithm/lower_bound.hpp>
#include <range/v3/functional/comparisons.hpp>
#include <range/v3/functional/identity.hpp>
#include <range/v3/functional/invoke.hpp>
#include <range/v3/iterator/concepts.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/traits.hpp>
#include <range/v3/utility/static_const.hpp>
#include <range/v3/detail/prologue.hpp>
#include <range/v3/detail/epilogue.hpp>

Go to the source code of this file.

Namespaces

 ranges::cpp20
 

Functions

 ranges::template (typename I, typename S, typename V, typename C=less, typename P=identity)(requires forward_iterator< I > AND sentinel_for< S
 function template binary_search More...
 
I AND constexpr indirect_strict_weak_order< C, V const *, projected< I, P > > bool RANGES_FUNC() ranges::binary_search (I first, S last, V const &val, C pred=C{}, P proj=P{})
 
 ranges::template (typename Rng, typename V, typename C=less, typename P=identity)(requires forward_range< Rng > AND indirect_strict_weak_order< C
 This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
 
V const constexpr projected< iterator_t< Rng >, P > bool RANGES_FUNC() ranges::binary_search (Rng &&rng, V const &val, C pred=C{}, P proj=P{})