|
|
The algorithms defined by the Standard Template Library are described here. These algorithms operate on containers through iterators. All of the algorithms are template functions. They require the header <algorithm>. Here are descriptions of the generic type names used by the algorithms:
Generic Name | Represents |
---|---|
BiIter | Bidirectional iterator |
ForIter | Forward iterator |
InIter | Input iterator |
OutIter | Output iterator |
RandIter | Random access iterator |
T | Some type of data |
Size | Some type of integer |
Func | Some type of function |
Generator | A function that generates objects |
BinPred | Binary predicate |
UnPred | Unary predicate |
Comp | Comparison function |
|
|