Lines Matching refs:pred
74 …mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2…
80 …mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) …
92 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
97 …find_if(R&& r, Pred pred, Proj proj = {}); …
101 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
106 …find_if_not(R&& r, Pred pred, Proj proj = {}); …
119 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
123 …constexpr borrowed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); …
127 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
131 …constexpr borrowed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); …
209 …count_if(I first, S last, Pred pred, Proj proj = {}); …
214 …count_if(R&& r, Pred pred, Proj proj = {}); …
253 … Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
258 constexpr bool contains_subrange(R1&& r1, R2&& r2, Pred pred = {},
298 …ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++…
304 …ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++…
339 …constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C…
343 …constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C…
481 Pred pred = {},
487 constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
492 …constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C…
496 …constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C…
500 …constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C…
504 …constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C…
511 constexpr bool ranges::ends_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
519 constexpr bool ranges::ends_with(R1&& r1, R2&& r2, Pred pred = {},
524 …constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C…
528 …constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C…
533 constexpr bool ranges::starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
539 constexpr bool ranges::starts_with(R1&& r1, R2&& r2, Pred pred = {},
623 …partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
629 …partition(R&& r, Pred pred, Proj proj = {}); // since C++…
635 …stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
641 …stable_partition(R&& r, Pred pred, Proj proj = {}); // since C++…
647 Pred pred = {},
655 Pred pred = {},
661 …constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C…
666 …constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); //…
683 …constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); //…
689 …ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // s…
746 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
755 …partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // s…
759 …constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); //…
764 …partition_point(R&& r, Pred pred, Proj proj = {}); // s…
796 …constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); //…
802 …ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // s…
901 Pred pred = {},
908 constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
916 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
923 ranges::search(R1&& r1, R2&& r2, Pred pred = {},
931 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
938 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
961 ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
968 ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
1097 …remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // si…
1103 …remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // si…
1132 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1139 replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
1176 all_of(InputIterator first, InputIterator last, Predicate pred);
1180 any_of(InputIterator first, InputIterator last, Predicate pred);
1184 none_of(InputIterator first, InputIterator last, Predicate pred);
1200 find_if(InputIterator first, InputIterator last, Predicate pred);
1204 find_if_not(InputIterator first, InputIterator last, Predicate pred);
1214 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1224 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1232 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1240 count_if(InputIterator first, InputIterator last, Predicate pred);
1254 InputIterator2 first2, BinaryPredicate pred);
1260 … BinaryPredicate pred); // since C++14, constexpr since C++20
1274 InputIterator2 first2, BinaryPredicate pred);
1280 …BinaryPredicate pred); // since C++14, constexpr since C++20
1295 ForwardIterator2 first2, BinaryPredicate pred);
1301 … BinaryPredicate pred); // since C++14, constexpr since C++20
1311 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1320 Size count, const T& value, BinaryPredicate pred);
1329 OutputIterator result, Predicate pred);
1388 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1397 …replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, co…
1421 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1429 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1437 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1445 … unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1494 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1498 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1505 Predicate pred);
1509 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1513 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);