Header file range/v3/algorithm/lower_bound.hpp

#include <range/v3/range_fwd.hpp>

#include <range/v3/begin_end.hpp>

#include <range/v3/distance.hpp>

#include <range/v3/range_concepts.hpp>

#include <range/v3/range_traits.hpp>

#include <range/v3/algorithm/partition_point.hpp>

#include <range/v3/algorithm/aux_/lower_bound_n.hpp>

#include <range/v3/utility/functional.hpp>

#include <range/v3/utility/iterator_traits.hpp>

#include <range/v3/utility/static_const.hpp>

namespace ranges
{
    inline namespace v3
    {
        struct lower_bound_fn;
        
        inline namespace 
        {
            constexpr auto& lower_bound = static_const<with_braced_init_args<lower_bound_fn>>::value;
        }
    }
}

Class ranges::v3::lower_bound_fn

struct lower_bound_fn
{
    template <typename I, typename S, typename V, typename C = ordered_less, typename P = ident, int _concept_requires_37 = 42, typename std::enable_if<(_concept_requires_37==43)||(Sentinel<S, I>()&&BinarySearchable<I, V, C, P>()), int>::type=0>
    I operator()(I begin, S end, V const& val, C pred_ = C{}, P proj = P{}) const;
    
    template <typename Rng, typename V, typename C = ordered_less, typename P = ident, typename I = range_iterator_t<Rng>, int _concept_requires_47 = 42, typename std::enable_if<(_concept_requires_47==43)||(Range<Rng>()&&BinarySearchable<I, V, C, P>()), int>::type=0>
    range_safe_iterator_t<Rng> operator()(Rng&& rng, V const& val, C pred_ = C{}, P proj = P{}) const;
};

@{


Variable ranges::v3::lower_bound

constexpr auto& lower_bound = static_const<with_braced_init_args<lower_bound_fn>>::value;

lower_bound_fn