Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r82387 - in sandbox-branches/geometry/index: boost/geometry/extensions/index/rtree doc/html doc/html/geometry_index doc/html/geometry_index/r_tree
From: adam.wulkiewicz_at_[hidden]
Date: 2013-01-07 16:08:49

Next message: oliver.kowalke_at_[hidden]: "[Boost-commit] svn:boost r82388 - in trunk/libs/context: build src"
Previous message: adam.wulkiewicz_at_[hidden]: "[Boost-commit] svn:boost r82386 - sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree"

Author: awulkiew
Date: 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
New Revision: 82387
URL: http://svn.boost.org/trac/boost/changeset/82387

Log:
R-tree docs improved.
Text files modified:
   sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree/rtree.hpp | 68 ++-
   sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html | 2
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html | 2
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/creation_and_modification.html | 10
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/exception_safety.html | 16
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/index.html | 664 ++++++++++-----------------------------
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html | 20
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html | 2
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html | 4
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html | 2
   sandbox-branches/geometry/index/doc/html/index.html | 4
   11 files changed, 251 insertions(+), 543 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-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -58,20 +58,29 @@
The R-tree spatial index. This is self-balancing spatial index capable to store various types
of Values and balancing algorithms.

+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.
+Predefined algorithms with compile-time parameters are:
+bgi::linear<MinElements, MaxElements>,
+bgi::quadratic<MinElements, MaxElements>,
+bgi::rstar<MinElements, MaxElements, OverlapCostThreshold = 0, ReinsertedElements = MaxElements * 0.3>.
+Predefined algorithms with run-time parameters are:
+bgi::runtime::linear,
+bgi::runtime::quadratic,
+bgi::runtime::rstar.
+
+The Translator translates from Value to Indexable each time r-tree requires it. Which means that this
+operation is done for each Value access. Therefore the Translator should return the Indexable by
+const reference instead of a value. Default translator can translate all types adapted to Point
+or Box concepts (which are Indexables). It also handles std::pair<Indexable, T>, pointers, smart pointers,
+and iterators. E.g. If std::pair<Box, int> is stored, the default translator translates from
+std::pair<Box, int> const& to Box const&.
+
\tparam Value The type of objects stored in the container.
-\tparam Parameters Compile-time 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 compile-time parameters like min and max number of elements in node.
- Predefined Algorithms/Parameters are:
- bgi::linear<MinElements, MaxElements>,
- bgi::quadratic<MinElements, MaxElements>,
- bgi::rstar<MinElements, MaxElements, OverlapCostThreshold = 0, ReinsertedElements = MaxElements * 0.3>.
-\tparam Translator The type of the translator which translates from Value to Indexable. This translation is done each time
- the r-tree wants to know Value's Indexable. Default translator can translate all types adapted to Point
- or Box concepts (which are Indexables). It also handles std::pair<Indexable, T>, pointers, smart pointers,
- and iterators. E.g. If std::pair<Box, int> is stored, the default translator translates from
- std::pair<Box, int> const& to Box const&.
-\tparam Allocator The allocator.
+\tparam Parameters Compile-time parameters.
+\tparam Translator The type of the translator which translates from Value to Indexable.
+\tparam Allocator The allocator used to allocate/deallocate memory, construct/destroy nodes and Values.
*/
template <
 typename Value,
@@ -84,13 +93,20 @@
 BOOST_COPYABLE_AND_MOVABLE(rtree)

public:
+ /*! \brief The type of Value stored in the container. */
 typedef Value value_type;
+ /*! \brief R-tree parameters type. */
 typedef Parameters parameters_type;
+ /*! \brief Value to Indexable Translator type. */
 typedef Translator translator_type;
+ /*! \brief The type of allocator used by the container. */
 typedef Allocator allocator_type;
+ /*! \brief Unsigned integral type used by the container. */
 typedef typename allocator_type::size_type size_type;

+ /*! \brief The Indexable type to which Value is translated. */
 typedef typename translator::indexable_type<Translator>::type indexable_type;
+ /*! \brief The Box type used by the R-tree. */
 typedef typename index::default_box_type<indexable_type>::type box_type;

#if !defined(BOOST_GEOMETRY_INDEX_ENABLE_DEBUG_INTERFACE)
@@ -170,10 +186,10 @@
 \param allocator The allocator object.
 */
 template<typename Range>
- inline rtree(Range const& rng,
- parameters_type parameters = parameters_type(),
- translator_type const& translator = translator_type(),
- allocator_type allocator = allocator_type())
+ inline explicit rtree(Range const& rng,
+ parameters_type parameters = parameters_type(),
+ translator_type const& translator = translator_type(),
+ allocator_type allocator = allocator_type())
 : m_translator(translator) // SHOULDN'T THROW
 , m_parameters(parameters)
 , m_allocators(allocator)
@@ -696,6 +712,8 @@

 /*!
 \brief Returns the box containing all values stored in the container.
+
+ Returns the box containing all values stored in the container.
 If the container is empty the result of geometry::assign_inverse() is returned.

 \exception nothrow (if Indexable's CoordinateType copy assignment doesn't throw),
@@ -722,7 +740,9 @@
 }

 /*!
- \brief For indexable_type it returns the number of values which indexables equals the parameter.
+ \brief Count Values or Indexables stored in the container.
+
+ For indexable_type it returns the number of values which indexables equals the parameter.
 For value_type it returns the number of values which equals the parameter.

 \exception nothrow.
@@ -1085,7 +1105,9 @@
}

/*!
-\brief Remove a value from the container. In contrast to the STL set/map erase() method
+\brief Remove a value from the container.
+
+Remove a value from the container. In contrast to the STL set/map erase() method
this function removes only one value from the container.

\param tree The spatial index.
@@ -1101,7 +1123,9 @@
}

/*!
-\brief Remove a range of values from the container. In contrast to the STL set/map erase() method
+\brief Remove a range of values from the container.
+
+Remove a range of values from the container. In contrast to the STL set/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.
@@ -1120,7 +1144,9 @@
}

/*!
-\brief Remove a range of values from the container. In contrast to the STL set/map erase() method
+\brief Remove a range of values from the container.
+
+Remove a range of values from the container. In contrast to the STL set/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.

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="prev" href="../index.html" title="Chapter 1. Geometry Index">

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>R-tree</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../index.html" title="Chapter 1. Geometry Index">
<link rel="prev" href="introduction.html" title="Introduction">

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/creation_and_modification.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/creation_and_modification.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/creation_and_modification.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Creation and modification</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="rtree_quickstart.html" title="Quick Start">
@@ -55,7 +55,7 @@
 
<pre class="programlisting">rtree<Value, Parameters, Translator = translator::def<Value>, Allocator> = std::allocator<Value> >
</pre>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Value</code> - type of object which will be stored in the container,
 </li>
@@ -90,7 +90,7 @@
 be handled by the default <code class="computeroutput">Translator</code> - <code class="computeroutput">index::translator::def<Value></code>
 are defined as follows:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="computeroutput">Indexable = Point
 | Box</code>
@@ -116,7 +116,7 @@
 A <code class="computeroutput">Translator</code> is a type which knows how to handle <code class="computeroutput">Value</code>s.
 It has two purposes:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 it translates <code class="computeroutput">Value</code> to a more suitable <code class="computeroutput">Indexable</code>
 type which is needed by most of operations,
@@ -134,7 +134,7 @@

 If comparison of two <code class="computeroutput">Value</code>s is required, the default translator:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 for <code class="computeroutput">Point</code>
 and <code class="computeroutput">Box</code>

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/exception_safety.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/exception_safety.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/exception_safety.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Exception safety</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="nearest_neighbours_queries.html" title="Nearest neighbours queries">
@@ -29,7 +29,7 @@

 In order to be exception-safe the R-tree requires:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 exception-safe copy constructor and copy assignment of the <code class="computeroutput">Value</code>.
 </li>
@@ -155,7 +155,7 @@
<td>
 
 nothrow or strong
- [<a name="geometry_index.r_tree.exception_safety.f0" href="#ftn.geometry_index.r_tree.exception_safety.f0" class="footnote">a</a>]
+ [a]</a>
 
 </td>
</tr>
@@ -185,7 +185,7 @@
 </td>
<td>
 
- not safe [<a name="geometry_index.r_tree.exception_safety.f1" href="#ftn.geometry_index.r_tree.exception_safety.f1" class="footnote">b</a>]
+ not safe [b]</a>
 
 </td>
</tr>
@@ -344,7 +344,7 @@
<td>
 
 nothrow or strong
- [<a name="geometry_index.r_tree.exception_safety.f2" href="#ftn.geometry_index.r_tree.exception_safety.f2" class="footnote">c</a>]
+ [c]</a>
 
 </td>
</tr>
@@ -392,15 +392,15 @@
</tr>
</tbody>
<tbody class="footnotes"><tr><td colspan="2">
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.exception_safety.f0" href="#geometry_index.r_tree.exception_safety.f0" class="para">a</a>] 
+<div id="ftn.geometry_index.r_tree.exception_safety.f0" class="footnote">^[a]
 nothrow - if allocators are equal, strong - otherwise
 </div>
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.exception_safety.f1" href="#geometry_index.r_tree.exception_safety.f1" class="para">b</a>] 
+<div id="ftn.geometry_index.r_tree.exception_safety.f1" class="footnote">^[b]
 If this operation throws, the R-tree may be left in an inconsistent
 state, elements must not be inserted or removed, methods may
 return invalid data.
 </div>
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.exception_safety.f2" href="#geometry_index.r_tree.exception_safety.f2" class="para">c</a>] 
+<div id="ftn.geometry_index.r_tree.exception_safety.f2" class="footnote">^[c]
 nothrow - if <code class="computeroutput">CoordinateType</code>
 has nonthrowing copy constructor, strong
 - otherwise

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/index.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/index.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/index.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Reference</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="exception_safety.html" title="Exception safety">
@@ -31,28 +31,48 @@
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree" title="boost::geometry::index::rtree">boost::geometry::index::rtree</a>
</h4></div></div></div>

- <a class="indexterm" name="idp9942920"></a><a class="indexterm" name="idp9943232"></a><a class="indexterm" name="idp9943544"></a><a class="indexterm" name="idp9943856"></a>
+ <a class="indexterm" name="id853103"></a><a class="indexterm" name="id853107"></a><a class="indexterm" name="id853112"></a><a class="indexterm" name="id853117"></a>
The R-tree spatial index.
 
<h6>
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h0"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.description"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.description">Description</a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.description"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.description">Description</a>
 </h6>

 The R-tree spatial index. This is self-balancing spatial index capable
 to store various types of Values and balancing algorithms.
 
+
+ 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. Predefined
+ algorithms with compile-time parameters are: bgi::linear<MinElements,
+ MaxElements>, bgi::quadratic<MinElements, MaxElements>, bgi::rstar<MinElements,
+ MaxElements, OverlapCostThreshold = 0, ReinsertedElements = MaxElements
+ * 0.3>. Predefined algorithms with run-time parameters are: bgi::runtime::linear,
+ bgi::runtime::quadratic, bgi::runtime::rstar.
+ 
+
+ The Translator translates from Value to Indexable each time r-tree requires
+ it. Which means that this operation is done for each Value access. Therefore
+ the Translator should return the Indexable by const reference instead of
+ a value. Default translator can translate all types adapted to Point or
+ Box concepts (which are Indexables). It also handles std::pair<Indexable,
+ T>, pointers, smart pointers, and iterators. E.g. If std::pair<Box,
+ int> is stored, the default translator translates from std::pair<Box,
+ int> const& to Box const&.
+ 
<h6>
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h1"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.synopsis"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.synopsis"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.synopsis">Synopsis</a>
 </h6>


<pre class="programlisting">template<typename Value,
 typename Parameters,
- typename Translator,
- typename Allocator>
-class boost::geometry::index::rtree
+ typename Translator = translator::def<Value>,
+ typename Allocator = std::allocator<Value>>
+class rtree
{
 // ...
};
@@ -61,14 +81,13 @@
 
<h6>
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h2"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.template_parameter_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.template_parameter_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
-<col>
</colgroup>
<thead><tr>
<th>
@@ -78,11 +97,6 @@
 </th>
<th>
 
- Default
- 
- </th>
-<th>
- 
 Description
 
 </th>
@@ -91,14 +105,10 @@
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Value</pre>
-
+ <code class="computeroutput">Value</code>
 
 </td>
<td>
- </td>
-<td>
 
 The type of objects stored in the container.
 
@@ -107,72 +117,37 @@
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Parameters</pre>
-
+ <code class="computeroutput">Parameters</code>
 
 </td>
<td>
- </td>
-<td>
 
- Compile-time 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 compile-time
- parameters like min and max number of elements in node. Predefined
- Algorithms/Parameters are: bgi::linear<MinElements, MaxElements>,
- bgi::quadratic<MinElements, MaxElements>, bgi::rstar<MinElements,
- MaxElements, OverlapCostThreshold = 0, ReinsertedElements = MaxElements
- * 0.3>.
+ Compile-time parameters.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Translator</pre>
-
- 
- </td>
-<td>
- 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">translator::def<Value></pre>
-
+ <code class="computeroutput">Translator</code>
 
 </td>
<td>
 
 The type of the translator which translates from Value to Indexable.
- This translation is done each time the r-tree wants to know Value's
- Indexable. Default translator can translate all types adapted
- to Point or Box concepts (which are Indexables). It also handles
- std::pair<Indexable, T>, pointers, smart pointers, and
- iterators. E.g. If std::pair<Box, int> is stored, the default
- translator translates from std::pair<Box, int> const&
- to Box const&.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">Allocator</pre>
-
+ <code class="computeroutput">Allocator</code>
 
 </td>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">std::allocator<Value></pre>
-
- 
- </td>
-<td>
- 
- The allocator.
+ The allocator used to allocate/deallocate memory, construct/destroy
+ nodes and Values.
 
 </td>
</tr>
@@ -180,18 +155,17 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h3"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.constructor_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.constructor_s_">Constructor(s)</a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.typedef_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.typedef_s_">Typedef(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
-<col>
</colgroup>
<thead><tr>
<th>
 
- Function
+ Type
 
 </th>
<th>
@@ -199,182 +173,89 @@
 Description
 
 </th>
-<th>
- 
- Parameters
- 
- </th>
</tr></thead>
<tbody>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree(parameters_type parameters = parameters_type(),
- translator_type const & translator = translator_type(),
- allocator_type allocator = allocator_type())</pre>
-
- 
- </td>
-<td>
- 
- The constructor.
+ <code class="computeroutput">value_type</code>
 
 </td>
<td>
 
- parameters_type: parameters:
- The parameters object.
- 
- 
- translator_type const &:
- translator: The translator object.
- 
- 
- allocator_type: allocator:
- The allocator object.
+ The type of Value stored in the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Iterator>
-rtree(Iterator first,
- Iterator last,
- parameters_type parameters = parameters_type(),
- translator_type const & translator = translator_type(),
- allocator_type allocator = allocator_type())</pre>
-
+ <code class="computeroutput">parameters_type</code>
 
 </td>
<td>
 
- The constructor.
- 
- </td>
-<td>
- 
- Iterator: first:
- The beginning of the range of Values.
- 
- 
- Iterator: last:
- The end of the range of Values.
- 
- 
- parameters_type: parameters:
- The parameters object.
- 
- 
- translator_type const &:
- translator: The translator object.
- 
- 
- allocator_type: allocator:
- The allocator object.
+ R-tree parameters type.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Range>
-rtree(Range const & rng,
- parameters_type parameters = parameters_type(),
- translator_type const & translator = translator_type(),
- allocator_type allocator = allocator_type())</pre>
-
+ <code class="computeroutput">translator_type</code>
 
 </td>
<td>
 
- The constructor.
- 
- </td>
-<td>
- 
- Range const &: rng:
- The range of Values.
- 
- 
- parameters_type: parameters:
- The parameters object.
- 
- 
- translator_type const &:
- translator: The translator object.
- 
- 
- allocator_type: allocator:
- The allocator object.
+ Value to Indexable Translator type.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree(rtree const & src)</pre>
-
- 
- </td>
-<td>
- 
- The copy constructor.
+ <code class="computeroutput">allocator_type</code>
 
 </td>
<td>
 
- rtree const &: src:
- The rtree which content will be copied.
+ The type of allocator used by the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree(rtree const & src, allocator_type const & allocator)</pre>
-
+ <code class="computeroutput">size_type</code>
 
 </td>
<td>
 
- The copy constructor. It uses Parameters and translator from
- the source tree.
+ Unsigned integral type used by the container.
 
 </td>
+</tr>
+<tr>
<td>
 
- rtree const &: src:
- The rtree which content will be copied.
- 
- 
- allocator_type const &:
- allocator: The allocator which will be used.
+ <code class="computeroutput">indexable_type</code>
 
 </td>
-</tr>
-<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree(rtree && src)</pre>
-
+ The Indexable type to which Value is translated.
 
 </td>
+</tr>
+<tr>
<td>
 
- The moving constructor.
+ <code class="computeroutput">box_type</code>
 
 </td>
<td>
 
- rtree &&: src:
- The rtree which content will be moved.
+ The Box type used by the R-tree.
 
 </td>
</tr>
@@ -382,15 +263,13 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h4"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.member_function_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.member_function_s_">Member
- Function(s)</a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.constructor_s__and_destructor"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.constructor_s__and_destructor">Constructor(s)
+ and destructor</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
<col>
<col>
-<col>
-<col>
</colgroup>
<thead><tr>
<th>
@@ -403,325 +282,275 @@
 Description
 
 </th>
-<th>
- 
- Parameters
- 
- </th>
-<th>
- 
- Returns
- 
- </th>
</tr></thead>
<tbody>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">~rtree()</pre>
-
+ <code class="computeroutput">rtree()</code>
 
 </td>
<td>
 
- The destructor.
+ The constructor.
 
 </td>
-<td>
- </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree & operator=(const rtree & src)</pre>
-
- 
- </td>
-<td>
- 
- The assignment operator.
+ <code class="computeroutput">rtree(Iterator,
+ Iterator)</code>
 
 </td>
<td>
 
- const rtree &: src:
- The rtree which content will be copied.
+ The constructor.
 
 </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">rtree & operator=(rtree && src)</pre>
-
- 
- </td>
-<td>
- 
- The moving assignment.
+ <code class="computeroutput">rtree(Range const
+ &)</code>
 
 </td>
<td>
 
- rtree &&: src:
- The rtree which content will be moved.
+ The constructor.
 
 </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">void swap(rtree & other)</pre>
-
+ <code class="computeroutput">~rtree()</code>
 
 </td>
<td>
 
- Swaps contents of two rtrees.
+ The destructor.
 
 </td>
+</tr>
+<tr>
<td>
 
- rtree &: other:
- The rtree which content will be swapped with this rtree content.
+ <code class="computeroutput">rtree(rtree const
+ &)</code>
 
 </td>
-<td class="auto-generated"> </td>
-</tr>
-<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">void insert(value_type const & value)</pre>
-
+ The copy constructor.
 
 </td>
+</tr>
+<tr>
<td>
 
- Insert a value to the index.
+ <code class="computeroutput">rtree(rtree const
+ &, allocator_type
+ const &)</code>
 
 </td>
<td>
 
- value_type const &: value:
- The value which will be stored in the container.
+ The copy constructor. It uses Parameters and translator from
+ the source tree.
 
 </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Iterator>
-void
-insert(Iterator first, Iterator last)</pre>
-
+ <code class="computeroutput">rtree(rtree &&)</code>
 
 </td>
<td>
 
- Insert a range of values to the index.
+ The moving constructor.
 
 </td>
-<td>
+</tr>
+</tbody>
+</table></div>
+<h6>
+<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h5"></a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.member_s_"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.member_s_">Member(s)</a>
+ </h6>
+<div class="informaltable"><table class="table">
+<colgroup>
+<col>
+<col>
+</colgroup>
+<thead><tr>
+<th>
 
- Iterator: first:
- The beginning of the range of values.
+ Function
 
+ </th>
+<th>
 
- Iterator: last:
- The end of the range of values.
+ Description
 
- </td>
-<td class="auto-generated"> </td>
-</tr>
+ </th>
+</tr></thead>
+<tbody>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Range>
-void insert(Range const & rng)</pre>
-
+ <code class="computeroutput">operator=(const rtree
+ &)</code>
 
 </td>
<td>
 
- Insert a range of values to the index.
- 
- </td>
-<td>
- 
- Range const &: rng:
- The range of values.
+ The assignment operator.
 
 </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">size_type remove(value_type const & value)</pre>
-
+ <code class="computeroutput">operator=(rtree &&)</code>
 
 </td>
<td>
 
- Remove a value from the container.
+ The moving assignment.
 
 </td>
+</tr>
+<tr>
<td>
 
- value_type const &: value:
- The value which will be removed from the container.
+ <code class="computeroutput">swap(rtree &)</code>
 
 </td>
<td>
 
- 1 if the value was removed, 0 otherwise.
+ Swaps contents of two rtrees.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Iterator>
-size_type
-remove(Iterator first, Iterator last)</pre>
-
+ <code class="computeroutput">insert(value_type const
+ &)</code>
 
 </td>
<td>
 
- Remove a range of values from the container.
+ Insert a value to the index.
 
 </td>
+</tr>
+<tr>
<td>
 
- Iterator: first:
- The beginning of the range of values.
- 
- 
- Iterator: last:
- The end of the range of values.
+ <code class="computeroutput">insert(Iterator,
+ Iterator)</code>
 
 </td>
<td>
 
- The number of removed values.
+ Insert a range of values to the index.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Range>
-size_type remove(Range const & rng)</pre>
-
+ <code class="computeroutput">insert(Range const
+ &)</code>
 
 </td>
<td>
 
- Remove a range of values from the container.
+ Insert a range of values to the index.
 
 </td>
+</tr>
+<tr>
<td>
 
- Range const &: rng:
- The range of values.
+ <code class="computeroutput">remove(value_type const
+ &)</code>
 
 </td>
<td>
 
- The number of removed values.
+ Remove a value from the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename Predicates, typename OutIter>
-size_type
-spatial_query(Predicates const & pred, OutIter out_it)</pre>
-
+ <code class="computeroutput">remove(Iterator,
+ Iterator)</code>
 
 </td>
<td>
 
- Finds values meeting spatial predicates, e.g. intersecting some
- Box.
+ Remove a range of values from the container.
 
 </td>
+</tr>
+<tr>
<td>
 
- Predicates const &: pred:
- The spatial predicates or a Geometry.
- 
- 
- OutIter: out_it:
- The output iterator of the result range. E.g. an iterator generated
- by std::back_inserter(container)
+ <code class="computeroutput">remove(Range const
+ &)</code>
 
 </td>
<td>
 
- The number of values found.
+ Remove a range of values from the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename DistancesPredicates>
-size_type
-nearest_query(DistancesPredicates const & dpred, value_type & v)</pre>
-
+ <code class="computeroutput">spatial_query(Predicates
+ const &,
+ OutIter)</code>
 
 </td>
<td>
 
- Finds one value meeting distances predicates, e.g. nearest to
- some Point.
+ Finds values meeting spatial predicates, e.g. intersecting some
+ Box.
 
 </td>
+</tr>
+<tr>
<td>
 
- DistancesPredicates const &:
- dpred: The distances predicates or a Point.
- 
- 
- value_type &: v:
- The reference to the object which will contain the result.
+ <code class="computeroutput">nearest_query(DistancesPredicates
+ const &,
+ value_type &)</code>
 
 </td>
<td>
 
- The number of values found.
+ Finds one value meeting distances predicates, e.g. nearest to
+ some Point.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename DistancesPredicates, typename Predicates>
-size_type
-nearest_query(DistancesPredicates const & dpred,
- Predicates const & pred,
- value_type & v)</pre>
-
+ <code class="computeroutput">nearest_query(DistancesPredicates
+ const &,
+ Predicates const
+ &, value_type
+ &)</code>
 
 </td>
<td>
@@ -730,36 +559,14 @@
 e.g. nearest to some Point and intersecting some Box.
 
 </td>
-<td>
- 
- DistancesPredicates const &:
- dpred: The distances predicates or a Point.
- 
- 
- Predicates const &: pred:
- The spatial predicates or a Geometry
- 
- 
- value_type &: v:
- The reference to the object which will contain the result.
- 
- </td>
-<td>
- 
- The number of values found.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename DistancesPredicates, typename OutIter>
-size_type
-nearest_query(DistancesPredicates const & dpred,
- size_t k,
- OutIter out_it)</pre>
-
+ <code class="computeroutput">nearest_query(DistancesPredicates
+ const &,
+ size_t,
+ OutIter)</code>
 
 </td>
<td>
@@ -768,39 +575,15 @@
 to some Point.
 
 </td>
-<td>
- 
- DistancesPredicates const &:
- dpred: The distances predicates or a Point.
- 
- 
- size_t: k:
- The max number of values.
- 
- 
- OutIter: out_it:
- The output iterator of the result range. E.g. a back_insert_iterator.
- 
- </td>
-<td>
- 
- The number of values found.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename DistancesPredicates,
- typename Predicates,
- typename OutIter>
-size_type
-nearest_query(DistancesPredicates const & dpred,
- size_t k,
- Predicates const & pred,
- OutIter out_it)</pre>
-
+ <code class="computeroutput">nearest_query(DistancesPredicates
+ const &,
+ size_t,
+ Predicates const
+ &, OutIter)</code>
 
 </td>
<td>
@@ -809,36 +592,11 @@
 e.g. k nearest values to some Point and intersecting some Box.
 
 </td>
-<td>
- 
- DistancesPredicates const &:
- dpred: The distances predicates or a Point
- 
- 
- size_t: k:
- The max number of values.
- 
- 
- Predicates const &: pred:
- The spatial predicates or a Geometry.
- 
- 
- OutIter: out_it:
- The output iterator of the result range. E.g. a back_insert_iterator.
- 
- </td>
-<td>
- 
- The number of values found.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">size_type size()</pre>
-
+ <code class="computeroutput">size()</code>
 
 </td>
<td>
@@ -846,20 +604,11 @@
 Returns the number of stored values.
 
 </td>
-<td>
- </td>
-<td>
- 
- The number of stored values.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">bool empty()</pre>
-
+ <code class="computeroutput">empty()</code>
 
 </td>
<td>
@@ -867,20 +616,11 @@
 Query if the container is empty.
 
 </td>
-<td>
- </td>
-<td>
- 
- true if the container is empty.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">void clear()</pre>
-
+ <code class="computeroutput">clear()</code>
 
 </td>
<td>
@@ -888,69 +628,36 @@
 Removes all values stored in the container.
 
 </td>
-<td>
- </td>
-<td class="auto-generated"> </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">box_type box()</pre>
-
+ <code class="computeroutput">box()</code>
 
 </td>
<td>
 
 Returns the box containing all values stored in the container.
- If the container is empty the result of geometry::assign_inverse()
- is returned.
- 
- </td>
-<td>
- </td>
-<td>
- 
- The box containing all values stored in the container or an invalid
- box if there are no values in the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">template<typename ValueOrIndexable>
-size_type count(ValueOrIndexable const & vori)</pre>
-
+ <code class="computeroutput">count(ValueOrIndexable const
+ &)</code>
 
 </td>
<td>
 
- For indexable_type it returns the number of values which indexables
- equals the parameter. For value_type it returns the number of
- values which equals the parameter.
- 
- </td>
-<td>
- 
- ValueOrIndexable const &:
- vori: The value or indexable which will
- be counted.
- 
- </td>
-<td>
- 
- The number of values found.
+ Count Values or Indexables stored in the container.
 
 </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">parameters_type const & parameters()</pre>
-
+ <code class="computeroutput">parameters()</code>
 
 </td>
<td>
@@ -958,20 +665,11 @@
 Returns parameters.
 
 </td>
-<td>
- </td>
-<td>
- 
- The parameters object.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">translator_type const & translator()</pre>
-
+ <code class="computeroutput">translator()</code>
 
 </td>
<td>
@@ -979,20 +677,11 @@
 Returns the translator object.
 
 </td>
-<td>
- </td>
-<td>
- 
- The translator object.
- 
- </td>
</tr>
<tr>
<td>
 
-
-<pre xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="table-programlisting">allocator_type get_allocator()</pre>
-
+ <code class="computeroutput">get_allocator()</code>
 
 </td>
<td>
@@ -1000,19 +689,12 @@
 Returns allocator used by the rtree.
 
 </td>
-<td>
- </td>
-<td>
- 
- The allocator.
- 
- </td>
</tr>
</tbody>
</table></div>
<h6>
-<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h5"></a>
- <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.header"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.header">Header</a>
+<a name="geometry_index.r_tree.index.boost_geometry_index_rtree.h6"></a>
+ <a name="geometry_index.r_tree.index.boost_geometry_index_rtree.header"></a><a class="link" href="index.html#geometry_index.r_tree.index.boost_geometry_index_rtree.header">Header</a>
 </h6>

 <code class="computeroutput">#include <.hpp></code>

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/introduction.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Introduction</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="../r_tree.html" title="R-tree">
@@ -28,10 +28,10 @@
</h3></div></div></div>

 R-tree is a tree data structure used for spatial searching. It was proposed
- by Antonin Guttman in 1984 [<a name="geometry_index.r_tree.introduction.f0" href="#ftn.geometry_index.r_tree.introduction.f0" class="footnote">1</a>] as an expansion of B-tree for multi-dimensional data. It may
+ by Antonin Guttman in 1984 [1]</a> as an expansion of B-tree for multi-dimensional data. It may
 be used to store points or volumetric data in order to perform a spatial
 query later. This query may return objects that are inside some area or are
- close to some point in space [<a name="geometry_index.r_tree.introduction.f1" href="#ftn.geometry_index.r_tree.introduction.f1" class="footnote">2</a>].
+ close to some point in space [2]</a>.
 

 The R-tree structure is presented on the image below. Each R-tree's node
@@ -51,7 +51,7 @@
 

 The R-tree is a self-balanced data structure. The key part of balancing algorithm
- is node splitting algorithm [<a name="geometry_index.r_tree.introduction.f2" href="#ftn.geometry_index.r_tree.introduction.f2" class="footnote">3</a>] [<a name="geometry_index.r_tree.introduction.f3" href="#ftn.geometry_index.r_tree.introduction.f3" class="footnote">4</a>]. Each algorithm produces different splits so the internal structure
+ is node splitting algorithm [3]</a> [4]</a>. Each algorithm produces different splits so the internal structure
 of a tree may be different for each one of them. In general more complex
 algorithms analyses elements better and produces less overlapping nodes.
 In the searching process less nodes must be traversed in order to find desired
@@ -180,7 +180,7 @@

 Key features of this implementation of the R-tree are:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 capable to store arbitrary Value type,
 </li>
@@ -201,20 +201,20 @@
 </li>
</ul></div>
<div class="footnotes">
- <hr width="100" align="left">
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.introduction.f0" href="#geometry_index.r_tree.introduction.f0" class="para">1</a>] 
+ <hr style="width:100; align:left;">
+<div id="ftn.geometry_index.r_tree.introduction.f0" class="footnote">^[1]
 Guttman, A. (1984). R-Trees: A Dynamic Index Structure for Spatial
 Searching
 </div>
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.introduction.f1" href="#geometry_index.r_tree.introduction.f1" class="para">2</a>] 
+<div id="ftn.geometry_index.r_tree.introduction.f1" class="footnote">^[2]
 Cheung, K.; Fu, A. (1998). Enhanced Nearest Neighbour Search
 on the R-tree
 </div>
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.introduction.f2" href="#geometry_index.r_tree.introduction.f2" class="para">3</a>] 
+<div id="ftn.geometry_index.r_tree.introduction.f2" class="footnote">^[3]
 Greene, D. (1989). An implementation and performance analysis
 of spatial data access methods
 </div>
-<div class="footnote">[<a id="ftn.geometry_index.r_tree.introduction.f3" href="#geometry_index.r_tree.introduction.f3" class="para">4</a>] 
+<div id="ftn.geometry_index.r_tree.introduction.f3" class="footnote">^[4]
 Beckmann, N.; Kriegel, H. P.; Schneider, R.; Seeger, B. (1990). The
 R*-tree: an efficient and robust access method for points and rectangles
 </div>

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/nearest_neighbours_queries.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Nearest neighbours queries</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="spatial_queries.html" title="Spatial queries">

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Quick Start</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="introduction.html" title="Introduction">
@@ -150,7 +150,7 @@
 
<h4>
<a name="geometry_index.r_tree.rtree_quickstart.h0"></a>
- <a name="geometry_index.r_tree.rtree_quickstart.more"></a><a class="link" href="rtree_quickstart.html#geometry_index.r_tree.rtree_quickstart.more">More</a>
+ <a name="geometry_index.r_tree.rtree_quickstart.more"></a><a class="link" href="rtree_quickstart.html#geometry_index.r_tree.rtree_quickstart.more">More</a>
 </h4>

 More information about the R-tree implementation, other algorithms and queries

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/spatial_queries.html 2013-01-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Spatial queries</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="../../index.html" title="Chapter 1. Geometry Index">
<link rel="up" href="../r_tree.html" title="R-tree">
<link rel="prev" href="creation_and_modification.html" title="Creation and modification">

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-07 16:08:48 EST (Mon, 07 Jan 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Chapter 1. Geometry Index</title>
<link rel="stylesheet" href="http://www.boost.org/doc/libs/release/doc/src/boostbook.css" type="text/css">
-<meta name="generator" content="DocBook XSL Stylesheets V1.76.1">
+<meta name="generator" content="DocBook XSL Stylesheets V1.77.1">
<link rel="home" href="index.html" title="Chapter 1. Geometry Index">
<link rel="next" href="geometry_index/introduction.html" title="Introduction">
</head>
@@ -57,7 +57,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: January 07, 2013 at 04:43:31 GMT</td>
+<td align="left">Last revised: January 07, 2013 at 21:06:41 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Next message: oliver.kowalke_at_[hidden]: "[Boost-commit] svn:boost r82388 - in trunk/libs/context: build src"
Previous message: adam.wulkiewicz_at_[hidden]: "[Boost-commit] svn:boost r82386 - sandbox-branches/geometry/index/boost/geometry/extensions/index/rtree"

Date view	Thread view	Subject view	Author view

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