Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[libc++] Implement ranges::is_sorted{, _until}
Reviewed By: Mordante, var-const, #libc Spies: libcxx-commits, mgorny Differential Revision: https://reviews.llvm.org/D125608
- Loading branch information
1 parent
3a7a465
commit 11e3ad2
Showing
13 changed files
with
574 additions
and
12 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,61 @@ | ||
//===----------------------------------------------------------------------===// | ||
// | ||
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | ||
// See https://llvm.org/LICENSE.txt for license information. | ||
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | ||
// | ||
//===----------------------------------------------------------------------===// | ||
|
||
#ifndef _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H | ||
#define _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H | ||
|
||
#include <__algorithm/ranges_is_sorted_until.h> | ||
#include <__config> | ||
#include <__functional/identity.h> | ||
#include <__functional/ranges_operations.h> | ||
#include <__iterator/concepts.h> | ||
#include <__iterator/projected.h> | ||
#include <__ranges/access.h> | ||
#include <__ranges/concepts.h> | ||
#include <__utility/move.h> | ||
|
||
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) | ||
# pragma GCC system_header | ||
#endif | ||
|
||
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) | ||
|
||
_LIBCPP_BEGIN_NAMESPACE_STD | ||
|
||
namespace ranges { | ||
namespace __is_sorted { | ||
struct __fn { | ||
template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, | ||
class _Proj = identity, | ||
indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less> | ||
_LIBCPP_HIDE_FROM_ABI constexpr | ||
bool operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { | ||
return ranges::__is_sorted_until_impl(std::move(__first), __last, __comp, __proj) == __last; | ||
} | ||
|
||
template <forward_range _Range, | ||
class _Proj = identity, | ||
indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less> | ||
_LIBCPP_HIDE_FROM_ABI constexpr | ||
bool operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { | ||
auto __last = ranges::end(__range); | ||
return ranges::__is_sorted_until_impl(ranges::begin(__range), __last, __comp, __proj) == __last; | ||
} | ||
}; | ||
} // namespace __is_sorted | ||
|
||
inline namespace __cpo { | ||
inline constexpr auto is_sorted = __is_sorted::__fn{}; | ||
} // namespace __cpo | ||
} // namespace ranges | ||
|
||
_LIBCPP_END_NAMESPACE_STD | ||
|
||
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) | ||
|
||
#endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_H |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,76 @@ | ||
//===----------------------------------------------------------------------===// | ||
// | ||
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | ||
// See https://llvm.org/LICENSE.txt for license information. | ||
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | ||
// | ||
//===----------------------------------------------------------------------===// | ||
|
||
#ifndef _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H | ||
#define _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H | ||
|
||
#include <__config> | ||
#include <__functional/identity.h> | ||
#include <__functional/invoke.h> | ||
#include <__functional/ranges_operations.h> | ||
#include <__iterator/concepts.h> | ||
#include <__iterator/projected.h> | ||
#include <__ranges/access.h> | ||
#include <__ranges/concepts.h> | ||
#include <__ranges/dangling.h> | ||
#include <__utility/move.h> | ||
|
||
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) | ||
# pragma GCC system_header | ||
#endif | ||
|
||
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) | ||
|
||
_LIBCPP_BEGIN_NAMESPACE_STD | ||
|
||
namespace ranges { | ||
|
||
template <class _Iter, class _Sent, class _Proj, class _Comp> | ||
_LIBCPP_HIDE_FROM_ABI constexpr | ||
_Iter __is_sorted_until_impl(_Iter __first, _Sent __last, _Comp& __comp, _Proj& __proj) { | ||
if (__first == __last) | ||
return __first; | ||
auto __i = __first; | ||
while (++__i != __last) { | ||
if (std::invoke(__comp, std::invoke(__proj, *__i), std::invoke(__proj, *__first))) | ||
return __i; | ||
__first = __i; | ||
} | ||
return __i; | ||
} | ||
|
||
namespace __is_sorted_until { | ||
struct __fn { | ||
template <forward_iterator _Iter, sentinel_for<_Iter> _Sent, | ||
class _Proj = identity, | ||
indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less> | ||
_LIBCPP_HIDE_FROM_ABI constexpr | ||
_Iter operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const { | ||
return ranges::__is_sorted_until_impl(std::move(__first), std::move(__last), __comp, __proj); | ||
} | ||
|
||
template <forward_range _Range, | ||
class _Proj = identity, | ||
indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less> | ||
_LIBCPP_HIDE_FROM_ABI constexpr | ||
borrowed_iterator_t<_Range> operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const { | ||
return ranges::__is_sorted_until_impl(ranges::begin(__range), ranges::end(__range), __comp, __proj); | ||
} | ||
}; | ||
} // namespace __is_sorted_until | ||
|
||
inline namespace __cpo { | ||
inline constexpr auto is_sorted_until = __is_sorted_until::__fn{}; | ||
} // namespace __cpo | ||
} // namespace ranges | ||
|
||
_LIBCPP_END_NAMESPACE_STD | ||
|
||
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES) | ||
|
||
#endif // _LIBCPP__ALGORITHM_RANGES_IS_SORTED_UNTIL_H |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.