feedc0de/boost_iterator
1
0
Fork 0
forked from boostorg/iterator
Code Pull Requests Activity

small edits

Browse Source 
[SVN r20159]
This commit is contained in:
Jeremy Siek
2003-09-22 16:32:56 +00:00
parent d85b8db0aa
commit ac0c6461fb
2 changed files with 20 additions and 19 deletions
Download Patch File Download Diff File Expand all files Collapse all files

19
doc/new-iter-concepts.html
View File

@ -300,15 +300,16 @@ lvalue so that the appropriate old category can be chosen for the base
class. The <tt class="literal"><span class="pre">lvalue_iterator</span></tt> bit is not recorded in the class. The <tt class="literal"><span class="pre">lvalue_iterator</span></tt> bit is not recorded in the
<tt class="literal"><span class="pre">iterator_tag::access</span></tt> data member.</p> <tt class="literal"><span class="pre">iterator_tag::access</span></tt> data member.</p>
<p>The <tt class="literal"><span class="pre">iterator_tag</span></tt> class template is derived from the appropriate <p>The <tt class="literal"><span class="pre">iterator_tag</span></tt> class template is derived from the appropriate
iterator tag or tags from the old requirements based on the new-style iterator tag or tags from the old requirements based on the access
tags passed as template parameters. The algorithm for determining the bits and traversal tag passed as template parameters. The algorithm
old tag or tags from the new tags picks the least-refined old concepts for determining the old tag or tags picks the least-refined old
that include all of the requirements of the access and traversal concepts that include all of the requirements of the access and
concepts (that is, the closest fit), if any such category exists. For traversal concepts (that is, the closest fit), if any such category
example, the category tag for a Readable Single Pass Iterator will exists. For example, the category tag for a Readable Single Pass
always be derived from <tt class="literal"><span class="pre">input_iterator_tag</span></tt>, while the category tag Iterator will always be derived from <tt class="literal"><span class="pre">input_iterator_tag</span></tt>, while the
for a Single Pass Iterator that is both Readable and Writable will be category tag for a Single Pass Iterator that is both Readable and
derived from both <tt class="literal"><span class="pre">input_iterator_tag</span></tt> and <tt class="literal"><span class="pre">output_iterator_tag</span></tt>.</p> Writable will be derived from both <tt class="literal"><span class="pre">input_iterator_tag</span></tt> and
<tt class="literal"><span class="pre">output_iterator_tag</span></tt>.</p>
<p>We also provide several helper classes that make it convenient to <p>We also provide several helper classes that make it convenient to
obtain the access and traversal characteristics of an iterator. These obtain the access and traversal characteristics of an iterator. These
helper classes work both for iterators whose <tt class="literal"><span class="pre">iterator_category</span></tt> is helper classes work both for iterators whose <tt class="literal"><span class="pre">iterator_category</span></tt> is

20
doc/new-iter-concepts.rst
View File

@ -283,16 +283,16 @@ class. The ``lvalue_iterator`` bit is not recorded in the
``iterator_tag::access`` data member. ``iterator_tag::access`` data member.
The ``iterator_tag`` class template is derived from the appropriate The ``iterator_tag`` class template is derived from the appropriate
iterator tag or tags from the old requirements based on the new-style iterator tag or tags from the old requirements based on the access
tags passed as template parameters. The algorithm for determining the bits and traversal tag passed as template parameters. The algorithm
old tag or tags from the new tags picks the least-refined old concepts for determining the old tag or tags picks the least-refined old
that include all of the requirements of the access and traversal concepts that include all of the requirements of the access and
concepts (that is, the closest fit), if any such category exists. For traversal concepts (that is, the closest fit), if any such category
example, the category tag for a Readable Single Pass Iterator will exists. For example, the category tag for a Readable Single Pass
always be derived from ``input_iterator_tag``, while the category tag Iterator will always be derived from ``input_iterator_tag``, while the
for a Single Pass Iterator that is both Readable and Writable will be category tag for a Single Pass Iterator that is both Readable and
derived from both ``input_iterator_tag`` and ``output_iterator_tag``. Writable will be derived from both ``input_iterator_tag`` and
``output_iterator_tag``.
We also provide several helper classes that make it convenient to We also provide several helper classes that make it convenient to
obtain the access and traversal characteristics of an iterator. These obtain the access and traversal characteristics of an iterator. These