Page MenuHomePhabricator
Differential D129657 Diff 444407 libcxx/include/algorithm

Changeset View

Standalone View

View Options

libcxx/include/algorithm

Show First 20 Lines • Show All 706 Lines • ▼ Show 20 Lines template<input_range R1, input_range R2, class Pred = ranges::equal_to,
template<input_range R1, input_range R2, weakly_incrementable O, template<input_range R1, input_range R2, weakly_incrementable O,
class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity> class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2> requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>, constexpr set_symmetric_difference_result<borrowed_iterator_t<R1>,
borrowed_iterator_t<R2>, O> borrowed_iterator_t<R2>, O>
set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {}, set_symmetric_difference(R1&& r1, R2&& r2, O result, Comp comp = {},
Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
template<class I1, class I2, class O>
using set_union_result = in_in_out_result<I1, I2, O>; // since C++20
template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2,
weakly_incrementable O, class Comp = ranges::less,
class Proj1 = identity, class Proj2 = identity>
requires mergeable<I1, I2, O, Comp, Proj1, Proj2>
constexpr set_union_result<I1, I2, O>
set_union(I1 first1, S1 last1, I2 first2, S2 last2, O result, Comp comp = {},
Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
template<input_range R1, input_range R2, weakly_incrementable O,
class Comp = ranges::less, class Proj1 = identity, class Proj2 = identity>
requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
constexpr set_union_result<borrowed_iterator_t<R1>, borrowed_iterator_t<R2>, O>
set_union(R1&& r1, R2&& r2, O result, Comp comp = {},
Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
} }
constexpr bool // constexpr in C++20 constexpr bool // constexpr in C++20
all_of(InputIterator first, InputIterator last, Predicate pred); all_of(InputIterator first, InputIterator last, Predicate pred);
template <class InputIterator, class Predicate> template <class InputIterator, class Predicate>
constexpr bool // constexpr in C++20 constexpr bool // constexpr in C++20
any_of(InputIterator first, InputIterator last, Predicate pred); any_of(InputIterator first, InputIterator last, Predicate pred);
▲ Show 20 Lines • Show All 765 Lines • ▼ Show 20 Lines
#include <__algorithm/ranges_reverse.h> #include <__algorithm/ranges_reverse.h>
#include <__algorithm/ranges_reverse_copy.h> #include <__algorithm/ranges_reverse_copy.h>
#include <__algorithm/ranges_rotate_copy.h> #include <__algorithm/ranges_rotate_copy.h>
#include <__algorithm/ranges_search.h> #include <__algorithm/ranges_search.h>
#include <__algorithm/ranges_search_n.h> #include <__algorithm/ranges_search_n.h>
#include <__algorithm/ranges_set_difference.h> #include <__algorithm/ranges_set_difference.h>
#include <__algorithm/ranges_set_intersection.h> #include <__algorithm/ranges_set_intersection.h>
#include <__algorithm/ranges_set_symmetric_difference.h> #include <__algorithm/ranges_set_symmetric_difference.h>
#include <__algorithm/ranges_set_union.h>
#include <__algorithm/ranges_sort.h> #include <__algorithm/ranges_sort.h>
#include <__algorithm/ranges_sort_heap.h> #include <__algorithm/ranges_sort_heap.h>
#include <__algorithm/ranges_stable_sort.h> #include <__algorithm/ranges_stable_sort.h>
#include <__algorithm/ranges_swap_ranges.h> #include <__algorithm/ranges_swap_ranges.h>
#include <__algorithm/ranges_transform.h> #include <__algorithm/ranges_transform.h>
#include <__algorithm/ranges_upper_bound.h> #include <__algorithm/ranges_upper_bound.h>
#include <__algorithm/remove.h> #include <__algorithm/remove.h>
#include <__algorithm/remove_copy.h> #include <__algorithm/remove_copy.h>
▲ Show 20 Lines • Show All 50 Lines • Show Last 20 Lines