|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106 |
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
- #ifndef RANGES_V3_ALGORITHM_PARTITION_POINT_HPP
- #define RANGES_V3_ALGORITHM_PARTITION_POINT_HPP
-
- #include <meta/meta.hpp>
-
- #include <range/v3/range_fwd.hpp>
-
- #include <range/v3/algorithm/aux_/partition_point_n.hpp>
- #include <range/v3/functional/identity.hpp>
- #include <range/v3/functional/invoke.hpp>
- #include <range/v3/iterator/concepts.hpp>
- #include <range/v3/iterator/operations.hpp>
- #include <range/v3/iterator/traits.hpp>
- #include <range/v3/range/access.hpp>
- #include <range/v3/range/concepts.hpp>
- #include <range/v3/range/dangling.hpp>
- #include <range/v3/range/traits.hpp>
- #include <range/v3/utility/static_const.hpp>
-
- namespace ranges
- {
-
-
-
- RANGES_BEGIN_NIEBLOID(partition_point)
-
-
- template<typename I, typename S, typename C, typename P = identity>
- auto RANGES_FUN_NIEBLOID(partition_point)(
- I first, S last, C pred, P proj = P{})
- ->CPP_ret(I)(
- requires forward_iterator<I> && sentinel_for<S, I> &&
- indirect_unary_predicate<C, projected<I, P>>)
- {
- if(RANGES_CONSTEXPR_IF(sized_sentinel_for<S, I>))
- {
- auto len = distance(first, std::move(last));
- return aux::partition_point_n(
- std::move(first), len, std::move(pred), std::move(proj));
- }
-
-
-
- auto len = iter_difference_t<I>{1};
- while(true)
- {
- auto mid = first;
- auto d = advance(mid, len, last);
- if(mid == last || !invoke(pred, invoke(proj, *mid)))
- {
- len -= d;
- return aux::partition_point_n(
- std::move(first), len, std::ref(pred), std::ref(proj));
- }
- first = std::move(mid);
- len *= 2;
- }
- }
-
-
- template<typename Rng, typename C, typename P = identity>
- auto RANGES_FUN_NIEBLOID(partition_point)(Rng && rng, C pred, P proj = P{})
- ->CPP_ret(safe_iterator_t<Rng>)(
- requires forward_range<Rng> &&
- indirect_unary_predicate<C, projected<iterator_t<Rng>, P>>)
- {
- if(RANGES_CONSTEXPR_IF(sized_range<Rng>))
- {
- auto len = distance(rng);
- return aux::partition_point_n(
- begin(rng), len, std::move(pred), std::move(proj));
- }
- return (*this)(begin(rng), end(rng), std::move(pred), std::move(proj));
- }
-
- RANGES_END_NIEBLOID(partition_point)
-
- namespace cpp20
- {
- using ranges::partition_point;
- }
-
- }
-
- #endif
|