Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r80164 - in sandbox-branches/geometry/index: boost/geometry/extensions/index boost/geometry/extensions/index/algorithms boost/geometry/extensions/index/algorithms/detail boost/geometry/extensions/index/filters boost/geometry/extensions/index/rtree boost/geometry/extensions/index/rtree/kmeans boost/geometry/extensions/index/rtree/linear boost/geometry/extensions/index/rtree/node boost/geometry/extensions/index/rtree/quadratic boost/geometry/extensions/index/rtree/rstar boost/geometry/extensions/index/rtree/visitors boost/geometry/extensions/index/translator doc doc/html doc/html/geometry_index doc/html/geometry_index/r_tree doc/rtree doc/src doc/src/examples doc/src/examples/rtree test test/algorithms test/rtree
From: adam.wulkiewicz_at_[hidden]
Date: 2012-08-23 17:55:45

Next message: oliver.kowalke_at_[hidden]: "[Boost-commit] svn:boost r80165 - in trunk/libs/context: build doc"
Previous message: bdawes_at_[hidden]: "[Boost-commit] svn:boost r80163 - in trunk/libs/filesystem/doc: . src"

Author: awulkiew
Date: 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
New Revision: 80164
URL: http://svn.boost.org/trac/boost/changeset/80164

Log:
Modified docs, files descriptions, added quick_start example.
Added:
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html (contents, props changed)
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html (contents, props changed)
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/r_tree_creation.html (contents, props changed)
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html (contents, props changed)
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html (contents, props changed)
   sandbox-branches/geometry/index/doc/imports.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/rtree/
   sandbox-branches/geometry/index/doc/rtree/creation.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/rtree/introduction.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/rtree/nearest.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/rtree/query.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/rtree/quickstart.qbk (contents, props changed)
   sandbox-branches/geometry/index/doc/src/
   sandbox-branches/geometry/index/doc/src/examples/
   sandbox-branches/geometry/index/doc/src/examples/rtree/
   sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp (contents, props changed)
Text files modified:
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_centroid.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_far.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_near.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/content.hpp | 4
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/diff_abs.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/smallest_for_indexable.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/sum_for_indexable.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/intersection_content.hpp | 4
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/is_valid.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/margin.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/minmaxdist.hpp | 4
   sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/union_content.hpp | 9
   sandbox-branches/geometry/index/boost/geometry/extensions/index/assert.hpp | 5
   sandbox-branches/geometry/index/boost/geometry/extensions/index/distance_predicates.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/nearest_filter.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/query_filter.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/indexable.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/inserter.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/nonassignable.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/predicates.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/pushable_array.hpp | 5
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/distance_predicates.hpp | 9
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/filters.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/kmeans.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/split.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/linear.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/redistribute_elements.hpp | 9
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static_variant.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_variant.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/options.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/predicates.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/quadratic.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/redistribute_elements.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/choose_next_node.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/insert.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/redistribute_elements.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/rstar.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp | 9
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/tags.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_boxes_ok.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_levels_ok.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/children_box.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/copy.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/destroy.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/gl_draw.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/insert.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/is_leaf.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/nearest.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/print.hpp | 8
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/query.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/remove.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/def.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/helpers.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/index.hpp | 7
   sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/translator.hpp | 5
   sandbox-branches/geometry/index/boost/geometry/extensions/index/tuples.hpp | 5
   sandbox-branches/geometry/index/doc/Jamfile.v2 | 10
   sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html | 8
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html | 475 ++-------------------------------------
   sandbox-branches/geometry/index/doc/html/index.html | 25 +-
   sandbox-branches/geometry/index/doc/index.qbk | 8
   sandbox-branches/geometry/index/doc/introduction.qbk | 5
   sandbox-branches/geometry/index/doc/rtree.qbk | 312 -------------------------
   sandbox-branches/geometry/index/test/Jamfile.v2 | 5
   sandbox-branches/geometry/index/test/algorithms/Jamfile.v2 | 5
   sandbox-branches/geometry/index/test/algorithms/content.cpp | 9
   sandbox-branches/geometry/index/test/algorithms/intersection_content.cpp | 8
   sandbox-branches/geometry/index/test/algorithms/is_valid.cpp | 8
   sandbox-branches/geometry/index/test/algorithms/margin.cpp | 9
   sandbox-branches/geometry/index/test/algorithms/minmaxdist.cpp | 8
   sandbox-branches/geometry/index/test/algorithms/test_content.hpp | 3
   sandbox-branches/geometry/index/test/algorithms/test_intersection_content.hpp | 3
   sandbox-branches/geometry/index/test/algorithms/test_margin.hpp | 3
   sandbox-branches/geometry/index/test/algorithms/test_union_content.hpp | 3
   sandbox-branches/geometry/index/test/algorithms/union_content.cpp | 8
   sandbox-branches/geometry/index/test/geometry_index_test_common.hpp | 10
   sandbox-branches/geometry/index/test/rtree/Jamfile.v2 | 5
   sandbox-branches/geometry/index/test/rtree/rtree2d_linear_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_linear_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_linear_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_linear_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_linear_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_linear_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_linear_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_linear_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_d.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_f.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_i.cpp | 8
   sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_tt.cpp | 8
   sandbox-branches/geometry/index/test/rtree/test_rtree.hpp | 3
   105 files changed, 326 insertions(+), 1204 deletions(-)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_centroid.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_centroid.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_centroid.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - squared distance between point and centroid of the box or point
+// squared distance between point and centroid of the box or point
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_far.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_far.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_far.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - squared distance between point and furthest point of the box or point
+// squared distance between point and furthest point of the box or point
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_near.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_near.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/comparable_distance_near.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - squared distance between point and nearest point of the box or point
+// squared distance between point and nearest point of the box or point
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/content.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/content.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,6 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - n-dimensional box's content (2d-area/3d-volume/...)
+// n-dimensional box's content (hypervolume) - 2d area, 3d volume, ...
//
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/diff_abs.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/diff_abs.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/diff_abs.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - Abs of difference
+// Abs of difference
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/smallest_for_indexable.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/smallest_for_indexable.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/smallest_for_indexable.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - Get smallest value calculated for indexable's dimensions, used in R-tree k nearest neighbors query
+// Get smallest value calculated for indexable's dimensions, used in R-tree k nearest neighbors query
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/sum_for_indexable.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/sum_for_indexable.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/detail/sum_for_indexable.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - Sum values calculated for indexable's dimensions, used e.g. in R-tree k nearest neighbors query
+// Sum values calculated for indexable's dimensions, used e.g. in R-tree k nearest neighbors query
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/intersection_content.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/intersection_content.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/intersection_content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,6 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - boxes union/intersection area/volume
+// boxes union/intersection area/volume
//
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/is_valid.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/is_valid.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/is_valid.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - n-dimensional box's / point validity check
+// n-dimensional box's / point validity check
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/margin.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/margin.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/margin.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - n-dimensional box's margin value, 2d perimeter, 3d surface, etc...
+// n-dimensional box's margin value (hypersurface), 2d perimeter, 3d surface, etc...
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/minmaxdist.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/minmaxdist.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/minmaxdist.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,6 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - minmaxdist used in R-tree k nearest neighbors query
+// minmaxdist used in R-tree k nearest neighbors query
//
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/union_content.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/union_content.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/algorithms/union_content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,9 +1,10 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - boxes union/sum area/volume
+// boxes union/sum area/volume
+//
+// Copyright (c) 2008 Federico J. Fernandez.
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2008 Federico J. Fernandez.
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/assert.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/assert.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/assert.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - ASSERT
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/distance_predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/distance_predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/distance_predicates.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - Spatial index distance predicates, calculators and checkers used in nearest query
+// Spatial index distance predicates, calculators and checkers used in nearest neighbor query
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/nearest_filter.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/nearest_filter.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/nearest_filter.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - nearest neighbour filter implementation
+// Nearest neighbour filter implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/query_filter.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/query_filter.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/filters/query_filter.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - query filter implementation
+// Query filter implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/indexable.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/indexable.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/indexable.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - indexable traits and functions
+// Indexable's traits and related functions
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/inserter.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/inserter.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/inserter.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - inserter
+// Insert iterator
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/nonassignable.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/nonassignable.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/nonassignable.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - nonassignable
+// Spatial query predicates
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/predicates.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - Spatial index query predicates
+// Spatial query predicates
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/pushable_array.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/pushable_array.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/pushable_array.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - pushable array
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/distance_predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/distance_predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/distance_predicates.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,9 +1,10 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - Spatial index distance predicates, calculators and checkers
-// used in nearest query - rtree's nodes specializations
+// Spatial index distance predicates, calculators and checkers
+// used in nearest query - specialized for nodes
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/filters.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/filters.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/filters.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - rtree queries filters implementation
+// R-tree queries filters implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/kmeans.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/kmeans.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/kmeans.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree
+// R-tree kmeans algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/split.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/split.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/kmeans/split.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree kmeans split algorithm implementation
+// R-tree kmeans split algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011, 2012 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/linear.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/linear.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/linear.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree
+// R-tree linear algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/redistribute_elements.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/redistribute_elements.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/linear/redistribute_elements.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,9 +1,10 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree linear split algorithm implementation
+// R-tree linear split algorithm implementation
+//
+// Copyright (c) 2008 Federico J. Fernandez.
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2008 Federico J. Fernandez.
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree nodes
+// R-tree nodes
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree polymorphic nodes
+// R-tree nodes based on run-time polymorphism, storing std::vectors
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree polymorphic nodes with static-size containers
+// R-tree nodes based on runtime-polymorphism, storing static-size containers
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static_variant.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static_variant.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_static_variant.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree variant nodes with static-size containers
+// R-tree nodes based on Boost.Variant, storing static-size containers
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_variant.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_variant.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/node/node_default_variant.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree variant nodes
+// R-tree nodes based on Boost.Variant, storing std::vectors
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/options.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/options.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/options.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - rtree variants options
+// R-tree options, algorithms, parameters
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/predicates.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - Spatial index query predicates
+// Spatial query predicates checks specialized for nodes
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/quadratic.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/quadratic.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/quadratic.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree
+// R-tree quadratic algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/redistribute_elements.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/redistribute_elements.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/quadratic/redistribute_elements.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree quadratic split algorithm implementation
+// R-tree quadratic split algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/choose_next_node.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/choose_next_node.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/choose_next_node.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R*-tree ChooseNextNode algorithm
+// R-tree R*-tree next node choosing algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/insert.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/insert.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/insert.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R*-tree insert
+// R-tree R*-tree insert algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/redistribute_elements.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/redistribute_elements.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/redistribute_elements.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R*-tree split algorithm implementation
+// R-tree R*-tree split algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/rstar.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/rstar.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rstar/rstar.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R*-tree
+// R-tree R*-tree algorithm implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,9 +1,10 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree implementation
+// R-tree implementation
+//
+// Copyright (c) 2008 Federico J. Fernandez.
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2008 Federico J. Fernandez.
-// Copyright 2011, 2012 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/tags.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/tags.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/tags.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - tags related to rtree used in various files
+// Tags used by the R-tree implementation.
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_boxes_ok.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_boxes_ok.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_boxes_ok.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree boxes checking visitor
+// R-tree boxes validating visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_levels_ok.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_levels_ok.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/are_levels_ok.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree levels checking visitor
+// R-tree levels validating visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/children_box.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/children_box.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/children_box.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree node children box calculating visitor
+// R-tree node children box calculating visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/copy.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/copy.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/copy.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree copying visitor
+// R-tree deep copying visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/destroy.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/destroy.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/destroy.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree destroy visitor
+// R-tree destroying visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/gl_draw.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/gl_draw.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/gl_draw.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree GL-draw visitor
+// R-tree OpenGL drawing visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/insert.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/insert.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/insert.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree insert details
+// R-tree inserting visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/is_leaf.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/is_leaf.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/is_leaf.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree is leaf visitor
+// R-tree leaf node checking visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/nearest.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/nearest.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/nearest.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree k nearest neighbors query
+// R-tree k nearest neighbour querying visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/print.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/print.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/print.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,9 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree printing visitor
+// R-tree ostreaming visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2008 Federico J. Fernandez.
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/query.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/query.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/query.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree spatial query
+// R-tree querying visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/remove.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/remove.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/visitors/remove.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.Index - R-tree remove
+// R-tree removing visitor implementation
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/def.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/def.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/def.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - default value to bounding object translation
+// Default translator
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/helpers.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/helpers.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/helpers.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - translators helper functions
+// Translators helper functions
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/index.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/index.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/index.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,9 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - container index value to bounding object translation
+// Translator translating random-access container index value to Indexable object
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/translator.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/translator.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/translator/translator.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - translators
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/boost/geometry/extensions/index/tuples.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/extensions/index/tuples.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/extensions/index/tuples.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
//
-// Boost.SpatialIndex - tags related to rtree used in various files
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
//
-// Copyright 2011 Adam Wulkiewicz.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/doc/Jamfile.v2
==============================================================================
--- sandbox-branches/geometry/index/doc/Jamfile.v2 (original)
+++ sandbox-branches/geometry/index/doc/Jamfile.v2 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
-# Boost.Geometry Index (Spatial Indexes)
+# Boost.Geometry Index
+#
+# Copyright (c) 2011-2012 Adam Wulkiewicz.
#
-# Copyright (c) 2008 Federico J. Fernandez.
-# Copyright (c) 2011 Adam Wulkiewicz.
-
# Use, modification and distribution is subject to the Boost Software License,
# Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
# http://www.boost.org/LICENSE_1_0.txt)
@@ -16,16 +15,19 @@
 :
 index.qbk
 :
+ <dependency>Jamfile.v2
# <auto-index>off
# <auto-index-internal>on
# <auto-index-verbose>off
# <xsl:param>index.on.type=1
 <format>html
 <format>pdf:<xsl:param>boost.url.prefix=http://www.boost.org/doc/libs/release/doc/html
+ <xsl:param>chunk.section.depth=2
 <xsl:param>chunk.first.sections=1
 <xsl:param>toc.section.depth=3
 <xsl:param>toc.max.depth=2
 <xsl:param>generate.section.toc.level=4
 <xsl:param>boost.root=http://www.boost.org/doc/libs/release
 <quickbook-define>enable_index
+ <include>$(here)
 ;

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -3,10 +3,10 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter 1. Geometry Index 0.7">
-<link rel="up" href="../index.html" title="Chapter 1. Geometry Index 0.7">
-<link rel="prev" href="../index.html" title="Chapter 1. Geometry Index 0.7">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../index.html" title="Chapter 1. Geometry Index">
+<link rel="prev" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="next" href="r_tree.html" title="R-tree">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -3,10 +3,11 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>R-tree</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="../index.html" title="Chapter 1. Geometry Index 0.7">
-<link rel="up" href="../index.html" title="Chapter 1. Geometry Index 0.7">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="prev" href="introduction.html" title="Introduction">
+<link rel="next" href="r_tree/introduction.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
<table cellpadding="2" width="100%"><tr>
@@ -19,472 +20,46 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="r_tree/introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
</div>
<div class="section">
<div class="titlepage"><div><div><h2 class="title" style="clear: both">
<a name="geometry_index.r_tree"></a><a class="link" href="r_tree.html" title="R-tree">R-tree</a>
</h2></div></div></div>
<div class="toc"><dl>
-<dt>Introduction</dt>
-<dt>R-tree creation</dt>
+<dt>Introduction</dt>
+<dt>Quick Start</dt>
+<dt>R-tree creation</dt>
<dd><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.quick_start">Quick
- start</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters">R-tree
+<dt><a href="r_tree/r_tree_creation.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters">R-tree
 template parameters</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator">Values,
+<dt><a href="r_tree/r_tree_creation.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator">Values,
 Indexables and default Translator</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms">Inserting
+<dt><a href="r_tree/r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms">Inserting
 and splitting algorithms</a></dt>
+<dt><a href="r_tree/r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_removing_values">Inserting
+ and removing Values</a></dt>
</dl></dd>
-<dt><a href="r_tree.html#geometry_index.r_tree.inserting_and_removing_values">Inserting
- and removing Values</a></dt>
-<dt>Spatial queries</dt>
+<dt>Spatial queries</dt>
<dd><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.spatial_queries.basic_queries">Basic
+<dt><a href="r_tree/spatial_queries.html#geometry_index.r_tree.spatial_queries.basic_queries">Basic
 queries</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.spatial_queries.spatial_predicates">Spatial
+<dt><a href="r_tree/spatial_queries.html#geometry_index.r_tree.spatial_queries.spatial_predicates">Spatial
 predicates</a></dt>
</dl></dd>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries">Nearest
- neighbors queries</a></dt>
+<dt><a href="r_tree/nearest_neighbours_queries.html">Nearest
+ neighbours queries</a></dt>
<dd><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.k_nearest_neighbors">k
- nearest neighbors</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.one_nearest_neighbor">One
- nearest neighbor</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.distances_predicates">Distances
+<dt><a href="r_tree/nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.k_nearest_neighbours">k
+ nearest neighbours</a></dt>
+<dt><a href="r_tree/nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.one_nearest_neighbour">One
+ nearest neighbour</a></dt>
+<dt><a href="r_tree/nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.distances_predicates">Distances
 predicates</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.using_spatial_predicates">Using
+<dt><a href="r_tree/nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.using_spatial_predicates">Using
 spatial predicates</a></dt>
</dl></dd>
</dl></div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="geometry_index.r_tree.introduction"></a><a class="link" href="r_tree.html#geometry_index.r_tree.introduction" title="Introduction">Introduction</a>
-</h3></div></div></div>
-
- R-tree is a self-balancing search tree with nodes stored with their axis
- aligned bounding boxes. Each node's box describes the space occupied by children
- nodes. At the bottom of the structure, there are leaf-nodes which contains
- values (geometric objects representations). Minimal and maximal numbers of
- values/children which may be stored inside the node are user defined.
- 
-
- In order to use the R-tree one must include folowing file.
- 
-<pre class="programlisting">#include <boost/geometry/extensions/index/rtree/rtree.hpp>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="geometry_index.r_tree.r_tree_creation"></a><a class="link" href="r_tree.html#geometry_index.r_tree.r_tree_creation" title="R-tree creation">R-tree creation</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.quick_start">Quick
- start</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters">R-tree
- template parameters</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator">Values,
- Indexables and default Translator</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms">Inserting
- and splitting algorithms</a></dt>
-</dl></div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.r_tree_creation.quick_start"></a><a class="link" href="r_tree.html#geometry_index.r_tree.r_tree_creation.quick_start" title="Quick start">Quick
- start</a>
-</h4></div></div></div>
-
- In order to create a R-tree object storing values of type <code class="computeroutput">std::pair<Box, size_t></code> one may use the following code:
- 
-<pre class="programlisting">using namespace boost::geometry;
-typedef std::pair<Box, size_t> Value;
-index::rtree< Value, index::quadratic<32, 8> > rt;
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.r_tree_creation.r_tree_template_parameters"></a><a class="link" href="r_tree.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters" title="R-tree template parameters">R-tree
- template parameters</a>
-</h4></div></div></div>
-
- R-tree has 4 parameters:
- 
-<pre class="programlisting">rtree<Value, Parameters, Translator, Allocator>
-</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- <code class="computeroutput">Value</code> - type of object
- which will be stored in the container.
- </li>
-<li class="listitem">
- <code class="computeroutput">Parameters</code> - compile-time
- parameters, e.g. inserting/splitting algorithm with min and max nodes'
- elements numbers.
- </li>
-<li class="listitem">
- <code class="computeroutput">Translator</code> - type of
- object translating <code class="computeroutput">Value</code>
- objects to <code class="computeroutput">Indexable</code>
- objects (<code class="computeroutput">Point</code>
- or <code class="computeroutput">Box</code>)
- which R-tree can handle.
- </li>
-<li class="listitem">
- <code class="computeroutput">Allocator</code> - the allocator.
- </li>
-</ul></div>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator"></a><a class="link" href="r_tree.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator" title="Values, Indexables and default Translator">Values,
- Indexables and default Translator</a>
-</h4></div></div></div>
-
- R-tree may store <code class="computeroutput">Value</code>s of any type as long as there is passed
- the <code class="computeroutput">Translator</code> which knows how to interpret those <code class="computeroutput">Value</code>s
- and extract an object understandable by the R-tree. Those objects are called
- <code class="computeroutput">Indexable</code>s and they are simply of type adapted to <code class="computeroutput">Point</code>
- or <code class="computeroutput">Box</code>
- concept. Default <code class="computeroutput">Translator</code> <code class="computeroutput">index::translator::def<Value></code> is able to handle <code class="computeroutput">Point</code>,
- <code class="computeroutput">Box</code>,
- <code class="computeroutput">std::pair<...></code>,
- pointer, iterator or smart pointer.
- 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
-<li class="listitem">
- <code class="computeroutput">Indexable = Point
- | Box</code>
- </li>
-<li class="listitem">
- <code class="computeroutput">BasicValue =
- Indexable |
- std::pair<Indexable, T> | std::pair<T, Indexable></code>
- </li>
-<li class="listitem">
- <code class="computeroutput">Value = BasicValue
- | BasicValue* | Iterator<BasicValue>
- | SmartPtr<BasicValue></code>
- </li>
-</ul></div>
-
- Examples of <code class="computeroutput">Value</code> types:
- 
-<pre class="programlisting">geometry::model::point<...>
-geometry::model::point_xy<...>
-geometry::model::box<...>
-std::pair<geometry::model::box<...>, size_t>
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms"></a><a class="link" href="r_tree.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms" title="Inserting and splitting algorithms">Inserting
- and splitting algorithms</a>
-</h4></div></div></div>
-
- <code class="computeroutput">Value</code>s may be inserted to the R-tree in many various ways.
- Final structure of nodes depends on algorithms used in the process, especially
- nodes' splitting algorithm. Currently, three well-known types of R-trees
- may be created.
- 
-
- Linear - classic R-tree using splitting algorithm of linear complexity
- 
-<pre class="programlisting">index::rtree< Value, index::linear<32, 8> > rt;
-</pre>
-
- Quadratic - classic R-tree using splitting algorithm of quadratic complexity
- 
-<pre class="programlisting">index::rtree< Value, index::quadratic<32, 8> > rt;
-</pre>
-
- R*-tree - splitting algorithm minimizing nodes' overlap with forced reinsertions
- 
-<pre class="programlisting">index::rtree< Value, index::rstar<32, 8> > rt;
-</pre>
-</div>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="geometry_index.r_tree.inserting_and_removing_values"></a><a class="link" href="r_tree.html#geometry_index.r_tree.inserting_and_removing_values" title="Inserting and removing Values">Inserting
- and removing Values</a>
-</h3></div></div></div>
-
- Create
- 
-<pre class="programlisting">using namespace boost::geometry;
-typedef std::pair<Box, int> Value;
-index::rtree< Value, index::quadratic<32, 8> > rt;
-</pre>
-
- Insert and remove by method call
- 
-<pre class="programlisting">Value v = std::make_pair(Box(...), 0);
-rt.insert(v);
-rt.remove(v);
-</pre>
-
- or by function call
- 
-<pre class="programlisting">Value v = std::make_pair(Box(...), 0);
-index::insert(rt, v);
-index::remove(rt, v);
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="geometry_index.r_tree.spatial_queries"></a><a class="link" href="r_tree.html#geometry_index.r_tree.spatial_queries" title="Spatial queries">Spatial queries</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.spatial_queries.basic_queries">Basic
- queries</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.spatial_queries.spatial_predicates">Spatial
- predicates</a></dt>
-</dl></div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.spatial_queries.basic_queries"></a><a class="link" href="r_tree.html#geometry_index.r_tree.spatial_queries.basic_queries" title="Basic queries">Basic
- queries</a>
-</h4></div></div></div>
-
- There are three ways to perform a spatial query. Following queries returns
- <code class="computeroutput">Value</code>s intersecting some box_region.
- 
-
- Method call
- 
-<pre class="programlisting">std::vector<Value> returned_values;
-Box box_region(...);
-rt.query(box_region, std::back_inserter(returned_values));
-</pre>
-
- Function call
- 
-<pre class="programlisting">std::vector<Value> returned_values;
-Box box_region(...);
-index::query(rt, box_region, std::back_inserter(returned_values));
-</pre>
-
- Use of <code class="computeroutput">operator |</code>
- (as with ranges)
- 
-<pre class="programlisting">Box box_region(...);
-BOOST_FOREACH(Value & v, rt | index::query_filtered(box_region))
- ; // do something with v
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.spatial_queries.spatial_predicates"></a><a class="link" href="r_tree.html#geometry_index.r_tree.spatial_queries.spatial_predicates" title="Spatial predicates">Spatial
- predicates</a>
-</h4></div></div></div>
-
- It is possible to define other relations between queried <code class="computeroutput">Value</code>s
- and region/regions of interest. Names of predicates corresponds to names
- of Boost.Geometry
- algorithms.
- 
-<pre class="programlisting">rt.query(box, std::back_inserter(result)); // default case - intersects
-rt.query(index::intersects(box), std::back_inserter(result)); // same as default
-rt.query(index::covered_by(box), std::back_inserter(result));
-rt.query(index::disjont(box), std::back_inserter(result));
-rt.query(index::overlaps(box), std::back_inserter(result));
-rt.query(index::within(box), std::back_inserter(result));
-</pre>
-
- All predicates may be negated, e.g.:
- 
-<pre class="programlisting">rt.query(index::not_intersects(box), std::back_inserter(result));
-// or
-rt.query(!index::intersects(box), std::back_inserter(result));
-// the same as
-rt.query(index::disjoint(box), std::back_inserter(result));
-</pre>
-
- It's possible to use some number of predicates by passing <code class="computeroutput">std::pair<Pred1, Pred2></code>
- 
-<pre class="programlisting">rt.query(
- std::make_pair(index::intersects(box1), !index::within(box2))
- , std::back_inserter(result));
-</pre>
-
- or <code class="computeroutput">boost::tuple<Pred1, Pred2, Pred3, ...></code>
- 
-<pre class="programlisting">rt.query(
- boost::make_tuple(
- index::intersects(box1), !index::within(box2), index::overlaps(box3))
- , std::back_inserter(result));
-</pre>
-
- There is also a unique predicate <code class="computeroutput">index::value(...)</code> taking user-defined function/functor
- which checks if <code class="computeroutput">Value</code> should be returned by the query.
- 
-<pre class="programlisting">bool fun(__value const& v)
-{
- return v.is_red();
-}
-
-// ...
-
-rt.query(
- boost::make_pair(index::intersects(box), index::value(fun))
- , std::back_inserter(result));
-</pre>
-</div>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h3 class="title">
-<a name="geometry_index.r_tree.nearest_neighbors_queries"></a><a class="link" href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries" title="Nearest neighbors queries">Nearest
- neighbors queries</a>
-</h3></div></div></div>
-<div class="toc"><dl>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.k_nearest_neighbors">k
- nearest neighbors</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.one_nearest_neighbor">One
- nearest neighbor</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.distances_predicates">Distances
- predicates</a></dt>
-<dt><a href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.using_spatial_predicates">Using
- spatial predicates</a></dt>
-</dl></div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.nearest_neighbors_queries.k_nearest_neighbors"></a><a class="link" href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.k_nearest_neighbors" title="k nearest neighbors">k
- nearest neighbors</a>
-</h4></div></div></div>
-
- There are three ways of performing knn queries. Following queries returns
- k <code class="computeroutput">Value</code>s closest to some point in space. For <code class="computeroutput">Box</code>es
- <code class="computeroutput">Indexable</code>s closest point of a <code class="computeroutput">Box</code>
- is taken into account by default.
- 
-
- Method call
- 
-<pre class="programlisting">std::vector<Value> returned_values;
-Point pt(...);
-rt.nearest(pt, k, std::back_inserter(returned_values));
-</pre>
-
- Function call
- 
-<pre class="programlisting">std::vector<Value> returned_values;
-Point pt(...);
-index::nearest(rt, pt, k, std::back_inserter(returned_values));
-</pre>
-
- Use of <code class="computeroutput">operator |</code>
- 
-<pre class="programlisting">Point pt(...);
-BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k))
- ; // do something with v
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.nearest_neighbors_queries.one_nearest_neighbor"></a><a class="link" href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.one_nearest_neighbor" title="One nearest neighbor">One
- nearest neighbor</a>
-</h4></div></div></div>
-
- Another type of nearest neighbor query is searching for the one closest
- <code class="computeroutput">Value</code>. If it is found, 1 is returned by the method or function.
- This kind of query has only two forms.
- 
-
- Method call
- 
-<pre class="programlisting">Value returned_value;
-Point pt(...);
-size_t n = rt.nearest(pt, returned_value);
-</pre>
-
- Function call
- 
-<pre class="programlisting">Value Value returned_value;
-Point pt(...);
-size_t n = index::nearest(rt, pt, returned_value);
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.nearest_neighbors_queries.distances_predicates"></a><a class="link" href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.distances_predicates" title="Distances predicates">Distances
- predicates</a>
-</h4></div></div></div>
-
- It is possible to define if calculated distance between query point and
- <code class="computeroutput">Value</code> should be greater, lesser or between some other distances.
- Those are called <code class="computeroutput">DistancesPredicate</code>s
- and may be defined as follows.
- 
-<pre class="programlisting">std::vector<__Value__> returned_values;
-Point pt(...);
-
-/* default - without bounds */
-index::nearest(rt, pt, k, std::back_inserter(returned_values));
-
-/* same as default */
-index::nearest(rt, index::unbounded(pt), k, std::back_inserter(returned_values));
-
-/* distance must be greater than or equal to 10 */
-index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
-
-/* distance must be lesser than or equal to 500 */
-index::nearest(rt, index::max_bounded(pt, 500), k, std::back_inserter(returned_values));
-
-/* distance must be between 10 and 500 */
-index::nearest(rt, index::bounded(pt, 10, 500), k, std::back_inserter(returned_values));
-</pre>
-
- Furthermore, it's possible to define if the closest, furthest or centroidal
- point of the non-point <code class="computeroutput">Indexable</code> should be taken into account
- in the routine calculating distance.
- 
-<pre class="programlisting">std::vector<Value> returned_values;
-Point pt(...);
-
-/* default - distance between Indexable's closest point and a query point
-must be greater than 10 */
-index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
-
-/* same as default - distance between Indexable's closest point and a query point
-must be greater than 10 */
-index::nearest(rt, index::min_bounded(pt, index::near(10)), k, std::back_inserter(returned_values));
-
-/* distance between Indexable's furthest point and a query point
-must be greater than 10 */
-index::nearest(rt, index::min_bounded(pt, index::far(10)), k, std::back_inserter(returned_values));
-
-/* distance between Indexable's centroid and a query point
-must be greater than 10 */
-index::nearest(rt, index::min_bounded(pt, index::centroid(10)), k, std::back_inserter(returned_values));
-</pre>
-</div>
-<div class="section">
-<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.nearest_neighbors_queries.using_spatial_predicates"></a><a class="link" href="r_tree.html#geometry_index.r_tree.nearest_neighbors_queries.using_spatial_predicates" title="Using spatial predicates">Using
- spatial predicates</a>
-</h4></div></div></div>
-
- It is possible to use spatial predicates described before in nearest neighbors
- queries.
- 
-<pre class="programlisting">Value returned_value;
-std::vector<Value> returned_values;
-
-Point pt(...);
-Box b(...);
-
-size_t n1 = rt.nearest(index::bounded(pt, index::far(1), 10), index::intersects(b), returned_value);
-
-size_t n2 = index::nearest(rt, pt, k, index::within(b), std::back_inserter(returned_values));
-
-BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k, index::covered_by(b)))
- ; // do something with v
-</pre>
-</div>
-</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
<td align="left"></td>
@@ -496,7 +71,7 @@
</tr></table>
<hr>
<div class="spirit-nav">
-<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="r_tree/introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
</div>
</body>
</html>

Added: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,50 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Introduction</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../r_tree.html" title="R-tree">
+<link rel="prev" href="../r_tree.html" title="R-tree">
+<link rel="next" href="rtree_quickstart.html" title="Quick Start">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="http://www.boost.org/doc/libs/release/boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rtree_quickstart.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="geometry_index.r_tree.introduction"></a><a class="link" href="introduction.html" title="Introduction">Introduction</a>
+</h3></div></div></div>
+
+ R-tree is a self-balancing search tree. Each tree's node store a box descring
+ the space occupied by children nodes. At the bottom of the structure, there
+ are leaf-nodes which contains values (geometric objects representations).
+ Minimal and maximal numbers of values/children which may be stored inside
+ each node are user defined.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="rtree_quickstart.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,188 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Nearest neighbours queries</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../r_tree.html" title="R-tree">
+<link rel="prev" href="spatial_queries.html" title="Spatial queries">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="http://www.boost.org/doc/libs/release/boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="spatial_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="geometry_index.r_tree.nearest_neighbours_queries"></a><a class="link" href="nearest_neighbours_queries.html" title="Nearest neighbours queries">Nearest
+ neighbours queries</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.k_nearest_neighbours">k
+ nearest neighbours</a></dt>
+<dt><a href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.one_nearest_neighbour">One
+ nearest neighbour</a></dt>
+<dt><a href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.distances_predicates">Distances
+ predicates</a></dt>
+<dt><a href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.using_spatial_predicates">Using
+ spatial predicates</a></dt>
+</dl></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.nearest_neighbours_queries.k_nearest_neighbours"></a><a class="link" href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.k_nearest_neighbours" title="k nearest neighbours">k
+ nearest neighbours</a>
+</h4></div></div></div>
+
+ There are three ways of performing knn queries. Following queries returns
+ k <code class="computeroutput">Value</code>s closest to some point in space. For <code class="computeroutput">Box</code>es
+ <code class="computeroutput">Indexable</code>s the distance to the nearest point is calculated
+ by default.
+ 
+
+ Method call
+ 
+<pre class="programlisting">std::vector<Value> returned_values;
+Point pt(...);
+rt.nearest(pt, k, std::back_inserter(returned_values));
+</pre>
+
+ Function call
+ 
+<pre class="programlisting">std::vector<Value> returned_values;
+Point pt(...);
+index::nearest(rt, pt, k, std::back_inserter(returned_values));
+</pre>
+
+ Use of <code class="computeroutput">operator |</code>
+ 
+<pre class="programlisting">Point pt(...);
+BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k))
+ ; // do something with v
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.nearest_neighbours_queries.one_nearest_neighbour"></a><a class="link" href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.one_nearest_neighbour" title="One nearest neighbour">One
+ nearest neighbour</a>
+</h4></div></div></div>
+
+ Another type of nearest neighbour query is searching for the one closest
+ <code class="computeroutput">Value</code>. If it is found, 1 is returned by the method or function.
+ This kind of query has only two forms.
+ 
+
+ Method call
+ 
+<pre class="programlisting">Value returned_value;
+Point pt(...);
+size_t n = rt.nearest(pt, returned_value);
+</pre>
+
+ Function call
+ 
+<pre class="programlisting">Value Value returned_value;
+Point pt(...);
+size_t n = index::nearest(rt, pt, returned_value);
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.nearest_neighbours_queries.distances_predicates"></a><a class="link" href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.distances_predicates" title="Distances predicates">Distances
+ predicates</a>
+</h4></div></div></div>
+
+ It is possible to define if calculated distance between query point and
+ <code class="computeroutput">Value</code> should be greater, lesser or between some other distances.
+ Those are called <code class="computeroutput">DistancesPredicate</code>s
+ and may be defined as follows.
+ 
+<pre class="programlisting">std::vector<__Value__> returned_values;
+Point pt(...);
+
+/* default - without bounds */
+index::nearest(rt, pt, k, std::back_inserter(returned_values));
+
+/* same as default */
+index::nearest(rt, index::unbounded(pt), k, std::back_inserter(returned_values));
+
+/* distance must be greater than or equal to 10 */
+index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
+
+/* distance must be lesser than or equal to 500 */
+index::nearest(rt, index::max_bounded(pt, 500), k, std::back_inserter(returned_values));
+
+/* distance must be between 10 and 500 */
+index::nearest(rt, index::bounded(pt, 10, 500), k, std::back_inserter(returned_values));
+</pre>
+
+ Furthermore, it's possible to define if the closest, furthest or centroidal
+ point of the non-point <code class="computeroutput">Indexable</code> should be taken into account
+ in the routine calculating distance.
+ 
+<pre class="programlisting">std::vector<Value> returned_values;
+Point pt(...);
+
+/* default - distance between Indexable's closest point and a query point
+must be greater than 10 */
+index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
+
+/* same as default - distance between Indexable's closest point and a query point
+must be greater than 10 */
+index::nearest(rt, index::min_bounded(pt, index::near(10)), k, std::back_inserter(returned_values));
+
+/* distance between Indexable's furthest point and a query point
+must be greater than 10 */
+index::nearest(rt, index::min_bounded(pt, index::far(10)), k, std::back_inserter(returned_values));
+
+/* distance between Indexable's centroid and a query point
+must be greater than 10 */
+index::nearest(rt, index::min_bounded(pt, index::centroid(10)), k, std::back_inserter(returned_values));
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.nearest_neighbours_queries.using_spatial_predicates"></a><a class="link" href="nearest_neighbours_queries.html#geometry_index.r_tree.nearest_neighbours_queries.using_spatial_predicates" title="Using spatial predicates">Using
+ spatial predicates</a>
+</h4></div></div></div>
+
+ It is possible to use spatial predicates described before in nearest neighbours
+ queries.
+ 
+<pre class="programlisting">Value returned_value;
+std::vector<Value> returned_values;
+
+Point pt(...);
+Box b(...);
+
+size_t n1 = rt.nearest(index::bounded(pt, index::far(1), 10), index::intersects(b), returned_value);
+
+size_t n2 = index::nearest(rt, pt, k, index::within(b), std::back_inserter(returned_values));
+
+BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k, index::covered_by(b)))
+ ; // do something with v
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="spatial_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a>
+</div>
+</body>
+</html>

Added: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/r_tree_creation.html
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/r_tree_creation.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,184 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>R-tree creation</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../r_tree.html" title="R-tree">
+<link rel="prev" href="rtree_quickstart.html" title="Quick Start">
+<link rel="next" href="spatial_queries.html" title="Spatial queries">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="http://www.boost.org/doc/libs/release/boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="rtree_quickstart.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spatial_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="geometry_index.r_tree.r_tree_creation"></a><a class="link" href="r_tree_creation.html" title="R-tree creation">R-tree creation</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters">R-tree
+ template parameters</a></dt>
+<dt><a href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator">Values,
+ Indexables and default Translator</a></dt>
+<dt><a href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms">Inserting
+ and splitting algorithms</a></dt>
+<dt><a href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_removing_values">Inserting
+ and removing Values</a></dt>
+</dl></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.r_tree_creation.r_tree_template_parameters"></a><a class="link" href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.r_tree_template_parameters" title="R-tree template parameters">R-tree
+ template parameters</a>
+</h4></div></div></div>
+
+ R-tree has 4 parameters:
+ 
+<pre class="programlisting">rtree<Value, Parameters, Translator, Allocator>
+</pre>
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ <code class="computeroutput">Value</code> - type of object
+ which will be stored in the container.
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Parameters</code> - compile-time
+ parameters, e.g. inserting/splitting algorithm with min and max nodes'
+ elements numbers.
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Translator</code> - type of
+ object translating <code class="computeroutput">Value</code>
+ objects to <code class="computeroutput">Indexable</code>
+ objects (<code class="computeroutput">Point</code>
+ or <code class="computeroutput">Box</code>)
+ which R-tree can handle.
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Allocator</code> - the allocator.
+ </li>
+</ul></div>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator"></a><a class="link" href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.values__indexables_and_default_translator" title="Values, Indexables and default Translator">Values,
+ Indexables and default Translator</a>
+</h4></div></div></div>
+
+ R-tree may store <code class="computeroutput">Value</code>s of any type as long the <code class="computeroutput">Translator</code>
+ is passed as parameter. It knows how to interpret those <code class="computeroutput">Value</code>s
+ and extract an object understandable by the R-tree. Those objects are called
+ <code class="computeroutput">Indexable</code>s. Each type adapted to <code class="computeroutput">Point</code>
+ or <code class="computeroutput">Box</code>
+ concept is an <code class="computeroutput">Indexable</code>. Default <code class="computeroutput">Translator</code>
+ <code class="computeroutput">index::translator::def<Value></code>
+ is able to handle <code class="computeroutput">Point</code>,
+ <code class="computeroutput">Box</code>,
+ <code class="computeroutput">std::pair<...></code>,
+ pointer, iterator or smart pointer.
+ 
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
+<li class="listitem">
+ <code class="computeroutput">Indexable = Point
+ | Box</code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">BasicValue =
+ Indexable |
+ std::pair<Indexable, T> | std::pair<T, Indexable></code>
+ </li>
+<li class="listitem">
+ <code class="computeroutput">Value = BasicValue
+ | BasicValue* | Iterator<BasicValue>
+ | SmartPtr<BasicValue></code>
+ </li>
+</ul></div>
+
+ Examples of <code class="computeroutput">Value</code> types:
+ 
+<pre class="programlisting">geometry::model::point<...>
+geometry::model::point_xy<...>
+geometry::model::box<...>
+std::pair<geometry::model::box<...>, size_t>
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms"></a><a class="link" href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_splitting_algorithms" title="Inserting and splitting algorithms">Inserting
+ and splitting algorithms</a>
+</h4></div></div></div>
+
+ <code class="computeroutput">Value</code>s may be inserted to the R-tree in many various ways.
+ Final internal structure of the R-tree depends on algorithms used in the
+ insertion process. The most important is nodes' splitting algorithm. Currently,
+ three well-known types of R-trees may be created.
+ 
+
+ Linear - classic R-tree using splitting algorithm of linear complexity
+ 
+<pre class="programlisting">index::rtree< Value, index::linear<32, 8> > rt;
+</pre>
+
+ Quadratic - classic R-tree using splitting algorithm of quadratic complexity
+ 
+<pre class="programlisting">index::rtree< Value, index::quadratic<32, 8> > rt;
+</pre>
+
+ R*-tree - splitting algorithm minimizing nodes' overlap with forced reinsertions
+ 
+<pre class="programlisting">index::rtree< Value, index::rstar<32, 8> > rt;
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.r_tree_creation.inserting_and_removing_values"></a><a class="link" href="r_tree_creation.html#geometry_index.r_tree.r_tree_creation.inserting_and_removing_values" title="Inserting and removing Values">Inserting
+ and removing Values</a>
+</h4></div></div></div>
+
+ Following code creates an R-tree using quadratic algorithm.
+ 
+<pre class="programlisting">using namespace boost::geometry;
+typedef std::pair<Box, int> Value;
+index::rtree< Value, index::quadratic<32, 8> > rt;
+</pre>
+
+ To insert or remove Value's by method calls one may use the following code.
+ 
+<pre class="programlisting">Value v = std::make_pair(Box(...), 0);
+rt.insert(v);
+rt.remove(v);
+</pre>
+
+ To insert or remove Value's by function calls one may use the following
+ code.
+ 
+<pre class="programlisting">Value v = std::make_pair(Box(...), 0);
+index::insert(rt, v);
+index::remove(rt, v);
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="rtree_quickstart.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="spatial_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,132 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Quick Start</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../r_tree.html" title="R-tree">
+<link rel="prev" href="introduction.html" title="Introduction">
+<link rel="next" href="r_tree_creation.html" title="R-tree creation">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="http://www.boost.org/doc/libs/release/boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="r_tree_creation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="geometry_index.r_tree.rtree_quickstart"></a><a class="link" href="rtree_quickstart.html" title="Quick Start">Quick Start</a>
+</h3></div></div></div>
+
+ This Quick Start section shows simple way to creating a typical R-tree and
+ perform spatial query.
+ 
+
+ The code below assumes that following files are included and namespaces used.
+ 
+
+
+<pre class="programlisting">#include <vector>
+
+#include <boost/geometry.hpp>
+#include <boost/geometry/geometries/point_xy.hpp>
+#include <boost/geometry/geometries/box.hpp>
+
+#include <boost/geometry/extensions/index/rtree/rtree.hpp>
+
+namespace bg = boost::geometry;
+namespace bgi = boost::geometry::index;
+</pre>
+
+ 
+
+ It is possible to store user-defined types in the R-tree. To keep it simple
+ we will use predefined Point
+ and Box.
+ 
+
+
+<pre class="programlisting">typedef bg::model::point<float, 2, bg::cs::cartesian> point;
+typedef bg::model::box<point> box;
+typedef std::pair<box, unsigned> value;
+</pre>
+
+ 
+
+ R-tree may be created using various algorithm and parameters. In this example
+ we will use quadratic algorithm. Maximum number of elements in nodes are
+ set to 32, minimum to 8.
+ 
+
+
+<pre class="programlisting">bgi::rtree< value, bgi::quadratic<32, 8> > rtree;
+</pre>
+
+ 
+
+ Inserting values into the R-tree may be done by calling insert() method.
+ 
+
+
+<pre class="programlisting">// create some box
+// this typically will be an envelope of some geometry
+box b(point(0, 0), point(10, 10));
+// insert new value
+rtree.insert(std::make_pair(b, 0));
+</pre>
+
+ 
+
+ There are various types of queries that may be performed, they can be even
+ combined together in one call. For simplicity, default one is used.
+ 
+
+
+<pre class="programlisting">// find values intersecting a box
+std::vector<value> result;
+rtree.query(b, std::back_inserter(result));
+</pre>
+
+ 
+
+ Default k-nearest neighbors query may be performed as follows.
+ 
+
+
+<pre class="programlisting">// find 5 nearest values to a point
+rtree.nearest(point(0, 0), 5, std::back_inserter(result));
+</pre>
+
+ 
+<h4>
+<a name="geometry_index.r_tree.rtree_quickstart.h0"></a>
+ <a name="geometry_index.r_tree.rtree_quickstart.more"></a><a class="link" href="rtree_quickstart.html#geometry_index.r_tree.rtree_quickstart.more">More</a>
+ </h4>
+
+ More information about the R-tree implementation, other algorithms and queries
+ may be found in other parts of this documentation.
+ 
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="introduction.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="r_tree_creation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Added: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,138 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
+<title>Spatial queries</title>
+<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
+<link rel="up" href="../r_tree.html" title="R-tree">
+<link rel="prev" href="r_tree_creation.html" title="R-tree creation">
+<link rel="next" href="nearest_neighbours_queries.html" title="Nearest neighbours queries">
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
+<table cellpadding="2" width="100%"><tr>
+<td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="http://www.boost.org/doc/libs/release/boost.png"></td>
+<td align="center">Home</td>
+<td align="center">Libraries</td>
+<td align="center">People</td>
+<td align="center">FAQ</td>
+<td align="center">More</td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="r_tree_creation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nearest_neighbours_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h3 class="title">
+<a name="geometry_index.r_tree.spatial_queries"></a><a class="link" href="spatial_queries.html" title="Spatial queries">Spatial queries</a>
+</h3></div></div></div>
+<div class="toc"><dl>
+<dt><a href="spatial_queries.html#geometry_index.r_tree.spatial_queries.basic_queries">Basic
+ queries</a></dt>
+<dt><a href="spatial_queries.html#geometry_index.r_tree.spatial_queries.spatial_predicates">Spatial
+ predicates</a></dt>
+</dl></div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.spatial_queries.basic_queries"></a><a class="link" href="spatial_queries.html#geometry_index.r_tree.spatial_queries.basic_queries" title="Basic queries">Basic
+ queries</a>
+</h4></div></div></div>
+
+ There are three ways to perform a spatial query. Following queries returns
+ <code class="computeroutput">Value</code>s intersecting some box_region.
+ 
+
+ Method call
+ 
+<pre class="programlisting">std::vector<Value> returned_values;
+Box box_region(...);
+rt.query(box_region, std::back_inserter(returned_values));
+</pre>
+
+ Function call
+ 
+<pre class="programlisting">std::vector<Value> returned_values;
+Box box_region(...);
+index::query(rt, box_region, std::back_inserter(returned_values));
+</pre>
+
+ Use of pipe operator generating a range
+ 
+<pre class="programlisting">Box box_region(...);
+BOOST_FOREACH(Value & v, rt | index::query_filtered(box_region))
+ ; // do something with v
+</pre>
+</div>
+<div class="section">
+<div class="titlepage"><div><div><h4 class="title">
+<a name="geometry_index.r_tree.spatial_queries.spatial_predicates"></a><a class="link" href="spatial_queries.html#geometry_index.r_tree.spatial_queries.spatial_predicates" title="Spatial predicates">Spatial
+ predicates</a>
+</h4></div></div></div>
+
+ It is possible to define other relations between queried <code class="computeroutput">Value</code>s
+ and region/regions of interest. Names of predicates corresponds to names
+ of Boost.Geometry
+ algorithms.
+ 
+<pre class="programlisting">rt.query(box, std::back_inserter(result)); // default case - intersects
+rt.query(index::intersects(box), std::back_inserter(result)); // same as default
+rt.query(index::covered_by(box), std::back_inserter(result));
+rt.query(index::disjont(box), std::back_inserter(result));
+rt.query(index::overlaps(box), std::back_inserter(result));
+rt.query(index::within(box), std::back_inserter(result));
+</pre>
+
+ All predicates may be negated, e.g.:
+ 
+<pre class="programlisting">rt.query(index::not_intersects(box), std::back_inserter(result));
+// or
+rt.query(!index::intersects(box), std::back_inserter(result));
+// the same as
+rt.query(index::disjoint(box), std::back_inserter(result));
+</pre>
+
+ It's possible to use some number of predicates by passing <code class="computeroutput">std::pair<Pred1, Pred2></code>
+ 
+<pre class="programlisting">rt.query(
+ std::make_pair(index::intersects(box1), !index::within(box2))
+ , std::back_inserter(result));
+</pre>
+
+ or <code class="computeroutput">boost::tuple<Pred1, Pred2, Pred3, ...></code>
+ 
+<pre class="programlisting">rt.query(
+ boost::make_tuple(
+ index::intersects(box1), !index::within(box2), index::overlaps(box3))
+ , std::back_inserter(result));
+</pre>
+
+ There is also a unique predicate <code class="computeroutput">index::value(...)</code> taking user-defined function/functor
+ which checks if <code class="computeroutput">Value</code> should be returned by the query.
+ 
+<pre class="programlisting">bool fun(Value const& v)
+{
+ return v.is_red();
+}
+
+// ...
+
+rt.query(
+ boost::make_pair(index::intersects(box), index::value(fun))
+ , std::back_inserter(result));
+</pre>
+</div>
+</div>
+<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
+<td align="left"></td>
+<td align="right"><div class="copyright-footer">Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez
+ Distributed under the Boost Software License, Version 1.0. (See accompanying
+ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+ 
+</div></td>
+</tr></table>
+<hr>
+<div class="spirit-nav">
+<a accesskey="p" href="r_tree_creation.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../r_tree.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../../index.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="nearest_neighbours_queries.html"><img src="http://www.boost.org/doc/libs/release/doc/src/images/next.png" alt="Next"></a>
+</div>
+</body>
+</html>

Modified: sandbox-branches/geometry/index/doc/html/index.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/index.html (original)
+++ sandbox-branches/geometry/index/doc/html/index.html 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,10 +1,10 @@
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
-<title>Chapter 1. Geometry Index 0.7</title>
+<title>Chapter 1. Geometry Index</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
-<link rel="home" href="index.html" title="Chapter 1. Geometry Index 0.7">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
+<link rel="home" href="index.html" title="Chapter 1. Geometry Index">
<link rel="next" href="geometry_index/introduction.html" title="Introduction">
</head>
<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
@@ -21,7 +21,7 @@
<div class="chapter">
<div class="titlepage"><div>
<div><h2 class="title">
-<a name="geometry"></a>Chapter 1. Geometry Index 0.7</h2></div>
+<a name="geometry"></a>Chapter 1. Geometry Index</h2></div>
<div><div class="author"><h3 class="author">
Adam Wulkiewicz
</h3></div></div>
@@ -30,7 +30,7 @@
</h3></div></div>
<div>Copyright © 2011 Adam Wulkiewicz, Federico J. Fernandez</div>
<div><div class="legalnotice">
-<a name="id808512"></a>
+<a name="geometry.legal"></a>
 Distributed under the Boost Software License, Version 1.0. (See accompanying
 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 
@@ -42,19 +42,18 @@
<dt>Introduction</dt>
<dt>R-tree</dt>
<dd><dl>
-<dt>Introduction</dt>
-<dt>R-tree creation</dt>
-<dt><a href="geometry_index/r_tree.html#geometry_index.r_tree.inserting_and_removing_values">Inserting
- and removing Values</a></dt>
-<dt>Spatial queries</dt>
-<dt><a href="geometry_index/r_tree.html#geometry_index.r_tree.nearest_neighbors_queries">Nearest
- neighbors queries</a></dt>
+<dt>Introduction</dt>
+<dt>Quick Start</dt>
+<dt>R-tree creation</dt>
+<dt>Spatial queries</dt>
+<dt><a href="geometry_index/r_tree/nearest_neighbours_queries.html">Nearest
+ neighbours queries</a></dt>
</dl></dd>
</dl>
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: November 30, 2011 at 13:38:40 GMT</td>
+<td align="left">Last revised: August 23, 2012 at 21:48:12 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Added: sandbox-branches/geometry/index/doc/imports.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/imports.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,11 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[import src/examples/rtree/quick_start.cpp]

Modified: sandbox-branches/geometry/index/doc/index.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/index.qbk (original)
+++ sandbox-branches/geometry/index/doc/index.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
[/============================================================================
- Boost.Geometry Index (Spatial Indexes)
+ Boost.Geometry Index

- Copyright (c) 2008 Federico J. Fernandez.
- Copyright (c) 2011 Adam Wulkiewicz.
+ Copyright (c) 2011-2012 Adam Wulkiewicz.

   Use, modification and distribution is subject to the Boost Software License,
   Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
@@ -11,7 +10,6 @@

[library Geometry Index
     [quickbook 1.5]
- [version 0.7]
     [authors [Wulkiewicz, Adam], [Fernandez, Federico J.]]
     [copyright 2011 Adam Wulkiewicz, Federico J. Fernandez]
     [purpose Documentation of Boost.Geometry Index library]
@@ -42,6 +40,8 @@
[def __cgeometry__ [@http://www.boost.org/libs/geometry/doc/html/index.html geometry]]
[def __cboost__ [@http://www.boost.org/libs/libraries.htm boost]]

+[include imports.qbk]
+
[include introduction.qbk]

[include rtree.qbk]

Modified: sandbox-branches/geometry/index/doc/introduction.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/introduction.qbk (original)
+++ sandbox-branches/geometry/index/doc/introduction.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
[/============================================================================
- Boost.Geometry Index (Spatial Indexes)
+ Boost.Geometry Index

- Copyright (c) 2008 Federico J. Fernandez.
- Copyright (c) 2011 Adam Wulkiewicz.
+ Copyright (c) 2011-2012 Adam Wulkiewicz.

Use, modification and distribution is subject to the Boost Software License,
Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at

Modified: sandbox-branches/geometry/index/doc/rtree.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/rtree.qbk (original)
+++ sandbox-branches/geometry/index/doc/rtree.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,7 @@
[/============================================================================
- Boost.Geometry Index (Spatial Indexes)
+ Boost.Geometry Index

- Copyright (c) 2008 Federico J. Fernandez.
- Copyright (c) 2011 Adam Wulkiewicz.
+ Copyright (c) 2011-2012 Adam Wulkiewicz.

Use, modification and distribution is subject to the Boost Software License,
Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
@@ -11,307 +10,10 @@

[section R-tree]

-[section Introduction]
+[include rtree/introduction.qbk]
+[include rtree/quickstart.qbk]
+[include rtree/creation.qbk]
+[include rtree/query.qbk]
+[include rtree/nearest.qbk]

-__rtree__ is a self-balancing search tree with nodes stored with their axis aligned
-bounding boxes. Each node's box describes the space occupied by children nodes.
-At the bottom of the structure, there are leaf-nodes which contains values
-(geometric objects representations). Minimal and maximal numbers of values/children
-which may be stored inside the node are user defined.
-
-In order to use the __rtree__ one must include folowing file.
-
- #include <boost/geometry/extensions/index/rtree/rtree.hpp>
-
-[endsect]
-
-[section R-tree creation]
-
-[section Quick start]
-
-In order to create a __rtree__ object storing values of type `std::pair<__box__, size_t>`
-one may use the following code:
-
- using namespace __cboost__::__cgeometry__;
- typedef std::pair<__box__, size_t> Value;
- index::rtree< Value, index::quadratic<32, 8> > rt;
-
-[endsect]
-
-[section R-tree template parameters]
-
-__rtree__ has 4 parameters:
-
- rtree<Value, Parameters, Translator, Allocator>
-
-* `Value` - type of object which will be stored in the container.
-* `Parameters` - compile-time parameters, e.g. inserting/splitting
- algorithm with min and max nodes' elements numbers.
-* `Translator` - type of object translating `Value` objects to
- `Indexable` objects (`__point__` or `__box__`) which __rtree__ can handle.
-* `Allocator` - the allocator.
-
-[endsect]
-
-[section Values, Indexables and default Translator]
-
-__rtree__ may store `__value__`s of any type as long as there is passed
-the `__translator__` which knows how to interpret those `__value__`s
-and extract an object understandable by the __rtree__. Those objects are called
-`__indexable__`s and they are simply of type adapted to `__point__`
-or `__box__` concept. Default `__translator__` `index::translator::def<Value>`
-is able to handle `__point__`, `__box__`, `std::pair<...>`, pointer, iterator
-or smart pointer.
-
-* `__indexable__ = __point__ | __box__`
-* `BasicValue = Indexable | std::pair<__indexable__, T> | std::pair<T, __indexable__>`
-* `__value__ = BasicValue | BasicValue* | Iterator<BasicValue> | SmartPtr<BasicValue>`
-
-Examples of `__value__` types:
-
- geometry::model::point<...>
- geometry::model::point_xy<...>
- geometry::model::box<...>
- std::pair<geometry::model::box<...>, size_t>
-
-[endsect]
-
-[section Inserting and splitting algorithms]
-
-`__value__`s may be inserted to the __rtree__ in many various ways. Final structure of nodes depends
-on algorithms used in the process, especially nodes' splitting algorithm. Currently, three
-well-known types of R-trees may be created.
-
-Linear - classic __rtree__ using splitting algorithm of linear complexity
-
- index::rtree< __value__, index::linear<32, 8> > rt;
-
-Quadratic - classic __rtree__ using splitting algorithm of quadratic complexity
-
- index::rtree< __value__, index::quadratic<32, 8> > rt;
-
-R*-tree - splitting algorithm minimizing nodes' overlap with forced reinsertions
-
- index::rtree< __value__, index::rstar<32, 8> > rt;
-
-[endsect]
-
-[endsect] [/ R-tree creation /]
-
-[section Inserting and removing Values]
-
-Create
-
- using namespace boost::geometry;
- typedef std::pair<Box, int> __value__;
- index::rtree< __value__, index::quadratic<32, 8> > rt;
-
-Insert and remove by method call
-
- __value__ v = std::make_pair(__box__(...), 0);
- rt.insert(v);
- rt.remove(v);
-
-or by function call
-
- __value__ v = std::make_pair(__box__(...), 0);
- index::insert(rt, v);
- index::remove(rt, v);
-
-[endsect]
-
-[section Spatial queries]
-
-[section Basic queries]
-
-There are three ways to perform a spatial query. Following queries returns
-`__value__`s intersecting some box_region.
-
-Method call
-
- std::vector<__value__> returned_values;
- __box__ box_region(...);
- rt.query(box_region, std::back_inserter(returned_values));
-
-Function call
-
- std::vector<__value__> returned_values;
- __box__ box_region(...);
- index::query(rt, box_region, std::back_inserter(returned_values));
-
-Use of `operator |` (as with ranges)
-
- __box__ box_region(...);
- BOOST_FOREACH(__value__ & v, rt | index::query_filtered(box_region))
- ; // do something with v
[endsect]
-
-[section Spatial predicates]
-
-It is possible to define other relations between queried `__value__`s and region/regions
-of interest. Names of predicates corresponds to names of __boost_geometry__ algorithms.
-
- rt.query(box, std::back_inserter(result)); // default case - intersects
- rt.query(index::intersects(box), std::back_inserter(result)); // same as default
- rt.query(index::covered_by(box), std::back_inserter(result));
- rt.query(index::disjont(box), std::back_inserter(result));
- rt.query(index::overlaps(box), std::back_inserter(result));
- rt.query(index::within(box), std::back_inserter(result));
-
-All predicates may be negated, e.g.:
-
- rt.query(index::not_intersects(box), std::back_inserter(result));
- // or
- rt.query(!index::intersects(box), std::back_inserter(result));
- // the same as
- rt.query(index::disjoint(box), std::back_inserter(result));
-
-It's possible to use some number of predicates by passing `std::pair<Pred1, Pred2>`
-
- rt.query(
- std::make_pair(index::intersects(box1), !index::within(box2))
- , std::back_inserter(result));
-
-or `boost::tuple<Pred1, Pred2, Pred3, ...>`
-
- rt.query(
- boost::make_tuple(
- index::intersects(box1), !index::within(box2), index::overlaps(box3))
- , std::back_inserter(result));
-
-There is also a unique predicate `index::value(...)` taking user-defined function/functor
-which checks if `__value__` should be returned by the query.
-
- bool fun(__value const& v)
- {
- return v.is_red();
- }
-
- // ...
-
- rt.query(
- boost::make_pair(index::intersects(box), index::value(fun))
- , std::back_inserter(result));
-
-[endsect]
-
-[endsect] [/ Spatial queries /]
-
-[section Nearest neighbors queries]
-
-[section k nearest neighbors]
-
-There are three ways of performing knn queries. Following queries returns
-k `__value__`s closest to some point in space. For `__box__`es
-`__indexable__`s closest point of a `__box__` is taken into account by default.
-
-Method call
-
- std::vector<__value__> returned_values;
- __point__ pt(...);
- rt.nearest(pt, k, std::back_inserter(returned_values));
-
-Function call
-
- std::vector<__value__> returned_values;
- __point__ pt(...);
- index::nearest(rt, pt, k, std::back_inserter(returned_values));
-
-Use of `operator |`
-
- __point__ pt(...);
- BOOST_FOREACH(__value__ & v, rt | index::nearest_filtered(pt, k))
- ; // do something with v
-
-[endsect]
-
-[section One nearest neighbor]
-
-Another type of nearest neighbor query is searching for the one closest `__value__`.
-If it is found, 1 is returned by the method or function. This kind of query
-has only two forms.
-
-Method call
-
- __value__ returned_value;
- __point__ pt(...);
- size_t n = rt.nearest(pt, returned_value);
-
-Function call
-
- __value__ Value returned_value;
- __point__ pt(...);
- size_t n = index::nearest(rt, pt, returned_value);
-
-[endsect]
-
-[section Distances predicates]
-
-It is possible to define if calculated distance between query point and `__value__` should be
-greater, lesser or between some other distances. Those are called `DistancesPredicate`s and
-may be defined as follows.
-
- std::vector<__Value__> returned_values;
- __point__ pt(...);
-
- /* default - without bounds */
- index::nearest(rt, pt, k, std::back_inserter(returned_values));
-
- /* same as default */
- index::nearest(rt, index::unbounded(pt), k, std::back_inserter(returned_values));
-
- /* distance must be greater than or equal to 10 */
- index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
-
- /* distance must be lesser than or equal to 500 */
- index::nearest(rt, index::max_bounded(pt, 500), k, std::back_inserter(returned_values));
-
- /* distance must be between 10 and 500 */
- 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.
-
- std::vector<__value__> returned_values;
- __point__ pt(...);
-
- /* default - distance between Indexable's closest point and a query point
- must be greater than 10 */
- index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
-
- /* same as default - distance between Indexable's closest point and a query point
- must be greater than 10 */
- index::nearest(rt, index::min_bounded(pt, index::near(10)), k, std::back_inserter(returned_values));
-
- /* distance between Indexable's furthest point and a query point
- must be greater than 10 */
- index::nearest(rt, index::min_bounded(pt, index::far(10)), k, std::back_inserter(returned_values));
-
- /* distance between Indexable's centroid and a query point
- must be greater than 10 */
- index::nearest(rt, index::min_bounded(pt, index::centroid(10)), k, std::back_inserter(returned_values));
-
-[endsect]
-
-[section Using spatial predicates]
-
-It is possible to use spatial predicates described before in nearest neighbors queries.
-
- __value__ returned_value;
- std::vector<__value__> returned_values;
-
- __point__ pt(...);
- __box__ b(...);
-
- size_t n1 = rt.nearest(index::bounded(pt, index::far(1), 10), index::intersects(b), returned_value);
-
- size_t n2 = index::nearest(rt, pt, k, index::within(b), std::back_inserter(returned_values));
-
- BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k, index::covered_by(b)))
- ; // do something with v
-
-[endsect]
-
-[endsect] [/ Nearest neighbors queries /]
-
-[endsect] [/ R-tree /]

Added: sandbox-branches/geometry/index/doc/rtree/creation.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/rtree/creation.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,95 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[section R-tree creation]
+
+[section R-tree template parameters]
+
+__rtree__ has 4 parameters:
+
+ rtree<Value, Parameters, Translator, Allocator>
+
+* `Value` - type of object which will be stored in the container.
+* `Parameters` - compile-time parameters, e.g. inserting/splitting
+ algorithm with min and max nodes' elements numbers.
+* `Translator` - type of object translating `Value` objects to
+ `Indexable` objects (`__point__` or `__box__`) which __rtree__ can handle.
+* `Allocator` - the allocator.
+
+[endsect]
+
+[section Values, Indexables and default Translator]
+
+__rtree__ may store `__value__`s of any type as long the `__translator__`
+is passed as parameter. It knows how to interpret those `__value__`s
+and extract an object understandable by the __rtree__. Those objects are called
+`__indexable__`s. Each type adapted to `__point__` or `__box__` concept is an `__indexable__`.
+Default `__translator__` `index::translator::def<Value>`
+is able to handle `__point__`, `__box__`, `std::pair<...>`, pointer, iterator
+or smart pointer.
+
+* `__indexable__ = __point__ | __box__`
+* `BasicValue = Indexable | std::pair<__indexable__, T> | std::pair<T, __indexable__>`
+* `__value__ = BasicValue | BasicValue* | Iterator<BasicValue> | SmartPtr<BasicValue>`
+
+Examples of `__value__` types:
+
+ geometry::model::point<...>
+ geometry::model::point_xy<...>
+ geometry::model::box<...>
+ std::pair<geometry::model::box<...>, size_t>
+
+[endsect]
+
+[section Inserting and splitting algorithms]
+
+`__value__`s may be inserted to the __rtree__ in many various ways. Final internal structure
+of the __rtree__ depends on algorithms used in the insertion process. The most important is
+nodes' splitting algorithm. Currently, three well-known types of R-trees may be created.
+
+Linear - classic __rtree__ using splitting algorithm of linear complexity
+
+ index::rtree< __value__, index::linear<32, 8> > rt;
+
+Quadratic - classic __rtree__ using splitting algorithm of quadratic complexity
+
+ index::rtree< __value__, index::quadratic<32, 8> > rt;
+
+R*-tree - splitting algorithm minimizing nodes' overlap with forced reinsertions
+
+ index::rtree< __value__, index::rstar<32, 8> > rt;
+
+[endsect]
+
+[section Inserting and removing Values]
+
+Following code creates an __rtree__ using quadratic algorithm.
+
+ using namespace boost::geometry;
+ typedef std::pair<Box, int> __value__;
+ index::rtree< __value__, index::quadratic<32, 8> > rt;
+
+To insert or remove __value__'s by method calls one may use the following
+code.
+
+ __value__ v = std::make_pair(__box__(...), 0);
+ rt.insert(v);
+ rt.remove(v);
+
+To insert or remove __value__'s by function calls one may use the following
+code.
+
+ __value__ v = std::make_pair(__box__(...), 0);
+ index::insert(rt, v);
+ index::remove(rt, v);
+
+[endsect]
+
+[endsect] [/ R-tree creation /]

Added: sandbox-branches/geometry/index/doc/rtree/introduction.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/rtree/introduction.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,18 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[section Introduction]
+
+__rtree__ is a self-balancing search tree. Each tree's node store a box descring the space occupied by children nodes.
+At the bottom of the structure, there are leaf-nodes which contains values
+(geometric objects representations). Minimal and maximal numbers of values/children
+which may be stored inside each node are user defined.
+
+[endsect]

Added: sandbox-branches/geometry/index/doc/rtree/nearest.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/rtree/nearest.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,126 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[section Nearest neighbours queries]
+
+[section k nearest neighbours]
+
+There are three ways of performing knn queries. Following queries returns
+k `__value__`s closest to some point in space. For `__box__`es
+`__indexable__`s the distance to the nearest point is calculated by default.
+
+Method call
+
+ std::vector<__value__> returned_values;
+ __point__ pt(...);
+ rt.nearest(pt, k, std::back_inserter(returned_values));
+
+Function call
+
+ std::vector<__value__> returned_values;
+ __point__ pt(...);
+ index::nearest(rt, pt, k, std::back_inserter(returned_values));
+
+Use of `operator |`
+
+ __point__ pt(...);
+ BOOST_FOREACH(__value__ & v, rt | index::nearest_filtered(pt, k))
+ ; // do something with v
+
+[endsect]
+
+[section One nearest neighbour]
+
+Another type of nearest neighbour query is searching for the one closest `__value__`.
+If it is found, 1 is returned by the method or function. This kind of query
+has only two forms.
+
+Method call
+
+ __value__ returned_value;
+ __point__ pt(...);
+ size_t n = rt.nearest(pt, returned_value);
+
+Function call
+
+ __value__ Value returned_value;
+ __point__ pt(...);
+ size_t n = index::nearest(rt, pt, returned_value);
+
+[endsect]
+
+[section Distances predicates]
+
+It is possible to define if calculated distance between query point and `__value__` should be
+greater, lesser or between some other distances. Those are called `DistancesPredicate`s and
+may be defined as follows.
+
+ std::vector<__Value__> returned_values;
+ __point__ pt(...);
+
+ /* default - without bounds */
+ index::nearest(rt, pt, k, std::back_inserter(returned_values));
+
+ /* same as default */
+ index::nearest(rt, index::unbounded(pt), k, std::back_inserter(returned_values));
+
+ /* distance must be greater than or equal to 10 */
+ index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
+
+ /* distance must be lesser than or equal to 500 */
+ index::nearest(rt, index::max_bounded(pt, 500), k, std::back_inserter(returned_values));
+
+ /* distance must be between 10 and 500 */
+ 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.
+
+ std::vector<__value__> returned_values;
+ __point__ pt(...);
+
+ /* default - distance between Indexable's closest point and a query point
+ must be greater than 10 */
+ index::nearest(rt, index::min_bounded(pt, 10), k, std::back_inserter(returned_values));
+
+ /* same as default - distance between Indexable's closest point and a query point
+ must be greater than 10 */
+ index::nearest(rt, index::min_bounded(pt, index::near(10)), k, std::back_inserter(returned_values));
+
+ /* distance between Indexable's furthest point and a query point
+ must be greater than 10 */
+ index::nearest(rt, index::min_bounded(pt, index::far(10)), k, std::back_inserter(returned_values));
+
+ /* distance between Indexable's centroid and a query point
+ must be greater than 10 */
+ index::nearest(rt, index::min_bounded(pt, index::centroid(10)), k, std::back_inserter(returned_values));
+
+[endsect]
+
+[section Using spatial predicates]
+
+It is possible to use spatial predicates described before in nearest neighbours queries.
+
+ __value__ returned_value;
+ std::vector<__value__> returned_values;
+
+ __point__ pt(...);
+ __box__ b(...);
+
+ size_t n1 = rt.nearest(index::bounded(pt, index::far(1), 10), index::intersects(b), returned_value);
+
+ size_t n2 = index::nearest(rt, pt, k, index::within(b), std::back_inserter(returned_values));
+
+ BOOST_FOREACH(Value & v, rt | index::nearest_filtered(pt, k, index::covered_by(b)))
+ ; // do something with v
+
+[endsect]
+
+[endsect] [/ Nearest neighbours queries /]

Added: sandbox-branches/geometry/index/doc/rtree/query.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/rtree/query.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,86 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[section Spatial queries]
+
+[section Basic queries]
+
+There are three ways to perform a spatial query. Following queries returns
+`__value__`s intersecting some box_region.
+
+Method call
+
+ std::vector<__value__> returned_values;
+ __box__ box_region(...);
+ rt.query(box_region, std::back_inserter(returned_values));
+
+Function call
+
+ std::vector<__value__> returned_values;
+ __box__ box_region(...);
+ index::query(rt, box_region, std::back_inserter(returned_values));
+
+Use of pipe operator generating a range
+
+ __box__ box_region(...);
+ BOOST_FOREACH(__value__ & v, rt | index::query_filtered(box_region))
+ ; // do something with v
+[endsect]
+
+[section Spatial predicates]
+
+It is possible to define other relations between queried `__value__`s and region/regions
+of interest. Names of predicates corresponds to names of __boost_geometry__ algorithms.
+
+ rt.query(box, std::back_inserter(result)); // default case - intersects
+ rt.query(index::intersects(box), std::back_inserter(result)); // same as default
+ rt.query(index::covered_by(box), std::back_inserter(result));
+ rt.query(index::disjont(box), std::back_inserter(result));
+ rt.query(index::overlaps(box), std::back_inserter(result));
+ rt.query(index::within(box), std::back_inserter(result));
+
+All predicates may be negated, e.g.:
+
+ rt.query(index::not_intersects(box), std::back_inserter(result));
+ // or
+ rt.query(!index::intersects(box), std::back_inserter(result));
+ // the same as
+ rt.query(index::disjoint(box), std::back_inserter(result));
+
+It's possible to use some number of predicates by passing `std::pair<Pred1, Pred2>`
+
+ rt.query(
+ std::make_pair(index::intersects(box1), !index::within(box2))
+ , std::back_inserter(result));
+
+or `boost::tuple<Pred1, Pred2, Pred3, ...>`
+
+ rt.query(
+ boost::make_tuple(
+ index::intersects(box1), !index::within(box2), index::overlaps(box3))
+ , std::back_inserter(result));
+
+There is also a unique predicate `index::value(...)` taking user-defined function/functor
+which checks if `__value__` should be returned by the query.
+
+ bool fun(__value__ const& v)
+ {
+ return v.is_red();
+ }
+
+ // ...
+
+ rt.query(
+ boost::make_pair(index::intersects(box), index::value(fun))
+ , std::back_inserter(result));
+
+[endsect]
+
+[endsect] [/ Spatial queries /]

Added: sandbox-branches/geometry/index/doc/rtree/quickstart.qbk
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/rtree/quickstart.qbk 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,47 @@
+[/============================================================================
+ Boost.Geometry Index
+
+ Copyright (c) 2011-2012 Adam Wulkiewicz.
+
+ Use, modification and distribution is subject to the Boost Software License,
+ Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
+=============================================================================/]
+
+[section:rtree_quickstart Quick Start]
+
+This Quick Start section shows simple way to creating a typical R-tree and perform
+spatial query.
+
+The code below assumes that following files are included and namespaces used.
+
+[rtree_quickstart_include]
+
+It is possible to store user-defined types in the R-tree. To keep it simple we will
+use predefined __point__ and __box__.
+
+[rtree_quickstart_valuetype]
+
+R-tree may be created using various algorithm and parameters. In this example we will
+use quadratic algorithm. Maximum number of elements in nodes are set to 32, minimum to 8.
+
+[rtree_quickstart_create]
+
+Inserting values into the R-tree may be done by calling insert() method.
+
+[rtree_quickstart_insert]
+
+There are various types of queries that may be performed, they can be even combined together
+in one call. For simplicity, default one is used.
+
+[rtree_quickstart_query]
+
+Default k-nearest neighbors query may be performed as follows.
+
+[rtree_quickstart_nearest]
+
+[h3 More]
+More information about the R-tree implementation, other algorithms and queries may be found in
+other parts of this documentation.
+
+[endsect]

Added: sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp
==============================================================================
--- (empty file)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -0,0 +1,57 @@
+// Boost.Geometry Index
+//
+// Quickbook Examples
+//
+// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
+//
+// Use, modification and distribution is subject to the Boost Software License,
+// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
+// http://www.boost.org/LICENSE_1_0.txt)
+
+//[rtree_quickstart_include
+
+#include <vector>
+
+#include <boost/geometry.hpp>
+#include <boost/geometry/geometries/point_xy.hpp>
+#include <boost/geometry/geometries/box.hpp>
+
+#include <boost/geometry/extensions/index/rtree/rtree.hpp>
+
+namespace bg = boost::geometry;
+namespace bgi = boost::geometry::index;
+//]
+
+int main(void)
+{
+ //[rtree_quickstart_valuetype
+ typedef bg::model::point<float, 2, bg::cs::cartesian> point;
+ typedef bg::model::box<point> box;
+ typedef std::pair<box, unsigned> value;
+ //]
+
+ //[rtree_quickstart_create
+ bgi::rtree< value, bgi::quadratic<32, 8> > rtree;
+ //]
+
+ //[rtree_quickstart_insert
+ // create some box
+ // this typically will be an envelope of some geometry
+ box b(point(0, 0), point(10, 10));
+ // insert new value
+ rtree.insert(std::make_pair(b, 0));
+ //]
+
+ //[rtree_quickstart_query
+ // find values intersecting a box
+ std::vector<value> result;
+ rtree.query(b, std::back_inserter(result));
+ //]
+
+ //[rtree_quickstart_nearest
+ // find 5 nearest values to a point
+ rtree.nearest(point(0, 0), 5, std::back_inserter(result));
+ //]
+
+ return 0;
+}

Modified: sandbox-branches/geometry/index/test/Jamfile.v2
==============================================================================
--- sandbox-branches/geometry/index/test/Jamfile.v2 (original)
+++ sandbox-branches/geometry/index/test/Jamfile.v2 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,5 @@
-# Boost.Geometry (aka GGL, Generic Geometry Library)
+# Boost.Geometry Index
#
-# Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-# Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-# Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
# Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
#
# Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/Jamfile.v2
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/Jamfile.v2 (original)
+++ sandbox-branches/geometry/index/test/algorithms/Jamfile.v2 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,5 @@
-# Boost.Geometry (aka GGL, Generic Geometry Library)
+# Boost.Geometry Index
#
-# Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-# Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-# Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
# Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
#
# Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/content.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/content.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/content.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,19 +1,12 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

-
#include <algorithms/test_content.hpp>

#include <boost/geometry/geometries/point_xy.hpp>

Modified: sandbox-branches/geometry/index/test/algorithms/intersection_content.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/intersection_content.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/intersection_content.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/algorithms/is_valid.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/is_valid.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/is_valid.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/algorithms/margin.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/margin.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/margin.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,19 +1,12 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

-
#include <algorithms/test_margin.hpp>

#include <boost/geometry/geometries/point_xy.hpp>

Modified: sandbox-branches/geometry/index/test/algorithms/minmaxdist.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/minmaxdist.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/minmaxdist.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/algorithms/test_content.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/test_content.hpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/test_content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,7 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

// Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/test_intersection_content.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/test_intersection_content.hpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/test_intersection_content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,7 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

// Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/test_margin.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/test_margin.hpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/test_margin.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,7 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

// Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/test_union_content.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/test_union_content.hpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/test_union_content.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,7 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

// Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/algorithms/union_content.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/algorithms/union_content.cpp (original)
+++ sandbox-branches/geometry/index/test/algorithms/union_content.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/geometry_index_test_common.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/geometry_index_test_common.hpp (original)
+++ sandbox-branches/geometry/index/test/geometry_index_test_common.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,18 +1,12 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
+// Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

-
#ifndef GEOMETRY_TEST_GEOMETRY_INDEX_TEST_COMMON_HPP
#define GEOMETRY_TEST_GEOMETRY_INDEX_TEST_COMMON_HPP

Modified: sandbox-branches/geometry/index/test/rtree/Jamfile.v2
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/Jamfile.v2 (original)
+++ sandbox-branches/geometry/index/test/rtree/Jamfile.v2 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,8 +1,5 @@
-# Boost.Geometry (aka GGL, Generic Geometry Library)
+# Boost.Geometry Index
#
-# Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-# Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-# Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
# Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.
#
# Use, modification and distribution is subject to the Boost Software License,

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_linear_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_linear_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_linear_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_linear_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_linear_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_linear_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_linear_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_linear_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_linear_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_linear_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_linear_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_linear_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_quadratic_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree2d_rstar_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_linear_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_linear_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_linear_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_linear_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_linear_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_linear_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_linear_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_linear_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_linear_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_linear_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_linear_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_linear_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_quadratic_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_d.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_d.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_d.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_f.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_f.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_f.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_i.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_i.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_i.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_tt.cpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_tt.cpp (original)
+++ sandbox-branches/geometry/index/test/rtree/rtree3d_rstar_tt.cpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,14 +1,8 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
-// Copyright (c) 2008-2012 Bruno Lalande, Paris, France.
-// Copyright (c) 2009-2012 Mateusz Loskot, London, UK.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

-// Parts of Boost.Geometry are redesigned from Geodan's Geographic Library
-// (geolib/GGL), copyright (c) 1995-2010 Geodan, Amsterdam, the Netherlands.
-
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

Modified: sandbox-branches/geometry/index/test/rtree/test_rtree.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/test_rtree.hpp (original)
+++ sandbox-branches/geometry/index/test/rtree/test_rtree.hpp 2012-08-23 17:55:34 EDT (Thu, 23 Aug 2012)
@@ -1,7 +1,6 @@
-// Boost.Geometry (aka GGL, Generic Geometry Library)
+// Boost.Geometry Index
// Unit Test

-// Copyright (c) 2007-2012 Barend Gehrels, Amsterdam, the Netherlands.
// Copyright (c) 2011-2012 Adam Wulkiewicz, Lodz, Poland.

// Use, modification and distribution is subject to the Boost Software License,

Next message: oliver.kowalke_at_[hidden]: "[Boost-commit] svn:boost r80165 - in trunk/libs/context: build doc"
Previous message: bdawes_at_[hidden]: "[Boost-commit] svn:boost r80163 - in trunk/libs/filesystem/doc: . src"

Date view	Thread view	Subject view	Author view

Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk