Boost-Commit :

Date view	Thread view	Subject view	Author view

Subject: [Boost-commit] svn:boost r82492 - in sandbox-branches/geometry/index/doc: generated html html/geometry_index/r_tree src/tools/doxygen_xml2qbk
From: adam.wulkiewicz_at_[hidden]
Date: 2013-01-14 12:40:33

Author: awulkiew
Date: 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
New Revision: 82492
URL: http://svn.boost.org/trac/boost/changeset/82492

Log:
doxygen_xml2qbk - Keywords coloring in paragraphs added - data inside computeroutput which is not inside other block is translated to `...`.
Reference updated.
Text files modified:
   sandbox-branches/geometry/index/doc/generated/distance_predicates.qbk | 14 +-
   sandbox-branches/geometry/index/doc/generated/predicates.qbk | 10
   sandbox-branches/geometry/index/doc/generated/rtree.qbk | 60 +++++-----
   sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk | 16 +-
   sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html | 221 ++++++++++++++++++++-------------------
   sandbox-branches/geometry/index/doc/html/index.html | 2
   sandbox-branches/geometry/index/doc/src/tools/doxygen_xml2qbk/doxygen_xml_parser.hpp | 54 +++++----
   7 files changed, 195 insertions(+), 182 deletions(-)

Modified: sandbox-branches/geometry/index/doc/generated/distance_predicates.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/distance_predicates.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/distance_predicates.qbk 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -98,8 +98,8 @@
[heading Parameter(s)]
[table
[[Type][Name][Description]]
-[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^bgi::to_nearest(Point)], [^bgi::to_centroid(Point)] or [^bgi::to_furthest(Point)]. ]]
-[[`MinRelation const &`][ `minr` ][The minimum bound relation. This may be generated by [^bgi::to_nearest(min_distance)], [^bgi::to_centroid(min_distance)] or [^bgi::to_furthest(min_distance)]. ]]
+[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^`bgi::to_nearest(Point)`], [^`bgi::to_centroid(Point)`] or [^`bgi::to_furthest(Point)`]. ]]
+[[`MinRelation const &`][ `minr` ][The minimum bound relation. This may be generated by [^`bgi::to_nearest(min_distance)`], [^`bgi::to_centroid(min_distance)`] or [^`bgi::to_furthest(min_distance)`]. ]]
]
[endsect]

@@ -117,8 +117,8 @@
[heading Parameter(s)]
[table
[[Type][Name][Description]]
-[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^bgi::to_nearest(Point)], [^bgi::to_centroid(Point)] or [^bgi::to_furthest(Point)]. ]]
-[[`MaxRelation const &`][ `maxr` ][The maximum bound relation. This may be generated by [^bgi::to_nearest(max_distance)], [^bgi::to_centroid(max_distance)] or [^bgi::to_furthest(max_distance)]. ]]
+[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^`bgi::to_nearest(Point)`], [^`bgi::to_centroid(Point)`] or [^`bgi::to_furthest(Point)`]. ]]
+[[`MaxRelation const &`][ `maxr` ][The maximum bound relation. This may be generated by [^`bgi::to_nearest(max_distance)`], [^`bgi::to_centroid(max_distance)`] or [^`bgi::to_furthest(max_distance)`]. ]]
]
[endsect]

@@ -140,9 +140,9 @@
[heading Parameter(s)]
[table
[[Type][Name][Description]]
-[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^bgi::to_nearest(Point)], [^bgi::to_centroid(Point)] or [^bgi::to_furthest(Point)]. ]]
-[[`MinRelation const &`][ `minr` ][The minimum bound relation. This may be generated by [^bgi::to_nearest(min_distance)], [^bgi::to_centroid(min_distance)] or [^bgi::to_furthest(min_distance)]. ]]
-[[`MaxRelation const &`][ `maxr` ][The maximum bound relation. This may be generated by [^bgi::to_nearest(max_distance)], [^bgi::to_centroid(max_distance)] or [^bgi::to_furthest(max_distance)]. ]]
+[[`PointRelation const &`][ `pr` ][The point relation. This may be generated by [^`bgi::to_nearest(Point)`], [^`bgi::to_centroid(Point)`] or [^`bgi::to_furthest(Point)`]. ]]
+[[`MinRelation const &`][ `minr` ][The minimum bound relation. This may be generated by [^`bgi::to_nearest(min_distance)`], [^`bgi::to_centroid(min_distance)`] or [^`bgi::to_furthest(min_distance)`]. ]]
+[[`MaxRelation const &`][ `maxr` ][The maximum bound relation. This may be generated by [^`bgi::to_nearest(max_distance)`], [^`bgi::to_centroid(max_distance)`] or [^`bgi::to_furthest(max_distance)`]. ]]
]
[endsect]

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-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -47,7 +47,7 @@
Generate [^[link group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61 covered_by()]] predicate.

[heading Description]
-Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^bg::covered_by(Indexable, Geometry)] returns true.[heading Synopsis]
+Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^`bg::covered_by(Indexable, Geometry)`] returns true.[heading Synopsis]
[pre
`template<``typename Geometry``>`
`detail::covered_by<Geometry> boost::geometry::index::covered_by``(``Geometry const &` `g``)`
@@ -65,7 +65,7 @@
Generate [^[link group__predicates_1ga351bb3b82e019ff45adf789385b8007d disjoint()]] predicate.

[heading Description]
-Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^bg::disjoint(Indexable, Geometry)] returns true.[heading Synopsis]
+Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^`bg::disjoint(Indexable, Geometry)`] returns true.[heading Synopsis]
[pre
`template<``typename Geometry``>`
`detail::disjoint<Geometry> boost::geometry::index::disjoint``(``Geometry const &` `g``)`
@@ -83,7 +83,7 @@
Generate [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 intersects()]] predicate.

[heading Description]
-Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^bg::intersects(Indexable, Geometry)] returns true.[heading Synopsis]
+Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^`bg::intersects(Indexable, Geometry)`] returns true.[heading Synopsis]
[pre
`template<``typename Geometry``>`
`detail::intersects<Geometry> boost::geometry::index::intersects``(``Geometry const &` `g``)`
@@ -101,7 +101,7 @@
Generate [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 overlaps()]] predicate.

[heading Description]
-Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^bg::overlaps(Indexable, Geometry)] returns true.[heading Synopsis]
+Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^`bg::overlaps(Indexable, Geometry)`] returns true.[heading Synopsis]
[pre
`template<``typename Geometry``>`
`detail::overlaps<Geometry> boost::geometry::index::overlaps``(``Geometry const &` `g``)`
@@ -119,7 +119,7 @@
Generate [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d within()]] predicate.

[heading Description]
-Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^bg::within(Indexable, Geometry)] returns true.[heading Synopsis]
+Generate a predicate defining Value and Geometry relationship. Value will be returned by the query if [^`bg::within(Indexable, Geometry)`] returns true.[heading Synopsis]
[pre
`template<``typename Geometry``>`
`detail::within<Geometry> boost::geometry::index::within``(``Geometry const &` `g``)`

Modified: sandbox-branches/geometry/index/doc/generated/rtree.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/rtree.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/rtree.qbk 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -35,7 +35,7 @@

[heading Translator]
-The Translator translates from Value to Indexable each time r-tree requires it. Which means that this operation is done for each Value access. Therefore the Translator should return the Indexable by const reference instead of a value. Default translator can translate all types adapted to Point or Box concepts (called Indexables). It also handles [^std::pair<Indexable, T>] and [^boost::tuple<Indexable, ...>]. For example, if [^std::pair<Box, int>] is stored in the container, the default translator translates from [^std::pair<Box, int> const&] to [^Box const&].
+The Translator translates from Value to Indexable each time r-tree requires it. Which means that this operation is done for each Value access. Therefore the Translator should return the Indexable by const reference instead of a value. Default translator can translate all types adapted to Point or Box concepts (called Indexables). It also handles [^`std::pair<Indexable, T>`] and [^`boost::tuple<Indexable, ...>`]. For example, if [^`std::pair<Box, int>`] is stored in the container, the default translator translates from [^`std::pair<Box, int> const&`] to [^`Box const&`].

[heading Header]
`#include <boost/geometry/extensions/index/rtree/rtree.hpp>`
@@ -484,7 +484,7 @@
Remove a value from the container.

[heading Description]
-In contrast to the [^std::set] or [^std::map erase()] method this method removes only one value from the container.[heading Synopsis]
+In contrast to the [^`std::set`] or [^`std::map erase()`] method this method removes only one value from the container.[heading Synopsis]
[pre

[^[link classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6 size_type]] `remove``(`[^[link classboost_1_1geometry_1_1index_1_1rtree_1a9979db9ef37591985256cb8ad31862bb value_type]]` const &` `value``)`
@@ -515,7 +515,7 @@
Remove a range of values from the container.

[heading Description]
-In contrast to the [^std::set] or [^std::map erase()] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
+In contrast to the [^`std::set`] or [^`std::map erase()`] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
[pre
`template<``typename Iterator``>`
[^[link classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6 size_type]] `remove``(``Iterator` `first``,` `Iterator` `last``)`
@@ -547,7 +547,7 @@
Remove a range of values from the container.

[heading Description]
-In contrast to the [^std::set] or [^std::map erase()] method it removes values equal to these passed as a range. Furthermore, this method removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
+In contrast to the [^`std::set`] or [^`std::map erase()`] method it removes values equal to these passed as a range. Furthermore, this method removes only one value for each one passed in the range, not all equal values.[heading Synopsis]
[pre
`template<``typename Range``>`
[^[link classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6 size_type]] `remove``(``Range const &` `rng``)`
@@ -578,7 +578,7 @@
Finds values meeting spatial predicates, e.g. intersecting some Box.

[heading Description]
-[*Spatial predicates] may be a [^Geometry]. In this case Values intersecting the [^Geometry] are returned.
+[*Spatial predicates] may be a [^`Geometry`]. In this case Values intersecting the [^`Geometry`] are returned.

It may be generated by one of the functions listed below:

@@ -587,15 +587,15 @@
* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]] - default,
* [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]],
-* [^! [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()]],
-* [^! [link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
-* [^! [link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
+* [^`! `[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()]],
+* [^`! `[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
+* [^`! `[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
* [^[link group__predicates_1ga5c93efac97377136564623cbaf35d880 boost::geometry::index::value()]].

-Those predicates may be passed together in [^std::pair] or [^boost::tuple].[heading Synopsis]
+Those predicates may be passed together in [^`std::pair`] or [^`boost::tuple`].[heading Synopsis]
[pre
`template<``typename Predicates``,` `typename OutIter``>`
[^[link classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6 size_type]] `spatial_query``(``Predicates const &` `pred``,` `OutIter` `out_it``)`
@@ -624,7 +624,7 @@
Finds one value meeting distances predicates, e.g. nearest to some Point.

[heading Description]
-[*Distances predicates] may be a [^Point]. In this the case the Value closest to [^Point] is returned.
+[*Distances predicates] may be a [^`Point`]. In this the case the Value closest to [^`Point`] is returned.

It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:

@@ -671,7 +671,7 @@
Finds one value meeting distances predicates and spatial predicates, e.g. nearest to some Point and intersecting some Box.

[heading Description]
-[*Distances predicates] may be a [^Point]. In this the case the Value closest to [^Point] is returned.
+[*Distances predicates] may be a [^`Point`]. In this the case the Value closest to [^`Point`] is returned.

It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:

@@ -694,7 +694,7 @@
* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].

-[*Spatial predicates] may be a [^Geometry]. In this case Values intersecting the [^Geometry] are returned.
+[*Spatial predicates] may be a [^`Geometry`]. In this case Values intersecting the [^`Geometry`] are returned.

It may be generated by one of the functions listed below:

@@ -703,15 +703,15 @@
* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]] - default,
* [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]],
-* [^! [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()]],
-* [^! [link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
-* [^! [link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
+* [^`! `[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()]],
+* [^`! `[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
+* [^`! `[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
* [^[link group__predicates_1ga5c93efac97377136564623cbaf35d880 boost::geometry::index::value()]].

-Those predicates may be passed together in [^std::pair] or [^boost::tuple].[heading Synopsis]
+Those predicates may be passed together in [^`std::pair`] or [^`boost::tuple`].[heading Synopsis]
[pre
`template<``typename DistancesPredicates``,` `typename Predicates``>`
[^[link classboost_1_1geometry_1_1index_1_1rtree_1a5c1a657074c527ed65f858c1ab6b36e6 size_type]] `nearest_query``(``DistancesPredicates const &` `dpred``,`
@@ -738,7 +738,7 @@
Finds k values meeting distances predicates, e.g. k nearest values to some Point.

[heading Description]
-[*Distances predicates] may be a [^Point]. In this the case the Value closest to [^Point] is returned.
+[*Distances predicates] may be a [^`Point`]. In this the case the Value closest to [^`Point`] is returned.

It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:

@@ -788,7 +788,7 @@
Finds k values meeting distances predicates and spatial predicates, e.g. k nearest values to some Point and intersecting some Box.

[heading Description]
-[*Distances predicates] may be a [^Point]. In this the case the Value closest to [^Point] is returned.
+[*Distances predicates] may be a [^`Point`]. In this the case the Value closest to [^`Point`] is returned.

It is possible to define how distance to Value is calculated. This is done by passing PointRelation. It can be generated by following functions:

@@ -811,7 +811,7 @@
* [^[link group__distance__predicates_1gaccbba95d864d8dcf8a694796c840fbe0 boost::geometry::index::to_centroid()]],
* [^[link group__distance__predicates_1ga67dddd8a7fcaae150970e1db0401de02 boost::geometry::index::to_furthest()]].

-[*Spatial predicates] may be a [^Geometry]. In this case Values intersecting the [^Geometry] are returned.
+[*Spatial predicates] may be a [^`Geometry`]. In this case Values intersecting the [^`Geometry`] are returned.

It may be generated by one of the functions listed below:

@@ -820,15 +820,15 @@
* [^[link group__predicates_1ga7301c50e0272976b9f1434536383e6d0 boost::geometry::index::intersects()]] - default,
* [^[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
* [^[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]],
-* [^! [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()]],
-* [^! [link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
-* [^! [link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
+* [^`! `[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()]],
+* [^`! `[link group__predicates_1ga5511236f56be1defcccbf11e742ccd88 boost::geometry::index::overlaps()]],
+* [^`! `[link group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d boost::geometry::index::within()]]
* [^[link group__predicates_1ga5c93efac97377136564623cbaf35d880 boost::geometry::index::value()]].

-Those predicates may be passed together in [^std::pair] or [^boost::tuple].[heading Synopsis]
+Those predicates may be passed together in [^`std::pair`] or [^`boost::tuple`].[heading Synopsis]
[pre
`template<``typename DistancesPredicates``,`
`typename Predicates``,`
@@ -908,7 +908,7 @@
Returns the box containing all values stored in the container.

[heading Description]
-Returns the box containing all values stored in the container. If the container is empty the result of [^geometry::assign_inverse()] is returned.[heading Synopsis]
+Returns the box containing all values stored in the container. If the container is empty the result of [^`geometry::assign_inverse()`] is returned.[heading Synopsis]
[pre

[^[link classboost_1_1geometry_1_1index_1_1rtree_1a42d0c9efffbc6f3935b5b9c3dd31e50d box_type]] `box``()`

Modified: sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk
==============================================================================
--- sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk (original)
+++ sandbox-branches/geometry/index/doc/generated/rtree_functions.qbk 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -96,7 +96,7 @@
Remove a value from the container.

[heading Description]
-Remove a value from the container. In contrast to the [^std::set] or [^std::map erase()] method this function removes only one value from the container.
+Remove a value from the container. In contrast to the [^`std::set`] or [^`std::map erase()`] method this function removes only one value from the container.

It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1af6ca6909354a997f89411ef40ea5688a rtree::remove(value_type const&)]].[heading Synopsis]
[pre
@@ -122,7 +122,7 @@
Remove a range of values from the container.

[heading Description]
-Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this function removes only one value for each one passed in the range, not all equal values.
+Remove a range of values from the container. In contrast to the [^`std::set`] or [^`std::map erase()`] method it doesn't take iterators pointing to values stored in this container. It removes values equal to these passed as a range. Furthermore this function removes only one value for each one passed in the range, not all equal values.

It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a6e9123114697d65b16ebc49cd5371fbd rtree::remove(Iterator, Iterator)]].[heading Synopsis]
[pre
@@ -152,7 +152,7 @@
Remove a range of values from the container.

[heading Description]
-Remove a range of values from the container. In contrast to the [^std::set] or [^std::map erase()] method it removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.
+Remove a range of values from the container. In contrast to the [^`std::set`] or [^`std::map erase()`] method it removes values equal to these passed as a range. Furthermore this method removes only one value for each one passed in the range, not all equal values.

It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a5a57bb93b0b2d7ea1c659e925f918e9c rtree::remove(Range const&)]].[heading Synopsis]
[pre
@@ -179,7 +179,7 @@
Find values meeting spatial predicates.

[heading Description]
-It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a930bf17d595a91d8ae924383a0387920 rtree::spatial_query]] with parameters [^(Predicates const&, OutIter)].[heading Synopsis]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a930bf17d595a91d8ae924383a0387920 rtree::spatial_query]] with parameters [^`(Predicates const&, OutIter)`].[heading Synopsis]
[pre
`template<``typename Value``,`
 `typename Options``,`
@@ -208,7 +208,7 @@
Find the value meeting distances predicates.

[heading Description]
-It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const& dpred, value_type & v)].[heading Synopsis]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^`(DistancesPredicates const& dpred, value_type & v)`].[heading Synopsis]
[pre
`template<``typename Value``,`
 `typename Options``,`
@@ -236,7 +236,7 @@
Find the value meeting distances and spatial predicates.

[heading Description]
-It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const& dpred, Predicates const& pred, value_type & v)].[heading Synopsis]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^`(DistancesPredicates const& dpred, Predicates const& pred, value_type & v)`].[heading Synopsis]
[pre
`template<``typename Value``,`
 `typename Options``,`
@@ -267,7 +267,7 @@
Find k values meeting distances predicates.

[heading Description]
-It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const & dpred, size_type k, OutIter out_it)].[heading Synopsis]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^`(DistancesPredicates const & dpred, size_type k, OutIter out_it)`].[heading Synopsis]
[pre
`template<``typename Value``,`
 `typename Options``,`
@@ -298,7 +298,7 @@
Find k values meeting distances and spatial predicates.

[heading Description]
-It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^(DistancesPredicates const & dpred, size_type k, Predicates const & pred, OutIter out_it)].[heading Synopsis]
+It calls [^[link classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909 rtree::nearest_query]] with parameters [^`(DistancesPredicates const & dpred, size_type k, Predicates const & pred, OutIter out_it)`].[heading Synopsis]
[pre
`template<``typename Value``,`
 `typename Options``,`

Modified: sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html (original)
+++ sandbox-branches/geometry/index/doc/html/geometry_index/r_tree/reference.html 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -47,7 +47,7 @@
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree"></a><a name="classboost_1_1geometry_1_1index_1_1rtree"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree" title="boost::geometry::index::rtree">boost::geometry::index::rtree</a>
</h4></div></div></div>

- <a class="indexterm" name="id947557"></a><a class="indexterm" name="id947562"></a><a class="indexterm" name="id947567"></a><a class="indexterm" name="id947571"></a>
+ <a class="indexterm" name="id903866"></a><a class="indexterm" name="id903871"></a><a class="indexterm" name="id903876"></a><a class="indexterm" name="id903881"></a>
The R-tree spatial index.
 
<h6>
@@ -104,11 +104,13 @@
 it. Which means that this operation is done for each Value access. Therefore
 the Translator should return the Indexable by const reference instead of
 a value. Default translator can translate all types adapted to Point or
- Box concepts (called Indexables). It also handles <code class="literal">std::pair<Indexable,
- T></code> and <code class="literal">boost::tuple<Indexable, ...></code>.
- For example, if <code class="literal">std::pair<Box, int></code> is stored
- in the container, the default translator translates from <code class="literal">std::pair<Box,
- int> const&</code> to <code class="literal">Box const&</code>.
+ Box concepts (called Indexables). It also handles <code class="literal"><code class="computeroutput">std::pair<Indexable,
+ T></code></code>
+ and <code class="literal"><code class="computeroutput">boost::tuple<Indexable,
+ ...></code></code>. For example,
+ if <code class="literal"><code class="computeroutput">std::pair<Box, int></code></code>
+ is stored in the container, the default translator translates from <code class="literal"><code class="computeroutput">std::pair<Box, int> const&</code></code>
+ to <code class="literal"><code class="computeroutput">Box const&</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.h3"></a>
@@ -2060,8 +2062,9 @@
 <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">std::set</code> or <code class="literal">std::map erase()</code>
- method this method removes only one 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 method removes
+ only one value from the container.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.remove_value_type_const___.h1"></a>
@@ -2162,11 +2165,11 @@
 <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">std::set</code> or <code class="literal">std::map erase()</code>
- method it doesn't take iterators pointing to values stored in this container.
- It removes values equal to these passed as a range. Furthermore this
- method removes only one value for each one passed in the range, not all
- equal values.
+ 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
+ pointing to values stored in this container. It removes values equal
+ to these passed as a range. Furthermore this method removes only one
+ value for each one passed in the range, not all equal values.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.remove_iterator__iterator_.h1"></a>
@@ -2286,10 +2289,10 @@
 <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">std::set</code> or <code class="literal">std::map erase()</code>
- method it removes values equal to these passed as a range. Furthermore,
- this method removes only one value for each one passed in the range,
- not all equal values.
+ 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
+ equal to these passed as a range. Furthermore, this method removes only
+ one value for each one passed in the range, not all equal values.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.remove_range_const___.h1"></a>
@@ -2391,9 +2394,9 @@
 <a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.spatial_query_predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.spatial_query_predicates_const____outiter_.description">Description</a>
 </h6>

- Spatial predicates may be a <code class="literal">Geometry</code>.
- In this case Values intersecting the <code class="literal">Geometry</code> are
- returned.
+ Spatial predicates may be 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.
 

 It may be generated by one of the functions listed below:
@@ -2416,27 +2419,27 @@
 <code class="literal"><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga351bb3b82e019ff45adf789385b8007d">boost::geometry::index::disjoint()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga5511236f56be1defcccbf11e742ccd88">boost::geometry::index::overlaps()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
 </li>
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga5c93efac97377136564623cbaf35d880">boost::geometry::index::value()</a></code>.
 </li>
</ul></div>

- Those predicates may be passed together in <code class="literal">std::pair</code>
- or <code class="literal">boost::tuple</code>.
+ Those predicates may be passed together in <code class="literal"><code class="computeroutput">std::pair</code></code>
+ or <code class="literal"><code class="computeroutput">boost::tuple</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.spatial_query_predicates_const____outiter_.h1"></a>
@@ -2543,8 +2546,9 @@
 <a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____value_type___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____value_type___.description">Description</a>
 </h6>

- Distances predicates may be a <code class="literal">Point</code>.
- In this the case the Value closest to <code class="literal">Point</code> is returned.
+ Distances predicates may be a <code class="literal"><code class="computeroutput">Point</code></code>. In this the case the
+ Value closest to <code class="literal"><code class="computeroutput">Point</code></code>
+ is returned.
 

 It is possible to define how distance to Value is calculated. This is
@@ -2699,8 +2703,9 @@
 <a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____predicates_const____value_type___.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____predicates_const____value_type___.description">Description</a>
 </h6>

- Distances predicates may be a <code class="literal">Point</code>.
- In this the case the Value closest to <code class="literal">Point</code> is returned.
+ Distances predicates may be a <code class="literal"><code class="computeroutput">Point</code></code>. In this the case the
+ Value closest to <code class="literal"><code class="computeroutput">Point</code></code>
+ is returned.
 

 It is possible to define how distance to Value is calculated. This is
@@ -2754,9 +2759,9 @@
 </li>
</ul></div>

- Spatial predicates may be a <code class="literal">Geometry</code>.
- In this case Values intersecting the <code class="literal">Geometry</code> are
- returned.
+ Spatial predicates may be 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.
 

 It may be generated by one of the functions listed below:
@@ -2779,27 +2784,27 @@
 <code class="literal"><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga351bb3b82e019ff45adf789385b8007d">boost::geometry::index::disjoint()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga5511236f56be1defcccbf11e742ccd88">boost::geometry::index::overlaps()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
 </li>
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga5c93efac97377136564623cbaf35d880">boost::geometry::index::value()</a></code>.
 </li>
</ul></div>

- Those predicates may be passed together in <code class="literal">std::pair</code>
- or <code class="literal">boost::tuple</code>.
+ Those predicates may be passed together in <code class="literal"><code class="computeroutput">std::pair</code></code>
+ or <code class="literal"><code class="computeroutput">boost::tuple</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____predicates_const____value_type___.h1"></a>
@@ -2922,8 +2927,9 @@
 <a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____size_type__outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____size_type__outiter_.description">Description</a>
 </h6>

- Distances predicates may be a <code class="literal">Point</code>.
- In this the case the Value closest to <code class="literal">Point</code> is returned.
+ Distances predicates may be a <code class="literal"><code class="computeroutput">Point</code></code>. In this the case the
+ Value closest to <code class="literal"><code class="computeroutput">Point</code></code>
+ is returned.
 

 It is possible to define how distance to Value is calculated. This is
@@ -3097,8 +3103,9 @@
 <a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____size_type__predicates_const____outiter_.description"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____size_type__predicates_const____outiter_.description">Description</a>
 </h6>

- Distances predicates may be a <code class="literal">Point</code>.
- In this the case the Value closest to <code class="literal">Point</code> is returned.
+ Distances predicates may be a <code class="literal"><code class="computeroutput">Point</code></code>. In this the case the
+ Value closest to <code class="literal"><code class="computeroutput">Point</code></code>
+ is returned.
 

 It is possible to define how distance to Value is calculated. This is
@@ -3152,9 +3159,9 @@
 </li>
</ul></div>

- Spatial predicates may be a <code class="literal">Geometry</code>.
- In this case Values intersecting the <code class="literal">Geometry</code> are
- returned.
+ Spatial predicates may be 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.
 

 It may be generated by one of the functions listed below:
@@ -3177,27 +3184,27 @@
 <code class="literal"><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga0a613a7f1d18ac33955bfdc2c5777c61">boost::geometry::index::covered_by()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1ga351bb3b82e019ff45adf789385b8007d">boost::geometry::index::disjoint()</a></code>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><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>,
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1ga5511236f56be1defcccbf11e742ccd88">boost::geometry::index::overlaps()</a></code>,
 </li>
<li class="listitem">
- <code class="literal">! <a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
+ <code class="literal"><code class="computeroutput">! </code><a class="link" href="reference.html#group__predicates_1gabf9c4e76dd8a09a4c476f2f8fa8a0e4d">boost::geometry::index::within()</a></code>
 </li>
<li class="listitem">
 <code class="literal"><a class="link" href="reference.html#group__predicates_1ga5c93efac97377136564623cbaf35d880">boost::geometry::index::value()</a></code>.
 </li>
</ul></div>

- Those predicates may be passed together in <code class="literal">std::pair</code>
- or <code class="literal">boost::tuple</code>.
+ Those predicates may be passed together in <code class="literal"><code class="computeroutput">std::pair</code></code>
+ or <code class="literal"><code class="computeroutput">boost::tuple</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.nearest_query_distancespredicates_const____size_type__predicates_const____outiter_.h1"></a>
@@ -3416,8 +3423,7 @@
 </h6>

 Returns the box containing all values stored in the container. If the
- container is empty the result of <code class="literal">geometry::assign_inverse()</code>
- is returned.
+ container is empty the result of <code class="literal"><code class="computeroutput">geometry::assign_inverse()</code></code> is returned.
 
<h6>
<a name="geometry_index.r_tree.reference.boost_geometry_index_rtree.box__.h1"></a>
@@ -4174,9 +4180,8 @@
 <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">std::set</code>
- or <code class="literal">std::map erase()</code> method this function removes only
- one value from the container.
+ 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
+ only one value from the container.
 

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1af6ca6909354a997f89411ef40ea5688a">rtree::remove(value_type
@@ -4283,8 +4288,7 @@
 <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">std::set</code>
- or <code class="literal">std::map erase()</code> method it doesn't take iterators
+ 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
 pointing to values stored in this container. It removes values equal
 to these passed as a range. Furthermore this function removes only one
 value for each one passed in the range, not all equal values.
@@ -4413,10 +4417,9 @@
 <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">std::set</code>
- or <code class="literal">std::map erase()</code> method it removes values equal
- to these passed as a range. Furthermore this method removes only one
- value for each one passed in the range, not all equal values.
+ 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
+ equal to these passed as a range. Furthermore this method removes only
+ one value for each one passed in the range, not all equal values.
 

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a5a57bb93b0b2d7ea1c659e925f918e9c">rtree::remove(Range
@@ -4525,7 +4528,7 @@
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a930bf17d595a91d8ae924383a0387920">rtree::spatial_query</a></code>
- with parameters <code class="literal">(Predicates const&, OutIter)</code>.
+ with parameters <code class="literal"><code class="computeroutput">(Predicates const&, OutIter)</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.spatial_query_rtree______const____predicates_const____outiter_.h1"></a>
@@ -4649,8 +4652,8 @@
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
- with parameters <code class="literal">(DistancesPredicates const& dpred, value_type
- & v)</code>.
+ with parameters <code class="literal"><code class="computeroutput">(DistancesPredicates const& dpred, value_type
+ & v)</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____value___.h1"></a>
@@ -4775,8 +4778,11 @@
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
- with parameters <code class="literal">(DistancesPredicates const& dpred, Predicates
- const& pred, value_type & v)</code>.
+ with parameters <code class="literal"><code class="computeroutput">(DistancesPredicates const& dpred, Predicates
+ const&
+ pred,
+ value_type &
+ v)</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____predicates_const____value___.h1"></a>
@@ -4920,8 +4926,10 @@
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
- with parameters <code class="literal">(DistancesPredicates const & dpred, size_type
- k, OutIter out_it)</code>.
+ with parameters <code class="literal"><code class="computeroutput">(DistancesPredicates const
+ & dpred, size_type
+ k,
+ OutIter out_it)</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__outiter_.h1"></a>
@@ -5066,8 +5074,12 @@
 </h6>

 It calls <code class="literal"><a class="link" href="reference.html#classboost_1_1geometry_1_1index_1_1rtree_1a788295b315bd0ddeb93b1cc050fdf909">rtree::nearest_query</a></code>
- with parameters <code class="literal">(DistancesPredicates const & dpred, size_type
- k, Predicates const & pred, OutIter out_it)</code>.
+ with parameters <code class="literal"><code class="computeroutput">(DistancesPredicates const
+ & dpred, size_type
+ k,
+ Predicates const
+ & pred, OutIter
+ out_it)</code></code>.
 
<h6>
<a name="geometry_index.r_tree.reference.group__rtree__functions.nearest_query_rtree______const____distancespredicates_const____typename_rtree_______size_type__predicates_const____outiter_.h1"></a>
@@ -5553,7 +5565,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_linear"></a><a name="structboost_1_1geometry_1_1index_1_1linear"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_linear" title="boost::geometry::index::linear">boost::geometry::index::linear</a>
</h5></div></div></div>

- <a class="indexterm" name="id982479"></a><a class="indexterm" name="id982484"></a><a class="indexterm" name="id982489"></a><a class="indexterm" name="id982493"></a>
+ <a class="indexterm" name="id939631"></a><a class="indexterm" name="id939636"></a><a class="indexterm" name="id939640"></a><a class="indexterm" name="id939645"></a>
Linear r-tree creation algorithm parameters.
 
<h6>
@@ -5628,7 +5640,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_quadratic"></a><a name="structboost_1_1geometry_1_1index_1_1quadratic"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_quadratic" title="boost::geometry::index::quadratic">boost::geometry::index::quadratic</a>
</h5></div></div></div>

- <a class="indexterm" name="id982802"></a><a class="indexterm" name="id982807"></a><a class="indexterm" name="id982811"></a><a class="indexterm" name="id982816"></a>
+ <a class="indexterm" name="id939954"></a><a class="indexterm" name="id939958"></a><a class="indexterm" name="id939963"></a><a class="indexterm" name="id939968"></a>
Quadratic r-tree creation algorithm parameters.
 
<h6>
@@ -5703,7 +5715,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_rstar"></a><a name="structboost_1_1geometry_1_1index_1_1rstar"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_rstar" title="boost::geometry::index::rstar">boost::geometry::index::rstar</a>
</h5></div></div></div>

- <a class="indexterm" name="id983125"></a><a class="indexterm" name="id983129"></a><a class="indexterm" name="id983134"></a><a class="indexterm" name="id983139"></a>
+ <a class="indexterm" name="id940413"></a><a class="indexterm" name="id940418"></a><a class="indexterm" name="id940423"></a><a class="indexterm" name="id940428"></a>
R*-tree creation algorithm parameters.
 
<h6>
@@ -5807,7 +5819,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_linear"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1linear"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_linear" title="boost::geometry::index::runtime::linear">boost::geometry::index::runtime::linear</a>
</h5></div></div></div>

- <a class="indexterm" name="id983573"></a><a class="indexterm" name="id983578"></a><a class="indexterm" name="id983583"></a><a class="indexterm" name="id983588"></a><a class="indexterm" name="id983593"></a>
+ <a class="indexterm" name="id940862"></a><a class="indexterm" name="id940867"></a><a class="indexterm" name="id940872"></a><a class="indexterm" name="id940877"></a><a class="indexterm" name="id940881"></a>
Linear r-tree creation algorithm parameters.
 
<h6>
@@ -5943,7 +5955,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_quadratic"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1quadratic"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_quadratic" title="boost::geometry::index::runtime::quadratic">boost::geometry::index::runtime::quadratic</a>
</h5></div></div></div>

- <a class="indexterm" name="id984271"></a><a class="indexterm" name="id984276"></a><a class="indexterm" name="id984280"></a><a class="indexterm" name="id984285"></a><a class="indexterm" name="id984290"></a>
+ <a class="indexterm" name="id941354"></a><a class="indexterm" name="id941359"></a><a class="indexterm" name="id941364"></a><a class="indexterm" name="id941369"></a><a class="indexterm" name="id941373"></a>
Quadratic r-tree creation algorithm parameters.
 
<h6>
@@ -6079,7 +6091,7 @@
<a name="geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_rstar"></a><a name="classboost_1_1geometry_1_1index_1_1runtime_1_1rstar"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.parameters.boost_geometry_index_runtime_rstar" title="boost::geometry::index::runtime::rstar">boost::geometry::index::runtime::rstar</a>
</h5></div></div></div>

- <a class="indexterm" name="id984763"></a><a class="indexterm" name="id984768"></a><a class="indexterm" name="id984772"></a><a class="indexterm" name="id984777"></a><a class="indexterm" name="id984782"></a>
+ <a class="indexterm" name="id941846"></a><a class="indexterm" name="id941851"></a><a class="indexterm" name="id941856"></a><a class="indexterm" name="id941861"></a><a class="indexterm" name="id941865"></a>
R*-tree creation algorithm parameters.
 
<h6>
@@ -6468,8 +6480,7 @@
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
- will be returned by the query if <code class="literal">bg::covered_by(Indexable, Geometry)</code>
- returns true.
+ will be returned by the query if <code class="literal"><code class="computeroutput">bg::covered_by(Indexable, Geometry)</code></code> returns true.
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.covered_by_geometry_const___.h1"></a>
@@ -6540,8 +6551,7 @@
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
- will be returned by the query if <code class="literal">bg::disjoint(Indexable, Geometry)</code>
- returns true.
+ will be returned by the query if <code class="literal"><code class="computeroutput">bg::disjoint(Indexable, Geometry)</code></code> returns true.
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.disjoint_geometry_const___.h1"></a>
@@ -6612,8 +6622,7 @@
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
- will be returned by the query if <code class="literal">bg::intersects(Indexable, Geometry)</code>
- returns true.
+ will be returned by the query if <code class="literal"><code class="computeroutput">bg::intersects(Indexable, Geometry)</code></code> returns true.
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.intersects_geometry_const___.h1"></a>
@@ -6684,8 +6693,7 @@
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
- will be returned by the query if <code class="literal">bg::overlaps(Indexable, Geometry)</code>
- returns true.
+ will be returned by the query if <code class="literal"><code class="computeroutput">bg::overlaps(Indexable, Geometry)</code></code> returns true.
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.overlaps_geometry_const___.h1"></a>
@@ -6756,8 +6764,7 @@
 </h6>

 Generate a predicate defining Value and Geometry relationship. Value
- will be returned by the query if <code class="literal">bg::within(Indexable, Geometry)</code>
- returns true.
+ will be returned by the query if <code class="literal"><code class="computeroutput">bg::within(Indexable, Geometry)</code></code> returns true.
 
<h6>
<a name="geometry_index.r_tree.reference.group__predicates.within_geometry_const___.h1"></a>
@@ -7312,8 +7319,8 @@
 </td>
<td>
 
- The point relation. This may be generated by <code class="literal">bgi::to_nearest(Point)</code>,
- <code class="literal">bgi::to_centroid(Point)</code> or <code class="literal">bgi::to_furthest(Point)</code>.
+ The point relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(Point)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(Point)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(Point)</code></code>.
 
 </td>
</tr>
@@ -7330,8 +7337,8 @@
 </td>
<td>
 
- The minimum bound relation. This may be generated by <code class="literal">bgi::to_nearest(min_distance)</code>,
- <code class="literal">bgi::to_centroid(min_distance)</code> or <code class="literal">bgi::to_furthest(min_distance)</code>.
+ The minimum bound relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(min_distance)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(min_distance)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(min_distance)</code></code>.
 
 </td>
</tr>
@@ -7408,8 +7415,8 @@
 </td>
<td>
 
- The point relation. This may be generated by <code class="literal">bgi::to_nearest(Point)</code>,
- <code class="literal">bgi::to_centroid(Point)</code> or <code class="literal">bgi::to_furthest(Point)</code>.
+ The point relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(Point)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(Point)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(Point)</code></code>.
 
 </td>
</tr>
@@ -7426,8 +7433,8 @@
 </td>
<td>
 
- The maximum bound relation. This may be generated by <code class="literal">bgi::to_nearest(max_distance)</code>,
- <code class="literal">bgi::to_centroid(max_distance)</code> or <code class="literal">bgi::to_furthest(max_distance)</code>.
+ The maximum bound relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(max_distance)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(max_distance)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(max_distance)</code></code>.
 
 </td>
</tr>
@@ -7509,8 +7516,8 @@
 </td>
<td>
 
- The point relation. This may be generated by <code class="literal">bgi::to_nearest(Point)</code>,
- <code class="literal">bgi::to_centroid(Point)</code> or <code class="literal">bgi::to_furthest(Point)</code>.
+ The point relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(Point)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(Point)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(Point)</code></code>.
 
 </td>
</tr>
@@ -7527,8 +7534,8 @@
 </td>
<td>
 
- The minimum bound relation. This may be generated by <code class="literal">bgi::to_nearest(min_distance)</code>,
- <code class="literal">bgi::to_centroid(min_distance)</code> or <code class="literal">bgi::to_furthest(min_distance)</code>.
+ The minimum bound relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(min_distance)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(min_distance)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(min_distance)</code></code>.
 
 </td>
</tr>
@@ -7545,8 +7552,8 @@
 </td>
<td>
 
- The maximum bound relation. This may be generated by <code class="literal">bgi::to_nearest(max_distance)</code>,
- <code class="literal">bgi::to_centroid(max_distance)</code> or <code class="literal">bgi::to_furthest(max_distance)</code>.
+ The maximum bound relation. This may be generated by <code class="literal"><code class="computeroutput">bgi::to_nearest(max_distance)</code></code>,
+ <code class="literal"><code class="computeroutput">bgi::to_centroid(max_distance)</code></code> or <code class="literal"><code class="computeroutput">bgi::to_furthest(max_distance)</code></code>.
 
 </td>
</tr>
@@ -7872,7 +7879,7 @@
<a name="geometry_index.r_tree.reference.translators.boost_geometry_index_translator_def"></a><a name="structboost_1_1geometry_1_1index_1_1translator_1_1def"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.translators.boost_geometry_index_translator_def" title="boost::geometry::index::translator::def">boost::geometry::index::translator::def</a>
</h5></div></div></div>

- <a class="indexterm" name="id995883"></a><a class="indexterm" name="id995887"></a><a class="indexterm" name="id995892"></a><a class="indexterm" name="id995897"></a><a class="indexterm" name="id995902"></a>
+ <a class="indexterm" name="id954890"></a><a class="indexterm" name="id954894"></a><a class="indexterm" name="id954899"></a><a class="indexterm" name="id954904"></a><a class="indexterm" name="id954909"></a>
The default translator.
 
<h6>
@@ -7942,7 +7949,7 @@
<a name="geometry_index.r_tree.reference.translators.boost_geometry_index_translator_index"></a><a name="classboost_1_1geometry_1_1index_1_1translator_1_1index"></a><a class="link" href="reference.html#geometry_index.r_tree.reference.translators.boost_geometry_index_translator_index" title="boost::geometry::index::translator::index">boost::geometry::index::translator::index</a>
</h5></div></div></div>

- <a class="indexterm" name="id996173"></a><a class="indexterm" name="id996178"></a><a class="indexterm" name="id996183"></a><a class="indexterm" name="id996187"></a><a class="indexterm" name="id996192"></a>
+ <a class="indexterm" name="id955180"></a><a class="indexterm" name="id955185"></a><a class="indexterm" name="id955190"></a><a class="indexterm" name="id955194"></a><a class="indexterm" name="id955199"></a>
The index translator.
 
<h6>

Modified: sandbox-branches/geometry/index/doc/html/index.html
==============================================================================
--- sandbox-branches/geometry/index/doc/html/index.html (original)
+++ sandbox-branches/geometry/index/doc/html/index.html 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -56,7 +56,7 @@
</div>
</div>
<table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
-<td align="left">Last revised: January 13, 2013 at 20:01:19 GMT</td>
+<td align="left">Last revised: January 14, 2013 at 17:39:48 GMT</td>
<td align="right"><div class="copyright-footer"></div></td>
</tr></table>
<hr>

Modified: sandbox-branches/geometry/index/doc/src/tools/doxygen_xml2qbk/doxygen_xml_parser.hpp
==============================================================================
--- sandbox-branches/geometry/index/doc/src/tools/doxygen_xml2qbk/doxygen_xml_parser.hpp (original)
+++ sandbox-branches/geometry/index/doc/src/tools/doxygen_xml2qbk/doxygen_xml_parser.hpp 2013-01-14 12:40:31 EST (Mon, 14 Jan 2013)
@@ -62,7 +62,14 @@
So we have to list explicitly either where to recurse, or where not to...

*/
-static void parse_para(rapidxml::xml_node<>* node, configuration const& config, std::string& contents, bool& skip, bool first = true, bool in_block = false)
+enum text_block
+{
+ not_in_block,
+ in_code_block,
+ in_block
+};
+
+static void parse_para(rapidxml::xml_node<>* node, configuration const& config, std::string& contents, bool& skip, bool first = true, text_block tb = not_in_block)
{
 if (node != NULL)
 {
@@ -78,49 +85,49 @@
 else if ( boost::equals(name, "itemizedlist") )
 {
 contents += "\n\n";
- parse_para(node->first_node(), config, contents, skip, true, in_block);
+ parse_para(node->first_node(), config, contents, skip, true, tb);
 contents += "\n";
- parse_para(node->next_sibling(), config, contents, skip, true, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, true, tb);
 return;
 }
 else if ( boost::equals(name, "listitem") )
 {
 contents += "* ";
- parse_para(node->first_node(), config, contents, skip, true, in_block);
+ parse_para(node->first_node(), config, contents, skip, true, tb);
 contents += "\n";
- parse_para(node->next_sibling(), config, contents, skip, true, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, true, tb);
 return;
 }
 else if ( boost::equals(name, "verbatim") )
 {
 contents += "\n``\n";
- parse_para(node->first_node(), config, contents, skip, false, in_block);
+ parse_para(node->first_node(), config, contents, skip, false, tb);
 contents += "``\n";
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 return;
 }
 else if ( boost::equals(name, "bold") )
 {
 contents += "[*";
- parse_para(node->first_node(), config, contents, skip, false, true);
+ parse_para(node->first_node(), config, contents, skip, false, in_block);
 contents += "]";
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 return;
 }
 else if ( boost::equals(name, "emphasis") )
 {
 contents += "['";
- parse_para(node->first_node(), config, contents, skip, false, true);
+ parse_para(node->first_node(), config, contents, skip, false, in_block);
 contents += "]";
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 return;
 }
 else if ( boost::equals(name, "computeroutput") )
 {
 contents += "[^";
- parse_para(node->first_node(), config, contents, skip, false, true);
+ parse_para(node->first_node(), config, contents, skip, false, tb == in_block ? in_block : in_code_block);
 contents += "]";
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 return;
 }
 else if ( boost::equals(name, "ref") )
@@ -132,9 +139,9 @@
 if ( !refid.empty() )
 {
 contents += std::string("[link ") + refid + " ";
- parse_para(node->first_node(), config, contents, skip, false, true);
+ parse_para(node->first_node(), config, contents, skip, false, in_block);
 contents += "]";
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 return;
 }
 }
@@ -151,18 +158,17 @@
 else if (node->type() == rapidxml::node_data)
 {
 std::string str = node->value();
-
- if ( str.find("aaa") != std::string::npos )
- {
- int a = 10;
- }
-
- if ( in_block )
+ if ( tb == in_block )
 {
 boost::replace_all(str, "\\", "\\\\");
 boost::replace_all(str, "[", "\\[");
 boost::replace_all(str, "]", "\\]");
 }
+ else if ( tb == in_code_block )
+ {
+ if ( str.find('`') == std::string::npos )
+ str = std::string("`") + str + "`";
+ }
 contents += str;
 //std::cout << "DATA: " << node->name() << "=" << node->value() << std::endl;
 }
@@ -171,8 +177,8 @@
 //std::cout << "OTHER: " << node->name() << "=" << node->value() << std::endl;
 }

- parse_para(node->first_node(), config, contents, skip, false, in_block);
- parse_para(node->next_sibling(), config, contents, skip, false, in_block);
+ parse_para(node->first_node(), config, contents, skip, false, tb);
+ parse_para(node->next_sibling(), config, contents, skip, false, tb);
 }
}

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