boost_mirror/iterator
1
0
Fork 0
mirror of https://github.com/boostorg/iterator.git synced 2025-05-11 21:43:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

tweaks

Browse Source 
[SVN r21671]
This commit is contained in:
Dave Abrahams 2004-01-13 13:12:45 +00:00
parent 55e4fe2ab7
commit e5d502d2f8
1 changed files with 21 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

46
doc/reverse_iterator_ref.rst
View File

@ -48,37 +48,33 @@ tag given by the following algorithm. Let ``T`` be
``reverse_iterator`` requirements
.................................
The base ``Iterator`` must be a model of Bidirectional Traversal
Iterator and Readable Iterator.
``Iterator`` must be a model of Bidirectional Traversal Iterator
and Readable Iterator.
``reverse_iterator`` models
...........................
``reverse_iterator`` models the same standard traversal and access
iterator concepts that the ``Iterator`` argument models. In addition,
``reverse_iterator`` models the old iterator concepts specified in the
following table, depnding on what the ``Iterator`` argument models.
+-------------------------------------------------------+----------------------------------+
| If ``Iterator`` models | then ``reverse_iterator`` models |
+=======================================================+==================================+
| Readable Lvalue Iterator, | Bidirectional Iterator |
| Bidirectional Traversal Iterator | |
+-------------------------------------------------------+----------------------------------+
| Writable Lvalue Iterator, | Mutable Bidirectional Iterator |
| Bidirectional Traversal Iterator | |
+-------------------------------------------------------+----------------------------------+
| Readable Lvalue Iterator, | Random Access Iterator |
| Random Access Traversal Iterator | |
+-------------------------------------------------------+----------------------------------+
| Writable Lvalue Iterator, | Mutable Random Access Iterator |
| Random Access Traversal Iterator | |
+-------------------------------------------------------+----------------------------------+
A specialization of ``reverse_iterator`` models the same standard
traversal and access iterator concepts modeled by its ``Iterator``
argument. In addition, it models the old iterator concepts
specified in the following table:
+---------------------------------------+-----------------------------------+
| If ``I`` models |then ``reverse_iterator<I>`` models|
+=======================================+===================================+
| Readable Lvalue Iterator, | Bidirectional Iterator |
| Bidirectional Traversal Iterator | |
+---------------------------------------+-----------------------------------+
| Writable Lvalue Iterator, | Mutable Bidirectional Iterator |
| Bidirectional Traversal Iterator | |
+---------------------------------------+-----------------------------------+
| Readable Lvalue Iterator, | Random Access Iterator |
| Random Access Traversal Iterator | |
+---------------------------------------+-----------------------------------+
| Writable Lvalue Iterator, | Mutable Random Access Iterator |
| Random Access Traversal Iterator | |
+---------------------------------------+-----------------------------------+
``reverse_iterator`` operations