Namespaces | |
| adaptors | |
| detail | |
Classes | |
| class | dynamic_linear |
| Linear r-tree creation algorithm parameters - run-time version. More... | |
| class | dynamic_quadratic |
| Quadratic r-tree creation algorithm parameters - run-time version. More... | |
| class | dynamic_rstar |
| R*-tree creation algorithm parameters - run-time version. More... | |
| struct | equal_to |
| The function object comparing Values. More... | |
| struct | indexable |
| The function object extracting Indexable from Value. More... | |
| class | insert_iterator |
| struct | linear |
| Linear r-tree creation algorithm parameters. More... | |
| struct | quadratic |
| Quadratic r-tree creation algorithm parameters. More... | |
| struct | rstar |
| R*-tree creation algorithm parameters. More... | |
| class | rtree |
| The R-tree spatial index. More... | |
Functions | |
| template<typename Container > | |
| insert_iterator< Container > | inserter (Container &c) |
| Insert iterator generator. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::contains_tag, false > | contains (Geometry const &g) |
Generate contains() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::covered_by_tag, false > | covered_by (Geometry const &g) |
Generate covered_by() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::covers_tag, false > | covers (Geometry const &g) |
Generate covers() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::disjoint_tag, false > | disjoint (Geometry const &g) |
Generate disjoint() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::intersects_tag, false > | intersects (Geometry const &g) |
Generate intersects() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::overlaps_tag, false > | overlaps (Geometry const &g) |
Generate overlaps() predicate. More... | |
| template<typename Geometry > | |
| detail::spatial_predicate < Geometry, detail::within_tag, false > | within (Geometry const &g) |
Generate within() predicate. More... | |
| template<typename UnaryPredicate > | |
| detail::satisfies < UnaryPredicate, false > | satisfies (UnaryPredicate const &pred) |
| Generate satisfies() predicate. More... | |
| template<typename Geometry > | |
| detail::nearest< Geometry > | nearest (Geometry const &geometry, unsigned k) |
| Generate nearest() predicate. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| void | insert (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, Value const &v) |
| Insert a value to the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename Iterator > | |
| void | insert (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, Iterator first, Iterator last) |
| Insert a range of values to the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename ConvertibleOrRange > | |
| void | insert (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, ConvertibleOrRange const &conv_or_rng) |
| Insert a value created using convertible object or a range of values to the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::size_type | remove (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, Value const &v) |
| Remove a value from the container. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename Iterator > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::size_type | remove (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, Iterator first, Iterator last) |
| Remove a range of values from the container. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename ConvertibleOrRange > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::size_type | remove (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree, ConvertibleOrRange const &conv_or_rng) |
| Remove a value corresponding to an object convertible to it or a range of values from the container. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename Predicates , typename OutIter > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::size_type | query (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree, Predicates const &predicates, OutIter out_it) |
| Finds values meeting passed predicates e.g. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator , typename Predicates > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > ::const_query_iterator | qbegin (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree, Predicates const &predicates) |
| Returns the query iterator pointing at the begin of the query range. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > ::const_query_iterator | qend (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree) |
| Returns the query iterator pointing at the end of the query range. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| void | clear (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &tree) |
| Remove all values from the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| size_t | size (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree) |
| Get the number of values stored in the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| bool | empty (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree) |
| Query if there are no values stored in the index. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator >::bounds_type | bounds (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > const &tree) |
| Get the box containing all stored values or an invalid box if the index has no values. More... | |
| template<typename Value , typename Parameters , typename IndexableGetter , typename EqualTo , typename Allocator > | |
| void | swap (rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &l, rtree< Value, Parameters, IndexableGetter, EqualTo, Allocator > &r) |
| Exchanges the contents of the container with those of other. More... | |