Boost C++ Libraries

...one of the most highly regarded and expertly designed C++ library projects in the world. Herb Sutter and Andrei Alexandrescu, C++ Coding Standards

This is the documentation for an old version of Boost. Click here to view this page for the latest version.
PrevUpHomeNext

R-tree free functions (boost::geometry::index::)

insert(rtree<...> &, Value const &)
insert(rtree<...> &, Iterator, Iterator)
insert(rtree<...> &, ConvertibleOrRange const &)
remove(rtree<...> &, Value const &)
remove(rtree<...> &, Iterator, Iterator)
remove(rtree<...> &, ConvertibleOrRange const &)
query(rtree<...> const &, Predicates const &, OutIter)
qbegin(rtree<...> const &, Predicates const &)
qend(rtree<...> const &)
begin(rtree<...> const &)
end(rtree<...> const &)
clear(rtree<...> &)
size(rtree<...> const &)
empty(rtree<...> const &)
bounds(rtree<...> const &)
swap(rtree<...> &, rtree<...> &)
Functions

Function

Description

insert(rtree<...> &, Value const &)

Insert a value to the index.

insert(rtree<...> &, Iterator, Iterator)

Insert a range of values to the index.

insert(rtree<...> &, ConvertibleOrRange const &)

Insert a value created using convertible object or a range of values to the index.

remove(rtree<...> &, Value const &)

Remove a value from the container.

remove(rtree<...> &, Iterator, Iterator)

Remove a range of values from the container.

remove(rtree<...> &, ConvertibleOrRange const &)

Remove a value corresponding to an object convertible to it or a range of values from the container.

query(rtree<...> const &, Predicates const &, OutIter)

Finds values meeting passed predicates e.g. nearest to some Point and/or intersecting some Box.

qbegin(rtree<...> const &, Predicates const &)

Returns the query iterator pointing at the begin of the query range.

qend(rtree<...> const &)

Returns the query iterator pointing at the end of the query range.

begin(rtree<...> const &)

Returns the iterator pointing at the begin of the rtree values range.

end(rtree<...> const &)

Returns the iterator pointing at the end of the rtree values range.

clear(rtree<...> &)

Remove all values from the index.

size(rtree<...> const &)

Get the number of values stored in the index.

empty(rtree<...> const &)

Query if there are no values stored in the index.

bounds(rtree<...> const &)

Get the box containing all stored values or an invalid box if the index has no values.

swap(rtree<...> &, rtree<...> &)

Exchanges the contents of the container with those of other.


PrevUpHomeNext