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
108 lines
3.5 KiB
C++
108 lines
3.5 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_UNIQUE_COPY_H
|
|
#define _LIBCPP___ALGORITHM_UNIQUE_COPY_H
|
|
|
|
#include <__algorithm/comp.h>
|
|
#include <__config>
|
|
#include <__iterator/iterator_traits.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 _BinaryPredicate, class _InputIterator, class _OutputIterator>
|
|
_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator
|
|
__unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred,
|
|
input_iterator_tag, output_iterator_tag)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
typename iterator_traits<_InputIterator>::value_type __t(*__first);
|
|
*__result = __t;
|
|
++__result;
|
|
while (++__first != __last)
|
|
{
|
|
if (!__pred(__t, *__first))
|
|
{
|
|
__t = *__first;
|
|
*__result = __t;
|
|
++__result;
|
|
}
|
|
}
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
template <class _BinaryPredicate, class _ForwardIterator, class _OutputIterator>
|
|
_LIBCPP_CONSTEXPR_AFTER_CXX17 _OutputIterator
|
|
__unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __pred,
|
|
forward_iterator_tag, output_iterator_tag)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
_ForwardIterator __i = __first;
|
|
*__result = *__i;
|
|
++__result;
|
|
while (++__first != __last)
|
|
{
|
|
if (!__pred(*__i, *__first))
|
|
{
|
|
*__result = *__first;
|
|
++__result;
|
|
__i = __first;
|
|
}
|
|
}
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
template <class _BinaryPredicate, class _InputIterator, class _ForwardIterator>
|
|
_LIBCPP_CONSTEXPR_AFTER_CXX17 _ForwardIterator
|
|
__unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __pred,
|
|
input_iterator_tag, forward_iterator_tag)
|
|
{
|
|
if (__first != __last)
|
|
{
|
|
*__result = *__first;
|
|
while (++__first != __last)
|
|
if (!__pred(*__result, *__first))
|
|
*++__result = *__first;
|
|
++__result;
|
|
}
|
|
return __result;
|
|
}
|
|
|
|
template <class _InputIterator, class _OutputIterator, class _BinaryPredicate>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_OutputIterator
|
|
unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __pred)
|
|
{
|
|
return _VSTD::__unique_copy<_BinaryPredicate&>(__first, __last, __result, __pred,
|
|
typename iterator_traits<_InputIterator>::iterator_category(),
|
|
typename iterator_traits<_OutputIterator>::iterator_category());
|
|
}
|
|
|
|
template <class _InputIterator, class _OutputIterator>
|
|
inline _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR_AFTER_CXX17
|
|
_OutputIterator
|
|
unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result)
|
|
{
|
|
typedef typename iterator_traits<_InputIterator>::value_type __v;
|
|
return _VSTD::unique_copy(__first, __last, __result, __equal_to<__v>());
|
|
}
|
|
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_UNIQUE_COPY_H
|