boostorg/utility
1
0
Fork 1
mirror of https://github.com/boostorg/utility.git synced 2025-08-02 14:24:30 +02:00
Code Issues Packages Projects Releases Wiki Activity

few edits

Browse Source 
[SVN r9125]
This commit is contained in:
Jeremy Siek
2001-02-11 19:26:26 +00:00
parent 20a9d9645d
commit 5f91259344
1 changed files with 22 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

24
transform_iterator.htm
View File

@@ -111,6 +111,8 @@ The output from this part is:
<TR> <TR>
<TD><a href="http://www.sgi.com/tech/stl/AdaptableUnaryFunction.html"><tt>AdaptableUnaryFunction</tt></a></TD> <TD><a href="http://www.sgi.com/tech/stl/AdaptableUnaryFunction.html"><tt>AdaptableUnaryFunction</tt></a></TD>
<TD>The function object that transforms each element in the iterator range. <TD>The function object that transforms each element in the iterator range.
If you want the resulting iterator to behave as an iterator, the result of the function
should be solely a function of its argument.</TD>
</TR> </TR>
<TR> <TR>
@@ -136,7 +138,10 @@ href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">Random Access Itera
concept, except that the <tt>reference</tt> type is the same as the <tt>value_type</tt> concept, except that the <tt>reference</tt> type is the same as the <tt>value_type</tt>
so <tt>operator*()</tt> returns by-value. In addition it has the following constructor: so <tt>operator*()</tt> returns by-value. In addition it has the following constructor:
<pre>transform_iterator_generator::type(const BaseIterator&amp; it, const AdaptableUnaryFunction&amp; f = AdaptableUnaryFunction())</pre> <pre>
transform_iterator_generator::type(const BaseIterator&amp; it,
const AdaptableUnaryFunction&amp; f = AdaptableUnaryFunction())
</pre>
<p> <p>
<hr> <hr>
@@ -148,7 +153,8 @@ so <tt>operator*()</tt> returns by-value. In addition it has the following const
<pre> <pre>
template &lt;class AdaptableUnaryFunction, class BaseIterator&gt; template &lt;class AdaptableUnaryFunction, class BaseIterator&gt;
typename transform_iterator_generator&lt;AdaptableUnaryFunction,BaseIterator&gt;::type typename transform_iterator_generator&lt;AdaptableUnaryFunction,BaseIterator&gt;::type
make_transform_iterator(BaseIterator base, const AdaptableUnaryFunction&amp; f = AdaptableUnaryFunction()); make_transform_iterator(BaseIterator base,
const AdaptableUnaryFunction&amp; f = AdaptableUnaryFunction());
</pre> </pre>
This function provides a convenient way to create transform iterators. 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</a>
(or of any concepts that refine Forward Iterator, which includes (or of any concepts that refine Forward Iterator, which includes
Random Access Iterator and Bidirectional Iterator) since the <tt>operator*</tt> of the transform Random Access Iterator and Bidirectional Iterator) since the <tt>operator*</tt> of the transform
iterator always returns by-value. iterator always returns by-value.
<hr>
<p>Revised <!--webbot bot="Timestamp" s-type="EDITED" s-format="%d %b %Y" startspan -->10 Feb 2001<!--webbot bot="Timestamp" endspan i-checksum="14373" --></p>
<p><EFBFBD> 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 &quot;as is&quot;
without express or implied warranty, and with no claim as to its suitability for
any purpose.</p>
</body>
</html>