mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2025-05-17 11:26:37 +00:00
02540b2f6d
Before this patch, we would fail to implicitly convert the result of predicates to bool, which means we'd potentially perform a copy or move construction of the boolean-testable, which isn't allowed. The same holds true for comparing iterators against sentinels, which is allowed to return a boolean-testable type. We already had tests aiming to ensure correct handling of these types, but they failed to provide appropriate coverage in several cases due to guaranteed RVO. This patch fixes the tests, adds tests for missing algorithms and views, and fixes the actual problems in the code. Fixes #69074
89 lines
3.1 KiB
C++
89 lines
3.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_RANGES_REPLACE_COPY_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_H
|
|
|
|
#include <__algorithm/in_out_result.h>
|
|
#include <__algorithm/ranges_replace_copy_if.h>
|
|
#include <__config>
|
|
#include <__functional/identity.h>
|
|
#include <__functional/invoke.h>
|
|
#include <__functional/ranges_operations.h>
|
|
#include <__iterator/concepts.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
#if _LIBCPP_STD_VER >= 20
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
|
|
template <class _InIter, class _OutIter>
|
|
using replace_copy_result = in_out_result<_InIter, _OutIter>;
|
|
|
|
namespace __replace_copy {
|
|
|
|
struct __fn {
|
|
template <input_iterator _InIter,
|
|
sentinel_for<_InIter> _Sent,
|
|
class _OldType,
|
|
class _NewType,
|
|
output_iterator<const _NewType&> _OutIter,
|
|
class _Proj = identity>
|
|
requires indirectly_copyable<_InIter, _OutIter> &&
|
|
indirect_binary_predicate<ranges::equal_to, projected<_InIter, _Proj>, const _OldType*>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr replace_copy_result<_InIter, _OutIter>
|
|
operator()(_InIter __first,
|
|
_Sent __last,
|
|
_OutIter __result,
|
|
const _OldType& __old_value,
|
|
const _NewType& __new_value,
|
|
_Proj __proj = {}) const {
|
|
auto __pred = [&](const auto& __value) -> bool { return __value == __old_value; };
|
|
return ranges::__replace_copy_if_impl(
|
|
std::move(__first), std::move(__last), std::move(__result), __pred, __new_value, __proj);
|
|
}
|
|
|
|
template <input_range _Range,
|
|
class _OldType,
|
|
class _NewType,
|
|
output_iterator<const _NewType&> _OutIter,
|
|
class _Proj = identity>
|
|
requires indirectly_copyable<iterator_t<_Range>, _OutIter> &&
|
|
indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _OldType*>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr replace_copy_result<borrowed_iterator_t<_Range>, _OutIter> operator()(
|
|
_Range&& __range, _OutIter __result, const _OldType& __old_value, const _NewType& __new_value, _Proj __proj = {})
|
|
const {
|
|
auto __pred = [&](const auto& __value) -> bool { return __value == __old_value; };
|
|
return ranges::__replace_copy_if_impl(
|
|
ranges::begin(__range), ranges::end(__range), std::move(__result), __pred, __new_value, __proj);
|
|
}
|
|
};
|
|
|
|
} // namespace __replace_copy
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto replace_copy = __replace_copy::__fn{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER >= 20
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_H
|