156ab87500
See: * https://discourse.llvm.org/t/rfc-freezing-c-03-headers-in-libc/77319 * https://discourse.llvm.org/t/rfc-project-hand-in-hand-llvm-libc-libc-code-sharing/77701 We're dropping support for C++03 for Zig due to the first change; it would be insane to ship 1018 duplicate header files just for this outdated use case. As a result of the second change, I had to bring in a subset of the headers from llvm-libc since libc++ now depends on these. Hopefully we can continue to get away with not copying the entirety of llvm-libc.
75 lines
2.6 KiB
C++
Vendored
75 lines
2.6 KiB
C++
Vendored
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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_PREV_PERMUTATION_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_PREV_PERMUTATION_H
|
|
|
|
#include <__algorithm/in_found_result.h>
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__algorithm/make_projected.h>
|
|
#include <__algorithm/prev_permutation.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/sortable.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/move.h>
|
|
#include <__utility/pair.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
|
|
template <class _InIter>
|
|
using prev_permutation_result = in_found_result<_InIter>;
|
|
|
|
struct __prev_permutation {
|
|
template <bidirectional_iterator _Iter, sentinel_for<_Iter> _Sent, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<_Iter, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr prev_permutation_result<_Iter>
|
|
operator()(_Iter __first, _Sent __last, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
auto __result = std::__prev_permutation<_RangeAlgPolicy>(
|
|
std::move(__first), std::move(__last), std::__make_projected(__comp, __proj));
|
|
return {std::move(__result.first), std::move(__result.second)};
|
|
}
|
|
|
|
template <bidirectional_range _Range, class _Comp = ranges::less, class _Proj = identity>
|
|
requires sortable<iterator_t<_Range>, _Comp, _Proj>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr prev_permutation_result<borrowed_iterator_t<_Range>>
|
|
operator()(_Range&& __range, _Comp __comp = {}, _Proj __proj = {}) const {
|
|
auto __result = std::__prev_permutation<_RangeAlgPolicy>(
|
|
ranges::begin(__range), ranges::end(__range), std::__make_projected(__comp, __proj));
|
|
return {std::move(__result.first), std::move(__result.second)};
|
|
}
|
|
};
|
|
|
|
inline namespace __cpo {
|
|
constexpr inline auto prev_permutation = __prev_permutation{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_PREV_PERMUTATION_H
|