Iterators into a Forward Container satisfy the forward iterator requirements; consequently, Forward Containers support multipass algorithms and allow multiple iterators into the same container to be active at the same time.
Refinement ofContainer, EqualityComparable, LessThanComparable Associated types No additional types beyond those defined in Container. However, the requirements for the iterator type are strengthened: the iterator type must be a model of Forward Iterator. Notation X A type that is a model of Forward Container a, b Object of type X T The value type of X Definitions Valid expressions In addition to the expressions defined in Container, EqualityComparable, and LessThanComparable, the following expressions must be valid. Expression semantics Semantics of an expression is defined only where it is not defined in Container, EqualityComparable, or LessThanComparable, or where there is additional information. Name Expression Precondition Semantics Postcondition Equality a == b Returns true if a.size() == b.size() and if each element of a compares equal to the corresponding element of b. Otherwise returns false. Less a < b Equivalent to lexicographical_compare(a,b) Complexity guarantees The equality and inequality operations are linear in the container's size. Invariants Ordering Two different iterations through a forward container will access its elements in the same order, providing that there have been no intervening mutative operations. Models Notes See also The iterator overview, Forward Iterator, Sequence STL Main PageRetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4