2004-11-29 06:33:06 +00:00
|
|
|
|
2007-11-06 23:39:09 +00:00
|
|
|
.. Copyright Aleksey Gurtovoy, David Abrahams 2007.
|
|
|
|
|
.. Distributed under the Boost
|
|
|
|
|
.. Software License, Version 1.0. (See accompanying
|
|
|
|
|
.. file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
2008-06-17 21:46:20 +00:00
|
|
|
|
2004-11-29 06:33:06 +00:00
|
|
|
Iterators are generic means of addressing a particular element or a range
|
|
|
|
|
of sequential elements in a sequence. They are also a 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. In particular, that means that they
|
|
|
|
|
will work on any custom compile-time sequence, given that the appropriate
|
|
|
|
|
iterator inteface is provided.
|
|
|
|
|
|
|
|
|
|
__ `Algorithms`_
|
|
|
|
|
__ `label-Sequences-Classes`_
|
|
|
|
|
|
|
|
|
|
.. Analogy with STL iterators?
|
|
|
|
|
.. More?
|
