#include <bits/stl_heap.h>
#include <bits/stl_tempbuf.h>
#include <debug/debug.h>
Include dependency graph for stl_algo.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Namespaces | |
namespace | std |
Defines | |
#define | ALGOH |
Enumerations | |
enum | |
enum | |
Functions | |
template<typename Type> | |
const Type & | std::__median (const Type &a, const Type &__b, const Type &c) |
Find the median of three values. | |
template<typename Type, typename Compare> | |
const Type & | std::__median (const Type &a, const Type &__b, const Type &c, Compare comp) |
Find the median of three values using a predicate for comparison. | |
template<typename InputIterator, typename Function> | |
Function | std::for_each (InputIterator first, InputIterator last, Function __f) |
Apply a function to every element of a sequence. | |
template<typename InputIterator, typename Type> | |
InputIterator | std::find (InputIterator first, InputIterator last, const Type &__val, input_iterator_tag) |
template<typename InputIterator, typename Predicate> | |
InputIterator | std::find_if (InputIterator first, InputIterator last, Predicate pred, input_iterator_tag) |
template<typename RandomAccessIterator, typename Type> | |
RandomAccessIterator | std::find (RandomAccessIterator first, RandomAccessIterator last, const Type &__val, random_access_iterator_tag) |
template<typename RandomAccessIterator, typename Predicate> | |
RandomAccessIterator | std::find_if (RandomAccessIterator first, RandomAccessIterator last, Predicate pred, random_access_iterator_tag) |
template<typename InputIterator, typename Type> | |
InputIterator | std::find (InputIterator first, InputIterator last, const Type &__val) |
Find the first occurrence of a value in a sequence. | |
template<typename InputIterator, typename Predicate> | |
InputIterator | std::find_if (InputIterator first, InputIterator last, Predicate pred) |
Find the first element in a sequence for which a predicate is true. | |
template<typename ForwardIterator> | |
ForwardIterator | std::adjacent_find (ForwardIterator first, ForwardIterator last) |
Find two adjacent values in a sequence that are equal. | |
template<typename ForwardIterator, typename BinaryPredicate> | |
ForwardIterator | std::adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate __binary_pred) |
Find two adjacent values in a sequence using a predicate. | |
template<typename InputIterator, typename Type> | |
iterator_traits< InputIterator >::difference_type | std::count (InputIterator first, InputIterator last, const Type &value) |
Count the number of copies of a value in a sequence. | |
template<typename InputIterator, typename Predicate> | |
iterator_traits< InputIterator >::difference_type | std::count_if (InputIterator first, InputIterator last, Predicate pred) |
Count the elements of a sequence for which a predicate is true. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | std::search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) |
Search a sequence for a matching sub-sequence. | |
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> | |
ForwardIterator1 | std::search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate predicate) |
Search a sequence for a matching sub-sequence using a predicate. | |
template<typename ForwardIterator, typename Integer, typename Type> | |
ForwardIterator | std::search_n (ForwardIterator first, ForwardIterator last, Integer count, const Type &__val) |
Search a sequence for a number of consecutive values. | |
template<typename ForwardIterator, typename Integer, typename Type, typename BinaryPredicate> | |
ForwardIterator | std::search_n (ForwardIterator first, ForwardIterator last, Integer count, const Type &__val, BinaryPredicate __binary_pred) |
Search a sequence for a number of consecutive values using a predicate. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator2 | std::swap_ranges (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2) |
Swap the elements of two sequences. | |
template<typename InputIterator, typename OutputIterator, typename UnaryOperation> | |
OutputIterator | std::transform (InputIterator first, InputIterator last, OutputIterator __result, UnaryOperation __unary_op) |
Perform an operation on a sequence. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename BinaryOperation> | |
OutputIterator | std::transform (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator __result, BinaryOperation __binary_op) |
Perform an operation on corresponding elements of two sequences. | |
template<typename ForwardIterator, typename Type> | |
void | std::replace (ForwardIterator first, ForwardIterator last, const Type &__old_value, const Type &new_value) |
Replace each occurrence of one value in a sequence with another value. | |
template<typename ForwardIterator, typename Predicate, typename Type> | |
void | std::replace_if (ForwardIterator first, ForwardIterator last, Predicate pred, const Type &new_value) |
Replace each value in a sequence for which a predicate returns true with another value. | |
template<typename InputIterator, typename OutputIterator, typename Type> | |
OutputIterator | std::replace_copy (InputIterator first, InputIterator last, OutputIterator __result, const Type &__old_value, const Type &new_value) |
Copy a sequence, replacing each element of one value with another value. | |
template<typename InputIterator, typename OutputIterator, typename Predicate, typename Type> | |
OutputIterator | std::replace_copy_if (InputIterator first, InputIterator last, OutputIterator __result, Predicate pred, const Type &new_value) |
Copy a sequence, replacing each value for which a predicate returns true with another value. | |
template<typename ForwardIterator, typename Generator> | |
void | std::generate (ForwardIterator first, ForwardIterator last, Generator __gen) |
Assign the result of a function object to each value in a sequence. | |
template<typename OutputIterator, typename Size, typename Generator> | |
OutputIterator | std::generate_n (OutputIterator first, Size n, Generator __gen) |
Assign the result of a function object to each value in a sequence. | |
template<typename InputIterator, typename OutputIterator, typename Type> | |
OutputIterator | std::remove_copy (InputIterator first, InputIterator last, OutputIterator __result, const Type &value) |
Copy a sequence, removing elements of a given value. | |
template<typename InputIterator, typename OutputIterator, typename Predicate> | |
OutputIterator | std::remove_copy_if (InputIterator first, InputIterator last, OutputIterator __result, Predicate pred) |
Copy a sequence, removing elements for which a predicate is true. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | std::remove (ForwardIterator first, ForwardIterator last, const Type &value) |
Remove elements from a sequence. | |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | std::remove_if (ForwardIterator first, ForwardIterator last, Predicate pred) |
Remove elements from a sequence using a predicate. | |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | std::__unique_copy (InputIterator first, InputIterator last, OutputIterator __result, output_iterator_tag) |
template<typename InputIterator, typename ForwardIterator> | |
ForwardIterator | std::__unique_copy (InputIterator first, InputIterator last, ForwardIterator __result, forward_iterator_tag) |
template<typename InputIterator, typename OutputIterator, typename BinaryPredicate> | |
OutputIterator | std::__unique_copy (InputIterator first, InputIterator last, OutputIterator __result, BinaryPredicate __binary_pred, output_iterator_tag) |
template<typename InputIterator, typename ForwardIterator, typename BinaryPredicate> | |
ForwardIterator | std::__unique_copy (InputIterator first, InputIterator last, ForwardIterator __result, BinaryPredicate __binary_pred, forward_iterator_tag) |
template<typename InputIterator, typename OutputIterator> | |
OutputIterator | std::unique_copy (InputIterator first, InputIterator last, OutputIterator __result) |
Copy a sequence, removing consecutive duplicate values. | |
template<typename InputIterator, typename OutputIterator, typename BinaryPredicate> | |
OutputIterator | std::unique_copy (InputIterator first, InputIterator last, OutputIterator __result, BinaryPredicate __binary_pred) |
Copy a sequence, removing consecutive values using a predicate. | |
template<typename ForwardIterator> | |
ForwardIterator | std::unique (ForwardIterator first, ForwardIterator last) |
Remove consecutive duplicate values from a sequence. | |
template<typename ForwardIterator, typename BinaryPredicate> | |
ForwardIterator | std::unique (ForwardIterator first, ForwardIterator last, BinaryPredicate __binary_pred) |
Remove consecutive values from a sequence using a predicate. | |
template<typename BidirectionalIterator> | |
void | std::__reverse (BidirectionalIterator first, BidirectionalIterator last, bidirectional_iterator_tag) |
template<typename RandomAccessIterator> | |
void | std::__reverse (RandomAccessIterator first, RandomAccessIterator last, random_access_iterator_tag) |
template<typename BidirectionalIterator> | |
void | std::reverse (BidirectionalIterator first, BidirectionalIterator last) |
Reverse a sequence. | |
template<typename BidirectionalIterator, typename OutputIterator> | |
OutputIterator | std::reverse_copy (BidirectionalIterator first, BidirectionalIterator last, OutputIterator __result) |
Copy a sequence, reversing its elements. | |
template<typename EuclideanRingElement> | |
EuclideanRingElement | std::__gcd (EuclideanRingElement __m, EuclideanRingElement n) |
template<typename ForwardIterator> | |
void | std::__rotate (ForwardIterator first, ForwardIterator __middle, ForwardIterator last, forward_iterator_tag) |
template<typename BidirectionalIterator> | |
void | std::__rotate (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, bidirectional_iterator_tag) |
template<typename RandomAccessIterator> | |
void | std::__rotate (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last, random_access_iterator_tag) |
template<typename ForwardIterator> | |
void | std::rotate (ForwardIterator first, ForwardIterator __middle, ForwardIterator last) |
Rotate the elements of a sequence. | |
template<typename ForwardIterator, typename OutputIterator> | |
OutputIterator | std::rotate_copy (ForwardIterator first, ForwardIterator __middle, ForwardIterator last, OutputIterator __result) |
Copy a sequence, rotating its elements. | |
template<typename RandomAccessIterator> | |
void | std::random_shuffle (RandomAccessIterator first, RandomAccessIterator last) |
Randomly shuffle the elements of a sequence. | |
template<typename RandomAccessIterator, typename RandomNumberGenerator> | |
void | std::random_shuffle (RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator &__rand) |
Shuffle the elements of a sequence using a random number generator. | |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | std::__partition (ForwardIterator first, ForwardIterator last, Predicate pred, forward_iterator_tag) |
template<typename BidirectionalIterator, typename Predicate> | |
BidirectionalIterator | std::__partition (BidirectionalIterator first, BidirectionalIterator last, Predicate pred, bidirectional_iterator_tag) |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | std::partition (ForwardIterator first, ForwardIterator last, Predicate pred) |
Move elements for which a predicate is true to the beginning of a sequence. | |
template<typename ForwardIterator, typename Predicate, typename Distance> | |
ForwardIterator | std::inplace_stable_partition (ForwardIterator first, ForwardIterator last, Predicate pred, Distance __len) |
template<typename ForwardIterator, typename Pointer, typename Predicate, typename Distance> | |
ForwardIterator | std::stable_partition_adaptive (ForwardIterator first, ForwardIterator last, Predicate pred, Distance __len, Pointer __buffer, Distance __buffer_size) |
template<typename ForwardIterator, typename Predicate> | |
ForwardIterator | std::stable_partition (ForwardIterator first, ForwardIterator last, Predicate pred) |
Move elements for which a predicate is true to the beginning of a sequence, preserving relative ordering. | |
template<typename RandomAccessIterator, typename Type> | |
RandomAccessIterator | std::__unguarded_partition (RandomAccessIterator first, RandomAccessIterator last, Type __pivot) |
template<typename RandomAccessIterator, typename Type, typename Compare> | |
RandomAccessIterator | std::__unguarded_partition (RandomAccessIterator first, RandomAccessIterator last, Type __pivot, Compare comp) |
template<typename RandomAccessIterator, typename Type> | |
void | std::__unguarded_linear_insert (RandomAccessIterator last, Type __val) |
template<typename RandomAccessIterator, typename Type, typename Compare> | |
void | std::__unguarded_linear_insert (RandomAccessIterator last, Type __val, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::insertion_sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator, typename Compare> | |
void | std::insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::__unguarded_insertion_sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator, typename Compare> | |
void | std::__unguarded_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::__final_insertion_sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator, typename Compare> | |
void | std::__final_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename Size> | |
Size | std::__lg (Size n) |
template<typename RandomAccessIterator> | |
void | std::partial_sort (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last) |
Sort the smallest elements of a sequence. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::partial_sort (RandomAccessIterator first, RandomAccessIterator __middle, RandomAccessIterator last, Compare comp) |
Sort the smallest elements of a sequence using a predicate for comparison. | |
template<typename InputIterator, typename RandomAccessIterator> | |
RandomAccessIterator | std::partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator __result_first, RandomAccessIterator __result_last) |
Copy the smallest elements of a sequence. | |
template<typename InputIterator, typename RandomAccessIterator, typename Compare> | |
RandomAccessIterator | std::partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator __result_first, RandomAccessIterator __result_last, Compare comp) |
Copy the smallest elements of a sequence using a predicate for comparison. | |
template<typename RandomAccessIterator, typename Size> | |
void | std::introsort_loop (RandomAccessIterator first, RandomAccessIterator last, Size __depth_limit) |
template<typename RandomAccessIterator, typename Size, typename Compare> | |
void | std::introsort_loop (RandomAccessIterator first, RandomAccessIterator last, Size __depth_limit, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::sort (RandomAccessIterator first, RandomAccessIterator last) |
Sort the elements of a sequence. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort the elements of a sequence using a predicate for comparison. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | std::lower_bound (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
ForwardIterator | std::lower_bound (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the first position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type> | |
ForwardIterator | std::upper_bound (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
ForwardIterator | std::upper_bound (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the last position in which val could be inserted without changing the ordering. | |
template<typename BidirectionalIterator, typename Distance> | |
void | std::__merge_without_buffer (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2) |
template<typename BidirectionalIterator, typename Distance, typename Compare> | |
void | std::__merge_without_buffer (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::inplace_stable_sort (RandomAccessIterator first, RandomAccessIterator last) |
template<typename RandomAccessIterator, typename Compare> | |
void | std::inplace_stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | std::merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Merges two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | std::merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Merges two sorted ranges. | |
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Distance> | |
void | std::__merge_sort_loop (RandomAccessIterator1 first, RandomAccessIterator1 last, RandomAccessIterator2 __result, Distance step_size) |
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Distance, typename Compare> | |
void | std::__merge_sort_loop (RandomAccessIterator1 first, RandomAccessIterator1 last, RandomAccessIterator2 __result, Distance step_size, Compare comp) |
template<typename RandomAccessIterator, typename Distance> | |
void | std::chunk_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Distance chunk_size) |
template<typename RandomAccessIterator, typename Distance, typename Compare> | |
void | std::chunk_insertion_sort (RandomAccessIterator first, RandomAccessIterator last, Distance chunk_size, Compare comp) |
template<typename RandomAccessIterator, typename Pointer> | |
void | std::__merge_sort_with_buffer (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer) |
template<typename RandomAccessIterator, typename Pointer, typename Compare> | |
void | std::__merge_sort_with_buffer (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Compare comp) |
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BidirectionalIterator3> | |
BidirectionalIterator3 | std::__merge_backward (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, BidirectionalIterator3 __result) |
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BidirectionalIterator3, typename Compare> | |
BidirectionalIterator3 | std::__merge_backward (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, BidirectionalIterator3 __result, Compare comp) |
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename Distance> | |
BidirectionalIterator1 | std::__rotate_adaptive (BidirectionalIterator1 first, BidirectionalIterator1 __middle, BidirectionalIterator1 last, Distance __len1, Distance __len2, BidirectionalIterator2 __buffer, Distance __buffer_size) |
template<typename BidirectionalIterator, typename Distance, typename Pointer> | |
void | std::__merge_adaptive (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Pointer __buffer, Distance __buffer_size) |
template<typename BidirectionalIterator, typename Distance, typename Pointer, typename Compare> | |
void | std::__merge_adaptive (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Distance __len1, Distance __len2, Pointer __buffer, Distance __buffer_size, Compare comp) |
template<typename BidirectionalIterator> | |
void | std::inplace_merge (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last) |
Merges two sorted ranges in place. | |
template<typename BidirectionalIterator, typename Compare> | |
void | std::inplace_merge (BidirectionalIterator first, BidirectionalIterator __middle, BidirectionalIterator last, Compare comp) |
Merges two sorted ranges in place. | |
template<typename RandomAccessIterator, typename Pointer, typename Distance> | |
void | std::stable_sort_adaptive (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Distance __buffer_size) |
template<typename RandomAccessIterator, typename Pointer, typename Distance, typename Compare> | |
void | std::stable_sort_adaptive (RandomAccessIterator first, RandomAccessIterator last, Pointer __buffer, Distance __buffer_size, Compare comp) |
template<typename RandomAccessIterator> | |
void | std::stable_sort (RandomAccessIterator first, RandomAccessIterator last) |
Sort the elements of a sequence, preserving the relative order of equivalent elements. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp) |
Sort the elements of a sequence using a predicate for comparison, preserving the relative order of equivalent elements. | |
template<typename RandomAccessIterator> | |
void | std::nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last) |
Sort a sequence just enough to find a particular position. | |
template<typename RandomAccessIterator, typename Compare> | |
void | std::nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp) |
Sort a sequence just enough to find a particular position using a predicate for comparison. | |
template<typename ForwardIterator, typename Type> | |
pair< ForwardIterator, ForwardIterator > | std::equal_range (ForwardIterator first, ForwardIterator last, const Type &__val) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
pair< ForwardIterator, ForwardIterator > | std::equal_range (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Finds the largest subrange in which val could be inserted at any place in it without changing the ordering. | |
template<typename ForwardIterator, typename Type> | |
bool | std::binary_search (ForwardIterator first, ForwardIterator last, const Type &__val) |
Determines whether an element exists in a range. | |
template<typename ForwardIterator, typename Type, typename Compare> | |
bool | std::binary_search (ForwardIterator first, ForwardIterator last, const Type &__val, Compare comp) |
Determines whether an element exists in a range. | |
template<typename InputIterator1, typename InputIterator2> | |
bool | std::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) |
Determines whether all elements of a sequence exists in a range. | |
template<typename InputIterator1, typename InputIterator2, typename Compare> | |
bool | std::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) |
Determines whether all elements of a sequence exists in a range using comparison. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | std::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the union of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | std::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the union of two sorted ranges using a comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | std::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the intersection of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | std::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the intersection of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | std::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | std::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the difference of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> | |
OutputIterator | std::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the symmetric difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> | |
OutputIterator | std::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the symmetric difference of two sorted ranges using comparison functor. | |
template<typename ForwardIterator> | |
ForwardIterator | std::max_element (ForwardIterator first, ForwardIterator last) |
Return the maximum element in a range. | |
template<typename ForwardIterator, typename Compare> | |
ForwardIterator | std::max_element (ForwardIterator first, ForwardIterator last, Compare comp) |
Return the maximum element in a range using comparison functor. | |
template<typename ForwardIterator> | |
ForwardIterator | std::min_element (ForwardIterator first, ForwardIterator last) |
Return the minimum element in a range. | |
template<typename ForwardIterator, typename Compare> | |
ForwardIterator | std::min_element (ForwardIterator first, ForwardIterator last, Compare comp) |
Return the minimum element in a range using comparison functor. | |
template<typename BidirectionalIterator> | |
bool | std::next_permutation (BidirectionalIterator first, BidirectionalIterator last) |
Permute range into the next "dictionary" ordering. | |
template<typename BidirectionalIterator, typename Compare> | |
bool | std::next_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) |
Permute range into the next "dictionary" ordering using comparison functor. | |
template<typename BidirectionalIterator> | |
bool | std::prev_permutation (BidirectionalIterator first, BidirectionalIterator last) |
Permute range into the previous "dictionary" ordering. | |
template<typename BidirectionalIterator, typename Compare> | |
bool | std::prev_permutation (BidirectionalIterator first, BidirectionalIterator last, Compare comp) |
Permute range into the previous "dictionary" ordering using comparison functor. | |
template<typename InputIterator, typename ForwardIterator> | |
InputIterator | std::find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2) |
Find element from a set in a sequence. | |
template<typename InputIterator, typename ForwardIterator, typename BinaryPredicate> | |
InputIterator | std::find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, BinaryPredicate comp) |
Find element from a set in a sequence using a predicate. | |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | std::__find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, forward_iterator_tag, forward_iterator_tag) |
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> | |
ForwardIterator1 | std::__find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, forward_iterator_tag, forward_iterator_tag, BinaryPredicate comp) |
template<typename BidirectionalIterator1, typename BidirectionalIterator2> | |
BidirectionalIterator1 | std::__find_end (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, bidirectional_iterator_tag, bidirectional_iterator_tag) |
template<typename BidirectionalIterator1, typename BidirectionalIterator2, typename BinaryPredicate> | |
BidirectionalIterator1 | std::__find_end (BidirectionalIterator1 first1, BidirectionalIterator1 last1, BidirectionalIterator2 first2, BidirectionalIterator2 last2, bidirectional_iterator_tag, bidirectional_iterator_tag, BinaryPredicate comp) |
template<typename ForwardIterator1, typename ForwardIterator2> | |
ForwardIterator1 | std::find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) |
Find last matching subsequence in a sequence. | |
template<typename ForwardIterator1, typename ForwardIterator2, typename BinaryPredicate> | |
ForwardIterator1 | std::find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp) |
Find last matching subsequence in a sequence using a predicate. |
Definition in file stl_algo.h.