[ceph.git] / ceph / src / boost / libs / mpl / doc / src / refmanual / Iterators-Concepts.rst


All iterators in MPL are classified into three iterator concepts, or 
`categories`, named according to the type of traversal provided. The
categories are: |Forward Iterator|, |Bidirectional Iterator|, and 
|Random Access Iterator|. The concepts are hierarchical: 
|Random Access Iterator| is a refinement of |Bidirectional Iterator|,
which, in its turn, is a refinement of |Forward Iterator|.

Because of the inherently immutable nature of the value access, MPL 
iterators escape the problems of the traversal-only categorization 
discussed at length in [n1550]_.

.. [n1550] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1550.htm
Commit	Line	Data
7c673cae FG	1
	2	All iterators in MPL are classified into three iterator concepts, or
	3	`categories`, named according to the type of traversal provided. The
	4	categories are: \|Forward Iterator\|, \|Bidirectional Iterator\|, and
	5	\|Random Access Iterator\|. The concepts are hierarchical:
	6	\|Random Access Iterator\| is a refinement of \|Bidirectional Iterator\|,
	7	which, in its turn, is a refinement of \|Forward Iterator\|.
	8
	9	Because of the inherently immutable nature of the value access, MPL
	10	iterators escape the problems of the traversal-only categorization
	11	discussed at length in [n1550]_.
	12
	13	.. [n1550] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1550.htm
	14
	15
	16