[Boost-commit] svn:boost r81541 - in sandbox-branches/geometry/index_dev/doc: html html/geometry_index/r_tree rtree

Subject: [Boost-commit] svn:boost r81541 - in sandbox-branches/geometry/index_dev/doc: html html/geometry_index/r_tree rtree
From: adam.wulkiewicz_at_[hidden]
Date: 2012-11-25 16:35:21

Author: awulkiew
Date: 2012-11-25 16:35:20 EST (Sun, 25 Nov 2012)
New Revision: 81541
URL: http://svn.boost.org/trac/boost/changeset/81541

Log:
Small change in docs.
Text files modified: 
   sandbox-branches/geometry/index_dev/doc/html/geometry_index/r_tree/introduction.html |     2 +-                                      
   sandbox-branches/geometry/index_dev/doc/html/index.html                              |     2 +-                                      
   sandbox-branches/geometry/index_dev/doc/rtree/introduction.qbk                       |     2 +-                                      
   3 files changed, 3 insertions(+), 3 deletions(-)

Modified: sandbox-branches/geometry/index_dev/doc/html/geometry_index/r_tree/introduction.html
==============================================================================
--- sandbox-branches/geometry/index_dev/doc/html/geometry_index/r_tree/introduction.html	(original)
+++ sandbox-branches/geometry/index_dev/doc/html/geometry_index/r_tree/introduction.html	2012-11-25 16:35:20 EST (Sun, 25 Nov 2012)
@@ -51,7 +51,7 @@
       </p>
 <p>
         The R-tree is a self-balanced data structure. The key part of balancing algorithm
-        is node splitting algorithm mentioned before [2]</sup></a> [3]</sup></a>. Each algorithm would produce different splits so the internal
+        is node splitting algorithm [2]</sup></a> [3]</sup></a>. Each algorithm would produce different splits so the internal
         structure of a tree may be different for each one of them. In general more
         complex algorithms analyses elements better and produces less overlapping
         nodes. This is a "better" split because later, in the searching

Modified: sandbox-branches/geometry/index_dev/doc/html/index.html
==============================================================================
--- sandbox-branches/geometry/index_dev/doc/html/index.html	(original)
+++ sandbox-branches/geometry/index_dev/doc/html/index.html	2012-11-25 16:35:20 EST (Sun, 25 Nov 2012)
@@ -56,7 +56,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 25, 2012 at 21:23:52 GMT</small></p></td>
+<td align="left"><p><small>Last revised: November 25, 2012 at 21:34:09 GMT</small></p></td>
 <td align="right"><div class="copyright-footer"></div></td>
 </tr></table>
 <hr>

Modified: sandbox-branches/geometry/index_dev/doc/rtree/introduction.qbk
==============================================================================
--- sandbox-branches/geometry/index_dev/doc/rtree/introduction.qbk	(original)
+++ sandbox-branches/geometry/index_dev/doc/rtree/introduction.qbk	2012-11-25 16:35:20 EST (Sun, 25 Nov 2012)
@@ -25,7 +25,7 @@
 the new node is created and elements are split between nodes. If the number of elements in node is too small, the node is deleted
 and elements are reinserted into the tree.
 
-The __rtree__ is a self-balanced data structure. The key part of balancing algorithm is node splitting algorithm mentioned before
+The __rtree__ is a self-balanced data structure. The key part of balancing algorithm is node splitting algorithm
 [footnote Greene, D. (1989). /An implementation and performance analysis of spatial data access methods/]
 [footnote Beckmann, N.; Kriegel, H. P.; Schneider, R.; Seeger, B. (1990). /The R*-tree: an efficient and robust access method for points and rectangles/].
 Each algorithm would produce different splits so the internal structure of a tree may be different for each one of them.