|
|
|||||||||||||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use TreeIndexPath | |
---|---|
de.lmu.ifi.dbs.elki.index.tree | Tree-based index structures |
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants | M-Tree and variants. |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants | R*-Tree and variants. |
Uses of TreeIndexPath in de.lmu.ifi.dbs.elki.index.tree |
---|
Fields in de.lmu.ifi.dbs.elki.index.tree declared as TreeIndexPath | |
---|---|
private TreeIndexPath<E> |
TreeIndexPath.parentPath
Path representing the parent, null if lastPathComponent represents the root. |
Fields in de.lmu.ifi.dbs.elki.index.tree with type parameters of type TreeIndexPath | |
---|---|
Enumeration<TreeIndexPath<E>> |
BreadthFirstEnumeration.EMPTY_ENUMERATION
Represents an empty enumeration. |
private Queue<Enumeration<TreeIndexPath<E>>> |
BreadthFirstEnumeration.queue
The queue for the enumeration. |
Methods in de.lmu.ifi.dbs.elki.index.tree that return TreeIndexPath | |
---|---|
TreeIndexPath<E> |
TreeIndexPath.getParentPath()
Returns a path containing all the elements of this object, except the last path component. |
protected TreeIndexPath<E> |
TreeIndex.getRootPath()
Returns the path to the root of this tree. |
TreeIndexPath<E> |
BreadthFirstEnumeration.nextElement()
Returns the next element of this enumeration if this enumeration object has at least one more element to provide. |
TreeIndexPath<E> |
TreeIndexPath.pathByAddingChild(TreeIndexPathComponent<E> child)
Returns a new path containing all the elements of this object plus child . |
Methods in de.lmu.ifi.dbs.elki.index.tree that return types with arguments of type TreeIndexPath | |
---|---|
Enumeration<TreeIndexPath<E>> |
AbstractNode.children(TreeIndexPath<E> parentPath)
|
Enumeration<TreeIndexPath<E>> |
Node.children(TreeIndexPath<E> parentPath)
Returns an enumeration of the children paths of this node. |
Methods in de.lmu.ifi.dbs.elki.index.tree with parameters of type TreeIndexPath | |
---|---|
Enumeration<TreeIndexPath<E>> |
AbstractNode.children(TreeIndexPath<E> parentPath)
|
Enumeration<TreeIndexPath<E>> |
Node.children(TreeIndexPath<E> parentPath)
Returns an enumeration of the children paths of this node. |
boolean |
TreeIndexPath.isDescendant(TreeIndexPath<E> aIndexPath)
Returns true if aIndexPath is a descendant of this IndexPath. |
Constructors in de.lmu.ifi.dbs.elki.index.tree with parameters of type TreeIndexPath | |
---|---|
BreadthFirstEnumeration(TreeIndex<O,N,E> index,
TreeIndexPath<E> rootPath)
Creates a new breadth first enumeration with the specified node as root node. |
|
TreeIndexPath(TreeIndexPath<E> parent,
TreeIndexPathComponent<E> lastElement)
Constructs a new IndexPath, which is the path identified by parent ending in lastElement . |
Uses of TreeIndexPath in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
---|
Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants that return TreeIndexPath | |
---|---|
private TreeIndexPath<E> |
AbstractMTree.choosePath(Integer objectID,
TreeIndexPath<E> subtree)
Chooses the best path of the specified subtree for insertion of the given object. |
private TreeIndexPath<E> |
AbstractMTree.createNewRoot(N oldRoot,
N newNode,
Integer firstRoutingObjectID,
Integer secondRoutingObjectID)
Creates a new root node that points to the two specified child nodes and return the path to the new root. |
Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants with parameters of type TreeIndexPath | |
---|---|
private void |
AbstractMTree.adjustTree(TreeIndexPath<E> subtree)
Adjusts the tree after insertion of some nodes. |
private TreeIndexPath<E> |
AbstractMTree.choosePath(Integer objectID,
TreeIndexPath<E> subtree)
Chooses the best path of the specified subtree for insertion of the given object. |
Uses of TreeIndexPath in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
---|
Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants that return TreeIndexPath | |
---|---|
private TreeIndexPath<E> |
AbstractRStarTree.choosePath(TreeIndexPath<E> subtree,
HyperBoundingBox mbr,
int level)
Chooses the best path of the specified subtree for insertion of the given mbr at the specified level. |
private TreeIndexPath<E> |
AbstractRStarTree.createNewRoot(N oldRoot,
N newNode)
Creates a new root node that points to the two specified child nodes and return the path to the new root. |
protected TreeIndexPath<E> |
AbstractRStarTree.findPathToObject(TreeIndexPath<E> subtree,
HyperBoundingBox mbr,
int id)
Returns the path to the leaf entry in the specified subtree that represents the data object with the specified mbr and id. |
Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants with parameters of type TreeIndexPath | |
---|---|
private void |
AbstractRStarTree.adjustTree(TreeIndexPath<E> subtree)
Adjusts the tree after insertion of some nodes. |
private TreeIndexPath<E> |
AbstractRStarTree.choosePath(TreeIndexPath<E> subtree,
HyperBoundingBox mbr,
int level)
Chooses the best path of the specified subtree for insertion of the given mbr at the specified level. |
private void |
AbstractRStarTree.condenseTree(TreeIndexPath<E> subtree,
Stack<N> stack)
Condenses the tree after deletion of some nodes. |
protected TreeIndexPath<E> |
AbstractRStarTree.findPathToObject(TreeIndexPath<E> subtree,
HyperBoundingBox mbr,
int id)
Returns the path to the leaf entry in the specified subtree that represents the data object with the specified mbr and id. |
private N |
AbstractRStarTree.overflowTreatment(N node,
TreeIndexPath<E> path)
Treatment of overflow in the specified node: if the node is not the root node and this is the first call of overflowTreatment in the given level during insertion the specified node will be reinserted, otherwise the node will be splitted. |
private void |
AbstractRStarTree.reInsert(N node,
int level,
TreeIndexPath<E> path)
Reinserts the specified node at the specified level. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |