diff --git a/doc/counting_iterator.html b/doc/counting_iterator.html index 6f9e8b4..c7debc3 100644 --- a/doc/counting_iterator.html +++ b/doc/counting_iterator.html @@ -3,7 +3,7 @@
- +Iterators play an important role in modern C++ programming. The iterator is the central abstraction of the algorithms of the Standard Library, allowing algorithms to be re-used in in a wide variety of @@ -226,15 +226,15 @@ applies some user-specified function during the dereference of the iterator.
This proposal is purely an addition to the C++ standard library. However, note that this proposal relies on the proposal for New Iterator Concepts.
This proposal is formulated in terms of the new iterator concepts as proposed in n1550, since user-defined and especially adapted iterators suffer from the well known categorization problems that are @@ -244,7 +244,7 @@ is a direct mapping between new and old categories. This proposal could be reformulated using this mapping if n1550 was not accepted.
The question of iterator interoperability is poorly addressed in the current standard. There are currently two defect reports that are concerned with interoperability issues.
@@ -264,7 +264,7 @@ fixes the issues raised in 280. It provides the desired interoperability without introducing unwanted overloads.template < class Iterator @@ -1316,7 +1325,7 @@ satisfies the requirements of the concepts modeled by the indirect iterator as specified in the models section.
The Iterator argument shall meet the requirements of Readable Iterator. The CategoryOrTraversal argument shall be one of the standard iterator tags or use_default. If CategoryOrTraversal @@ -1332,7 +1341,7 @@ is not use_default, as implied default for the value_type member.
If CategoryOrTraversal is a standard iterator tag, indirect_iterator is a model of the iterator concept corresponding to the tag, otherwise indirect_iterator satisfies the requirements @@ -1346,7 +1355,7 @@ the Iterator argument.
indirect_iterator models Lvalue Iterator.indirect_iterator();
In addition to those operations required by the concepts that filter_iterator models, filter_iterator provides the following operations.
@@ -1903,11 +1912,11 @@ or m_pred(*m_iter) -counting_iterator adapts an arithmetic type, such as int, by adding an operator* that returns the current value of the object.
template <
class Incrementable
@@ -1932,13 +1941,13 @@ the cases when the Incrementable
The Incrementable type must be Default Constructible, Copy Constructible, and Assignable. The default distance is an implementation defined signed integral type.
counting_iterator models Readable Lvalue Iterator.
Furthermore, if you wish to create a counting iterator that is a Forward Traversal Iterator, then the following expressions must be valid:
@@ -1963,7 +1972,7 @@ i < jcounting_iterator();
output_proxy(UnaryFunction& f);
diff --git a/doc/filter_iterator.html b/doc/filter_iterator.html index 0aa7457..4a8139e 100644 --- a/doc/filter_iterator.html +++ b/doc/filter_iterator.html @@ -3,7 +3,7 @@
- +
@@ -108,7 +108,7 @@ Input Iterator.
The concepts that filter_iterator models are dependent on what concepts the Iterator argument models, as specified in the following tables.
-