e78f53d1e8
This reverts commit 68c04b0ae62d8431d72d8b47fc13008002ee4387. This disables the IWYU mapping that caused the failure, since the headers aren't reachable for now. This is the first part of the "Freezing C++03 headers" proposal explained in https://discourse.llvm.org/t/rfc-freezing-c-03-headers-in-libc/77319/58. This patch mechanically copies the headers as of the LLVM 19.1 release into a subdirectory of libc++ so that we can start using these headers when building in C++03 mode. We are going to be backporting important changes to that copy of the headers until the LLVM 21 release. After the LLVM 21 release, only critical bugfixes will be fixed in the C++03 copy of the headers. This patch only performs a copy of the headers -- these headers are still unused by the rest of the codebase.
65 lines
2.1 KiB
C++
65 lines
2.1 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_H
|
|
#define _LIBCPP___ALGORITHM_UNIQUE_H
|
|
|
|
#include <__algorithm/adjacent_find.h>
|
|
#include <__algorithm/comp.h>
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__config>
|
|
#include <__iterator/iterator_traits.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>
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
// unique
|
|
|
|
template <class _AlgPolicy, class _Iter, class _Sent, class _BinaryPredicate>
|
|
_LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 std::pair<_Iter, _Iter>
|
|
__unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) {
|
|
__first = std::__adjacent_find(__first, __last, __pred);
|
|
if (__first != __last) {
|
|
// ... a a ? ...
|
|
// f i
|
|
_Iter __i = __first;
|
|
for (++__i; ++__i != __last;)
|
|
if (!__pred(*__first, *__i))
|
|
*++__first = _IterOps<_AlgPolicy>::__iter_move(__i);
|
|
++__first;
|
|
return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i));
|
|
}
|
|
return std::pair<_Iter, _Iter>(__first, __first);
|
|
}
|
|
|
|
template <class _ForwardIterator, class _BinaryPredicate>
|
|
_LIBCPP_NODISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
|
|
unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __pred) {
|
|
return std::__unique<_ClassicAlgPolicy>(std::move(__first), std::move(__last), __pred).first;
|
|
}
|
|
|
|
template <class _ForwardIterator>
|
|
_LIBCPP_NODISCARD inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator
|
|
unique(_ForwardIterator __first, _ForwardIterator __last) {
|
|
return std::unique(__first, __last, __equal_to());
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP___ALGORITHM_UNIQUE_H
|