mirror of
https://github.com/boostorg/algorithm.git
synced 2025-10-09 06:10:59 +02:00
Compare commits
50 Commits
boost-1.43
...
svn-branch
Author | SHA1 | Date | |
---|---|---|---|
|
0abb237962 | ||
|
235c81be61 | ||
|
1eb3d83534 | ||
|
8f2b8d4888 | ||
|
6c0f953c01 | ||
|
e439792494 | ||
|
236b142308 | ||
|
9bad789175 | ||
|
d84f81d841 | ||
|
ce98e8b87e | ||
|
e8a2596637 | ||
|
7b2754b937 | ||
|
784402e5c0 | ||
|
1188575e7b | ||
|
bff2a1e112 | ||
|
6d5e7b5a04 | ||
|
760af1798b | ||
|
1f5542b44c | ||
|
baf3dd99e2 | ||
|
7299b29bf8 | ||
|
539c170b9d | ||
|
c81ee948b7 | ||
|
ba5e4c30c6 | ||
|
cd26ed816c | ||
|
4e15767bed | ||
|
9fa2f90db4 | ||
|
35f317aeac | ||
|
d0a03fdb4e | ||
|
346f032be2 | ||
|
a389d768c4 | ||
|
90fca39906 | ||
|
5b24f31486 | ||
|
b25d6511b3 | ||
|
1541a554f5 | ||
|
7a97b3390e | ||
|
6e5a7497ae | ||
|
f0b8b60379 | ||
|
66019abb2f | ||
|
8758222006 | ||
|
4eef56761a | ||
|
b94a3fbfba | ||
|
614cc2ebab | ||
|
869660ed14 | ||
|
777f30780e | ||
|
26aa37733b | ||
|
f1e60579c2 | ||
|
389dd3c863 | ||
|
f23f61ae9b | ||
|
608112b112 | ||
|
b21b54dc4e |
@@ -243,7 +243,7 @@ range
|
|||||||
|
|
||||||
<a name="complexity">
|
<a name="complexity">
|
||||||
<h3>
|
<h3>
|
||||||
<a NAME="Complexity"></a>Complexity</h3>
|
Complexity</h3>
|
||||||
Minmax performs a single comparison and is otherwise of constant complexity.
|
Minmax performs a single comparison and is otherwise of constant complexity.
|
||||||
The use of <tt>boost::tuple<T const&></tt> prevents copy
|
The use of <tt>boost::tuple<T const&></tt> prevents copy
|
||||||
constructors in case the arguments are passed by reference.
|
constructors in case the arguments are passed by reference.
|
||||||
@@ -438,7 +438,7 @@ comparisons).</p>
|
|||||||
slower than
|
slower than
|
||||||
<tt>first_min_element</tt> alone, still much less than <tt>first_min_element</tt>
|
<tt>first_min_element</tt> alone, still much less than <tt>first_min_element</tt>
|
||||||
and
|
and
|
||||||
<tt>last_max_element</tt> called separately. <a href="#Performance">[2]</a>
|
<tt>last_max_element</tt> called separately. <a href="#Note2">[2]</a>
|
||||||
|
|
||||||
<h4><b>Why algorithms and not accumulators?</b></h4>
|
<h4><b>Why algorithms and not accumulators?</b></h4>
|
||||||
<p>The minmax algorithms are useful in computing the extent of a range.
|
<p>The minmax algorithms are useful in computing the extent of a range.
|
||||||
|
Reference in New Issue
Block a user