diff --git a/doc/counting_iterator.html b/doc/counting_iterator.html index 904d62c..9e5b105 100644 --- a/doc/counting_iterator.html +++ b/doc/counting_iterator.html @@ -7,7 +7,7 @@ Counting Iterator - + @@ -27,7 +27,7 @@ Lab, University of Hanover Institute for Transport Railway Operation and Construction Date: -2004-01-13 +2004-01-15 Copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All rights reserved @@ -148,8 +148,8 @@ tag CategoryOrTraversal. Othe Otherwise, counting_iterator models the same iterator traversal concepts modeled by Incrementable.

counting_iterator<X,C1,D1> is interoperable with -counting_iterator<Y,C2,D2> if and only if iterator X is -interoperable with iterator Y.

+counting_iterator<Y,C2,D2> if and only if X is +interoperable with Y.

counting_iterator operations

diff --git a/doc/counting_iterator_ref.rst b/doc/counting_iterator_ref.rst index 3c86a3e..850f150 100644 --- a/doc/counting_iterator_ref.rst +++ b/doc/counting_iterator_ref.rst @@ -92,8 +92,8 @@ Otherwise, ``counting_iterator`` models the same iterator traversal concepts modeled by ``Incrementable``. ``counting_iterator`` is interoperable with -``counting_iterator`` if and only if iterator ``X`` is -interoperable with iterator ``Y``. +``counting_iterator`` if and only if ``X`` is +interoperable with ``Y``. diff --git a/doc/facade-and-adaptor.html b/doc/facade-and-adaptor.html index e13245b..d910380 100755 --- a/doc/facade-and-adaptor.html +++ b/doc/facade-and-adaptor.html @@ -1592,9 +1592,9 @@ convertible to input_iterator_tag

reverse_iterator models

-

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 +

A specialization of reverse_iterator models the same iterator +traversal and iterator access concepts modeled by its Iterator +argument. In addition, it may model old iterator concepts specified in the following table:

@@ -1625,8 +1625,9 @@ Random Access Traversal Iterator
-

reverse_iterator<X> is interoperable with reverse_iterator<Y> -if and only if iterator X is interoperable with iterator Y.

+

reverse_iterator<X> is interoperable with +reverse_iterator<Y> if and only if X is interoperable with +Y.

reverse_iterator operations

@@ -1829,8 +1830,8 @@ the Iterator argument models.<

If transform_iterator models Writable Lvalue Iterator then it is a mutable iterator (as defined in the old iterator requirements).

transform_iterator<F1, X, R1, V1> is interoperable with -transform_iterator<F2, Y, R2, V2> if and only if iterator X is -interoperable with iterator Y.

+transform_iterator<F2, Y, R2, V2> if and only if X is +interoperable with Y.

transform_iterator operations

@@ -2058,7 +2059,7 @@ following tables.

filter_iterator<P1, X> is interoperable with filter_iterator<P2, Y> -if and only if iterator X is interoperable with iterator Y.

+if and only if X is interoperable with Y.

filter_iterator operations

@@ -2263,8 +2264,8 @@ tag CategoryOrTraversal. Othe Otherwise, counting_iterator models the same iterator traversal concepts modeled by Incrementable.

counting_iterator<X,C1,D1> is interoperable with -counting_iterator<Y,C2,D2> if and only if iterator X is -interoperable with iterator Y.

+counting_iterator<Y,C2,D2> if and only if X is +interoperable with Y.

counting_iterator operations

diff --git a/doc/filter_iterator.html b/doc/filter_iterator.html index 2f0d4a1..4449469 100644 --- a/doc/filter_iterator.html +++ b/doc/filter_iterator.html @@ -180,7 +180,7 @@ following tables.

filter_iterator<P1, X> is interoperable with filter_iterator<P2, Y> -if and only if iterator X is interoperable with iterator Y.

+if and only if X is interoperable with Y.

filter_iterator operations

diff --git a/doc/filter_iterator_ref.rst b/doc/filter_iterator_ref.rst index 5164228..3f77471 100644 --- a/doc/filter_iterator_ref.rst +++ b/doc/filter_iterator_ref.rst @@ -93,7 +93,7 @@ following tables. ``filter_iterator`` is interoperable with ``filter_iterator`` -if and only if iterator ``X`` is interoperable with iterator ``Y``. +if and only if ``X`` is interoperable with ``Y``. ``filter_iterator`` operations diff --git a/doc/indirect_iterator.html b/doc/indirect_iterator.html index 64e48ea..8cf1bbb 100644 --- a/doc/indirect_iterator.html +++ b/doc/indirect_iterator.html @@ -7,7 +7,7 @@ Indirect Iterator - + @@ -27,7 +27,7 @@ Lab, University of Hanover Institute for Transport Railway Operation and Construction Date: -2004-01-13 +2004-01-15 Copyright: Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003. All rights reserved diff --git a/doc/new-iter-concepts.html b/doc/new-iter-concepts.html index 735328c..e7dc9ae 100755 --- a/doc/new-iter-concepts.html +++ b/doc/new-iter-concepts.html @@ -7,7 +7,7 @@ New Iterator Concepts - + @@ -27,7 +27,7 @@ Systems Lab, University of Hanover Institute for Transport Railway Operation and Construction Date: -2004-01-14 +2004-01-15 Number:This is a revised version of n1550=03-0133, which was accepted for Technical Report 1 by the C++ standard committee's library working group. This proposal is a diff --git a/doc/permutation_iterator.html b/doc/permutation_iterator.html index 6dac1cd..21fc381 100644 --- a/doc/permutation_iterator.html +++ b/doc/permutation_iterator.html @@ -131,9 +131,9 @@ as IndexIterator and the same

If IndexIterator models Random Access Traversal Iterator and ElementIterator models Readable Lvalue Iterator then permutation_iterator models Random Access Iterator.

-

permutation_iterator<X, I1, V1, C2, R1, D1> is interoperable with -permutation_iterator<Y, I2, V2, C2, R2, D2> if and only if -iterator X is interoperable with iterator Y.

+

permutation_iterator<X, I1, V1, C2, R1, D1> is interoperable +with permutation_iterator<Y, I2, V2, C2, R2, D2> if and only if +X is interoperable with Y.

permutation_iterator operations

diff --git a/doc/permutation_iterator_ref.rst b/doc/permutation_iterator_ref.rst index 384d74c..6972cb3 100644 --- a/doc/permutation_iterator_ref.rst +++ b/doc/permutation_iterator_ref.rst @@ -64,9 +64,9 @@ If ``IndexIterator`` models Random Access Traversal Iterator and ``ElementIterator`` models Readable Lvalue Iterator then ``permutation_iterator`` models Random Access Iterator. -``permutation_iterator`` is interoperable with -``permutation_iterator`` if and only if -iterator ``X`` is interoperable with iterator ``Y``. +``permutation_iterator`` is interoperable +with ``permutation_iterator`` if and only if +``X`` is interoperable with ``Y``. ``permutation_iterator`` operations diff --git a/doc/reverse_iterator.html b/doc/reverse_iterator.html index 4cc6d36..f696d42 100644 --- a/doc/reverse_iterator.html +++ b/doc/reverse_iterator.html @@ -94,9 +94,9 @@ convertible to input_iterator_tag

reverse_iterator models

-

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 +

A specialization of reverse_iterator models the same iterator +traversal and iterator access concepts modeled by its Iterator +argument. In addition, it may model old iterator concepts specified in the following table:

@@ -127,8 +127,9 @@ Random Access Traversal Iterator
-

reverse_iterator<X> is interoperable with reverse_iterator<Y> -if and only if iterator X is interoperable with iterator Y.

+

reverse_iterator<X> is interoperable with +reverse_iterator<Y> if and only if X is interoperable with +Y.

reverse_iterator operations

diff --git a/doc/reverse_iterator_ref.rst b/doc/reverse_iterator_ref.rst index 875f2ca..3a2ee45 100644 --- a/doc/reverse_iterator_ref.rst +++ b/doc/reverse_iterator_ref.rst @@ -47,9 +47,9 @@ convertible to ``input_iterator_tag``. ``reverse_iterator`` models ........................... -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 +A specialization of ``reverse_iterator`` models the same iterator +traversal and iterator access concepts modeled by its ``Iterator`` +argument. In addition, it may model old iterator concepts specified in the following table: +---------------------------------------+-----------------------------------+ @@ -69,10 +69,9 @@ specified in the following table: +---------------------------------------+-----------------------------------+ -``reverse_iterator`` is interoperable with ``reverse_iterator`` -if and only if iterator ``X`` is interoperable with iterator ``Y``. - - +``reverse_iterator`` is interoperable with +``reverse_iterator`` if and only if ``X`` is interoperable with +``Y``. ``reverse_iterator`` operations ............................... diff --git a/doc/transform_iterator_ref.rst b/doc/transform_iterator_ref.rst index dedf3fe..ad35d6f 100644 --- a/doc/transform_iterator_ref.rst +++ b/doc/transform_iterator_ref.rst @@ -103,8 +103,8 @@ If ``transform_iterator`` models Writable Lvalue Iterator then it is a mutable iterator (as defined in the old iterator requirements). ``transform_iterator`` is interoperable with -``transform_iterator`` if and only if iterator ``X`` is -interoperable with iterator ``Y``. +``transform_iterator`` if and only if ``X`` is +interoperable with ``Y``.