73ebcabff2
- create the headers (but not include them from `<algorithm>`); - define the niebloid and its member functions with the right signatures (as no-ops); - make sure all the right headers are included that are required by each algorithm's signature; - update `CMakeLists.txt` and the module map; - create the test files with the appropriate synopses. The synopsis in `<algorithm>` is deliberately not updated because that could be taken as a readiness signal. The new headers aren't included from `<algorithm>` for the same reason. Differential Revision: https://reviews.llvm.org/D129549
82 lines
2.8 KiB
C++
82 lines
2.8 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_IF_H
|
|
#define _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_IF_H
|
|
|
|
#include <__algorithm/in_out_result.h>
|
|
#include <__algorithm/make_projected.h>
|
|
#include <__algorithm/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/iterator_traits.h>
|
|
#include <__iterator/projected.h>
|
|
#include <__ranges/access.h>
|
|
#include <__ranges/concepts.h>
|
|
#include <__ranges/dangling.h>
|
|
#include <__utility/forward.h>
|
|
#include <__utility/move.h>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
# pragma GCC system_header
|
|
#endif
|
|
|
|
#if _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
namespace ranges {
|
|
|
|
template <class _InIter, class _OutIter>
|
|
using replace_copy_if_result = in_out_result<_InIter, _OutIter>;
|
|
|
|
namespace __replace_copy_if {
|
|
|
|
struct __fn {
|
|
|
|
template <input_iterator _InIter, sentinel_for<_InIter> _Sent, class _Type, output_iterator<const _Type&> _OutIter,
|
|
class _Proj = identity, indirect_unary_predicate<projected<_InIter, _Proj>> _Pred>
|
|
requires indirectly_copyable<_InIter, _OutIter>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
replace_copy_if_result<_InIter, _OutIter>
|
|
operator()(_InIter __first, _Sent __last, _OutIter __result, _Pred __pred, const _Type& __new_value,
|
|
_Proj __proj = {}) const {
|
|
// TODO: implement
|
|
(void)__first; (void)__last; (void)__result; (void)__pred; (void)__new_value; (void)__proj;
|
|
return {};
|
|
}
|
|
|
|
template <input_range _Range, class _Type, output_iterator<const _Type&> _OutIter, class _Proj = identity,
|
|
indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
|
requires indirectly_copyable<iterator_t<_Range>, _OutIter>
|
|
_LIBCPP_HIDE_FROM_ABI constexpr
|
|
replace_copy_if_result<borrowed_iterator_t<_Range>, _OutIter>
|
|
operator()(_Range&& __range, _OutIter __result, _Pred __pred, const _Type& __new_value, _Proj __proj = {}) const {
|
|
// TODO: implement
|
|
(void)__range; (void)__result; (void)__pred; (void)__new_value; (void)__proj;
|
|
return {};
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace __replace_copy_if
|
|
|
|
inline namespace __cpo {
|
|
inline constexpr auto replace_copy_if = __replace_copy_if::__fn{};
|
|
} // namespace __cpo
|
|
} // namespace ranges
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
#endif // _LIBCPP_STD_VER > 17 && !defined(_LIBCPP_HAS_NO_INCOMPLETE_RANGES)
|
|
|
|
#endif // _LIBCPP___ALGORITHM_RANGES_REPLACE_COPY_IF_H
|