diff --git a/transform_iterator.htm b/transform_iterator.htm index b467535..f821759 100644 --- a/transform_iterator.htm +++ b/transform_iterator.htm @@ -111,6 +111,8 @@ The output from this part is:
transform_iterator_generator::type(const BaseIterator& it, const AdaptableUnaryFunction& f = AdaptableUnaryFunction())+
+transform_iterator_generator::type(const BaseIterator& it, + const AdaptableUnaryFunction& f = AdaptableUnaryFunction()) +
template <class AdaptableUnaryFunction, class BaseIterator> typename transform_iterator_generator<AdaptableUnaryFunction,BaseIterator>::type -make_transform_iterator(BaseIterator base, const AdaptableUnaryFunction& f = AdaptableUnaryFunction()); +make_transform_iterator(BaseIterator base, + const AdaptableUnaryFunction& f = AdaptableUnaryFunction());This function provides a convenient way to create transform iterators. @@ -187,3 +193,17 @@ href="http://www.sgi.com/tech/stl/ForwardIterator.html">Forward Iterator (or of any concepts that refine Forward Iterator, which includes Random Access Iterator and Bidirectional Iterator) since the operator* of the transform iterator always returns by-value. + + + +
Revised 10 Feb 2001
+© Copyright Jeremy Siek 2000. Permission to copy, use, +modify, sell and distribute this document is granted provided this copyright +notice appears in all copies. This document is provided "as is" +without express or implied warranty, and with no claim as to its suitability for +any purpose.
+ +