: Index

Package

Class

Tree

Deprecated

Index

Help

PREV NEXT

FRAMES NO FRAMES

A B C D E F G H I K L M N O P Q R S T U V W

A

absorbNL - Variable in class structure.ReadStream: Whether or not accept the CR as part of previous newline.
AbstractIterator - class structure.AbstractIterator.: Abstract base class for portable iterator and enumeration implementation.
AbstractIterator() - Constructor for class structure.AbstractIterator: Default constructor (for base class invocation).
AbstractLinear - class structure.AbstractLinear.: An abstract implemtation of linear data structures.
AbstractLinear() - Constructor for class structure.AbstractLinear
AbstractList - class structure.AbstractList.: An abstract structure implementing features common to all list-like structures in this package.
AbstractList() - Constructor for class structure.AbstractList: Default constructor for AbstractLists
AbstractListIterator - class structure.AbstractListIterator.: Base class for the implementation of a list Iterator.
AbstractListIterator() - Constructor for class structure.AbstractListIterator: Default constructor (for base class invocation).
AbstractMap - class structure.AbstractMap.: Associations establish a link between a key and a value.
AbstractMap() - Constructor for class structure.AbstractMap
AbstractQueue - class structure.AbstractQueue.: An abstract structure implementing features common to all first-in, first-out structures in this package.
AbstractQueue() - Constructor for class structure.AbstractQueue
AbstractSet - class structure.AbstractSet.: Methods common to an Implementation of a set of elements irrespective of the underlying storage mechanism.
AbstractSet() - Constructor for class structure.AbstractSet
AbstractStack - class structure.AbstractStack.: An abstract structure implementing features common to all Last-In, First-Out structures in this package.
AbstractStack() - Constructor for class structure.AbstractStack
AbstractStructure - class structure.AbstractStructure.: An abstract implementation of a basic, mutable data structure.
AbstractStructure() - Constructor for class structure.AbstractStructure: The default constructor.
acceptChar(char) - Method in class structure.ReadStream
acceptWord(String) - Method in class structure.ReadStream
accum - Variable in class structure.Clock: The total number of milliseconds elapsed.
add(char) - Method in class structure.CharSet: Adds character c to set if not already there.
add(Comparable) - Method in class structure.RedBlackTree: Add a value to the red black tree, performing neccisary rotations and adjustments.
add(Comparable) - Method in interface structure.PriorityQueue: Add a value to the priority queue.
add(Comparable) - Method in class structure.VectorHeap: Add a value to the priority queue.
add(Comparable) - Method in class structure.SkewHeap: Add a value to the priority queue.
add(Comparable) - Method in interface structure.MergeableHeap: Add an item to this heap.
add(Comparable) - Method in class structure.PriorityVector: Add a comparable value to the priority queue.
add(int) - Method in class structure.BitSet: Adds a bit to the bitset, if not already there.
add(int, Object) - Method in class structure.CircularList: Insert value at location.
add(int, Object) - Method in class structure.DoublyLinkedList: Insert value at location.
add(int, Object) - Method in class structure.Vector: Insert an element at a particular location.
add(int, Object) - Method in interface structure.List: Insert value at location.
add(int, Object) - Method in class structure.SinglyLinkedList: Insert value at location.
add(Object) - Method in class structure.GraphMatrix: Add a vertex to the graph.
add(Object) - Method in class structure.OrderedList: Add a value to the ordered list, keeping values in order
add(Object) - Method in class structure.AbstractList: Add an object to tail of list.
add(Object) - Method in class structure.CircularList: Add an element to head of circular list.
add(Object) - Method in interface structure.Queue: Add a value to the tail of the queue.
add(Object) - Method in class structure.QueueList: Add a value to the tail of the queue.
add(Object) - Method in class structure.BinarySearchTree: Add a (possibly duplicate) value to binary search tree
add(Object) - Method in class structure.SplayTree: Add a value to the splay tree.
add(Object) - Method in class structure.QueueArray: Add a value to the tail of the queue.
add(Object) - Method in class structure.GraphList: Add a vertex to the graph.
add(Object) - Method in class structure.SetList: Add an element to set, if not already present.
add(Object) - Method in class structure.RedBlackSearchTree: Add a (possibly duplicate) value to the red-black tree, and ensure that the resulting tree is a red-black tree.
add(Object) - Method in class structure.StackVector: Add an element from the top of the stack.
add(Object) - Method in interface structure.Linear: Add a value to the structure.
add(Object) - Method in class structure.QueueVector: Add a value to the tail of the queue
add(Object) - Method in class structure.StackList: Add a value to the top of the stack.
add(Object) - Method in class structure.DoublyLinkedList: Add a value to head of list.
add(Object) - Method in class structure.Vector: Add an element to the high end of the array, possibly expanding vector.
add(Object) - Method in class structure.OrderedVector: Add a comparable value to an ordered vector
add(Object) - Method in interface structure.Structure: Inserts value in some structure-specific location.
add(Object) - Method in class structure.StructCollection: Add an object to the subordinate Structure, and return boolean indicating success.
add(Object) - Method in interface structure.List: Add an object to tail of list.
add(Object) - Method in class structure.SinglyLinkedList: Add an object to tail of list.
add(Object) - Method in class structure.AbstractListIterator
add(Object) - Method in class structure.StackArray: Add a value to the top of the stack.
add(Object) - Method in class structure.SetVector: Add an element to set, if not already present.
add(Object) - Method in interface structure.Graph: Add a vertex to the graph
add(Object) - Method in interface structure.Stack: Add an element from the top of the stack.
addAll(Collection) - Method in class structure.StructCollection: Adds all the elements of another collection (c) into this Structure.
addAll(Structure) - Method in interface structure.Set: Union other set into this set.
addAll(Structure) - Method in class structure.AbstractSet: Union other set into this set.
addAll(Structure) - Method in class structure.SetList: Compute the union of this set with other.
addAll(Structure) - Method in class structure.SetVector: Compute the union of this set with other.
addCol(int) - Method in class structure.Matrix: Add a new column, whose index will be c.
addEdge(Edge) - Method in class structure.GraphListVertex
addEdge(Object, Object, Object) - Method in class structure.GraphMatrix: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in class structure.GraphMatrixUndirected: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in class structure.GraphMatrixDirected: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in class structure.GraphList: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in class structure.GraphListUndirected: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in class structure.GraphListDirected: Add an edge between two vertices within the graph.
addEdge(Object, Object, Object) - Method in interface structure.Graph: Add an edge between two vertices within the graph.
addElement(Object) - Method in class structure.Vector: Add an element to the high end of the array, possibly expanding vector.
addFirst(Object) - Method in class structure.AbstractList: Add a value to head of list.
addFirst(Object) - Method in class structure.CircularList: Add an element to head of list.
addFirst(Object) - Method in class structure.DoublyLinkedList: Add a value to head of list.
addFirst(Object) - Method in interface structure.List: Add a value to the head of the list.
addFirst(Object) - Method in class structure.SinglyLinkedList: Add a value to head of list.
addLast(Object) - Method in class structure.AbstractList: Add a value to tail of list.
addLast(Object) - Method in class structure.CircularList: Add a value to tail of circular list.
addLast(Object) - Method in class structure.DoublyLinkedList: Add a value to tail of list.
addLast(Object) - Method in interface structure.List: Add a value to tail of list.
addLast(Object) - Method in class structure.SinglyLinkedList: Add a value to tail of list.
addRow(int) - Method in class structure.Matrix: Add a new row, whose index will be r.
adjacencies - Variable in class structure.GraphListVertex
adjacentEdges() - Method in class structure.GraphListVertex
adjacentVertices() - Method in class structure.GraphListVertex
allocated - Variable in class structure.BitSet: The current number of integers allocated.
AppendableList - class structure.AppendableList.: An extension of the circular list class that provides an operation for merging an object of this type with a CircularList in constant time.
AppendableList() - Constructor for class structure.AppendableList
ArrayIterator - class structure.ArrayIterator.: A conveniece class that provies a mechanism to iterate over arrays that is analogous to the iteration techniques employed by the structures in this package.
ArrayIterator(Object[]) - Constructor for class structure.ArrayIterator: Construct an iterator that iterates over the entire contents of an array.
ArrayIterator(Object[], int, int) - Constructor for class structure.ArrayIterator: Constructs an iterator that will iterate over a specified portion of the source array.
Assert - class structure.Assert.: A library of assertion testing and debugging procedures.
Assert() - Constructor for class structure.Assert
Association - class structure.Association.: A class implementing a key-value pair.
Association(Object) - Constructor for class structure.Association: Constructs a pair from a key; value is null.
Association(Object, Object) - Constructor for class structure.Association: Constructs a pair from a key and value.
atEOF - Variable in class structure.ReadStream: True iff we've seen the end-of-file
author - Static variable in class structure.Version

B

base - Variable in class structure.ReverseComparator
base - Variable in class structure.StructCollection: The subordinate Structure
BinarySearchTree - class structure.BinarySearchTree.: A binary search tree structure.
BinarySearchTree() - Constructor for class structure.BinarySearchTree: Constructs a binary search tree with no data
BinarySearchTree(Comparator) - Constructor for class structure.BinarySearchTree: Constructs a binary search tree with no data
BinaryTree - class structure.BinaryTree.: This class implements a single node of a binary tree.
BinaryTree() - Constructor for class structure.BinaryTree: A one-time constructor, for constructing empty trees.
BinaryTree(Object) - Constructor for class structure.BinaryTree: Constructs a tree node with no children.
BinaryTree(Object, BinaryTree, BinaryTree) - Constructor for class structure.BinaryTree: Constructs a tree node with no children.
BitSet - class structure.BitSet.: Implementation of a set of numbered bits.
BitSet() - Constructor for class structure.BitSet: Constructs an empty bitset.
BitSet(int) - Constructor for class structure.BitSet: Constructs an empty bitset with potential to hold values between 0..count-1.
bitsPerInt - Variable in class structure.BitSet: The number of bits contained in a single integer.
blackConsistency() - Method in class structure.RedBlackTree: Returns true if black properties of tree are correct
blackFixup() - Method in class structure.RedBlackTree: 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.
blackHeight() - Method in class structure.RedBlackTree: Returns the black height of this subtree.
BTInorderIterator - class structure.BTInorderIterator.: An iterator for traversing binary trees constructed from BinaryTrees.
BTInorderIterator(BinaryTree) - Constructor for class structure.BTInorderIterator: Construct a new inorder iterator of a tree.
BTLevelorderIterator - class structure.BTLevelorderIterator.: An iterator for traversing binary trees constructed from BinaryTrees.
BTLevelorderIterator(BinaryTree) - Constructor for class structure.BTLevelorderIterator: Construct a new level-order iterator of a tree.
BTPostorderIterator - class structure.BTPostorderIterator.: This class implements a post-order traversal of a binary tree.
BTPostorderIterator(BinaryTree) - Constructor for class structure.BTPostorderIterator: Construct an iterator to traverse subtree rooted at root in post-order.
BTPreorderIterator - class structure.BTPreorderIterator.: This class implements an iterator that traverses a tree in pre-order.
BTPreorderIterator(BinaryTree) - Constructor for class structure.BTPreorderIterator: Constructs a pre-order traversal of subtree rooted at root.
buffer - Variable in class structure.ReadStream: The buffer to hold pushback characters
buffersize - Variable in class structure.ReadStream: The number of characters to be stored in buffer.
buffertop - Variable in class structure.ReadStream

C

capacity - Variable in class structure.ChainedHashtable: The length of the table.
capacity - Variable in class structure.Hashtable: The size of the hashtable
capacity() - Method in class structure.Vector: Determine the capacity of the vector.
capacityIncrement - Variable in class structure.Vector: The size of size increment, should the vector become full.
ChainedHashtable - class structure.ChainedHashtable.: This class implements a hash table whose collisions are resolved through external chaining.
ChainedHashtable() - Constructor for class structure.ChainedHashtable: Constructs a reasonably large hashtable.
ChainedHashtable(int) - Constructor for class structure.ChainedHashtable: Constructs a hashtable with capacity for at size elements before chaining is absolutely required.
ChainedHashtableIterator - class structure.ChainedHashtableIterator.: A traversal of all the elements as they appear in a chained hashtable.
ChainedHashtableIterator(List[]) - Constructor for class structure.ChainedHashtableIterator: Construct an iterator over a chained hashtable.
CharSet - class structure.CharSet.: Implementation of a set of characters whose ASCII values are between 0 and 255, inclusive.
CharSet() - Constructor for class structure.CharSet: Constructs an empty charset.
CircularList - class structure.CircularList.: An implementation of lists using circularly linked elements, similar to that of java.util.LinkedList.
CircularList() - Constructor for class structure.CircularList: Construct an empty circular list.
CircularListIterator - class structure.CircularListIterator.: An iterator for traversing the elements of a circular list.
CircularListIterator(SinglyLinkedListElement) - Constructor for class structure.CircularListIterator: Constructs an iterator over circular list whose tail is t
clear() - Method in class structure.ChainedHashtable: Removes the values from the hashtable.
clear() - Method in class structure.GraphMatrix: Remove all vertices (and thus, edges) of the graph.
clear() - Method in class structure.OrderedList: Remove all the elements from the ordered list
clear() - Method in class structure.MapList
clear() - Method in class structure.CircularList: Remove elements of list.
clear() - Method in class structure.QueueList: Remove all the values from the queue.
clear() - Method in interface structure.PriorityQueue: Remove all the elements from the queue.
clear() - Method in class structure.Hashtable: Remove all key-value pairs from hashtable.
clear() - Method in class structure.BinarySearchTree: Removes all data from the binary search tree
clear() - Method in class structure.VectorHeap: Remove all the elements from the queue.
clear() - Method in class structure.QueueArray: Remove all the values from the queue.
clear() - Method in class structure.GraphList: Remove all vertices (and thus, edges) of the graph.
clear() - Method in class structure.SetList: Remove all the elements from the set.
clear() - Method in class structure.RedBlackSearchTree: Removes all data from the binary search tree
clear() - Method in class structure.StackVector: Remove all elements from stack.
clear() - Method in class structure.SkewHeap: Remove all the elements from the queue.
clear() - Method in class structure.Table: Remove all the elements of the table.
clear() - Method in class structure.QueueVector: Remove all the values from the queue.
clear() - Method in class structure.StackList: Remove all elements from the stack.
clear() - Method in class structure.BitSet: Remove all bits from the set.
clear() - Method in class structure.PriorityVector: Remove all the values from the priority queue.
clear() - Method in class structure.DoublyLinkedList: Remove all values from list.
clear() - Method in class structure.Vector: Remove all the values of the vector.
clear() - Method in class structure.CharSet: Removes the characters of the set.
clear() - Method in class structure.OrderedVector: Removes all the values from a an ordered vector
clear() - Method in interface structure.Map
clear() - Method in interface structure.Structure: Removes all elements from the structure.
clear() - Method in class structure.StructCollection: Remove all elements from the Structure.
clear() - Method in interface structure.List: Remove all elements of list.
clear() - Method in class structure.SinglyLinkedList: Remove all values from list.
clear() - Method in class structure.StackArray: Remove all elements from the stack.
clear() - Method in class structure.SetVector: Remove all the elements from the set.
clear() - Method in interface structure.Graph: Remove all vertices (and thus, edges) of the graph.
clear(int) - Method in class structure.BitSet: Remove bits from set; set size to count.
Clock - class structure.Clock.: A simple object for measuring time.
Clock() - Constructor for class structure.Clock: Constructs a stopwatch for timing events to the milliseconds.
clone() - Method in class structure.SetList: Returns a shallow clone of this set.
clone() - Method in class structure.BitSet: Returns a copy of the set.
clone() - Method in class structure.Vector: Construct a shallow copy of the vector.
clone() - Method in class structure.CharSet: Construct a duplicate of the character set.
clone() - Method in class structure.SetVector: Returns a shallow clone of this set.
ComparableAssociation - class structure.ComparableAssociation.: A class implementing a comparable key-value pair.
ComparableAssociation(Comparable) - Constructor for class structure.ComparableAssociation: Construct an association that can be ordered, from only a key.
ComparableAssociation(Comparable, Object) - Constructor for class structure.ComparableAssociation: Construct a key-value association that can be ordered.
ComparableEdge - class structure.ComparableEdge.: A class implementing common edge type among graphs.
ComparableEdge(Edge) - Constructor for class structure.ComparableEdge: Construct a (possibly directed) edge between two labeled vertices.
ComparableEdge(Object, Object, Object, boolean) - Constructor for class structure.ComparableEdge: Construct a (possibly directed) edge between two labeled vertices.
compare(Object, Object) - Method in class structure.ReverseComparator: Compare two values, a and b.
compare(Object, Object) - Method in class structure.NaturalComparator: Compare two values, a and b.
compareTo(Object) - Method in class structure.ComparableEdge: Compare edge, based on labels.
compareTo(Object) - Method in class structure.ComparableAssociation: Determine the order of two comparable associations, based on key.
condition(boolean, String) - Static method in class structure.Assert: Test a general condition.
consistency() - Method in class structure.RedBlackTree: Returns true if this node is consistently structured
consistentlyBlackHeight(int) - Method in class structure.RedBlackTree: Checks to make sure that the black height of tree is height
contains(char) - Method in class structure.CharSet: Detects whether c is a member of this set.
contains(Comparable) - Method in class structure.RedBlackTree: Determines if the red black search tree contains a value
contains(int) - Method in class structure.BitSet: Determine if a bit is a member of the set.
contains(Object) - Method in class structure.AbstractStructure: Determines if the structure contains a value.
contains(Object) - Method in class structure.GraphMatrix: Test for vertex membership.
contains(Object) - Method in class structure.OrderedList: Determine if the ordered list contains a value
contains(Object) - Method in class structure.AbstractList: Check to see if a value is in list.
contains(Object) - Method in class structure.CircularList: Check if a list contains an element.
contains(Object) - Method in class structure.BinarySearchTree: Determines if the binary search tree contains a value
contains(Object) - Method in class structure.SplayTree: Determine if a particular value is within the search tree.
contains(Object) - Method in class structure.GraphList: Test for vertex membership.
contains(Object) - Method in class structure.SetList: Returns true if value is an element of the set.
contains(Object) - Method in class structure.RedBlackSearchTree: Determines if the red-black search tree contains a value
contains(Object) - Method in class structure.DoublyLinkedList: Check to see if a value is within list.
contains(Object) - Method in class structure.Vector: Determine if a value appears in a vector.
contains(Object) - Method in class structure.OrderedVector: Determine if a comparable value is a member of the ordered vector
contains(Object) - Method in interface structure.Structure: Determines if the structure contains a value.
contains(Object) - Method in class structure.StructCollection: Returns true iff object o is contained within the subordinate structure.
contains(Object) - Method in interface structure.List: Check to see if a value is in list.
contains(Object) - Method in class structure.SinglyLinkedList: Check to see if a value is in list.
contains(Object) - Method in class structure.SetVector: Returns true if value is an element of the set.
contains(Object) - Method in interface structure.Graph: Test for vertex membership.
containsAll(Collection) - Method in class structure.StructCollection: Returns true if all of the elements of c are contained within the subordinate structure.
containsAll(Structure) - Method in interface structure.Set: Check to see if this set is contained in the other structure.
containsAll(Structure) - Method in class structure.AbstractSet: Check to see if this set is contained in the other structure.
containsAll(Structure) - Method in class structure.SetList: Determine if this set is a subset of other.
containsAll(Structure) - Method in class structure.SetVector: Determine if this set is a subset of other.
containsEdge(Edge) - Method in class structure.GraphListVertex
containsEdge(Object, Object) - Method in class structure.GraphMatrix: Test for edge membership.
containsEdge(Object, Object) - Method in class structure.GraphList: Test for edge membership.
containsEdge(Object, Object) - Method in interface structure.Graph: Test for edge membership.
containsKey(Object) - Method in class structure.ChainedHashtable: Returns true iff a specific key appears within the table.
containsKey(Object) - Method in class structure.MapList
containsKey(Object) - Method in class structure.Hashtable: Returns true iff a specific key appears within the table.
containsKey(Object) - Method in class structure.Table: Determine if the key is in the table.
containsKey(Object) - Method in interface structure.Map
containsValue(Object) - Method in class structure.ChainedHashtable: Returns true if a specific value appears within the table.
containsValue(Object) - Method in class structure.MapList
containsValue(Object) - Method in class structure.Hashtable: Returns true if a specific value appears within the table.
containsValue(Object) - Method in class structure.Table: Returns true if the value is associated with some key in the table.
containsValue(Object) - Method in interface structure.Map
copyInto(Object[]) - Method in class structure.Vector: Copy the contents of the vector into an array.
count - Variable in class structure.ChainedHashtable: The number of key-value pairs stored within the table.
count - Variable in class structure.ArrayIterator: The number of elements in the array over which to iterate
count - Variable in class structure.OrderedList: Number of elements in list
count - Variable in class structure.CircularList: Number of elements within circular list.
count - Variable in class structure.Hashtable: The number of key-value pairs in table.
count - Variable in class structure.BinarySearchTree: The number of nodes in the tree
count - Variable in class structure.QueueArray: current size of queue
count - Variable in class structure.RedBlackSearchTree: The number of nodes in the tree
count - Variable in class structure.SkewHeap: The number of nodes within heap.
count - Variable in class structure.DoublyLinkedList: Number of elements within list.
count - Variable in class structure.SinglyLinkedList: The number of elements in list.
current - Variable in class structure.ArrayIterator: The current item in the iteration
current - Variable in class structure.HashtableIterator: The current entry being considered.
current - Variable in class structure.SinglyLinkedListIterator: The reference to currently considered element within list.
current - Variable in class structure.SplayTreeIterator: The current node being considered in tree.
current - Variable in class structure.VectorIterator: The index of the current value.
current - Variable in class structure.DoublyLinkedListIterator: Reference to the current node in the list.
current - Variable in class structure.CircularListIterator: The current value of the iterator.

D

data - Variable in class structure.ChainedHashtable: The array of chains used to store values.
data - Variable in class structure.GraphMatrix: The edge data.
data - Variable in class structure.ArrayIterator: The array over which this iterator iterates
data - Variable in class structure.OrderedList: Pointer to the smallest element, maintained as a singly linked list
data - Variable in class structure.HashtableIterator: Reference to hash table data
data - Variable in class structure.MapList: List for storing the entries in this map
data - Variable in class structure.QueueList: The list holding queue values in order.
data - Variable in class structure.DoublyLinkedListElement: The actual value stored within element; provided by user.
data - Variable in class structure.Hashtable: The data associated with the hashtable.
data - Variable in class structure.VectorHeap: The data, kept in heap order.
data - Variable in class structure.QueueArray: The references to values stored within the queue.
data - Variable in class structure.ChainedHashtableIterator: The list of values within the table.
data - Variable in class structure.SetList: The underlying structure --- a list.
data - Variable in class structure.StackVector: The vector containing the stack data.
data - Variable in class structure.Table: An ordered structure that maintains the ComparableAssociations that store the key-value pairings.
data - Variable in class structure.QueueVector: The vector that maintains the queue data
data - Variable in class structure.StackList: The list that maintains the stack data.
data - Variable in class structure.BitSet: The array of integers that contains the set's bits
data - Variable in class structure.PriorityVector: The vector of data that is maintained in increasing order.
data - Variable in class structure.OrderedVector: The vector of values.
data - Variable in class structure.SinglyLinkedListElement: The data value stored in this node.
data - Variable in class structure.StackArray: The array of value references.
data - Variable in class structure.SetVector: The underlying structure --- a vector.
debug(int, String) - Static method in class structure.Assert: Set up a debugging message at a specific level.
debug(String) - Static method in class structure.Assert: Set up a level 1 debugging message.
debugging() - Static method in class structure.Assert: Increase the verbosity of the debugging messages.
debugLevel - Static variable in class structure.Assert: The current level of debugging; generally 0 upward.
debugLevel(int) - Static method in class structure.Assert: Explictly set the debugging level (0 = none)
defaultCapacity - Static variable in class structure.Vector: The default size of the vector; may be overridden in the Vector.Vector(int) constructor.
degree() - Method in class structure.GraphListVertex
degree(Object) - Method in class structure.GraphMatrix: Determine out degree of vertex.
degree(Object) - Method in class structure.GraphList: Determine out degree of vertex.
degree(Object) - Method in interface structure.Graph: Determine out degree of vertex.
depth() - Method in class structure.RedBlackTree: Compute the depth of a node.
depth() - Method in class structure.BinaryTree: Compute the depth of a node.
dequeue() - Method in interface structure.Queue: Remove a value from the head of the queue.
dequeue() - Method in class structure.AbstractQueue: Remove a value form the head of the queue.
dict - Variable in class structure.GraphMatrix: Translation between vertex labels and vertex structures.
dict - Variable in class structure.GraphList: Map associating vertex labels with vertex structures.
difference(BitSet) - Method in class structure.BitSet: Computes the difference between this set and the other.
difference(CharSet) - Method in class structure.CharSet: Computes the difference between this and other charset.
directed - Variable in class structure.GraphMatrix: Whether or not graph is directed.
directed - Variable in class structure.GraphList: Whether or not graph is directed.
directed - Variable in class structure.Edge: Whether or not this edge is directed.
DoublyLinkedList - class structure.DoublyLinkedList.: An implementation of lists using doubly linked elements, similar to that of java.util.LinkedList.
DoublyLinkedList() - Constructor for class structure.DoublyLinkedList: Constructs an empty list.
DoublyLinkedListElement - class structure.DoublyLinkedListElement.: A class supporting a doubly linked list element.
DoublyLinkedListElement(Object) - Constructor for class structure.DoublyLinkedListElement: Construct a doubly linked list element containing a value.
DoublyLinkedListElement(Object, DoublyLinkedListElement, DoublyLinkedListElement) - Constructor for class structure.DoublyLinkedListElement: Construct a doubly linked list element.
DoublyLinkedListIterator - class structure.DoublyLinkedListIterator.: An iterator for traversing the elements of a doubly linked list.
DoublyLinkedListIterator(DoublyLinkedListElement) - Constructor for class structure.DoublyLinkedListIterator: Construct an iterator over a doubly linked list hanging from head.
DoublyLinkedListIterator(DoublyLinkedListElement, DoublyLinkedListElement) - Constructor for class structure.DoublyLinkedListIterator

E

Edge - class structure.Edge.: A class implementing common edge type among graphs.
Edge(Object, Object, Object, boolean) - Constructor for class structure.Edge: Construct a (possibly directed) edge between two labeled vertices.
edgeCount() - Method in class structure.GraphMatrix: Determine the number of edges in graph.
edgeCount() - Method in class structure.GraphMatrixUndirected: Determine the number of edges in graph.
edgeCount() - Method in class structure.GraphMatrixDirected: Determine the number of edges in graph.
edgeCount() - Method in class structure.GraphList: Determine the number of edges in graph.
edgeCount() - Method in class structure.GraphListUndirected: Determine the number of edges in graph.
edgeCount() - Method in class structure.GraphListDirected: Determine the number of edges in graph.
edgeCount() - Method in interface structure.Graph: Determine the number of edges in graph.
edges - Variable in class structure.GraphListAIterator
edges - Variable in class structure.GraphListEIterator
edges() - Method in class structure.GraphMatrix: Construct an traversal over all edges.
edges() - Method in class structure.GraphMatrixUndirected: Construct an traversal over all edges.
edges() - Method in class structure.GraphMatrixDirected: Construct an traversal over all edges.
edges() - Method in class structure.GraphList: Construct an iterator over all edges.
edges() - Method in interface structure.Graph: Construct an iterator over all edges.
elementAt(int) - Method in class structure.Vector: Fetch the element at a particular index.
elementCount - Variable in class structure.Vector: The actual number of elements logically stored within the vector.
elementData - Variable in class structure.Vector: The data associated with the vector.
elements - Variable in class structure.ChainedHashtableIterator: The iterator over the elements of the list.
elements() - Method in class structure.AbstractStructure: Return an enumeration associated with this structure.
elements() - Method in interface structure.Structure: Returns an enumeration for traversing the structure.
EMPTY - Static variable in class structure.RedBlackTree: the unique empty node; used as children on leaf trees and as empty search trees.
EMPTY - Static variable in class structure.BinaryTree: The unique empty node
empty() - Method in interface structure.Queue: Returns true iff the queue is empty.
empty() - Method in class structure.AbstractLinear: Determine if there are elements within the linear.
empty() - Method in interface structure.Linear: Returns true iff the structure is empty.
empty() - Method in class structure.StackList: Determine if the stack is empty.
empty() - Method in interface structure.Stack: Returns true iff the stack is empty.
enqueue(Object) - Method in interface structure.Queue: Add a value to the tail of the queue.
enqueue(Object) - Method in class structure.AbstractQueue: Add a value to the tail of the queue.
ensureCapacity(int) - Method in class structure.Vector: Ensure that the vector is capable of holding at least minCapacity values without expansion.
Entry - class structure.Entry.: An implementation of the the java.util.Map.Entry interface, Entry is a simple key value pair, from which both the key and the value can be accessed.
Entry(Object) - Constructor for class structure.Entry: Constructs a pair from a key; value is null.
Entry(Object, Object) - Constructor for class structure.Entry: Constructs a pair from a key and value.
entrySet() - Method in class structure.ChainedHashtable
entrySet() - Method in class structure.MapList
entrySet() - Method in class structure.Hashtable
entrySet() - Method in class structure.Table: Return a structure containing all the entries in this Table
entrySet() - Method in interface structure.Map
eof() - Method in class structure.ReadStream: Determine if we've seen end-of-file.
eoln() - Method in class structure.ReadStream: Return true if the next character to be read is an end-of-line mark.
equals(Object) - Method in class structure.MapList
equals(Object) - Method in class structure.Entry: Standard comparison function.
equals(Object) - Method in class structure.DoublyLinkedListElement: Determine if this element equal to another.
equals(Object) - Method in class structure.Vertex: Returns true iff the labels of two vertices are equal.
equals(Object) - Method in class structure.Association: Standard comparison function.
equals(Object) - Method in class structure.BitSet: Return true iff this set and o contain the same elements.
equals(Object) - Method in class structure.ReverseComparator: Returns true if the other object is a NaturalComparator.
equals(Object) - Method in class structure.Edge: Test for equality of edges.
equals(Object) - Method in class structure.CharSet: Detect if two sets are equal.
equals(Object) - Method in interface structure.Map
equals(Object) - Method in class structure.NaturalComparator: Returns true if the other object is a NaturalComparator.
equals(Object) - Method in class structure.StructCollection: Compare one StructCollection with another.
extend() - Method in class structure.Hashtable
extend(int) - Method in class structure.BitSet: Ensures that bit "bit" is within capacity of set.

F

fail(String) - Static method in class structure.Assert: Indicate certain failure.
FailedAssertion - error structure.FailedAssertion.: This error is thrown by the Assert class in the event of any failed assertion test.
FailedAssertion(String) - Constructor for class structure.FailedAssertion: Constructs an error indicating failure to meet condition.
FailedInvariant - error structure.FailedInvariant.: This error is thrown by the Assert class in the event of a failed invariant test.
FailedInvariant(String) - Constructor for class structure.FailedInvariant: Constructs an error indicating failure to meet an invariant
FailedPostcondition - error structure.FailedPostcondition.: This error is thrown by the Assert class in the event of a failed postcondition.
FailedPostcondition(String) - Constructor for class structure.FailedPostcondition: Constructs an error indicating failure to meet a postcondition.
FailedPrecondition - error structure.FailedPrecondition.: This error is thrown by the Assert class in the event of a failed precondition.
FailedPrecondition(String) - Constructor for class structure.FailedPrecondition: Constructs an error indicating failure to meet a precondition.
firstElement() - Method in class structure.Vector: Get access to the first element of the vector.
freeList - Variable in class structure.GraphMatrix: List of free vertex indices within graph.

G

get() - Method in class structure.AbstractIterator: Returns the value currently being considered by the AbstractIterator.
get() - Method in class structure.ArrayIterator: Return the object currently specified by the iteration without advancing the iterator to the next object.
get() - Method in class structure.KeyIterator: Returns the current key from the slave iterator.
get() - Method in class structure.AbstractList: Retrieves value from tail of list.
get() - Method in class structure.HashtableIterator: Get current value of traversal.
get() - Method in class structure.RedBlackIterator: Return the node currently being considered.
get() - Method in interface structure.Queue: Fetch the value at the head of the queue.
get() - Method in class structure.BTPostorderIterator: Return the value of the current node.
get() - Method in class structure.QueueList: Fetch the value at the head of the queue.
get() - Method in class structure.QueueArray: Fetch the value at the head of the queue.
get() - Method in class structure.ChainedHashtableIterator: Get current value of iterator.
get() - Method in class structure.BTLevelorderIterator: Returns the value of the currently considered node.
get() - Method in class structure.StackVector: Fetch a reference to the top element of the stack.
get() - Method in interface structure.Linear: Preview the object to be removed.
get() - Method in class structure.GraphListAIterator
get() - Method in class structure.QueueVector: Fetch the value at the head of the queue.
get() - Method in class structure.StackList: Get a reference to the top value in the stack.
get() - Method in class structure.ValueIterator: Returns the current value from the slave iterator.
get() - Method in class structure.SinglyLinkedListIterator: Return structure's current object reference.
get() - Method in class structure.BTPreorderIterator: Returns the value currently being referenced by iterator.
get() - Method in class structure.GraphListEIterator
get() - Method in interface structure.List: Retrieves value from tail of list.
get() - Method in class structure.BTInorderIterator: Return the node currently being considered.
get() - Method in class structure.SplayTreeIterator: Return a reference to the current value.
get() - Method in class structure.AbstractListIterator
get() - Method in class structure.VectorIterator: Fetch a reference to the current value.
get() - Method in class structure.DoublyLinkedListIterator: Get reference to value that is current.
get() - Method in class structure.StackArray: Get a reference to the top value in the stack.
get() - Method in class structure.CircularListIterator: Determine the current value of iterator.
get() - Method in interface structure.Stack: Fetch a reference to the top element of the stack.
get(Comparable) - Method in class structure.RedBlackTree: Returns a c-equivalent value from tree, or null.
get(int) - Method in class structure.CircularList: Get value at location i.
get(int) - Method in class structure.DoublyLinkedList: Get value at location i.
get(int) - Method in class structure.Vector: Fetch the element at a particular index.
get(int) - Method in interface structure.List: Get value at location i.
get(int) - Method in class structure.SinglyLinkedList: Get value at location i.
get(int, int) - Method in class structure.Matrix: Fetch an element from the matrix.
get(Object) - Method in class structure.ChainedHashtable: Get the value associated with a key.
get(Object) - Method in class structure.GraphMatrix: Get reference to actual label of vertex.
get(Object) - Method in class structure.MapList
get(Object) - Method in class structure.Hashtable: Get the value associated with a key.
get(Object) - Method in class structure.BinarySearchTree: Returns reference to value found within three.
get(Object) - Method in class structure.SplayTree: Fetch a reference to the comparable value in the tree.
get(Object) - Method in class structure.GraphList: Get reference to actual label of vertex.
get(Object) - Method in class structure.Table: Retrieve the value associated with the key provided.
get(Object) - Method in interface structure.Map
get(Object) - Method in interface structure.Graph: Get reference to actual label of vertex.
getColor() - Method in class structure.RedBlackTree: Support method for RedBlackTree.toString().
getEdge(Edge) - Method in class structure.GraphListVertex
getEdge(Object, Object) - Method in class structure.GraphMatrix: Get reference to actual edge.
getEdge(Object, Object) - Method in class structure.GraphList: Get reference to actual edge.
getEdge(Object, Object) - Method in interface structure.Graph: Get reference to actual edge.
getFirst() - Method in class structure.AbstractList: Fetch first element of list.
getFirst() - Method in class structure.CircularList: Determine if a list is empty.
getFirst() - Method in interface structure.Queue: Fetch the value at the head of the queue.
getFirst() - Method in class structure.AbstractQueue: Fetch the value at the head of the queue.
getFirst() - Method in interface structure.PriorityQueue: Fetch lowest valued (highest priority) item from queue.
getFirst() - Method in class structure.VectorHeap: Fetch lowest valued (highest priority) item from queue.
getFirst() - Method in class structure.AbstractStack: Deprecated. Please use method get, rather than getFirst!
getFirst() - Method in class structure.SkewHeap: Fetch lowest valued (highest priority) item from queue.
getFirst() - Method in interface structure.MergeableHeap: Return the minimum value in the heap.
getFirst() - Method in class structure.PriorityVector: Fetch the smallest value of the priority queue.
getFirst() - Method in class structure.DoublyLinkedList: Get a copy of first value found in list.
getFirst() - Method in interface structure.List: Fetch first element of list.
getFirst() - Method in class structure.ReadStream: Read (but don't consume) next char in stream.
getFirst() - Method in class structure.SinglyLinkedList: Fetch first element of list.
getFirst() - Method in interface structure.Stack: Fetch a reference to the top element of the stack.
getHand() - Method in class structure.RedBlackTree: Support method for RedBlackTree.toString().
getHand() - Method in class structure.BinaryTree: Support method for BinaryTree.toString().
getKey() - Method in class structure.Entry: Fetch key from association.
getKey() - Method in class structure.Association: Fetch key from association.
getLast() - Method in class structure.AbstractList: Fetch last element of list.
getLast() - Method in class structure.CircularList: Peek at last element of list.
getLast() - Method in class structure.DoublyLinkedList: Get a copy of last value found in list.
getLast() - Method in interface structure.List: Fetch last element of list.
getLast() - Method in class structure.SinglyLinkedList: Fetch last element of list.
getTail() - Method in class structure.CircularList: Accessor method for tail field
getValue() - Method in class structure.Entry: Fetch value from association.
getValue() - Method in class structure.Association: Fetch value from association.
Graph - interface structure.Graph.: The interface describing all Graph objects.
GraphList - class structure.GraphList.: Implementation of graph using adjacency lists.
GraphList(boolean) - Constructor for class structure.GraphList: Constructor of directed/undirected GraphList.
GraphListAIterator - class structure.GraphListAIterator.: An adjacent vertex iterator.
GraphListAIterator(Iterator, Object) - Constructor for class structure.GraphListAIterator
GraphListDirected - class structure.GraphListDirected.: A GraphListDirected is a list-based graph representation that consists of a collection of vertices and directed edges.
GraphListDirected() - Constructor for class structure.GraphListDirected: Construct a directed, adjacency-list based graph.
GraphListEIterator - class structure.GraphListEIterator.: An iterator over all edges.
GraphListEIterator(Map) - Constructor for class structure.GraphListEIterator
GraphListUndirected - class structure.GraphListUndirected.: A GraphListUndirected is a list-based graph representation that consists of a collection of vertices and undirected edges.
GraphListUndirected() - Constructor for class structure.GraphListUndirected: Construct an undirected, adjacency-list based graph.
GraphListVertex - class structure.GraphListVertex.: A private implementation of a vertex for use in graphs that are internally represented as a list.
GraphListVertex(Object) - Constructor for class structure.GraphListVertex
GraphMatrix - class structure.GraphMatrix.: Implementation of graph using adjacency matrices.
GraphMatrix(int, boolean) - Constructor for class structure.GraphMatrix: Constructor of directed/undirected GraphMatrix.
GraphMatrixDirected - class structure.GraphMatrixDirected.: A GraphMatrixDirected is a matrix-based graph representation that consists of a collection of vertices and directed edges.
GraphMatrixDirected(int) - Constructor for class structure.GraphMatrixDirected: Construct a directed, adjacency-matrix based graph.
GraphMatrixUndirected - class structure.GraphMatrixUndirected.: A GraphMatrixUndirected is a matrix-based graph representation that consists of a collection of vertices and undirected edges.
GraphMatrixUndirected(int) - Constructor for class structure.GraphMatrixUndirected: Construct an undirected, adjacency-matrix based graph.
GraphMatrixVertex - class structure.GraphMatrixVertex.: A private implementation of a vertex for use in graphs that are internally represented as a Matrix.
GraphMatrixVertex(Object, int) - Constructor for class structure.GraphMatrixVertex

H

hashCode() - Method in class structure.AbstractMap: Compute the hashCode for elements of this map
hashCode() - Method in class structure.RedBlackTree: Computes hash code associated with values of tree.
hashCode() - Method in class structure.AbstractStructure
hashCode() - Method in class structure.MapList
hashCode() - Method in class structure.Entry: Standard hashcode function.
hashCode() - Method in class structure.DoublyLinkedListElement: Generate hash code associated with the element.
hashCode() - Method in class structure.BinarySearchTree: Returns the hashCode of the value stored by this object.
hashCode() - Method in class structure.RedBlackSearchTree: Returns the hashCode of the value stored by this object.
hashCode() - Method in class structure.Vertex: Return a hashcode associated with the vertex.
hashCode() - Method in class structure.Association: Standard hashcode function.
hashCode() - Method in class structure.BinaryTree
hashCode() - Method in class structure.Edge: Returns hashcode associated with edge.
hashCode() - Method in interface structure.Map
hashCode() - Method in class structure.StructCollection: Return hash code.
Hashtable - class structure.Hashtable.: Implements a dictionary as a table of hashed key-value pairs.
Hashtable() - Constructor for class structure.Hashtable: Construct a hash table that is initially empty.
Hashtable(int) - Constructor for class structure.Hashtable: Construct a hash table that is capable of holding at least initialCapacity values.
HashtableIterator - class structure.HashtableIterator.: A traversal of all the elements as they appear in a hashtable.
HashtableIterator(Association[]) - Constructor for class structure.HashtableIterator: Construct a traversal over a hashtable.
hasMoreElements() - Method in class structure.AbstractIterator: An Enumeration method that is equivalent to AbstractIterator.hasNext().
hasNext() - Method in class structure.AbstractIterator: Returns true if the iterator has more elements to visit.
hasNext() - Method in class structure.ArrayIterator: Returns true iff there are elements specified by our iterator that have not been visited by the current iteration.
hasNext() - Method in class structure.KeyIterator: Returns true if an association is available for generating a key.
hasNext() - Method in class structure.HashtableIterator: Returns true iff there are unconsidered elements within the table.
hasNext() - Method in class structure.RedBlackIterator: Returns true iff the iterator has more nodes to be considered.
hasNext() - Method in class structure.BTPostorderIterator: Return true iff more nodes are to be considered in traversal.
hasNext() - Method in class structure.ChainedHashtableIterator: Returns true iff there are unconsidered elements within the table.
hasNext() - Method in class structure.BTLevelorderIterator: Return true if more nodes are to be considered.
hasNext() - Method in class structure.GraphListAIterator
hasNext() - Method in class structure.ValueIterator: Returns true if an association is available for generating a value.
hasNext() - Method in class structure.SinglyLinkedListIterator: Determine if the iteration is finished.
hasNext() - Method in class structure.BTPreorderIterator: Returns true if some nodes of subtree have yet to be considered.
hasNext() - Method in class structure.GraphListEIterator
hasNext() - Method in class structure.BTInorderIterator: Returns true iff the iterator has more nodes to be considered.
hasNext() - Method in class structure.SplayTreeIterator: Determine if the iterator has more nodes to be considered.
hasNext() - Method in class structure.VectorIterator: Determine if some of the elements have yet to be considered.
hasNext() - Method in class structure.DoublyLinkedListIterator: Determine if there are more elements to be considered.
hasNext() - Method in class structure.CircularListIterator: Determine if there are unconsidered elements.
head - Variable in class structure.ArrayIterator: The index of the first item in the iteration
head - Variable in class structure.QueueArray: index of the head of queue.
head - Variable in class structure.DoublyLinkedList: Reference to head of list.
head - Variable in class structure.SinglyLinkedListIterator: The head of list.
head - Variable in class structure.SinglyLinkedList: The head of the list.
head - Variable in class structure.DoublyLinkedListIterator: Reference to head of the list.
height - Variable in class structure.Matrix
height() - Method in class structure.Matrix: Return the height of the matrix.
height() - Method in class structure.BinaryTree: Returns height of node in tree.
here() - Method in class structure.Edge: Returns the first vertex (or source if directed).

I

index - Variable in class structure.GraphMatrixVertex
index() - Method in class structure.GraphMatrixVertex
indexOf(Comparable) - Method in class structure.PriorityVector
indexOf(Comparable) - Method in class structure.OrderedVector
indexOf(int) - Method in class structure.BitSet: Determine the int index associated with a bit number.
indexOf(Object) - Method in class structure.CircularList: Determine first location of a value in list.
indexOf(Object) - Method in class structure.DoublyLinkedList: Determine first location of a value in list.
indexOf(Object) - Method in class structure.Vector: Assuming the data is not in order, find the index of a value, or return -1 if not found.
indexOf(Object) - Method in interface structure.List: Determine first location of a value in list.
indexOf(Object) - Method in class structure.SinglyLinkedList: Determine first location of a value in list.
indexOf(Object, int) - Method in class structure.Vector: Assuming the data is not in order, find the index of a value or return -1 if the value is not found.
info - Static variable in class structure.Version
initialCapacity - Variable in class structure.BitSet: The initial capacity of the set, by default.
initialValue - Variable in class structure.Vector: The initial value of any new elements that are appended to the vector.
inorderIterator() - Method in class structure.BinaryTree: Return an iterator to traverse the elements of subtree in-order
insert(Comparable) - Method in class structure.RedBlackTree: Insert a (possibly duplicate) value to red-black search tree
insertElementAt(Object, int) - Method in class structure.Vector: Insert an element at a particular location.
intersection(BitSet) - Method in class structure.BitSet: Return the intersection of this set and the other.
intersection(CharSet) - Method in class structure.CharSet: Computes the intersection of this charset and other.
invariant(boolean, String) - Static method in class structure.Assert: Test a loop invariant.
isBalanced() - Method in class structure.BinaryTree: Return true iff the tree is height balanced.
isBlack() - Method in class structure.RedBlackTree: Determines if this tree is black.
isComplete() - Method in class structure.BinaryTree: Return whether tree is complete.
isDirected() - Method in class structure.GraphMatrix: Determine if graph is directed.
isDirected() - Method in class structure.GraphList: Determine if graph is directed.
isDirected() - Method in class structure.Edge: Check to see if edge is directed.
isDirected() - Method in interface structure.Graph: Determine if graph is directed.
isEmpty() - Method in class structure.ChainedHashtable: Returns true if no elements are stored within the table.
isEmpty() - Method in class structure.RedBlackTree: Returns true if tree is empty.
isEmpty() - Method in class structure.AbstractStructure: Determine if there are elements within the structure.
isEmpty() - Method in class structure.GraphMatrix: Determine if graph is empty.
isEmpty() - Method in class structure.OrderedList: Determine if the list is empty
isEmpty() - Method in class structure.AbstractList: Determine if list is empty.
isEmpty() - Method in class structure.MapList
isEmpty() - Method in class structure.CircularList: Determine if a list is empty.
isEmpty() - Method in class structure.QueueList: Determine if the queue is empty.
isEmpty() - Method in interface structure.PriorityQueue: Determine if the queue is empty.
isEmpty() - Method in class structure.Hashtable: Determine if table is empty.
isEmpty() - Method in class structure.BinarySearchTree: Checks for an empty binary search tree
isEmpty() - Method in class structure.VectorHeap: Determine if the queue is empty.
isEmpty() - Method in class structure.QueueArray: Determine if the queue is empty.
isEmpty() - Method in class structure.GraphList: Determine if graph is empty.
isEmpty() - Method in class structure.SetList: Determine if the set is empty.
isEmpty() - Method in class structure.RedBlackSearchTree: Checks for an empty binary search tree
isEmpty() - Method in class structure.StackVector: Returns true iff the stack is empty.
isEmpty() - Method in class structure.SkewHeap: Determine if the queue is empty.
isEmpty() - Method in class structure.Table: Determine if the table is empty.
isEmpty() - Method in class structure.QueueVector: Determine if the queue is empty.
isEmpty() - Method in class structure.BinaryTree: Returns true if tree is empty.
isEmpty() - Method in class structure.BitSet: Determine if a set is empty.
isEmpty() - Method in class structure.PriorityVector: Determine if the priority queue is empty.
isEmpty() - Method in class structure.DoublyLinkedList: Determine if list is empty.
isEmpty() - Method in class structure.Vector: Determine if the Vector contains no values.
isEmpty() - Method in class structure.CharSet: Detect an empty charset.
isEmpty() - Method in class structure.OrderedVector: Determine if the ordered vector is empty.
isEmpty() - Method in interface structure.Map
isEmpty() - Method in interface structure.Structure: Determine if there are elements within the structure.
isEmpty() - Method in class structure.StructCollection: Detect an empty structure.
isEmpty() - Method in interface structure.List: Determine if list is empty.
isEmpty() - Method in class structure.StackArray: Determine if the stack is empty.
isEmpty() - Method in class structure.SetVector: Determine if the set is empty.
isEmpty() - Method in interface structure.Graph: Determine if graph is empty.
isFull() - Method in class structure.QueueArray: Determines if the queue is not able to accept any new values.
isFull() - Method in class structure.BinaryTree: Returns true if tree is full.
isFull() - Method in class structure.StackArray: Determine if the stack is full.
isLeftChild() - Method in class structure.RedBlackTree: Determine if this node is a left child
isLeftChild() - Method in class structure.BinaryTree: Determine if this node is a left child
isRed - Variable in class structure.RedBlackTree: The color of this node - red or black (not red)
isRed() - Method in class structure.RedBlackTree: Determines if this tree is red.
isRedBlack() - Method in class structure.RedBlackSearchTree: Returns true iff this tree is a red-black tree.
isRightChild() - Method in class structure.RedBlackTree: Determine if this node is a right child
isRightChild() - Method in class structure.BinaryTree: Determine if this node is a right child
isRoot() - Method in class structure.RedBlackTree: Determine if this node is a root.
isVisited() - Method in class structure.Vertex: Determine if the vertex has been visited.
isVisited() - Method in class structure.Edge: Check to see if edge has been visited.
isVisited(Object) - Method in class structure.GraphMatrix: Return visited flag of vertex.
isVisited(Object) - Method in class structure.GraphList: Return visited flag of vertex.
isVisited(Object) - Method in interface structure.Graph: Return visited flag of vertex.
isVisitedEdge(Edge) - Method in class structure.GraphMatrix: Return visited flag of edge.
isVisitedEdge(Edge) - Method in class structure.GraphList: Return visited flag of edge.
isVisitedEdge(Edge) - Method in interface structure.Graph: Return visited flag of edge.
isWhite(char) - Static method in class structure.ReadStream
iterator() - Method in class structure.ChainedHashtable: Returns an iterator that traverses over the values of the hashtable.
iterator() - Method in class structure.RedBlackTree: Returns an in-order iterator over the subtree rooted at this node.
iterator() - Method in class structure.GraphMatrix: Construct vertex traversal.
iterator() - Method in class structure.OrderedList: Construct an iterator for traversing elements of ordered list in ascending order
iterator() - Method in class structure.CircularList: Construct an iterator over elements of list.
iterator() - Method in class structure.QueueList
iterator() - Method in class structure.Hashtable: Returns a traversal that traverses over the values of the hashtable.
iterator() - Method in class structure.BinarySearchTree: Returns an iterator over the binary search tree.
iterator() - Method in class structure.SplayTree: Construct an inorder traversal of the elements in the splay tree.
iterator() - Method in class structure.QueueArray
iterator() - Method in class structure.GraphList: Construct vertex iterator.
iterator() - Method in class structure.SetList: Construct an traversal to traverse the elements of the set.
iterator() - Method in class structure.RedBlackSearchTree: Returns an iterator over the red-black search tree.
iterator() - Method in class structure.StackVector
iterator() - Method in class structure.Table: Construct an iterator over the values of the table.
iterator() - Method in class structure.QueueVector
iterator() - Method in class structure.BinaryTree: Generate an in-order iterator of subtree
iterator() - Method in class structure.StackList
iterator() - Method in class structure.DoublyLinkedList: Construct an iterator to traverse list.
iterator() - Method in class structure.Vector: Construct a iterator over the elements of the vector.
iterator() - Method in class structure.OrderedVector: Construct an iterator to traverse the ordered vector in ascending order
iterator() - Method in interface structure.Structure: Returns an iterator for traversing the structure.
iterator() - Method in class structure.StructCollection: Return an iterator to traverse the subordinate structure.
iterator() - Method in interface structure.List: Construct an iterator to traverse elements of list from head to tail, in order.
iterator() - Method in class structure.SinglyLinkedList: Returns an iterator traversing list from head to tail.
iterator() - Method in class structure.StackArray
iterator() - Method in class structure.SetVector: Construct an traversal to traverse the elements of the set.
iterator() - Method in interface structure.Graph: Construct vertex iterator.

K

KeyIterator - class structure.KeyIterator.: A private master iterator for filtering the key fields from an Association-returning iterator.
KeyIterator(Iterator) - Constructor for class structure.KeyIterator: Construct a new key iterator that filters the slave iterator, an Association-returning iterator.
keys() - Method in class structure.ChainedHashtable: Get an iterator over the keys of the hashtable.
keys() - Method in class structure.Hashtable: Get a traversal over the keys of the hashtable.
keys() - Method in class structure.Table: Construct an iterator over the keys of the table.
keySet() - Method in class structure.ChainedHashtable
keySet() - Method in class structure.MapList
keySet() - Method in class structure.Hashtable
keySet() - Method in class structure.Table: Return a set containing the keys referenced by this data structure.
keySet() - Method in interface structure.Map

L

label - Variable in class structure.Vertex: A label associated with vertex.
label - Variable in class structure.Edge: Label associated with edge.
label() - Method in class structure.Vertex: Fetch the label associated with vertex.
label() - Method in class structure.Edge: Get label associated with edge.
lastElement() - Method in class structure.Vector: Fetch a reference to the last value in the vector.
lastIndexOf(Object) - Method in class structure.CircularList: Determine last location of a value in list.
lastIndexOf(Object) - Method in class structure.DoublyLinkedList: Determine last location of a value in list.
lastIndexOf(Object) - Method in class structure.Vector: Search for the last occurrence of a value within the vector.
lastIndexOf(Object) - Method in interface structure.List: Determine last location of a value in list.
lastIndexOf(Object) - Method in class structure.SinglyLinkedList: Determine last location of a value in list.
lastIndexOf(Object, int) - Method in class structure.Vector: Find the index of the last occurrence of the value in the vector before the indexth position.
left - Variable in class structure.RedBlackTree: The left child of this node, or EMPTY
left - Variable in class structure.BinaryTree: The left child of this node, or EMPTY
left() - Method in class structure.RedBlackTree: Get left subtree of current node
left() - Method in class structure.BinaryTree: Get left subtree of current node
left(int) - Static method in class structure.VectorHeap: Returns left child index.
levelorderIterator() - Method in class structure.BinaryTree: Method to return a level-order iterator of subtree
Linear - interface structure.Linear.: An interface describing the behavior of linear data structures, structures that that have completely determined add and remove methods.
List - interface structure.List.: Interface describing lists.
loadFactor - Variable in class structure.Hashtable: Load factor that causes rehashing of the table.
locate(BinaryTree, Object) - Method in class structure.BinarySearchTree
locate(Comparable) - Method in class structure.RedBlackTree: Locates a value in the search tree or returns the largest value less than value.
locate(Object) - Method in class structure.ChainedHashtable
locate(Object) - Method in class structure.Hashtable

M

main(String[]) - Static method in class structure.ArrayIterator: test code to prove that iterators are slower than for loops
main(String[]) - Static method in class structure.GraphList
main(String[]) - Static method in class structure.SkewHeap
main(String[]) - Static method in class structure.Table
main(String[]) - Static method in class structure.SetVector
main(String[]) - Static method in class structure.Version
major - Static variable in class structure.Version
Map - interface structure.Map.: Associations establish a link between a key and a value.
MapList - class structure.MapList.: Associations establish a link between a key and a value.
MapList() - Constructor for class structure.MapList: Construct an empty map, based on a list
MapList(Map) - Constructor for class structure.MapList: Construct a map with values found in source
Matrix - class structure.Matrix.: An implementation of rectangular vectors.
Matrix() - Constructor for class structure.Matrix: Construct an empty matrix.
Matrix(int, int) - Constructor for class structure.Matrix: Constructs a matrix such that all values are null.
merge(AppendableList) - Method in class structure.AppendableList: Provides a constant time function that merges the contents of two lists by appending l to this list.
merge(BinaryTree, BinaryTree) - Static method in class structure.SkewHeap
merge(MergeableHeap) - Method in class structure.SkewHeap: Merge this heap with another
merge(MergeableHeap) - Method in interface structure.MergeableHeap: Merge this heap with otherHeap, destroying otherHeap in the process.
MergeableHeap - interface structure.MergeableHeap.: Interface describing mergeable min heaps.
minor - Static variable in class structure.Version

N

name - Static variable in class structure.Version
NaturalComparator - class structure.NaturalComparator.: Implementation of the Comparator interface that provides a NaturalComparator.compare(java.lang.Object, java.lang.Object) method that compares two objects using those objects default compareTo methods.
NaturalComparator() - Constructor for class structure.NaturalComparator
neighbors(Object) - Method in class structure.GraphMatrix: Construct an adjacent vertex traversal.
neighbors(Object) - Method in class structure.GraphList: Construct an adjacent vertex iterator.
neighbors(Object) - Method in interface structure.Graph: Construct an adjacent vertex iterator.
next() - Method in class structure.AbstractIterator: Moves, bumps, or "increments" the iterator along the traversal; returns the next value considered.
next() - Method in class structure.ArrayIterator: Return the next object in our iteration and advance the iterator to the next object in the iteration.
next() - Method in class structure.KeyIterator: Returns the current key, and increments the iterator.
next() - Method in class structure.HashtableIterator: Returns current value and increments traversal.
next() - Method in class structure.RedBlackIterator: Return current node, and increment iterator.
next() - Method in class structure.BTPostorderIterator: Return current value and increment iterator.
next() - Method in class structure.DoublyLinkedListElement: Access the reference to the next value.
next() - Method in class structure.ChainedHashtableIterator: Returns current value and increments iterator.
next() - Method in class structure.BTLevelorderIterator: Returns currently considered value and increments iterator.
next() - Method in class structure.GraphListAIterator
next() - Method in class structure.ValueIterator: Returns the current value, and increments the iterator.
next() - Method in class structure.SinglyLinkedListIterator: Return current value and increment Iterator.
next() - Method in class structure.BTPreorderIterator: Returns the current value and increments the iterator.
next() - Method in class structure.GraphListEIterator
next() - Method in class structure.BTInorderIterator: Return current node, and increment iterator.
next() - Method in class structure.SplayTreeIterator: Returns reference to the current element, and increments iterator.
next() - Method in class structure.SinglyLinkedListElement
next() - Method in class structure.VectorIterator: Return current value, and increment iterator.
next() - Method in class structure.DoublyLinkedListIterator: Returns reference to the current element, then increments iterator.
next() - Method in class structure.CircularListIterator: Return the current value and increment iterator.
nextElement - Variable in class structure.DoublyLinkedListElement: The reference of element following.
nextElement - Variable in class structure.SinglyLinkedListElement: Reference to the next node in the list.
nextElement() - Method in class structure.AbstractIterator: An Enumeration method that is equivalent to AbstractIterator.next().

O

offsetOf(int) - Method in class structure.BitSet: Return the bit index within the associated int of bit "bit"
OrderedList - class structure.OrderedList.: A class that implements a collection of values that are kept in order.
OrderedList() - Constructor for class structure.OrderedList: Construct an empty ordered list
OrderedList(Comparator) - Constructor for class structure.OrderedList: Construct an empty ordered list with alternative ordering
OrderedMap - interface structure.OrderedMap.: An interface the supports a Map whose values are kept in increasing order.
OrderedStructure - interface structure.OrderedStructure.: An interface that supports a Collection whose values are kept in increasing order.
OrderedVector - class structure.OrderedVector.: Implementation of an ordered structure implemented using a vector.
OrderedVector() - Constructor for class structure.OrderedVector: Construct an empty ordered vector
ordering - Variable in class structure.OrderedList: The ordereding used to arange the values
ordering - Variable in class structure.BinarySearchTree: The ordering used on this search tree.

P

parent - Variable in class structure.RedBlackTree: The parent of this node, or null
parent - Variable in class structure.BinaryTree: The parent of this node
parent() - Method in class structure.RedBlackTree: Get reference to parent of this node
parent() - Method in class structure.BinaryTree: Get reference to parent of this node
parent(int) - Static method in class structure.VectorHeap: Returns parent index
peek() - Method in interface structure.Queue: Fetch the value at the head of the queue.
peek() - Method in class structure.AbstractQueue: Fetch the value at the head of the queue.
peek() - Method in class structure.AbstractStack: Fetch a reference to the top element of the stack.
peek() - Method in interface structure.Stack: Fetch a reference to the top element of the stack.
percolateUp(int) - Method in class structure.VectorHeap: Moves node upward to appropriate position within heap.
pop() - Method in class structure.AbstractStack: Remove an element from the top of the stack.
pop() - Method in interface structure.Stack: Remove an element from the top of the stack.
post(boolean, String) - Static method in class structure.Assert: Test a postcondition.
postorderIterator() - Method in class structure.BinaryTree: Return an iterator to traverse the elements of subtree in post-order
pre(boolean, String) - Static method in class structure.Assert: Test a precondition.
predecessor(BinaryTree) - Method in class structure.BinarySearchTree
preorderIterator() - Method in class structure.BinaryTree: Return an iterator to traverse nodes of subtree in-order
previous() - Method in class structure.DoublyLinkedListElement: Get a reference to the previous element of the list.
previousElement - Variable in class structure.DoublyLinkedListElement: The reference to element preceding.
print() - Method in class structure.RedBlackTree
PriorityQueue - interface structure.PriorityQueue.: Interface describing an queue of prioritized values.
PriorityVector - class structure.PriorityVector.: A vector-based implementation of a priority queue.
PriorityVector() - Constructor for class structure.PriorityVector: Construct an empty priority queue.
probe(int) - Method in class structure.BitSet: Determines if bit is within capacity of set.
push(Object) - Method in class structure.AbstractStack: Add an element from the top of the stack.
push(Object) - Method in interface structure.Stack: Add an element to top of stack.
pushbackChar(char) - Method in class structure.ReadStream: Return character to input stream for reading at later time.
pushDownRoot(int) - Method in class structure.VectorHeap: Moves node downward, into appropriate position within subheap.
put(Object, Object) - Method in class structure.ChainedHashtable: Place a key-value pair within the table.
put(Object, Object) - Method in class structure.MapList
put(Object, Object) - Method in class structure.Hashtable: Place a key-value pair within the table.
put(Object, Object) - Method in class structure.Table: Enter a key-value pair into the table.
put(Object, Object) - Method in interface structure.Map
putAll(Map) - Method in class structure.AbstractMap
putAll(Map) - Method in class structure.MapList
putAll(Map) - Method in class structure.Hashtable: Put all of the values found in another map into this map, overriding previous key-value associations.
putAll(Map) - Method in interface structure.Map

Q

Queue - interface structure.Queue.: Interface describing a first-in, first-out structure.
QueueArray - class structure.QueueArray.: An implementation of queues based on arrays.
QueueArray(int) - Constructor for class structure.QueueArray: Construct a queue holding at most size elements.
QueueList - class structure.QueueList.: An implementation of queues based on circular lists.
QueueList() - Constructor for class structure.QueueList: Construct a new queue with no data.
QueueVector - class structure.QueueVector.: An implementation of queues based on vectors.
QueueVector() - Constructor for class structure.QueueVector: Construct an empty queue
QueueVector(int) - Constructor for class structure.QueueVector: Constructs an empty queue with an initial allocation of size.

R

read() - Method in class structure.Clock: Read the value on the stop watch.
readBoolean() - Method in class structure.ReadStream: Read the next word "true" or "false" as a boolean.
readChar() - Method in class structure.ReadStream: Read next character, whitespace or not.
readDouble() - Method in class structure.ReadStream: Reads the next double value from input stream.
readFloat() - Method in class structure.ReadStream: Read floating point value from input (Currently not working).
readFully(byte[]) - Method in class structure.ReadStream: Read an array of bytes from input.
readFully(byte[], int, int) - Method in class structure.ReadStream: Read input into byte array.
readInt() - Method in class structure.ReadStream: Reads an integer from input stream.
readLine() - Method in class structure.ReadStream: Read the remainder of line, including end-of-line mark.
readln() - Method in class structure.ReadStream: Read characters up to and including the end-of-line mark.
readLong() - Method in class structure.ReadStream: Read a (potentially long) input.
readShort() - Method in class structure.ReadStream: Reads an integer from input stream.
ReadStream - class structure.ReadStream.: A ReadStream provides reasonable access to the typewritten data on an input stream.
ReadStream() - Constructor for class structure.ReadStream: Construct an empty ReadStream, obtaining info from System.in.
ReadStream(InputStream) - Constructor for class structure.ReadStream: Construct a ReadStream based on pre-existing input stream.
readString() - Method in class structure.ReadStream: Skip white space and read in the next non-whitespace word as a string.
readUTF() - Method in class structure.ReadStream: Read unicode from input.
RedBlackIterator - class structure.RedBlackIterator.: An iterator for traversing RedBlackSearchTrees constructed from RedBlackTrees.
RedBlackIterator(RedBlackTree) - Constructor for class structure.RedBlackIterator: Construct a new inorder iterator of a tree.
RedBlackSearchTree - class structure.RedBlackSearchTree.: Red black trees, are binary trees that guarantee the following three properties.
RedBlackSearchTree() - Constructor for class structure.RedBlackSearchTree: Constructs a red-black search tree with no data
RedBlackTree - class structure.RedBlackTree.: This class implements a single node of a red-black tree.
RedBlackTree() - Constructor for class structure.RedBlackTree: A one-time constructor, for constructing empty trees.
RedBlackTree(Comparable) - Constructor for class structure.RedBlackTree: Constructs a red-black tree with no children, value of the node is provided by the user
redConsistency() - Method in class structure.RedBlackTree: Returns true if no red node in subtree has red children
redFixup() - Method in class structure.RedBlackTree: Takes a red node and, restores the red nodes of the tree to maintain red-black properties if this node has a red parent.
remaining - Variable in class structure.ArrayIterator: The number of items remaining in the itearation
remove() - Method in class structure.AbstractIterator: If implemented, removes the currently visited value from the structure.
remove() - Method in class structure.AbstractList: Removes value from tail of list.
remove() - Method in interface structure.Queue: Remove a value form the head of the queue.
remove() - Method in class structure.QueueList: Remove a value from the head of the queue.
remove() - Method in interface structure.PriorityQueue: Returns the minimum value from the queue.
remove() - Method in class structure.VectorHeap: Returns the minimum value from the queue.
remove() - Method in class structure.QueueArray: Remove a value from the head of the queue.
remove() - Method in class structure.StackVector: Remove an element from the top of the stack.
remove() - Method in interface structure.Linear: Remove a value from the structure.
remove() - Method in class structure.SkewHeap: Returns the minimum value from the queue.
remove() - Method in class structure.QueueVector: Remove a value from the head of the queue
remove() - Method in class structure.StackList: Remove a value from the top of the stack.
remove() - Method in interface structure.MergeableHeap: Returns the minimum value in the heap and deletes this value from the heap.
remove() - Method in class structure.PriorityVector: Remove the smallest value of the structure.
remove() - Method in interface structure.List: Removes value from tail of list.
remove() - Method in class structure.AbstractListIterator
remove() - Method in class structure.StackArray: Remove a value from the top of the stack.
remove() - Method in interface structure.Stack: Remove an element from the top of the stack.
remove(char) - Method in class structure.CharSet: Removes a character from set.
remove(Comparable) - Method in class structure.RedBlackTree: Remove an value "equals to" the indicated value.
remove(int) - Method in class structure.CircularList: Remove and return value at location i.
remove(int) - Method in class structure.BitSet: Remove bit i from the bitset.
remove(int) - Method in class structure.DoublyLinkedList: Remove and return value at location i.
remove(int) - Method in class structure.Vector: Remove an element at a particular location.
remove(int) - Method in interface structure.List: Remove and return value at location i.
remove(int) - Method in class structure.SinglyLinkedList: Remove and return value at location i.
remove(Object) - Method in class structure.ChainedHashtable: Remove a key-value pair from the table.
remove(Object) - Method in class structure.GraphMatrix: Remove a vertex from the graph.
remove(Object) - Method in class structure.OrderedList: Remove a value from the ordered list.
remove(Object) - Method in class structure.MapList
remove(Object) - Method in class structure.CircularList: Remove a value from a list.
remove(Object) - Method in class structure.AbstractLinear: Removes value from the linear structure.
remove(Object) - Method in class structure.Hashtable: Remove a key-value pair from the table.
remove(Object) - Method in class structure.BinarySearchTree: Remove an value "equals to" the indicated value.
remove(Object) - Method in class structure.SplayTree: Remove a comparable value from the tree.
remove(Object) - Method in class structure.GraphList: Remove a vertex from the graph.
remove(Object) - Method in class structure.GraphListUndirected: Remove a vertex from the graph.
remove(Object) - Method in class structure.SetList: Remove an element from the set.
remove(Object) - Method in class structure.RedBlackSearchTree: Remove an value "equals to" the indicated value.
remove(Object) - Method in class structure.Table: Remove a key-value pair, based on key.
remove(Object) - Method in class structure.GraphListDirected: Remove a vertex from the graph.
remove(Object) - Method in class structure.DoublyLinkedList: Remove a value from list.
remove(Object) - Method in class structure.Vector: Remove an element, by value, from vector.
remove(Object) - Method in class structure.OrderedVector: Remove a comparable value from an ordered vector At most one value is removed
remove(Object) - Method in interface structure.Map
remove(Object) - Method in interface structure.Structure: Removes value from the structure.
remove(Object) - Method in class structure.StructCollection: Removes an instance of object o, if it appears within structure.
remove(Object) - Method in interface structure.List: Remove a value from list.
remove(Object) - Method in class structure.SinglyLinkedList: Remove a value from list.
remove(Object) - Method in class structure.SetVector: Remove an element from the set.
remove(Object) - Method in interface structure.Graph: Remove a vertex from the graph.
removeAll(Collection) - Method in class structure.StructCollection: Removes all objects found within collection c from this collection.
removeAll(Structure) - Method in interface structure.Set: Computes the difference between this set and the other structure
removeAll(Structure) - Method in class structure.AbstractSet: Computes the difference between this set and the other structure
removeAll(Structure) - Method in class structure.SetList: Compute the difference between two sets.
removeAll(Structure) - Method in class structure.SetVector: Compute the difference between two sets.
removeAllElements() - Method in class structure.Vector: Remove all the elements of the vector.
removeCol(int) - Method in class structure.Matrix: Remove a column, whose index is c.
removeEdge(Edge) - Method in class structure.GraphListVertex
removeEdge(Object, Object) - Method in class structure.GraphMatrix: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in class structure.GraphMatrixUndirected: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in class structure.GraphMatrixDirected: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in class structure.GraphList: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in class structure.GraphListUndirected: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in class structure.GraphListDirected: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeEdge(Object, Object) - Method in interface structure.Graph: Remove possible edge between vertices labeled vLabel1 and vLabel2.
removeElementAt(int) - Method in class structure.Vector: Remove an element at a particular location.
removeFirst() - Method in class structure.AbstractList: Remove a value from first element of list.
removeFirst() - Method in class structure.CircularList: Remove a value from head of list.
removeFirst() - Method in class structure.DoublyLinkedList: Remove a value from head of list.
removeFirst() - Method in interface structure.List: Remove a value from first element of list.
removeFirst() - Method in class structure.SinglyLinkedList: Remove a value from first element of list.
removeLast() - Method in class structure.AbstractList: Remove last value from list.
removeLast() - Method in class structure.CircularList: Remove a value from tail of list.
removeLast() - Method in class structure.DoublyLinkedList: Remove a value from tail of list.
removeLast() - Method in interface structure.List: Remove last value from list.
removeLast() - Method in class structure.SinglyLinkedList: Remove last value from list.
removeRow(int) - Method in class structure.Matrix: Remove the row whose index is r.
removeTop(BinaryTree) - Method in class structure.BinarySearchTree: Removes the top node of the tree rooted, performs the necissary rotations to reconnect the tree.
reserved - Static variable in class structure.Hashtable: A single key-value pair to be used as a token indicating a reserved location in the hashtable.
reset() - Method in class structure.GraphMatrix: Clear visited flags of edges and vertices.
reset() - Method in class structure.AbstractIterator: Reset iterator to the beginning of the structure.
reset() - Method in class structure.ArrayIterator: Return the iteration to the original state specified by the constructor.
reset() - Method in class structure.KeyIterator: Resets the slave iterator (and thus the key iterator) to the first association in the structure.
reset() - Method in class structure.HashtableIterator: Resets the traversal to point to the beginning of the table.
reset() - Method in class structure.RedBlackIterator: Reset the iterator to its initial state.
reset() - Method in class structure.BTPostorderIterator: Reset the iterator to the first node of the traversal.
reset() - Method in class structure.Clock: Resets the time on the clock to zero.
reset() - Method in class structure.ChainedHashtableIterator: Resets the iterator to point to the beginning of the chained table.
reset() - Method in class structure.GraphList: Clear visited flags of edges and vertices.
reset() - Method in class structure.BTLevelorderIterator: Reset iterator to beginning of traversal.
reset() - Method in class structure.Vertex: Clears the visited flag.
reset() - Method in class structure.GraphListAIterator
reset() - Method in class structure.Edge: Clear the visited flag associated with edge.
reset() - Method in class structure.ValueIterator: Resets the slave iterator (and thus the value iterator) to the first association in the structure.
reset() - Method in class structure.SinglyLinkedListIterator: Reset iterator to beginning of the structure.
reset() - Method in class structure.BTPreorderIterator: Resets the iterator to the first node of the traversal.
reset() - Method in class structure.GraphListEIterator
reset() - Method in class structure.BTInorderIterator: Reset the iterator to its initial state.
reset() - Method in class structure.SplayTreeIterator: Reset the iterator to reference the root of the tree.
reset() - Method in class structure.VectorIterator: Reset the vector iterator to the first value in the vector.
reset() - Method in class structure.DoublyLinkedListIterator: Reset the iterator to the head of the list.
reset() - Method in interface structure.Graph: Clear visited flags of edges and vertices.
reset() - Method in class structure.CircularListIterator: Resets iterator to consider the head of the list.
retainAll(Collection) - Method in class structure.StructCollection: Retains elements of this Collection that are also in c.
retainAll(Structure) - Method in interface structure.Set: Computes the intersection between this set and the other structure.
retainAll(Structure) - Method in class structure.AbstractSet: Computes the intersection between this set and the other structure.
retainAll(Structure) - Method in class structure.SetList: Compute the intersection of this set and other.
retainAll(Structure) - Method in class structure.SetVector: Compute the intersection of this set and other.
ReverseComparator - class structure.ReverseComparator.: Implementation of the Comparator interface that provides a ReverseComparator.compare(Object,Object) method that compares two objects using those objects default compareTo methods.
ReverseComparator() - Constructor for class structure.ReverseComparator: Construct a comparator that generates reverse natural comparison
ReverseComparator(Comparator) - Constructor for class structure.ReverseComparator: Construct a comparator that generates reverse of another comparator
right - Variable in class structure.RedBlackTree: The right child of this node, or EMPTY
right - Variable in class structure.BinaryTree: The left child of this node, or EMPTY
right() - Method in class structure.RedBlackTree: Get right subtree of current node
right() - Method in class structure.BinaryTree: Get right subtree of current node
right(int) - Static method in class structure.VectorHeap: Returns right child index.
root - Variable in class structure.RedBlackIterator: The root of the subtree being traversed.
root - Variable in class structure.BTPostorderIterator: The root of the tree currently being traversed.
root - Variable in class structure.BinarySearchTree: A reference to the root of the tree
root - Variable in class structure.BTLevelorderIterator: The root of the subtree being traversed.
root - Variable in class structure.RedBlackSearchTree: A reference to the root of the tree
root - Variable in class structure.SkewHeap: The root of the skew heap.
root - Variable in class structure.BTPreorderIterator: The root of the subtree to be considered by traversal.
root - Variable in class structure.BTInorderIterator: The root of the subtree being traversed.
root() - Method in class structure.RedBlackTree: Returns reference to root of tree containing n
root() - Method in class structure.BinaryTree: Returns reference to root of tree containing n
rotateLeft() - Method in class structure.RedBlackTree: Method to perform a left rotation of tree about this node Node must have a right child.
rotateLeft() - Method in class structure.BinaryTree: Method to perform a left rotation of tree about this node Node must have a right child.
rotateRight() - Method in class structure.RedBlackTree: Method to perform a right rotation of tree about this node Node must have a left child.
rotateRight() - Method in class structure.BinaryTree: Method to perform a right rotation of tree about this node Node must have a left child.
rows - Variable in class structure.Matrix
running - Variable in class structure.Clock: An indication of whether or not the clock is running

S

s - Variable in class structure.CharSet
Set - interface structure.Set.: Implementation of a set of elements.
set(int, int, Object) - Method in class structure.Matrix: Change the value at location (row, col)
set(int, Object) - Method in class structure.CircularList: Set value stored at location i to object o, returning old value.
set(int, Object) - Method in class structure.DoublyLinkedList: Set value stored at location i to object o, returning old value.
set(int, Object) - Method in class structure.Vector: Change the value stored at location index.
set(int, Object) - Method in interface structure.List: Set value stored at location i to object o, returning old value.
set(int, Object) - Method in class structure.SinglyLinkedList: Set value stored at location i to object o, returning old value.
set(Object) - Method in class structure.AbstractListIterator
setBlack() - Method in class structure.RedBlackTree: Set this node to be black
setElementAt(Object, int) - Method in class structure.Vector: Change the value stored at location index.
setLabel(Object) - Method in class structure.Edge: Sets the label associated with the edge.
setLeft(BinaryTree) - Method in class structure.BinaryTree: Update the left subtree of this node.
setLeft(RedBlackTree) - Method in class structure.RedBlackTree: Update the left subtree of this node.
SetList - class structure.SetList.: Implementation of a set of elements using a list as the underlying storage mechanism.
SetList() - Constructor for class structure.SetList: Construct a new set list.
setNext(DoublyLinkedListElement) - Method in class structure.DoublyLinkedListElement: Set reference to the next element.
setNext(SinglyLinkedListElement) - Method in class structure.SinglyLinkedListElement: Update the next element.
setParent(BinaryTree) - Method in class structure.BinaryTree: Update the parent of this node
setParent(RedBlackTree) - Method in class structure.RedBlackTree: Update the parent of this node
setPrevious(DoublyLinkedListElement) - Method in class structure.DoublyLinkedListElement: Set the reference to the previous element.
setRed() - Method in class structure.RedBlackTree: Set this node to be a red node
setRed(boolean) - Method in class structure.RedBlackTree: Set this node to be a red or black node, depending on value of isRed.
setRight(BinaryTree) - Method in class structure.BinaryTree: Update the right subtree of this node.
setRight(RedBlackTree) - Method in class structure.RedBlackTree: Update the right subtree of this node.
setSize(int) - Method in class structure.Vector: Explicitly set the size of the array.
setValue(Object) - Method in class structure.Entry: Sets the value of the key-value pair.
setValue(Object) - Method in class structure.DoublyLinkedListElement: Set the value of the element.
setValue(Object) - Method in class structure.Association: Sets the value of the key-value pair.
setValue(Object) - Method in class structure.BinaryTree: Set's value associated with this node
setValue(Object) - Method in class structure.SinglyLinkedListElement: Set the value associated with this element.
SetVector - class structure.SetVector.: Implementation of a set of elements using a vector as the underlying storage mechanism.
SetVector() - Constructor for class structure.SetVector: Construct a new set.
SetVector(Structure) - Constructor for class structure.SetVector: Construct a new set from another structure.
SinglyLinkedList - class structure.SinglyLinkedList.: An implementation of lists using singly linked elements, similar to that of java.util.LinkedList.
SinglyLinkedList() - Constructor for class structure.SinglyLinkedList: Construct an empty list.
SinglyLinkedListElement - class structure.SinglyLinkedListElement.: A class supporting a singly linked list element.
SinglyLinkedListElement(Object) - Constructor for class structure.SinglyLinkedListElement: Constructs a singly linked list element not associated with any list.
SinglyLinkedListElement(Object, SinglyLinkedListElement) - Constructor for class structure.SinglyLinkedListElement: Construct a singly linked list element.
SinglyLinkedListIterator - class structure.SinglyLinkedListIterator.: An iterator for traversing the elements of a singly linked list.
SinglyLinkedListIterator(SinglyLinkedListElement) - Constructor for class structure.SinglyLinkedListIterator: Construct an iterator that traverses list beginning at t.
size - Variable in class structure.GraphMatrix: Number of vertices in graph.
size() - Method in class structure.ChainedHashtable: Computes the number of elements stored within the hashtable.
size() - Method in class structure.GraphMatrix: Determine number of vertices within graph.
size() - Method in class structure.OrderedList: Determine the number of elements in the list
size() - Method in class structure.MapList: Returns the number of entries in the map
size() - Method in class structure.CircularList: Determine size of list.
size() - Method in interface structure.Queue: Returns the number of elements in the queue.
size() - Method in class structure.QueueList: Determine the number of elements within the queue.
size() - Method in interface structure.PriorityQueue: Determine the size of the queue.
size() - Method in class structure.Hashtable: Return the number of key-value pairs within the table.
size() - Method in class structure.BinarySearchTree: Determines the number of data values within the tree
size() - Method in class structure.VectorHeap: Determine the size of the queue.
size() - Method in class structure.QueueArray: Determine the number of elements within the queue
size() - Method in class structure.GraphList: Determine number of vertices within graph.
size() - Method in class structure.SetList: Determine the number of elements in the set.
size() - Method in class structure.RedBlackSearchTree: Determines the number of data values within the tree
size() - Method in class structure.StackVector: Determine the number of elements in stack.
size() - Method in interface structure.Linear: Returns the number of elements in the linear structure.
size() - Method in class structure.SkewHeap: Determine the size of the queue.
size() - Method in class structure.Table: Determine the number of key-value pairs within the table.
size() - Method in class structure.QueueVector: Determine the number of elements within the queue.
size() - Method in class structure.BinaryTree: Returns the number of descendants of node
size() - Method in class structure.StackList: Determine the number of elements in the stack.
size() - Method in class structure.PriorityVector: Determine the size of the priority queue.
size() - Method in class structure.DoublyLinkedList: Determine number of elements in list.
size() - Method in class structure.Vector: Determine the number of elements in the vector.
size() - Method in class structure.OrderedVector: Determine the number of elements within the ordered vector
size() - Method in interface structure.Map
size() - Method in interface structure.Structure: Determine the size of the structure.
size() - Method in class structure.StructCollection: Determine the number of elements in this collection.
size() - Method in interface structure.List: Determine size of list.
size() - Method in class structure.SinglyLinkedList: Determine number of elements in list.
size() - Method in class structure.StackArray: Determine the number of elements in the stack.
size() - Method in class structure.SetVector: Determine the number of elements in the set.
size() - Method in interface structure.Graph: Determine number of vertices within graph.
size() - Method in interface structure.Stack: Returns the number of elements in the stack.
SkewHeap - class structure.SkewHeap.: An implementation of a priority queue using skew heaps.
SkewHeap() - Constructor for class structure.SkewHeap: Constructs an empty priority queue.
skipWhite() - Method in class structure.ReadStream: Consume all the white-space characters until EOF or other data.
slave - Variable in class structure.KeyIterator: The underlying iterator.
slave - Variable in class structure.ValueIterator: The underlying iterator.
splay(BinaryTree) - Method in class structure.SplayTree
SplayTree - class structure.SplayTree.: An implementation of binary search trees, based on a splay operation by Tarjan et al.
SplayTree() - Constructor for class structure.SplayTree: Construct an empty search tree.
SplayTree(Comparator) - Constructor for class structure.SplayTree: Construct an empty search tree.
SplayTreeIterator - class structure.SplayTreeIterator.: An iterator for traversing splay trees constructed from BinaryTrees.
SplayTreeIterator(BinaryTree) - Constructor for class structure.SplayTreeIterator: Construct an iterator that traverses the binary search tree based at the root.
Stack - interface structure.Stack.: An interface describing a Last-In, First-Out structure.
StackArray - class structure.StackArray.: An implementation of a stack, based on array.
StackArray(int) - Constructor for class structure.StackArray: Construct a stack capable of holding at least size elements.
StackList - class structure.StackList.: An implementation of a stack, based on lists.
StackList() - Constructor for class structure.StackList: Construct an empty stack.
StackVector - class structure.StackVector.: An implementation of a stack, based on extensible arrays.
StackVector() - Constructor for class structure.StackVector: Construct an empty stack.
StackVector(int) - Constructor for class structure.StackVector: Construct a stack with initial capacity Vector will grow if the stack fills vector.
start() - Method in class structure.Clock: Start the clock running.
stop() - Method in class structure.Clock: Stop the clock.
strm - Variable in class structure.ReadStream: The underlying data stream.
strt - Variable in class structure.Clock: The millisecond that the clock started.
StructCollection - class structure.StructCollection.: This utility class converts a Structure to a Collection.
StructCollection(Structure) - Constructor for class structure.StructCollection: Constructs a Collection, based on the contents of the subordinate Structure object.
structure - package structure: This package is for use with Duane Bailey's Java Structures text, from McGraw-Hill.
Structure - interface structure.Structure.: The interface of a basic, mutable data structure.
subset(BitSet) - Method in class structure.BitSet: Returns true iff this set is a subset of the other.
subset(CharSet) - Method in class structure.CharSet: Detects if this set within the other.
successor(BinaryTree) - Method in class structure.BinarySearchTree

T

Table - class structure.Table.: An implementation of an ordered dictionary.
Table() - Constructor for class structure.Table: Construct a new, empty table.
Table(Table) - Constructor for class structure.Table
tail - Variable in class structure.CircularList: A reference to tail of list.
tail - Variable in class structure.DoublyLinkedList: Reference to tail of list.
tail - Variable in class structure.DoublyLinkedListIterator: Sign of the end of the list.
tail - Variable in class structure.CircularListIterator: The tail of the traversed list.
theKey - Variable in class structure.Entry
theKey - Variable in class structure.Association: The immutable key.
there() - Method in class structure.Edge: Returns the second vertex (or source if undirected).
theValue - Variable in class structure.Entry: The mutable value.
theValue - Variable in class structure.Association: The mutable value.
theVector - Variable in class structure.VectorIterator: The associated vector
toArray() - Method in class structure.StructCollection: Construct an array of values found in the subordinate Structure.
toArray(Object[]) - Method in class structure.StructCollection: Copy elements of this structure into target array.
todo - Variable in class structure.RedBlackIterator: Stack of nodes that maintain the state of the iterator.
todo - Variable in class structure.BTPostorderIterator: The stack the maintains the state of the iterator.
todo - Variable in class structure.BTLevelorderIterator: Queue of nodes that maintain the state of the iterator.
todo - Variable in class structure.BTPreorderIterator: The stack that maintains the state of the iterator.
todo - Variable in class structure.BTInorderIterator: Stack of nodes that maintain the state of the iterator.
top - Variable in class structure.StackArray: An index to the top element of the stack.
toString() - Method in class structure.ChainedHashtable: Generate a string representation of the chained hash table.
toString() - Method in class structure.RedBlackTree: Returns string representation of red-black tree.
toString() - Method in class structure.GraphMatrixUndirected: Construct a string representation of graph.
toString() - Method in class structure.Matrix: Construct a string representation of the matrix.
toString() - Method in class structure.OrderedList: Generate string representation of the ordered list
toString() - Method in class structure.CircularList: Generate a string representation of list.
toString() - Method in class structure.QueueList: Construct a string representation of the queue.
toString() - Method in class structure.Entry: Standard string representation of an association.
toString() - Method in class structure.DoublyLinkedListElement: Construct a string representation of the element.
toString() - Method in class structure.Hashtable: Generate a string representation of the hash table.
toString() - Method in class structure.BinarySearchTree: Returns a string representing tree
toString() - Method in class structure.SplayTree: Construct a string that represents the splay tree.
toString() - Method in class structure.VectorHeap: Construct a string representation of the heap.
toString() - Method in class structure.GraphMatrixDirected: Construct a string representation of graph.
toString() - Method in class structure.Clock: Generates string representation of clock.
toString() - Method in class structure.QueueArray: Construct a string representation of the queue.
toString() - Method in class structure.GraphListUndirected: Construct a string representation of graph.
toString() - Method in class structure.SetList: Construct a string representation of the set.
toString() - Method in class structure.RedBlackSearchTree: Returns a string representing tree
toString() - Method in class structure.Vertex: Construct a string representing vertex.
toString() - Method in class structure.Association: Standard string representation of an association.
toString() - Method in class structure.StackVector: Construct a string representation of stack.
toString() - Method in class structure.SkewHeap: Construct a string representation of the heap.
toString() - Method in class structure.Table: Construct a string representing value of table.
toString() - Method in class structure.QueueVector: Construct a string representation of the queue.
toString() - Method in class structure.BinaryTree: Returns a representation the subtree rooted at this node
toString() - Method in class structure.StackList: Construct a string representation of the stack.
toString() - Method in class structure.BitSet: Constructs string representing set.
toString() - Method in class structure.GraphListDirected: Construct a string representation of graph.
toString() - Method in class structure.PriorityVector: Construct a string representation of the priority vector.
toString() - Method in class structure.DoublyLinkedList: Construct a string representation of list.
toString() - Method in class structure.Vector: Determine a string representation for the vector.
toString() - Method in class structure.GraphMatrixVertex
toString() - Method in class structure.Edge: Construct a string representation of edge.
toString() - Method in class structure.ComparableEdge: Construct a string representation of edge.
toString() - Method in class structure.CharSet: Compute String representation of charset.
toString() - Method in class structure.OrderedVector: Construct a string representation of an ordered vector
toString() - Method in class structure.GraphListVertex
toString() - Method in class structure.ComparableAssociation: Construct a string representation of the ComparableAssociation.
toString() - Method in class structure.StructCollection: Construct a string representation of this class.
toString() - Method in class structure.SinglyLinkedListElement: Construct a string representation of element.
toString() - Method in class structure.SinglyLinkedList: Construct a string representing list.
toString() - Method in class structure.StackArray: Construct a string representation of the stack.
toString() - Method in class structure.SetVector: Construct a string representation of the set.
tree - Variable in class structure.SplayTreeIterator: A reference to the root of a splay tree.
treeString() - Method in class structure.RedBlackTree: Returns a string representing the tree rooted at this node.
treeString() - Method in class structure.BinarySearchTree: Returns a (possibly long) string representing tree.
treeString() - Method in class structure.RedBlackSearchTree: Returns a (possibly long) string representing tree.
treeString() - Method in class structure.BinaryTree: Returns a string representing the tree rooted at this node.
trimToSize() - Method in class structure.Vector: Trim the vector to exactly the correct size.

U

union(BitSet) - Method in class structure.BitSet: Compute a new set that is the union of this set and other.
union(CharSet) - Method in class structure.CharSet: Constructs a charset that is the union of this and other.

V

val - Variable in class structure.BinaryTree: The value associated with this node
value - Variable in class structure.RedBlackTree: The value stored in this node
value() - Method in class structure.RedBlackTree: Returns value associated with this node
value() - Method in class structure.AbstractIterator: Deprecated. This method was deprecated in version 2 of the structure package. Use the get method.
value() - Method in class structure.DoublyLinkedListElement: Get value stored within the element.
value() - Method in class structure.BinaryTree: Returns value associated with this node
value() - Method in class structure.SinglyLinkedListElement: Fetch the value associated with this element.
ValueIterator - class structure.ValueIterator.: A private master iterator for filtering the value fields from an Association-returning iterator.This iterator returns objects of the Object type, and is publically available throught the Hashtable.iterator() method.
ValueIterator(Iterator) - Constructor for class structure.ValueIterator: Construct a new value iterator that filters the slave iterator, an Association-returning iterator.
values() - Method in class structure.ChainedHashtable
values() - Method in class structure.AbstractStructure: Returns a java.util.Collection wrapping this structure.
values() - Method in class structure.MapList
values() - Method in class structure.Hashtable
values() - Method in class structure.Table: Return a structure containing all the values referenced by this data structure.
values() - Method in interface structure.Map
values() - Method in interface structure.Structure: Returns a java.util.Collection wrapping this structure.
Vector - class structure.Vector.: An implementation of extensible arrays, similar to that of java.util.Vector.
Vector() - Constructor for class structure.Vector: Construct an empty vector.
Vector(Collection) - Constructor for class structure.Vector
Vector(int) - Constructor for class structure.Vector: Construct an empty vector capable of storing initialCapacity values before the vector must be extended.
Vector(int, int) - Constructor for class structure.Vector: Construct a vector with initial capacity, and growth characteristic.
Vector(int, int, Object) - Constructor for class structure.Vector: Construct a vector with initial size, growth rate and default value.
Vector(Vector) - Constructor for class structure.Vector
VectorHeap - class structure.VectorHeap.: This class implements a priority queue based on a traditional array-based heap.
VectorHeap() - Constructor for class structure.VectorHeap: Construct a new priority queue
VectorHeap(Vector) - Constructor for class structure.VectorHeap: Construct a new priority queue from an unordered vector
VectorIterator - class structure.VectorIterator.: A private class for implementing an iterator over a Vector.
VectorIterator(Vector) - Constructor for class structure.VectorIterator: Construct a vector iterator to traverse vector v
Version - class structure.Version.: A utility class that can be used to determine the version of software currently being used.
Version() - Constructor for class structure.Version
vertex - Variable in class structure.GraphListAIterator
Vertex - class structure.Vertex.: A private implementation of a vertex for use in graphs.
Vertex(Object) - Constructor for class structure.Vertex: Construct a vertex with an associated label.
visit() - Method in class structure.Vertex: Test and set the visited flag.
visit() - Method in class structure.Edge: Test and set visited flag on vertex.
visit(Object) - Method in class structure.GraphMatrix: Test and set visited flag of vertex.
visit(Object) - Method in class structure.GraphList: Test and set visited flag of vertex.
visit(Object) - Method in interface structure.Graph: Test and set visited flag of vertex
visited - Variable in class structure.Vertex: Whether or not a vertex has been visited.
visited - Variable in class structure.Edge: Whether or not this edge has been visited.
visitEdge(Edge) - Method in class structure.GraphMatrix: Test and set visited flag of edge.
visitEdge(Edge) - Method in class structure.GraphList: Test and set visited flag of edge.
visitEdge(Edge) - Method in interface structure.Graph: Test and set visited flag of edge.
vLabel - Variable in class structure.Edge: Two element array of vertex labels.

W

wellConnected(RedBlackTree) - Method in class structure.RedBlackTree: Returns true iff this tree is well-connected.
width - Variable in class structure.Matrix
width() - Method in class structure.Matrix: Return the width of the matrix.

A B C D E F G H I K L M N O P Q R S T U V W

Package

Class

Tree

Deprecated

Index

Help

PREV NEXT

FRAMES NO FRAMES