boostorg/algorithm
1
0
Fork 1
mirror of https://github.com/boostorg/algorithm.git synced 2025-07-29 12:07:18 +02:00
Code Issues Packages Projects Releases Wiki Activity

Fix broken link to Alexandrescu paper; Refs #7551

Browse Source 
[SVN r81821]
This commit is contained in:
Marshall Clow
2012-12-10 15:25:39 +00:00
parent 6afae475fe
commit 0d750ae554
1 changed files with 8 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
minmax/index.html
View File

@ -350,7 +350,7 @@ separation into two header files.</p>
std::max.</b></h4> std::max.</b></h4>
<p>I am aware of the problems with std::min and <p>I am aware of the problems with std::min and
std::max, and all the debate that has been going on (please consult std::max, and all the debate that has been going on (please consult
<a href="http://www.cuj.com/documents/s=7996/cujcexp1904alexandr/alexandr.htm">Alexandrescu's paper</a> and the links therein). But I don't see the purpose of this <a href="#Alexandrescu">Alexandrescu's paper</a> and the links therein). But I don't see the purpose of this
library as fixing something that is part of the C++ standard. I humbly library as fixing something that is part of the C++ standard. I humbly
think it's beyond the scope of this library. Rather, I am think it's beyond the scope of this library. Rather, I am
following the way of the standard in simply providing one more function following the way of the standard in simply providing one more function
@ -485,7 +485,12 @@ to keep it like this.
<a name="acks"> <a name="acks">
<h3> <h3>
Acknowledgements</h3> Acknowledgements</h3>
My students in CS903 (Polytechnic Univ., <a href="http://photon.poly.edu/~hbr/cs903/">http://photon.poly.edu/~hbr/cs903/</a>)
<a name="Alexandrescu">
<a href="http://www.drdobbs.com/generic-min-and-max-redivivus/184403774">Generic: Min and Max Redivivus, by Andrei Alexandrescu</a>
Dr. Dobbs, April 2001
<p>My students in CS903 (Polytechnic Univ., <a href="http://photon.poly.edu/~hbr/cs903/">http://photon.poly.edu/~hbr/cs903/</a>)
who had <tt>minmax_element</tt> as an assignment helped clarify the issues, who had <tt>minmax_element</tt> as an assignment helped clarify the issues,
and also come up with the optimum number of comparisons for <tt>first_min_last_max_element</tt>. and also come up with the optimum number of comparisons for <tt>first_min_last_max_element</tt>.
The identification of the issue surrounding <tt>max_element</tt> is solely The identification of the issue surrounding <tt>max_element</tt> is solely
@ -516,7 +521,7 @@ Comparable</a></tt>,
<tt><a href="http://www.sgi.com/tech/stl/nth_element.html">nth_element</a></tt> <tt><a href="http://www.sgi.com/tech/stl/nth_element.html">nth_element</a></tt>
. .
<hr SIZE="6"> <hr SIZE="6">
<br>Last modified 2004-07-01 <br>Last modified 2012-12-10
<p><font face="Arial,Helvetica"><font size=-1>&copy; Copyright Herv&eacute; <p><font face="Arial,Helvetica"><font size=-1>&copy; Copyright Herv&eacute;
Br&ouml;nnimann, Polytechnic University, 2002--2004. Br&ouml;nnimann, Polytechnic University, 2002--2004.
Use, modification, and distribution is subject to the Boost Software Use, modification, and distribution is subject to the Boost Software