Revert "[libc] Use best-fit binary trie to make malloc logarithmic" (#117065)
[llvm-project.git] / libcxx / include / __algorithm / is_partitioned.h
blob700e452bbfa63f6a86e77b7bc0de6740e03fc9f8
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_PARTITIONED_H
10 #define _LIBCPP___ALGORITHM_IS_PARTITIONED_H
12 #include <__config>
14 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
15 # pragma GCC system_header
16 #endif
18 _LIBCPP_BEGIN_NAMESPACE_STD
20 template <class _InputIterator, class _Predicate>
21 [[__nodiscard__]] _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 bool
22 is_partitioned(_InputIterator __first, _InputIterator __last, _Predicate __pred) {
23 for (; __first != __last; ++__first)
24 if (!__pred(*__first))
25 break;
26 if (__first == __last)
27 return true;
28 ++__first;
29 for (; __first != __last; ++__first)
30 if (__pred(*__first))
31 return false;
32 return true;
35 _LIBCPP_END_NAMESPACE_STD
37 #endif // _LIBCPP___ALGORITHM_IS_PARTITIONED_H