API Documentation
Loading...
Searching...
No Matches
ThreadedRTree< t_dims, t_type > Member List

This is the complete list of members for ThreadedRTree< 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
_balanceLeafNodeThreaded(uint04 level, const uint04 node_index, const Buffer< t_node_type > &elements, Buffer< uint04 > &indices, uint04 start, uint04 end, ProgressInfo *progress=nullptr)ThreadedRTree< t_dims, t_type >inline
_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) constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inlineprotected
_getAllT(const uint04 &node_index, Buffer< bool > &indices) constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inlineprotected
_getBoundingBoxThreaded(uint04 top_level, const Buffer< uint04 > &indices, const Buffer< t_node_type > &elements, uint04 start, uint04 end)ThreadedRTree< t_dims, t_type >inline
_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) constRTreeBase< 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) constRTreeBase< 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) constRTreeBase< t_dims, t_type >inlineprotected
_getEnclosedElements(uint04 top_node, t_area_type area, Buffer< bool > &indices, const t_buffer_type &elements) constRTreeBase< t_dims, t_type >inlineprotected
_getEnclosedElements(uint04 top_node, t_area_type area, Buffer< uint04 > &indices, const t_buffer_type &elements) constRTreeBase< 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) constRTreeBase< t_dims, t_type >inlineprotected
_getNumberOfEnclosedElements(uint04 top_node, const t_area_type &area, const t_buffer_type &elements) constRTreeBase< 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
addAllThreaded(const Buffer< t_node_type > &elements, ProgressInfo *progress=nullptr)ThreadedRTree< t_dims, t_type >inline
addAllThreaded(const Buffer< t_node_type > &elements, uint04 start_index, uint04 end_index, ProgressInfo *progress=nullptr)ThreadedRTree< t_dims, t_type >inline
addIndex(uint04 index) constTreeBase< 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
addValue(uint04 index, const t_buffer_type &elements, bool rebalance)Tree< t_dims, t_type, RTreeBase< 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, RTreeBase< t_dims, t_type > >inline
addValues(const t_buffer_type &elements, bool is_precise, ProgressInfo *progress=nullptr)Tree< t_dims, t_type, RTreeBase< 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, RTreeBase< 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, RTreeBase< t_dims, t_type > >inline
bounds() constRTree< t_dims, t_type >inline
clear()TreeBase< RNode< 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)) constTree< t_dims, t_type, RTreeBase< 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)) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
closestElementPresorted(const t_reference_type &point, const t_buffer_type &elements, t_type epsilon=cast< t_type >(0)) constTree< t_dims, t_type, RTreeBase< 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)) constTree< t_dims, t_type, RTreeBase< 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)) constTree< t_dims, t_type, RTreeBase< 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)) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
compress(Buffer< BinaryCompressionObject > &objects, Buffer< Buffer< uint01 > > &compressed_data, uint04 compression_index, uint04 internal_index)RTree< t_dims, t_type >inline
enclosedElements(const t_area_type &area, Buffer< uint04 > &indices, const t_buffer_type &elements) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
enclosedElements(const t_area_type &area, Buffer< bool > &indices, const t_buffer_type &elements) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
getAll(Buffer< bool > &indices) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
getAll(Buffer< uint04 > &indices) constTree< t_dims, t_type, RTreeBase< 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) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
getIndex(uint04 index) constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
getNode(uint04 node_id) constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
getNumberOfEnclosedElements(const t_area_type &area, const t_buffer_type &elements) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
getNumberOfFreeIndices()TreeBase< RNode< t_dims, t_type >, t_type, 2 >inlineprotected
getNumberOfFreeNodes()TreeBase< RNode< t_dims, t_type >, t_type, 2 >inlineprotected
getNumberOfNodes() constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
getTreeType() const overrideRTree< t_dims, t_type >inlinevirtual
indexSize() constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
indices() constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
m_available_indexed_positionsTreeBase< RNode< t_dims, t_type >, t_type, 2 >protected
m_available_node_positionsTreeBase< RNode< t_dims, t_type >, t_type, 2 >protected
m_bucket_sizeTreeBase< RNode< t_dims, t_type >, t_type, 2 >protected
m_indicesTreeBase< RNode< t_dims, t_type >, t_type, 2 >protected
m_nodesTreeBase< RNode< t_dims, t_type >, t_type, 2 >protected
m_number_of_threadsThreadedRTree< t_dims, t_type >
m_split_lockThreadedRTree< t_dims, t_type >
mapFromFile(BinaryFile &file)RTree< t_dims, t_type >inline
mapToFile(BinaryFile &file, Buffer< BinaryCompressionObject > &objects, uint04 compression_index=0)RTree< t_dims, t_type >inline
mapToFile(BinaryFile &file, CompressionMode mode)RTree< t_dims, t_type >inline
needsRebalance(uint04 left_size, uint04 right_size)RTreeBase< t_dims, t_type >inlineprotected
nodeSize() constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
operator=(const RTree &value)RTree< t_dims, t_type >inline
operator=(RTree &&value)RTree< t_dims, t_type >inline
NDEVR::Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >::operator=(const TreeBase &value)TreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
NDEVR::Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >::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) constRTreeBase< 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
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)) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
presortedEnclosedElements(const t_area_type &area, Buffer< uint04 > &indices, const t_buffer_type &elements) constTree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
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) constTreeBase< 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
removeValue(uint04 index, const t_buffer_type &elements)Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
removeValues(const Buffer< bool > &insertion_indices, const t_buffer_type &elements, ProgressInfo *progress=nullptr)Tree< t_dims, t_type, RTreeBase< 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, RTreeBase< t_dims, t_type > >inline
root_nodeTreeBase< RNode< t_dims, t_type >, t_type, 2 >protectedstatic
RTree()RTree< t_dims, t_type >inline
RTree(uint04 bucket_size)RTree< t_dims, t_type >inlineexplicit
RTree(const RTreeBase< t_dims, t_type > &tree)RTree< t_dims, t_type >inline
RTree(RTreeBase< t_dims, t_type > &&tree)RTree< t_dims, t_type >inline
RTree(const RTree< t_dims, t_type > &value)RTree< t_dims, t_type >inline
RTree(RTree< t_dims, t_type > &&value) noexceptRTree< t_dims, t_type >inline
RTree(const Buffer< RNode< t_dims, t_type > > &nodes, const Buffer< uint04 > &indices, bool is_read_only)RTree< t_dims, t_type >inlineprotected
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() constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
sortVertices(const t_buffer_type &elements, t_buffer_type &sorted) constTreeBase< RNode< t_dims, t_type >, t_type, 2 >inline
splitLeafNode(uint04 index) final overrideThreadedRTree< t_dims, t_type >inline
swapIndices(uint04 index_a, uint04 index_b)Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >inline
ThreadedRTree(uint04 bucket_size)ThreadedRTree< t_dims, t_type >inlineexplicit
ThreadedRTree(const RTree< t_dims, t_type > &tree)ThreadedRTree< t_dims, t_type >inline
ThreadedRTree(RTree< t_dims, t_type > &&tree)ThreadedRTree< t_dims, t_type >inline
traverse(const std::function< void(uint04 node_index, const Buffer< RNode< t_dims, t_type >, uint04, ObjectAllocator< true > > &node, const Buffer< uint04 > &indices)> &callback) constRTreeBase< t_dims, t_type >inline
Tree(uint04 bucket_size)Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >inlineexplicitprotected
Tree(const RTreeBase< t_dims, t_type > &tree)Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >inlineprotected
Tree(RTreeBase< t_dims, t_type > &&tree)Tree< t_dims, t_type, RTreeBase< t_dims, t_type > >inlineprotected
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