/// \file // Range v3 library // // Copyright Eric Niebler 2014 // Copyright Casey Carter 2016 // // Use, modification and distribution is subject to the // Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // Project home: https://github.com/ericniebler/range-v3 // #ifndef RANGES_V3_ALGORITHM_UPPER_BOUND_HPP #define RANGES_V3_ALGORITHM_UPPER_BOUND_HPP #include #include #include #include #include #include #include #include namespace ranges { inline namespace v3 { /// \addtogroup group-algorithms /// @{ struct upper_bound_fn { template() && BinarySearchable())> I operator()(I begin, S end, V2 const &val, C pred = C{}, P proj = P{}) const { return partition_point(std::move(begin), std::move(end), detail::make_upper_bound_predicate(pred, val), std::move(proj)); } /// \overload template, CONCEPT_REQUIRES_(Range() && BinarySearchable())> safe_iterator_t operator()(Rng &&rng, V2 const &val, C pred = C{}, P proj = P{}) const { return partition_point(rng, detail::make_upper_bound_predicate(pred, val), std::move(proj)); } }; /// \sa `upper_bound_fn` /// \ingroup group-algorithms RANGES_INLINE_VARIABLE(with_braced_init_args, upper_bound) /// @} } // namespace v3 } // namespace ranges #endif // include guard