index.html

Data StructuresAnd Algorithm Analysis In Java Source Code

<dt><a href="DataStructures.SplayTree.html#findMin()"><b>findMin</b></a>().
Method in class DataStructures.<a href="DataStructures.SplayTree.html">SplayTree</a>
<dd>Find the smallest item in the tree.
<dt><a href="DataStructures.Treap.html#findMin()"><b>findMin</b></a>().
Method in class DataStructures.<a href="DataStructures.Treap.html">Treap</a>
<dd>Find the smallest item in the tree.
<dt><a href="DataStructures.CursorList.html#findPrevious(java.lang.Object)"><b>findPrevious</b></a>(Object).
Method in class DataStructures.<a href="DataStructures.CursorList.html">CursorList</a>
<dd>Return iterator prior to the first node containing an item.
<dt><a href="DataStructures.LinkedList.html#findPrevious(java.lang.Object)"><b>findPrevious</b></a>(Object).
Method in class DataStructures.<a href="DataStructures.LinkedList.html">LinkedList</a>
<dd>Return iterator prior to the first node containing an item.
<dt><a href="DataStructures.CursorList.html#first()"><b>first</b></a>().
Method in class DataStructures.<a href="DataStructures.CursorList.html">CursorList</a>
<dd>Return an iterator representing the first node in the list.
<dt><a href="DataStructures.LinkedList.html#first()"><b>first</b></a>().
Method in class DataStructures.<a href="DataStructures.LinkedList.html">LinkedList</a>
<dd>Return an iterator representing the first node in the list.
</dl>
<hr>
<a name="_g_"></a><h2>
<b>G</b>
</h2>
<dl>
<dt><a href="DataStructures.QueueAr.html#getFront()"><b>getFront</b></a>().
Method in class DataStructures.<a href="DataStructures.QueueAr.html">QueueAr</a>
<dd>Get the least recently inserted item in the queue.
</dl>
<hr>
<a name="_h_"></a><h2>
<b>H</b>
</h2>
<dl>
<dt><a href="DataStructures.Hashable.html#hash(int)"><b>hash</b></a>(int).
Method in interface DataStructures.<a href="DataStructures.Hashable.html">Hashable</a>
<dd>Compute a hash function for this object.
<dt><a href="DataStructures.MyInteger.html#hash(int)"><b>hash</b></a>(int).
Method in class DataStructures.<a href="DataStructures.MyInteger.html">MyInteger</a>
<dd>Implements the hash method.
<dt><a href="DataStructures.QuadraticProbingHashTable.html#hash(java.lang.String, int)"><b>hash</b></a>(String, int).
Static method in class DataStructures.<a href="DataStructures.QuadraticProbingHashTable.html">QuadraticProbingHashTable</a>
<dd>A hash routine for String objects.
<dt><a href="DataStructures.SeparateChainingHashTable.html#hash(java.lang.String, int)"><b>hash</b></a>(String, int).
Static method in class DataStructures.<a href="DataStructures.SeparateChainingHashTable.html">SeparateChainingHashTable</a>
<dd>A hash routine for String objects.
<dt><a href="DataStructures.Sort.html#heapsort(DataStructures.Comparable[])"><b>heapsort</b></a>(Comparable[]).
Static method in class DataStructures.<a href="DataStructures.Sort.html">Sort</a>
<dd>Standard heapsort.
</dl>
<hr>
<a name="_i_"></a><h2>
<b>I</b>
</h2>
<dl>
<dt><a href="DataStructures.AATree.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.AATree.html">AATree</a>
<dd>Insert into the tree.
<dt><a href="DataStructures.AvlTree.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.AvlTree.html">AvlTree</a>
<dd>Insert into the tree; duplicates are ignored.
<dt><a href="DataStructures.BinaryHeap.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.BinaryHeap.html">BinaryHeap</a>
<dd>Insert into the priority queue, maintaining heap order.
<dt><a href="DataStructures.BinarySearchTree.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.BinarySearchTree.html">BinarySearchTree</a>
<dd>Insert into the tree; duplicates are ignored.
<dt><a href="DataStructures.BinomialQueue.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.BinomialQueue.html">BinomialQueue</a>
<dd>Insert into the priority queue, maintaining heap order.
<dt><a href="DataStructures.DSL.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.DSL.html">DSL</a>
<dd>Insert into the DSL.
<dt><a href="DataStructures.LeftistHeap.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.LeftistHeap.html">LeftistHeap</a>
<dd>Insert into the priority queue, maintaining heap order.
<dt><a href="DataStructures.PairHeap.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.PairHeap.html">PairHeap</a>
<dd>Insert into the priority queue, and return a PairNode
that can be used by decreaseKey.
<dt><a href="DataStructures.RedBlackTree.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.RedBlackTree.html">RedBlackTree</a>
<dd>Insert into the tree.
<dt><a href="DataStructures.SplayTree.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.SplayTree.html">SplayTree</a>
<dd>Insert into the tree.
<dt><a href="DataStructures.Treap.html#insert(DataStructures.Comparable)"><b>insert</b></a>(Comparable).
Method in class DataStructures.<a href="DataStructures.Treap.html">Treap</a>
<dd>Insert into the tree.
<dt><a href="DataStructures.QuadraticProbingHashTable.html#insert(DataStructures.Hashable)"><b>insert</b></a>(Hashable).
Method in class DataStructures.<a href="DataStructures.QuadraticProbingHashTable.html">QuadraticProbingHashTable</a>
<dd>Insert into the hash table.
<dt><a href="DataStructures.SeparateChainingHashTable.html#insert(DataStructures.Hashable)"><b>insert</b></a>(Hashable).
Method in class DataStructures.<a href="DataStructures.SeparateChainingHashTable.html">SeparateChainingHashTable</a>
<dd>Insert into the hash table.
<dt><a href="DataStructures.CursorList.html#insert(java.lang.Object, DataStructures.CursorListItr)"><b>insert</b></a>(Object, CursorListItr).
Method in class DataStructures.<a href="DataStructures.CursorList.html">CursorList</a>
<dd>Insert after p.
<dt><a href="DataStructures.LinkedList.html#insert(java.lang.Object, DataStructures.LinkedListItr)"><b>insert</b></a>(Object, LinkedListItr).
Method in class DataStructures.<a href="DataStructures.LinkedList.html">LinkedList</a>
<dd>Insert after p.
<dt><a href="DataStructures.Sort.html#insertionSort(DataStructures.Comparable[])"><b>insertionSort</b></a>(Comparable[]).
Static method in class DataStructures.<a href="DataStructures.Sort.html">Sort</a>
<dd>Simple insertion sort.
<dt><a href="DataStructures.MyInteger.html#intValue()"><b>intValue</b></a>().
Method in class DataStructures.<a href="DataStructures.MyInteger.html">MyInteger</a>
<dd>Gets the stored int value.
<dt><a href="DataStructures.AATree.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.AATree.html">AATree</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.AvlTree.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.AvlTree.html">AvlTree</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.BinaryHeap.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.BinaryHeap.html">BinaryHeap</a>
<dd>Test if the priority queue is logically empty.
<dt><a href="DataStructures.BinarySearchTree.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.BinarySearchTree.html">BinarySearchTree</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.BinomialQueue.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.BinomialQueue.html">BinomialQueue</a>
<dd>Test if the priority queue is logically empty.
<dt><a href="DataStructures.CursorList.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.CursorList.html">CursorList</a>
<dd>Test if the list is logically empty.
<dt><a href="DataStructures.DSL.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.DSL.html">DSL</a>
<dd>Test if the DSL is logically empty.
<dt><a href="DataStructures.LeftistHeap.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.LeftistHeap.html">LeftistHeap</a>
<dd>Test if the priority queue is logically empty.
<dt><a href="DataStructures.LinkedList.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.LinkedList.html">LinkedList</a>
<dd>Test if the list is logically empty.
<dt><a href="DataStructures.PairHeap.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.PairHeap.html">PairHeap</a>
<dd>Test if the priority queue is logically empty.
<dt><a href="DataStructures.QueueAr.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.QueueAr.html">QueueAr</a>
<dd>Test if the queue is logically empty.
<dt><a href="DataStructures.RedBlackTree.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.RedBlackTree.html">RedBlackTree</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.SplayTree.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.SplayTree.html">SplayTree</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.StackAr.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.StackAr.html">StackAr</a>
<dd>Test if the stack is logically empty.
<dt><a href="DataStructures.StackLi.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.StackLi.html">StackLi</a>
<dd>Test if the stack is logically empty.
<dt><a href="DataStructures.Treap.html#isEmpty()"><b>isEmpty</b></a>().
Method in class DataStructures.<a href="DataStructures.Treap.html">Treap</a>
<dd>Test if the tree is logically empty.
<dt><a href="DataStructures.BinaryHeap.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.BinaryHeap.html">BinaryHeap</a>
<dd>Test if the priority queue is logically full.
<dt><a href="DataStructures.BinomialQueue.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.BinomialQueue.html">BinomialQueue</a>
<dd>Test if the priority queue is logically full.
<dt><a href="DataStructures.LeftistHeap.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.LeftistHeap.html">LeftistHeap</a>
<dd>Test if the priority queue is logically full.
<dt><a href="DataStructures.QueueAr.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.QueueAr.html">QueueAr</a>
<dd>Test if the queue is logically full.
<dt><a href="DataStructures.StackAr.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.StackAr.html">StackAr</a>
<dd>Test if the stack is logically full.
<dt><a href="DataStructures.StackLi.html#isFull()"><b>isFull</b></a>().
Method in class DataStructures.<a href="DataStructures.StackLi.html">StackLi</a>
<dd>Test if the stack is logically full.
<dt><a href="DataStructures.CursorListItr.html#isPastEnd()"><b>isPastEnd</b></a>().
Method in class DataStructures.<a href="DataStructures.CursorListItr.html">CursorListItr</a>
<dd>Test if the current position is past the end of the list.
<dt><a href="DataStructures.LinkedListItr.html#isPastEnd()"><b>isPastEnd</b></a>().
Method in class DataStructures.<a href="DataStructures.LinkedListItr.html">LinkedListItr</a>
<dd>Test if the current position is past the end of the list.
</dl>
<hr>
<a name="_j_"></a><h2>
<b>J</b>
</h2>
<hr>
<a name="_k_"></a><h2>
<b>K</b>
</h2>
<hr>
<a name="_l_"></a><h2>
<b>L</b>
</h2>
<dl>
<dt><a href="DataStructures.LeftistHeap.html#LeftistHeap()"><b>LeftistHeap</b></a>().
Constructor for class DataStructures.<a href="DataStructures.LeftistHeap.html">LeftistHeap</a>
<dd>Construct the leftist heap.
<dt><a href="DataStructures.LinkedList.html#LinkedList()"><b>LinkedList</b></a>().
Constructor for class DataStructures.<a href="DataStructures.LinkedList.html">LinkedList</a>
<dd>Construct the list
</dl>
<hr>
<a name="_m_"></a><h2>
<b>M</b>
</h2>
<dl>
<dt><a href="DataStructures.AATree.html#main(java.lang.String[])"><b>main</b></a>(String[]).
Static method in class DataStructures.<a href="DataStructures.AATree.html">AATree</a>
<dd>