mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-05-17 03:16:35 +00:00
4c19854222
In preparation for running clang-format on the whole code base, we are also removing mentions of the legacy _LIBCPP_INLINE_VISIBILITY macro in favor of the newer _LIBCPP_HIDE_FROM_ABI. We're still leaving the definition of _LIBCPP_INLINE_VISIBILITY to avoid creating needless breakage in case some older patches are checked-in with mentions of the old macro. After we branch for LLVM 18, we can do another pass to clean up remaining uses of the macro that might have gotten introduced by mistake (if any) and remove the macro itself at the same time. This is just a minor convenience to smooth out the transition as much as possible. See https://discourse.llvm.org/t/rfc-clang-formatting-all-of-libc-once-and-for-all for the clang-format proposal.
61 lines
2.2 KiB
C++
61 lines
2.2 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_SWAP_RANGES_H
|
|
#define _LIBCPP___ALGORITHM_SWAP_RANGES_H
|
|
|
|
#include <__algorithm/iterator_operations.h>
|
|
#include <__config>
|
|
#include <__utility/move.h>
|
|
#include <__utility/pair.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
// 2+2 iterators: the shorter size will be used.
|
|
template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2, class _Sentinel2>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
|
|
pair<_ForwardIterator1, _ForwardIterator2>
|
|
__swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) {
|
|
while (__first1 != __last1 && __first2 != __last2) {
|
|
_IterOps<_AlgPolicy>::iter_swap(__first1, __first2);
|
|
++__first1;
|
|
++__first2;
|
|
}
|
|
|
|
return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2));
|
|
}
|
|
|
|
// 2+1 iterators: size2 >= size1.
|
|
template <class _AlgPolicy, class _ForwardIterator1, class _Sentinel1, class _ForwardIterator2>
|
|
_LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20
|
|
pair<_ForwardIterator1, _ForwardIterator2>
|
|
__swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) {
|
|
while (__first1 != __last1) {
|
|
_IterOps<_AlgPolicy>::iter_swap(__first1, __first2);
|
|
++__first1;
|
|
++__first2;
|
|
}
|
|
|
|
return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2));
|
|
}
|
|
|
|
template <class _ForwardIterator1, class _ForwardIterator2>
|
|
inline _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator2
|
|
swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) {
|
|
return std::__swap_ranges<_ClassicAlgPolicy>(
|
|
std::move(__first1), std::move(__last1), std::move(__first2)).second;
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP___ALGORITHM_SWAP_RANGES_H
|