Environment for
DeveLoping
KDD-Applications
Supported by Index-Structures

Uses of Interface
de.lmu.ifi.dbs.elki.utilities.heap.HeapNode

Packages that use HeapNode
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.util Helper classes for the the M-Tree and it's variants. 
de.lmu.ifi.dbs.elki.utilities.heap Variants of heap structures. 
 

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

Classes in de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.util that implement HeapNode
 class PQNode<D extends Distance<D>>
          Encapsulates the attributes for a object that can be stored in a heap.
 

Uses of HeapNode in de.lmu.ifi.dbs.elki.utilities.heap
 

Classes in de.lmu.ifi.dbs.elki.utilities.heap that implement HeapNode
 class DefaultHeapNode<K extends Comparable<K>,V extends Identifiable>
          A default implementation of an object that can be stored in a heap.
 

Fields in de.lmu.ifi.dbs.elki.utilities.heap with type parameters of type HeapNode
(package private)  Vector<HeapNode<K,V>> MinMaxHeap.heap
          Contains all elements of the heap.
private  Vector<HeapNode<K,V>> DefaultHeap.heap
          Contains all elements of the heap.
 

Methods in de.lmu.ifi.dbs.elki.utilities.heap that return HeapNode
 HeapNode<K,V> MinMaxHeap.getMaxNode()
          Retrieves and removes the maximum node of this heap.
 HeapNode<K,V> PersistentHeap.getMinNode()
          Retrieves and removes the minimum node of this heap.
 HeapNode<K,V> MinMaxHeap.getMinNode()
          Retrieves and removes the minimum node of this heap.
 HeapNode<K,V> Heap.getMinNode()
          Retrieves and removes the minimum node of this heap.
 HeapNode<K,V> DefaultHeap.getMinNode()
          Retrieves and removes the minimum node of this heap.
 HeapNode<K,V> PersistentHeap.getNodeAt(int index)
          Returns the node at the specified index.
 HeapNode<K,V> MinMaxHeap.getNodeAt(int index)
          Returns an element of the heap by the index.
 HeapNode<K,V> Heap.getNodeAt(int index)
          Returns the node at the specified index.
 HeapNode<K,V> DefaultHeap.getNodeAt(int index)
          Returns the node at the specified index.
 HeapNode<K,V> MinMaxHeap.maxNode()
          Retrieves, but does not remove, the maximum node of this heap.
 HeapNode<K,V> MinMaxHeap.minNode()
          Retrieves, but does not remove, the minimum node of this heap.
protected  HeapNode<K,V> DefaultHeap.removeMin()
          Removes and returns the minimum node from this heap and restores the heap.
 

Methods in de.lmu.ifi.dbs.elki.utilities.heap that return types with arguments of type HeapNode
 Vector<HeapNode<K,V>> DefaultHeap.copy()
          Returns a copy of the vector holding this heap.
 

Methods in de.lmu.ifi.dbs.elki.utilities.heap with parameters of type HeapNode
 void PersistentHeap.addNode(HeapNode<K,V> node)
          Adds a node to this heap.
 void MinMaxHeap.addNode(HeapNode<K,V> node)
          Adds a node to this heap.
 void Heap.addNode(HeapNode<K,V> node)
          Adds a node to this heap.
 void DefaultHeap.addNode(HeapNode<K,V> node)
          Adds a node to this heap.
 int DefaultHeapNode.compareTo(HeapNode<K,V> heapNode)
          Compares this HeapNode with the specified HeapNode.
 


Release 0.3 (2010-03-31_1612)