Lines Matching full:first
53 constexpr I min_element(I first, S last, Comp comp = {}, Proj proj = {});
61 …constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); …
83 …constexpr I find(I first, S last, const T& value, Proj proj = {}); …
92 …constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); …
101 …constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); …
110 …constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); …
119 …constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); …
127 …constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); …
199 …count(I first, S last, const T& value, Proj proj = {}); …
209 …count_if(I first, S last, Pred pred, Proj proj = {}); …
241 …minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); …
275 …constexpr bool ranges::contains(I first, S last, const T& value, Proj proj = {}); // since C…
283 …constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C…
292 …ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++…
298 …ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++…
309 …ranges::copy_backward(I1 first, S1 last, I2 result); // since C++…
325 …ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++…
335 …ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++…
339 …constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C…
349 …ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
360 …ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
371 …ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
382 …ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
391 …constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
399 …constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
408 …constexpr I ranges::reverse(I first, S last); // since C…
418 …ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
429 …ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++…
440 …ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++…
448 …constexpr O ranges::fill(O first, S last, const T& value); // since C…
454 …constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C…
458 …constexpr O generate(O first, S last, F gen); // since C…
462 ForwardIterator first, ForwardIterator last,
471 …constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // since C…
475 … ForwardIterator first, Size n, Generator gen); // since C++17
492 …constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C…
500 …constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C…
524 …constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C…
548 partial_sort_copy(I1 first, S1 last, I2 result_first, S2 result_last,
563 …constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
571 …constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C…
582 …ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++…
591 constexpr I upper_bound(I first, S last, const T& value, Comp comp = {}, Proj proj = {});
601 constexpr I lower_bound(I first, S last, const T& value, Comp comp = {},
611 constexpr bool binary_search(I first, S last, const T& value, Comp comp = {},
623 …partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
635 …stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++…
661 …constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C…
672 …ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // s…
683 …constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); //…
721 …ranges::move_backward(I1 first, S1 last, I2 result); // s…
731 …ranges::move(I first, S last, O result); // s…
746 partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
759 …constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); //…
786 …constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); //…
796 …constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); //…
847 …ranges::reverse_copy(I first, S last, O result); // s…
855 …constexpr subrange<I> rotate(I first, I middle, S last); //…
867 …ranges::rotate_copy(I first, I middle, S last, O result); // s…
878 …O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); //…
889 …I shuffle(I first, S last, Gen&& g); //…
930 ranges::search_n(I first, S last, iter_difference_t<I> count,
942 …constexpr auto ranges::fold_left(I first, S last, T init, F f); //…
952 …constexpr see below fold_left_with_iter(I first, S last, T init, F f); //…
994 …equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // s…
1038 …inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1048 …constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // …
1063 …unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // si…
1081 …remove_copy(I first, S last, O result, const T& value, Proj proj = {}); // si…
1097 …remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // si…
1113 replace_copy(I first, S last, O result, const T1& old_value, const T2& new_value,
1132 replace_copy_if(I first, S last, O result, Pred pred, const T& new_value,
1149 …ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
1164 …ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // si…
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);
1188 for_each(InputIterator first, InputIterator last, Function f);
1192 for_each_n(InputIterator first, Size n, Function f); // C++17
1196 find(InputIterator first, InputIterator last, const T& value);
1200 find_if(InputIterator first, InputIterator last, Predicate pred);
1204 find_if_not(InputIterator first, InputIterator last, Predicate pred);
1228 adjacent_find(ForwardIterator first, ForwardIterator last);
1232 adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1236 count(InputIterator first, InputIterator last, const T& value);
1240 count_if(InputIterator first, InputIterator last, Predicate pred);
1315 search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
1319 search_n(ForwardIterator first, ForwardIterator last,
1324 copy(InputIterator first, InputIterator last, OutputIterator result);
1328 copy_if(InputIterator first, InputIterator last,
1333 copy_n(InputIterator first, Size n, OutputIterator result);
1337 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1342 constexpr OutputIterator move(InputIterator first, InputIterator last,
1347 move_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
1375 transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
1384 replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
1388 replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
1392 replace_copy(InputIterator first, InputIterator last, OutputIterator result,
1397 …replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, co…
1401 fill(ForwardIterator first, ForwardIterator last, const T& value);
1405 fill_n(OutputIterator first, Size n, const T& value);
1409 generate(ForwardIterator first, ForwardIterator last, Generator gen);
1413 generate_n(OutputIterator first, Size n, Generator gen);
1417 remove(ForwardIterator first, ForwardIterator last, const T& value);
1421 remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
1425 remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
1429 remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
1433 unique(ForwardIterator first, ForwardIterator last);
1437 unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
1441 unique_copy(InputIterator first, InputIterator last, OutputIterator result);
1445 … unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
1449 reverse(BidirectionalIterator first, BidirectionalIterator last);
1453 reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
1457 rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
1461 …rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator re…
1465 …random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, rem…
1469 random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
1474 SampleIterator sample(PopulationIterator first, PopulationIterator last,
1479 void shuffle(RandomAccessIterator first, RandomAccessIterator last,
1484 shift_left(ForwardIterator first, ForwardIterator last,
1489 shift_right(ForwardIterator first, ForwardIterator last,
1494 is_partitioned(InputIterator first, InputIterator last, Predicate pred);
1498 partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1503 partition_copy(InputIterator first, InputIterator last,
1509 stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
1513 partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
1517 is_sorted(ForwardIterator first, ForwardIterator last);
1521 is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
1525 is_sorted_until(ForwardIterator first, ForwardIterator last);
1529 is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
1533 sort(RandomAccessIterator first, RandomAccessIterator last);
1537 sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1541 stable_sort(RandomAccessIterator first, RandomAccessIterator last);
1545 stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1549 … partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
1553 …partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, C…
1557 partial_sort_copy(InputIterator first, InputIterator last,
1562 partial_sort_copy(InputIterator first, InputIterator last,
1567 nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
1571 …nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compa…
1575 lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
1579 lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1583 upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
1587 upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1591 equal_range(ForwardIterator first, ForwardIterator last, const T& value);
1595 equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1599 binary_search(ForwardIterator first, ForwardIterator last, const T& value);
1603 binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
1617 …inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator las…
1621 …inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator las…
1673 push_heap(RandomAccessIterator first, RandomAccessIterator last);
1677 push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1681 pop_heap(RandomAccessIterator first, RandomAccessIterator last);
1685 pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1689 make_heap(RandomAccessIterator first, RandomAccessIterator last);
1693 make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1697 sort_heap(RandomAccessIterator first, RandomAccessIterator last);
1701 sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
1705 is_heap(RandomAccessIterator first, RandomAccessiterator last);
1709 is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1713 is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
1717 is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
1721 min_element(ForwardIterator first, ForwardIterator last);
1725 min_element(ForwardIterator first, ForwardIterator last, Compare comp);
1751 max_element(ForwardIterator first, ForwardIterator last);
1755 max_element(ForwardIterator first, ForwardIterator last, Compare comp);
1775 minmax_element(ForwardIterator first, ForwardIterator last);
1779 minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
1820 next_permutation(BidirectionalIterator first, BidirectionalIterator last);
1824 next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
1828 prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
1832 prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);