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 = {}); …
181 …count_if(I first, S last, Pred pred, Proj proj = {}); …
186 …count_if(R&& r, Pred pred, Proj proj = {}); …
257 …ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++…
263 …ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++…
295 …constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C…
299 …constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C…
436 Pred pred = {},
442 constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {},
447 …constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C…
451 …constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C…
455 …constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C…
459 …constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C…
466 constexpr bool ranges::ends_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
474 constexpr bool ranges::ends_with(R1&& r1, R2&& r2, Pred pred = {},
479 …constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C…
483 …constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C…
488 constexpr bool ranges::starts_with(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
494 constexpr bool ranges::starts_with(R1&& r1, R2&& r2, Pred pred = {},
578 …partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
584 …partition(R&& r, Pred pred, Proj proj = {}); // since C++…
589 …subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C…
594 …borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // since C…
600 Pred pred = {},
608 Pred pred = {},
614 …constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C…
619 …constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); //…
636 …constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); //…
642 …ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // s…
693 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
702 …partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // s…
706 …constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); //…
711 …partition_point(R&& r, Pred pred, Proj proj = {}); // s…
743 …constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); //…
749 …ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // s…
848 Pred pred = {},
855 constexpr bool ranges::is_permutation(R1&& r1, R2&& r2, Pred pred = {},
863 ranges::search(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
870 ranges::search(R1&& r1, R2&& r2, Pred pred = {},
878 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
885 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
908 ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
915 ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
1043 …remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // si…
1049 …remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // si…
1078 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1085 replace_copy_if(R&& r, O result, Pred pred, const T& new_value,
1122 all_of(InputIterator first, InputIterator last, Predicate pred);
1126 any_of(InputIterator first, InputIterator last, Predicate pred);
1130 none_of(InputIterator first, InputIterator last, Predicate pred);
1146 find_if(InputIterator first, InputIterator last, Predicate pred);
1150 find_if_not(InputIterator first, InputIterator last, Predicate pred);
1160 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1170 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1178 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1186 count_if(InputIterator first, InputIterator last, Predicate pred);
1200 InputIterator2 first2, BinaryPredicate pred);
1206 BinaryPredicate pred); // **C++14**
1220 InputIterator2 first2, BinaryPredicate pred);
1226 BinaryPredicate pred); // **C++14**
1241 ForwardIterator2 first2, BinaryPredicate pred);
1247 BinaryPredicate pred); // **C++14**
1257 ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred);
1266 Size count, const T& value, BinaryPredicate pred);
1275 OutputIterator result, Predicate pred);
1334 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1343 …replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, co…
1367 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1375 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1383 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1391 … unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1440 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1444 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1451 Predicate pred);
1455 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1459 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);