diff --git a/doc/counting_iterator.html b/doc/counting_iterator.html index 305714f..66a91a9 100644 --- a/doc/counting_iterator.html +++ b/doc/counting_iterator.html @@ -268,7 +268,7 @@ indirectly printing out the numbers from 0 to 7
View document source. -Generated on: 2004-01-13 14:22 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/facade-and-adaptor.html b/doc/facade-and-adaptor.html index a81aa5e..0d02978 100755 --- a/doc/facade-and-adaptor.html +++ b/doc/facade-and-adaptor.html @@ -2350,7 +2350,7 @@ LocalWords: OtherIncrementable Coplien -->
View document source. -Generated on: 2004-01-13 14:22 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/filter_iterator.html b/doc/filter_iterator.html index 47981b2..67ff6a4 100644 --- a/doc/filter_iterator.html +++ b/doc/filter_iterator.html @@ -299,10 +299,7 @@ make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()); -Returns:An instance of filter_iterator<Predicate,Iterator> -where m_iter is either the first position in the range [x,end) such that -f(*this->base()) == true or else m_iter == end. -The member m_pred is constructed from f and m_end from end. +Returns:filter_iterator<Predicate,Iterator>(f, x, end) @@ -315,12 +312,7 @@ make_filter_iterator(Iterator x, Iterator end = Iterator()); -Returns:An instance of filter_iterator<Predicate,Iterator> -where m_iter is either the first position in the range [x,end) -such that f(*this->base()) == true, where f is a default -constructed Predicate, or else m_iter == end. -The member m_pred is default constructed and m_end -is constructed from end. +Returns:filter_iterator<Predicate,Iterator>(x, end) @@ -391,7 +383,7 @@ int main()
View document source. -Generated on: 2004-01-13 13:50 UTC. +Generated on: 2004-01-13 15:59 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/function_output_iterator.html b/doc/function_output_iterator.html index 3b80621..4bae3a3 100644 --- a/doc/function_output_iterator.html +++ b/doc/function_output_iterator.html @@ -163,7 +163,7 @@ int main(int, char*[])
View document source. -Generated on: 2004-01-13 13:52 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/index.html b/doc/index.html index 0934cfc..0d4537d 100755 --- a/doc/index.html +++ b/doc/index.html @@ -3,7 +3,7 @@ - + The Boost.Iterator Library Boost @@ -223,10 +223,10 @@ LocalWords: incrementable xxx min prev inplace png oldeqnew AccessTag struct LocalWords: TraversalTag typename lvalues DWA Hmm JGS --> -
+
View document source. -Generated on: 2004-01-12 15:41 UTC. +Generated on: 2004-01-13 14:25 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/indirect_iterator.html b/doc/indirect_iterator.html index b7f57df..9273ed4 100644 --- a/doc/indirect_iterator.html +++ b/doc/indirect_iterator.html @@ -3,7 +3,7 @@ - + Indirect Iterator @@ -324,10 +324,10 @@ a,b,c,d,e,f,g,

The source code for this example can be found here.

-
+
View document source. -Generated on: 2004-01-13 05:55 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/iterator_adaptor.html b/doc/iterator_adaptor.html index 36b51aa..78885df 100644 --- a/doc/iterator_adaptor.html +++ b/doc/iterator_adaptor.html @@ -3,7 +3,7 @@ - + Iterator Adaptor @@ -433,10 +433,10 @@ adaptors to get an idea of the sorts of things you can do with counting_iterator, which demonstrates that iterator_adaptor's Base type needn't be an iterator.

-
+
View document source. -Generated on: 2004-01-12 21:18 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/iterator_facade.html b/doc/iterator_facade.html index d125713..a70a6c0 100644 --- a/doc/iterator_facade.html +++ b/doc/iterator_facade.html @@ -3,7 +3,7 @@ - + Iterator Facade @@ -144,7 +144,7 @@ of the derived iterator type. These member functions are described briefly below and in more detail in the iterator facade requirements.

- +
@@ -397,7 +397,7 @@ is a constant object of a random access traversal iterator type interoperable with X.

iterator_facade Core Operations

-
+
@@ -1134,10 +1134,10 @@ even be superior.

-
+
View document source. -Generated on: 2004-01-12 21:18 UTC. +Generated on: 2004-01-13 14:25 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/make_filter_iterator.rst b/doc/make_filter_iterator.rst index ba0c078..e4cd877 100755 --- a/doc/make_filter_iterator.rst +++ b/doc/make_filter_iterator.rst @@ -5,10 +5,7 @@ filter_iterator make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()); -:Returns: An instance of ``filter_iterator`` - where ``m_iter`` is either the first position in the range ``[x,end)`` such that - ``f(*this->base()) == true`` or else ``m_iter == end``. - The member ``m_pred`` is constructed from ``f`` and ``m_end`` from ``end``. +:Returns: filter_iterator(f, x, end) :: @@ -16,9 +13,4 @@ filter_iterator make_filter_iterator(Iterator x, Iterator end = Iterator()); -:Returns: An instance of ``filter_iterator`` - where ``m_iter`` is either the first position in the range ``[x,end)`` - such that ``f(*this->base()) == true``, where ``f`` is a default - constructed ``Predicate``, or else ``m_iter == end``. - The member ``m_pred`` is default constructed and ``m_end`` - is constructed from ``end``. +:Returns: filter_iterator(x, end) diff --git a/doc/new-iter-concepts.html b/doc/new-iter-concepts.html index 783f6ab..7741941 100755 --- a/doc/new-iter-concepts.html +++ b/doc/new-iter-concepts.html @@ -3,7 +3,7 @@ - + New Iterator Concepts @@ -107,7 +107,7 @@ geared towards iterator traversal (hence the category names), while requirements that address value access sneak in at various places. The following table gives a summary of the current value access requirements in the iterator categories.

-
+
@@ -364,7 +364,7 @@ for value type T if, in additi Copy Constructible, the following expressions are valid and respect the stated semantics. U is the type of any specified member of type T.

-
+
@@ -409,7 +409,7 @@ non-cv-qualified type if, in addition to X being Copy Constructible, the following expressions are valid and respect the stated semantics. Writable Iterators have an associated set of value types.

-
+
@@ -438,7 +438,7 @@ value types of X

A class or built-in type X models the Swappable Iterator concept if, in addition to X being Copy Constructible, the following expressions are valid and respect the stated semantics.

-
+
@@ -470,7 +470,7 @@ exchanged

The Lvalue Iterator concept adds the requirement that the return type of operator* type be a reference to the value type of the iterator.

-
+
@@ -512,7 +512,7 @@ type X, X being Assignable and Copy Constructible, the following expressions are valid and respect the stated semantics.

-
+
@@ -557,7 +557,7 @@ incrementable_traversal_tag for consistency. -->

A class or built-in type X models the Single Pass Iterator concept if the following expressions are valid and respect the stated semantics.

-
+
@@ -606,7 +606,7 @@ single_pass_traversal_tag for consistency --> concept if, in addition to X meeting the requirements of Single Pass Iterator, the following expressions are valid and respect the stated semantics.

-
+
@@ -653,7 +653,7 @@ forward_traversal_tag for consistency --> Iterator concept if, in addition to X meeting the requirements of Forward Traversal Iterator, the following expressions are valid and respect the stated semantics.

-
+
@@ -709,7 +709,7 @@ Iterator concept if the following expressions are valid and respect the stated semantics. In the table below, Distance is iterator_traits<X>::difference_type and n represents a constant object of type Distance.

-
+
@@ -875,10 +875,10 @@ LocalWords: incrementable xxx min prev inplace png oldeqnew AccessTag struct LocalWords: TraversalTag typename lvalues DWA Hmm JGS mis enum --> -
+
View document source. -Generated on: 2004-01-13 00:29 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/permutation_iterator.html b/doc/permutation_iterator.html index 751ce9c..89c38bc 100644 --- a/doc/permutation_iterator.html +++ b/doc/permutation_iterator.html @@ -3,7 +3,7 @@ - + Permutation Iterator @@ -211,10 +211,10 @@ Iterate backward with stride 2 : 6 8

The source code for this example can be found here.

-
+
View document source. -Generated on: 2004-01-13 02:54 UTC. +Generated on: 2004-01-13 14:27 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/reverse_iterator.html b/doc/reverse_iterator.html index 525d923..599002b 100644 --- a/doc/reverse_iterator.html +++ b/doc/reverse_iterator.html @@ -276,7 +276,7 @@ sequence in double-reversed (normal) order: hello world!
View document source. -Generated on: 2004-01-13 14:13 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.
diff --git a/doc/transform_iterator.html b/doc/transform_iterator.html index c608fe2..1adda01 100644 --- a/doc/transform_iterator.html +++ b/doc/transform_iterator.html @@ -3,7 +3,7 @@ - + Transform Iterator @@ -131,7 +131,7 @@ concept that is modeled by the IteratorIf transform_iterator is a model of Readable Lvalue Iterator then it models the following original iterator concepts depending on what the Iterator argument models.

-
+
@@ -316,10 +316,10 @@ adding 4 to each element in the array:

The source code for this example can be found here.

-
+
View document source. -Generated on: 2004-01-13 05:43 UTC. +Generated on: 2004-01-13 14:26 UTC. Generated by Docutils from reStructuredText source.