Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / include / __algorithm / ranges_inplace_merge.h
blob5879d0e7ef0fbebed4ace40978d8aab77afc4636
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_INPLACE_MERGE_H
10 #define _LIBCPP___ALGORITHM_RANGES_INPLACE_MERGE_H
12 #include <__algorithm/inplace_merge.h>
13 #include <__algorithm/iterator_operations.h>
14 #include <__algorithm/make_projected.h>
15 #include <__config>
16 #include <__functional/identity.h>
17 #include <__functional/invoke.h>
18 #include <__functional/ranges_operations.h>
19 #include <__iterator/concepts.h>
20 #include <__iterator/iterator_traits.h>
21 #include <__iterator/next.h>
22 #include <__iterator/projected.h>
23 #include <__iterator/sortable.h>
24 #include <__ranges/access.h>
25 #include <__ranges/concepts.h>
26 #include <__ranges/dangling.h>
27 #include <__utility/forward.h>
28 #include <__utility/move.h>
30 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
31 # pragma GCC system_header
32 #endif
34 _LIBCPP_PUSH_MACROS
35 #include <__undef_macros>
37 #if _LIBCPP_STD_VER >= 20
39 _LIBCPP_BEGIN_NAMESPACE_STD
41 namespace ranges {
42 struct __inplace_merge {
43 template <class _Iter, class _Sent, class _Comp, class _Proj>
44 _LIBCPP_HIDE_FROM_ABI static constexpr auto
45 __inplace_merge_impl(_Iter __first, _Iter __middle, _Sent __last, _Comp&& __comp, _Proj&& __proj) {
46 auto __last_iter = ranges::next(__middle, __last);
47 std::__inplace_merge<_RangeAlgPolicy>(
48 std::move(__first), std::move(__middle), __last_iter, std::__make_projected(__comp, __proj));
49 return __last_iter;
52 template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
53 requires sortable<_Iter, _Comp, _Proj>
54 _LIBCPP_HIDE_FROM_ABI _Iter
55 operator()(_Iter __first, _Iter __middle, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
56 return __inplace_merge_impl(
57 std::move(__first), std::move(__middle), std::move(__last), std::move(__comp), std::move(__proj));
60 template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
61 requires sortable<iterator_t<_Range>, _Comp, _Proj>
62 _LIBCPP_HIDE_FROM_ABI borrowed_iterator_t<_Range>
63 operator()(_Range&& __range, iterator_t<_Range> __middle, _Comp __comp = {}, _Proj __proj = {}) const {
64 return __inplace_merge_impl(
65 ranges::begin(__range), std::move(__middle), ranges::end(__range), std::move(__comp), std::move(__proj));
69 inline namespace __cpo {
70 inline constexpr auto inplace_merge = __inplace_merge{};
71 } // namespace __cpo
72 } // namespace ranges
74 _LIBCPP_END_NAMESPACE_STD
76 #endif // _LIBCPP_STD_VER >= 20
78 _LIBCPP_POP_MACROS
80 #endif // _LIBCPP___ALGORITHM_RANGES_INPLACE_MERGE_H