|
| KDTreeBase (uint04 bucket_size) |
|
| KDTreeBase (const KDTreeBase< t_dims, t_type > &tree) |
|
| KDTreeBase (KDTreeBase< t_dims, t_type > &&tree) |
|
template<class t_node_type > |
bool | validate (const Buffer< t_node_type > &elements) |
|
uint04 | getIndex (uint04 index) const |
|
void | clear () |
|
uint04 | getNumberOfNodes () const |
|
const KDNode< t_dims, t_type > & | getNode (uint04 node_id) const |
|
void | removeIndices (const Buffer< bool > &deletion_indices) |
|
void | removeIndices (uint04 begin, uint04 end) |
|
void | addIndices (const Buffer< bool > &insertion_indices) |
|
void | addIndices (uint04 begin, uint04 end) |
|
uint04 | size () const |
|
void | removeIndex (uint04 index) const |
|
Bounds< t_dims, t_type > | _getBounds (const Buffer< uint04 > &indices, const t_buffer_type &elements, uint04 start, uint04 end) |
|
void | addIndex (uint04 index) const |
|
const Buffer< uint04 > & | indices () const |
|
void | sortVertices (const t_buffer_type &elements, t_buffer_type &sorted) const |
|
TreeBase & | operator= (const TreeBase &value) |
|
TreeBase & | operator= (TreeBase &&value) |
|
uint04 | indexSize () const |
|
uint04 | nodeSize () const |
|
|
| KDTreeBase (const Buffer< KDNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) |
|
template<class t_node_type , class t_buffer_type > |
uint04 | _calculateAndSplit (uint04 node_index, Bounds< t_dims, t_type > node_bounds, const t_buffer_type &elements, Buffer< uint04 > &indices, uint04 start, uint04 end, bool is_precise) |
|
template<class t_node_type , class t_buffer_type > |
bool | _balanceLeafNode (uint04 top_index, const t_buffer_type &elements, Buffer< uint04 > &indices, uint04 top_start, uint04 top_end, bool is_precise, ProgressInfo *progress=nullptr) |
|
template<class t_node_type , class t_buffer_type > |
bool | _getClosestElement (uint04 top_index, const Vector< t_dims, t_type > &point, const t_buffer_type &elements, t_type &min_distance, const t_type epsilon, uint04 &min_index) const |
|
template<class t_node_type , class t_buffer_type > |
void | _getClosestElements (uint04 top_index, const Vector< t_dims, t_type > &point, const t_buffer_type &elements, t_type &min_distance, const t_type &epsilon, MinHeap< t_type, uint04 > &heap, uint04 size) const |
|
template<class t_node_type , class t_buffer_type > |
bool | _getClosestElement (uint04 top_index, const LineSegment< t_dims, t_type > &top_line, const t_buffer_type &elements, t_type &min_distance, t_type epsilon, uint04 &min_index) const |
|
template<class t_node_type , class t_buffer_type > |
bool | _getClosestElement (uint04 top_index, const Triangle< t_dims, t_type > &triangle, const t_buffer_type &elements, t_type &min_distance, t_type epsilon, uint04 &min_index) const |
|
template<class t_node_type , class t_area_type , class t_buffer_type > |
void | _getEnclosedElements (uint04 top_node, t_area_type area, Buffer< bool > &indices, const t_buffer_type &elements) const |
|
template<class t_area_type , class t_node_type , class t_buffer_type > |
uint04 | _getNumberOfEnclosedElements (uint04 top_node, const t_area_type &area, const t_buffer_type &elements) const |
|
template<class t_node_type , class t_buffer_type > |
void | _removeValue (uint04 top_node, uint04 index, const t_buffer_type &elements) |
|
template<class t_node_type , class t_buffer_type > |
void | _moveValue (uint04 top_node, uint04 index, const t_node_type &new_location, const t_buffer_type &elements) |
|
bool | needsRebalance (uint04 left_size, uint04 right_size) |
|
bool | useBulkResize (uint04 change_size) |
|
template<class t_node_type , class t_buffer_type > |
void | _addValues (uint04 top_node, Buffer< uint04 > indices, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) |
|
template<class t_node_type , class t_buffer_type > |
void | _addValue (uint04 node_index, uint04 index, const t_buffer_type &elements) |
|
template<class t_node_type , class t_buffer_type > |
bool | recalculateBounds (uint04 node_index, const t_buffer_type &elements) |
|
void | _makeWriteable () |
|
| TreeBase (uint04 bucket_size) |
|
| TreeBase (const TreeBase &tree) |
|
| TreeBase (TreeBase &&tree) |
|
| TreeBase (const Buffer< KDNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) |
|
virtual | ~TreeBase () |
|
Buffer< uint04 > | prepareAddAll (const Buffer< bool > &index_values) |
|
Buffer< uint04 > | prepareAddAll (uint04 start_index, uint04 end_index, const t_buffer_type &elements) |
|
uint04 | getNumberOfFreeIndices () |
|
uint04 | getNumberOfFreeNodes () |
|
void | splitLeafNode (uint04 index) |
|
void | reclaimChildren (uint04 index) |
|
void | _getAllT (const uint04 &node_index, Buffer< bool > &indices) const |
|
void | _getAll (const uint04 &node_index, Buffer< uint04 > &indices) const |
|