Collaboration diagram for Algorithms:
Modules | |
Comparisons | |
Algorithms to compare ranges and elements. | |
Copying | |
Algorithms for copying elements. | |
Heaps | |
Algorithms which operate on heaps. | |
Merges | |
Algorithms for merging. | |
Partitioning | |
Algorithms for partitioning. | |
Searches | |
Algorithms for performing searches. | |
Sets | |
Algorithms for performing operations on sets. | |
Sorting | |
Algorithms for sorting. | |
Swapping | |
Algorithms for swapping elements. | |
Transformations | |
Algorithms for transforming ranges. | |
Classes | |
class | OLAlgorithm |
A class to provide generic algorithms for use with many different types of containers. More... |
Algorithms are separated from the underlying data structures on which they operate through the use of iterators. Algorithms are only given iterators as arguments, and have no information about what kind of collection the iterators might be from.
|