eedb/share/include/range/v3/algorithm/upper_bound.hpp
Wieczorek Bartosz f4ef592706 add ranges lib
2017-03-18 08:15:40 +01:00

62 lines
2.1 KiB
C++

/// \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 <range/v3/range_fwd.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_/upper_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
{
/// \addtogroup group-algorithms
/// @{
struct upper_bound_fn
{
template<typename I, typename S, typename V2, typename C = ordered_less, typename P = ident,
CONCEPT_REQUIRES_(Sentinel<S, I>() && BinarySearchable<I, V2, C, P>())>
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<typename Rng, typename V2, typename C = ordered_less, typename P = ident,
typename I = iterator_t<Rng>,
CONCEPT_REQUIRES_(Range<Rng>() && BinarySearchable<I, V2, C, P>())>
safe_iterator_t<Rng>
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_fn>, upper_bound)
/// @}
} // namespace v3
} // namespace ranges
#endif // include guard