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

A

actionPerformed(ActionEvent) - Method in class jds.util.ButtonAdapter
when told that a button has been pressed, respond to it; this method is not generally overridden by user.
addElement(Object) - Method in interface jds.Bag
add a new value to the collection
addElement(Object) - Method in interface jds.FindMin
add a new value to the collection
addElement(Object) - Method in class jds.collection.AVLTree
add a new value to the collection
addElement(Object) - Method in class jds.collection.BinarySearchTree
add a new value to the collection
addElement(Object) - Method in class jds.collection.Hashtable
add a new value to the collection
addElement(Object) - Method in class jds.collection.Heap
add a new value to the collection
addElement(Object) - Method in class jds.collection.LinkedList
add a new value to the collection
addElement(Object) - Method in class jds.collection.OpenHashtable
 
addElement(Object) - Method in class jds.collection.SetAdapter
add a new value to the collection
addElement(Object) - Method in class jds.collection.SkewHeap
add a new value to the collection
addElement(Object) - Method in class jds.collection.SkipList
add a new value to the collection
addElement(Object) - Method in class jds.collection.SortedList
add a new value to the collection
addElement(Object) - Method in class jds.collection.SortedVector
add a new value to the collection
addElementAt(Object, int) - Method in interface jds.Indexed
add a new element into the collection, making collection one element larger
addElementAt(Object, int) - Method in class jds.util.VisualVector
add a new element into the collection, making collection one element larger
addElementAt(Object, int) - Method in class jds.collection.IndexedDeque
add a new element into the collection, making collection one element larger
addElementAt(Object, int) - Method in class jds.collection.SparseVector
add a new element into the collection, making collection one element larger
addElementAt(Object, int) - Method in class jds.collection.Vector
add a new element into the collection, making collection one element larger
addFirst(Object) - Method in interface jds.Deque
add a new value to front of the collection
addFirst(Object) - Method in class jds.collection.IndexedDeque
add a new value to front of the collection
addFirst(Object) - Method in class jds.collection.LinkedList
add a new value to front of the collection
addGrid() - Method in class jds.util.GraphMaker
 
addLast(Object) - Method in interface jds.Queue
add a new value to end of the collection
addLast(Object) - Method in interface jds.Stack
add a new value to end of the collection
addLast(Object) - Method in class jds.collection.IndexedDeque
add a new value to end of the collection
addLast(Object) - Method in class jds.collection.LinkedList
add a new value to end of the collection
addLast(Object) - Method in class jds.collection.RingBufferQueue
add a new value to end of the collection
addLast(Object) - Method in class jds.collection.Vector
add a new value to end of the collection
addLine(int) - Method in class jds.util.GraphMaker
 
addPoint(int[], int[]) - Method in class jds.util.Reporter
 
addPoint(int, int) - Method in class jds.util.Reporter
 
and(BitSet) - Method in class jds.collection.BitSet
combine bitset with another bitset
andNot(BitSet) - Method in class jds.collection.BitSet
 
AVLTree - class jds.collection.AVLTree.
AVLTree - set kept in a balanced binary search tree; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
AVLTree() - Constructor for class jds.collection.AVLTree
initialize newly created AVL tree
AVLTree(Comparator) - Constructor for class jds.collection.AVLTree
initialize newly created AVL tree

B

Bag - interface jds.Bag.
Bag - simple collection with insertion, removal, and test; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BinaryNode - class jds.util.BinaryNode.
BinaryNode - one node in a binary tree; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BinaryNode() - Constructor for class jds.util.BinaryNode
initialize a newly created binary node
BinaryNode(Object) - Constructor for class jds.util.BinaryNode
initialize a newly created binary node
BinarySearchTree - class jds.collection.BinarySearchTree.
BinarySearchTree - set kept in a binary search tree; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BinarySearchTree(Comparator) - Constructor for class jds.collection.BinarySearchTree
initialize a newly created binary search tree
BitMatrix - class jds.collection.BitMatrix.
BitMatrix - two dimensional indexed collection of bit values; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BitMatrix(int, int) - Constructor for class jds.collection.BitMatrix
initialize a newly created matrix of bit values
BitSet - class jds.collection.BitSet.
BitSet - set of positive integer values; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BitSet(int) - Constructor for class jds.collection.BitSet
initialize newly created bitset
BubbleSort - class jds.sort.BubbleSort.
BubbleSort - implementation of the bubble sort algorithm; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
BubbleSort(Comparator) - Constructor for class jds.sort.BubbleSort
initialize the Bubble Sort algorithm
ButtonAdapter - class jds.util.ButtonAdapter.
ButtonAdapter - simple button builder; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
ButtonAdapter(String) - Constructor for class jds.util.ButtonAdapter
initialize a button, establish ourself as listener for presses

C

capacity() - Method in class jds.collection.IndexedDeque
capacity return the capacity of this structure
clear() - Method in class jds.util.GraphMaker
 
clear() - Method in class jds.util.Reporter
 
clear(int) - Method in class jds.collection.BitSet
clear bit value at given index
clear(int, int) - Method in class jds.collection.BitMatrix
clear a value in the bit matrix
clearData(int, int) - Method in class jds.util.GraphMaker
 
Collection - interface jds.Collection.
Base class for jds Container hierarcy; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Comparable - interface jds.util.Comparable.
Comparable - interface for objects that can be compared to each other; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Comparator - interface jds.util.Comparator.
Comparator - place two objects in order; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
compare(Object, Object) - Method in interface jds.util.Comparator
determine order of two object; -1, 0 or 1
compare(Object, Object) - Method in class jds.util.DefaultComparator
determine order of two object; -1, 0 or 1
compare(Object, Object) - Method in class jds.util.IntegerCompare
determine order of two integer objects; -1, 0 or 1
compare(Object, Object) - Method in class jds.util.StringCompare
 
compareTo(Object) - Method in interface jds.util.Comparable
 
containsElement(Object) - Method in interface jds.Bag
see if collection contains value
containsElement(Object) - Method in class jds.collection.AVLTree
see if collection contains value
containsElement(Object) - Method in class jds.collection.BinarySearchTree
see if collection contains value
containsElement(Object) - Method in class jds.collection.Hashtable
see if collection contains value
containsElement(Object) - Method in class jds.collection.LinkedList
see if collection contains value
containsElement(Object) - Method in class jds.collection.OpenHashtable
 
containsElement(Object) - Method in class jds.collection.SelfOrgList
see if collection contains value
containsElement(Object) - Method in class jds.collection.SetAdapter
see if collection contains value
containsElement(Object) - Method in class jds.collection.SkipList
see if collection contains value
containsElement(Object) - Method in class jds.collection.SortedList
see if collection contains value
containsElement(Object) - Method in class jds.collection.SortedVector
see if collection contains value
containsKey(Object) - Method in interface jds.Map
see if collection contains element with given key
containsKey(Object) - Method in class jds.collection.MapAdapter
see if collection contains element with given key
CountingSort - class jds.sort.CountingSort.
CountingSort - implementation of the counting sort algorithm; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
CountingSort() - Constructor for class jds.sort.CountingSort
 

D

DefaultComparator - class jds.util.DefaultComparator.
DefaultComparator - comparator object for values that satisfy comparable interface; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
DefaultComparator() - Constructor for class jds.util.DefaultComparator
 
Deque - interface jds.Deque.
Deque - collection with both stack-like and queue-like behavior; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
differenceWith(Bag) - Method in interface jds.Set
form difference from argument set
differenceWith(Bag) - Method in class jds.collection.SetAdapter
form difference from argument set
differenceWith(Bag) - Method in class jds.collection.SortedList
form difference from argument set
doTask(int) - Method in class jds.util.TaskTimer
 
DoubleLink - class jds.util.DoubleLink.
DoubleLink - one link in a linked list; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
DoubleLink(Object, DoubleLink, DoubleLink) - Constructor for class jds.util.DoubleLink
initialize a new link value
drawAxis(Color) - Method in class jds.util.GraphMaker
 
drawGrid(Color) - Method in class jds.util.GraphMaker
 
drawLine(int, Color) - Method in class jds.util.GraphMaker
 

E

elementAt(int) - Method in interface jds.Indexed
find value at specific index location
elementAt(int) - Method in class jds.util.VisualVector
find value at specific index location
elementAt(int) - Method in class jds.collection.IndexedDeque
find value at specific index location
elementAt(int) - Method in class jds.collection.SparseVector
find value at specific index location
elementAt(int) - Method in class jds.collection.Vector
find value at specific index location
elementAt(int, int) - Method in interface jds.Matrix
find element at give location
elementAt(int, int) - Method in class jds.collection.SparseMatrix
find element at give location
elements() - Method in interface jds.Collection
Yields enumerator for collection
elements() - Method in class jds.util.VisualVector
Yields enumerator for collection
elements() - Method in class jds.collection.AVLTree
Yields enumerator for collection
elements() - Method in class jds.collection.BinarySearchTree
Yields enumerator for collection
elements() - Method in class jds.collection.Hashtable
Yields enumerator for collection
elements() - Method in class jds.collection.Heap
Yields enumerator for collection
elements() - Method in class jds.collection.IndexedDeque
Yields enumerator for collection
elements() - Method in class jds.collection.LinkedList
Yields enumerator for collection
elements() - Method in class jds.collection.MapAdapter
Yields enumerator for collection
elements() - Method in class jds.collection.OpenHashtable
 
elements() - Method in class jds.collection.RingBufferQueue
Yields enumerator for collection
elements() - Method in class jds.collection.SetAdapter
Yields enumerator for collection
elements() - Method in class jds.collection.SkewHeap
Yields enumerator for collection
elements() - Method in class jds.collection.SkipList
Yields enumerator for collection
elements() - Method in class jds.collection.SortedList
Yields enumerator for collection
elements() - Method in class jds.collection.SortedVector
Yields enumerator for collection
elements() - Method in class jds.collection.SparseVector
Yields enumerator for collection
elements() - Method in class jds.collection.Vector
Yields enumerator for collection
ensureCapacity(int) - Method in class jds.collection.IndexedDeque
ensure that buffer has sufficient capacity
ensureCapacity(int) - Method in class jds.collection.Vector
ensure buffer has sufficient number of elements
equals(Object) - Method in class jds.util.DefaultComparator
 

F

findElement(Object) - Method in interface jds.Bag
find element that will test equal to value
findElement(Object) - Method in class jds.collection.AVLTree
find element that will test equal to value
findElement(Object) - Method in class jds.collection.BinarySearchTree
find element that will test equal to value
findElement(Object) - Method in class jds.collection.Hashtable
find element that will test equal to value
findElement(Object) - Method in class jds.collection.LinkedList
find element that will test equal to value
findElement(Object) - Method in class jds.collection.OpenHashtable
 
findElement(Object) - Method in class jds.collection.SetAdapter
find element that will test equal to value
findElement(Object) - Method in class jds.collection.SkipList
find element that will test equal to value
findElement(Object) - Method in class jds.collection.SortedList
find element that will test equal to value
findElement(Object) - Method in class jds.collection.SortedVector
find element that will test equal to value
FindMin - interface jds.FindMin.
FindMin - find smallest element in collection (priority queue); for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
FindNth - interface jds.FindNth.
FindNth - find Nth smallest value in collection for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
findNth(int) - Method in interface jds.FindNth
find nth smallest value in collection
findNth(int) - Method in class jds.collection.SortedVector
find nth smallest value in collection
findNth(int) - Method in class jds.sort.Partition
find nth smallest value in collection

G

get(int) - Method in class jds.collection.BitSet
get bit value at given index
get(int, int) - Method in class jds.collection.BitMatrix
get a value from the bit matrix
get(Object) - Method in interface jds.Map
return object stored under given key
get(Object) - Method in class jds.collection.MapAdapter
return object stored under given key
get(Object, Object) - Method in class jds.collection.MapMatrix
get value stored at given key
getFirst() - Method in interface jds.FindMin
yields the smallest element in collection
getFirst() - Method in interface jds.Queue
access the first value in collection
getFirst() - Method in class jds.collection.AVLTree
return the smallest element from the collection
getFirst() - Method in class jds.collection.BinarySearchTree
 
getFirst() - Method in class jds.collection.Heap
yields the smallest element in collection
getFirst() - Method in class jds.collection.IndexedDeque
access the first value in collection
getFirst() - Method in class jds.collection.LinkedList
access the first value in collection
getFirst() - Method in class jds.collection.RingBufferQueue
access the first value in collection
getFirst() - Method in class jds.collection.SkewHeap
yields the smallest element in collection
getFirst() - Method in class jds.collection.SortedList
yields the smallest element in collection
getFirst() - Method in class jds.collection.SortedVector
yields the smallest element in collection
getLast() - Method in interface jds.Stack
access the last value in collection
getLast() - Method in class jds.collection.IndexedDeque
access the last value in collection
getLast() - Method in class jds.collection.LinkedList
access the last value in collection
getLast() - Method in class jds.collection.Vector
access the last value in collection
getLastX() - Method in class jds.util.Reporter
 
getLastY() - Method in class jds.util.Reporter
 
getName() - Method in class jds.util.Reporter
 
getPanel() - Method in class jds.util.VisualVector
yield a panel that will display the contents of the vector
getReporter(String) - Method in class jds.util.GraphMaker
 
getSize() - Method in class jds.util.Reporter
 
GraphMaker - class jds.util.GraphMaker.
 
GraphMaker(int, int) - Constructor for class jds.util.GraphMaker
 

H

Hashtable - class jds.collection.Hashtable.
Hashtable - collection based on a vector of buckets; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Hashtable(int) - Constructor for class jds.collection.Hashtable
initialize a newly created Hash table
Hashtable(int, Comparator) - Constructor for class jds.collection.Hashtable
initialize a newly created hash table
hasMoreElements() - Method in class jds.util.IndexedEnumeration
see if enumeration should continue
hasMoreElements() - Method in class jds.util.InorderTreeTraversal
see if enumeration has at least one more element
hasMoreElements() - Method in class jds.util.LevelorderTreeTraversal
see if enumeration has at least one more element
hasMoreElements() - Method in class jds.util.PostorderTreeTraversal
see if enumeration has at least one more element
hasMoreElements() - Method in class jds.util.PreorderTreeTraversal
see if enumeration has at least one more element
Heap - class jds.collection.Heap.
Heap - priority queue implemented using the Heap data structure; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Heap(Comparator) - Constructor for class jds.collection.Heap
initialize a newly created heap
Heap(Comparator, Indexed) - Constructor for class jds.collection.Heap
initialize a newly created heap

I

Indexed - interface jds.Indexed.
Indexed - collection with elements accessible via index; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
IndexedDeque - class jds.collection.IndexedDeque.
IndexedDeque - Deque implemented in the fashion of a Vector; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
IndexedDeque() - Constructor for class jds.collection.IndexedDeque
 
IndexedEnumeration - class jds.util.IndexedEnumeration.
IndexedEnumeration - enumeration for indexed collections; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
IndexedEnumeration(Indexed) - Constructor for class jds.util.IndexedEnumeration
initialize newly created IndexedEnumeration
initialize(int) - Method in class jds.util.TaskTimer
 
InorderTreeTraversal - class jds.util.InorderTreeTraversal.
IndererTreeTraversal - traverse a binary tree in inorder fashion; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
InorderTreeTraversal(BinaryNode) - Constructor for class jds.util.InorderTreeTraversal
initialize a traversal rooted at given node
insert(Object) - Method in class jds.util.DoubleLink
insert a value into a sequence
InsertionSort - class jds.sort.InsertionSort.
InsertionSort - implementation of the insertion sort algorithm; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
InsertionSort(Comparator) - Constructor for class jds.sort.InsertionSort
initialize the Bubble Sort algorithm
insertLink(DoubleLink) - Method in class jds.util.DoubleLink
insert a new link into a sequence
IntegerCompare - class jds.util.IntegerCompare.
IntegerComapre - place two Integer objects in order; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
IntegerCompare() - Constructor for class jds.util.IntegerCompare
 
intersectWith(Bag) - Method in interface jds.Set
form intersection with argument set
intersectWith(Bag) - Method in class jds.collection.SetAdapter
form intersection with argument set
intersectWith(Bag) - Method in class jds.collection.SortedList
form intersection with argument set
isEmpty() - Method in interface jds.Collection
Determines whether the collection is empty
isEmpty() - Method in class jds.util.BinaryNode
return true if we are not a sentinel node
isEmpty() - Method in class jds.util.VisualVector
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.AVLTree
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.BinarySearchTree
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.Hashtable
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.Heap
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.IndexedDeque
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.LinkedList
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.MapAdapter
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.OpenHashtable
 
isEmpty() - Method in class jds.collection.RingBufferQueue
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SetAdapter
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SkewHeap
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SkipList
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SortedList
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SortedVector
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.SparseVector
Determines whether the collection is empty
isEmpty() - Method in class jds.collection.Vector
Determines whether the collection is empty

L

leftChild - Variable in class jds.util.BinaryNode
left child of node
LevelorderTreeTraversal - class jds.util.LevelorderTreeTraversal.
PreorderTreeTraversal - traverse a binary tree in preorder fashion; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
LevelorderTreeTraversal(BinaryNode) - Constructor for class jds.util.LevelorderTreeTraversal
initialize a newly created traversal enumerator
LinkedList - class jds.collection.LinkedList.
LinkedList - collection based on a sequence of linked values; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
LinkedList() - Constructor for class jds.collection.LinkedList
initialize newly created list
logx - Static variable in class jds.util.GraphMaker
 

M

main(String[]) - Static method in class jds.util.PreorderTreeTraversal
 
makeTable() - Method in class jds.util.GraphMaker
 
Map - interface jds.Map.
Map - collection of key/value pairs; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
MapAdapter - class jds.collection.MapAdapter.
MapAdapter - collection of key/value pairs; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
MapAdapter(Bag) - Constructor for class jds.collection.MapAdapter
initialize newly created Map
MapAdapter(Bag, Comparator) - Constructor for class jds.collection.MapAdapter
initialize newly created Map
MapMatrix - class jds.collection.MapMatrix.
Map - collection of key/value pairs; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
MapMatrix() - Constructor for class jds.collection.MapMatrix
initialize newly created matrix map
MapMatrix(Object) - Constructor for class jds.collection.MapMatrix
initialize newly created matrix map
Matrix - interface jds.Matrix.
Matrix - two dimensional indexed collection; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
MergeSort - class jds.sort.MergeSort.
MergeSort - implementation of the merge sort algorithm; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
MergeSort(Comparator) - Constructor for class jds.sort.MergeSort
initialize the Merge Sort algorithm
mergeWith(Collection) - Method in class jds.collection.SortedList
 
mergeWith(SkewHeap) - Method in class jds.collection.SkewHeap
merge this heap with another

N

next - Variable in class jds.util.DoubleLink
the next and previous links
nextElement() - Method in class jds.util.IndexedEnumeration
get next element in enumeration
nextElement() - Method in class jds.util.InorderTreeTraversal
return the next element in the enumeration
nextElement() - Method in class jds.util.LevelorderTreeTraversal
return the next element in the enumeration
nextElement() - Method in class jds.util.PostorderTreeTraversal
return the next element in the enumeration
nextElement() - Method in class jds.util.PreorderTreeTraversal
return the next element in the enumeration
numberColumns() - Method in interface jds.Matrix
determine number of columns in matrix
numberColumns() - Method in class jds.collection.SparseMatrix
determine number of columns in matrix
numberRows() - Method in interface jds.Matrix
determine number of rows in matrix
numberRows() - Method in class jds.collection.SparseMatrix
determine number of rows in matrix

O

OpenHashtable - class jds.collection.OpenHashtable.
OpenHashtable - collection stored using open address hashing; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
OpenHashtable(Indexed) - Constructor for class jds.collection.OpenHashtable
 
OpenHashtable(int) - Constructor for class jds.collection.OpenHashtable
initialize newly created hash table
or(BitSet) - Method in class jds.collection.BitSet
combine bitset with another bitset

P

paint(Graphics) - Method in class jds.util.GraphMaker
 
Partition - class jds.sort.Partition.
Partition - algorithms involving partitioning a vector into groups; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Partition(Comparator) - Constructor for class jds.sort.Partition
initialize a new Parition object
Partition(Indexed, Comparator) - Constructor for class jds.sort.Partition
initialize a new Parition object
plotData(Color, int[], int[]) - Method in class jds.util.GraphMaker
 
plotData(int[], int[]) - Method in class jds.util.GraphMaker
 
plotData(int, int) - Method in class jds.util.GraphMaker
 
PostorderTreeTraversal - class jds.util.PostorderTreeTraversal.
PreorderTreeTraversal - traverse a binary tree in preorder fashion; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
PostorderTreeTraversal(BinaryNode) - Constructor for class jds.util.PostorderTreeTraversal
initialize a traversal rooted at given node
PreorderTreeTraversal - class jds.util.PreorderTreeTraversal.
PreorderTreeTraversal - traverse a binary tree in preorder fashion; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
PreorderTreeTraversal(BinaryNode) - Constructor for class jds.util.PreorderTreeTraversal
initialize a traversal rooted at given node
pressed() - Method in class jds.util.ButtonAdapter
action to perform when button is pressed; this must be overridden by user
prev - Variable in class jds.util.DoubleLink
the next and previous links

Q

Queue - interface jds.Queue.
Queue - collection with FIFO behavior; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.

R

RadixSort - class jds.sort.RadixSort.
RadixSort - implementation of the radix sort algorithm; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
RadixSort() - Constructor for class jds.sort.RadixSort
 
radixSort(int[]) - Method in class jds.sort.RadixSort
place elements in data into order
remove() - Method in class jds.util.DoubleLink
remove a link from a sequence
removeElement(Object) - Method in interface jds.Bag
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.AVLTree
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.BinarySearchTree
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.Hashtable
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.LinkedList
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.OpenHashtable
 
removeElement(Object) - Method in class jds.collection.SetAdapter
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.SkipList
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.SortedList
remove a new value from the collection
removeElement(Object) - Method in class jds.collection.SortedVector
remove a new value from the collection
removeElementAt(int) - Method in interface jds.Indexed
remove a value from a collection, making collection one element smaller
removeElementAt(int) - Method in class jds.util.VisualVector
remove a value from a collection, making collection one element smaller
removeElementAt(int) - Method in class jds.collection.IndexedDeque
remove a value from a collection, making collection one element smaller
removeElementAt(int) - Method in class jds.collection.SparseVector
remove a value from a collection, making collection one element smaller
removeElementAt(int) - Method in class jds.collection.Vector
remove a value from a collection, making collection one element smaller
removeFirst() - Method in interface jds.FindMin
removes the smallest element in collection
removeFirst() - Method in interface jds.Queue
remove first value in collection
removeFirst() - Method in class jds.collection.AVLTree
remove the smallest element from the collection
removeFirst() - Method in class jds.collection.BinarySearchTree
 
removeFirst() - Method in class jds.collection.Heap
removes the smallest element in collection
removeFirst() - Method in class jds.collection.IndexedDeque
remove first value in collection
removeFirst() - Method in class jds.collection.LinkedList
remove first value in collection
removeFirst() - Method in class jds.collection.RingBufferQueue
remove first value in collection
removeFirst() - Method in class jds.collection.SkewHeap
removes the smallest element in collection
removeFirst() - Method in class jds.collection.SortedList
removes the smallest element in collection
removeFirst() - Method in class jds.collection.SortedVector
removes the smallest element in collection
removeKey(Object) - Method in interface jds.Map
remove element with given key
removeKey(Object) - Method in class jds.collection.MapAdapter
remove element with given key
removeLast() - Method in interface jds.Stack
remove last value in collection
removeLast() - Method in class jds.collection.IndexedDeque
remove last value in collection
removeLast() - Method in class jds.collection.LinkedList
remove last value in collection
removeLast() - Method in class jds.collection.Vector
remove last value in collection
Reporter - class jds.util.Reporter.
 
Reporter(GraphMaker, String) - Constructor for class jds.util.Reporter
 
rightChild - Variable in class jds.util.BinaryNode
right child of node
RingBufferQueue - class jds.collection.RingBufferQueue.
Queue - collection with FIFO behavior; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
run(int, int, int) - Method in class jds.util.TaskTimer
 

S

SelfOrgList - class jds.collection.SelfOrgList.
SelfOrgList - self organizing linked list; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SelfOrgList() - Constructor for class jds.collection.SelfOrgList
 
Set - interface jds.Set.
Set - union/intersection/difference of collections of values; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
set(int) - Method in class jds.collection.BitSet
set bit value at given index
set(int, int) - Method in class jds.collection.BitMatrix
set a value in the bit matrix
set(Object, Object) - Method in interface jds.Map
establish new key/value connection, or replace value associated with key
set(Object, Object) - Method in class jds.collection.MapAdapter
establish new key/value connection, or replace value associated with key
set(Object, Object, Object) - Method in class jds.collection.MapMatrix
place value into given location
SetAdapter - class jds.collection.SetAdapter.
SetAdapter set formed as a wrapper around existing collection; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SetAdapter(Bag) - Constructor for class jds.collection.SetAdapter
initialize set adapter by wrapping around an existing set
setElementAt(Object, int) - Method in interface jds.Indexed
set value at specific location
setElementAt(Object, int) - Method in class jds.util.VisualVector
set value at specific location
setElementAt(Object, int) - Method in class jds.collection.IndexedDeque
set value at specific location
setElementAt(Object, int) - Method in class jds.collection.SparseVector
set value at specific location
setElementAt(Object, int) - Method in class jds.collection.Vector
set value at specific location
setElementAt(Object, int, int) - Method in interface jds.Matrix
change element at given location
setElementAt(Object, int, int) - Method in class jds.collection.SparseMatrix
change element at given location
setSize(int) - Method in interface jds.Indexed
set number of elements in collection
setSize(int) - Method in class jds.util.VisualVector
set number of elements in collection
setSize(int) - Method in class jds.collection.IndexedDeque
set number of elements in collection
setSize(int) - Method in class jds.collection.SparseVector
set number of elements in collection
setSize(int) - Method in class jds.collection.Vector
set number of elements in collection
setSize(int, int) - Method in interface jds.Matrix
set bounds in number of rows and columns
setSize(int, int) - Method in class jds.collection.SparseMatrix
set bounds in number of rows and columns
setXCoeff(int) - Method in class jds.util.GraphMaker
 
setYCoeff(int) - Method in class jds.util.GraphMaker
 
setYMax(int) - Method in class jds.util.GraphMaker
 
ShellSort - class jds.sort.ShellSort.
 
ShellSort(Comparator) - Constructor for class jds.sort.ShellSort
 
size() - Method in interface jds.Collection
Determines number of elements in collection
size() - Method in class jds.util.VisualVector
Determines number of elements in collection
size() - Method in class jds.collection.AVLTree
Determines number of elements in collection
size() - Method in class jds.collection.BinarySearchTree
Determines number of elements in collection
size() - Method in class jds.collection.Hashtable
Determines number of elements in collection
size() - Method in class jds.collection.Heap
Determines number of elements in collection
size() - Method in class jds.collection.IndexedDeque
Determines number of elements in collection
size() - Method in class jds.collection.LinkedList
Determines number of elements in collection
size() - Method in class jds.collection.MapAdapter
Determines number of elements in collection
size() - Method in class jds.collection.OpenHashtable
 
size() - Method in class jds.collection.RingBufferQueue
Determines number of elements in collection
size() - Method in class jds.collection.SetAdapter
Determines number of elements in collection
size() - Method in class jds.collection.SkewHeap
Determines number of elements in collection
size() - Method in class jds.collection.SkipList
Determines number of elements in collection
size() - Method in class jds.collection.SortedList
Determines number of elements in collection
size() - Method in class jds.collection.SortedVector
Determines number of elements in collection
size() - Method in class jds.collection.SparseVector
Determines number of elements in collection
size() - Method in class jds.collection.Vector
Determines number of elements in collection
SkewHeap - class jds.collection.SkewHeap.
SkewHeap - priority queue implemented using skew heap algorithms; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SkewHeap(Comparator) - Constructor for class jds.collection.SkewHeap
initialize newly created heap
SkipList - class jds.collection.SkipList.
SkipList - linked list with randomized pointers to middle; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SkipList() - Constructor for class jds.collection.SkipList
initialize skip list with no elements
SkipList(Comparator) - Constructor for class jds.collection.SkipList
initialize skip list with no elements
sort(Indexed) - Method in interface jds.SortAlgorithm
rearrange collection into asending order
sort(Indexed) - Method in class jds.collection.AVLTree
rearrange collection into asending order
sort(Indexed) - Method in class jds.collection.Heap
rearrange collection into asending order
sort(Indexed) - Method in class jds.collection.SkewHeap
rearrange collection into asending order
sort(Indexed) - Method in class jds.collection.SkipList
rearrange collection into asending order
sort(Indexed) - Method in class jds.collection.SortedVector
rearrange collection into asending order
sort(Indexed) - Method in class jds.sort.BubbleSort
rearrange collection into asending order
sort(Indexed) - Method in class jds.sort.InsertionSort
rearrange collection into asending order
sort(Indexed) - Method in class jds.sort.MergeSort
rearrange collection into asending order
sort(Indexed) - Method in class jds.sort.Partition
rearrange collection into asending order
sort(Indexed) - Method in class jds.sort.ShellSort
 
sort(int[], int) - Method in class jds.sort.CountingSort
sort an array of integer values
SortAlgorithm - interface jds.SortAlgorithm.
SortAlgorithm - rearrange an indexed collection into asending order; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Sorted - interface jds.Sorted.
Sorted - assert that collection is ordered smallest to largest; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SortedList - class jds.collection.SortedList.
SortedList - a linked list that is maintained in order; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SortedList(Comparator) - Constructor for class jds.collection.SortedList
initialize a sorted list
SortedVector - class jds.collection.SortedVector.
SortedVector - an indexed collection that keeps values ordered; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SortedVector(Comparator) - Constructor for class jds.collection.SortedVector
initialize new sorted vector
SortedVector(Indexed, Comparator) - Constructor for class jds.collection.SortedVector
initialize new sorted vector
SparseMatrix - class jds.collection.SparseMatrix.
SparseMatrix - sparse two dimensional indexed collection; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SparseMatrix() - Constructor for class jds.collection.SparseMatrix
initialize a newly created sparse matrix
SparseMatrix(Object) - Constructor for class jds.collection.SparseMatrix
initialize a newly created sparse matrix
SparseVector - class jds.collection.SparseVector.
SparseVector - sparse collection with elements accessible via index; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
SparseVector() - Constructor for class jds.collection.SparseVector
initialize a newly created sparse vector
SparseVector(Object) - Constructor for class jds.collection.SparseVector
initialize a newly created sparse vector
Stack - interface jds.Stack.
Stack - collection with LIFO behavior; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
StringCompare - class jds.util.StringCompare.
StringCompare - place two String objects in order; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
StringCompare() - Constructor for class jds.util.StringCompare
 
subsetOf(Bag) - Method in interface jds.Set
see if current set is subset of argument set
subsetOf(Bag) - Method in class jds.collection.SetAdapter
see if current set is subset of argument set
subsetOf(Bag) - Method in class jds.collection.SortedList
see if current set is subset of argument set

T

TaskTimer - class jds.util.TaskTimer.
 
TaskTimer(Reporter) - Constructor for class jds.util.TaskTimer
 
toString() - Method in class jds.collection.AVLTree
 
toString() - Method in class jds.collection.BinarySearchTree
 

U

unionWith(Bag) - Method in interface jds.Set
form union with argument set
unionWith(Bag) - Method in class jds.collection.SetAdapter
form union with argument set
unionWith(Bag) - Method in class jds.collection.SortedList
form union with argument set
update(Observable, Object) - Method in class jds.util.GraphMaker
 

V

value - Variable in class jds.util.BinaryNode
value being held by node
value - Variable in class jds.util.DoubleLink
the value being held by this link
Vector - class jds.collection.Vector.
Vector - an indexed collection; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
Vector() - Constructor for class jds.collection.Vector
 
VisualVector - class jds.util.VisualVector.
VisualVector - indexed collection with graphical display; for use with book Classic Data Structures in Java by Timothy A Budd, published by Addison-Wesley, 2001.
VisualVector(Indexed) - Constructor for class jds.util.VisualVector
initialize new visual vector

X

x - Static variable in class jds.util.GraphMaker
 
xlogx - Static variable in class jds.util.GraphMaker
 
xor(BitSet) - Method in class jds.collection.BitSet
 
xx - Static variable in class jds.util.GraphMaker
 
A B C D E F G H I L M N O P Q R S T U V X