- + +The R-tree spatial index.
- The copy constructor. It uses parameters, translator and allocator - from the source tree. + The copy constructor.
- The moving constructor. It uses parameters, translator and allocator - from the source tree. + The moving constructor.
- The assignment operator. It uses parameters and translator from - the source tree. + The assignment operator.
- The moving assignment. It uses parameters and translator from - the source tree. + The moving assignment.
- Swaps contents of two rtrees. Parameters, translator and allocators - are swapped as well. + Swaps contents of two rtrees.
- Remove a value from the container. In contrast to the STL set/map - erase() method this method removes only one value from the container. + Remove a value from the container.
- Remove a range of values from the container. In contrast to the - STL set/map erase() method it doesn't take iterators pointing - to values stored in this container. It removes values equal to - these passed as a range. Furthermore this method removes only - one value for each one passed in the range, not all equal values. + Remove a range of values from the container.
- Remove a range of values from the container. In contrast to the - STL set/map erase() method it removes values equal to these passed - as a range. Furthermore, this method removes only one value for - each one passed in the range, not all equal values. + Remove a range of values from the container.
Finds values meeting spatial predicates, e.g. intersecting some - box. + Box.
Predicates const &: pred: - The spatial predicates. May be a Geometry (in this case default - predicate - intersects is used) or generated by bgi::covered_by(geometry), - bgi::disjoint(geometry), bgi::intersects(geometry), bgi::overlaps(geometry), - bgi::within(geometry), !bgi::covered_by(geometry), !bgi::disjoint(geometry), - !bgi::intersects(geometry), !bgi::overlaps(geometry), !bgi::within(geometry) - or bgi::value(func). Those predicates may be passed together - in std::pair or boost::tuple. + The spatial predicates or a Geometry.
OutIter: out_it: @@ -711,25 +693,13 @@
Finds one value meeting distances predicates, e.g. nearest to - some point. + some Point.
DistancesPredicates const &: - dpred: The distances predicates. May be - a Point. This is default case where Value which nearest point - is closest to Point is returned. May be a PointRelation which - define how distance to Value is calculated. This may be generated - by bgi::to_nearest(Point), bgi::to_centroid(Point) or bgi::to_furthest(Point). - DistancesPredicates may also define distances bounds. E.g. that - some distance must be between min_distance and max_distance. - This may be generated by bgi::unbounded(PointRelation) - default - case, bgi::min_bounded(PointRelation, MinRelation), bgi::max_bounded(PointRelation, - MaxRelation), bgi::bounded(PointRelation, MinRelation, MaxRelation). - MinRelation and MaxRelation describes bounds and may be generated - by bgi::to_nearest(dist_bound), bgi::to_centroid(dist_bound) - or bgi::to_furthest(dist_bound). + dpred: The distances predicates or a Point.
value_type &: v: @@ -757,35 +727,17 @@
Finds one value meeting distances predicates and spatial predicates, - e.g. nearest to some point and intersecting some box. + e.g. nearest to some Point and intersecting some Box.
DistancesPredicates const &: - dpred: The distances predicates. May be - a Point. This is default case where Value which nearest point - is closest to Point is returned. May be a PointRelation which - define how distance to Value is calculated. This may be generated - by bgi::to_nearest(Point), bgi::to_centroid(Point) or bgi::to_furthest(Point). - DistancesPredicates may also define distances bounds. E.g. that - some distance must be between min_distance and max_distance. - This may be generated by bgi::unbounded(PointRelation) - default - case, bgi::min_bounded(PointRelation, MinRelation), bgi::max_bounded(PointRelation, - MaxRelation), bgi::bounded(PointRelation, MinRelation, MaxRelation). - MinRelation and MaxRelation describes bounds and may be generated - by bgi::to_nearest(dist_bound), bgi::to_centroid(dist_bound) - or bgi::to_furthest(dist_bound). + dpred: The distances predicates or a Point.
Predicates const &: pred: - The spatial predicates. May be a Geometry (in this case default - predicate - intersects is used) or generated by bgi::covered_by(geometry), - bgi::disjoint(geometry), bgi::intersects(geometry), bgi::overlaps(geometry), - bgi::within(geometry), !bgi::covered_by(geometry), !bgi::disjoint(geometry), - !bgi::intersects(geometry), !bgi::overlaps(geometry), !bgi::within(geometry) - or bgi::value(func). Those predicates may be passed together - in std::pair or boost::tuple. + The spatial predicates or a Geometry
value_type &: v: @@ -813,25 +765,13 @@
Finds k values meeting distances predicates, e.g. k nearest values - to some point. + to some Point.
DistancesPredicates const &: - dpred: The distances predicates. May be - a Point. This is default case where Value which nearest point - is closest to Point is returned. May be a PointRelation which - define how distance to Value is calculated. This may be generated - by bgi::to_nearest(Point), bgi::to_centroid(Point) or bgi::to_furthest(Point). - DistancesPredicates may also define distances bounds. E.g. that - some distance must be between min_distance and max_distance. - This may be generated by bgi::unbounded(PointRelation) - default - case, bgi::min_bounded(PointRelation, MinRelation), bgi::max_bounded(PointRelation, - MaxRelation), bgi::bounded(PointRelation, MinRelation, MaxRelation). - MinRelation and MaxRelation describes bounds and may be generated - by bgi::to_nearest(dist_bound), bgi::to_centroid(dist_bound) - or bgi::to_furthest(dist_bound). + dpred: The distances predicates or a Point.
size_t: k: @@ -866,25 +806,13 @@
Finds k values meeting distances predicates and spatial predicates, - e.g. k nearest values to some point and intersecting some box. + e.g. k nearest values to some Point and intersecting some Box.
DistancesPredicates const &: - dpred: The distances predicates. May be - a Point. This is default case where Value which nearest point - is closest to Point is returned. May be a PointRelation which - define how distance to Value is calculated. This may be generated - by bgi::to_nearest(Point), bgi::to_centroid(Point) or bgi::to_furthest(Point). - DistancesPredicates may also define distances bounds. E.g. that - some distance must be between min_distance and max_distance. - This may be generated by bgi::unbounded(PointRelation) - default - case, bgi::min_bounded(PointRelation, MinRelation), bgi::max_bounded(PointRelation, - MaxRelation), bgi::bounded(PointRelation, MinRelation, MaxRelation). - MinRelation and MaxRelation describes bounds and may be generated - by bgi::to_nearest(dist_bound), bgi::to_centroid(dist_bound) - or bgi::to_furthest(dist_bound). + dpred: The distances predicates or a Point
size_t: k: @@ -892,13 +820,7 @@
Predicates const &: pred: - The spatial predicates. May be a Geometry (in this case default - predicate - intersects is used) or generated by bgi::covered_by(geometry), - bgi::disjoint(geometry), bgi::intersects(geometry), bgi::overlaps(geometry), - bgi::within(geometry), !bgi::covered_by(geometry), !bgi::disjoint(geometry), - !bgi::intersects(geometry), !bgi::overlaps(geometry), !bgi::within(geometry) - or bgi::value(func). Those predicates may be passed together - in std::pair or boost::tuple. + The spatial predicates or a Geometry.
OutIter: out_it: diff --git a/doc/html/index.html b/doc/html/index.html index a5aed9f76..7abb14091 100644 --- a/doc/html/index.html +++ b/doc/html/index.html @@ -57,7 +57,7 @@
Last revised: January 07, 2013 at 03:21:24 GMT |
+Last revised: January 07, 2013 at 04:43:31 GMT |