From d9ebe5da1389b7f24623eea3b95b63e9c7637979 Mon Sep 17 00:00:00 2001 From: Douglas Gregor Date: Thu, 8 Dec 2005 03:23:02 +0000 Subject: [PATCH] Merged from Version_1_33_1 [SVN r31949] --- minmax/doc/minmax_benchs.html | 2 +- minmax/index.html | 2 +- string/doc/usage.xml | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/minmax/doc/minmax_benchs.html b/minmax/doc/minmax_benchs.html index bb5713a..1db516d 100644 --- a/minmax/doc/minmax_benchs.html +++ b/minmax/doc/minmax_benchs.html @@ -35,7 +35,7 @@ means that all the elements are distinct and in increasing order, decreas is the reverse, and random is produced by random_shuffle.
The program that created these tables is included in the distribution, -under minmax_timer.cpp +under minmax_timer.cpp
diff --git a/minmax/index.html b/minmax/index.html index 32d5d44..27efb39 100644 --- a/minmax/index.html +++ b/minmax/index.html @@ -56,7 +56,7 @@ be enough. The present library solves both problems.

minmax as straightforward extensions of the C++ standard. As it returns a pair of const&, we must use the Boost.tuple library to construct such +href=:../../../../tuple/index.html>Boost.tuple library to construct such pairs. (Please note: the intent is not to fix the known defaults of std::min and std::max, but to add one more algorithms that combines both; see the diff --git a/string/doc/usage.xml b/string/doc/usage.xml index e3b2324..6c7261d 100644 --- a/string/doc/usage.xml +++ b/string/doc/usage.xml @@ -206,7 +206,7 @@ As we can see, input of the find_last() algorithm can be also char[] because this type is supported by - Boost.Range. + Boost.Range. The following lines transform the result. Notice that boost::iterator_range has familiar