Uses of Class
de.lmu.ifi.dbs.elki.index.tree.IndexTreePath

Packages that use IndexTreePath

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 IndexTreePath in de.lmu.ifi.dbs.elki.index.tree

Fields in de.lmu.ifi.dbs.elki.index.tree declared as IndexTreePath

private IndexTreePath<E>

IndexTreePath.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 IndexTreePath

Enumeration<IndexTreePath<E>>	BreadthFirstEnumeration.EMPTY_ENUMERATION Represents an empty enumeration.
private Queue<Enumeration<IndexTreePath<E>>>	BreadthFirstEnumeration.queue The queue for the enumeration.

Methods in de.lmu.ifi.dbs.elki.index.tree that return IndexTreePath

IndexTreePath<E>	IndexTreePath.getParentPath() Returns a path containing all the elements of this object, except the last path component.
IndexTreePath<E>	IndexTree.getRootPath() Returns the path to the root of this tree.
IndexTreePath<E>	BreadthFirstEnumeration.nextElement() Returns the next element of this enumeration if this enumeration object has at least one more element to provide.
IndexTreePath<E>	IndexTreePath.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 IndexTreePath

Enumeration<IndexTreePath<E>>	Node.children(IndexTreePath<E> parentPath) Returns an enumeration of the children paths of this node.
Enumeration<IndexTreePath<E>>	AbstractNode.children(IndexTreePath<E> parentPath)

Methods in de.lmu.ifi.dbs.elki.index.tree with parameters of type IndexTreePath

Enumeration<IndexTreePath<E>>	Node.children(IndexTreePath<E> parentPath) Returns an enumeration of the children paths of this node.
Enumeration<IndexTreePath<E>>	AbstractNode.children(IndexTreePath<E> parentPath)
boolean	IndexTreePath.isDescendant(IndexTreePath<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 IndexTreePath

BreadthFirstEnumeration(IndexTree<N,E> index, IndexTreePath<E> rootPath)
Creates a new breadth first enumeration with the specified node as root node.

IndexTreePath(IndexTreePath<E> parent, TreeIndexPathComponent<E> lastElement)
Constructs a new IndexPath, which is the path identified by parent ending in lastElement.

Uses of IndexTreePath in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants

Methods in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants that return IndexTreePath

private IndexTreePath<E>	AbstractMTree.choosePath(E object, IndexTreePath<E> subtree) Chooses the best path of the specified subtree for insertion of the given object.
private IndexTreePath<E>	AbstractMTree.createNewRoot(N oldRoot, N newNode, DBID firstRoutingObjectID, DBID 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 IndexTreePath

private void	AbstractMTree.adjustTree(IndexTreePath<E> subtree) Adjusts the tree after insertion of some nodes.
private IndexTreePath<E>	AbstractMTree.choosePath(E object, IndexTreePath<E> subtree) Chooses the best path of the specified subtree for insertion of the given object.

Uses of IndexTreePath in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants

Methods in de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants that return IndexTreePath

protected IndexTreePath<E>	AbstractRStarTree.choosePath(IndexTreePath<E> subtree, SpatialComparable mbr, int level) Chooses the best path of the specified subtree for insertion of the given mbr at the specified level.
protected IndexTreePath<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 IndexTreePath<E>	AbstractRStarTree.findPathToObject(IndexTreePath<E> subtree, SpatialComparable mbr, DBID 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 IndexTreePath

protected void	AbstractRStarTree.adjustTree(IndexTreePath<E> subtree) Adjusts the tree after insertion of some nodes.
protected IndexTreePath<E>	AbstractRStarTree.choosePath(IndexTreePath<E> subtree, SpatialComparable 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(IndexTreePath<E> subtree, Stack<N> stack) Condenses the tree after deletion of some nodes.
protected void	AbstractRStarTree.deletePath(IndexTreePath<E> deletionPath) Delete a leaf at a given path - deletions for non-leaves are not supported!
protected IndexTreePath<E>	AbstractRStarTree.findPathToObject(IndexTreePath<E> subtree, SpatialComparable mbr, DBID 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, IndexTreePath<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 split.
protected void	AbstractRStarTree.reInsert(N node, int level, IndexTreePath<E> path) Reinserts the specified node at the specified level.