mirror of
https://github.com/boostorg/algorithm.git
synced 2026-08-18 03:11:49 +02:00
Compare commits
53
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
5040e545e1 | ||
|
|
31b5842441 | ||
|
|
4515bc182e | ||
|
|
7e2e6856cc | ||
|
|
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 |
+4
-4
@@ -92,11 +92,11 @@ Synopsis of <tt><boost/algorithm/minmax.hpp></tt></h3>
|
||||
namespace boost {
|
||||
|
||||
template <class T>
|
||||
tuple<T const&, T const&> >
|
||||
tuple<T const&, T const&>
|
||||
minmax(const T& a, const T& b);
|
||||
|
||||
template <class T, class <a href="http://www.sgi.com/tech/stl/BinaryPredicate.html">BinaryPredicate</a>>
|
||||
tuple<T const&, T const&> >
|
||||
tuple<T const&, T const&>
|
||||
minmax(const T& a, const T& b, BinaryPredicate comp);
|
||||
|
||||
}
|
||||
@@ -243,7 +243,7 @@ range
|
||||
|
||||
<a name="complexity">
|
||||
<h3>
|
||||
<a NAME="Complexity"></a>Complexity</h3>
|
||||
Complexity</h3>
|
||||
Minmax performs a single comparison and is otherwise of constant complexity.
|
||||
The use of <tt>boost::tuple<T const&></tt> prevents copy
|
||||
constructors in case the arguments are passed by reference.
|
||||
@@ -438,7 +438,7 @@ comparisons).</p>
|
||||
slower than
|
||||
<tt>first_min_element</tt> alone, still much less than <tt>first_min_element</tt>
|
||||
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>
|
||||
<p>The minmax algorithms are useful in computing the extent of a range.
|
||||
|
||||
@@ -33,7 +33,7 @@
|
||||
<librarypurpose>
|
||||
A set of generic string-related algorithms and utilities
|
||||
</librarypurpose>
|
||||
<librarycategory name="category:algoritms"/>
|
||||
<librarycategory name="category:algorithms"/>
|
||||
<librarycategory name="category:string-text"/>
|
||||
</libraryinfo>
|
||||
|
||||
|
||||
@@ -339,7 +339,7 @@
|
||||
typedef vector< string > split_vector_type;
|
||||
|
||||
split_vector_type SplitVec; // #2: Search for tokens
|
||||
split( SplitVec, str1, is_any_of("-*") ); // SplitVec == { "hello abc","ABC","aBc goodbye" }
|
||||
split( SplitVec, str1, is_any_of("-*"), token_compress_on ); // SplitVec == { "hello abc","ABC","aBc goodbye" }
|
||||
</programlisting>
|
||||
<para>
|
||||
<code>[hello]</code> designates an <code>iterator_range</code> delimiting this substring.
|
||||
|
||||
Reference in New Issue
Block a user