Lines Matching full:first
50 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
58 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
80 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20
89 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
98 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20
107 constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); // since C++23
116 constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); // since C++23
124 constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++23
196 count(I first, S last, const T& value, Proj proj = {}); // since C++20
206 count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
238 minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
272 constexpr bool ranges::contains(I first, S last, const T& value, Proj proj = {}); // since C++23
280 constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20
289 ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20
295 ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
306 ranges::copy_backward(I1 first, S1 last, I2 result); // since C++20
319 ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
329 ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
333 constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
343 ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
354 ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
365 ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
376 ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
385 constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
393 constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
402 constexpr I ranges::reverse(I first, S last); // since C++20
412 ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
422 I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
433 ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
441 constexpr O ranges::fill(O first, S last, const T& value); // since C++20
447 constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20
451 constexpr O generate(O first, S last, F gen); // since C++20
455 ForwardIterator first, ForwardIterator last,
464 constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // since C++20
468 ForwardIterator first, Size n, Generator gen); // since C++17
485 constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
493 constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
517 constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
541 partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
556 constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
564 constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
575 ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
584 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
594 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
604 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
616 partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
627 subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
652 constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C++20
663 ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
674 constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
706 ranges::move_backward(I1 first, S1 last, I2 result); // since C++20
716 ranges::move(I first, S last, O result); // since C++20
731 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
744 constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); // since C++20
771 constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20
781 constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
832 ranges::reverse_copy(I first, S last, O result); // since C++20
840 constexpr subrange<I> rotate(I first, I middle, S last); // since C++20
852 ranges::rotate_copy(I first, I middle, S last, O result); // since C++20
863 O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); // since C++20
874 I shuffle(I first, S last, Gen&& g); // since C++20
915 ranges::search_n(I first, S last, iter_difference_t<I> count,
927 constexpr auto ranges::fold_left(I first, S last, T init, F f); // since C++23
937 constexpr see below fold_left_with_iter(I first, S last, T init, F f); // since C++23
979 equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
1022 I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1032 constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // since C++20
1047 unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // since C++20
1065 remove_copy(I first, S last, O result, const T& value, Proj proj = {}); // since C++20
1081 remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
1097 replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value,
1116 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1133 ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1148 ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
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);
1172 for_each(InputIterator first, InputIterator last, Function f);
1176 for_each_n(InputIterator first, Size n, Function f); // C++17
1180 find(InputIterator first, InputIterator last, const T& value);
1184 find_if(InputIterator first, InputIterator last, Predicate pred);
1188 find_if_not(InputIterator first, InputIterator last, Predicate pred);
1212 adjacent_find(ForwardIterator first, ForwardIterator last);
1216 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1220 count(InputIterator first, InputIterator last, const T& value);
1224 count_if(InputIterator first, InputIterator last, Predicate pred);
1299 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
1303 search_n(ForwardIterator first, ForwardIterator last,
1308 copy(InputIterator first, InputIterator last, OutputIterator result);
1312 copy_if(InputIterator first, InputIterator last,
1317 copy_n(InputIterator first, Size n, OutputIterator result);
1321 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1326 constexpr OutputIterator move(InputIterator first, InputIterator last,
1331 move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1359 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
1368 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
1372 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1376 replace_copy(InputIterator first, InputIterator last, OutputIterator result,
1381 replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, const T& new_value);
1385 fill(ForwardIterator first, ForwardIterator last, const T& value);
1389 fill_n(OutputIterator first, Size n, const T& value);
1393 generate(ForwardIterator first, ForwardIterator last, Generator gen);
1397 generate_n(OutputIterator first, Size n, Generator gen);
1401 remove(ForwardIterator first, ForwardIterator last, const T& value);
1405 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1409 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
1413 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1417 unique(ForwardIterator first, ForwardIterator last);
1421 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1425 unique_copy(InputIterator first, InputIterator last, OutputIterator result);
1429 unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1433 reverse(BidirectionalIterator first, BidirectionalIterator last);
1437 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
1441 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
1445 rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result);
1449 random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, removed in C++17
1453 random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
1458 SampleIterator sample(PopulationIterator first, PopulationIterator last,
1463 void shuffle(RandomAccessIterator first, RandomAccessIterator last,
1468 shift_left(ForwardIterator first, ForwardIterator last,
1473 shift_right(ForwardIterator first, ForwardIterator last,
1478 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1482 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1487 partition_copy(InputIterator first, InputIterator last,
1493 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1497 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
1501 is_sorted(ForwardIterator first, ForwardIterator last);
1505 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1509 is_sorted_until(ForwardIterator first, ForwardIterator last);
1513 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1517 sort(RandomAccessIterator first, RandomAccessIterator last);
1521 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1525 stable_sort(RandomAccessIterator first, RandomAccessIterator last);
1529 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1533 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1537 partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
1541 partial_sort_copy(InputIterator first, InputIterator last,
1546 partial_sort_copy(InputIterator first, InputIterator last,
1551 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1555 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
1559 lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1563 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1567 upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1571 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1575 equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1579 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1583 binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1587 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1601 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last);
1605 inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp);
1657 push_heap(RandomAccessIterator first, RandomAccessIterator last);
1661 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1665 pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1669 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1673 make_heap(RandomAccessIterator first, RandomAccessIterator last);
1677 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1681 sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1685 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1689 is_heap(RandomAccessIterator first, RandomAccessiterator last);
1693 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1697 is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1701 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1705 min_element(ForwardIterator first, ForwardIterator last);
1709 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1735 max_element(ForwardIterator first, ForwardIterator last);
1739 max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1759 minmax_element(ForwardIterator first, ForwardIterator last);
1763 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1804 next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1808 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1812 prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1816 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);