Lines Matching defs:HeapNode
57 public abstract class HeapNode implements Cloneable {
62 * Advance to the next node represented by this {@link HeapNode}
70 * Creates a deep copy of this {@link HeapNode}. The clone is not
75 public HeapNode cloneHeapNode() {
76 HeapNode clone;
79 clone = (HeapNode) super.clone();
114 public abstract boolean isLessThan(HeapNode heapNode);
120 * @return a {@link HeapNode} which may or may not be the same as
121 * this <code>HeapNode</code>.
123 public abstract HeapNode setStartNode(int node);
128 * @return a {@link HeapNode} which may or may not be the same as
129 * this <code>HeapNode</code>.
131 public abstract HeapNode reset();
132 } // end of HeapNode
138 private HeapNode[] _heap = new HeapNode[InitSize];
154 final HeapNode[] heapCopy = new HeapNode[_heap.length];
173 protected void addHeapNode(HeapNode node) {
175 HeapNode[] newArray = new HeapNode[_size *= 2];
189 final HeapNode temp = _heap[0];
252 final HeapNode temp = _heap[smallest];