Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r83232 - in sandbox-branches/geometry/index: boost/geometry/index boost/geometry/index/detail boost/geometry/index/detail/rtree/visitors doc/generated doc/html doc/html/geometry_index doc/html/geometry_index/r_tree doc/rtree doc/src/examples/rtree example test/rtree
From: adam.wulkiewicz_at_[hidden]
Date: 2013-03-01 13:14:50

Next message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r83233 - in trunk: boost/graph libs/graph/doc"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r83231 - trunk/boost/tr1/detail"

Author: awulkiew
Date: 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
New Revision: 83232
URL: http://svn.boost.org/trac/boost/changeset/83232

Log:
rtree query default spatial predicate removed. Explicit call of intersects() is expected.
Predicates and DistancePredicates are stored by value in visitors.
Each predicate is stored by value in expression tuple.
Examples and docs updated.
Text files modified:
   sandbox-branches/geometry/index/boost/geometry/index/detail/predicates.hpp | 452 +++++++++++++++++------------
   sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/nearest_query.hpp | 89 ++--
   sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/spatial_query.hpp | 4
   sandbox-branches/geometry/index/boost/geometry/index/predicates.hpp | 42 +
   sandbox-branches/geometry/index/boost/geometry/index/rtree.hpp | 28
   sandbox-branches/geometry/index/doc/generated/predicates.qbk | 21 +
   sandbox-branches/geometry/index/doc/generated/rtree.qbk | 12
   sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk | 12
   sandbox-branches/geometry/index/doc/html/geometry_index/introduction.html | 2
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree.html | 6
   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/introduction.html | 28
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/queries.html | 88 +++--
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html | 601 ++++++++++++++++++++-------------------
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_examples.html | 16
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_quickstart.html | 6
   sandbox-branches/geometry/index/doc/html/index.html | 4
   sandbox-branches/geometry/index/doc/rtree/query.qbk | 63 ++-
   sandbox-branches/geometry/index/doc/src/examples/rtree/interprocess.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_shared_ptr.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_vector.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/translator_index.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/translator_shared_ptr.cpp | 2
   sandbox-branches/geometry/index/doc/src/examples/rtree/variants_map.cpp | 2
   sandbox-branches/geometry/index/example/benchmark.cpp | 2
   sandbox-branches/geometry/index/test/rtree/test_rtree.hpp | 44 +-
   27 files changed, 846 insertions(+), 698 deletions(-)

Modified: sandbox-branches/geometry/index/boost/geometry/index/detail/predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/index/detail/predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/index/detail/predicates.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -20,8 +20,7 @@
// predicates
// ------------------------------------------------------------------ //

-// not needed?
-struct empty {};
+//struct empty {};

template <typename Fun>
struct satisfies
@@ -126,42 +125,101 @@
};

// ------------------------------------------------------------------ //
+// is_predicate
+// ------------------------------------------------------------------ //
+
+//template <typename P> struct is_predicate { static const bool value = false; };
+////template <> struct is_predicate< empty > { static const bool value = true; };
+//template <typename UP> struct is_predicate< satisfies<UP> > { static const bool value = true; };
+//template <typename G> struct is_predicate< covered_by<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< disjoint<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< intersects<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< overlaps<G> > { static const bool value = true; };
+////template <typename G> struct is_predicate< touches<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< within<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< not_covered_by<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< not_disjoint<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< not_intersects<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< not_overlaps<G> > { static const bool value = true; };
+////template <typename G> struct is_predicate< not_touches<G> > { static const bool value = true; };
+//template <typename G> struct is_predicate< not_within<G> > { static const bool value = true; };
+//template <typename P> struct is_predicate< nearest > { static const bool value = true; };
+
+// ------------------------------------------------------------------ //
+// predicate_check_default
+// ------------------------------------------------------------------ //
+
+//template <typename GeometryOrUnary, typename GeometryTag, typename Tag>
+//struct predicate_check_default
+//{
+// BOOST_MPL_ASSERT_MSG(
+// (false),
+// NOT_IMPLEMENTED_FOR_THESE_TAGS,
+// (predicate_check_default));
+//};
+
+// ------------------------------------------------------------------ //
// predicate_check
// ------------------------------------------------------------------ //

-template <typename Geometry, typename Tag>
+template <typename Predicate, typename Tag>
struct predicate_check
{
 BOOST_MPL_ASSERT_MSG(
 (false),
- NOT_IMPLEMENTED_FOR_THIS_TAG,
+ NOT_IMPLEMENTED_FOR_THIS_PREDICATE_OR_TAG,
 (predicate_check));
};

// ------------------------------------------------------------------ //
+// predicate_check_default for value
+// ------------------------------------------------------------------ //
+
+//template <typename Geometry, typename GeometryTag>
+//struct predicate_check_default<Geometry, GeometryTag, value_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(Geometry const& g, Value const&, Indexable const& i)
+// {
+// return geometry::intersects(i, g);
+// }
+//};
+//
+//template <typename Unary>
+//struct predicate_check_default<Unary, void, value_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(Unary const& u, Value const& v, Indexable const&)
+// {
+// return u(v);
+// }
+//};
+
+// ------------------------------------------------------------------ //
// predicate_check for value
// ------------------------------------------------------------------ //

-template <typename Geometry>
-struct predicate_check<Geometry, value_tag>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(Geometry const& g, Value const&, Indexable const& i)
- {
- return geometry::intersects(i, g);
- }
-};
+//template <typename GeometryOrUnary>
+//struct predicate_check<GeometryOrUnary, value_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(GeometryOrUnary const& g, Value const& v, Indexable const& i)
+// {
+// return predicate_check_default<
+// GeometryOrUnary, typename geometry::traits::tag<GeometryOrUnary>::type, bounds_tag
+// >::apply(g, v, i);
+// }
+//};

-// not needed?
-template <>
-struct predicate_check<empty, value_tag>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(empty const&, Value const&, Indexable const&)
- {
- return true;
- }
-};
+//template <>
+//struct predicate_check<empty, value_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(empty const&, Value const&, Indexable const&)
+// {
+// return true;
+// }
+//};

template <typename Fun>
struct predicate_check<satisfies<Fun>, value_tag>
@@ -304,28 +362,54 @@
};

// ------------------------------------------------------------------ //
-// predicates_chec for envelope
+// predicate_check_default for bounds
// ------------------------------------------------------------------ //

-template <typename Geometry>
-struct predicate_check<Geometry, bounds_tag>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(Geometry const& g, Value const&, Indexable const& i)
- {
- return geometry::intersects(i, g);
- }
-};
+//template <typename Geometry, typename GeometryTag>
+//struct predicate_check_default<Geometry, GeometryTag, bounds_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(Geometry const& g, Value const&, Indexable const& i)
+// {
+// return geometry::intersects(i, g);
+// }
+//};
+//
+//template <typename Unary>
+//struct predicate_check_default<Unary, void, bounds_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(Unary const&, Value const&, Indexable const&)
+// {
+// return true;
+// }
+//};

-template <>
-struct predicate_check<empty, bounds_tag>
-{
- template <typename Geometry, typename Value, typename Indexable>
- static inline bool apply(Geometry const&, Value const&, Indexable const&)
- {
- return true;
- }
-};
+// ------------------------------------------------------------------ //
+// predicates_chec for bounds
+// ------------------------------------------------------------------ //
+
+//template <typename GeometryOrUnary>
+//struct predicate_check<GeometryOrUnary, bounds_tag>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(GeometryOrUnary const& g, Value const& v, Indexable const& i)
+// {
+// return predicate_check_default<
+// GeometryOrUnary, typename geometry::traits::tag<GeometryOrUnary>::type, bounds_tag
+// >::apply(g, v, i);
+// }
+//};
+
+//template <>
+//struct predicate_check<empty, bounds_tag>
+//{
+// template <typename Geometry, typename Value, typename Indexable>
+// static inline bool apply(Geometry const&, Value const&, Indexable const&)
+// {
+// return true;
+// }
+//};

template <typename Fun>
struct predicate_check<satisfies<Fun>, bounds_tag>
@@ -481,17 +565,17 @@
 static const unsigned value = 1;
};

-template <typename F, typename S>
-struct predicates_length< std::pair<F, S> >
-{
- static const unsigned value = 2;
-};
+//template <typename F, typename S>
+//struct predicates_length< std::pair<F, S> >
+//{
+// static const unsigned value = 2;
+//};

-template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
-struct predicates_length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
-{
- static const unsigned value = boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value;
-};
+//template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
+//struct predicates_length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
+//{
+// static const unsigned value = boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value;
+//};

template <typename Head, typename Tail>
struct predicates_length< boost::tuples::cons<Head, Tail> >
@@ -511,30 +595,30 @@
 static type const& get(T const& p) { return p; }
};

-template <unsigned I, typename F, typename S>
-struct predicates_element< I, std::pair<F, S> >
-{
- BOOST_MPL_ASSERT_MSG((I < 2), INVALID_INDEX, (predicates_element));
-
- typedef F type;
- static type const& get(std::pair<F, S> const& p) { return p.first; }
-};
-
-template <typename F, typename S>
-struct predicates_element< 1, std::pair<F, S> >
-{
- typedef S type;
- static type const& get(std::pair<F, S> const& p) { return p.second; }
-};
-
-template <unsigned I, typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
-struct predicates_element< I, boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
-{
- typedef boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> predicate_type;
-
- typedef typename boost::tuples::element<I, predicate_type>::type type;
- static type const& get(predicate_type const& p) { return boost::get(p); }
-};
+//template <unsigned I, typename F, typename S>
+//struct predicates_element< I, std::pair<F, S> >
+//{
+// BOOST_MPL_ASSERT_MSG((I < 2), INVALID_INDEX, (predicates_element));
+//
+// typedef F type;
+// static type const& get(std::pair<F, S> const& p) { return p.first; }
+//};
+//
+//template <typename F, typename S>
+//struct predicates_element< 1, std::pair<F, S> >
+//{
+// typedef S type;
+// static type const& get(std::pair<F, S> const& p) { return p.second; }
+//};
+//
+//template <unsigned I, typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
+//struct predicates_element< I, boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
+//{
+// typedef boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> predicate_type;
+//
+// typedef typename boost::tuples::element<I, predicate_type>::type type;
+// static type const& get(predicate_type const& p) { return boost::get(p); }
+//};

template <unsigned I, typename Head, typename Tail>
struct predicates_element< I, boost::tuples::cons<Head, Tail> >
@@ -549,49 +633,49 @@
// predicates_check
// ------------------------------------------------------------------ //

-template <typename PairPredicates, typename Tag, unsigned First, unsigned Last>
-struct predicates_check_pair {};
-
-template <typename PairPredicates, typename Tag, unsigned I>
-struct predicates_check_pair<PairPredicates, Tag, I, I>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(PairPredicates const& , Value const& , Indexable const& )
- {
- return true;
- }
-};
-
-template <typename PairPredicates, typename Tag>
-struct predicates_check_pair<PairPredicates, Tag, 0, 1>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
- {
- return predicate_check<typename PairPredicates::first_type, Tag>::apply(p.first, v, i);
- }
-};
-
-template <typename PairPredicates, typename Tag>
-struct predicates_check_pair<PairPredicates, Tag, 1, 2>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
- {
- return predicate_check<typename PairPredicates::second_type, Tag>::apply(p.second, v, i);
- }
-};
-
-template <typename PairPredicates, typename Tag>
-struct predicates_check_pair<PairPredicates, Tag, 0, 2>
-{
- template <typename Value, typename Indexable>
- static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
- {
- return predicate_check<typename PairPredicates::first_type, Tag>::apply(p.first, v, i)
- && predicate_check<typename PairPredicates::second_type, Tag>::apply(p.second, v, i);
- }
-};
+//template <typename PairPredicates, typename Tag, unsigned First, unsigned Last>
+//struct predicates_check_pair {};
+//
+//template <typename PairPredicates, typename Tag, unsigned I>
+//struct predicates_check_pair<PairPredicates, Tag, I, I>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(PairPredicates const& , Value const& , Indexable const& )
+// {
+// return true;
+// }
+//};
+//
+//template <typename PairPredicates, typename Tag>
+//struct predicates_check_pair<PairPredicates, Tag, 0, 1>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
+// {
+// return predicate_check<typename PairPredicates::first_type, Tag>::apply(p.first, v, i);
+// }
+//};
+//
+//template <typename PairPredicates, typename Tag>
+//struct predicates_check_pair<PairPredicates, Tag, 1, 2>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
+// {
+// return predicate_check<typename PairPredicates::second_type, Tag>::apply(p.second, v, i);
+// }
+//};
+//
+//template <typename PairPredicates, typename Tag>
+//struct predicates_check_pair<PairPredicates, Tag, 0, 2>
+//{
+// template <typename Value, typename Indexable>
+// static inline bool apply(PairPredicates const& p, Value const& v, Indexable const& i)
+// {
+// return predicate_check<typename PairPredicates::first_type, Tag>::apply(p.first, v, i)
+// && predicate_check<typename PairPredicates::second_type, Tag>::apply(p.second, v, i);
+// }
+//};

template <typename TuplePredicates, typename Tag, unsigned First, unsigned Last>
struct predicates_check_tuple
@@ -630,43 +714,43 @@
 }
};

-template <typename Predicate1, typename Predicate2, typename Tag, size_t First, size_t Last>
-struct predicates_check_impl<std::pair<Predicate1, Predicate2>, Tag, First, Last>
-{
- BOOST_MPL_ASSERT_MSG((First < 2 && Last <= 2 && First <= Last), INVALID_INDEXES, (predicates_check_impl));
-
- template <typename Value, typename Indexable>
- static inline bool apply(std::pair<Predicate1, Predicate2> const& p, Value const& v, Indexable const& i)
- {
- return predicate_check<Predicate1, Tag>::apply(p.first, v, i)
- && predicate_check<Predicate2, Tag>::apply(p.second, v, i);
- }
-};
-
-template <
- typename T0, typename T1, typename T2, typename T3, typename T4,
- typename T5, typename T6, typename T7, typename T8, typename T9,
- typename Tag, unsigned First, unsigned Last
->
-struct predicates_check_impl<
- boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
- Tag, First, Last
->
-{
- typedef boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> predicates_type;
-
- static const unsigned pred_len = boost::tuples::length<predicates_type>::value;
- BOOST_MPL_ASSERT_MSG((First < pred_len && Last <= pred_len && First <= Last), INVALID_INDEXES, (predicates_check_impl));
-
- template <typename Value, typename Indexable>
- static inline bool apply(predicates_type const& p, Value const& v, Indexable const& i)
- {
- return predicates_check_tuple<
- predicates_type,
- Tag, First, Last
- >::apply(p, v, i);
- }
-};
+//template <typename Predicate1, typename Predicate2, typename Tag, size_t First, size_t Last>
+//struct predicates_check_impl<std::pair<Predicate1, Predicate2>, Tag, First, Last>
+//{
+// BOOST_MPL_ASSERT_MSG((First < 2 && Last <= 2 && First <= Last), INVALID_INDEXES, (predicates_check_impl));
+//
+// template <typename Value, typename Indexable>
+// static inline bool apply(std::pair<Predicate1, Predicate2> const& p, Value const& v, Indexable const& i)
+// {
+// return predicate_check<Predicate1, Tag>::apply(p.first, v, i)
+// && predicate_check<Predicate2, Tag>::apply(p.second, v, i);
+// }
+//};
+//
+//template <
+// typename T0, typename T1, typename T2, typename T3, typename T4,
+// typename T5, typename T6, typename T7, typename T8, typename T9,
+// typename Tag, unsigned First, unsigned Last
+//>
+//struct predicates_check_impl<
+// boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
+// Tag, First, Last
+//>
+//{
+// typedef boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> predicates_type;
+//
+// static const unsigned pred_len = boost::tuples::length<predicates_type>::value;
+// BOOST_MPL_ASSERT_MSG((First < pred_len && Last <= pred_len && First <= Last), INVALID_INDEXES, (predicates_check_impl));
+//
+// template <typename Value, typename Indexable>
+// static inline bool apply(predicates_type const& p, Value const& v, Indexable const& i)
+// {
+// return predicates_check_tuple<
+// predicates_type,
+// Tag, First, Last
+// >::apply(p, v, i);
+// }
+//};

template <typename Head, typename Tail, typename Tag, unsigned First, unsigned Last>
struct predicates_check_impl<
@@ -722,12 +806,12 @@
 static const unsigned value = predicates_is_nearest<T>::value;
};

-template <typename F, typename S>
-struct predicates_count_nearest< std::pair<F, S> >
-{
- static const unsigned value = predicates_is_nearest<F>::value
- + predicates_is_nearest<S>::value;
-};
+//template <typename F, typename S>
+//struct predicates_count_nearest< std::pair<F, S> >
+//{
+// static const unsigned value = predicates_is_nearest<F>::value
+// + predicates_is_nearest<S>::value;
+//};

template <typename Tuple, unsigned N>
struct predicates_count_nearest_tuple
@@ -744,14 +828,14 @@
 predicates_is_nearest<typename boost::tuples::element<0, Tuple>::type>::value;
};

-template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
-struct predicates_count_nearest< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
-{
- static const unsigned value = predicates_count_nearest_tuple<
- boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
- boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value
- >::value;
-};
+//template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
+//struct predicates_count_nearest< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
+//{
+// static const unsigned value = predicates_count_nearest_tuple<
+// boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
+// boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value
+// >::value;
+//};

template <typename Head, typename Tail>
struct predicates_count_nearest< boost::tuples::cons<Head, Tail> >
@@ -770,12 +854,12 @@
 static const unsigned value = predicates_is_nearest<T>::value ? 0 : 1;
};

-template <typename F, typename S>
-struct predicates_find_nearest< std::pair<F, S> >
-{
- static const unsigned value = predicates_is_nearest<F>::value ? 0 :
- (predicates_is_nearest<S>::value ? 1 : 2);
-};
+//template <typename F, typename S>
+//struct predicates_find_nearest< std::pair<F, S> >
+//{
+// static const unsigned value = predicates_is_nearest<F>::value ? 0 :
+// (predicates_is_nearest<S>::value ? 1 : 2);
+//};

template <typename Tuple, unsigned N>
struct predicates_find_nearest_tuple
@@ -796,14 +880,14 @@
 static const unsigned value = is_found ? 0 : boost::tuples::length<Tuple>::value;
};

-template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
-struct predicates_find_nearest< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
-{
- static const unsigned value = predicates_find_nearest_tuple<
- boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
- boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value
- >::value;
-};
+//template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
+//struct predicates_find_nearest< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >
+//{
+// static const unsigned value = predicates_find_nearest_tuple<
+// boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>,
+// boost::tuples::length< boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> >::value
+// >::value;
+//};

template <typename Head, typename Tail>
struct predicates_find_nearest< boost::tuples::cons<Head, Tail> >

Modified: sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/nearest_query.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/nearest_query.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/nearest_query.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -19,48 +19,48 @@
// in store() or break store to 2 functions e.g. should_store() and store()
// - well not with this algorithm of storing k-th neighbor

-template <typename Value, typename Translator, typename Point>
-struct nearest_query_result_one
-{
-public:
- typedef typename geometry::default_distance_result<
- Point,
- typename translator::indexable_type<Translator>::type
- >::type distance_type;
-
- inline nearest_query_result_one(Value & value)
- : m_value(value)
- , m_comp_dist((std::numeric_limits<distance_type>::max)())
- {}
-
- inline void store(Value const& val, distance_type const& curr_comp_dist)
- {
- if ( curr_comp_dist < m_comp_dist )
- {
- m_comp_dist = curr_comp_dist;
- m_value = val;
- }
- }
-
- inline bool is_comparable_distance_valid() const
- {
- return m_comp_dist < (std::numeric_limits<distance_type>::max)();
- }
-
- inline distance_type comparable_distance() const
- {
- return m_comp_dist;
- }
-
- inline size_t finish()
- {
- return is_comparable_distance_valid() ? 1 : 0;
- }
-
-private:
- Value & m_value;
- distance_type m_comp_dist;
-};
+//template <typename Value, typename Translator, typename Point>
+//struct nearest_query_result_one
+//{
+//public:
+// typedef typename geometry::default_distance_result<
+// Point,
+// typename translator::indexable_type<Translator>::type
+// >::type distance_type;
+//
+// inline nearest_query_result_one(Value & value)
+// : m_value(value)
+// , m_comp_dist((std::numeric_limits<distance_type>::max)())
+// {}
+//
+// inline void store(Value const& val, distance_type const& curr_comp_dist)
+// {
+// if ( curr_comp_dist < m_comp_dist )
+// {
+// m_comp_dist = curr_comp_dist;
+// m_value = val;
+// }
+// }
+//
+// inline bool is_comparable_distance_valid() const
+// {
+// return m_comp_dist < (std::numeric_limits<distance_type>::max)();
+// }
+//
+// inline distance_type comparable_distance() const
+// {
+// return m_comp_dist;
+// }
+//
+// inline size_t finish()
+// {
+// return is_comparable_distance_valid() ? 1 : 0;
+// }
+//
+//private:
+// Value & m_value;
+// distance_type m_comp_dist;
+//};

template <typename Value, typename Translator, typename Point, typename OutIt>
struct nearest_query_result_k
@@ -324,8 +324,9 @@

 parameters_type const& m_parameters;
 Translator const& m_translator;
- DistancesPredicates const& m_dist_pred;
- Predicates const& m_pred;
+
+ DistancesPredicates m_dist_pred;
+ Predicates m_pred;

 Result & m_result;
};

Modified: sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/spatial_query.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/spatial_query.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/index/detail/rtree/visitors/spatial_query.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -66,7 +66,9 @@
     }

     Translator const& tr;
- Predicates const& pred;
+
+ Predicates pred;
+
     OutIter out_iter;
     size_t found_count;
};

Modified: sandbox-branches/geometry/index/boost/geometry/index/predicates.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/index/predicates.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/index/predicates.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -175,9 +175,24 @@

\par Example
\verbatim
-bool is_red(Value const& v) { ... }
-...
-bgi::query(spatial_index, bgi::intersects(box) && bgi::satisfies(is_red), std::back_inserter(result));
+bool is_red(__value__ const& v) { return v.is_red(); }
+
+struct is_red_o {
+template <typename Value> bool operator()(__value__ const& v) { return v.is_red(); }
+}
+
+// ...
+
+rt.query(index::intersects(box) && index::satisfies(is_red),
+std::back_inserter(result));
+
+rt.query(index::intersects(box) && index::satisfies(is_red_o()),
+std::back_inserter(result));
+
+#ifndef BOOST_NO_CXX11_LAMBDAS
+rt.query(index::intersects(box) && index::satisfies([](__value__ const& v) { return v.is_red(); }),
+std::back_inserter(result));
+#endif
\endverbatim

\ingroup predicates
@@ -324,14 +339,13 @@
>
operator&&(Pred1 const& p1, Pred2 const& p2)
{
+ /*typedef typename boost::mpl::if_c<is_predicate<Pred1>::value, Pred1, Pred1 const&>::type stored1;
+ typedef typename boost::mpl::if_c<is_predicate<Pred2>::value, Pred2, Pred2 const&>::type stored2;*/
+ namespace bt = boost::tuples;
+
 return
- boost::tuples::cons<
- Pred1,
- boost::tuples::cons<Pred2, boost::tuples::null_type>
- >(
- p1,
- boost::tuples::cons<Pred2, boost::tuples::null_type>(p2, boost::tuples::null_type())
- );
+ bt::cons< Pred1, bt::cons<Pred2, bt::null_type> >
+ ( p1, bt::cons<Pred2, bt::null_type>(p2, bt::null_type()) );
}

template <typename Head, typename Tail, typename Pred> inline
@@ -343,12 +357,12 @@
>::type
operator&&(boost::tuples::cons<Head, Tail> const& t, Pred const& p)
{
+ //typedef typename boost::mpl::if_c<is_predicate<Pred>::value, Pred, Pred const&>::type stored;
+ namespace bt = boost::tuples;
+
 return
 tuples::push_back_impl<
- boost::tuples::cons<Head, Tail>,
- Pred,
- 0,
- boost::tuples::length<boost::tuples::cons<Head, Tail> >::value
+ bt::cons<Head, Tail>, Pred, 0, bt::length< bt::cons<Head, Tail> >::value
>::apply(t, p);
}

Modified: sandbox-branches/geometry/index/boost/geometry/index/rtree.hpp
==============================================================================
--- sandbox-branches/geometry/index/boost/geometry/index/rtree.hpp (original)
+++ sandbox-branches/geometry/index/boost/geometry/index/rtree.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -596,11 +596,10 @@

 Spatial predicates

- The simplest form of spatial predicate is a \c Geometry. In this case Values intersecting the \c Geometry are returned.
- More spatial predicates may be generated by one of the functions listed below:
+ Spatial predicates may be generated by one of the functions listed below:
 \li \c boost::geometry::index::covered_by(),
 \li \c boost::geometry::index::disjoint(),
- \li \c boost::geometry::index::intersects() - default,
+ \li \c boost::geometry::index::intersects(),
 \li \c boost::geometry::index::overlaps(),
 \li \c boost::geometry::index::within(),

@@ -611,11 +610,11 @@
 \li <tt>! boost::geometry::index::overlaps()</tt>,
 \li <tt>! boost::geometry::index::within()</tt>

- Value predicate
+ Satisfies predicate

- This is a special kind of predicate which allows to pass a user-defined functor which checks
+ This is a special kind of predicate which allows to pass a user-defined function or function object which checks
 if Value should be returned by the query. It's generated by:
- \li \c boost::geometry::index::value().
+ \li \c boost::geometry::index::satisfies().

 Nearest predicate

@@ -631,7 +630,7 @@
 \par Example
 \verbatim
 // return elements intersecting box
- tree.query(box, std::back_inserter(result));
+ tree.query(bgi::intersects(box), std::back_inserter(result));
 // return elements intersecting poly but not within box
 tree.query(bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
 // return elements overlapping box and meeting my_fun unary predicate
@@ -1247,11 +1246,10 @@

Spatial predicates

-The simplest form of spatial predicate is a \c Geometry. In this case Values intersecting the \c Geometry are returned.
-More spatial predicates may be generated by one of the functions listed below:
+Spatial predicates may be generated by one of the functions listed below:
\li \c boost::geometry::index::covered_by(),
\li \c boost::geometry::index::disjoint(),
-\li \c boost::geometry::index::intersects() - default,
+\li \c boost::geometry::index::intersects(),
\li \c boost::geometry::index::overlaps(),
\li \c boost::geometry::index::within(),

@@ -1262,11 +1260,11 @@
\li <tt>! boost::geometry::index::overlaps()</tt>,
\li <tt>! boost::geometry::index::within()</tt>

-Value predicate
-
-This is a special kind of predicate which allows to pass a user-defined functor which checks
+Satisfies predicate
+
+This is a special kind of predicate which allows to pass a user-defined function or function object which checks
if Value should be returned by the query. It's generated by:
-\li \c boost::geometry::index::value().
+\li \c boost::geometry::index::satisfies().

Nearest predicate

@@ -1282,7 +1280,7 @@
\par Example
\verbatim
// return elements intersecting box
-bgi::query(tree, box, std::back_inserter(result));
+bgi::query(tree, bgi::intersects(box), std::back_inserter(result));
// return elements intersecting poly but not within box
bgi::query(tree, bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
// return elements overlapping box and meeting my_fun value predicate

Modified: sandbox-branches/geometry/index/doc/generated/predicates.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/predicates.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/predicates.qbk 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -195,9 +195,24 @@
[heading Example]

``
-bool is_red(Value const& v) { ... }
-...
-bgi::query(spatial_index, bgi::intersects(box) && bgi::satisfies(is_red), std::back_inserter(result));
+bool is_red(__value__ const& v) { return v.is_red(); }
+
+struct is_red_o {
+template <typename Value> bool operator()(__value__ const& v) { return v.is_red(); }
+}
+
+// ...
+
+rt.query(index::intersects(box) && index::satisfies(is_red),
+std::back_inserter(result));
+
+rt.query(index::intersects(box) && index::satisfies(is_red_o()),
+std::back_inserter(result));
+
+#ifndef BOOST_NO_CXX11_LAMBDAS
+rt.query(index::intersects(box) && index::satisfies([](__value__ const& v) { return v.is_red(); }),
+std::back_inserter(result));
+#endif
``

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-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -609,11 +609,11 @@

[*Spatial predicates]

-The simplest form of spatial predicate is a [^`Geometry`]. In this case Values intersecting the [^`Geometry`] are returned. More spatial predicates may be generated by one of the functions listed below:
+Spatial predicates may be generated by one of the functions listed below:

* [^[link group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61 boost::geometry::index::covered_by()]],
* [^[link group__predicates_1ga351bb3b82e019ff45adf789385b8007d boost::geometry::index::disjoint()]],
-* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]] - default,
+* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]],
* [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]],

@@ -626,11 +626,11 @@
* [^`! `[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^`! `[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]

-[*Value predicate]
+[*Satisfies predicate]

-This is a special kind of predicate which allows to pass a user-defined functor which checks if Value should be returned by the query. It's generated by:
+This is a special kind of predicate which allows to pass a user-defined function or function object which checks if Value should be returned by the query. It's generated by:

-* [^`boost::geometry::index::value()`].
+* [^[link group__predicates_1gae7e9291c5b99041fb155d29de0860bab boost::geometry::index::satisfies()]].

[*Nearest predicate]

@@ -659,7 +659,7 @@

``
// return elements intersecting box
-tree.query(box, std::back_inserter(result));
+tree.query(bgi::intersects(box), std::back_inserter(result));
// return elements intersecting poly but not within box
tree.query(bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
// return elements overlapping box and meeting my_fun unary predicate

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-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -181,11 +181,11 @@

[*Spatial predicates]

-The simplest form of spatial predicate is a [^`Geometry`]. In this case Values intersecting the [^`Geometry`] are returned. More spatial predicates may be generated by one of the functions listed below:
+Spatial predicates may be generated by one of the functions listed below:

* [^[link group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61 boost::geometry::index::covered_by()]],
* [^[link group__predicates_1ga351bb3b82e019ff45adf789385b8007d boost::geometry::index::disjoint()]],
-* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]] - default,
+* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]],
* [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]],

@@ -198,11 +198,11 @@
* [^`! `[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^`! `[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]

-[*Value predicate]
+[*Satisfies predicate]

-This is a special kind of predicate which allows to pass a user-defined functor which checks if Value should be returned by the query. It's generated by:
+This is a special kind of predicate which allows to pass a user-defined function or function object which checks if Value should be returned by the query. It's generated by:

-* [^`boost::geometry::index::value()`].
+* [^[link group__predicates_1gae7e9291c5b99041fb155d29de0860bab boost::geometry::index::satisfies()]].

[*Nearest predicate]

@@ -238,7 +238,7 @@

``
// return elements intersecting box
-bgi::query(tree, box, std::back_inserter(result));
+bgi::query(tree, bgi::intersects(box), std::back_inserter(result));
// return elements intersecting poly but not within box
bgi::query(tree, bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
// return elements overlapping box and meeting my_fun value predicate

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-03-01 13:14:46 EST (Fri, 01 Mar 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-03-01 13:14:46 EST (Fri, 01 Mar 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">
@@ -57,8 +57,8 @@
 queries</a></dt>
<dt><a href="r_tree/queries.html#geometry_index.r_tree.queries.nearest_neighbours_queries">Nearest
 neighbours queries</a></dt>
-<dt><a href="r_tree/queries.html#geometry_index.r_tree.queries.satisfies_predicate">Satisfies
- predicate</a></dt>
+<dt><a href="r_tree/queries.html#geometry_index.r_tree.queries.user_defined_unary_predicate">user-defined
+ unary predicate</a></dt>
<dt><a href="r_tree/queries.html#geometry_index.r_tree.queries.passing_a_set_of_predicates">Passing
 a set of predicates</a></dt>
<dt><a href="r_tree/queries.html#geometry_index.r_tree.queries.inserting_query_results_into_the_other_r_tree">Inserting

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-03-01 13:14:46 EST (Fri, 01 Mar 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 = index::translator<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<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/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-03-01 13:14:46 EST (Fri, 01 Mar 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
@@ -181,13 +181,13 @@
</table></div>
<h5>
<a name="geometry_index.r_tree.introduction.h0"></a>
- <a name="geometry_index.r_tree.introduction.implementation_details"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.implementation_details">Implementation
+ <a name="geometry_index.r_tree.introduction.implementation_details"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.implementation_details">Implementation
 details</a>
 </h5>

 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>
@@ -211,7 +211,7 @@
</ul></div>
<h5>
<a name="geometry_index.r_tree.introduction.h1"></a>
- <a name="geometry_index.r_tree.introduction.dependencies"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.dependencies">Dependencies</a>
+ <a name="geometry_index.r_tree.introduction.dependencies"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.dependencies">Dependencies</a>
 </h5>

 R-tree depends on Boost.Move, Boost.Container, Boost.Tuple,
@@ -219,7 +219,7 @@
 
<h5>
<a name="geometry_index.r_tree.introduction.h2"></a>
- <a name="geometry_index.r_tree.introduction.contributors"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.contributors">Contributors</a>
+ <a name="geometry_index.r_tree.introduction.contributors"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.contributors">Contributors</a>
 </h5>

 The spatial index was originally started by Federico J. Fernandez during
@@ -227,7 +227,7 @@
 
<h5>
<a name="geometry_index.r_tree.introduction.h3"></a>
- <a name="geometry_index.r_tree.introduction.spatial_thanks"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.spatial_thanks">Spatial
+ <a name="geometry_index.r_tree.introduction.spatial_thanks"></a><a class="link" href="introduction.html#geometry_index.r_tree.introduction.spatial_thanks">Spatial
 thanks</a>
 </h5>

@@ -235,20 +235,20 @@
 J. Simonson for their support and ideas.
 
<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/queries.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/queries.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/queries.html 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>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">
@@ -33,8 +33,8 @@
 queries</a></dt>
<dt><a href="queries.html#geometry_index.r_tree.queries.nearest_neighbours_queries">Nearest
 neighbours queries</a></dt>
-<dt><a href="queries.html#geometry_index.r_tree.queries.satisfies_predicate">Satisfies
- predicate</a></dt>
+<dt><a href="queries.html#geometry_index.r_tree.queries.user_defined_unary_predicate">user-defined
+ unary predicate</a></dt>
<dt><a href="queries.html#geometry_index.r_tree.queries.passing_a_set_of_predicates">Passing
 a set of predicates</a></dt>
<dt><a href="queries.html#geometry_index.r_tree.queries.inserting_query_results_into_the_other_r_tree">Inserting
@@ -44,24 +44,24 @@
 Queries returns <code class="computeroutput">Value</code>s which meets some predicates. Currently
 supported are three types of predicates:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 spatial predicates - defining relationship between stored Values and
 some Geometry,
 </li>
<li class="listitem">
- nearest predicates - defining relationship between stored Values and
- some Point,
+ nearest predicate - defining relationship between stored Values and some
+ Point,
 </li>
<li class="listitem">
- satisfies predicate - allows to pass user-defined UnaryPredicate (function
- or function object) to the query.
+ user-defined unary predicate - function, function object or lambda expression
+ checking user-defined condition.
 </li>
</ul></div>

 For example queries may be used to retrieve Values:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 intersecting some area but not within other area,
 </li>
@@ -78,31 +78,28 @@
 a query</a>
</h4></div></div></div>

- There are three ways to perform a query. In the following example <code class="computeroutput">Box</code>
- is used as the predicate, this is a default spatial predicate described
- in the following section. Following queries returns <code class="computeroutput">Value</code>s
- intersecting some region defined as a <code class="computeroutput">Box</code>.
- These three ways are:
+ There are three ways to perform a query presented below. All of them returns
+ <code class="computeroutput">Value</code>s intersecting some region defined as a <code class="computeroutput">Box</code>.
 

 Method call
 
<pre class="programlisting">std::vector<Value> returned_values;
<a href="http://www.boost.org/libs/geometry/doc/html/geometry/reference/concepts/concept_box.html" target="_top">Box</a> box_region(...);
-rt.query(box_region, std::back_inserter(returned_values));
+rt.query(bgi::intersects(box_region), std::back_inserter(returned_values));
</pre>

 Function call
 
<pre class="programlisting">std::vector<Value> returned_values;
<a href="http://www.boost.org/libs/geometry/doc/html/geometry/reference/concepts/concept_box.html" target="_top">Box</a> box_region(...);
-index::query(rt, box_region, std::back_inserter(returned_values));
+index::query(rt, bgi::intersects(box_region), std::back_inserter(returned_values));
</pre>

 Use of pipe operator generating a range
 
<pre class="programlisting">Box box_region(...);
-BOOST_FOREACH(Value & v, rt | index::adaptors::queried(box_region))
+BOOST_FOREACH(Value & v, rt | index::adaptors::queried(bgi::intersects(box_region)))
 ; // do something with v
</pre>
</div>
@@ -113,7 +110,7 @@
</h4></div></div></div>

 Spatial query returns <code class="computeroutput">Value</code>s which are related somehow to
- a geometry or some number of geometries. Names of spatial predicates corresponds
+ some Geometry - box, polygon, etc. Names of spatial predicates corresponds
 to names of Boost.Geometry
 algorithms. Examples of some basic queries may be found in tables below.
 The query region and result <code class="computeroutput">Value</code>s
@@ -224,12 +221,10 @@
</tr></tbody>
</table></div>

- To use a spatial predicate one may pass a geometry (which is a default
- case) or use one of the functions defined in <code class="computeroutput">boost::geometry::index</code>
- namespace to define it explicitly.
+ To use a spatial predicate one may use one of the functions defined in
+ <code class="computeroutput">boost::geometry::index</code> namespace.
 
-<pre class="programlisting">rt.query(box, std::back_inserter(result)); // default case - intersects
-rt.query(index::intersects(box), std::back_inserter(result)); // the same as default
+<pre class="programlisting">rt.query(index::intersects(box), std::back_inserter(result));
rt.query(index::covered_by(box), std::back_inserter(result));
rt.query(index::disjont(box), std::back_inserter(result));
rt.query(index::overlaps(box), std::back_inserter(result));
@@ -250,10 +245,10 @@
</h4></div></div></div>

 Nearest neighbours queries returns <code class="computeroutput">Value</code>s which are closest
- to some point in space. Additionally it is possible to pass define how
- the distance to the <code class="computeroutput">Value</code>
- should be calculated. The examples of some knn queries may be found in
- the table below. All queries returns 5 closest <code class="computeroutput">Values</code>.
+ to some point in space. Additionally it is possible to define how the distance
+ to the <code class="computeroutput">Value</code> should be
+ calculated. The examples of some knn queries may be found in the table
+ below. All queries return 5 closest <code class="computeroutput">Values</code>.
 The query point and Values are orange.
 

@@ -314,23 +309,42 @@
</div>
<div class="section">
<div class="titlepage"><div><div><h4 class="title">
-<a name="geometry_index.r_tree.queries.satisfies_predicate"></a><a class="link" href="queries.html#geometry_index.r_tree.queries.satisfies_predicate" title="Satisfies predicate">Satisfies
- predicate</a>
+<a name="geometry_index.r_tree.queries.user_defined_unary_predicate"></a><a class="link" href="queries.html#geometry_index.r_tree.queries.user_defined_unary_predicate" title="user-defined unary predicate">user-defined
+ unary predicate</a>
</h4></div></div></div>

- There is a unique predicate <code class="computeroutput">index::satisfies(...)</code> taking user-defined function or function
- object which checks if <code class="computeroutput">Value</code> should be returned by the query.
- It may be used to check some specific conditions for user-defined Values.
+ The user may pass a <code class="computeroutput">UnaryPredicate</code>
+ - function, function object or lambda expression taking const reference
+ to Value and returning bool. This object may be passed to the query in
+ order to check if <code class="computeroutput">Value</code> should be returned by the query. To
+ do it one may use <code class="computeroutput">index::satisfies()</code> function like on the example below:
 
-<pre class="programlisting">bool fun(Value const& v)
+<pre class="programlisting">bool is_red(Value const& v)
{
 return v.is_red();
}

+struct is_red_o
+{
+ template <typename Value>
+ bool operator()(Value const& v)
+ {
+ return v.is_red();
+ }
+}
+
// ...

-rt.query(index::intersects(box) && index::satisfies(fun),
+rt.query(index::intersects(box) && index::satisfies(is_red),
+ std::back_inserter(result));
+
+rt.query(index::intersects(box) && index::satisfies(is_red_o()),
+ std::back_inserter(result));
+
+#ifndef BOOST_NO_CXX11_LAMBDAS
+rt.query(index::intersects(box) && index::satisfies([](Value const& v) { return v.is_red(); }),
 std::back_inserter(result));
+#endif
</pre>
</div>
<div class="section">
@@ -387,7 +401,7 @@
/* some inserting into the tree */

std::vector<Value> result;
-rt1.query(Box(/*...*/), std::back_inserter(result));
+rt1.query(bgi::intersects(Box(/*...*/)), std::back_inserter(result));
RTree rt2(result.begin(), result.end());
</pre>

@@ -397,14 +411,14 @@
 query results because temporary container won't be used.
 
<pre class="programlisting">RTree rt3;
-rt1.query(Box(/*...*/), bgi::inserter(rt3));
+rt1.query(bgi::intersects(Box(/*...*/))), bgi::inserter(rt3));
</pre>

 If you like Boost.Range you'll appreciate the third option. You may pass
 the result Range directly to the constructor. However in this case the
 temporary container is created.
 
-<pre class="programlisting">RTree rt4(rt1 | bgi::adaptors::queried(Box(/*...*/)));
+<pre class="programlisting">RTree rt4(rt1 | bgi::adaptors::queried(bgi::intersects(Box(/*...*/)))));
</pre>
</div>
</div>

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-03-01 13:14:46 EST (Fri, 01 Mar 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="rtree_examples.html" title="Examples">
@@ -50,7 +50,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.description">Description</a>
 </h6>

 This is self-balancing spatial index capable to store various types of
@@ -58,7 +58,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters">Parameters</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters">Parameters</a>
 </h6>

 The user must pass a type defining the Parameters which will be used in
@@ -68,7 +68,7 @@

 Predefined algorithms with compile-time parameters are:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#structboost_1_1geometry_1_1index_1_1linear">boost::geometry::index::linear</a></code>,
 </li>
@@ -82,7 +82,7 @@

 Predefined algorithms with run-time parameters are:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1dynamic__linear">boost::geometry::index::dynamic_linear</a></code>,
 </li>
@@ -95,7 +95,7 @@
</ul></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator">Translator</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator">Translator</a>
 </h6>

 The Translator translates from Value to Indexable each time r-tree requires
@@ -112,14 +112,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.header">Header</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/rtree.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Parameters</code><code class="computeroutput">,</code>
@@ -132,7 +132,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h5"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -206,7 +206,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h6"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.typedef_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.typedef_s_">Typedef(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.typedef_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.typedef_s_">Typedef(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -314,7 +314,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h7"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.constructor_s__and_destructor">Constructor(s)
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.constructor_s__and_destructor">Constructor(s)
 and destructor</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -457,7 +457,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.h8"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.member_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.member_s_">Member(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.member_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.member_s_">Member(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -780,13 +780,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af85d4e399a807b3e4e46d38a0b4ffc5a">parameters_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">parameters</code> = <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af85d4e399a807b3e4e46d38a0b4ffc5a">parameters_type</a></code><code class="computeroutput">()</code><code class="computeroutput">,</code> <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1adbc30a1fa986e2e856e0662111ac2d91">translator_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">translator</code> = <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1adbc30a1fa986e2e856e0662111ac2d91">translator_type</a></code><code class="computeroutput">()</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -795,7 +795,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -861,7 +861,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree__.throws">Throws</a>
 </h6>

 If allocator default constructor throws.
@@ -877,7 +877,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af85d4e399a807b3e4e46d38a0b4ffc5a">parameters_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">parameters</code><code class="computeroutput">,</code>
 <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1adbc30a1fa986e2e856e0662111ac2d91">translator_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">translator</code><code class="computeroutput">,</code>
@@ -885,7 +885,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -968,7 +968,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_parameters_type_const____translator_type_const____allocator_type_.throws">Throws</a>
 </h6>

 If allocator copy constructor throws.
@@ -984,7 +984,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Iterator</code><code class="computeroutput">></code>
<code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="computeroutput">Iterator</code> <code class="computeroutput">first</code><code class="computeroutput">,</code>
@@ -995,7 +995,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1112,9 +1112,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_iterator__iterator_.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If allocator copy constructor throws.
 </li>
@@ -1139,7 +1139,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Range</code><code class="computeroutput">></code>
<code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="computeroutput">Range const &</code> <code class="computeroutput">rng</code><code class="computeroutput">,</code>
@@ -1149,7 +1149,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.modifier_s_">Modifier(s)</a>
 </h6>


@@ -1158,7 +1158,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1259,9 +1259,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_range_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If allocator copy constructor throws.
 </li>
@@ -1285,13 +1285,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">~rtree</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree._rtree__.throws">Throws</a>
 </h6>

 Nothing.
@@ -1307,20 +1307,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.description">Description</a>
 </h6>

 It uses parameters, translator and allocator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">src</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1366,9 +1366,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If allocator copy constructor throws.
 </li>
@@ -1393,20 +1393,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.description">Description</a>
 </h6>

 It uses Parameters and translator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">src</code><code class="computeroutput">,</code> <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a9d35bc38fa697c6f600548fb5b38807d">allocator_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">allocator</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1472,9 +1472,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_const____allocator_type_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If allocator copy constructor throws.
 </li>
@@ -1499,20 +1499,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.description">Description</a>
 </h6>

 It uses parameters, translator and allocator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &&</code> <code class="computeroutput">src</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1558,7 +1558,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree____.throws">Throws</a>
 </h6>

 Nothing.
@@ -1574,20 +1574,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.description">Description</a>
 </h6>

 It uses parameters and translator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">rtree</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &&</code> <code class="computeroutput">src</code><code class="computeroutput">,</code> <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a9d35bc38fa697c6f600548fb5b38807d">allocator_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">allocator</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1653,9 +1653,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.rtree_rtree_____allocator_type_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If allocator copy constructor throws.
 </li>
@@ -1681,20 +1681,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.description">Description</a>
 </h6>

 It uses parameters and translator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &</code> <code class="computeroutput">operator=</code><code class="computeroutput">(</code><code class="computeroutput">const </code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &</code> <code class="computeroutput">src</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1740,9 +1740,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__const_rtree___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor throws.
 </li>
@@ -1764,20 +1764,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.description">Description</a>
 </h6>

 It uses parameters and translator from the source tree.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &</code> <code class="computeroutput">operator=</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &&</code> <code class="computeroutput">src</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1823,12 +1823,12 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.operator__rtree____.throws">Throws</a>
 </h6>

 Only if allocators aren't equal.
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor throws.
 </li>
@@ -1850,20 +1850,20 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.description">Description</a>
 </h6>

 Parameters, translator and allocators are swapped as well.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">void</code> <code class="computeroutput">swap</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree">rtree</a></code><code class="computeroutput"> &</code> <code class="computeroutput">other</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1909,7 +1909,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.swap_rtree___.throws">Throws</a>
 </h6>

 If allocators swap throws.
@@ -1925,13 +1925,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">void</code> <code class="computeroutput">insert</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a9979db9ef37591985256cb8ad31862bb">value_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">value</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -1977,9 +1977,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_value_type_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2012,14 +2012,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Iterator</code><code class="computeroutput">></code>
<code class="computeroutput">void</code> <code class="computeroutput">insert</code><code class="computeroutput">(</code><code class="computeroutput">Iterator</code> <code class="computeroutput">first</code><code class="computeroutput">,</code> <code class="computeroutput">Iterator</code> <code class="computeroutput">last</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2083,9 +2083,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_iterator__iterator_.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2118,14 +2118,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Range</code><code class="computeroutput">></code>
<code class="computeroutput">void</code> <code class="computeroutput">insert</code><code class="computeroutput">(</code><code class="computeroutput">Range const &</code> <code class="computeroutput">rng</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2171,9 +2171,9 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.insert_range_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2206,7 +2206,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.description">Description</a>
 </h6>

 In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code>
@@ -2215,13 +2215,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">remove</code><code class="computeroutput">(</code><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a9979db9ef37591985256cb8ad31862bb">value_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">value</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2267,16 +2267,16 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.returns">Returns</a>
 </h6>

 1 if the value was removed, 0 otherwise.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_value_type_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2309,7 +2309,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.description">Description</a>
 </h6>

 In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code>
@@ -2320,14 +2320,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Iterator</code><code class="computeroutput">></code>
<code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">remove</code><code class="computeroutput">(</code><code class="computeroutput">Iterator</code> <code class="computeroutput">first</code><code class="computeroutput">,</code> <code class="computeroutput">Iterator</code> <code class="computeroutput">last</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2391,16 +2391,16 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.returns">Returns</a>
 </h6>

 The number of removed values.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_iterator__iterator_.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2433,7 +2433,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.description">Description</a>
 </h6>

 In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code>
@@ -2443,14 +2443,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Range</code><code class="computeroutput">></code>
<code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">remove</code><code class="computeroutput">(</code><code class="computeroutput">Range const &</code> <code class="computeroutput">rng</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2496,16 +2496,16 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.returns">Returns</a>
 </h6>

 The number of removed values.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.remove_range_const___.throws">Throws</a>
 </h6>
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 If Value copy constructor or copy assignment throws.
 </li>
@@ -2539,7 +2539,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.description">Description</a>
 </h6>

 This query function performs spatial and k-nearest neighbor searches.
@@ -2550,12 +2550,9 @@
 Spatial predicates
 

- The simplest form of spatial predicate is a <code class="literal"><code class="computeroutput">Geometry</code></code>.
- In this case Values intersecting the <code class="literal"><code class="computeroutput">Geometry</code></code>
- are returned. More spatial predicates may be generated by one of the
- functions listed below:
+ Spatial predicates may be generated by one of the functions listed below:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
@@ -2563,8 +2560,7 @@
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga351bb3b82e019ff45adf789385b8007d">boost::geometry::index::disjoint()</a></code>,
 </li>
<li class="listitem">
- <code class="literal"><a class="link" href="reference.html#group__predicates_1ga7301c50e0272976b9f1434536383e6d0">boost::geometry::index::intersects()</a></code>
- - default,
+ <code class="literal"><a class="link" href="reference.html#group__predicates_1ga7301c50e0272976b9f1434536383e6d0">boost::geometry::index::intersects()</a></code>,
 </li>
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga5511236f56be1defcccbf11e742ccd88">boost::geometry::index::overlaps()</a></code>,
@@ -2576,7 +2572,7 @@

 It is possible to negate spatial predicates:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
@@ -2594,15 +2590,15 @@
 </li>
</ul></div>

- Value predicate
+ Satisfies predicate
 

 This is a special kind of predicate which allows to pass a user-defined
- functor which checks if Value should be returned by the query. It's generated
- by:
+ function or function object which checks if Value should be returned
+ by the query. It's generated by:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
- <code class="literal"><code class="computeroutput">boost::geometry::index::value()</code></code>.
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+ <code class="literal"><a class="link" href="reference.html#group__predicates_1gae7e9291c5b99041fb155d29de0860bab">boost::geometry::index::satisfies()</a></code>.
 </li></ul></div>

 Nearest predicate
@@ -2613,7 +2609,7 @@
 iterator. Only one nearest predicate may be passed to the query. It may
 be generated by:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1gae80a2c204673a8b11c4fc137cfff6556">boost::geometry::index::nearest()</a></code>.
 </li></ul></div>

@@ -2624,14 +2620,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Predicates</code><code class="computeroutput">,</code> <code class="computeroutput">typename OutIter</code><code class="computeroutput">></code>
<code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">query</code><code class="computeroutput">(</code><code class="computeroutput">Predicates const &</code> <code class="computeroutput">predicates</code><code class="computeroutput">,</code> <code class="computeroutput">OutIter</code> <code class="computeroutput">out_it</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.modifier_s_">Modifier(s)</a>
 </h6>


@@ -2640,7 +2636,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2704,19 +2700,19 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.returns">Returns</a>
 </h6>

 The number of values found.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h5"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.example">Example</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.example">Example</a>
 </h6>


<pre class="programlisting">// return elements intersecting box
-tree.query(box, std::back_inserter(result));
+tree.query(bgi::intersects(box), std::back_inserter(result));
// return elements intersecting poly but not within box
tree.query(bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
// return elements overlapping box and meeting my_fun unary predicate
@@ -2730,7 +2726,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.h6"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.query_predicates_const____outiter_.throws">Throws</a>
 </h6>

 If Value copy constructor or copy assignment throws.
@@ -2755,13 +2751,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">size</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -2770,14 +2766,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.returns">Returns</a>
 </h6>

 The number of stored values.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.size__.throws">Throws</a>
 </h6>

 Nothing.
@@ -2792,13 +2788,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">bool</code> <code class="computeroutput">empty</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -2807,14 +2803,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.returns">Returns</a>
 </h6>

 true if the container is empty.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.empty__.throws">Throws</a>
 </h6>

 Nothing.
@@ -2829,13 +2825,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">void</code> <code class="computeroutput">clear</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.clear__.throws">Throws</a>
 </h6>

 Nothing.
@@ -2850,7 +2846,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.description">Description</a>
 </h6>

 Returns the box able to contain all values stored in the container. If
@@ -2858,13 +2854,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a653555282525601512c3b1bed1e9590f">bounds_type</a></code> <code class="computeroutput">bounds</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -2873,7 +2869,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.returns">Returns</a>
 </h6>

 The box able to contain all values stored in the container or an invalid
@@ -2881,7 +2877,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.bounds__.throws">Throws</a>
 </h6>

 Nothing.
@@ -2897,7 +2893,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.description">Description</a>
 </h6>

 For indexable_type it returns the number of values which indexables equals
@@ -2906,14 +2902,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename ValueOrIndexable</code><code class="computeroutput">></code>
<code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6">size_type</a></code> <code class="computeroutput">count</code><code class="computeroutput">(</code><code class="computeroutput">ValueOrIndexable const &</code> <code class="computeroutput">vori</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.modifier_s_">Modifier(s)</a>
 </h6>


@@ -2922,7 +2918,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -2968,14 +2964,14 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.returns">Returns</a>
 </h6>

 The number of values found.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.h5"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.count_valueorindexable_const___.throws">Throws</a>
 </h6>

 Nothing.
@@ -2990,13 +2986,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af85d4e399a807b3e4e46d38a0b4ffc5a">parameters_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">parameters</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -3005,14 +3001,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.returns">Returns</a>
 </h6>

 The parameters object.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.parameters__.throws">Throws</a>
 </h6>

 Nothing.
@@ -3027,13 +3023,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1adbc30a1fa986e2e856e0662111ac2d91">translator_type</a></code><code class="computeroutput"> const &</code> <code class="computeroutput">translator</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -3042,14 +3038,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.returns">Returns</a>
 </h6>

 The translator object.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.translator__.throws">Throws</a>
 </h6>

 Nothing.
@@ -3064,13 +3060,13 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a9d35bc38fa697c6f600548fb5b38807d">allocator_type</a></code> <code class="computeroutput">get_allocator</code><code class="computeroutput">()</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.modifier_s_">Modifier(s)</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.modifier_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.modifier_s_">Modifier(s)</a>
 </h6>


@@ -3079,14 +3075,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.returns">Returns</a>
 </h6>

 The allocator.
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__rtree.get_allocator__.throws">Throws</a>
 </h6>

 If allocator copy constructor throws.
@@ -3100,7 +3096,7 @@
</h4></div></div></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.functions">Functions</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.functions">Functions</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -3296,7 +3292,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af6d5bd81e46cb4ff89277c753133664c">rtree::insert(value_type
@@ -3304,7 +3300,7 @@
 
<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___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3314,7 +3310,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________value_const___.parameter_s_"></a><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">
<colgroup>
@@ -3393,7 +3389,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5263a3faac7b4f0090d4ad1d44cc540d">rtree::insert(Iterator,
@@ -3401,7 +3397,7 @@
 
<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_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3414,7 +3410,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________iterator__iterator_.parameter_s_"></a><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">
<colgroup>
@@ -3509,7 +3505,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1abb624abd9268b41e815d40342b2634c2">rtree::insert(Range
@@ -3517,7 +3513,7 @@
 
<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___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3528,7 +3524,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.insert_rtree_________range_const___.parameter_s_"></a><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">
<colgroup>
@@ -3607,7 +3603,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.description">Description</a>
 </h6>

 Remove a value from the container. In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code> or <code class="literal"><code class="computeroutput">std::map erase()</code></code> method this function removes
@@ -3619,7 +3615,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3629,7 +3625,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -3699,7 +3695,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________value_const___.returns">Returns</a>
 </h6>

 1 if value was removed, 0 otherwise.
@@ -3715,7 +3711,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.description">Description</a>
 </h6>

 Remove a range of values from the container. In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code> or <code class="literal"><code class="computeroutput">std::map erase()</code></code> method it doesn't take iterators
@@ -3729,7 +3725,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3742,7 +3738,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -3828,7 +3824,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________iterator__iterator_.returns">Returns</a>
 </h6>

 The number of removed values.
@@ -3844,7 +3840,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.description">Description</a>
 </h6>

 Remove a range of values from the container. In contrast to the <code class="literal"><code class="computeroutput">std::set</code></code> or <code class="literal"><code class="computeroutput">std::map erase()</code></code> method it removes values
@@ -3857,7 +3853,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -3868,7 +3864,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -3938,7 +3934,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.remove_rtree_________range_const___.returns">Returns</a>
 </h6>

 The number of removed values.
@@ -3955,7 +3951,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.description">Description</a>
 </h6>

 This query function performs spatial and k-nearest neighbor searches.
@@ -3966,12 +3962,9 @@
 Spatial predicates
 

- The simplest form of spatial predicate is a <code class="literal"><code class="computeroutput">Geometry</code></code>.
- In this case Values intersecting the <code class="literal"><code class="computeroutput">Geometry</code></code>
- are returned. More spatial predicates may be generated by one of the
- functions listed below:
+ Spatial predicates may be generated by one of the functions listed below:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
@@ -3979,8 +3972,7 @@
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga351bb3b82e019ff45adf789385b8007d">boost::geometry::index::disjoint()</a></code>,
 </li>
<li class="listitem">
- <code class="literal"><a class="link" href="reference.html#group__predicates_1ga7301c50e0272976b9f1434536383e6d0">boost::geometry::index::intersects()</a></code>
- - default,
+ <code class="literal"><a class="link" href="reference.html#group__predicates_1ga7301c50e0272976b9f1434536383e6d0">boost::geometry::index::intersects()</a></code>,
 </li>
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga5511236f56be1defcccbf11e742ccd88">boost::geometry::index::overlaps()</a></code>,
@@ -3992,7 +3984,7 @@

 It is possible to negate spatial predicates:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
@@ -4010,15 +4002,15 @@
 </li>
</ul></div>

- Value predicate
+ Satisfies predicate
 

 This is a special kind of predicate which allows to pass a user-defined
- functor which checks if Value should be returned by the query. It's generated
- by:
+ function or function object which checks if Value should be returned
+ by the query. It's generated by:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
- <code class="literal"><code class="computeroutput">boost::geometry::index::value()</code></code>.
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
+ <code class="literal"><a class="link" href="reference.html#group__predicates_1gae7e9291c5b99041fb155d29de0860bab">boost::geometry::index::satisfies()</a></code>.
 </li></ul></div>

 Nearest predicate
@@ -4029,7 +4021,7 @@
 iterator. Only one nearest predicate may be passed to the query. It may
 be generated by:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc"><li class="listitem">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1gae80a2c204673a8b11c4fc137cfff6556">boost::geometry::index::nearest()</a></code>.
 </li></ul></div>

@@ -4040,7 +4032,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4054,7 +4046,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -4140,19 +4132,19 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.returns">Returns</a>
 </h6>

 The number of values found.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h4"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.example">Example</a>
 </h6>


<pre class="programlisting">// return elements intersecting box
-bgi::query(tree, box, std::back_inserter(result));
+bgi::query(tree, bgi::intersects(box), std::back_inserter(result));
// return elements intersecting poly but not within box
bgi::query(tree, bgi::intersects(poly) && !bgi::within(box), std::back_inserter(result));
// return elements overlapping box and meeting my_fun value predicate
@@ -4166,7 +4158,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.h5"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.throws">Throws</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.throws"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.query_rtree______const____predicates_const____outiter_.throws">Throws</a>
 </h6>

 If Value copy constructor or copy assignment throws.
@@ -4192,14 +4184,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1ae6027e42d28a4bf93e74b055c79e6b09">rtree::clear()</a></code>.
 
<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________.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4209,7 +4201,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.clear_rtree________.parameter_s_"></a><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">
<colgroup>
@@ -4268,14 +4260,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a89561a834563f2ed6fc782bad16143fd">rtree::size()</a></code>.
 
<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___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4285,7 +4277,7 @@
</pre>
<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___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.parameter_s_"></a><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">
<colgroup>
@@ -4335,7 +4327,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.size_rtree______const___.returns">Returns</a>
 </h6>

 The number of values stored in the index.
@@ -4351,14 +4343,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1ae889567443b0ba0dbdb975564c55804c">rtree::empty()</a></code>.
 
<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___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.synopsis"></a><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">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4368,7 +4360,7 @@
</pre>
<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___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.parameter_s_"></a><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">
<colgroup>
@@ -4418,7 +4410,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.empty_rtree______const___.returns">Returns</a>
 </h6>

 true if there are no values in the index.
@@ -4435,14 +4427,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.description">Description</a>
 </h6>

 It calls <code class="literal"><code class="computeroutput">rtree::envelope()</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4452,7 +4444,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -4502,7 +4494,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.bounds_rtree______const___.returns">Returns</a>
 </h6>

 The box containing all stored values or an invalid box.
@@ -4518,14 +4510,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.h0"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.description">Description</a>
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1aad0285d25f96341a8dd6cc22feb3bd73">rtree::swap()</a></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.h1"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">,</code>
 <code class="computeroutput">typename Options</code><code class="computeroutput">,</code>
@@ -4535,7 +4527,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.h2"></a>
- <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__rtree__functions.swap_rtree_________rtree________.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -4623,14 +4615,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">size_t MaxElements</code><code class="computeroutput">,</code> <code class="computeroutput">size_t MinElements</code><code class="computeroutput">></code>
<code class="computeroutput">struct linear</code>
@@ -4640,7 +4632,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__linear.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -4697,14 +4689,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">size_t MaxElements</code><code class="computeroutput">,</code> <code class="computeroutput">size_t MinElements</code><code class="computeroutput">></code>
<code class="computeroutput">struct quadratic</code>
@@ -4714,7 +4706,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__quadratic.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -4771,14 +4763,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">size_t MaxElements</code><code class="computeroutput">,</code>
 <code class="computeroutput">size_t MinElements</code><code class="computeroutput">,</code>
@@ -4791,7 +4783,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__rstar.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -4874,14 +4866,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">class dynamic_linear</code>
<code class="computeroutput">{</code>
@@ -4890,7 +4882,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.constructor_s__and_destructor">Constructor(s)
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.constructor_s__and_destructor">Constructor(s)
 and destructor</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -4933,11 +4925,11 @@
 The constructor.
 
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.synopsis">Synopsis</a>
 </h7><pre class="programlisting"><code class="computeroutput">dynamic_linear</code><code class="computeroutput">(</code><code class="computeroutput">size_t</code> <code class="computeroutput">max_elements</code><code class="computeroutput">,</code> <code class="computeroutput">size_t</code> <code class="computeroutput">min_elements</code><code class="computeroutput">)</code>
</pre>
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_linear.dynamic_linear_size_t__size_t_.parameter_s_">Parameter(s)</a>
 </h7><div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -5009,14 +5001,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">class dynamic_quadratic</code>
<code class="computeroutput">{</code>
@@ -5025,7 +5017,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.constructor_s__and_destructor">Constructor(s)
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.constructor_s__and_destructor">Constructor(s)
 and destructor</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5068,11 +5060,11 @@
 The constructor.
 
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.synopsis">Synopsis</a>
 </h7><pre class="programlisting"><code class="computeroutput">dynamic_quadratic</code><code class="computeroutput">(</code><code class="computeroutput">size_t</code> <code class="computeroutput">max_elements</code><code class="computeroutput">,</code> <code class="computeroutput">size_t</code> <code class="computeroutput">min_elements</code><code class="computeroutput">)</code>
</pre>
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_quadratic.dynamic_quadratic_size_t__size_t_.parameter_s_">Parameter(s)</a>
 </h7><div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -5144,14 +5136,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.header">Header</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/parameters.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">class dynamic_rstar</code>
<code class="computeroutput">{</code>
@@ -5160,7 +5152,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.h2"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.constructor_s__and_destructor">Constructor(s)
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.constructor_s__and_destructor"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.constructor_s__and_destructor">Constructor(s)
 and destructor</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5203,14 +5195,14 @@
 The constructor.
 
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.h0"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.synopsis">Synopsis</a>
 </h7><pre class="programlisting"><code class="computeroutput">dynamic_rstar</code><code class="computeroutput">(</code><code class="computeroutput">size_t</code> <code class="computeroutput">max_elements</code><code class="computeroutput">,</code>
 <code class="computeroutput">size_t</code> <code class="computeroutput">min_elements</code><code class="computeroutput">,</code>
 <code class="computeroutput">size_t</code> <code class="computeroutput">overlap_cost_threshold</code> = <code class="computeroutput">0</code><code class="computeroutput">,</code>
 <code class="computeroutput">size_t</code> <code class="computeroutput">reinserted_elements</code> = <code class="computeroutput">detail::default_rstar_reinserted_elements_d()</code><code class="computeroutput">)</code>
</pre>
<h7><a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.h1"></a>
- <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost__geometry__index__dynamic_rstar.dynamic_rstar_size_t__size_t_.parameter_s_">Parameter(s)</a>
 </h7><div class="informaltable"><table class="table">
<colgroup>
<col>
@@ -5319,7 +5311,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__translator.h0"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.description">Description</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.description">Description</a>
 </h6>

 It translates Value object to Indexable object. The default version handles
@@ -5328,14 +5320,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__translator.h1"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.header">Header</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.header"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.header">Header</a>
 </h6>

 <code class="computeroutput">#include <boost/geometry/index/translator.hpp></code>
 
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__translator.h2"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Value</code><code class="computeroutput">></code>
<code class="computeroutput">struct translator</code>
@@ -5345,7 +5337,7 @@
</pre>
<h6>
<a name="geometry_index.r_tree.reference.boost__geometry__index__translator.h3"></a>
- <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.boost__geometry__index__translator.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost__geometry__index__translator.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5386,7 +5378,7 @@
</h4></div></div></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.functions">Functions</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.functions">Functions</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -5517,7 +5509,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.description">Description</a>
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
@@ -5525,14 +5517,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Geometry</code><code class="computeroutput">></code>
<code class="computeroutput">detail::covered_by<Geometry> boost::geometry::index::covered_by</code><code class="computeroutput">(</code><code class="computeroutput">Geometry const &</code> <code class="computeroutput">g</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5567,7 +5559,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -5613,7 +5605,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.example">Example</a>
 </h6>


@@ -5633,7 +5625,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.description">Description</a>
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
@@ -5641,14 +5633,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Geometry</code><code class="computeroutput">></code>
<code class="computeroutput">detail::disjoint<Geometry> boost::geometry::index::disjoint</code><code class="computeroutput">(</code><code class="computeroutput">Geometry const &</code> <code class="computeroutput">g</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5683,7 +5675,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -5729,7 +5721,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.example">Example</a>
 </h6>


@@ -5749,7 +5741,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.description">Description</a>
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
@@ -5757,14 +5749,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Geometry</code><code class="computeroutput">></code>
<code class="computeroutput">detail::intersects<Geometry> boost::geometry::index::intersects</code><code class="computeroutput">(</code><code class="computeroutput">Geometry const &</code> <code class="computeroutput">g</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5799,7 +5791,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -5845,7 +5837,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.example">Example</a>
 </h6>


@@ -5867,7 +5859,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.description">Description</a>
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
@@ -5875,14 +5867,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Geometry</code><code class="computeroutput">></code>
<code class="computeroutput">detail::overlaps<Geometry> boost::geometry::index::overlaps</code><code class="computeroutput">(</code><code class="computeroutput">Geometry const &</code> <code class="computeroutput">g</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -5917,7 +5909,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -5963,7 +5955,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.example">Example</a>
 </h6>


@@ -5983,7 +5975,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.description">Description</a>
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
@@ -5991,14 +5983,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Geometry</code><code class="computeroutput">></code>
<code class="computeroutput">detail::within<Geometry> boost::geometry::index::within</code><code class="computeroutput">(</code><code class="computeroutput">Geometry const &</code> <code class="computeroutput">g</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -6033,7 +6025,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6079,7 +6071,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.within_geometry_const___.example">Example</a>
 </h6>


@@ -6099,7 +6091,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.description">Description</a>
 </h6>

 A wrapper around user-defined UnaryPredicate checking if Value should
@@ -6107,14 +6099,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename UnaryPredicate</code><code class="computeroutput">></code>
<code class="computeroutput">detail::satisfies<UnaryPredicate> boost::geometry::index::satisfies</code><code class="computeroutput">(</code><code class="computeroutput">UnaryPredicate const &</code> <code class="computeroutput">pred</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -6149,7 +6141,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6194,13 +6186,28 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.h4"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.satisfies_unarypredicate_const___.example">Example</a>
 </h6>


-<pre class="programlisting">bool is_red(Value const& v) { ... }
-...
-bgi::query(spatial_index, bgi::intersects(box) && bgi::satisfies(is_red), std::back_inserter(result));
+<pre class="programlisting">bool is_red(Value const& v) { return v.is_red(); }
+
+struct is_red_o {
+template <typename Value> bool operator()(Value const& v) { return v.is_red(); }
+}
+
+// ...
+
+rt.query(index::intersects(box) && index::satisfies(is_red),
+std::back_inserter(result));
+
+rt.query(index::intersects(box) && index::satisfies(is_red_o()),
+std::back_inserter(result));
+
+#ifndef BOOST_NO_CXX11_LAMBDAS
+rt.query(index::intersects(box) && index::satisfies([](Value const& v) { return v.is_red(); }),
+std::back_inserter(result));
+#endif
</pre>

 
@@ -6216,7 +6223,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.h0"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.description">Description</a>
 </h6>

 When nearest predicate is passed to the query, k-nearest neighbour search
@@ -6230,7 +6237,7 @@
 is calculated. This is done by passing PointRelation. It can be generated
 by following functions:
 
-<div class="itemizedlist"><ul class="itemizedlist" type="disc">
+<div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; ">
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__nearest__relations_1gace3c7dbc60840c2a61da36e975d56636">boost::geometry::index::to_nearest()</a></code>
 - default,
@@ -6244,14 +6251,14 @@
</ul></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.h1"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename PointOrRelation</code><code class="computeroutput">></code>
<code class="computeroutput">detail::nearest<PointOrRelation> boost::geometry::index::nearest</code><code class="computeroutput">(</code><code class="computeroutput">PointOrRelation const &</code> <code class="computeroutput">point_relation</code><code class="computeroutput">,</code> <code class="computeroutput">unsigned</code> <code class="computeroutput">k</code><code
class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.h2"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6315,7 +6322,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.h3"></a>
- <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.example">Example</a>
+ <a name="geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.example"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__predicates.nearest_pointorrelation_const____unsigned_.example">Example</a>
 </h6>


@@ -6344,7 +6351,7 @@
</h4></div></div></div>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.h0"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.functions">Functions</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.functions">Functions</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6419,7 +6426,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.description">Description</a>
 </h6>

 Generate a nearest query Point and Value's Indexable relationship while
@@ -6432,14 +6439,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename T</code><code class="computeroutput">></code>
<code class="computeroutput">detail::to_nearest<T> boost::geometry::index::to_nearest</code><code class="computeroutput">(</code><code class="computeroutput">T const &</code> <code class="computeroutput">v</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -6475,7 +6482,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_nearest_t_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6531,7 +6538,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.description">Description</a>
 </h6>

 Generate a nearest query Point and Value's Indexable relationship while
@@ -6542,14 +6549,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename T</code><code class="computeroutput">></code>
<code class="computeroutput">detail::to_centroid<T> boost::geometry::index::to_centroid</code><code class="computeroutput">(</code><code class="computeroutput">T const &</code> <code class="computeroutput">v</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -6585,7 +6592,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_centroid_t_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6641,7 +6648,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.description">Description</a>
 </h6>

 Generate a nearest query Point and Value's Indexable relationship while
@@ -6654,14 +6661,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename T</code><code class="computeroutput">></code>
<code class="computeroutput">detail::to_furthest<T> boost::geometry::index::to_furthest</code><code class="computeroutput">(</code><code class="computeroutput">T const &</code> <code class="computeroutput">v</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.template_parameter_s_">Template
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.template_parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.template_parameter_s_">Template
 parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
@@ -6697,7 +6704,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__nearest__relations.to_furthest_t_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6750,7 +6757,7 @@
</h4></div></div></div>
<h6>
<a name="geometry_index.r_tree.reference.group__adaptors.h0"></a>
- <a name="geometry_index.r_tree.reference.group__adaptors.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.functions">Functions</a>
+ <a name="geometry_index.r_tree.reference.group__adaptors.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.functions">Functions</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6793,14 +6800,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Predicates</code><code class="computeroutput">></code>
<code class="computeroutput">detail::query<Predicates> boost::geometry::index::adaptors::queried</code><code class="computeroutput">(</code><code class="computeroutput">Predicates const &</code> <code class="computeroutput">pred</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__adaptors.queried_predicates_const___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6852,7 +6859,7 @@
</h4></div></div></div>
<h6>
<a name="geometry_index.r_tree.reference.group__inserters.h0"></a>
- <a name="geometry_index.r_tree.reference.group__inserters.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.functions">Functions</a>
+ <a name="geometry_index.r_tree.reference.group__inserters.functions"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.functions">Functions</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6894,7 +6901,7 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.h0"></a>
- <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.description">Description</a>
+ <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.description">Description</a>
 </h6>

 Returns insert iterator capable to insert values to the container (spatial
@@ -6902,14 +6909,14 @@
 
<h6>
<a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.h1"></a>
- <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.synopsis">Synopsis</a>
+ <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.synopsis"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.synopsis">Synopsis</a>
 </h6>
<pre class="programlisting"><code class="computeroutput">template<</code><code class="computeroutput">typename Container</code><code class="computeroutput">></code>
<code class="computeroutput">insert_iterator<Container> boost::geometry::index::inserter</code><code class="computeroutput">(</code><code class="computeroutput">Container &</code> <code class="computeroutput">c</code><code class="computeroutput">)</code>
</pre>
<h6>
<a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.h2"></a>
- <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.parameter_s_">Parameter(s)</a>
+ <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.parameter_s_"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.parameter_s_">Parameter(s)</a>
 </h6>
<div class="informaltable"><table class="table">
<colgroup>
@@ -6955,7 +6962,7 @@
</table></div>
<h6>
<a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.h3"></a>
- <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.returns">Returns</a>
+ <a name="geometry_index.r_tree.reference.group__inserters.inserter_container___.returns"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.group__inserters.inserter_container___.returns">Returns</a>
 </h6>

 The insert iterator inserting values to the container.

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_examples.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_examples.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/rtree_examples.html 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -3,7 +3,7 @@
<meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
<title>Examples</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="queries.html" title="Queries">
@@ -86,7 +86,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -179,7 +179,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -264,7 +264,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -404,7 +404,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -493,7 +493,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -588,7 +588,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;
@@ -699,7 +699,7 @@
 std::cout << "Child: Querying for objects intersecting box = [(45, 45)(55, 55)]\n";

 std::vector<B> result;
- unsigned k = tree->query(B(P(45, 45), P(55, 55)), std::back_inserter(result));
+ unsigned k = tree->query(bgi::intersects(B(P(45, 45), P(55, 55))), std::back_inserter(result
));

 std::cout << "Child: Found objects:\n";
 std::cout << k << "\n";

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-03-01 13:14:46 EST (Fri, 01 Mar 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">
@@ -116,7 +116,7 @@
<pre class="programlisting">// find values intersecting some area defined by a box
box query_box(point(0, 0), point(5, 5));
std::vector<value> result_s;
-rtree.query(query_box, std::back_inserter(result_s));
+rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));
</pre>

 
@@ -156,7 +156,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/index.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/index.html (original)
+++ sandbox-branches/geometry/index/doc/html/index.html 2013-03-01 13:14:46 EST (Fri, 01 Mar 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>
@@ -51,7 +51,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: March 01, 2013 at 02:58:06 GMT</td>
+<td align="left">Last revised: March 01, 2013 at 18:11:11 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: sandbox-branches/geometry/index/doc/rtree/query.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/rtree/query.qbk (original)
+++ sandbox-branches/geometry/index/doc/rtree/query.qbk 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -13,8 +13,8 @@
Queries returns `__value__`s which meets some predicates. Currently supported are three types of predicates:

* spatial predicates - defining relationship between stored Values and some Geometry,
-* nearest predicates - defining relationship between stored Values and some Point,
-* satisfies predicate - allows to pass user-defined UnaryPredicate (function or function object) to the query.
+* nearest predicate - defining relationship between stored Values and some Point,
+* user-defined unary predicate - function, function object or lambda expression checking user-defined condition.

For example queries may be used to retrieve Values:

@@ -24,34 +24,32 @@

[section Performing a query]

-There are three ways to perform a query. In the following example `__box__` is used as
-the predicate, this is a default spatial predicate described in the following section.
-Following queries returns `__value__`s intersecting some region defined as a `__box__`.
-These three ways are:
+There are three ways to perform a query presented below. All of them returns `__value__`s intersecting some
+region defined as a `__box__`.

Method call

 std::vector<__value__> returned_values;
 __box__ box_region(...);
- rt.query(box_region, std::back_inserter(returned_values));
+ rt.query(bgi::intersects(box_region), std::back_inserter(returned_values));

Function call

 std::vector<__value__> returned_values;
 __box__ box_region(...);
- index::query(rt, box_region, std::back_inserter(returned_values));
+ index::query(rt, bgi::intersects(box_region), std::back_inserter(returned_values));

Use of pipe operator generating a range

 __box__ box_region(...);
- BOOST_FOREACH(__value__ & v, rt | index::adaptors::queried(box_region))
+ BOOST_FOREACH(__value__ & v, rt | index::adaptors::queried(bgi::intersects(box_region)))
 ; // do something with v

[endsect]

[section Spatial queries]

-Spatial query returns `__value__`s which are related somehow to a geometry or some number of geometries.
+Spatial query returns `__value__`s which are related somehow to some Geometry - box, polygon, etc.
Names of spatial predicates corresponds to names of __boost_geometry__ algorithms. Examples of some
basic queries may be found in tables below. The query region and result `Value`s are orange.

@@ -65,11 +63,9 @@
[[[$../images/intersects_ring.png]] [[$../images/intersects_poly.png]] [[$../images/intersects_mpoly.png]]]
]

-To use a spatial predicate one may pass a geometry (which is a default case) or use one of the functions defined in
-`boost::geometry::index` namespace to define it explicitly.
+To use a spatial predicate one may use one of the functions defined in `boost::geometry::index` namespace.

- rt.query(box, std::back_inserter(result)); // default case - intersects
- rt.query(index::intersects(box), std::back_inserter(result)); // the same as default
+ rt.query(index::intersects(box), std::back_inserter(result));
 rt.query(index::covered_by(box), std::back_inserter(result));
 rt.query(index::disjont(box), std::back_inserter(result));
 rt.query(index::overlaps(box), std::back_inserter(result));
@@ -86,8 +82,8 @@
[section Nearest neighbours queries]

Nearest neighbours queries returns `__value__`s which are closest to some point in space.
-Additionally it is possible to pass define how the distance to the `Value` should be calculated.
-The examples of some knn queries may be found in the table below. All queries returns 5 closest `Values`.
+Additionally it is possible to define how the distance to the `Value` should be calculated.
+The examples of some knn queries may be found in the table below. All queries return 5 closest `Values`.
The query point and Values are orange.

[$../images/knn.png]
@@ -134,21 +130,38 @@

[endsect]

-[section Satisfies predicate]
+[section user-defined unary predicate]

-There is a unique predicate `index::satisfies(...)` taking user-defined function or function object
-which checks if `__value__` should be returned by the query. It may be used to check
-some specific conditions for user-defined Values.
+The user may pass a `UnaryPredicate` - function, function object or lambda expression taking const reference to Value and returning bool.
+This object may be passed to the query in order to check if `__value__` should be returned by the query. To do it one
+may use `index::satisfies()` function like on the example below:

- bool fun(__value__ const& v)
+ bool is_red(__value__ const& v)
 {
 return v.is_red();
 }

+ struct is_red_o
+ {
+ template <typename Value>
+ bool operator()(__value__ const& v)
+ {
+ return v.is_red();
+ }
+ }
+
 // ...

- rt.query(index::intersects(box) && index::satisfies(fun),
+ rt.query(index::intersects(box) && index::satisfies(is_red),
+ std::back_inserter(result));
+
+ rt.query(index::intersects(box) && index::satisfies(is_red_o()),
+ std::back_inserter(result));
+
+ #ifndef BOOST_NO_CXX11_LAMBDAS
+ rt.query(index::intersects(box) && index::satisfies([](__value__ const& v) { return v.is_red(); }),
 std::back_inserter(result));
+ #endif

[endsect]

@@ -189,7 +202,7 @@
 /* some inserting into the tree */

 std::vector<Value> result;
- rt1.query(Box(/*...*/), std::back_inserter(result));
+ rt1.query(bgi::intersects(Box(/*...*/)), std::back_inserter(result));
 RTree rt2(result.begin(), result.end());

However there are better ways. One of these methods is mentioned in the "Creation and modification" section.
@@ -197,12 +210,12 @@
query results because temporary container won't be used.

 RTree rt3;
- rt1.query(Box(/*...*/), bgi::inserter(rt3));
+ rt1.query(bgi::intersects(Box(/*...*/))), bgi::inserter(rt3));

If you like Boost.Range you'll appreciate the third option. You may pass the result Range directly to the
constructor. However in this case the temporary container is created.

- RTree rt4(rt1 | bgi::adaptors::queried(Box(/*...*/)));
+ RTree rt4(rt1 | bgi::adaptors::queried(bgi::intersects(Box(/*...*/)))));

[endsect]

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/interprocess.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/interprocess.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/interprocess.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -89,7 +89,7 @@
 std::cout << "Child: Querying for objects intersecting box = [(45, 45)(55, 55)]\n";

 std::vector result;
- unsigned k = tree->query(B(P(45, 45), P(55, 55)), std::back_inserter(result));
+ unsigned k = tree->query(bgi::intersects(B(P(45, 45), P(55, 55))), std::back_inserter(result));

 std::cout << "Child: Found objects:\n";
 std::cout << k << "\n";

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_shared_ptr.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_shared_ptr.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_shared_ptr.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -63,7 +63,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_vector.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_vector.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/polygons_vector.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -71,7 +71,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/quick_start.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -57,7 +57,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));
 //]

 //[rtree_quickstart_nearest_query

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/translator_index.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/translator_index.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/translator_index.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -73,7 +73,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/translator_shared_ptr.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/translator_shared_ptr.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/translator_shared_ptr.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -67,7 +67,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;

Modified: sandbox-branches/geometry/index/doc/src/examples/rtree/variants_map.cpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/examples/rtree/variants_map.cpp (original)
+++ sandbox-branches/geometry/index/doc/src/examples/rtree/variants_map.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -118,7 +118,7 @@
 // find values intersecting some area defined by a box
 box query_box(point(0, 0), point(5, 5));
 std::vector<value> result_s;
- rtree.query(query_box, std::back_inserter(result_s));
+ rtree.query(bgi::intersects(query_box), std::back_inserter(result_s));

 // find 5 nearest values to a point
 std::vector<value> result_n;

Modified: sandbox-branches/geometry/index/example/benchmark.cpp
==============================================================================
--- sandbox-branches/geometry/index/example/benchmark.cpp (original)
+++ sandbox-branches/geometry/index/example/benchmark.cpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -91,7 +91,7 @@
                 float x = coords[i].first;
                 float y = coords[i].second;
                 result.clear();
- t.query(B(P(x - 10, y - 10), P(x + 10, y + 10)), std::back_inserter(result));
+ t.query(bgi::intersects(B(P(x - 10, y - 10), P(x + 10, y + 10))), std::back_inserter(result));
                 temp += result.size();
             }
             dur_t time = clock_t::now() - start;

Modified: sandbox-branches/geometry/index/test/rtree/test_rtree.hpp
==============================================================================
--- sandbox-branches/geometry/index/test/rtree/test_rtree.hpp (original)
+++ sandbox-branches/geometry/index/test/rtree/test_rtree.hpp 2013-03-01 13:14:46 EST (Fri, 01 Mar 2013)
@@ -574,7 +574,7 @@
 if ( bg::intersects(tree.translator()(v), qbox) )
 expected_output.push_back(v);

- test_spatial_query(tree, qbox, expected_output);
+ //test_spatial_query(tree, qbox, expected_output);
 test_spatial_query(tree, bgi::intersects(qbox), expected_output);
 test_spatial_query(tree, !bgi::disjoint(qbox), expected_output);

@@ -857,7 +857,7 @@
 BOOST_CHECK(result.size() == input.size());
#ifndef BOOST_NO_CXX11_LAMBDAS
 result.clear();
- rtree.query(bgi::satisfies([](Value const& v){ return true; }), std::back_inserter(result));
+ rtree.query(bgi::satisfies([](Value const&){ return true; }), std::back_inserter(result));
 BOOST_CHECK(result.size() == input.size());
#endif
}
@@ -872,7 +872,7 @@
 size_t s = tree.size();

 std::vector<Value> expected_output;
- tree.query(qbox, std::back_inserter(expected_output));
+ tree.query(bgi::intersects(qbox), std::back_inserter(expected_output));

 // copy constructor
 Rtree t1(tree);
@@ -881,7 +881,7 @@
 BOOST_CHECK(tree.size() == t1.size());

 std::vector<Value> output;
- t1.query(qbox, std::back_inserter(output));
+ t1.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t1, output, expected_output);

 // copying assignment operator
@@ -891,7 +891,7 @@
 BOOST_CHECK(tree.size() == t1.size());

 output.clear();
- t1.query(qbox, std::back_inserter(output));
+ t1.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t1, output, expected_output);

 Rtree t2(tree.parameters(), tree.translator(), tree.get_allocator());
@@ -902,11 +902,11 @@
 BOOST_CHECK(0 == t1.size());

 output.clear();
- t1.query(qbox, std::back_inserter(output));
+ t1.query(bgi::intersects(qbox), std::back_inserter(output));
 BOOST_CHECK(output.empty());

 output.clear();
- t2.query(qbox, std::back_inserter(output));
+ t2.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t2, output, expected_output);
 t2.swap(t1);

@@ -917,7 +917,7 @@
 BOOST_CHECK(t1.size() == 0);

 output.clear();
- t3.query(qbox, std::back_inserter(output));
+ t3.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t3, output, expected_output);

 // moving assignment operator
@@ -927,7 +927,7 @@
 BOOST_CHECK(t3.size() == 0);

 output.clear();
- t1.query(qbox, std::back_inserter(output));
+ t1.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t1, output, expected_output);

 //TODO - test SWAP
@@ -939,7 +939,7 @@
void test_create_insert(Rtree & tree, std::vector<Value> const& input, Box const& qbox)
{
 std::vector<Value> expected_output;
- tree.query(qbox, std::back_inserter(expected_output));
+ tree.query(bgi::intersects(qbox), std::back_inserter(expected_output));

 {
 Rtree t(tree.parameters(), tree.translator(), tree.get_allocator());
@@ -947,7 +947,7 @@
 t.insert(v);
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
@@ -955,21 +955,21 @@
 std::copy(input.begin(), input.end(), bgi::inserter(t));
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
 Rtree t(input.begin(), input.end(), tree.parameters(), tree.translator(), tree.get_allocator());
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
 Rtree t(input, tree.parameters(), tree.translator(), tree.get_allocator());
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
@@ -977,7 +977,7 @@
 t.insert(input.begin(), input.end());
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
@@ -985,7 +985,7 @@
 t.insert(input);
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- t.query(qbox, std::back_inserter(output));
+ t.query(bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }

@@ -995,7 +995,7 @@
 bgi::insert(t, v);
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- bgi::query(t, qbox, std::back_inserter(output));
+ bgi::query(t, bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
@@ -1003,7 +1003,7 @@
 bgi::insert(t, input.begin(), input.end());
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- bgi::query(t, qbox, std::back_inserter(output));
+ bgi::query(t, bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
 {
@@ -1011,7 +1011,7 @@
 bgi::insert(t, input);
 BOOST_CHECK(tree.size() == t.size());
 std::vector<Value> output;
- bgi::query(t, qbox, std::back_inserter(output));
+ bgi::query(t, bgi::intersects(qbox), std::back_inserter(output));
 test_exactly_the_same_outputs(t, output, expected_output);
 }
}
@@ -1024,7 +1024,7 @@
 typedef typename Rtree::value_type Value;

 std::vector<Value> values_to_remove;
- tree.query(qbox, std::back_inserter(values_to_remove));
+ tree.query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
 BOOST_CHECK(0 < values_to_remove.size());

 std::vector<Value> expected_output;
@@ -1107,7 +1107,7 @@
void test_clear(Rtree & tree, std::vector<Value> const& input, Box const& qbox)
{
 std::vector<Value> values_to_remove;
- tree.query(qbox, std::back_inserter(values_to_remove));
+ tree.query(bgi::intersects(qbox), std::back_inserter(values_to_remove));
 BOOST_CHECK(0 < values_to_remove.size());

 //clear
@@ -1208,7 +1208,7 @@
 BOOST_CHECK(t.size() + rest_count == Value::counter());

 std::vector<Value> values_to_remove;
- t.query(qbox, std::back_inserter(values_to_remove));
+ t.query(bgi::intersects(qbox), std::back_inserter(values_to_remove));

 rest_count += values_to_remove.size();

Next message: jewillco_at_[hidden]: "[Boost-commit] svn:boost r83233 - in trunk: boost/graph libs/graph/doc"
Previous message: john_at_[hidden]: "[Boost-commit] svn:boost r83231 - trunk/boost/tr1/detail"

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