# Iterators

Iterators are a generic means of addressing a particular element or range of sequential elements in a sequence. They are also the mechanism that makes it possible to decouple algorithms from concrete compile-time sequence implementations. Under the hood, all MPL sequence algorithms are implemented in terms of iterators, which, in particular, means that they will work on any custom compile-time sequence, given that the appropriate iterator inteface is provided.

#### Concepts

- Trivial Iterator
- Input Iterator
- Forward Iterator
- Bidirectional Iterator
- Random Access Iterator

#### Metafunctions

- iterator_category
- begin/end
- deref
- advance
- distance

Table of Contents
Last edited March 10, 2003 1:42 am