From 6079b53ff8f7b0f24be2260ddb665acbdb1b53f9 Mon Sep 17 00:00:00 2001
From: Adam Wulkiewicz <adam.wulkiewicz@gmail.com>
Date: Wed, 30 Nov 2011 13:40:14 +0000
Subject: [PATCH] naming error fixed

[SVN r75749]
---
 doc/html/geometry_index/r_tree.html | 4 ++--
 doc/html/index.html                 | 4 ++--
 doc/rtree.qbk                       | 2 +-
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/doc/html/geometry_index/r_tree.html b/doc/html/geometry_index/r_tree.html
index 88c512551..1984cacc1 100644
--- a/doc/html/geometry_index/r_tree.html
+++ b/doc/html/geometry_index/r_tree.html
@@ -438,8 +438,8 @@
 </pre>
 <p>
           Furthermore, it's possible to define if the closest, furthest or centroidal
-          point of the non-point <code class="computeroutput"><span class="identifier">__Indexable__</span></code>
-          should be taken into account in the routine calculating distance.
+          point of the non-point <code class="computeroutput">Indexable</code> should be taken into account
+          in the routine calculating distance.
         </p>
 <pre class="programlisting"><span class="identifier">std</span><span class="special">::</span><span class="identifier">vector</span><span class="special">&lt;</span>Value<span class="special">&gt;</span> <span class="identifier">returned_values</span><span class="special">;</span>
 <a href="http://www.boost.org/libs/geometry/doc/html/geometry/reference/concepts/concept_point.html" target="_top">Point</a> <span class="identifier">pt</span><span class="special">(...);</span>
diff --git a/doc/html/index.html b/doc/html/index.html
index 619b6272e..74bcd3da9 100644
--- a/doc/html/index.html
+++ b/doc/html/index.html
@@ -30,7 +30,7 @@
 </h3></div></div>
 <div><p class="copyright">Copyright &#169; 2011 Adam Wulkiewicz, Federico J. Fernandez</p></div>
 <div><div class="legalnotice">
-<a name="id787827"></a><p>
+<a name="id808512"></a><p>
         Distributed under the Boost Software License, Version 1.0. (See accompanying
         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
       </p>
@@ -54,7 +54,7 @@
 </div>
 </div>
 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: November 30, 2011 at 12:44:52 GMT</small></p></td>
+<td align="left"><p><small>Last revised: November 30, 2011 at 13:38:40 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>
diff --git a/doc/rtree.qbk b/doc/rtree.qbk
index ddd59445f..69049b17c 100644
--- a/doc/rtree.qbk
+++ b/doc/rtree.qbk
@@ -270,7 +270,7 @@ may be defined as follows.
  index::nearest(rt, index::bounded(pt, 10, 500), k, std::back_inserter(returned_values));
 
 Furthermore, it's possible to define if the closest, furthest or centroidal point of the
-non-point `__Indexable__` should be taken into account in the routine calculating distance.
+non-point `__indexable__` should be taken into account in the routine calculating distance.
 
  std::vector<__value__> returned_values;
  __point__ pt(...);