mdds
|
Classes | |
class | bulk_loader |
class | const_iterator |
class | const_search_results |
struct | extent_type |
class | iterator |
class | iterator_base |
struct | node_properties |
struct | point_type |
class | search_results |
class | search_results_base |
Public Types | |
using | key_type = _Key |
using | value_type = _Value |
using | node_type = detail::rtree::node_type |
using | export_tree_type = detail::rtree::export_tree_type |
using | search_type = detail::rtree::search_type |
using | integrity_check_properties = detail::rtree::integrity_check_properties |
Public Member Functions | |
rtree (rtree &&other) | |
rtree (const rtree &other) | |
rtree & | operator= (const rtree &other) |
rtree & | operator= (rtree &&other) |
void | insert (const extent_type &extent, value_type &&value) |
void | insert (const extent_type &extent, const value_type &value) |
void | insert (const point_type &position, value_type &&value) |
void | insert (const point_type &position, const value_type &value) |
const_search_results | search (const point_type &pt, search_type st) const |
search_results | search (const point_type &pt, search_type st) |
const_search_results | search (const extent_type &extent, search_type st) const |
search_results | search (const extent_type &extent, search_type st) |
void | erase (const const_iterator &pos) |
void | erase (const iterator &pos) |
const extent_type & | extent () const |
bool | empty () const |
size_t | size () const |
void | swap (rtree &other) |
void | clear () |
template<typename _Func > | |
void | walk (_Func func) const |
void | check_integrity (const integrity_check_properties &props) const |
std::string | export_tree (export_tree_type mode) const |
void mdds::rtree< _Key, _Value, _Trait >::check_integrity | ( | const integrity_check_properties & | props | ) | const |
Check the integrity of the entire tree structure.
props | specify how the check is to be performed. |
integrity_error | if the integrity check fails. |
void mdds::rtree< _Key, _Value, _Trait >::clear | ( | ) |
Empty the entire container.
bool mdds::rtree< _Key, _Value, _Trait >::empty | ( | ) | const |
Check whether or not the tree stores any objects.
void mdds::rtree< _Key, _Value, _Trait >::erase | ( | const const_iterator & | pos | ) |
Erase the value object referenced by the iterator passed to this method.
The iterator object will become invalid if the call results in an erasure of a value.
pos | iterator that refernces the value object to erase. |
void mdds::rtree< _Key, _Value, _Trait >::erase | ( | const iterator & | pos | ) |
Erase the value object referenced by the iterator passed to this method.
The iterator object will become invalid if the call results in an erasure of a value.
pos | iterator that refernces the value object to erase. |
std::string mdds::rtree< _Key, _Value, _Trait >::export_tree | ( | export_tree_type | mode | ) | const |
Export the structure of a tree in textural format.
mode | specify the format in which to represent the structure of a tree. |
const extent_type& mdds::rtree< _Key, _Value, _Trait >::extent | ( | ) | const |
Get the minimum bounding extent of the root node of the tree. The extent returned from this method is the minimum extent that contains the extents of all objects stored in the tree.
void mdds::rtree< _Key, _Value, _Trait >::insert | ( | const extent_type & | extent, |
value_type && | value | ||
) |
Insert a new value associated with a bounding box. The new value object will be moved into the container.
extent | bounding box associated with the value. |
value | value being inserted. |
void mdds::rtree< _Key, _Value, _Trait >::insert | ( | const extent_type & | extent, |
const value_type & | value | ||
) |
Insert a new value associated with a bounding box. A copy of the new value object will be placed into the container.
extent | bounding box associated with the value. |
value | value being inserted. |
void mdds::rtree< _Key, _Value, _Trait >::insert | ( | const point_type & | position, |
value_type && | value | ||
) |
Insert a new value associated with a point. The new value object will be moved into the container.
position | point associated with the value. |
value | value being inserted. |
void mdds::rtree< _Key, _Value, _Trait >::insert | ( | const point_type & | position, |
const value_type & | value | ||
) |
Insert a new value associated with a point. A copy of the new value object will be placed into the container.
position | point associated with the value. |
value | value being inserted. |
const_search_results mdds::rtree< _Key, _Value, _Trait >::search | ( | const point_type & | pt, |
search_type | st | ||
) | const |
Search the tree and collect all value objects whose extents either contain the specified point, or exactly match the specified point.
pt | reference point to use for the search. |
st | search type that determines the satisfying condition of the search with respect to the reference point. |
search_results mdds::rtree< _Key, _Value, _Trait >::search | ( | const point_type & | pt, |
search_type | st | ||
) |
Search the tree and collect all value objects whose extents either contain the specified point, or exactly match the specified point.
pt | reference point to use for the search. |
st | search type that determines the satisfying condition of the search with respect to the reference point. |
const_search_results mdds::rtree< _Key, _Value, _Trait >::search | ( | const extent_type & | extent, |
search_type | st | ||
) | const |
Search the tree and collect all value objects whose extents either overlaps with the specified extent, or exactly match the specified extent.
extent | reference extent to use for the search. |
st | search type that determines the satisfying condition of the search with respect to the reference extent. |
search_results mdds::rtree< _Key, _Value, _Trait >::search | ( | const extent_type & | extent, |
search_type | st | ||
) |
Search the tree and collect all value objects whose extents either overlaps with the specified extent, or exactly match the specified extent.
extent | reference extent to use for the search. |
st | search type that determines the satisfying condition of the search with respect to the reference extent. |
size_t mdds::rtree< _Key, _Value, _Trait >::size | ( | ) | const |
Return the number of value nodes currently stored in the tree.
void mdds::rtree< _Key, _Value, _Trait >::swap | ( | rtree< _Key, _Value, _Trait > & | other | ) |
Swap the content of the tree with another instance.
other | another instance to swap the content with. |
void mdds::rtree< _Key, _Value, _Trait >::walk | ( | _Func | func | ) | const |
Walk down the entire tree depth first.
function or function object that gets called at each node in the tree.