Lines Matching refs:first

23     all_of(InputIterator first, InputIterator last, Predicate pred);
27     any_of(InputIterator first, InputIterator last, Predicate pred);
31     none_of(InputIterator first, InputIterator last, Predicate pred);
35     for_each(InputIterator first, InputIterator last, Function f);
39     for_each_n(InputIterator first, Size n, Function f); // C++17
43     find(InputIterator first, InputIterator last, const T& value);
47     find_if(InputIterator first, InputIterator last, Predicate pred);
51     find_if_not(InputIterator first, InputIterator last, Predicate pred);
75     adjacent_find(ForwardIterator first, ForwardIterator last);
79     adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
83     count(InputIterator first, InputIterator last, const T& value);
87     count_if(InputIterator first, InputIterator last, Predicate pred);
162     search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
166     search_n(ForwardIterator first, ForwardIterator last,
171     copy(InputIterator first, InputIterator last, OutputIterator result);
175     copy_if(InputIterator first, InputIterator last,
180     copy_n(InputIterator first, Size n, OutputIterator result);
184     copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
197     transform(InputIterator first, InputIterator last, OutputIterator result, UnaryOperation op);
206     replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
210     replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
214     replace_copy(InputIterator first, InputIterator last, OutputIterator result,
219 …replace_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred, co…
223     fill(ForwardIterator first, ForwardIterator last, const T& value);
227     fill_n(OutputIterator first, Size n, const T& value);
231     generate(ForwardIterator first, ForwardIterator last, Generator gen);
235     generate_n(OutputIterator first, Size n, Generator gen);
239     remove(ForwardIterator first, ForwardIterator last, const T& value);
243     remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
247     remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
251     remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
255     unique(ForwardIterator first, ForwardIterator last);
259     unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
263     unique_copy(InputIterator first, InputIterator last, OutputIterator result);
267 … unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
271     reverse(BidirectionalIterator first, BidirectionalIterator last);
275     reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
279     rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
283 …rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator re…
287 …random_shuffle(RandomAccessIterator first, RandomAccessIterator last); // deprecated in C++14, rem…
291     random_shuffle(RandomAccessIterator first, RandomAccessIterator last,
296     SampleIterator sample(PopulationIterator first, PopulationIterator last,
301     void shuffle(RandomAccessIterator first, RandomAccessIterator last,
306     shift_left(ForwardIterator first, ForwardIterator last,
311     shift_right(ForwardIterator first, ForwardIterator last,
316     is_partitioned(InputIterator first, InputIterator last, Predicate pred);
320     partition(ForwardIterator first, ForwardIterator last, Predicate pred);
325     partition_copy(InputIterator first, InputIterator last,
331     stable_partition(ForwardIterator first, ForwardIterator last, Predicate pred);
335     partition_point(ForwardIterator first, ForwardIterator last, Predicate pred);
339     is_sorted(ForwardIterator first, ForwardIterator last);
343     is_sorted(ForwardIterator first, ForwardIterator last, Compare comp);
347     is_sorted_until(ForwardIterator first, ForwardIterator last);
351     is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp);
355     sort(RandomAccessIterator first, RandomAccessIterator last);
359     sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
363     stable_sort(RandomAccessIterator first, RandomAccessIterator last);
367     stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
371 …  partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
375 …partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, C…
379     partial_sort_copy(InputIterator first, InputIterator last,
384     partial_sort_copy(InputIterator first, InputIterator last,
389     nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
393 …nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compa…
397     lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
401     lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
405     upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
409     upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
413     equal_range(ForwardIterator first, ForwardIterator last, const T& value);
417     equal_range(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
421     binary_search(ForwardIterator first, ForwardIterator last, const T& value);
425     binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
439 …inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator las…
443 …inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator las…
495     push_heap(RandomAccessIterator first, RandomAccessIterator last);
499     push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
503     pop_heap(RandomAccessIterator first, RandomAccessIterator last);
507     pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
511     make_heap(RandomAccessIterator first, RandomAccessIterator last);
515     make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
519     sort_heap(RandomAccessIterator first, RandomAccessIterator last);
523     sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
527     is_heap(RandomAccessIterator first, RandomAccessiterator last);
531     is_heap(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
535     is_heap_until(RandomAccessIterator first, RandomAccessiterator last);
539     is_heap_until(RandomAccessIterator first, RandomAccessiterator last, Compare comp);
543     min_element(ForwardIterator first, ForwardIterator last);
547     min_element(ForwardIterator first, ForwardIterator last, Compare comp);
573     max_element(ForwardIterator first, ForwardIterator last);
577     max_element(ForwardIterator first, ForwardIterator last, Compare comp);
597     minmax_element(ForwardIterator first, ForwardIterator last);
601     minmax_element(ForwardIterator first, ForwardIterator last, Compare comp);
630     next_permutation(BidirectionalIterator first, BidirectionalIterator last);
634     next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
638     prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
642     prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);