mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-04-15 12:50:38 +00:00
5aaefa510e
libc++ has started splicing standard library headers into much more fine-grained content for maintainability. It's very likely that outdated and naive tooling (some of which is outside of LLVM's scope) will suggest users include things such as <__ranges/access.h> instead of <ranges>, and Hyrum's law suggests that users will eventually begin to rely on this without the help of tooling. As such, this commit intends to protect users from themselves, by making it a hard error for anyone outside of the standard library to include libc++ detail headers. Differential Revision: https://reviews.llvm.org/D106124
74 lines
2.3 KiB
C++
74 lines
2.3 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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_NEXT_PERMUTATION_H
|
|
#define _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
|
|
|
|
#include <__algorithm/comp.h>
|
|
#include <__algorithm/comp_ref_type.h>
|
|
#include <__algorithm/reverse.h>
|
|
#include <__config>
|
|
#include <__iterator/iterator_traits.h>
|
|
#include <__utility/swap.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
# pragma clang include_instead(<algorithm>)
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <class _Compare, class _BidirectionalIterator>
|
|
_LIBCPP_CONSTEXPR_AFTER_CXX17 bool
|
|
__next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
|
|
{
|
|
_BidirectionalIterator __i = __last;
|
|
if (__first == __last || __first == --__i)
|
|
return false;
|
|
while (true)
|
|
{
|
|
_BidirectionalIterator __ip1 = __i;
|
|
if (__comp(*--__i, *__ip1))
|
|
{
|
|
_BidirectionalIterator __j = __last;
|
|
while (!__comp(*__i, *--__j))
|
|
;
|
|
swap(*__i, *__j);
|
|
_VSTD::reverse(__ip1, __last);
|
|
return true;
|
|
}
|
|
if (__i == __first)
|
|
{
|
|
_VSTD::reverse(__first, __last);
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
|
|
template <class _BidirectionalIterator, class _Compare>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
bool
|
|
next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp)
|
|
{
|
|
typedef typename __comp_ref_type<_Compare>::type _Comp_ref;
|
|
return _VSTD::__next_permutation<_Comp_ref>(__first, __last, __comp);
|
|
}
|
|
|
|
template <class _BidirectionalIterator>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
bool
|
|
next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last)
|
|
{
|
|
return _VSTD::next_permutation(__first, __last,
|
|
__less<typename iterator_traits<_BidirectionalIterator>::value_type>());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_NEXT_PERMUTATION_H
|