Constructor for class structure.<A HREF="structure/BinarySearchTree.html">BinarySearchTree</A><DD>Constructs a binary search tree with no data<DT><A HREF="structure/BinarySearchTree.html#BinarySearchTree(java.util.Comparator)"><B>BinarySearchTree(Comparator)</B></A> - Constructor for class structure.<A HREF="structure/BinarySearchTree.html">BinarySearchTree</A><DD>Constructs a binary search tree with no data<DT><A HREF="structure/BinaryTree.html"><B>BinaryTree</B></A> - class structure.<A HREF="structure/BinaryTree.html">BinaryTree</A>.<DD>This class implements a single node of a binary tree.<DT><A HREF="structure/BinaryTree.html#BinaryTree()"><B>BinaryTree()</B></A> - Constructor for class structure.<A HREF="structure/BinaryTree.html">BinaryTree</A><DD>A one-time constructor, for constructing empty trees.<DT><A HREF="structure/BinaryTree.html#BinaryTree(java.lang.Object)"><B>BinaryTree(Object)</B></A> - Constructor for class structure.<A HREF="structure/BinaryTree.html">BinaryTree</A><DD>Constructs a tree node with no children.<DT><A HREF="structure/BinaryTree.html#BinaryTree(java.lang.Object, structure.BinaryTree, structure.BinaryTree)"><B>BinaryTree(Object, BinaryTree, BinaryTree)</B></A> - Constructor for class structure.<A HREF="structure/BinaryTree.html">BinaryTree</A><DD>Constructs a tree node with no children.<DT><A HREF="structure/BitSet.html"><B>BitSet</B></A> - class structure.<A HREF="structure/BitSet.html">BitSet</A>.<DD>Implementation of a set of numbered bits.<DT><A HREF="structure/BitSet.html#BitSet()"><B>BitSet()</B></A> - Constructor for class structure.<A HREF="structure/BitSet.html">BitSet</A><DD>Constructs an empty bitset.<DT><A HREF="structure/BitSet.html#BitSet(int)"><B>BitSet(int)</B></A> - Constructor for class structure.<A HREF="structure/BitSet.html">BitSet</A><DD>Constructs an empty bitset with potential to hold values between 0..count-1.<DT><A HREF="structure/BitSet.html#bitsPerInt"><B>bitsPerInt</B></A> - Variable in class structure.<A HREF="structure/BitSet.html">BitSet</A><DD>The number of bits contained in a single integer.<DT><A HREF="structure/RedBlackTree.html#blackConsistency()"><B>blackConsistency()</B></A> - Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A><DD>Returns true if black properties of tree are correct<DT><A HREF="structure/RedBlackTree.html#blackFixup()"><B>blackFixup()</B></A> - Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A><DD>If a black node has just been removed above this; this node is the root of a black-height balanced tree, but the ancestors of this node are shy one black node on this branch.<DT><A HREF="structure/RedBlackTree.html#blackHeight()"><B>blackHeight()</B></A> - Method in class structure.<A HREF="structure/RedBlackTree.html">RedBlackTree</A><DD>Returns the black height of this subtree.<DT><A HREF="structure/BTInorderIterator.html"><B>BTInorderIterator</B></A> - class structure.<A HREF="structure/BTInorderIterator.html">BTInorderIterator</A>.<DD>An iterator for traversing binary trees constructed from BinaryTrees.<DT><A HREF="structure/BTInorderIterator.html#BTInorderIterator(structure.BinaryTree)"><B>BTInorderIterator(BinaryTree)</B></A> - Constructor for class structure.<A HREF="structure/BTInorderIterator.html">BTInorderIterator</A><DD>Construct a new inorder iterator of a tree.<DT><A HREF="structure/BTLevelorderIterator.html"><B>BTLevelorderIterator</B></A> - class structure.<A HREF="structure/BTLevelorderIterator.html">BTLevelorderIterator</A>.<DD>An iterator for traversing binary trees constructed from BinaryTrees.<DT><A HREF="structure/BTLevelorderIterator.html#BTLevelorderIterator(structure.BinaryTree)"><B>BTLevelorderIterator(BinaryTree)</B></A> - Constructor for class structure.<A HREF="structure/BTLevelorderIterator.html">BTLevelorderIterator</A><DD>Construct a new level-order iterator of a tree.<DT><A HREF="structure/BTPostorderIterator.html"><B>BTPostorderIterator</B></A> - class structure.<A HREF="structure/BTPostorderIterator.html">BTPostorderIterator</A>.<DD>This class implements a post-order traversal of a binary tree.<DT><A HREF="structure/BTPostorderIterator.html#BTPostorderIterator(structure.BinaryTree)"><B>BTPostorderIterator(BinaryTree)</B></A> - Constructor for class structure.<A HREF="structure/BTPostorderIterator.html">BTPostorderIterator</A><DD>Construct an iterator to traverse subtree rooted at root in post-order.<DT><A HREF="structure/BTPreorderIterator.html"><B>BTPreorderIterator</B></A> - class structure.<A HREF="structure/BTPreorderIterator.html">BTPreorderIterator</A>.<DD>This class implements an iterator that traverses a tree in pre-order.<DT><A HREF="structure/BTPreorderIterator.html#BTPreorderIterator(structure.BinaryTree)"><B>BTPreorderIterator(BinaryTree)</B></A> - Constructor for class structure.<A HREF="structure/BTPreorderIterator.html">BTPreorderIterator</A><DD>Constructs a pre-order traversal of subtree rooted at root.<DT><A HREF="structure/ReadStream.html#buffer"><B>buffer</B></A> - Variable in class structure.<A HREF="structure/ReadStream.html">ReadStream</A><DD>The buffer to hold pushback characters<DT><A HREF="structure/ReadStream.html#buffersize"><B>buffersize</B></A> - Variable in class structure.<A HREF="structure/ReadStream.html">ReadStream</A><DD>The number of characters to be stored in buffer.<DT><A HREF="structure/ReadStream.html#buffertop"><B>buffertop</B></A> - Variable in class structure.<A HREF="structure/ReadStream.html">ReadStream</A><DD>&nbsp;</DL><HR><A NAME="_C_"><!-- --></A><H2><B>C</B></H2><DL><DT><A HREF="structure/ChainedHashtable.html#capacity"><B>capacity</B></A> - Variable in class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A><DD>The length of the table.<DT><A HREF="structure/Hashtable.html#capacity"><B>capacity</B></A> - Variable in class structure.<A HREF="structure/Hashtable.html">Hashtable</A><DD>The size of the hashtable<DT><A HREF="structure/Vector.html#capacity()"><B>capacity()</B></A> - Method in class structure.<A HREF="structure/Vector.html">Vector</A><DD>Determine the capacity of the vector.<DT><A HREF="structure/Vector.html#capacityIncrement"><B>capacityIncrement</B></A> - Variable in class structure.<A HREF="structure/Vector.html">Vector</A><DD>The size of size increment, should the vector become full.<DT><A HREF="structure/ChainedHashtable.html"><B>ChainedHashtable</B></A> - class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A>.<DD>This class implements a hash table whose collisions are resolved through external chaining.<DT><A HREF="structure/ChainedHashtable.html#ChainedHashtable()"><B>ChainedHashtable()</B></A> - Constructor for class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A><DD>Constructs a reasonably large hashtable.<DT><A HREF="structure/ChainedHashtable.html#ChainedHashtable(int)"><B>ChainedHashtable(int)</B></A> - Constructor for class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A><DD>Constructs a hashtable with capacity for at size elements before chaining is absolutely required.<DT><A HREF="structure/ChainedHashtableIterator.html"><B>ChainedHashtableIterator</B></A> - class structure.<A HREF="structure/ChainedHashtableIterator.html">ChainedHashtableIterator</A>.<DD>A traversal of all the elements as they appear in a chained hashtable.<DT><A HREF="structure/ChainedHashtableIterator.html#ChainedHashtableIterator(structure.List[])"><B>ChainedHashtableIterator(List[])</B></A> - Constructor for class structure.<A HREF="structure/ChainedHashtableIterator.html">ChainedHashtableIterator</A><DD>Construct an iterator over a chained hashtable.<DT><A HREF="structure/CharSet.html"><B>CharSet</B></A> - class structure.<A HREF="structure/CharSet.html">CharSet</A>.<DD>Implementation of a set of characters whose ASCII values are between 0 and 255, inclusive.<DT><A HREF="structure/CharSet.html#CharSet()"><B>CharSet()</B></A> - Constructor for class structure.<A HREF="structure/CharSet.html">CharSet</A><DD>Constructs an empty charset.<DT><A HREF="structure/CircularList.html"><B>CircularList</B></A> - class structure.<A HREF="structure/CircularList.html">CircularList</A>.<DD>An implementation of lists using circularly linked elements,  similar to that of <CODE>java.util.LinkedList</CODE>.<DT><A HREF="structure/CircularList.html#CircularList()"><B>CircularList()</B></A> - Constructor for class structure.<A HREF="structure/CircularList.html">CircularList</A><DD>Construct an empty circular list.<DT><A HREF="structure/CircularListIterator.html"><B>CircularListIterator</B></A> - class structure.<A HREF="structure/CircularListIterator.html">CircularListIterator</A>.<DD>An iterator for traversing the elements of a circular list.<DT><A HREF="structure/CircularListIterator.html#CircularListIterator(structure.SinglyLinkedListElement)"><B>CircularListIterator(SinglyLinkedListElement)</B></A> - Constructor for class structure.<A HREF="structure/CircularListIterator.html">CircularListIterator</A><DD>Constructs an iterator over circular list whose tail is t<DT><A HREF="structure/ChainedHashtable.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/ChainedHashtable.html">ChainedHashtable</A><DD>Removes the values from the hashtable.<DT><A HREF="structure/GraphMatrix.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/GraphMatrix.html">GraphMatrix</A><DD>Remove all vertices (and thus, edges) of the graph.<DT><A HREF="structure/OrderedList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/OrderedList.html">OrderedList</A><DD>Remove all the elements from the ordered list<DT><A HREF="structure/MapList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/MapList.html">MapList</A><DD>&nbsp;<DT><A HREF="structure/CircularList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/CircularList.html">CircularList</A><DD>Remove elements of list.<DT><A HREF="structure/QueueList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/QueueList.html">QueueList</A><DD>Remove all the values from the queue.<DT><A HREF="structure/PriorityQueue.html#clear()"><B>clear()</B></A> - Method in interface structure.<A HREF="structure/PriorityQueue.html">PriorityQueue</A><DD>Remove all the elements from the queue.<DT><A HREF="structure/Hashtable.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/Hashtable.html">Hashtable</A><DD>Remove all key-value pairs from hashtable.<DT><A HREF="structure/BinarySearchTree.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/BinarySearchTree.html">BinarySearchTree</A><DD>Removes all data from the binary search tree<DT><A HREF="structure/VectorHeap.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/VectorHeap.html">VectorHeap</A><DD>Remove all the elements from the queue.<DT><A HREF="structure/QueueArray.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/QueueArray.html">QueueArray</A><DD>Remove all the values from the queue.<DT><A HREF="structure/GraphList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/GraphList.html">GraphList</A><DD>Remove all vertices (and thus, edges) of the graph.<DT><A HREF="structure/SetList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/SetList.html">SetList</A><DD>Remove all the elements from the set.<DT><A HREF="structure/RedBlackSearchTree.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/RedBlackSearchTree.html">RedBlackSearchTree</A><DD>Removes all data from the binary search tree<DT><A HREF="structure/StackVector.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/StackVector.html">StackVector</A><DD>Remove all elements from stack.<DT><A HREF="structure/SkewHeap.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/SkewHeap.html">SkewHeap</A><DD>Remove all the elements from the queue.<DT><A HREF="structure/Table.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/Table.html">Table</A><DD>Remove all the elements of the table.<DT><A HREF="structure/QueueVector.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/QueueVector.html">QueueVector</A><DD>Remove all the values from the queue.<DT><A HREF="structure/StackList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/StackList.html">StackList</A><DD>Remove all elements from the stack.<DT><A HREF="structure/BitSet.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/BitSet.html">BitSet</A><DD>Remove all bits from the set.<DT><A HREF="structure/PriorityVector.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/PriorityVector.html">PriorityVector</A><DD>Remove all the values from the priority queue.<DT><A HREF="structure/DoublyLinkedList.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/DoublyLinkedList.html">DoublyLinkedList</A><DD>Remove all values from list.<DT><A HREF="structure/Vector.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/Vector.html">Vector</A><DD>Remove all the values of the vector.<DT><A HREF="structure/CharSet.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/CharSet.html">CharSet</A><DD>Removes the characters of the set.<DT><A HREF="structure/OrderedVector.html#clear()"><B>clear()</B></A> - Method in class structure.<A HREF="structure/OrderedVector.html">OrderedVector</A><DD>Removes all the values from a an ordered vector<DT><A HREF="structure/Map.html#clear()"><B>clear()</B></A> - Method in interface structure.<A HREF="structure/Map.html">Map</A><DD>&nbsp;