UGDK
0.5.0
|
#include <ugdk/structure/intervalkdtree.h>
Public Member Functions | |
IntervalKDTree (const Box< DIMENSIONS > &tree_bounding_box, unsigned int max_elements_per_leaf) | |
~IntervalKDTree () | |
void | Clear () |
void | Insert (const Box< DIMENSIONS > &bounding_box, const T &element) |
void | Remove (const T &element) |
void | Update (const Box< DIMENSIONS > &new_bounding_box, const T &element) |
template<class OutputIterator > | |
void | FindIntersectingItems (const Box< DIMENSIONS > &boundary, OutputIterator output) const |
std::map< T, Item< T, DIMENSIONS > * >::const_iterator | begin () const |
std::map< T, Item< T, DIMENSIONS > * >::const_iterator | end () const |
unsigned int | max_elements_per_leaf () const |
ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::IntervalKDTree | ( | const Box< DIMENSIONS > & | tree_bounding_box, |
unsigned int | max_elements_per_leaf | ||
) |
ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::~IntervalKDTree | ( | ) |
std::map< T, Item< T, DIMENSIONS > * >::const_iterator ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::begin | ( | ) | const |
void ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::Clear | ( | ) |
std::map< T, Item< T, DIMENSIONS > * >::const_iterator ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::end | ( | ) | const |
void ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::FindIntersectingItems | ( | const Box< DIMENSIONS > & | boundary, |
OutputIterator | output | ||
) | const |
void ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::Insert | ( | const Box< DIMENSIONS > & | bounding_box, |
const T & | element | ||
) |
unsigned int ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::max_elements_per_leaf | ( | ) | const |
void ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::Remove | ( | const T & | element | ) |
void ugdk::structure::ikdtree::IntervalKDTree< T, DIMENSIONS >::Update | ( | const Box< DIMENSIONS > & | new_bounding_box, |
const T & | element | ||
) |