Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / include / __algorithm / is_sorted_until.h
blobb64fb65e84e4ec243e0c2567c7cd0b5d8641a558
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_IS_SORTED_UNTIL_H
10 #define _LIBCPP___ALGORITHM_IS_SORTED_UNTIL_H
12 #include <__algorithm/comp.h>
13 #include <__algorithm/comp_ref_type.h>
14 #include <__config>
15 #include <__iterator/iterator_traits.h>
17 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
18 # pragma GCC system_header
19 #endif
21 _LIBCPP_BEGIN_NAMESPACE_STD
23 template <class _Compare, class _ForwardIterator>
24 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
25 __is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) {
26 if (__first != __last) {
27 _ForwardIterator __i = __first;
28 while (++__i != __last) {
29 if (__comp(*__i, *__first))
30 return __i;
31 __first = __i;
34 return __last;
37 template <class _ForwardIterator, class _Compare>
38 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
39 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) {
40 return std::__is_sorted_until<__comp_ref_type<_Compare> >(__first, __last, __comp);
43 template <class _ForwardIterator>
44 [[__nodiscard__]] inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
45 is_sorted_until(_ForwardIterator __first, _ForwardIterator __last) {
46 return std::is_sorted_until(__first, __last, __less<>());
49 _LIBCPP_END_NAMESPACE_STD
51 #endif // _LIBCPP___ALGORITHM_IS_SORTED_UNTIL_H