Lines Matching refs:pred
71 …mismatch()(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2…
77 …mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) …
89 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
94 …find_if(R&& r, Pred pred, Proj proj = {}); …
98 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
103 …find_if_not(R&& r, Pred pred, Proj proj = {}); …
116 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
120 …constexpr borrowed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); …
124 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
128 …constexpr borrowed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); …
206 …count_if(I first, S last, Pred pred, Proj proj = {}); …
211 …count_if(R&& r, Pred pred, Proj proj = {}); …
250 … Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
255 constexpr bool contains_subrange(R1&& r1, R2&& r2, Pred pred = {},
295 …ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++…
301 …ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++…
333 …constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C…
337 …constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C…
474 Pred pred = {},
480 constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
485 …constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C…
489 …constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C…
493 …constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C…
497 …constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C…
504 constexpr bool ranges::ends_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
512 constexpr bool ranges::ends_with(R1&& r1, R2&& r2, Pred pred = {},
517 …constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C…
521 …constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C…
526 constexpr bool ranges::starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
532 constexpr bool ranges::starts_with(R1&& r1, R2&& r2, Pred pred = {},
616 …partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
622 …partition(R&& r, Pred pred, Proj proj = {}); // since C++…
627 …subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C…
632 …borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // since C…
638 Pred pred = {},
646 Pred pred = {},
652 …constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C…
657 …constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); //…
674 …constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); //…
680 …ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // s…
731 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
740 …partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // s…
744 …constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); //…
749 …partition_point(R&& r, Pred pred, Proj proj = {}); // s…
781 …constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); //…
787 …ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // s…
886 Pred pred = {},
893 constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
901 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
908 ranges::search(R1&& r1, R2&& r2, Pred pred = {},
916 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
923 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
946 ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
953 ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
1081 …remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // si…
1087 …remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // si…
1116 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1123 replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
1160 all_of(InputIterator first, InputIterator last, Predicate pred);
1164 any_of(InputIterator first, InputIterator last, Predicate pred);
1168 none_of(InputIterator first, InputIterator last, Predicate pred);
1184 find_if(InputIterator first, InputIterator last, Predicate pred);
1188 find_if_not(InputIterator first, InputIterator last, Predicate pred);
1198 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1208 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1216 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1224 count_if(InputIterator first, InputIterator last, Predicate pred);
1238 InputIterator2 first2, BinaryPredicate pred);
1244 BinaryPredicate pred); // **C++14**
1258 InputIterator2 first2, BinaryPredicate pred);
1264 BinaryPredicate pred); // **C++14**
1279 ForwardIterator2 first2, BinaryPredicate pred);
1285 BinaryPredicate pred); // **C++14**
1295 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1304 Size count, const T& value, BinaryPredicate pred);
1313 OutputIterator result, Predicate pred);
1372 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1381 …replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, co…
1405 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1413 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1421 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1429 … unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1478 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1482 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1489 Predicate pred);
1493 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1497 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);