 |
API Documentation
|
|
API Documentation
|
This is the complete list of members for RTreeBase< t_dims, t_type >, including all inherited members.
| _addValue(uint04 node_index, uint04 index, const t_buffer_type &elements, bool balance) | RTreeBase< t_dims, t_type > | inlineprotected |
| _addValues(uint04 top_node, Buffer< uint04 > indices, const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr) | RTreeBase< 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) | RTreeBase< t_dims, t_type > | inlineprotected |
| _calculateAndSplit(uint04 node_index, TreeBoundarySorter< t_dims, t_type > &sorter, const t_buffer_type &elements, uint04 start, uint04 end, bool is_precise) | RTreeBase< t_dims, t_type > | inlineprotected |
| _getAll(const uint04 &node_index, Buffer< uint04 > &indices) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| _getAllT(const uint04 &node_index, Buffer< bool > &indices) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| _getBounds(const Buffer< uint04 > &indices, const t_buffer_type &elements, uint04 start, uint04 end) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| _getChangedElements(uint04 top_node, 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 | RTreeBase< t_dims, t_type > | inlineprotected |
| _getClosestElement(uint04 top_index, const t_location_type &selector, const t_buffer_type &elements, t_type &min_distance_squared, const t_type &epsilon, uint04 &min_index) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _getClosestElements(uint04 top_index, const t_reference_type &selector, const t_buffer_type &elements, t_type &min_distance_squared, const t_type &epsilon, MinHeap< t_type, uint04 > &value_heap, uint04 size) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _getEnclosedElements(uint04 top_node, t_area_type area, Buffer< bool > &indices, const t_buffer_type &elements) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _getEnclosedElements(uint04 top_node, t_area_type area, Buffer< uint04 > &indices, const t_buffer_type &elements) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _getNearElements(uint04 top_node, t_type max_distance, const t_area_type &area, Buffer< bool > &indices, const t_buffer_type &elements) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _getNumberOfEnclosedElements(uint04 top_node, const t_area_type &area, const t_buffer_type &elements) const | RTreeBase< t_dims, t_type > | inlineprotected |
| _makeWriteable() | RTreeBase< t_dims, t_type > | inlineprotected |
| _moveValue(uint04 top_node, uint04 index, const t_node_type &old_location, const t_buffer_type &elements, bool rebalance) | RTreeBase< t_dims, t_type > | inlineprotected |
| _removeValue(uint04 top_node, uint04 index, const t_buffer_type &elements) | RTreeBase< t_dims, t_type > | inlineprotected |
| addIndex(uint04 index) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| addIndices(const Buffer< bool > &insertion_indices) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| addIndices(uint04 begin, uint04 end) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| clear() | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| getIndex(uint04 index) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| getNode(uint04 node_id) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| getNumberOfFreeIndices() | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| getNumberOfFreeNodes() | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| getNumberOfNodes() const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| indexSize() const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| indices() const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| m_available_indexed_positions | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protected |
| m_available_node_positions | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protected |
| m_bucket_size | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protected |
| m_indices | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protected |
| m_nodes | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protected |
| needsRebalance(uint04 left_size, uint04 right_size) | RTreeBase< t_dims, t_type > | inlineprotected |
| nodeSize() const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| operator=(const TreeBase &value) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| operator=(TreeBase &&value) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| predictBranch(uint04 &index, const RNode< t_dims, t_type > &node, const t_location_type &selector, MaxHeap< t_type, uint04 > &node_heap, t_type min_distance_squared) const | RTreeBase< t_dims, t_type > | inlineprotected |
| prepareAddAll(const Buffer< bool > &index_values) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| prepareAddAll(uint04 start_index, uint04 end_index, const t_buffer_type &elements) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| recalculateBounds(uint04 node_index, const t_buffer_type &elements) | RTreeBase< t_dims, t_type > | inlineprotected |
| reclaimChildren(uint04 index) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| removeIndex(uint04 index) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| removeIndices(const Buffer< bool > &deletion_indices) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| removeIndices(uint04 begin, uint04 end) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| root_node | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | protectedstatic |
| RTreeBase(uint04 bucket_size) | RTreeBase< t_dims, t_type > | inlineexplicit |
| RTreeBase(const RTreeBase< t_dims, t_type > &tree) | RTreeBase< t_dims, t_type > | inline |
| RTreeBase(RTreeBase< t_dims, t_type > &&tree) | RTreeBase< t_dims, t_type > | inline |
| RTreeBase(const Buffer< RNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) | RTreeBase< t_dims, t_type > | inlineprotected |
| size() const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| sortVertices(const t_buffer_type &elements, t_buffer_type &sorted) const | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inline |
| splitLeafNode(uint04 index) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| traverse(const std::function< void(uint04 node_index, const Buffer< RNode< t_dims, t_type >, uint04, ObjectAllocator< true > > &node, const Buffer< uint04 > &indices)> &callback) const | RTreeBase< t_dims, t_type > | inline |
| TreeBase(uint04 bucket_size) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineexplicitprotected |
| TreeBase(const TreeBase &tree) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| TreeBase(TreeBase &&tree) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| TreeBase(const Buffer< RNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only) | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotected |
| useBulkResize(uint04 change_size) | RTreeBase< t_dims, t_type > | inlineprotected |
| validate(const t_buffer_type &elements) | RTreeBase< t_dims, t_type > | inline |
| ~TreeBase() | TreeBase< RNode< t_dims, t_type >, t_type, 2 > | inlineprotectedvirtual |