 |
API Documentation
|
|
API Documentation
|
This is the complete list of members for KDTree< t_dims, t_type >, including all inherited members.
| _addValue(uint04 node_index, uint04 index, const t_buffer_type &elements) | KDTreeBase< t_dims, t_type > | inlineprotected |
| _addValues(uint04 top_node, Buffer< uint04 > indices, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | KDTreeBase< t_dims, t_type > | inlineprotected |
| _balanceLeafNode(uint04 top_index, const t_buffer_type &elements, Buffer< uint04 > &indices, uint04 top_start, uint04 top_end, bool is_precise, ProgressInfo *progress=nullptr) | KDTreeBase< t_dims, t_type > | inlineprotected |
| _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) | KDTreeBase< t_dims, t_type > | inlineprotected |
| _getAll(const uint04 &node_index, Buffer< uint04 > &indices) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| _getAllT(const uint04 &node_index, Buffer< bool > &indices) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| _getBounds(const Buffer< uint04 > &indices, const t_buffer_type &elements, uint04 start, uint04 end) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| _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 | KDTreeBase< t_dims, t_type > | inlineprotected |
| _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 | KDTreeBase< t_dims, t_type > | inlineprotected |
| _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 | KDTreeBase< t_dims, t_type > | inlineprotected |
| _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 | KDTreeBase< t_dims, t_type > | inlineprotected |
| _getEnclosedElements(uint04 top_node, t_area_type area, Buffer< bool > &indices, const t_buffer_type &elements) const | KDTreeBase< t_dims, t_type > | inlineprotected |
| _getNumberOfEnclosedElements(uint04 top_node, const t_area_type &area, const t_buffer_type &elements) const | KDTreeBase< t_dims, t_type > | inlineprotected |
| _makeWriteable() | KDTreeBase< t_dims, t_type > | inlineprotected |
| _moveValue(uint04 top_node, uint04 index, const t_node_type &new_location, const t_buffer_type &elements) | KDTreeBase< t_dims, t_type > | inlineprotected |
| _removeValue(uint04 top_node, uint04 index, const t_buffer_type &elements) | KDTreeBase< t_dims, t_type > | inlineprotected |
| addIndex(uint04 index) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| addIndices(const Buffer< bool > &insertion_indices) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| addIndices(uint04 begin, uint04 end) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| addValue(uint04 index, const t_buffer_type &elements, bool rebalance) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| addValues(const Buffer< bool > &insertion_indices, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| addValues(const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| addValues(uint04 start_index, uint04 end_index, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| addValues(const Buffer< uint04 > &indices, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| clear() | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| closestElement(const t_reference_type &point, const t_buffer_type &elements, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| closestElement(const t_reference_type &point, const t_buffer_type &elements, t_type &max_distance_squared, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| closestElementPresorted(const t_reference_type &point, const t_buffer_type &elements, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| closestElementPresorted(const t_reference_type &point, const t_buffer_type &elements, t_type &max_distance_squared, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| closestElements(const t_reference_type &point, uint04 size, Buffer< uint04 > &indices, const t_buffer_type &elements, t_type &max_distance, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| closestElements(const t_reference_type &point, uint04 size, MinHeap< t_type, uint04 > &value_heap, const t_buffer_type &elements, t_type &max_distance, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| enclosedElements(const t_area_type &area, Buffer< uint04 > &indices, const t_buffer_type &elements) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| enclosedElements(const t_area_type &area, Buffer< bool > &indices, const t_buffer_type &elements) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| getAll(Buffer< bool > &indices) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| getAll(Buffer< uint04 > &indices) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| getChangedElements(const t_area_type &new_area, const t_area_type &old_area, Buffer< bool > &indices, const t_buffer_type &elements, bool allow_enable, bool allow_disable) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| getIndex(uint04 index) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| getNode(uint04 node_id) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| getNumberOfEnclosedElements(const t_area_type &area, const t_buffer_type &elements) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| getNumberOfFreeIndices() | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| getNumberOfFreeNodes() | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| getNumberOfNodes() const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| getTreeType() const override | KDTree< t_dims, t_type > | inlinevirtual |
| indexSize() const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| indices() const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| KDTree(uint04 bucket_size) | KDTree< t_dims, t_type > | inlineexplicit |
| KDTree(const KDTreeBase< t_dims, t_type > &tree) | KDTree< t_dims, t_type > | inline |
| KDTree(KDTreeBase< t_dims, t_type > &&tree) | KDTree< t_dims, t_type > | inline |
| KDTree(const Buffer< KDNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) | KDTree< t_dims, t_type > | inlineprotected |
| KDTreeBase(uint04 bucket_size) | KDTreeBase< t_dims, t_type > | inlineexplicit |
| KDTreeBase(const KDTreeBase< t_dims, t_type > &tree) | KDTreeBase< t_dims, t_type > | inline |
| KDTreeBase(KDTreeBase< t_dims, t_type > &&tree) | KDTreeBase< t_dims, t_type > | inline |
| KDTreeBase(const Buffer< KDNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) | KDTreeBase< t_dims, t_type > | inlineprotected |
| m_available_indexed_positions | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protected |
| m_available_node_positions | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protected |
| m_bucket_size | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protected |
| m_indices | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protected |
| m_nodes | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protected |
| needsRebalance(uint04 left_size, uint04 right_size) | KDTreeBase< t_dims, t_type > | inlineprotected |
| nodeSize() const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| operator=(const KDTree &value) | KDTree< t_dims, t_type > | inline |
| operator=(KDTree &&value) | KDTree< t_dims, t_type > | inline |
| NDEVR::Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > >::operator=(const TreeBase &value) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| NDEVR::Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > >::operator=(TreeBase &&value) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| prepareAddAll(const Buffer< bool > &index_values) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| prepareAddAll(uint04 start_index, uint04 end_index, const t_buffer_type &elements) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| presortedClosestElements(const t_reference_type &point, uint04 size, MinHeap< t_type, uint04 > &value_heap, const t_buffer_type &elements, t_type &max_distance, t_type epsilon=cast< t_type >(0)) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| presortedEnclosedElements(const t_area_type &area, Buffer< uint04 > &indices, const t_buffer_type &elements) const | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| recalculateBounds(uint04 node_index, const t_buffer_type &elements) | KDTreeBase< t_dims, t_type > | inlineprotected |
| reclaimChildren(uint04 index) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| removeIndex(uint04 index) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| removeIndices(const Buffer< bool > &deletion_indices) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| removeIndices(uint04 begin, uint04 end) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| removeValue(uint04 index, const t_buffer_type &elements) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| removeValues(const Buffer< bool > &insertion_indices, const t_buffer_type &elements, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| removeValues(uint04 start_index, uint04 end_index, const t_buffer_type &elements, ProgressInfo *progress=nullptr) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| root_node | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | protectedstatic |
| size() const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| sortVertices(const t_buffer_type &elements, t_buffer_type &sorted) const | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inline |
| splitLeafNode(uint04 index) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| swapIndices(uint04 index_a, uint04 index_b) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inline |
| Tree(uint04 bucket_size) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inlineexplicitprotected |
| Tree(const KDTreeBase< t_dims, t_type > &tree) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inlineprotected |
| Tree(KDTreeBase< t_dims, t_type > &&tree) | Tree< t_dims, t_type, KDTreeBase< t_dims, t_type > > | inlineprotected |
| TreeBase(uint04 bucket_size) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineexplicitprotected |
| TreeBase(const TreeBase &tree) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| TreeBase(TreeBase &&tree) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| TreeBase(const Buffer< KDNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| useBulkResize(uint04 change_size) | KDTreeBase< t_dims, t_type > | inlineprotected |
| validate(const Buffer< t_node_type > &elements) | KDTreeBase< t_dims, t_type > | inline |
| ~TreeBase() | TreeBase< KDNode< t_dims, t_type >, t_type, 2 > | inlineprotectedvirtual |