Package
Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
H
I
K
L
M
N
O
P
Q
R
S
T
U
V
W
Y
A
AbstractIterator
- Class in
structure
Abstract base class for portable iterator and enumeration implementation.
AbstractIterator()
- Constructor for class structure.
AbstractIterator
Default constructor (for base class invocation).
AbstractLinear
- Class in
structure
AbstractLinear()
- Constructor for class structure.
AbstractLinear
AbstractList
- Class in
structure
AbstractList()
- Constructor for class structure.
AbstractList
Default constructor for AbstractLists
AbstractListIterator
- Class in
structure
AbstractListIterator()
- Constructor for class structure.
AbstractListIterator
Default constructor (for base class invocation).
AbstractMap
- Class in
structure
AbstractMap()
- Constructor for class structure.
AbstractMap
AbstractQueue
- Class in
structure
An abstract structure describing a First-In, First-Out structure.
AbstractQueue()
- Constructor for class structure.
AbstractQueue
AbstractSet
- Class in
structure
Implementation of a set of elements.
AbstractSet()
- Constructor for class structure.
AbstractSet
AbstractStack
- Class in
structure
An abstract structure describing a Last-In, First-Out structure.
AbstractStack()
- Constructor for class structure.
AbstractStack
AbstractStructure
- Class in
structure
An abstract implementation of a basic, mutable data structure.
AbstractStructure()
- Constructor for class structure.
AbstractStructure
The default constructor.
add(Object)
- Method in class structure.
AbstractList
Add an object to tail of list.
add(Object)
- Method in class structure.
AbstractListIterator
add(Object)
- Method in class structure.
BinarySearchTree
Add a (possibly duplicate) value to binary search tree
add(int)
- Method in class structure.
BitSet
Adds a bit to the bitset, if not already there.
add(char)
- Method in class structure.
CharSet
Adds character c to set if not already there.
add(Object)
- Method in class structure.
CircularList
Add an element to head of circular list.
add(int, Object)
- Method in class structure.
CircularList
Insert value at location.
add(Object)
- Method in class structure.
DoublyLinkedList
Add a value to head of list.
add(int, Object)
- Method in class structure.
DoublyLinkedList
Insert value at location.
add(Object)
- Method in interface structure.
Graph
Add a vertex to the graph
add(Object)
- Method in class structure.
GraphList
Add a vertex to the graph.
add(Object)
- Method in class structure.
GraphMatrix
Add a vertex to the graph.
add(Object)
- Method in interface structure.
Linear
Add a value to the structure.
add(Object)
- Method in interface structure.
List
Add an object to tail of list.
add(int, Object)
- Method in interface structure.
List
Insert value at location.
add(Object)
- Method in class structure.
OrderedList
Add a value to the ordered list, keeping values in order
add(Object)
- Method in class structure.
OrderedVector
Add a comparable value to an ordered vector
add(Comparable)
- Method in interface structure.
PriorityQueue
Add a value to the priority queue.
add(Comparable)
- Method in class structure.
PriorityVector
Add a comparable value to the priority queue.
add(Object)
- Method in interface structure.
Queue
Add a value to the tail of the queue.
add(Object)
- Method in class structure.
QueueArray
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.
QueueVector
Add a value to the tail of the queue
add(Comparable)
- Method in class structure.
RedBlackTree
add(Object)
- Method in class structure.
SetList
Add an element to set, if not already present.
add(Object)
- Method in class structure.
SetVector
Add an element to set, if not already present.
add(Object)
- Method in class structure.
SinglyLinkedList
Add an object to tail of list.
add(int, Object)
- Method in class structure.
SinglyLinkedList
Insert value at location.
add(Comparable)
- Method in class structure.
SkewHeap
Add a value to the priority queue.
add(Object)
- Method in class structure.
SplayTree
Add a value to the splay tree.
add(Object)
- Method in interface structure.
Stack
Add an element from the top of the stack.
add(Object)
- Method in class structure.
StackArray
Add a value to the top of the stack.
add(Object)
- Method in class structure.
StackList
Add a value to the top of the stack.
add(Object)
- Method in class structure.
StackVector
Add an element from the top of the stack.
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.
Structure
Inserts value in some structure-specific location.
add(Object)
- Method in class structure.
Vector
Add an element to the high end of the array, possibly expanding vector.
add(int, Object)
- Method in class structure.
Vector
Insert an element at a particular location.
add(Comparable)
- Method in class structure.
VectorHeap
Add a value to the priority queue.
addAll(Structure)
- Method in class structure.
AbstractSet
Union other set into this set.
addAll(Structure)
- Method in interface structure.
Set
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.
addAll(Collection)
- Method in class structure.
StructCollection
Adds all the elements of another collection (c) into this Structure.
addCol(int)
- Method in class structure.
Matrix
Add a new column, whose index will be c.
addEdge(Object, Object, Object)
- Method in interface structure.
Graph
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.
GraphListDirected
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.
GraphMatrix
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.
GraphMatrixUndirected
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.
ArrayIterator
- Class in
structure
ArrayIterator(Object[])
- Constructor for class structure.
ArrayIterator
ArrayIterator(Object[], int, int)
- Constructor for class structure.
ArrayIterator
Assert
- Class in
structure
A library of assertion testing and debugging procedures.
Association
- Class in
structure
A class implementing a key-value pair.
Association(Object, Object)
- Constructor for class structure.
Association
Constructs a pair from a key and value.
Association(Object)
- Constructor for class structure.
Association
Constructs a pair from a key; value is null.
author
- Static variable in class structure.
Version
available()
- Method in class structure.
FileStream
B
BinarySearchTree
- Class in
structure
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 in
structure
This class implements a single node of a binary tree.
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 in
structure
A simple class implementing 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.
C
capacity()
- Method in class structure.
Vector
Determine the capacity of the vector.
ChainedHashtable
- Class in
structure
This class implements a hash table whose collisions are resolved through external chaining.
ChainedHashtable(int)
- Constructor for class structure.
ChainedHashtable
Constructs a hashtable with capacity for at size elements before chaining is absolutely required.
ChainedHashtable()
- Constructor for class structure.
ChainedHashtable
Constructs a reasonably large hashtable.
CharSet
- Class in
structure
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 in
structure
A class implementing a singly linked circular list.
CircularList()
- Constructor for class structure.
CircularList
Construct an empty circular list.
clear()
- Method in class structure.
BinarySearchTree
Removes all data from the binary search tree
clear()
- Method in class structure.
BitSet
Remove all bits from the set.
clear(int)
- Method in class structure.
BitSet
Remove bits from set; set size to count.
clear()
- Method in class structure.
ChainedHashtable
Removes the values from the hashtable.
clear()
- Method in class structure.
CharSet
Removes the characters of the set.
clear()
- Method in class structure.
CircularList
Remove elements of list.
clear()
- Method in class structure.
DoublyLinkedList
Remove all values from list.
clear()
- Method in interface structure.
Graph
Remove all vertices (and thus, edges) of the graph.
clear()
- Method in class structure.
GraphList
Remove all vertices (and thus, edges) of the graph.
clear()
- Method in class structure.
GraphMatrix
Remove all vertices (and thus, edges) of the graph.
clear()
- Method in class structure.
Hashtable
Remove all key-value pairs from hashtable.
clear()
- Method in interface structure.
List
Remove all elements of list.
clear()
- Method in interface structure.
Map
clear()
- Method in class structure.
MapBST
clear()
- Method in class structure.
MapList
clear()
- Method in class structure.
OrderedList
Remove all the elements from the ordered list
clear()
- Method in class structure.
OrderedVector
Removes all the values from a an ordered vector
clear()
- Method in interface structure.
PriorityQueue
Remove all the elements from the queue.
clear()
- Method in class structure.
PriorityVector
Remove all the values from the priority queue.
clear()
- Method in class structure.
QueueArray
Remove all the values from the queue.
clear()
- Method in class structure.
QueueList
Remove all the values from the queue.
clear()
- Method in class structure.
QueueVector
Remove all the values from the queue.
clear()
- Method in class structure.
SetList
Remove all the elements from the set.
clear()
- Method in class structure.
SetVector
Remove all the elements from the set.
clear()
- Method in class structure.
SinglyLinkedList
Remove all values from list.
clear()
- Method in class structure.
SkewHeap
Remove all the elements from the queue.
clear()
- Method in class structure.
StackArray
Remove all elements from the stack.
clear()
- Method in class structure.
StackList
Remove all elements from the stack.
clear()
- Method in class structure.
StackVector
Remove all elements from stack.
clear()
- Method in class structure.
StructCollection
Remove all elements from the Structure.
clear()
- Method in interface structure.
Structure
Removes all elements from the structure.
clear()
- Method in class structure.
Table
Remove all the elements of the table.
clear()
- Method in class structure.
Vector
Remove all the values of the vector.
clear()
- Method in class structure.
VectorHeap
Remove all the elements from the queue.
Clock
- Class in
structure
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.
BitSet
Returns a copy of the set.
clone()
- Method in class structure.
CharSet
Construct a duplicate of the character set.
clone()
- Method in class structure.
SetList
Returns a shallow clone of this set.
clone()
- Method in class structure.
SetVector
Returns a shallow clone of this set.
clone()
- Method in class structure.
Vector
Construct a shallow copy of the vector.
close()
- Method in class structure.
FileStream
ComparableAssociation
- Class in
structure
An association that can be compared.
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 in
structure
A class implementing common edge type among graphs.
ComparableEdge(Object, Object, Object, boolean)
- Constructor for class structure.
ComparableEdge
Construct a (possibly directed) edge between two labeled vertices.
ComparableEdge(Edge)
- Constructor for class structure.
ComparableEdge
Construct a (possibly directed) edge between two labeled vertices.
compare(Object, Object)
- Method in class structure.
NaturalComparator
Compare two values, a and b.
compare(Object, Object)
- Method in class structure.
ReverseComparator
Compare two values, a and b.
compareTo(Object)
- Method in class structure.
ComparableAssociation
Determine the order of two comparable associations, based on key.
compareTo(Object)
- Method in class structure.
ComparableEdge
Compare edge, based on labels.
condition(boolean, String)
- Static method in class structure.
Assert
Test a general condition.
consistency()
- Method in class structure.
RedBlackTree
contains(Object)
- Method in class structure.
AbstractList
Check to see if a value is in list.
contains(Object)
- Method in class structure.
AbstractStructure
Determines if the structure contains a value.
contains(Object)
- Method in class structure.
BinarySearchTree
Determines if the binary search tree contains a value
contains(int)
- Method in class structure.
BitSet
Determine if a bit is a member of the set.
contains(char)
- Method in class structure.
CharSet
Detects whether c is a member of this set.
contains(Object)
- Method in class structure.
CircularList
Check if a list contains an element.
contains(Object)
- Method in class structure.
DoublyLinkedList
Check to see if a value is within list.
contains(Object)
- Method in interface structure.
Graph
Test for vertex membership.
contains(Object)
- Method in class structure.
GraphList
Test for vertex membership.
contains(Object)
- Method in class structure.
GraphMatrix
Test for vertex membership.
contains(Object)
- Method in interface structure.
List
Check to see if a value is in list.
contains(Object)
- Method in class structure.
OrderedList
Determine if the ordered list contains a value
contains(Object)
- Method in class structure.
OrderedVector
Determine if a comparable value is a member of the ordered vector
contains(Comparable)
- Method in class structure.
RedBlackTree
contains(Object)
- Method in class structure.
SetList
Returns true if value is an element of the set.
contains(Object)
- Method in class structure.
SetVector
Returns true if value is an element of the set.
contains(Object)
- Method in class structure.
SinglyLinkedList
Check to see if a value is in list.
contains(Object)
- Method in class structure.
SplayTree
Determine if a particular value is within the search tree.
contains(Object)
- Method in class structure.
StructCollection
Returns true iff object o is contained within the subordinate structure.
contains(Object)
- Method in interface structure.
Structure
Determines if the structure contains a value.
contains(Object)
- Method in class structure.
Vector
Determine if a value appears in a vector.
containsAll(Structure)
- Method in class structure.
AbstractSet
Check to see if this set is contained in the other 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.
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.
containsAll(Collection)
- Method in class structure.
StructCollection
Returns true if all of the elements of c are contained within the subordinate structure.
containsEdge(Object, Object)
- Method in interface structure.
Graph
Test for edge membership.
containsEdge(Object, Object)
- Method in class structure.
GraphList
Test for edge membership.
containsEdge(Object, Object)
- Method in class structure.
GraphMatrix
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.
Hashtable
Returns true iff a specific key appears within the table.
containsKey(Object)
- Method in interface structure.
Map
containsKey(Object)
- Method in class structure.
MapBST
containsKey(Object)
- Method in class structure.
MapList
containsKey(Object)
- Method in class structure.
Table
Determine if the key is in the table.
containsValue(Object)
- Method in class structure.
ChainedHashtable
Returns true if a specific value appears within the table.
containsValue(Object)
- Method in class structure.
Hashtable
Returns true if a specific value appears within the table.
containsValue(Object)
- Method in interface structure.
Map
containsValue(Object)
- Method in class structure.
MapBST
containsValue(Object)
- Method in class structure.
MapList
containsValue(Object)
- Method in class structure.
Table
Returns true if the value is associated with some key in the table.
copyInto(Object[])
- Method in class structure.
Vector
Copy the contents of the vector into an array.
D
debug(String)
- Static method in class structure.
Assert
Set up a level 1 debugging message.
debug(int, String)
- Static method in class structure.
Assert
Set up a debugging message at a specific level.
debugging()
- Static method in class structure.
Assert
Increase the verbosity of the debugging messages.
debugLevel(int)
- Static method in class structure.
Assert
Explictly set the debugging level (0 = none)
degree(Object)
- Method in interface structure.
Graph
Determine out degree of vertex.
degree(Object)
- Method in class structure.
GraphList
Determine out degree of vertex.
degree(Object)
- Method in class structure.
GraphMatrix
Determine out degree of vertex.
depth()
- Method in class structure.
BinaryTree
Compute the depth of a node.
dequeue()
- Method in class structure.
AbstractQueue
Remove a value form the head of the queue.
dequeue()
- Method in interface structure.
Queue
Remove a value from the head of the queue.
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.
DoublyLinkedList
- Class in
structure
An implementation of lists that makes use of doubly linked elements.
DoublyLinkedList()
- Constructor for class structure.
DoublyLinkedList
Constructs an empty list.
DoublyLinkedListElement
- Class in
structure
A private class implementing the element of a doubly linked list.
DoublyLinkedListElement(Object, DoublyLinkedListElement, DoublyLinkedListElement)
- Constructor for class structure.
DoublyLinkedListElement
Construct a doubly linked list element.
DoublyLinkedListElement(Object)
- Constructor for class structure.
DoublyLinkedListElement
Construct a doubly linked list element containing a value.
DoublyLinkedListIterator
- Class in
structure
A private iterator for traversing 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 in
structure
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 interface structure.
Graph
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.
GraphListDirected
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.
GraphMatrix
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.
GraphMatrixUndirected
Determine the number of edges in graph.
edges()
- Method in interface structure.
Graph
Construct an iterator over all edges.
edges()
- Method in class structure.
GraphList
Construct an iterator over all edges.
edges()
- Method in class structure.
GraphMatrix
Construct an traversal over all edges.
edges()
- Method in class structure.
GraphMatrixDirected
Construct an traversal over all edges.
edges()
- Method in class structure.
GraphMatrixUndirected
Construct an traversal over all edges.
elementAt(int)
- Method in class structure.
Vector
Fetch the element at a particular index.
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()
- Method in class structure.
AbstractLinear
Determine if there are elements within the linear.
EMPTY
- Static variable in class structure.
BinaryTree
The unique empty node
empty()
- Method in interface structure.
Linear
Returns true iff the structure is empty.
empty()
- Method in interface structure.
Queue
Returns true iff the queue is empty.
EMPTY
- Static variable in class structure.
RedBlackTree
empty()
- Method in interface structure.
Stack
Returns true iff the stack is empty.
empty()
- Method in class structure.
StackList
Determine if the stack is empty.
enqueue(Object)
- Method in class structure.
AbstractQueue
Add a value to the tail of the queue.
enqueue(Object)
- Method in interface structure.
Queue
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 in
structure
Entry(Object, Object)
- Constructor for class structure.
Entry
Constructs a pair from a key and value.
Entry(Object)
- Constructor for class structure.
Entry
Constructs a pair from a key; value is null.
entrySet()
- Method in class structure.
ChainedHashtable
entrySet()
- Method in class structure.
Hashtable
entrySet()
- Method in interface structure.
Map
entrySet()
- Method in class structure.
MapBST
entrySet()
- Method in class structure.
MapList
entrySet()
- Method in class structure.
Table
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.
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.
CharSet
Detect if two sets are equal.
equals(Object)
- Method in class structure.
DoublyLinkedListElement
Determine if this element equal to another.
equals(Object)
- Method in class structure.
Edge
Test for equality of edges.
equals(Object)
- Method in class structure.
Entry
Standard comparison function.
equals(Object)
- Method in interface structure.
Map
equals(Object)
- Method in class structure.
MapBST
equals(Object)
- Method in class structure.
MapList
equals(Object)
- Method in class structure.
NaturalComparator
Returns true if the other object is a NaturalComparator.
equals(Object)
- Method in class structure.
ReverseComparator
Returns true if the other object is a NaturalComparator.
equals(Object)
- Method in class structure.
StructCollection
Compare one StructCollection with another.
F
fail(String)
- Static method in class structure.
Assert
Indicate certain failure.
FileStream
- Class in
structure
This class provides a way to connect text files to scanners, without worrying about Exceptions.
FileStream(String)
- Constructor for class structure.
FileStream
Create a reader for the file with the given name.
firstElement()
- Method in class structure.
Vector
Get access to the first element of the vector.
G
get()
- Method in class structure.
AbstractIterator
Returns the value currently being considered by the AbstractIterator.
get()
- Method in class structure.
AbstractList
Retrieves value from tail of list.
get()
- Method in class structure.
AbstractListIterator
get()
- Method in class structure.
ArrayIterator
get(Object)
- Method in class structure.
BinarySearchTree
Returns reference to value found within three.
get(Object)
- Method in class structure.
ChainedHashtable
Get the value associated with a key.
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()
- Method in class structure.
DoublyLinkedListIterator
Get reference to value that is current.
get(Object)
- Method in interface structure.
Graph
Get reference to actual label of vertex.
get(Object)
- Method in class structure.
GraphList
Get reference to actual label of vertex.
get(Object)
- Method in class structure.
GraphMatrix
Get reference to actual label of vertex.
get(Object)
- Method in class structure.
Hashtable
Get the value associated with a key.
get()
- Method in interface structure.
Linear
Preview the object to be removed.
get()
- Method in interface structure.
List
Retrieves value from tail of list.
get(int)
- Method in interface structure.
List
Get value at location i.
get(Object)
- Method in interface structure.
Map
get(Object)
- Method in class structure.
MapBST
get(Object)
- Method in class structure.
MapList
get(int, int)
- Method in class structure.
Matrix
Fetch an element from the matrix.
get()
- Method in interface structure.
Queue
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.
QueueList
Fetch the value at the head of the queue.
get()
- Method in class structure.
QueueVector
Fetch the value at the head of the queue.
get(Comparable)
- Method in class structure.
RedBlackTree
get(int)
- Method in class structure.
SinglyLinkedList
Get value at location i.
get(Object)
- Method in class structure.
SplayTree
Fetch a reference to the comparable value in the tree.
get()
- Method in interface structure.
Stack
Fetch a reference to the top element of the stack.
get()
- Method in class structure.
StackArray
Get a reference to the top value in the stack.
get()
- Method in class structure.
StackList
Get a reference to the top value in the stack.
get()
- Method in class structure.
StackVector
Fetch a reference to the top element of the stack.
get(Object)
- Method in class structure.
Table
Retrieve the value associated with the key provided.
get(int)
- Method in class structure.
Vector
Fetch the element at a particular index.
getEdge(Object, Object)
- Method in interface structure.
Graph
Get reference to actual edge.
getEdge(Object, Object)
- Method in class structure.
GraphList
Get reference to actual edge.
getEdge(Object, Object)
- Method in class structure.
GraphMatrix
Get reference to actual edge.
getFirst()
- Method in class structure.
AbstractList
Fetch first element of list.
getFirst()
- Method in class structure.
AbstractQueue
Fetch the value at the head of the queue.
getFirst()
- Method in class structure.
AbstractStack
Deprecated.
Please use method get, rather than getFirst!
getFirst()
- Method in class structure.
CircularList
Determine if a list is empty.
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 interface structure.
PriorityQueue
Fetch lowest valued (highest priority) item from queue.
getFirst()
- Method in class structure.
PriorityVector
Fetch the smallest value of the priority queue.
getFirst()
- Method in interface structure.
Queue
Fetch the value at the head of the queue.
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 class structure.
SkewHeap
Fetch lowest valued (highest priority) item from queue.
getFirst()
- Method in interface structure.
Stack
Fetch a reference to the top element of the stack.
getFirst()
- Method in class structure.
VectorHeap
Fetch lowest valued (highest priority) item from queue.
getKey()
- Method in class structure.
Association
Fetch key from association.
getKey()
- Method in class structure.
Entry
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.
getValue()
- Method in class structure.
Association
Fetch value from association.
getValue()
- Method in class structure.
Entry
Fetch value from association.
Graph
- Interface in
structure
The interface describing all Graph objects.
GraphList
- Class in
structure
Implementation of graph using adjacency lists.
GraphListDirected
- Class in
structure
A class implementing a directed, adjacency-list based graph.
GraphListDirected()
- Constructor for class structure.
GraphListDirected
Construct a directed, adjacency-list based graph.
GraphListUndirected
- Class in
structure
A class implementing an undirected, adjacency-list based graph.
GraphListUndirected()
- Constructor for class structure.
GraphListUndirected
Construct an undirected, adjacency-list based graph.
GraphMatrix
- Class in
structure
Implementation of graph using adjacency matrices.
GraphMatrixDirected
- Class in
structure
A class implementing a directed, adjacency-matrix based graph.
GraphMatrixDirected(int)
- Constructor for class structure.
GraphMatrixDirected
Construct a directed, adjacency-matrix based graph.
GraphMatrixUndirected
- Class in
structure
A class implementing an undirected, adjacency-matrix based graph.
GraphMatrixUndirected(int)
- Constructor for class structure.
GraphMatrixUndirected
Construct an undirected, adjacency-matrix based graph.
H
hashCode()
- Method in class structure.
AbstractMap
Compute the hashCode for elements of this map
hashCode()
- Method in class structure.
AbstractStructure
hashCode()
- Method in class structure.
Association
Standard hashcode function.
hashCode()
- Method in class structure.
BinaryTree
hashCode()
- Method in class structure.
DoublyLinkedListElement
Generate hash code associated with the element.
hashCode()
- Method in class structure.
Edge
Returns hashcode associated with edge.
hashCode()
- Method in class structure.
Entry
Standard hashcode function.
hashCode()
- Method in interface structure.
Map
hashCode()
- Method in class structure.
MapBST
hashCode()
- Method in class structure.
MapList
hashCode()
- Method in class structure.
RedBlackTree
hashCode()
- Method in class structure.
StructCollection
Return hash code.
Hashtable
- Class in
structure
Implements a dictionary as a table of hashed key-value pairs.
Hashtable(int)
- Constructor for class structure.
Hashtable
Construct a hash table that is capable of holding at least initialCapacity values.
Hashtable()
- Constructor for class structure.
Hashtable
Construct a hash table that is initially empty.
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
hasNext()
- Method in class structure.
DoublyLinkedListIterator
Determine if there are more elements to be considered.
height()
- Method in class structure.
BinaryTree
Returns height of node in tree.
height()
- Method in class structure.
Matrix
Return the height of the matrix.
here()
- Method in class structure.
Edge
Returns the first vertex (or source if directed).
I
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 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)
- 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, 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
inorderIterator()
- Method in class structure.
BinaryTree
Return an iterator to traverse the elements of subtree in-order
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.
isComplete()
- Method in class structure.
BinaryTree
Return whether tree is complete.
isDirected()
- Method in class structure.
Edge
Check to see if edge is directed.
isDirected()
- Method in interface structure.
Graph
Determine if graph is directed.
isDirected()
- Method in class structure.
GraphList
Determine if graph is directed.
isDirected()
- Method in class structure.
GraphMatrix
Determine if graph is directed.
isEmpty()
- Method in class structure.
AbstractList
Determine if list is empty.
isEmpty()
- Method in class structure.
AbstractStructure
Determine if there are elements within the structure.
isEmpty()
- Method in class structure.
BinarySearchTree
Checks for an empty binary search tree
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.
ChainedHashtable
Returns true if no elements are stored within the table.
isEmpty()
- Method in class structure.
CharSet
Detect an empty charset.
isEmpty()
- Method in class structure.
CircularList
Determine if a list is empty.
isEmpty()
- Method in class structure.
DoublyLinkedList
Determine if list is empty.
isEmpty()
- Method in interface structure.
Graph
Determine if graph is empty.
isEmpty()
- Method in class structure.
GraphList
Determine if graph is empty.
isEmpty()
- Method in class structure.
GraphMatrix
Determine if graph is empty.
isEmpty()
- Method in class structure.
Hashtable
Determine if table is empty.
isEmpty()
- Method in interface structure.
List
Determine if list is empty.
isEmpty()
- Method in interface structure.
Map
isEmpty()
- Method in class structure.
MapBST
isEmpty()
- Method in class structure.
MapList
isEmpty()
- Method in class structure.
OrderedList
Determine if the list is empty
isEmpty()
- Method in class structure.
OrderedVector
Determine if the ordered vector is empty.
isEmpty()
- Method in interface structure.
PriorityQueue
Determine if the queue is empty.
isEmpty()
- Method in class structure.
PriorityVector
Determine if the priority queue is empty.
isEmpty()
- Method in class structure.
QueueArray
Determine if the queue is empty.
isEmpty()
- Method in class structure.
QueueList
Determine if the queue is empty.
isEmpty()
- Method in class structure.
QueueVector
Determine if the queue is empty.
isEmpty()
- Method in class structure.
RedBlackTree
isEmpty()
- Method in class structure.
SetList
Determine if the set is empty.
isEmpty()
- Method in class structure.
SetVector
Determine if the set is empty.
isEmpty()
- Method in class structure.
SkewHeap
Determine if the queue is empty.
isEmpty()
- Method in class structure.
StackArray
Determine if the stack is empty.
isEmpty()
- Method in class structure.
StackVector
Returns true iff the stack is empty.
isEmpty()
- Method in class structure.
StructCollection
Detect an empty structure.
isEmpty()
- Method in interface structure.
Structure
Determine if there are elements within the structure.
isEmpty()
- Method in class structure.
Table
Determine if the table is empty.
isEmpty()
- Method in class structure.
Vector
Determine if the Vector contains no values.
isEmpty()
- Method in class structure.
VectorHeap
Determine if the queue is empty.
isFull()
- Method in class structure.
BinaryTree
Returns true if tree is full.
isFull()
- Method in class structure.
QueueArray
Determines if the queue is not able to accept any new values.
isFull()
- Method in class structure.
StackArray
Determine if the stack is full.
isLeftChild()
- Method in class structure.
BinaryTree
Determine if this node is a left child
isRightChild()
- Method in class structure.
BinaryTree
Determine if this node is a right child
isVisited()
- Method in class structure.
Edge
Check to see if edge has been visited.
isVisited(Object)
- Method in interface structure.
Graph
Return visited flag of vertex.
isVisited(Object)
- Method in class structure.
GraphList
Return visited flag of vertex.
isVisited(Object)
- Method in class structure.
GraphMatrix
Return visited flag of vertex.
isVisitedEdge(Edge)
- Method in interface structure.
Graph
Return visited flag of edge.
isVisitedEdge(Edge)
- Method in class structure.
GraphList
Return visited flag of edge.
isVisitedEdge(Edge)
- Method in class structure.
GraphMatrix
Return visited flag of edge.
iterator()
- Method in class structure.
BinarySearchTree
Returns an iterator over the binary search tree.
iterator()
- Method in class structure.
BinaryTree
Generate an in-order iterator of subtree
iterator()
- Method in class structure.
ChainedHashtable
Returns an iterator that traverses over the values of the hashtable.
iterator()
- Method in class structure.
CircularList
Construct an iterator over elements of list.
iterator()
- Method in class structure.
DoublyLinkedList
Construct an iterator to traverse list.
iterator()
- Method in interface structure.
Graph
Construct vertex iterator.
iterator()
- Method in class structure.
GraphList
Construct vertex iterator.
iterator()
- Method in class structure.
GraphMatrix
Construct vertex traversal.
iterator()
- Method in class structure.
Hashtable
Returns a traversal that traverses over the values of the hashtable.
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.
OrderedList
Construct an iterator for traversing elements of ordered list in ascending order
iterator()
- Method in class structure.
OrderedVector
Construct an iterator to traverse the ordered vector in ascending order
iterator()
- Method in class structure.
QueueArray
iterator()
- Method in class structure.
QueueList
iterator()
- Method in class structure.
QueueVector
iterator()
- Method in class structure.
SetList
Construct an traversal to traverse the elements of the set.
iterator()
- Method in class structure.
SetVector
Construct an traversal to traverse the elements of the set.
iterator()
- Method in class structure.
SinglyLinkedList
Returns an iterator traversing list from head to tail.
iterator()
- Method in class structure.
SplayTree
Construct an inorder traversal of the elements in the splay tree.
iterator()
- Method in class structure.
StackArray
iterator()
- Method in class structure.
StackList
iterator()
- Method in class structure.
StackVector
iterator()
- Method in class structure.
StructCollection
Return an iterator to traverse the subordinate structure.
iterator()
- Method in interface structure.
Structure
Returns an iterator for traversing the structure.
iterator()
- Method in class structure.
Table
Construct an iterator over the values of the table.
iterator()
- Method in class structure.
Vector
Construct a iterator over the elements of the vector.
K
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.
Hashtable
keySet()
- Method in interface structure.
Map
keySet()
- Method in class structure.
MapBST
keySet()
- Method in class structure.
MapList
keySet()
- Method in class structure.
Table
L
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 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)
- Method in class structure.
Vector
Search for the last occurrence of a value within the vector.
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()
- Method in class structure.
BinaryTree
Get left subtree of current node
levelorderIterator()
- Method in class structure.
BinaryTree
Method to return a level-order iterator of subtree
Linear
- Interface in
structure
Linear classes are contains that have completely determined add and remove methods.
List
- Interface in
structure
Interface describing lists.
M
main(String[])
- Static method in class structure.
FileStream
main(String[])
- Static method in class structure.
Version
major
- Static variable in class structure.
Version
Map
- Interface in
structure
MapBST
- Class in
structure
MapBST(Comparator)
- Constructor for class structure.
MapBST
MapBST()
- Constructor for class structure.
MapBST
MapList
- Class in
structure
MapList()
- Constructor for class structure.
MapList
MapList(Map)
- Constructor for class structure.
MapList
mark(int)
- Method in class structure.
FileStream
markSupported()
- Method in class structure.
FileStream
Matrix
- Class in
structure
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.
minor
- Static variable in class structure.
Version
N
name
- Static variable in class structure.
Version
NaturalComparator
- Class in
structure
NaturalComparator()
- Constructor for class structure.
NaturalComparator
neighbors(Object)
- Method in interface structure.
Graph
Construct an adjacent vertex iterator.
neighbors(Object)
- Method in class structure.
GraphList
Construct an adjacent vertex iterator.
neighbors(Object)
- Method in class structure.
GraphMatrix
Construct an adjacent vertex traversal.
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
next()
- Method in class structure.
DoublyLinkedListElement
Access the reference to the next value.
next()
- Method in class structure.
DoublyLinkedListIterator
Returns reference to the current element, then increments iterator.
next()
- Method in class structure.
SinglyLinkedListElement
nextElement()
- Method in class structure.
AbstractIterator
An Enumeration method that is equivalent to
AbstractIterator.next()
.
O
OrderedList
- Class in
structure
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 in
structure
OrderedStructure
- Interface in
structure
An interface the supports a Collection whose values are kept in increasing order.
OrderedVector
- Class in
structure
Implementation of an ordered structure implemented using a vector
OrderedVector()
- Constructor for class structure.
OrderedVector
Construct an empty ordered vector
P
parent()
- Method in class structure.
BinaryTree
Get reference to parent of this node
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.
Queue
Fetch the value at the head of the queue.
peek()
- Method in interface structure.
Stack
Fetch a reference to the top element of the stack.
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.
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.
print()
- Method in class structure.
RedBlackTree
PriorityQueue
- Interface in
structure
Interface describing an queue of prioritized values.
PriorityVector
- Class in
structure
A vector-based implementation of a priority queue.
PriorityVector()
- Constructor for class structure.
PriorityVector
Construct an empty priority queue.
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.
put(Object, Object)
- Method in class structure.
ChainedHashtable
Place a key-value pair within the table.
put(Object, Object)
- Method in class structure.
Hashtable
Place a key-value pair within the table.
put(Object, Object)
- Method in interface structure.
Map
put(Object, Object)
- Method in class structure.
MapBST
put(Object, Object)
- Method in class structure.
MapList
put(Object, Object)
- Method in class structure.
Table
Enter a key-value pair into the table.
putAll(Map)
- Method in class structure.
AbstractMap
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
putAll(Map)
- Method in class structure.
MapBST
putAll(Map)
- Method in class structure.
MapList
Q
Queue
- Interface in
structure
A first-in, first-out structure.
QueueArray
- Class in
structure
An implementation of a queue based on arrays.
QueueArray(int)
- Constructor for class structure.
QueueArray
Construct a queue holding at most size elements.
QueueList
- Class in
structure
An implementation of queues based on lists.
QueueList()
- Constructor for class structure.
QueueList
Construct a new queue with no data.
QueueVector
- Class in
structure
An implementation of queues written using 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.
read()
- Method in class structure.
FileStream
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 in
structure
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.
RedBlackTree
- Class in
structure
RedBlackTree(Comparable)
- Constructor for class structure.
RedBlackTree
redFixup()
- Method in class structure.
RedBlackTree
remove()
- Method in class structure.
AbstractIterator
If implemented, removes the currently visited value from the structure.
remove(Object)
- Method in class structure.
AbstractLinear
Removes value from the linear structure.
remove()
- Method in class structure.
AbstractList
Removes value from tail of list.
remove()
- Method in class structure.
AbstractListIterator
remove(Object)
- Method in class structure.
BinarySearchTree
Remove an value "equals to" the indicated value.
remove(int)
- Method in class structure.
BitSet
Remove bit i from the bitset.
remove(Object)
- Method in class structure.
ChainedHashtable
Remove a key-value pair from the table.
remove(char)
- Method in class structure.
CharSet
Removes a character from set.
remove(Object)
- Method in class structure.
CircularList
Remove a value from a list.
remove(int)
- Method in class structure.
CircularList
Remove and return value at location i.
remove(Object)
- Method in class structure.
DoublyLinkedList
Remove a value from list.
remove(int)
- Method in class structure.
DoublyLinkedList
Remove and return value at location i.
remove(Object)
- Method in interface structure.
Graph
Remove a vertex from the graph.
remove(Object)
- Method in class structure.
GraphList
Remove a vertex from the graph.
remove(Object)
- Method in class structure.
GraphListDirected
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.
GraphMatrix
Remove a vertex from the graph.
remove(Object)
- Method in class structure.
Hashtable
Remove a key-value pair from the table.
remove()
- Method in interface structure.
Linear
Remove a value from the structure.
remove(Object)
- Method in interface structure.
List
Remove a value from list.
remove()
- Method in interface structure.
List
Removes value from tail of list.
remove(int)
- Method in interface structure.
List
Remove and return value at location i.
remove(Object)
- Method in interface structure.
Map
remove(Object)
- Method in class structure.
MapBST
remove(Object)
- Method in class structure.
MapList
remove(Object)
- Method in class structure.
OrderedList
Remove a value from the ordered list.
remove(Object)
- Method in class structure.
OrderedVector
Remove a comparable value from an ordered vector At most one value is removed
remove()
- Method in interface structure.
PriorityQueue
Returns the minimum value from the queue.
remove()
- Method in class structure.
PriorityVector
Remove the smallest value of the structure.
remove()
- Method in interface structure.
Queue
Remove a value form the head of the queue.
remove()
- Method in class structure.
QueueArray
Remove a value from the head of the queue.
remove()
- Method in class structure.
QueueList
Remove a value from the head of the queue.
remove()
- Method in class structure.
QueueVector
Remove a value from the head of the queue
remove(Comparable)
- Method in class structure.
RedBlackTree
remove(Object)
- Method in class structure.
SetList
Remove an element from the set.
remove(Object)
- Method in class structure.
SetVector
Remove an element from the set.
remove(Object)
- Method in class structure.
SinglyLinkedList
Remove a value from list.
remove(int)
- Method in class structure.
SinglyLinkedList
Remove and return value at location i.
remove()
- Method in class structure.
SkewHeap
Returns the minimum value from the queue.
remove(Object)
- Method in class structure.
SplayTree
Remove a comparable value from the tree.
remove()
- Method in interface structure.
Stack
Remove an element from the top of the stack.
remove()
- Method in class structure.
StackArray
Remove a value from the top of the stack.
remove()
- Method in class structure.
StackList
Remove a value from the top of the stack.
remove()
- Method in class structure.
StackVector
Remove an element from the top of the stack.
remove(Object)
- Method in class structure.
StructCollection
Removes an instance of object o, if it appears within structure.
remove(Object)
- Method in interface structure.
Structure
Removes value from the structure.
remove(Object)
- Method in class structure.
Table
Remove a key-value pair, based on key.
remove(Object)
- Method in class structure.
Vector
Remove an element, by value, from vector.
remove(int)
- Method in class structure.
Vector
Remove an element at a particular location.
remove()
- Method in class structure.
VectorHeap
Returns the minimum value from the queue.
removeAll(Structure)
- Method in class structure.
AbstractSet
Computes the difference between this set and the other structure
removeAll(Structure)
- Method in interface structure.
Set
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.
removeAll(Collection)
- Method in class structure.
StructCollection
Removes all objects found within collection c from this collection.
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(Object, Object)
- Method in interface structure.
Graph
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.
GraphListDirected
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.
GraphMatrix
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.
GraphMatrixUndirected
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.
reset()
- Method in class structure.
AbstractIterator
Reset iterator to the beginning of the structure.
reset()
- Method in class structure.
ArrayIterator
reset()
- Method in class structure.
Clock
Resets the time on the clock to zero.
reset()
- Method in class structure.
DoublyLinkedListIterator
Reset the iterator to the head of the list.
reset()
- Method in class structure.
Edge
Clear the visited flag associated with edge.
reset()
- Method in class structure.
FileStream
reset()
- Method in interface structure.
Graph
Clear visited flags of edges and vertices.
reset()
- Method in class structure.
GraphList
Clear visited flags of edges and vertices.
reset()
- Method in class structure.
GraphMatrix
Clear visited flags of edges and vertices.
retainAll(Structure)
- Method in class structure.
AbstractSet
Computes the intersection between this set and the other structure.
retainAll(Structure)
- Method in interface structure.
Set
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.
retainAll(Collection)
- Method in class structure.
StructCollection
Retains elements of this Collection that are also in c.
ReverseComparator
- Class in
structure
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()
- Method in class structure.
BinaryTree
Get right subtree of current node
root()
- Method in class structure.
BinaryTree
Returns reference to root of tree containing n
S
set(Object)
- Method in class structure.
AbstractListIterator
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 interface structure.
List
Set value stored at location i to object o, returning old value.
set(int, int, Object)
- Method in class structure.
Matrix
Change the value at location (row, col)
Set
- Interface in
structure
Implementation of a set of elements.
set(int, Object)
- Method in class structure.
SinglyLinkedList
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.
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.
SetList
- Class in
structure
An implementation of a set using lists.
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.
setPrevious(DoublyLinkedListElement)
- Method in class structure.
DoublyLinkedListElement
Set the reference to the previous element.
setRight(BinaryTree)
- Method in class structure.
BinaryTree
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.
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.
DoublyLinkedListElement
Set the value of the element.
setValue(Object)
- Method in class structure.
Entry
Sets the value of the key-value pair.
setValue(Object)
- Method in class structure.
SinglyLinkedListElement
Set the value associated with this element.
SetVector
- Class in
structure
An implementation of a set using vectors
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 in
structure
Singly linked lists have elements connected by a single reference.
SinglyLinkedList()
- Constructor for class structure.
SinglyLinkedList
Construct an empty list.
SinglyLinkedListElement
- Class in
structure
A class supporting a singly linked list element.
SinglyLinkedListElement(Object, SinglyLinkedListElement)
- Constructor for class structure.
SinglyLinkedListElement
Construct a singly linked list element.
SinglyLinkedListElement(Object)
- Constructor for class structure.
SinglyLinkedListElement
Constructs a singly linked list element not associated with any list.
size()
- Method in class structure.
BinarySearchTree
Determines the number of data values within the tree
size()
- Method in class structure.
BinaryTree
Returns the number of descendants of node
size()
- Method in class structure.
ChainedHashtable
Computes the number of elements stored within the hashtable.
size()
- Method in class structure.
CircularList
Determine size of list.
size()
- Method in class structure.
DoublyLinkedList
Determine number of elements in list.
size()
- Method in interface structure.
Graph
Determine number of vertices within graph.
size()
- Method in class structure.
GraphList
Determine number of vertices within graph.
size()
- Method in class structure.
GraphMatrix
Determine number of vertices within graph.
size()
- Method in class structure.
Hashtable
Return the number of key-value pairs within the table.
size()
- Method in interface structure.
Linear
Returns the number of elements in the linear structure.
size()
- Method in interface structure.
List
Determine size of list.
size()
- Method in interface structure.
Map
size()
- Method in class structure.
MapBST
size()
- Method in class structure.
MapList
size()
- Method in class structure.
OrderedList
Determine the number of elements in the list
size()
- Method in class structure.
OrderedVector
Determine the number of elements within the ordered vector
size()
- Method in interface structure.
PriorityQueue
Determine the size of the queue.
size()
- Method in class structure.
PriorityVector
Determine the size of the priority queue.
size()
- Method in interface structure.
Queue
Returns the number of elements in the queue.
size()
- Method in class structure.
QueueArray
Determine the number of elements within the queue
size()
- Method in class structure.
QueueList
Determine the number of elements within the queue.
size()
- Method in class structure.
QueueVector
Determine the number of elements within the queue.
size()
- Method in class structure.
SetList
Determine the number of elements in the set.
size()
- Method in class structure.
SetVector
Determine the number of elements in the set.
size()
- Method in class structure.
SinglyLinkedList
Determine number of elements in list.
size()
- Method in class structure.
SkewHeap
Determine the size of the queue.
size()
- Method in interface structure.
Stack
Returns the number of elements in the stack.
size()
- Method in class structure.
StackArray
Determine the number of elements in the stack.
size()
- Method in class structure.
StackList
Determine the number of elements in the stack.
size()
- Method in class structure.
StackVector
Determine the number of elements in stack.
size()
- Method in class structure.
StructCollection
Determine the number of elements in this collection.
size()
- Method in interface structure.
Structure
Determine the size of the structure.
size()
- Method in class structure.
Table
Determine the number of key-value pairs within the table.
size()
- Method in class structure.
Vector
Determine the number of elements in the vector.
size()
- Method in class structure.
VectorHeap
Determine the size of the queue.
SkewHeap
- Class in
structure
An implementation of a priority queue using skew heaps.
SkewHeap()
- Constructor for class structure.
SkewHeap
Constructs an empty priority queue.
skip(long)
- Method in class structure.
FileStream
skipWhite()
- Method in class structure.
ReadStream
Consume all the white-space characters until EOF or other data.
SplayTree
- Class in
structure
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.
Stack
- Interface in
structure
An interface describing a Last-In, First-Out structure.
StackArray
- Class in
structure
An implementation of a stack using an array.
StackArray(int)
- Constructor for class structure.
StackArray
Construct a stack capable of holding at least size elements.
StackList
- Class in
structure
An implementation of a stack, based on lists.
StackList()
- Constructor for class structure.
StackList
Construct an empty stack.
StackVector
- Class in
structure
An implementation of stacks using Vectors.
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.
StructCollection
- Class in
structure
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
Structure
- Interface in
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.
T
Table
- Class in
structure
An implementation of an ordered dictionary.
Table()
- Constructor for class structure.
Table
Construct a new, empty table.
Table(Table)
- Constructor for class structure.
Table
there()
- Method in class structure.
Edge
Returns the second vertex (or source if undirected).
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.
toString()
- Method in class structure.
Association
Standard string representation of an association.
toString()
- Method in class structure.
BinarySearchTree
Returns a string representing tree
toString()
- Method in class structure.
BinaryTree
Returns a representation the subtree rooted at this node
toString()
- Method in class structure.
BitSet
Constructs string representing set.
toString()
- Method in class structure.
ChainedHashtable
Generate a string representation of the chained hash table.
toString()
- Method in class structure.
CharSet
Compute String representation of charset.
toString()
- Method in class structure.
CircularList
Generate a string representation of list.
toString()
- Method in class structure.
Clock
Generates string representation of clock.
toString()
- Method in class structure.
ComparableAssociation
Construct a string representation of the ComparableAssociation.
toString()
- Method in class structure.
ComparableEdge
Construct a string representation of edge.
toString()
- Method in class structure.
DoublyLinkedList
Construct a string representation of list.
toString()
- Method in class structure.
DoublyLinkedListElement
Construct a string representation of the element.
toString()
- Method in class structure.
Edge
Construct a string representation of edge.
toString()
- Method in class structure.
Entry
Standard string representation of an association.
toString()
- Method in class structure.
GraphListDirected
Construct a string representation of graph.
toString()
- Method in class structure.
GraphListUndirected
Construct a string representation of graph.
toString()
- Method in class structure.
GraphMatrixDirected
Construct a string representation of graph.
toString()
- Method in class structure.
GraphMatrixUndirected
Construct a string representation of graph.
toString()
- Method in class structure.
Hashtable
Generate a string representation of the hash table.
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.
OrderedVector
Construct a string representation of an ordered vector
toString()
- Method in class structure.
PriorityVector
Construct a string representation of the priority vector.
toString()
- Method in class structure.
QueueArray
Construct a string representation of the queue.
toString()
- Method in class structure.
QueueList
Construct a string representation of the queue.
toString()
- Method in class structure.
QueueVector
Construct a string representation of the queue.
toString()
- Method in class structure.
RedBlackTree
toString()
- Method in class structure.
SetList
Construct a string representation of the set.
toString()
- Method in class structure.
SetVector
Construct a string representation of the set.
toString()
- Method in class structure.
SinglyLinkedList
Construct a string representing list.
toString()
- Method in class structure.
SinglyLinkedListElement
Construct a string representation of element.
toString()
- Method in class structure.
SkewHeap
Construct a string representation of the heap.
toString()
- Method in class structure.
SplayTree
Construct a string that represents the splay tree.
toString()
- Method in class structure.
StackArray
Construct a string representation of the stack.
toString()
- Method in class structure.
StackList
Construct a string representation of the stack.
toString()
- Method in class structure.
StackVector
Construct a string representation of stack.
toString()
- Method in class structure.
StructCollection
Construct a string representation of this class.
toString()
- Method in class structure.
Table
Construct a string representing value of table.
toString()
- Method in class structure.
Vector
Determine a string representation for the vector.
toString()
- Method in class structure.
VectorHeap
Construct a string representation of the heap.
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
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.
BinaryTree
Returns value associated with this node
value()
- Method in class structure.
DoublyLinkedListElement
Get value stored within the element.
value()
- Method in class structure.
SinglyLinkedListElement
Fetch the value associated with this element.
values()
- Method in class structure.
AbstractStructure
Returns a java.util.Collection wrapping this structure.
values()
- Method in class structure.
ChainedHashtable
values()
- Method in class structure.
Hashtable
values()
- Method in interface structure.
Map
values()
- Method in class structure.
MapBST
values()
- Method in class structure.
MapList
values()
- Method in interface structure.
Structure
Returns a java.util.Collection wrapping this structure.
values()
- Method in class structure.
Table
Vector
- Class in
structure
An implemention of extensible arrays, similar to that of java.util.Vector.
Vector()
- Constructor for class structure.
Vector
Construct an empty 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
Vector(Collection)
- Constructor for class structure.
Vector
VectorHeap
- Class in
structure
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
Version
- Class in
structure
A utility class that can be used to determine the version of software currently being used.
Version()
- Constructor for class structure.
Version
visit()
- Method in class structure.
Edge
Test and set visited flag on vertex.
visit(Object)
- Method in interface structure.
Graph
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 class structure.
GraphMatrix
Test and set visited flag of vertex.
visitEdge(Edge)
- Method in interface structure.
Graph
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 class structure.
GraphMatrix
Test and set visited flag of edge.
W
wellConnected(RedBlackTree)
- Method in class structure.
RedBlackTree
width()
- Method in class structure.
Matrix
Return the width of the matrix.
Y
year
- Static variable in class structure.
Version
A
B
C
D
E
F
G
H
I
K
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Package
Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes