aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/libs/cxxsupp/libcxx/include/algorithm
diff options
context:
space:
mode:
authormikhnenko <mikhnenko@yandex-team.com>2023-10-16 00:19:28 +0300
committermikhnenko <mikhnenko@yandex-team.com>2023-10-16 00:40:55 +0300
commit03562c20be10d96a02cbd83773bf2f3a17c70142 (patch)
tree3762df6744c5c017b011997a08aeb20d2f92f1a5 /contrib/libs/cxxsupp/libcxx/include/algorithm
parent6851965da19965a2680cfea6815b486fb14e739d (diff)
downloadydb-03562c20be10d96a02cbd83773bf2f3a17c70142.tar.gz
Revert commit rXXXXXX, Upd libc++ to 18 May 4ac0589122830fc6d90e0ea091300c0b979a42dc
Diffstat (limited to 'contrib/libs/cxxsupp/libcxx/include/algorithm')
-rw-r--r--contrib/libs/cxxsupp/libcxx/include/algorithm30
1 files changed, 0 insertions, 30 deletions
diff --git a/contrib/libs/cxxsupp/libcxx/include/algorithm b/contrib/libs/cxxsupp/libcxx/include/algorithm
index c30e3a6ce97..a86e4664502 100644
--- a/contrib/libs/cxxsupp/libcxx/include/algorithm
+++ b/contrib/libs/cxxsupp/libcxx/include/algorithm
@@ -238,33 +238,6 @@ namespace ranges {
requires indirectly_copyable<iterator_t<R>, I>
constexpr ranges::copy_backward_result<borrowed_iterator_t<R>, I>
ranges::copy_backward(R&& r, I result); // since C++20
-
- template<class I, class F>
- using for_each_result = in_fun_result<I, F>; // since C++20
-
- template<input_iterator I, sentinel_for<I> S, class Proj = identity,
- indirectly_unary_invocable<projected<I, Proj>> Fun>
- constexpr ranges::for_each_result<I, Fun>
- ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
-
- template<input_range R, class Proj = identity,
- indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
- constexpr ranges::for_each_result<borrowed_iterator_t<R>, Fun>
- ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20
-
- template<input_iterator I, class Proj = identity,
- indirectly_unary_invocable<projected<I, Proj>> Fun>
- constexpr ranges::for_each_n_result<I, Fun>
- ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
-
- template<input_iterator I, sentinel_for<I> S, class Proj = identity,
- indirect_unary_predicate<projected<I, Proj>> Pred>
- constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
-
- template<input_range R, class Proj = identity,
- indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
- constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20
-
}
constexpr bool // constexpr in C++20
@@ -990,9 +963,6 @@ template <class BidirectionalIterator, class Compare>
#include <__algorithm/ranges_find.h>
#include <__algorithm/ranges_find_if.h>
#include <__algorithm/ranges_find_if_not.h>
-#include <__algorithm/ranges_for_each.h>
-#include <__algorithm/ranges_for_each_n.h>
-#include <__algorithm/ranges_is_partitioned.h>
#include <__algorithm/ranges_max.h>
#include <__algorithm/ranges_max_element.h>
#include <__algorithm/ranges_min.h>