Range Based Algorithms
[Algorithms]


Detailed Description

STL algorithms which have been adapted to use models of ConvertibleToRange and ConvertibleToFunction for convenience.

Note:
The following algorithms differ from their STL counterparts. Read the documentation before using.


Modules

 binary_search
 copy
 count
 equal
 equal_range
 fill
 find
 for_each
 generate
 heap
 lexicographical_compare
 lower_bound
 merge
 min / max
 mismatch
 partition
 permutation
 random_shuffle
 remove
 replace
 reverse
 search
 set
 sort
 swap_ranges
 transform
 unique
 upper_bound

Copyright © 2006-2007 Adobe Systems Incorporated.

Use of this website signifies your agreement to the Terms of Use and Online Privacy Policy.

Search powered by Google