Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / include / __algorithm / ranges_partition.h
blobb9cc3c18937091bc314b27af79af1ef1651037ec
1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
9 #ifndef _LIBCPP___ALGORITHM_RANGES_PARTITION_H
10 #define _LIBCPP___ALGORITHM_RANGES_PARTITION_H
12 #include <__algorithm/iterator_operations.h>
13 #include <__algorithm/make_projected.h>
14 #include <__algorithm/partition.h>
15 #include <__algorithm/ranges_iterator_concept.h>
16 #include <__config>
17 #include <__functional/identity.h>
18 #include <__functional/invoke.h>
19 #include <__functional/ranges_operations.h>
20 #include <__iterator/concepts.h>
21 #include <__iterator/iterator_traits.h>
22 #include <__iterator/permutable.h>
23 #include <__iterator/projected.h>
24 #include <__ranges/access.h>
25 #include <__ranges/concepts.h>
26 #include <__ranges/subrange.h>
27 #include <__type_traits/remove_cvref.h>
28 #include <__utility/forward.h>
29 #include <__utility/move.h>
30 #include <__utility/pair.h>
32 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
33 # pragma GCC system_header
34 #endif
36 _LIBCPP_PUSH_MACROS
37 #include <__undef_macros>
39 #if _LIBCPP_STD_VER >= 20
41 _LIBCPP_BEGIN_NAMESPACE_STD
43 namespace ranges {
44 struct __partition {
45 template <class _Iter, class _Sent, class _Proj, class _Pred>
46 _LIBCPP_HIDE_FROM_ABI static constexpr subrange<__remove_cvref_t<_Iter>>
47 __partition_fn_impl(_Iter&& __first, _Sent&& __last, _Pred&& __pred, _Proj&& __proj) {
48 auto&& __projected_pred = std::__make_projected(__pred, __proj);
49 auto __result = std::__partition<_RangeAlgPolicy>(
50 std::move(__first), std::move(__last), __projected_pred, __iterator_concept<_Iter>());
52 return {std::move(__result.first), std::move(__result.second)};
55 template <permutable _Iter,
56 sentinel_for<_Iter> _Sent,
57 class _Proj = identity,
58 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred>
59 _LIBCPP_HIDE_FROM_ABI constexpr subrange<_Iter>
60 operator()(_Iter __first, _Sent __last, _Pred __pred, _Proj __proj = {}) const {
61 return __partition_fn_impl(__first, __last, __pred, __proj);
64 template <forward_range _Range,
65 class _Proj = identity,
66 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
67 requires permutable<iterator_t<_Range>>
68 _LIBCPP_HIDE_FROM_ABI constexpr borrowed_subrange_t<_Range>
69 operator()(_Range&& __range, _Pred __pred, _Proj __proj = {}) const {
70 return __partition_fn_impl(ranges::begin(__range), ranges::end(__range), __pred, __proj);
74 inline namespace __cpo {
75 inline constexpr auto partition = __partition{};
76 } // namespace __cpo
77 } // namespace ranges
79 _LIBCPP_END_NAMESPACE_STD
81 #endif // _LIBCPP_STD_VER >= 20
83 _LIBCPP_POP_MACROS
85 #endif // _LIBCPP___ALGORITHM_RANGES_PARTITION_H