diff --git a/doc/new-iter-concepts.html b/doc/new-iter-concepts.html index 58e61ba..805a43f 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-13 +2004-01-14 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 @@ -832,9 +832,6 @@ respect the stated semantics. In the tables below, X, y is an object of type Y, Distance is iterator_traits<Y>::difference_type, and n represents a constant object of type Distance.

-

If the traversal tags for X and Y are convertible to -single_pass_traversal_tag then the following requirements must be -met.

@@ -874,9 +871,8 @@ met.

-

If the traversal tags for X and Y are convertible to -random_access_traversal_tag then the following requirements must -be met.

+

If X and Y both model Random Access Traversal Iterator then +the following additional requirements must be met.

@@ -939,9 +935,7 @@ ordering relation - + - +
y - x Distancex < y ? -distance(Y(x),y) -: -distance(y,Y(x))distance(Y(x),y) pre: there exists a value n of Distance such that @@ -950,9 +944,7 @@ value n of
x - y Distancey < x ? -distance(y,Y(x)) -: -distance(Y(x),y)distance(y,Y(x)) pre: there exists a value n of Distance such that