http://cppreference.com/wiki/ 2010-09-09T09:40:09-07:00 http://cppreference.com/wiki/ http://cppreference.com/wiki/lib/images/favicon.ico text/html 2010-03-22T08:56:17-07:00 http://cppreference.com/wiki/stl/algorithm/accumulate?rev=1269273377&do=diff accumulate Syntax: #include <numeric> TYPE accumulate( input_iterator start, input_iterator end, TYPE val ); TYPE accumulate( input_iterator start, input_iterator end, TYPE val, BinaryFunction f ); The accumulate function computes the sum of val and all of the elements in the range [start,end). text/html 2010-04-15T07:08:02-07:00 http://cppreference.com/wiki/stl/algorithm/adjacent_difference?rev=1271340482&do=diff adjacent_difference Syntax: #include <numeric> output_iterator adjacent_difference( input_iterator start, input_iterator end, output_iterator result ); output_iterator adjacent_difference( input_iterator start, input_iterator end, output_iterator result, BinaryFunction f ); text/html 2009-10-09T00:51:43-07:00 http://cppreference.com/wiki/stl/algorithm/adjacent_find?rev=1255074703&do=diff adjacent_find Syntax: #include <algorithm> forward_iterator adjacent_find( forward_iterator start, forward_iterator end ); forward_iterator adjacent_find( forward_iterator start, forward_iterator end, BinPred pr ); The adjacent_find() function searches between start and end for two consecutive identical elements. If the binary predicate pr is specified, then it is used to test whether two elements are the same or not. The return value is an iterator that points to the first of th… text/html 2010-05-03T18:55:57-07:00 http://cppreference.com/wiki/stl/algorithm/binary_search?rev=1272938157&do=diff binary_search Syntax: #include <algorithm> bool binary_search( forward_iterator start, forward_iterator end, const TYPE& val ); bool binary_search( forward_iterator start, forward_iterator end, const TYPE& val, Comp f ); The binary_search() function searches from start to end for val. The elements between start and end that are searched should be in ascending order as defined by the < operator. Note that a binary search will not work unless the elements being searched are in order… text/html 2010-03-21T09:59:12-07:00 http://cppreference.com/wiki/stl/algorithm/copy?rev=1269190752&do=diff copy Syntax: #include <algorithm> output_iterator copy( input_iterator start, input_iterator end, output_iterator dest ); The copy function copies the elements between start and end to dest. In other words, after copy has run, *dest = *start *(dest+1) = *(start+1) *(dest+2) = *(start+2) ... *(dest+N) = *(start+N) text/html 2009-12-29T06:04:30-07:00 http://cppreference.com/wiki/stl/algorithm/copy_backward?rev=1262095470&do=diff copy_backward Syntax: #include <algorithm> bidirectional_iterator2 copy_backward( bidirectional_iterator start, bidirectional_iterator end, bidirectional_iterator2 dest ); text/html 2008-09-23T07:12:48-07:00 http://cppreference.com/wiki/stl/algorithm/copy_n?rev=1222179168&do=diff copy_n This function was part of the original SGI STL library, but never has been a part of ISO C++. text/html 2009-10-09T00:55:51-07:00 http://cppreference.com/wiki/stl/algorithm/count?rev=1255074951&do=diff count Syntax: #include <algorithm> typename iterator_traits<input_iterator>::difference_type count( input_iterator start, input_iterator end, const TYPE& val ); The count() function returns the number of elements between start and end that match val. text/html 2010-02-16T08:46:25-07:00 http://cppreference.com/wiki/stl/algorithm/count_if?rev=1266338785&do=diff count_if Syntax: #include <algorithm> typename iterator_traits<input_iterator>::difference_type count_if( input_iterator start, input_iterator end, UnaryPred p ); The count_if function returns the number of elements between start and end for which the predicate p returns true. text/html 2010-02-20T05:19:58-07:00 http://cppreference.com/wiki/stl/algorithm/equal?rev=1266671998&do=diff equal Syntax: #include <algorithm> bool equal( input_iterator start1, input_iterator end1, input_iterator2 start2 ); bool equal( input_iterator start1, input_iterator end1, input_iterator2 start2, BinPred p ); The equal function returns true if the elements in two ranges are the same. The first range of elements are those between start1 and end1. The second range of elements has the same size as the first range but starts at start2. text/html 2009-10-09T01:52:55-07:00 http://cppreference.com/wiki/stl/algorithm/equal_range?rev=1255078375&do=diff equal_range Syntax: #include <algorithm> pair<forward_iterator,forward_iterator> equal_range( forward_iterator first, forward_iterator last, const TYPE& val ); pair<forward_iterator,forward_iterator> equal_range( forward_iterator first, forward_iterator last, const TYPE& val, CompFn comp ); text/html 2009-10-09T01:27:02-07:00 http://cppreference.com/wiki/stl/algorithm/fill?rev=1255076822&do=diff fill Syntax: #include <algorithm> void fill( forward_iterator start, forward_iterator end, const TYPE& val ); The function fill() assigns val to all of the elements between start and end. For example, the following code uses fill() to set all of the elements of a vector of integers to -1: text/html 2009-10-09T01:29:36-07:00 http://cppreference.com/wiki/stl/algorithm/fill_n?rev=1255076976&do=diff fill_n Syntax: #include <algorithm> void fill_n( output_iterator start, SIZE n, const TYPE& val ); The fill_n() function is similar to fill. Instead of assigning val to a range of elements, however, fill_n() assigns val to the first n elements starting at start. text/html 2009-10-09T00:43:15-07:00 http://cppreference.com/wiki/stl/algorithm/find?rev=1255074195&do=diff find Syntax: #include <algorithm> input_iterator find( input_iterator start, input_iterator end, const TYPE& val ); The find() algorithm looks for an element matching val between start and end. If an element matching val is found, the return value is an iterator that points to that element. Otherwise, the return value is an iterator that points to end. text/html 2009-10-10T09:43:56-07:00 http://cppreference.com/wiki/stl/algorithm/find_end?rev=1255193036&do=diff find_end Syntax: #include <algorithm> forward_iterator find_end( forward_iterator start, forward_iterator end, forward_iterator2 seq_start, forward_iterator2 seq_end ); forward_iterator find_end( forward_iterator start, forward_iterator end, forward_iterator2 seq_start, forward_iterator2 seq_end, BinPred bp ); text/html 2009-10-09T00:50:15-07:00 http://cppreference.com/wiki/stl/algorithm/find_first_of?rev=1255074615&do=diff find_first_of Syntax: #include <algorithm> forward_iterator find_first_of( forward_iterator start, forward_iterator end, forward_iterator2 find_start, forward_iterator2 find_end ); forward_iterator find_first_of( forward_iterator start, forward_iterator end, forward_iterator2 find_start, forward_iterator2 find_end, BinPred bp ); text/html 2009-10-10T09:46:37-07:00 http://cppreference.com/wiki/stl/algorithm/find_if?rev=1255193197&do=diff find_if Syntax: #include <algorithm> input_iterator find_if( input_iterator start, input_iterator end, UnPred up ); The find_if() function searches for the first element between start and end for which the unary predicate up returns true. text/html 2010-06-23T05:38:55-07:00 http://cppreference.com/wiki/stl/algorithm/for_each?rev=1277296735&do=diff for_each Syntax: #include <algorithm> UnaryFunction for_each( input_iterator start, input_iterator end, UnaryFunction f ); The for_each algorithm applies the function f to each of the elements between start and end. The return value of for_each is f. text/html 2009-10-09T01:31:18-07:00 http://cppreference.com/wiki/stl/algorithm/generate?rev=1255077078&do=diff generate Syntax: #include <algorithm> void generate( forward_iterator start, forward_iterator end, Generator g ); The generate() function runs the Generator function object g a number of times, saving the result of each execution in the range [start,end). text/html 2009-10-10T17:21:51-07:00 http://cppreference.com/wiki/stl/algorithm/generate_n?rev=1255220511&do=diff generate_n Syntax: #include <algorithm> void generate_n( output_iterator result, SIZE num, Generator g ); The generate_n() function runs the Generator function object g num times, saving the result of each execution in result, (result+1), etc. text/html 2009-10-10T10:52:31-07:00 http://cppreference.com/wiki/stl/algorithm/includes?rev=1255197151&do=diff includes Syntax: #include <algorithm> template< typename InIterA, typename InIterB > bool includes( InIterA start1, InIterA end1, InIterB start2, InIterB end2 ); template< typename InIterA, typename InIterB, typename StrictWeakOrdering > bool includes( InIterA start1, InIterA end1, InIterB start2, InIterB end2, StrictWeakOrdering cmp ); text/html 2009-10-09T00:38:18-07:00 http://cppreference.com/wiki/stl/algorithm/inner_product?rev=1255073898&do=diff inner_product Syntax: #include <numeric> TYPE inner_product( input_iterator start1, input_iterator end1, input_iterator2 start2, TYPE val ); TYPE inner_product( input_iterator start1, input_iterator end1, input_iterator2 start2, TYPE val, BinaryFunction f1, BinaryFunction2 f2 ); text/html 2010-06-10T03:00:38-07:00 http://cppreference.com/wiki/stl/algorithm/inplace_merge?rev=1276164038&do=diff inplace_merge Syntax: #include <algorithm> void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end ); void inplace_merge( bidirectional_iterator start, bidirectional_iterator middle, bidirectional_iterator end, StrictWeakOrdering cmp ); text/html 2009-11-27T10:14:39-07:00 http://cppreference.com/wiki/stl/algorithm/is_heap?rev=1259345679&do=diff is_heap Syntax: #include <algorithm> bool is_heap(iterator start, iterator end); bool is_heap(iterator start, iterator end, StrictWeakOrdering cmp); The is_heap() function returns true if the given range [start,end) is a heap. If the strict weak ordering comparison function object cmp is given, then it is used instead of the < operator to compare elements. text/html 2009-10-09T02:25:57-07:00 http://cppreference.com/wiki/stl/algorithm/iter_swap?rev=1255080357&do=diff iter_swap Syntax: #include <algorithm> void iter_swap( forward_iterator a, forward_iterator b ); A call to iter_swap() exchanges the values of two elements exactly as a call to swap( *a, *b ); would. Related Topics: swap, swap_ranges text/html 2009-10-09T02:12:27-07:00 http://cppreference.com/wiki/stl/algorithm/lexicographical_compare?rev=1255079547&do=diff lexicographical_compare Syntax: #include <algorithm> bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2 ); bool lexicographical_compare( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, BinPred p ); text/html 2008-09-23T07:12:09-07:00 http://cppreference.com/wiki/stl/algorithm/lexicographical_compare_3way?rev=1222179129&do=diff lexicographical_compare_3way This function was part of the original SGI STL library, but never has been a part of ISO C++. text/html 2010-06-03T10:30:03-07:00 http://cppreference.com/wiki/stl/algorithm/lower_bound?rev=1275586203&do=diff lower_bound Syntax: #include <algorithm> forward_iterator lower_bound( forward_iterator first, forward_iterator last, const TYPE& val ); forward_iterator lower_bound( forward_iterator first, forward_iterator last, const TYPE& val, CompFn f ); text/html 2009-10-12T07:05:43-07:00 http://cppreference.com/wiki/stl/algorithm/make_heap?rev=1255356343&do=diff make_heap Syntax: #include <algorithm> void make_heap( random_access_iterator start, random_access_iterator end ); void make_heap( random_access_iterator start, random_access_iterator end, StrictWeakOrdering cmp ); The make_heap() function turns the given range of elements [start,end) into a heap. text/html 2008-10-14T15:42:05-07:00 http://cppreference.com/wiki/stl/algorithm/max?rev=1224024125&do=diff max Syntax: #include <algorithm> const TYPE& max( const TYPE& x, const TYPE& y ); const TYPE& max( const TYPE& x, const TYPE& y, BinPred p ); The max() function returns the greater of x and y. If the binary predicate p is given, then it will be used instead of the < operator to compare the two elements. text/html 2009-10-09T02:16:41-07:00 http://cppreference.com/wiki/stl/algorithm/max_element?rev=1255079801&do=diff max_element Syntax: #include <algorithm> forward_iterator max_element( forward_iterator start, forward_iterator end ); forward_iterator max_element( forward_iterator start, forward_iterator end, BinPred p ); The max_element() function returns an iterator to the largest element in the range [start,end). text/html 2009-10-09T01:55:23-07:00 http://cppreference.com/wiki/stl/algorithm/merge?rev=1255078523&do=diff merge Syntax: #include <algorithm> output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); output_iterator merge( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); text/html 2008-10-14T15:42:05-07:00 http://cppreference.com/wiki/stl/algorithm/min?rev=1224024125&do=diff min Syntax: #include <algorithm> const TYPE& min( const TYPE& x, const TYPE& y ); const TYPE& min( const TYPE& x, const TYPE& y, BinPred p ); The min() function, unsurprisingly, returns the smaller of x and y. By default, the < operator is used to compare the two elements. If the binary predicate p is given, it will be used instead. text/html 2009-10-09T02:17:19-07:00 http://cppreference.com/wiki/stl/algorithm/min_element?rev=1255079839&do=diff min_element Syntax: #include <algorithm> forward_iterator min_element( forward_iterator start, forward_iterator end ); forward_iterator min_element( forward_iterator start, forward_iterator end, BinPred p ); The min_element() function returns an iterator to the smallest element in the range [start,end). text/html 2009-10-09T01:00:54-07:00 http://cppreference.com/wiki/stl/algorithm/mismatch?rev=1255075254&do=diff mismatch Syntax: #include <algorithm> pair <input_iterator1,input_iterator2> mismatch( input_iterator1 start1, input_iterator1 end1, input_iterator2 start2 ); pair <input_iterator1,input_iterator2> mismatch( input_iterator1 start1, input_iterator1 end1, input_iterator2 start2, BinPred p ); text/html 2010-05-23T08:49:57-07:00 http://cppreference.com/wiki/stl/algorithm/next_permutation?rev=1274629797&do=diff next_permutation Syntax: #include <algorithm> bool next_permutation( bidirectional_iterator start, bidirectional_iterator end ); bool next_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp ); text/html 2009-10-12T07:07:30-07:00 http://cppreference.com/wiki/stl/algorithm/nth_element?rev=1255356450&do=diff nth_element Syntax: #include <algorithm> void nth_element( random_access_iterator start, random_access_iterator nth, random_access_iterator end ); void nth_element( random_access_iterator start, random_access_iterator nth, random_access_iterator end, StrictWeakOrdering cmp ); text/html 2009-10-12T07:08:40-07:00 http://cppreference.com/wiki/stl/algorithm/partial_sort?rev=1255356520&do=diff partial_sort Syntax: #include <algorithm> void partial_sort( random_access_iterator start, random_access_iterator middle, random_access_iterator end ); void partial_sort( random_access_iterator start, random_access_iterator middle, random_access_iterator end, StrictWeakOrdering cmp ); text/html 2010-04-07T05:01:56-07:00 http://cppreference.com/wiki/stl/algorithm/partial_sort_copy?rev=1270641716&do=diff partial_sort_copy Syntax: #include <algorithm> random_access_iterator partial_sort_copy( input_iterator start, input_iterator end, random_access_iterator result_start, random_access_iterator result_end ); random_access_iterator partial_sort_copy( input_iterator start, input_iterator end, random_access_iterator result_start, random_access_iterator result_end, StrictWeakOrdering cmp ); text/html 2009-10-09T00:40:06-07:00 http://cppreference.com/wiki/stl/algorithm/partial_sum?rev=1255074006&do=diff partial_sum Syntax: #include <numeric> output_iterator partial_sum( input_iterator start, input_iterator end, output_iterator result ); output_iterator partial_sum( input_iterator start, input_iterator end, output_iterator result, BinOp p ); text/html 2009-10-09T01:59:17-07:00 http://cppreference.com/wiki/stl/algorithm/partition?rev=1255078757&do=diff partition Syntax: #include <algorithm> bidirectional_iterator partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p ); The partition algorithm re-orders the elements in [start,end) such that the elements for which the predicate p returns true come before the elements for which p returns false. text/html 2009-10-12T07:13:14-07:00 http://cppreference.com/wiki/stl/algorithm/pop_heap?rev=1255356794&do=diff pop_heap Syntax: #include <algorithm> void pop_heap( random_access_iterator start, random_access_iterator end ); void pop_heap( random_access_iterator start, random_access_iterator end, StrictWeakOrdering cmp ); The pop_heap() function removes the largest element (defined as the element at the front of the heap) from the given heap. text/html 2009-10-09T02:14:39-07:00 http://cppreference.com/wiki/stl/algorithm/prev_permutation?rev=1255079679&do=diff prev_permutation Syntax: #include <algorithm> bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end ); bool prev_permutation( bidirectional_iterator start, bidirectional_iterator end, StrictWeakOrdering cmp ); text/html 2010-04-07T05:08:47-07:00 http://cppreference.com/wiki/stl/algorithm/push_heap?rev=1270642127&do=diff push_heap Syntax: #include <algorithm> void push_heap( random_access_iterator start, random_access_iterator end ); void push_heap( random_access_iterator start, random_access_iterator end, StrictWeakOrdering cmp ); The push_heap() function adds an element (defined as the last element before end) to a heap (defined as the range of elements between [start,''end-1). text/html 2008-10-14T15:42:05-07:00 http://cppreference.com/wiki/stl/algorithm/random_sample?rev=1224024125&do=diff random_sample This function was part of the original SGI STL library, but never has been a part of ISO C++. text/html 2008-09-23T07:13:52-07:00 http://cppreference.com/wiki/stl/algorithm/random_sample_n?rev=1222179232&do=diff random_sample_n This function was part of the original SGI STL library, but never has been a part of ISO C++. text/html 2010-04-07T05:13:40-07:00 http://cppreference.com/wiki/stl/algorithm/random_shuffle?rev=1270642420&do=diff random_shuffle Syntax: #include <algorithm> void random_shuffle( random_access_iterator start, random_access_iterator end ); void random_shuffle( random_access_iterator start, random_access_iterator end, RandomNumberGenerator& rnd ); The random_shuffle() function randomly re-orders the elements in the range [start,end). If a random number generator function object rnd is supplied, it will be used instead of an internal random number generator. text/html 2009-10-09T01:21:30-07:00 http://cppreference.com/wiki/stl/algorithm/remove?rev=1255076490&do=diff remove Syntax: #include <algorithm> forward_iterator remove( forward_iterator start, forward_iterator end, const TYPE& val ); The remove algorithm removes all of the elements in the range [start,end) that are equal to val. The return value of this function is an iterator after the last element of the new sequence that should contain no elements equal to val. text/html 2009-10-09T01:23:16-07:00 http://cppreference.com/wiki/stl/algorithm/remove_copy?rev=1255076596&do=diff remove_copy Syntax: #include <algorithm> output_iterator remove_copy( input_iterator start, input_iterator end, output_iterator result, const TYPE& val ); The remove_copy() algorithm copies the range [start,end) to result but omits any elements that are equal to val. text/html 2009-10-09T01:24:00-07:00 http://cppreference.com/wiki/stl/algorithm/remove_copy_if?rev=1255076640&do=diff remove_copy_if Syntax: #include <algorithm> output_iterator remove_copy_if( input_iterator start, input_iterator end, output_iterator result, Predicate p ); The remove_copy_if() function copies the range of elements [start,end) to result, omitting any elements for which the predicate function p returns true. The return value of remove_copy_if() is an iterator the end of the new range. text/html 2010-05-28T14:02:50-07:00 http://cppreference.com/wiki/stl/algorithm/remove_if?rev=1275080570&do=diff remove_if Syntax: #include <algorithm> forward_iterator remove_if( forward_iterator start, forward_iterator end, Predicate p ); The remove_if() function removes all elements in the range [start,end) for which the predicate p returns true. text/html 2009-10-09T01:17:15-07:00 http://cppreference.com/wiki/stl/algorithm/replace?rev=1255076235&do=diff replace Syntax: #include <algorithm> void replace( forward_iterator start, forward_iterator end, const TYPE& old_value, const TYPE& new_value ); The replace() function sets every element in the range [start,end) that is equal to old_value to have new_value instead. text/html 2009-10-09T01:19:08-07:00 http://cppreference.com/wiki/stl/algorithm/replace_copy?rev=1255076348&do=diff replace_copy Syntax: #include <algorithm> output_iterator replace_copy( input_iterator start, input_iterator end, output_iterator result, const TYPE& old_value, const TYPE& new_value ); The replace_copy() function copies the elements in the range [start,end) to the destination result. Any elements in the range that are equal to old_value are replaced with new_value. text/html 2009-10-09T01:20:24-07:00 http://cppreference.com/wiki/stl/algorithm/replace_copy_if?rev=1255076424&do=diff replace_copy_if Syntax: #include <algorithm> output_iterator replace_copy_if( input_iterator start, input_iterator end, output_iterator result, Predicate p, const TYPE& new_value ); The replace_copy_if() function copies the elements in the range [start,end) to the destination result. Any elements for which the predicate p is true are replaced with new_value. text/html 2009-10-09T01:18:10-07:00 http://cppreference.com/wiki/stl/algorithm/replace_if?rev=1255076290&do=diff replace_if Syntax: #include <algorithm> void replace_if( forward_iterator start, forward_iterator end, Predicate p, const TYPE& new_value ); The replace_if() function assigns every element in the range [start,end) for which the predicate function p returns true the value of new_value. text/html 2009-10-09T01:33:24-07:00 http://cppreference.com/wiki/stl/algorithm/reverse?rev=1255077204&do=diff reverse Syntax: #include <algorithm> void reverse( bidirectional_iterator start, bidirectional_iterator end ); The reverse() algorithm reverses the order of elements in the range [start,end). Related Topics: reverse_copy text/html 2009-10-09T01:34:08-07:00 http://cppreference.com/wiki/stl/algorithm/reverse_copy?rev=1255077248&do=diff reverse_copy Syntax: #include <algorithm> output_iterator reverse_copy( bidirectional_iterator start, bidirectional_iterator end, output_iterator result ); The reverse_copy() algorithm copies the elements in the range [start,end) to result such that the elements in the new range are in reverse order. text/html 2009-10-09T01:37:55-07:00 http://cppreference.com/wiki/stl/algorithm/rotate?rev=1255077475&do=diff rotate Syntax: #include <algorithm> void rotate( forward_iterator start, forward_iterator middle, forward_iterator end ); The rotate() algorithm moves the elements in the range [start,end) such that the middle element is now where start used to be, (middle+1) is now at (start+1), etc. text/html 2009-10-09T01:40:32-07:00 http://cppreference.com/wiki/stl/algorithm/rotate_copy?rev=1255077632&do=diff rotate_copy Syntax: #include <algorithm> output_iterator rotate_copy( forward_iterator start, forward_iterator middle, forward_iterator end, output_iterator result ); The rotate_copy() algorithm is similar to the rotate() algorithm, except that the range of elements is copied to result before being rotated. text/html 2009-10-09T01:03:41-07:00 http://cppreference.com/wiki/stl/algorithm/search?rev=1255075421&do=diff search Syntax: #include <algorithm> forward_iterator search( forward_iterator start1, forward_iterator end1, forward_iterator2 start2, forward_iterator2 end2 ); forward_iterator search( forward_iterator start1, forward_iterator end1, forward_iterator2 start2, forward_iterator2 end2, BinPred p ); text/html 2009-10-09T01:05:42-07:00 http://cppreference.com/wiki/stl/algorithm/search_n?rev=1255075542&do=diff search_n Syntax: #include <algorithm> forward_iterator search_n( forward_iterator start, forward_iterator end, SIZE num, const TYPE& val ); forward_iterator search_n( forward_iterator start, forward_iterator end, SIZE num, const TYPE& val, BinPred p ); text/html 2010-04-07T05:30:49-07:00 http://cppreference.com/wiki/stl/algorithm/set_difference?rev=1270643449&do=diff set_difference Syntax: #include <algorithm> template< typename InIterA, typename InIterB, typename OutIter > OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result ); template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering > OutIter set_difference( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp ); text/html 2010-04-07T05:33:22-07:00 http://cppreference.com/wiki/stl/algorithm/set_intersection?rev=1270643602&do=diff set_intersection Syntax: #include <algorithm> template< typename InIterA, typename InIterB, typename OutIter > OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result ); template< typename InIterA, typename InIterB, typename OutIter, typename StrictWeakOrdering > OutIter set_intersection( InIterA start1, InIterA end1, InIterB start2, InIterB end2, OutIter result, StrictWeakOrdering cmp ); text/html 2010-04-07T05:36:00-07:00 http://cppreference.com/wiki/stl/algorithm/set_symmetric_difference?rev=1270643760&do=diff set_symmetric_difference Syntax: #include <algorithm> output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); output_iterator set_symmetric_difference( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); text/html 2010-04-07T05:37:10-07:00 http://cppreference.com/wiki/stl/algorithm/set_union?rev=1270643830&do=diff set_union Syntax: #include <algorithm> output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result ); output_iterator set_union( input_iterator start1, input_iterator end1, input_iterator2 start2, input_iterator2 end2, output_iterator result, StrictWeakOrdering cmp ); text/html 2010-06-14T10:33:06-07:00 http://cppreference.com/wiki/stl/algorithm/sort?rev=1276536786&do=diff sort Syntax: #include <algorithm> void sort( random_iterator start, random_iterator end ); void sort( random_iterator start, random_iterator end, StrictWeakOrdering cmp ); The sort() algorithm sorts the elements in the range [start,end) into ascending order. If two elements are equal, there is no guarantee what order they will be in. text/html 2010-04-07T05:38:32-07:00 http://cppreference.com/wiki/stl/algorithm/sort_heap?rev=1270643912&do=diff sort_heap Syntax: #include <algorithm> void sort_heap (random_access_iterator start, random_access_iterator end); void sort_heap (random_access_iterator start, random_access_iterator end, StrictWeakOrdering cmp); The sort_heap() function turns the heap defined by [start,end) into a sorted range. text/html 2009-10-09T01:59:55-07:00 http://cppreference.com/wiki/stl/algorithm/stable_partition?rev=1255078795&do=diff stable_partition Syntax: #include <algorithm> bidirectional_iterator stable_partition( bidirectional_iterator start, bidirectional_iterator end, Predicate p ); The stable_partition() function behaves similarily to partition(). The difference between the two algorithms is that stable_partition() will preserve the initial ordering of the elements in the two groups. text/html 2009-10-12T07:21:03-07:00 http://cppreference.com/wiki/stl/algorithm/stable_sort?rev=1255357263&do=diff stable_sort Syntax: #include <algorithm> void stable_sort( random_access_iterator start, random_access_iterator end ); void stable_sort( random_access_iterator start, random_access_iterator end, StrictWeakOrdering cmp ); The stable_sort() algorithm is like the sort() algorithm, in that it sorts a range of elements into ascending order. Unlike sort(), however, stable_sort() will preserve the original ordering of elements that are equal to each other. text/html 2010-01-19T05:29:18-07:00 http://cppreference.com/wiki/stl/algorithm/start?rev=1263907758&do=diff The following functions are defined in <algorithm> or <numeric> , and are part of the std namespace. accumulatesum up a range of elementsadjacent_differencecompute the differences between adjacent elements in a rangeadjacent_findfinds two identical (or some other relationship) items adjacent to each otherbinary_searchdetermine if an element exists in a certain rangecopycopy some range of elements to a new locationcopy_backwardcopy a range of elements in backwards ordercountreturn the number of … text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/algorithm/swap?rev=1224024126&do=diff swap Syntax: #include <algorithm> void swap( Assignable& a, Assignable& b ); The swap() function swaps the values of a and b. swap() expects that its arguments will conform to the Assignable model; that is, they should have a copy constructor and work with the = operator. This function performs one copy and two assignments. text/html 2009-10-09T02:23:02-07:00 http://cppreference.com/wiki/stl/algorithm/swap_ranges?rev=1255080182&do=diff swap_ranges Syntax: #include <algorithm> forward_iterator2 swap_ranges( forward_iterator start1, forward_iterator end1, forward_iterator2 start2 ); The swap_ranges() function exchanges the elements in the range [start1,end1) with the range of the same size starting at start2. text/html 2010-03-20T23:15:28-07:00 http://cppreference.com/wiki/stl/algorithm/transform?rev=1269152128&do=diff transform Syntax: #include <algorithm> output_iterator transform( input_iterator start, input_iterator end, output_iterator result, UnaryFunction f ); output_iterator transform( input_iterator start1, input_iterator end1, input_iterator2 start2, output_iterator result, BinaryFunction f ); text/html 2010-04-07T05:44:20-07:00 http://cppreference.com/wiki/stl/algorithm/unique?rev=1270644260&do=diff unique Syntax: #include <algorithm> forward_iterator p_end unique( forward_iterator start, forward_iterator end ); forward_iterator p_end unique( forward_iterator start, forward_iterator end, BinPred p ); The unique() algorithm removes all consecutive duplicate elements from the range [start, end]. The duplicate values are moved to the sequence's end. text/html 2009-10-09T01:15:32-07:00 http://cppreference.com/wiki/stl/algorithm/unique_copy?rev=1255076132&do=diff unique_copy Syntax: #include <algorithm> output_iterator unique_copy( input_iterator start, input_iterator end, output_iterator result ); output_iterator unique_copy( input_iterator start, input_iterator end, output_iterator result, BinPred p ); text/html 2010-04-22T21:27:53-07:00 http://cppreference.com/wiki/stl/algorithm/upper_bound?rev=1271996873&do=diff upper_bound Syntax: #include <algorithm> forward_iterator upper_bound( forward_iterator start, forward_iterator end, const TYPE& val ); forward_iterator upper_bound( forward_iterator start, forward_iterator end, const TYPE& val, StrictWeakOrdering cmp );