Compare commits

...

4 Commits

Author SHA1 Message Date
nobody
6fa3edc852 This commit was manufactured by cvs2svn to create tag
'Version_1_33_1'.

[SVN r31916]
2005-12-05 14:04:06 +00:00
Douglas Gregor
198bbd8e1d Clean up a whole lot of bad links
[SVN r31851]
2005-12-01 04:52:04 +00:00
Jonathan Turkanis
24a7094017 fixed broken links
[SVN r30389]
2005-08-03 00:46:39 +00:00
nobody
49fd97b7de This commit was manufactured by cvs2svn to create branch 'RC_1_33_0'.
[SVN r30300]
2005-07-28 18:22:24 +00:00
2 changed files with 4 additions and 4 deletions

View File

@@ -70,7 +70,7 @@ is so nonintuitive that at least one implementation erroneously assigns
not return true references: there is the often cited example of disk-based not return true references: there is the often cited example of disk-based
collections. collections.
</p><p>Another example is a counting iterator, an iterator the returns a sequence of </p><p>Another example is a counting iterator, an iterator the returns a sequence of
integers when incremented and dereferenced (see <a href="http://www.boost.org/libs/utility/counting_iterator.htm"><tt>boost::counting_iterator</tt></a>). integers when incremented and dereferenced (see <a href="http://www.boost.org/libs/iterator/doc/counting_iterator.html"><tt>boost::counting_iterator</tt></a>).
There are two ways to implement this iterator, 1) make the <tt>reference</tt> There are two ways to implement this iterator, 1) make the <tt>reference</tt>
type be a true reference (a reference to an integer data member of the counting type be a true reference (a reference to an integer data member of the counting
iterator) or 2) make the <tt>reference</tt> type be the same as the iterator) or 2) make the <tt>reference</tt> type be the same as the
@@ -79,7 +79,7 @@ iterator) or 2) make the <tt>reference</tt> type be the same as the
2) is therefore a better choice, but then we have a counting iterator that 2) is therefore a better choice, but then we have a counting iterator that
cannot be a random access iterator. cannot be a random access iterator.
</p><p>Yet another example is a transform iterator, an iterator adaptor that applies </p><p>Yet another example is a transform iterator, an iterator adaptor that applies
a unary function object to the dereference value of the wrapped iterator (see <a href="http://www.boost.org/libs/utility/transform_iterator.htm"><tt>boost::transform_iterator</tt></a>). a unary function object to the dereference value of the wrapped iterator (see <a href="http://www.boost.org/libs/iterator/doc/transform_iterator.html"><tt>boost::transform_iterator</tt></a>).
For unary functions such as <tt>std::times</tt> the return type of For unary functions such as <tt>std::times</tt> the return type of
<tt>operator*</tt> clearly needs to be the <tt>result_type</tt> of the function <tt>operator*</tt> clearly needs to be the <tt>result_type</tt> of the function
object, which is typically not a reference. However, with the current iterator object, which is typically not a reference. However, with the current iterator

View File

@@ -582,7 +582,7 @@ cases can be found <a href="./test_cases.html">here</a>.
arrays. arrays.
This library is analogous to This library is analogous to
<a href="">boost::array</a> in that it augments C style N-dimensional <a href="../../array/index.html">boost::array</a> in that it augments C style N-dimensional
arrays, as <tt>boost::array</tt> does for C one-dimensional arrays. arrays, as <tt>boost::array</tt> does for C one-dimensional arrays.
@@ -625,7 +625,7 @@ arrays, as <tt>boost::array</tt> does for C one-dimensional arrays.
</address> </address>
<!-- Created: Fri Jun 29 10:53:07 EST 2001 --> <!-- Created: Fri Jun 29 10:53:07 EST 2001 -->
<!-- hhmts start --> <!-- hhmts start -->
Last modified: Tue Sep 10 11:14:15 EST 2002 Last modified: Wed Nov 30 23:29:03 EST 2005
<!-- hhmts end --> <!-- hhmts end -->
</body> </body>