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

Merge [51045] from the trunk

Browse Source 
[SVN r51226]
This commit is contained in:
Steven Watanabe
2009-02-12 18:47:06 +00:00
parent c33935fa1f
commit c067b348bf
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
minmax/index.html
View File

@ -158,9 +158,9 @@ identical to
that they return the last instance of the largest element (and not the that they return the last instance of the largest element (and not the
first, as <tt>first_min_element</tt> and <tt>last_max_element</tt> would). first, as <tt>first_min_element</tt> and <tt>last_max_element</tt> would).
<p>The family of algorithms comprising <tt>first_min_first_max_element</tt>, <p>The family of algorithms comprising <tt>first_min_first_max_element</tt>,
<tt>first_min_first_max_element</tt>, <tt>first_min_last_max_element</tt>,
<tt>first_min_first_max_element</tt>, <tt>last_min_first_max_element</tt>,
and <tt>first_min_first_max_element</tt> can be described generically as and <tt>last_min_last_max_element</tt> can be described generically as
follows (using <i><tt>which</tt></i> and follows (using <i><tt>which</tt></i> and
<i><tt>what</tt></i> for <tt>first</tt> <i><tt>what</tt></i> for <tt>first</tt>
or <tt>last</tt>): <tt><i>which</i>_min_<i>what</i>_max_element</tt> finds or <tt>last</tt>): <tt><i>which</i>_min_<i>what</i>_max_element</tt> finds