From 9068069106516b03bce22a8e2130130410ea2b4e Mon Sep 17 00:00:00 2001
From: Hartmut Kaiser <hartmut.kaiser@gmail.com>
Date: Sun, 4 Jul 2010 22:38:38 +0000
Subject: [PATCH] Spirit: merging from trunk upto rev. 61489

[SVN r63640]
---
 minmax/index.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/minmax/index.html b/minmax/index.html
index ad1b801..9b0312a 100644
--- a/minmax/index.html
+++ b/minmax/index.html
@@ -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&lt;T const&amp;></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.