|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r82483 - in sandbox-branches/geometry/index: boost/geometry/extensions/index/rtree doc/generated doc/html doc/html/geometry_index/r_tree
From: adam.wulkiewicz_at_[hidden]
Date: 2013-01-13 15:02:20
Author: awulkiew
Date: 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
New Revision: 82483
URL: http://svn.boost.org/trac/boost/changeset/82483
Log:
Rtree docs improved.
Text files modified:
sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp | 113 +++++++++++------
sandbox-branches/geometry/index/doc/generated/rtree.qbk | 82 ++++++------
sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk | 48 +++++--
sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html | 250 ++++++++++++++++++++++++++++-----------
sandbox-branches/geometry/index/doc/html/index.html | 2
5 files changed, 325 insertions(+), 170 deletions(-)
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 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
@@ -59,8 +59,7 @@
/*!
\brief The R-tree spatial index.
-The R-tree spatial index. This is self-balancing spatial index capable to store various types
-of Values and balancing algorithms.
+This is self-balancing spatial index capable to store various types of Values and balancing algorithms.
\par Parameters
The user must pass a type defining the Parameters which will
@@ -631,22 +630,22 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation.
It can be generated by following functions:
- \li boost::geometry::index::to_nearest() - default,
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest() - default,
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
It is possible to define define distances bounds, for example that some distance must be between
min_distance and max_distance. This is done by passing DistancesPredicates which can be generated
by following functions:
- \li boost::geometry::index::unbounded() - default,
- \li boost::geometry::index::min_bounded(),
- \li boost::geometry::index::max_bounded(),
- \li boost::geometry::index::bounded().
+ \li \c boost::geometry::index::unbounded() - default,
+ \li \c boost::geometry::index::min_bounded(),
+ \li \c boost::geometry::index::max_bounded(),
+ \li \c boost::geometry::index::bounded().
MinRelation and MaxRelation describes bounds and can be generated by following functions:
- \li boost::geometry::index::to_nearest(),
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest(),
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
\param dpred The distances predicates or a Point.
@@ -671,22 +670,22 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation.
It can be generated by following functions:
- \li boost::geometry::index::to_nearest() - default,
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest() - default,
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
It is possible to define define distances bounds, for example that some distance must be between
min_distance and max_distance. This is done by passing DistancesPredicates which can be generated
by following functions:
- \li boost::geometry::index::unbounded() - default,
- \li boost::geometry::index::min_bounded(),
- \li boost::geometry::index::max_bounded(),
- \li boost::geometry::index::bounded().
+ \li \c boost::geometry::index::unbounded() - default,
+ \li \c boost::geometry::index::min_bounded(),
+ \li \c boost::geometry::index::max_bounded(),
+ \li \c boost::geometry::index::bounded().
MinRelation and MaxRelation describes bounds and can be generated by following functions:
- \li boost::geometry::index::to_nearest(),
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest(),
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
<b>Spatial predicates</b> may be a \c Geometry. In this case Values intersecting the \c Geometry are returned.
@@ -728,22 +727,22 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation.
It can be generated by following functions:
- \li boost::geometry::index::to_nearest() - default,
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest() - default,
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
It is possible to define define distances bounds, for example that some distance must be between
min_distance and max_distance. This is done by passing DistancesPredicates which can be generated
by following functions:
- \li boost::geometry::index::unbounded() - default,
- \li boost::geometry::index::min_bounded(),
- \li boost::geometry::index::max_bounded(),
- \li boost::geometry::index::bounded().
+ \li \c boost::geometry::index::unbounded() - default,
+ \li \c boost::geometry::index::min_bounded(),
+ \li \c boost::geometry::index::max_bounded(),
+ \li \c boost::geometry::index::bounded().
MinRelation and MaxRelation describes bounds and can be generated by following functions:
- \li boost::geometry::index::to_nearest(),
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest(),
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
\param dpred The distances predicates or a Point.
\param k The max number of values.
@@ -768,22 +767,22 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation.
It can be generated by following functions:
- \li boost::geometry::index::to_nearest() - default,
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest() - default,
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
It is possible to define define distances bounds, for example that some distance must be between
min_distance and max_distance. This is done by passing DistancesPredicates which can be generated
by following functions:
- \li boost::geometry::index::unbounded() - default,
- \li boost::geometry::index::min_bounded(),
- \li boost::geometry::index::max_bounded(),
- \li boost::geometry::index::bounded().
+ \li \c boost::geometry::index::unbounded() - default,
+ \li \c boost::geometry::index::min_bounded(),
+ \li \c boost::geometry::index::max_bounded(),
+ \li \c boost::geometry::index::bounded().
MinRelation and MaxRelation describes bounds and can be generated by following functions:
- \li boost::geometry::index::to_nearest(),
- \li boost::geometry::index::to_centroid(),
- \li boost::geometry::index::to_furthest().
+ \li \c boost::geometry::index::to_nearest(),
+ \li \c boost::geometry::index::to_centroid(),
+ \li \c boost::geometry::index::to_furthest().
<b>Spatial predicates</b> may be a \c Geometry. In this case Values intersecting the \c Geometry are returned.
@@ -1230,6 +1229,8 @@
/*!
\brief Insert a value to the index.
+It calls <tt>rtree::insert(value_type const&)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1244,6 +1245,8 @@
/*!
\brief Insert a range of values to the index.
+It calls <tt>rtree::insert(Iterator, Iterator)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1259,6 +1262,8 @@
/*!
\brief Insert a range of values to the index.
+It calls <tt>rtree::insert(Range const&)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1276,6 +1281,8 @@
Remove a value from the container. In contrast to the \c std::set or <tt>std::map erase()</tt> method
this function removes only one value from the container.
+It calls <tt>rtree::remove(value_type const&)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1298,6 +1305,8 @@
to these passed as a range. Furthermore this function removes only one value for each one passed
in the range, not all equal values.
+It calls <tt>rtree::remove(Iterator, Iterator)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1320,6 +1329,8 @@
it removes values equal to these passed as a range. Furthermore this method removes only
one value for each one passed in the range, not all equal values.
+It calls <tt>rtree::remove(Range const&)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1337,6 +1348,8 @@
/*!
\brief Find values meeting spatial predicates.
+It calls \c rtree::spatial_query with parameters <tt>(Predicates const&, OutIter)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1354,6 +1367,8 @@
/*!
\brief Find the value meeting distances predicates.
+It calls \c rtree::nearest_query with parameters <tt>(DistancesPredicates const& dpred, value_type & v)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1371,6 +1386,8 @@
/*!
\brief Find the value meeting distances and spatial predicates.
+It calls \c rtree::nearest_query with parameters <tt>(DistancesPredicates const& dpred, Predicates const& pred, value_type & v)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1389,6 +1406,8 @@
/*!
\brief Find k values meeting distances predicates.
+It calls \c rtree::nearest_query with parameters <tt>(DistancesPredicates const & dpred, size_type k, OutIter out_it)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1407,6 +1426,8 @@
/*!
\brief Find k values meeting distances and spatial predicates.
+It calls \c rtree::nearest_query with parameters <tt>(DistancesPredicates const & dpred, size_type k, Predicates const & pred, OutIter out_it)</tt>.
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1426,6 +1447,8 @@
/*!
\brief Remove all values from the index.
+It calls \c rtree::clear().
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1439,6 +1462,8 @@
/*!
\brief Get the number of values stored in the index.
+It calls \c rtree::size().
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1454,6 +1479,8 @@
/*!
\brief Query if there are no values stored in the index.
+It calls \c rtree::empty().
+
\ingroup rtree_functions
\param tree The spatial index.
@@ -1469,6 +1496,8 @@
/*!
\brief Get the box containing all stored values or an invalid box if the index has no values.
+It calls \c rtree::box().
+
\ingroup rtree_functions
\param tree The spatial index.
Modified: sandbox-branches/geometry/index/doc/generated/rtree.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/rtree.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/rtree.qbk 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
@@ -7,7 +7,7 @@
The R-tree spatial index.
[heading Description]
-The R-tree spatial index. This is self-balancing spatial index capable to store various types of Values and balancing algorithms.
+This is self-balancing spatial index capable to store various types of Values and balancing algorithms.
[heading Parameters]
The user must pass a type defining the Parameters which will be used in rtree creation process. This type is used e.g. to specify balancing algorithm with specific parameters like min and max number of elements in node.
@@ -628,24 +628,24 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()] - default,
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]] - default,
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
It is possible to define define distances bounds, for example that some distance must be between min_distance and max_distance. This is done by passing DistancesPredicates which can be generated by following functions:
-* [link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()] - default,
-* [link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()],
-* [link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()],
-* [link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()].
+* [^[link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()]] - default,
+* [^[link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()]],
+* [^[link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()]],
+* [^[link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()]].
MinRelation and MaxRelation describes bounds and can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()],
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]],
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
[heading Synopsis]
[pre
@@ -675,24 +675,24 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()] - default,
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]] - default,
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
It is possible to define define distances bounds, for example that some distance must be between min_distance and max_distance. This is done by passing DistancesPredicates which can be generated by following functions:
-* [link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()] - default,
-* [link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()],
-* [link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()],
-* [link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()].
+* [^[link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()]] - default,
+* [^[link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()]],
+* [^[link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()]],
+* [^[link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()]].
MinRelation and MaxRelation describes bounds and can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()],
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]],
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
[*Spatial predicates] may be a [^Geometry]. In this case Values intersecting the [^Geometry] are returned.
@@ -742,24 +742,24 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()] - default,
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]] - default,
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
It is possible to define define distances bounds, for example that some distance must be between min_distance and max_distance. This is done by passing DistancesPredicates which can be generated by following functions:
-* [link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()] - default,
-* [link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()],
-* [link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()],
-* [link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()].
+* [^[link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()]] - default,
+* [^[link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()]],
+* [^[link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()]],
+* [^[link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()]].
MinRelation and MaxRelation describes bounds and can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()],
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]],
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
[heading Synopsis]
[pre
@@ -792,24 +792,24 @@
It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()] - default,
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]] - default,
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
It is possible to define define distances bounds, for example that some distance must be between min_distance and max_distance. This is done by passing DistancesPredicates which can be generated by following functions:
-* [link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()] - default,
-* [link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()],
-* [link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()],
-* [link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()].
+* [^[link group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db boost::geometry::index::unbounded()]] - default,
+* [^[link group__distance__predicates_1ga39c7c94776ab840e164848e53d376098 boost::geometry::index::min_bounded()]],
+* [^[link group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079 boost::geometry::index::max_bounded()]],
+* [^[link group__distance__predicates_1ga20621ca608b1420c38182346b965f347 boost::geometry::index::bounded()]].
MinRelation and MaxRelation describes bounds and can be generated by following functions:
-* [link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()],
-* [link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()],
-* [link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()].
+* [^[link group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636 boost::geometry::index::to_nearest()]],
+* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
+* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].
[*Spatial predicates] may be a [^Geometry]. In this case Values intersecting the [^Geometry] are returned.
Modified: sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
@@ -24,7 +24,8 @@
[section insert(rtree<...> &, Value const &)]
Insert a value to the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1af6d5bd81e46cb4ff89277c753133664c rtree::insert(value_type const&)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -45,7 +46,8 @@
[section insert(rtree<...> &, Iterator, Iterator)]
Insert a range of values to the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a5263a3faac7b4f0090d4ad1d44cc540d rtree::insert(Iterator, Iterator)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -70,7 +72,8 @@
[section insert(rtree<...> &, Range const &)]
Insert a range of values to the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1abb624abd9268b41e815d40342b2634c2 rtree::insert(Range const&)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -93,7 +96,9 @@
Remove a value from the container.
[heading Description]
-Remove a value from the container. In contrast to the [^std::set] or [^std::map erase()] method this function removes only one value from the container.[heading Synopsis]
+Remove a value from the container. In contrast to the [^std::set] or [^std::map erase()] method this function removes only one value from the container.
+
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1af6ca6909354a997f89411ef40ea5688a rtree::remove(value_type const&)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -117,7 +122,9 @@
Remove a range of values from the container.
[heading Description]
-Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this function removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
+Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this function removes only one value for each one passed in the range, not all equal values.
+
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a6e9123114697d65b16ebc49cd5371fbd rtree::remove(Iterator, Iterator)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -145,7 +152,9 @@
Remove a range of values from the container.
[heading Description]
-Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
+Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.
+
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a5a57bb93b0b2d7ea1c659e925f918e9c rtree::remove(Range const&)]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -169,7 +178,8 @@
[section spatial_query(rtree<...> const &, Predicates const &, OutIter)]
Find values meeting spatial predicates.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a930bf17d595a91d8ae924383a0387920 rtree::spatial_query]] with parameters [^(Predicates const&, OutIter)].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -197,7 +207,8 @@
[section nearest_query(rtree<...> const &, DistancesPredicates const &, Value &)]
Find the value meeting distances predicates.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const& dpred, value_type & v)].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -224,7 +235,8 @@
[section nearest_query(rtree<...> const &, DistancesPredicates const &, Predicates const &, Value &)]
Find the value meeting distances and spatial predicates.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const& dpred, Predicates const& pred, value_type & v)].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -254,7 +266,8 @@
[section nearest_query(rtree<...> const &, DistancesPredicates const &, typename rtree<...>::size_type, OutIter)]
Find k values meeting distances predicates.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const & dpred, size_type k, OutIter out_it)].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -284,7 +297,8 @@
[section nearest_query(rtree<...> const &, DistancesPredicates const &, typename rtree<...>::size_type, Predicates const &, OutIter)]
Find k values meeting distances and spatial predicates.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const & dpred, size_type k, Predicates const & pred, OutIter out_it)].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -317,7 +331,8 @@
[section clear(rtree<...> &)]
Remove all values from the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1ae6027e42d28a4bf93e74b055c79e6b09 rtree::clear()]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -337,7 +352,8 @@
[section size(rtree<...> const &)]
Get the number of values stored in the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a89561a834563f2ed6fc782bad16143fd rtree::size()]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -359,7 +375,8 @@
[section empty(rtree<...> const &)]
Query if there are no values stored in the index.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1ae889567443b0ba0dbdb975564c55804c rtree::empty()]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
@@ -381,7 +398,8 @@
[section box(rtree<...> const &)]
Get the box containing all stored values or an invalid box if the index has no values.
-[heading Synopsis]
+[heading Description]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1adf62005332a5fa9119ff03185e0c5143 rtree::box()]].[heading Synopsis]
[pre
`template<``typename Value``,`
`typename Options``,`
Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
@@ -47,7 +47,7 @@
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree"></a><a name="classboost_1_1geometry_1_1index_1_1rtree"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree" title="boost::geometry::index::rtree">boost::geometry::index::rtree</a>
</h4></div></div></div>
<p>
- <a class="indexterm" name="id879836"></a><a class="indexterm" name="id879841"></a><a class="indexterm" name="id879846"></a><a class="indexterm" name="id879851"></a>
+ <a class="indexterm" name="id947557"></a><a class="indexterm" name="id947562"></a><a class="indexterm" name="id947567"></a><a class="indexterm" name="id947571"></a>
The R-tree spatial index.
</p>
<h6>
@@ -55,8 +55,8 @@
<span class="phrase"><a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.description">Description</a>
</h6>
<p>
- The R-tree spatial index. This is self-balancing spatial index capable
- to store various types of Values and balancing algorithms.
+ This is self-balancing spatial index capable to store various types of
+ Values and balancing algorithms.
</p>
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.h1"></a>
@@ -2552,14 +2552,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -2569,17 +2569,17 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a></code>.
</li>
</ul></div>
<p>
@@ -2588,13 +2588,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<h6>
@@ -2708,14 +2708,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -2725,17 +2725,17 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a></code>.
</li>
</ul></div>
<p>
@@ -2744,13 +2744,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -2931,14 +2931,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -2948,17 +2948,17 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a></code>.
</li>
</ul></div>
<p>
@@ -2967,13 +2967,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<h6>
@@ -3106,14 +3106,14 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -3123,17 +3123,17 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a>
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga1b0f969b575a94ca710b9345861f64db">boost::geometry::index::unbounded()</a></code>
- default,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga39c7c94776ab840e164848e53d376098">boost::geometry::index::min_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga843735643378288b0e14e19cc9b4e079">boost::geometry::index::max_bounded()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga20621ca608b1420c38182346b965f347">boost::geometry::index::bounded()</a></code>.
</li>
</ul></div>
<p>
@@ -3142,13 +3142,13 @@
</p>
<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a>,
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0">boost::geometry::index::to_centroid()</a></code>,
</li>
<li class="listitem">
- <a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a>.
+ <code class="literal"><a class="link" href="reference.html#group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02">boost::geometry::index::to_furthest()</a></code>.
</li>
</ul></div>
<p>
@@ -3860,6 +3860,14 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af6d5bd81e46cb4ff89277c753133664c">rtree::insert(value_type
+ const&)</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -3869,7 +3877,7 @@
<code class="computeroutput"><span class="keyword">void</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">insert</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">,</span></code> <code class="computeroutput"><span class="identifier">Value</span> <span
class="keyword">const</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">v</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -3949,6 +3957,14 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5263a3faac7b4f0090d4ad1d44cc540d">rtree::insert(Iterator,
+ Iterator)</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -3961,7 +3977,7 @@
<code class="computeroutput"><span class="identifier">Iterator</span></code> <code class="computeroutput"><span class="identifier">last</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4057,6 +4073,14 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1abb624abd9268b41e815d40342b2634c2">rtree::insert(Range
+ const&)</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -4067,7 +4091,7 @@
<code class="computeroutput"><span class="keyword">void</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">insert</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">,</span></code> <code class="computeroutput"><span class="identifier">Range</span> <span
class="keyword">const</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">rng</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4154,6 +4178,10 @@
or <code class="literal">std::map erase()</code> method this function removes only
one value from the container.
</p>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af6ca6909354a997f89411ef40ea5688a">rtree::remove(value_type
+ const&)</a></code>.
+ </p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis">Synopsis</a>
@@ -4261,6 +4289,10 @@
to these passed as a range. Furthermore this function removes only one
value for each one passed in the range, not all equal values.
</p>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a6e9123114697d65b16ebc49cd5371fbd">rtree::remove(Iterator,
+ Iterator)</a></code>.
+ </p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis">Synopsis</a>
@@ -4386,6 +4418,10 @@
to these passed as a range. Furthermore this method removes only one
value for each one passed in the range, not all equal values.
</p>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5a57bb93b0b2d7ea1c659e925f918e9c">rtree::remove(Range
+ const&)</a></code>.
+ </p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis">Synopsis</a>
@@ -4485,6 +4521,14 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a930bf17d595a91d8ae924383a0387920">rtree::spatial_query</a></code>
+ with parameters <code class="literal">(Predicates const&, OutIter)</code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -4498,7 +4542,7 @@
<code class="computeroutput"><span class="identifier">OutIter</span></code> <code class="computeroutput"><span class="identifier">out_it</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4584,7 +4628,7 @@
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.returns">Returns</a>
</h6>
<p>
@@ -4601,6 +4645,15 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
+ with parameters <code class="literal">(DistancesPredicates const& dpred, value_type
+ & v)</code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -4613,7 +4666,7 @@
<code class="computeroutput"><span class="identifier">Value</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">v</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4700,7 +4753,7 @@
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.returns">Returns</a>
</h6>
<p>
@@ -4718,6 +4771,15 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
+ with parameters <code class="literal">(DistancesPredicates const& dpred, Predicates
+ const& pred, value_type & v)</code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -4732,7 +4794,7 @@
<code class="computeroutput"><span class="identifier">Value</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">v</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4836,7 +4898,7 @@
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.returns">Returns</a>
</h6>
<p>
@@ -4854,6 +4916,15 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
+ with parameters <code class="literal">(DistancesPredicates const & dpred, size_type
+ k, OutIter out_it)</code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -4868,7 +4939,7 @@
<code class="computeroutput"><span class="identifier">OutIter</span></code> <code class="computeroutput"><span class="identifier">out_it</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -4973,7 +5044,7 @@
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.returns">Returns</a>
</h6>
<p>
@@ -4991,6 +5062,15 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
+ with parameters <code class="literal">(DistancesPredicates const & dpred, size_type
+ k, Predicates const & pred, OutIter out_it)</code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -5007,7 +5087,7 @@
<code class="computeroutput"><span class="identifier">OutIter</span></code> <code class="computeroutput"><span class="identifier">out_it</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -5129,7 +5209,7 @@
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.returns">Returns</a>
</h6>
<p>
@@ -5146,6 +5226,13 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1ae6027e42d28a4bf93e74b055c79e6b09">rtree::clear()</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -5155,7 +5242,7 @@
<code class="computeroutput"><span class="keyword">void</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">clear</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -5215,6 +5302,13 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a89561a834563f2ed6fc782bad16143fd">rtree::size()</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -5224,7 +5318,7 @@
<code class="computeroutput"><span class="identifier">size_t</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">size</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="keyword">const</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -5274,7 +5368,7 @@
</tr></tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns">Returns</a>
</h6>
<p>
@@ -5291,6 +5385,13 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1ae889567443b0ba0dbdb975564c55804c">rtree::empty()</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -5300,7 +5401,7 @@
<code class="computeroutput"><span class="keyword">bool</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">empty</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="keyword">const</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -5350,7 +5451,7 @@
</tr></tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns">Returns</a>
</h6>
<p>
@@ -5368,6 +5469,13 @@
</p>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h0"></a>
+ <span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.description"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.description">Description</a>
+ </h6>
+<p>
+ It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1adf62005332a5fa9119ff03185e0c5143">rtree::box()</a></code>.
+ </p>
+<h6>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h1"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.synopsis"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.synopsis">Synopsis</a>
</h6>
<pre class="programlisting"><code class="computeroutput"><span class="keyword">template</span><span class="special"><</span></code><code class="computeroutput"><span class="keyword">typename</span> <span class="identifier">Value</span></code><code class="computeroutput"><span class="special">,</span></code>
@@ -5377,7 +5485,7 @@
<code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span><span class="special">,</span> <span class="identifier">Allocator</span><span class="special">>::</span><span class="identifier">box_type</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">geometry</span><span class="special">::</span><span class="identifier">index</span><span class="special">::</span><span class="identifier">box</span></code><code class="computeroutput"><span class="special">(</span></code><code class="computeroutput"><span class="identifier">rtree</span><span class="special"><</span> <span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Options</span><span class="special">,</span> <span class="identifier">Translator</span>
<span class="special">,</span> <span class="identifier">Allocator</span> <span class="special">></span> <span class="keyword">const</span> <span class="special">&</span></code> <code class="computeroutput"><span class="identifier">tree</span></code><code class="computeroutput"><span class="special">)</span></code>
</pre>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h1"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h2"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.parameter_s_"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.parameter_s_">Parameter(s)</a>
</h6>
<div class="informaltable"><table class="table">
@@ -5427,7 +5535,7 @@
</tr></tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h2"></a>
+<a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.h3"></a>
<span class="phrase"><a name="geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.returns"></a></span><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.box_rtree______const___.returns">Returns</a>
</h6>
<p>
@@ -5445,7 +5553,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_linear"></a><a name="structboost_1_1geometry_1_1index_1_1linear"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_linear" title="boost::geometry::index::linear">boost::geometry::index::linear</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id914250"></a><a class="indexterm" name="id914255"></a><a class="indexterm" name="id914259"></a><a class="indexterm" name="id914264"></a>
+ <a class="indexterm" name="id982479"></a><a class="indexterm" name="id982484"></a><a class="indexterm" name="id982489"></a><a class="indexterm" name="id982493"></a>
Linear r-tree creation algorithm parameters.
</p>
<h6>
@@ -5520,7 +5628,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_quadratic"></a><a name="structboost_1_1geometry_1_1index_1_1quadratic"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_quadratic" title="boost::geometry::index::quadratic">boost::geometry::index::quadratic</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id914573"></a><a class="indexterm" name="id914577"></a><a class="indexterm" name="id914582"></a><a class="indexterm" name="id914587"></a>
+ <a class="indexterm" name="id982802"></a><a class="indexterm" name="id982807"></a><a class="indexterm" name="id982811"></a><a class="indexterm" name="id982816"></a>
Quadratic r-tree creation algorithm parameters.
</p>
<h6>
@@ -5595,7 +5703,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_rstar"></a><a name="structboost_1_1geometry_1_1index_1_1rstar"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_rstar" title="boost::geometry::index::rstar">boost::geometry::index::rstar</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id914895"></a><a class="indexterm" name="id914900"></a><a class="indexterm" name="id914905"></a><a class="indexterm" name="id914910"></a>
+ <a class="indexterm" name="id983125"></a><a class="indexterm" name="id983129"></a><a class="indexterm" name="id983134"></a><a class="indexterm" name="id983139"></a>
R*-tree creation algorithm parameters.
</p>
<h6>
@@ -5699,7 +5807,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_linear"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1linear"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_linear" title="boost::geometry::index::runtime::linear">boost::geometry::index::runtime::linear</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id915344"></a><a class="indexterm" name="id915349"></a><a class="indexterm" name="id915354"></a><a class="indexterm" name="id915359"></a><a class="indexterm" name="id915363"></a>
+ <a class="indexterm" name="id983573"></a><a class="indexterm" name="id983578"></a><a class="indexterm" name="id983583"></a><a class="indexterm" name="id983588"></a><a class="indexterm" name="id983593"></a>
Linear r-tree creation algorithm parameters.
</p>
<h6>
@@ -5835,7 +5943,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_quadratic"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1quadratic"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_quadratic" title="boost::geometry::index::runtime::quadratic">boost::geometry::index::runtime::quadratic</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id915836"></a><a class="indexterm" name="id915841"></a><a class="indexterm" name="id915846"></a><a class="indexterm" name="id915851"></a><a class="indexterm" name="id915855"></a>
+ <a class="indexterm" name="id984271"></a><a class="indexterm" name="id984276"></a><a class="indexterm" name="id984280"></a><a class="indexterm" name="id984285"></a><a class="indexterm" name="id984290"></a>
Quadratic r-tree creation algorithm parameters.
</p>
<h6>
@@ -5971,7 +6079,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_rstar"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1rstar"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_rstar" title="boost::geometry::index::runtime::rstar">boost::geometry::index::runtime::rstar</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id916602"></a><a class="indexterm" name="id916607"></a><a class="indexterm" name="id916611"></a><a class="indexterm" name="id916616"></a><a class="indexterm" name="id916621"></a>
+ <a class="indexterm" name="id984763"></a><a class="indexterm" name="id984768"></a><a class="indexterm" name="id984772"></a><a class="indexterm" name="id984777"></a><a class="indexterm" name="id984782"></a>
R*-tree creation algorithm parameters.
</p>
<h6>
@@ -7764,7 +7872,7 @@
<a name="geometry_index.r_tree.reference.translators.boost_geometry_index_translator_def"></a><a name="structboost_1_1geometry_1_1index_1_1translator_1_1def"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.translators.boost_geometry_index_translator_def" title="boost::geometry::index::translator::def">boost::geometry::index::translator::def</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id927722"></a><a class="indexterm" name="id927727"></a><a class="indexterm" name="id927732"></a><a class="indexterm" name="id927736"></a><a class="indexterm" name="id927741"></a>
+ <a class="indexterm" name="id995883"></a><a class="indexterm" name="id995887"></a><a class="indexterm" name="id995892"></a><a class="indexterm" name="id995897"></a><a class="indexterm" name="id995902"></a>
The default translator.
</p>
<h6>
@@ -7834,7 +7942,7 @@
<a name="geometry_index.r_tree.reference.translators.boost_geometry_index_translator_index"></a><a name="classboost_1_1geometry_1_1index_1_1translator_1_1index"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.translators.boost_geometry_index_translator_index" title="boost::geometry::index::translator::index">boost::geometry::index::translator::index</a>
</h5></div></div></div>
<p>
- <a class="indexterm" name="id928012"></a><a class="indexterm" name="id928017"></a><a class="indexterm" name="id928022"></a><a class="indexterm" name="id928027"></a><a class="indexterm" name="id928032"></a>
+ <a class="indexterm" name="id996173"></a><a class="indexterm" name="id996178"></a><a class="indexterm" name="id996183"></a><a class="indexterm" name="id996187"></a><a class="indexterm" name="id996192"></a>
The index translator.
</p>
<h6>
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 2013-01-13 15:02:19 EST (Sun, 13 Jan 2013)
@@ -56,7 +56,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left"><p><small>Last revised: January 13, 2013 at 15:29:29 GMT</small></p></td>
+<td align="left"><p><small>Last revised: January 13, 2013 at 20:01:19 GMT</small></p></td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>
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