]>
Commit | Line | Data |
---|---|---|
1 | ||
2 | Iterators are generic means of addressing a particular element or a range | |
3 | of sequential elements in a sequence. They are also a mechanism that makes | |
4 | it possible to decouple `algorithms`__ from concrete compile-time `sequence | |
5 | implementations`__. Under the hood, all MPL sequence algorithms are | |
6 | implemented in terms of iterators. In particular, that means that they | |
7 | will work on any custom compile-time sequence, given that the appropriate | |
8 | iterator interface is provided. | |
9 | ||
10 | __ `Algorithms`_ | |
11 | __ `label-Sequences-Classes`_ | |
12 | ||
13 | .. Analogy with STL iterators? | |
14 | .. More? | |
15 | ||
16 | ||
17 | .. copyright:: Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams | |
18 | Distributed under the Boost Software License, Version 1.0. (See accompanying | |
19 | file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) |