#include <hilbert_r_tree_auxiliary_information.hpp>
|
typedef TreeType::ElemType | ElemType |
| The element type held by the tree. More...
|
|
|
static const std::vector< TreeType * > | Children (const TreeType *tree) |
| Return the children vector of the tree. More...
|
|
template<typename TreeType, template< typename > class HilbertValueType>
class mlpack::tree::HilbertRTreeAuxiliaryInformation< TreeType, HilbertValueType >
Definition at line 22 of file hilbert_r_tree_auxiliary_information.hpp.
◆ ElemType
◆ HilbertRTreeAuxiliaryInformation() [1/4]
◆ HilbertRTreeAuxiliaryInformation() [2/4]
Construct this as an auxiliary information for the given node.
- Parameters
-
node | The node that stores this auxiliary information. |
◆ HilbertRTreeAuxiliaryInformation() [3/4]
Create an auxiliary information object by copying from another object.
- Parameters
-
other | Another auxiliary information object from which the information will be copied. |
tree | The node that holds the auxiliary information. |
deepCopy | If false, the new object uses the same memory (not used here). |
◆ HilbertRTreeAuxiliaryInformation() [4/4]
Create an auxiliary information object by moving from the other node.
- Parameters
-
other | The object from which the information will be moved. |
◆ Children()
static const std::vector< TreeType * > Children |
( |
const TreeType * |
tree | ) |
|
|
inlinestatic |
◆ HandleNodeInsertion()
bool HandleNodeInsertion |
( |
TreeType * |
node, |
|
|
TreeType * |
nodeToInsert, |
|
|
bool |
insertionLevel |
|
) |
| |
The Hilbert R tree requires to insert nodes according to their Hilbert value.
This method should take care of it. It returns false if it does nothing and true if it handles the insertion process.
- Parameters
-
node | The node in which the nodeToInsert is being inserted. |
nodeToInsert | The node being inserted. |
insertionLevel | The level of the tree at which the nodeToInsert should be inserted. |
◆ HandleNodeRemoval()
bool HandleNodeRemoval |
( |
TreeType * |
node, |
|
|
const size_t |
nodeIndex |
|
) |
| |
The Hilbert R tree requires all nodes to be arranged according to their Hilbert value.
This method should take care of saving this property after the deletion process. It returns false if it does nothing and true if it handles the deletion process.
- Parameters
-
node | The node from which the node is being deleted. |
nodeIndex | The index of the node being deleted. |
◆ HandlePointDeletion()
bool HandlePointDeletion |
( |
TreeType * |
node, |
|
|
const size_t |
localIndex |
|
) |
| |
The Hilbert R tree requires all points to be arranged according to their Hilbert value.
This method should take care of saving this property after the deletion process. It returns false if it does nothing and true if it handles the deletion process.
- Parameters
-
node | The node from which the point is being deleted. |
localIndex | The index of the point being deleted. |
◆ HandlePointInsertion()
bool HandlePointInsertion |
( |
TreeType * |
node, |
|
|
const size_t |
point |
|
) |
| |
The Hilbert R tree requires to insert points according to their Hilbert value.
This method should take care of it. It returns false if it does nothing and true if it handles the insertion process.
- Parameters
-
node | The node in which the point is being inserted. |
point | The number of the point being inserted. |
◆ HilbertValue() [1/2]
HilbertValueType< ElemType > & HilbertValue |
( |
| ) |
|
|
inline |
◆ HilbertValue() [2/2]
const HilbertValueType< ElemType > & HilbertValue |
( |
| ) |
const |
|
inline |
◆ NullifyData()
◆ operator=()
Copy the auxiliary information.
- Parameters
-
other | The object from which the information will be moved. |
◆ serialize()
void serialize |
( |
Archive & |
ar, |
|
|
const unsigned int |
|
|
) |
| |
Serialize the information.
◆ UpdateAuxiliaryInfo()
bool UpdateAuxiliaryInfo |
( |
TreeType * |
node | ) |
|
Update the auxiliary information in the node.
The method returns true if the update should be propagated downward.
- Parameters
-
node | The node in which the auxiliary information being update. |
The documentation for this class was generated from the following file: