|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Node | |
---|---|
mtree | |
mtree.utils |
Uses of Node in mtree |
---|
Subclasses of Node in mtree | |
---|---|
class |
InternalNode
|
class |
LeafNode
|
Fields in mtree declared as Node | |
---|---|
protected Node |
MTree.root
root of the tree |
Methods in mtree that return Node | |
---|---|
Node |
MTree.getRoot()
Returns the root of the tree. |
Node |
NodeEntry.getSubtree()
Returns the subtree of this node entry. |
Methods in mtree with parameters of type Node | |
---|---|
NodeEntry |
InternalNode.createNodeEntry(messif.objects.LocalAbstractObject p,
Node subtree,
int nhr)
Creates a new node entry in this node. |
protected void |
MTree.print(Node n)
Recursive method for printTree. |
void |
NodeEntry.setSubtree(Node subtree)
Sets the subtree of this node entry. |
Constructors in mtree with parameters of type Node | |
---|---|
NodeEntry(InternalNode n,
messif.objects.LocalAbstractObject o,
Node subtree,
NodeEntry.HREntry[] hr)
Constructors |
Uses of Node in mtree.utils |
---|
Methods in mtree.utils that return Node | |
---|---|
static Node |
Insert.deleteSlimNodes(Node n)
Deletes empty nodes from the tree recursively (from a node n towards the root of the tree). |
static Node |
Insert.deleteSlimNodes(Node n,
java.util.Iterator<NodeEntry> nodeEntryIterator)
Deletes empty nodes from the tree recursively (from a node n towards the root of the tree). |
Methods in mtree.utils with parameters of type Node | |
---|---|
static Node |
Insert.deleteSlimNodes(Node n)
Deletes empty nodes from the tree recursively (from a node n towards the root of the tree). |
static Node |
Insert.deleteSlimNodes(Node n,
java.util.Iterator<NodeEntry> nodeEntryIterator)
Deletes empty nodes from the tree recursively (from a node n towards the root of the tree). |
static java.util.List<InternalNode> |
Search.findLastInternalNodes(Node n)
Looks for all internal nodes with node level 1 (descendants are leaves). |
static java.util.List<LeafNode> |
Search.findLeavesByQuery(Node n,
messif.objects.LocalAbstractObject q,
float r)
Looks for all leaves which are incident to the region R(q, r). |
static java.util.List<LeafNode> |
Search.findLeavesByQuery(Node n,
messif.objects.LocalAbstractObject q,
float r,
java.util.Map<messif.objects.LocalAbstractObject,java.lang.Float> pd)
Looks for all leaves which are incident to the region R(q, r). |
static LeafNode |
Insert.findNearestLeafList(messif.objects.LocalAbstractObject q,
Node n)
Returns a leaf which is the most convenient for inserting new object. |
static void |
Search.getAllBuckets(Node n,
java.util.Collection<messif.buckets.LocalBucket> buckets)
Looks for all buckets stored in all leaves of the subtree determined by node n. |
static void |
Search.getAllLeaves(Node n,
java.util.List<LeafNode> leaves)
Looks for all leaves of the subtree determined by node n. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |