mirror of
https://github.com/boostorg/mpl.git
synced 2026-01-26 17:02:20 +01:00
31 lines
1.6 KiB
HTML
31 lines
1.6 KiB
HTML
<!doctype html public "-//ietf//dtd html//en">
|
|
<html><head><title>boost::mpl::Iterators</title>
|
|
<link rel="stylesheet" href="./mpl_wiki.css">
|
|
</head><body bgcolor="white">
|
|
<h1><a href="./Table_of_Contents.html"><img src="./mpl_logo.jpg" alt="[Home]" border=0 align="right"></a>Iterators</h1>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 <a href="./Algorithms.html">sequence algorithms</a>
|
|
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.
|
|
<p>
|
|
<h4>Concepts</h4>
|
|
<ul>
|
|
<li><a href="./Trivial_Iterator.html">Trivial Iterator</a>
|
|
<li><a href="./Input_Iterator.html">Input Iterator</a>
|
|
<li><a href="./Forward_Iterator.html">Forward Iterator</a>
|
|
<li><a href="./Bidirectional_Iterator.html">Bidirectional Iterator</a>
|
|
<li><a href="./Random_Access_Iterator.html">Random Access Iterator</a>
|
|
</ul>
|
|
<p>
|
|
<h4>Metafunctions</h4>
|
|
<ul>
|
|
<li><a href="./Reference/iterator_category.html">iterator_category</a>
|
|
<li><a href="./Reference/begin.html">begin</a>/<a href="./Reference/end.html">end</a>
|
|
<li><a href="./Reference/deref.html">deref</a>
|
|
<li><a href="./Reference/advance.html">advance</a>
|
|
<li><a href="./Reference/distance.html">distance</a>
|
|
</ul>
|
|
<p><hr>
|
|
<a href="./Table_of_Contents.html">Table of Contents</a><br>Last edited March 10, 2003 1:42 am</body></html> |