From 235c81be61d141201c27230607fd1e83387ccc53 Mon Sep 17 00:00:00 2001
From: Jeremiah Willcock <jewillco@osl.iu.edu>
Date: Tue, 20 Apr 2010 18:49:18 +0000
Subject: [PATCH] Fixed various issues in docs (mostly duplicate bookmarks and
 broken links) found by inspect tool

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

diff --git a/minmax/index.html b/minmax/index.html
index d3777f1..9a414e5 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.