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

A

AATree - class DataStructures.AATree.

Implements an AA-tree.

AATree() - Constructor for class DataStructures.AATree

Construct the tree.

advance() - Method in class DataStructures.LinkedListItr

Advance the current position to the next node in the list.

advance() - Method in class DataStructures.CursorListItr

Advance the current position to the next node in the list.

AvlTree - class DataStructures.AvlTree.

Implements an AVL tree.

AvlTree() - Constructor for class DataStructures.AvlTree

Construct the tree.

B

BinaryHeap - class DataStructures.BinaryHeap.

Implements a binary heap.

BinaryHeap() - Constructor for class DataStructures.BinaryHeap

Construct the binary heap.

BinaryHeap(int) - Constructor for class DataStructures.BinaryHeap

Construct the binary heap.

BinarySearchTree - class DataStructures.BinarySearchTree.

Implements an unbalanced binary search tree.

BinarySearchTree() - Constructor for class DataStructures.BinarySearchTree

Construct the tree.

BinomialQueue - class DataStructures.BinomialQueue.

Implements a binomial queue.

BinomialQueue() - Constructor for class DataStructures.BinomialQueue

Construct the binomial queue.

C

Comparable - interface DataStructures.Comparable.

Protocol for Comparable objects.

compareTo(Comparable) - Method in class DataStructures.MyInteger

Implements the compareTo method.

compareTo(Comparable) - Method in interface DataStructures.Comparable

Compare this object with rhs.

CursorList - class DataStructures.CursorList.

Linked list implementation of the list using a header node; cursor version.

CursorList() - Constructor for class DataStructures.CursorList

Construct the list.

CursorListItr - class DataStructures.CursorListItr.

Linked list implementation of the list iterator using a header node; cursor version.

D

DataStructures - package DataStructures

decreaseKey(PairNode, Comparable) - Method in class DataStructures.PairHeap

Change the value of the item stored in the pairing heap.

deleteMin() - Method in class DataStructures.BinomialQueue

Remove the smallest item from the priority queue.

deleteMin() - Method in class DataStructures.LeftistHeap

Remove the smallest item from the priority queue.

deleteMin() - Method in class DataStructures.BinaryHeap

Remove the smallest item from the priority queue.

deleteMin() - Method in class DataStructures.PairHeap

Remove the smallest item from the priority queue.

dequeue() - Method in class DataStructures.QueueAr

Return and remove the least recently inserted item from the queue.

DisjSetsFast - class DataStructures.DisjSetsFast.

Disjoint set class, using union by rank and path compression.

DisjSetsFast(int) - Constructor for class DataStructures.DisjSetsFast

Construct the disjoint sets object.

DSL - class DataStructures.DSL.

Implements a deterministic skip list.

DSL(Comparable) - Constructor for class DataStructures.DSL

Construct the DSL.

E

enqueue(Object) - Method in class DataStructures.QueueAr

Insert a new item into the queue.

equals(Object) - Method in class DataStructures.MyInteger

Implements the equals method.

F

find(Comparable) - Method in class DataStructures.BinarySearchTree

Find an item in the tree.

find(Comparable) - Method in class DataStructures.SplayTree

Find an item in the tree.

find(Comparable) - Method in class DataStructures.AATree

Find an item in the tree.

find(Comparable) - Method in class DataStructures.DSL

Find an item in the DSL.

find(Comparable) - Method in class DataStructures.RedBlackTree

Find an item in the tree.

find(Comparable) - Method in class DataStructures.AvlTree

Find an item in the tree.

find(Comparable) - Method in class DataStructures.Treap

Find an item in the tree.

find(Hashable) - Method in class DataStructures.SeparateChainingHashTable

Find an item in the hash table.

find(Hashable) - Method in class DataStructures.QuadraticProbingHashTable

Find an item in the hash table.

find(int) - Method in class DataStructures.DisjSetsFast

Perform a find with path compression.

find(Object) - Method in class DataStructures.CursorList

Return iterator corresponding to the first node containing an item.

find(Object) - Method in class DataStructures.LinkedList

Return iterator corresponding to the first node containing an item.

findMax() - Method in class DataStructures.BinarySearchTree

Find the largest item in the tree.

findMax() - Method in class DataStructures.SplayTree

Find the largest item in the tree.

findMax() - Method in class DataStructures.AATree

Find the largest item in the tree.

findMax() - Method in class DataStructures.DSL

Find the largest item in the DSL.

findMax() - Method in class DataStructures.RedBlackTree

Find the largest item in the tree.

findMax() - Method in class DataStructures.AvlTree

Find the largest item in the tree.

findMax() - Method in class DataStructures.Treap

Find the largest item in the tree.

findMin() - Method in class DataStructures.BinomialQueue

Find the smallest item in the priority queue.

findMin() - Method in class DataStructures.BinarySearchTree

Find the smallest item in the tree.

findMin() - Method in class DataStructures.SplayTree

Find the smallest item in the tree.

findMin() - Method in class DataStructures.AATree

Find the smallest item in the tree.

findMin() - Method in class DataStructures.DSL

Find the smallest item in the DSL.

findMin() - Method in class DataStructures.RedBlackTree

Find the smallest item the tree.

findMin() - Method in class DataStructures.AvlTree

Find the smallest item in the tree.

findMin() - Method in class DataStructures.LeftistHeap

Find the smallest item in the priority queue.

findMin() - Method in class DataStructures.Treap

Find the smallest item in the tree.

findMin() - Method in class DataStructures.BinaryHeap

Find the smallest item in the priority queue.

findMin() - Method in class DataStructures.PairHeap

Find the smallest item in the priority queue.

findPrevious(Object) - Method in class DataStructures.CursorList

Return iterator prior to the first node containing an item.

findPrevious(Object) - Method in class DataStructures.LinkedList

Return iterator prior to the first node containing an item.

first() - Method in class DataStructures.CursorList

Return an iterator representing the first node in the list.

first() - Method in class DataStructures.LinkedList

Return an iterator representing the first node in the list.

G

getFront() - Method in class DataStructures.QueueAr

Get the least recently inserted item in the queue.

H

hash(int) - Method in class DataStructures.MyInteger

Implements the hash method.

hash(int) - Method in interface DataStructures.Hashable

Compute a hash function for this object.

hash(String, int) - Static method in class DataStructures.SeparateChainingHashTable

A hash routine for String objects.

hash(String, int) - Static method in class DataStructures.QuadraticProbingHashTable

A hash routine for String objects.

Hashable - interface DataStructures.Hashable.

Protocol for Hashable objects.

heapsort(Comparable[]) - Static method in class DataStructures.Sort

Standard heapsort.

I

insert(Comparable) - Method in class DataStructures.BinomialQueue

Insert into the priority queue, maintaining heap order.

insert(Comparable) - Method in class DataStructures.BinarySearchTree

Insert into the tree; duplicates are ignored.

insert(Comparable) - Method in class DataStructures.SplayTree

Insert into the tree.

insert(Comparable) - Method in class DataStructures.AATree

Insert into the tree.

insert(Comparable) - Method in class DataStructures.DSL

Insert into the DSL.

insert(Comparable) - Method in class DataStructures.RedBlackTree

Insert into the tree.

insert(Comparable) - Method in class DataStructures.AvlTree

Insert into the tree; duplicates are ignored.

insert(Comparable) - Method in class DataStructures.LeftistHeap

Insert into the priority queue, maintaining heap order.

insert(Comparable) - Method in class DataStructures.Treap

Insert into the tree.

insert(Comparable) - Method in class DataStructures.BinaryHeap

Insert into the priority queue, maintaining heap order.

insert(Comparable) - Method in class DataStructures.PairHeap

Insert into the priority queue, and return a PairNode that can be used by decreaseKey.

insert(Hashable) - Method in class DataStructures.SeparateChainingHashTable

Insert into the hash table.

insert(Hashable) - Method in class DataStructures.QuadraticProbingHashTable

Insert into the hash table.

insert(Object, CursorListItr) - Method in class DataStructures.CursorList

Insert after p.

insert(Object, LinkedListItr) - Method in class DataStructures.LinkedList

Insert after p.

insertionSort(Comparable[]) - Static method in class DataStructures.Sort

Simple insertion sort.

intValue() - Method in class DataStructures.MyInteger

Gets the stored int value.

isEmpty() - Method in class DataStructures.BinomialQueue

Test if the priority queue is logically empty.

isEmpty() - Method in class DataStructures.StackLi

Test if the stack is logically empty.

isEmpty() - Method in class DataStructures.QueueAr

Test if the queue is logically empty.

isEmpty() - Method in class DataStructures.CursorList

Test if the list is logically empty.

isEmpty() - Method in class DataStructures.BinarySearchTree

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.SplayTree

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.AATree

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.LinkedList

Test if the list is logically empty.

isEmpty() - Method in class DataStructures.DSL

Test if the DSL is logically empty.

isEmpty() - Method in class DataStructures.RedBlackTree

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.AvlTree

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.StackAr

Test if the stack is logically empty.

isEmpty() - Method in class DataStructures.LeftistHeap

Test if the priority queue is logically empty.

isEmpty() - Method in class DataStructures.Treap

Test if the tree is logically empty.

isEmpty() - Method in class DataStructures.BinaryHeap

Test if the priority queue is logically empty.

isEmpty() - Method in class DataStructures.PairHeap

Test if the priority queue is logically empty.

isFull() - Method in class DataStructures.BinomialQueue

Test if the priority queue is logically full.

isFull() - Method in class DataStructures.StackLi

Test if the stack is logically full.

isFull() - Method in class DataStructures.QueueAr

Test if the queue is logically full.

isFull() - Method in class DataStructures.StackAr

Test if the stack is logically full.

isFull() - Method in class DataStructures.LeftistHeap

Test if the priority queue is logically full.

isFull() - Method in class DataStructures.BinaryHeap

Test if the priority queue is logically full.

isPastEnd() - Method in class DataStructures.LinkedListItr

Test if the current position is past the end of the list.

isPastEnd() - Method in class DataStructures.CursorListItr

Test if the current position is past the end of the list.

L

LeftistHeap - class DataStructures.LeftistHeap.

Implements a leftist heap.

LeftistHeap() - Constructor for class DataStructures.LeftistHeap

Construct the leftist heap.

LinkedList - class DataStructures.LinkedList.

Linked list implementation of the list using a header node.

LinkedList() - Constructor for class DataStructures.LinkedList

Construct the list

LinkedListItr - class DataStructures.LinkedListItr.

Linked list implementation of the list iterator using a header node.

M

main(String[]) - Static method in class DataStructures.BinomialQueue

main(String[]) - Static method in class DataStructures.StackLi

main(String[]) - Static method in class DataStructures.QueueAr

main(String[]) - Static method in class DataStructures.CursorList

main(String[]) - Static method in class DataStructures.BinarySearchTree

main(String[]) - Static method in class DataStructures.SplayTree

main(String[]) - Static method in class DataStructures.Sort

main(String[]) - Static method in class DataStructures.AATree

main(String[]) - Static method in class DataStructures.LinkedList

main(String[]) - Static method in class DataStructures.DSL

main(String[]) - Static method in class DataStructures.SeparateChainingHashTable

main(String[]) - Static method in class DataStructures.RedBlackTree

main(String[]) - Static method in class DataStructures.Random

main(String[]) - Static method in class DataStructures.AvlTree

main(String[]) - Static method in class DataStructures.StackAr

main(String[]) - Static method in class DataStructures.QuadraticProbingHashTable

main(String[]) - Static method in class DataStructures.LeftistHeap

main(String[]) - Static method in class DataStructures.Treap

main(String[]) - Static method in class DataStructures.BinaryHeap

main(String[]) - Static method in class DataStructures.PairHeap

main(String[]) - Static method in class DataStructures.DisjSetsFast

makeEmpty() - Method in class DataStructures.BinomialQueue

Make the priority queue logically empty.

makeEmpty() - Method in class DataStructures.StackLi

Make the stack logically empty.

makeEmpty() - Method in class DataStructures.QueueAr

Make the queue logically empty.

makeEmpty() - Method in class DataStructures.CursorList

Make the list logically empty.

makeEmpty() - Method in class DataStructures.BinarySearchTree

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.SplayTree

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.AATree

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.LinkedList

Make the list logically empty.

makeEmpty() - Method in class DataStructures.DSL

Make the DSL logically empty.

makeEmpty() - Method in class DataStructures.SeparateChainingHashTable

Make the hash table logically empty.

makeEmpty() - Method in class DataStructures.RedBlackTree

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.AvlTree

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.StackAr

Make the stack logically empty.

makeEmpty() - Method in class DataStructures.QuadraticProbingHashTable

Make the hash table logically empty.

makeEmpty() - Method in class DataStructures.LeftistHeap

Make the priority queue logically empty.

makeEmpty() - Method in class DataStructures.Treap

Make the tree logically empty.

makeEmpty() - Method in class DataStructures.BinaryHeap

Make the priority queue logically empty.

makeEmpty() - Method in class DataStructures.PairHeap

Make the priority queue logically empty.

merge(BinomialQueue) - Method in class DataStructures.BinomialQueue

Merge rhs into the priority queue.

merge(LeftistHeap) - Method in class DataStructures.LeftistHeap

Merge rhs into the priority queue.

mergeSort(Comparable[]) - Static method in class DataStructures.Sort

Mergesort algorithm.

MyInteger - class DataStructures.MyInteger.

Wrapper class for use with generic data structures.

MyInteger() - Constructor for class DataStructures.MyInteger

Construct the MyInteger object with initial value 0.

MyInteger(int) - Constructor for class DataStructures.MyInteger

Construct the MyInteger object.

O

Overflow - exception DataStructures.Overflow.

Exception class for access in full containers such as stacks, queues, and priority queues.

Overflow() - Constructor for class DataStructures.Overflow

P

PairHeap - class DataStructures.PairHeap.

Implements a pairing heap.

PairHeap() - Constructor for class DataStructures.PairHeap

Construct the pairing heap.

PairNode - class DataStructures.PairNode.

Public class for use with PairHeap.

permute(Object[]) - Static method in class DataStructures.Random

Randomly rearrange an array.

pop() - Method in class DataStructures.StackLi

Remove the most recently inserted item from the stack.

pop() - Method in class DataStructures.StackAr

Remove the most recently inserted item from the stack.

printList(CursorList) - Static method in class DataStructures.CursorList

printList(LinkedList) - Static method in class DataStructures.LinkedList

printTree() - Method in class DataStructures.BinarySearchTree

Print the tree contents in sorted order.

printTree() - Method in class DataStructures.SplayTree

Print the tree contents in sorted order.

printTree() - Method in class DataStructures.AATree

Print the tree contents in sorted order.

printTree() - Method in class DataStructures.RedBlackTree

Print the tree contents in sorted order.

printTree() - Method in class DataStructures.AvlTree

Print the tree contents in sorted order.

printTree() - Method in class DataStructures.Treap

Print the tree contents in sorted order.

push(Object) - Method in class DataStructures.StackLi

Insert a new item into the stack.

push(Object) - Method in class DataStructures.StackAr

Insert a new item into the stack, if not already full.

Q

QuadraticProbingHashTable - class DataStructures.QuadraticProbingHashTable.

Probing table implementation of hash tables.

QuadraticProbingHashTable() - Constructor for class DataStructures.QuadraticProbingHashTable

Construct the hash table.

QuadraticProbingHashTable(int) - Constructor for class DataStructures.QuadraticProbingHashTable

Construct the hash table.

QueueAr - class DataStructures.QueueAr.

Array-based implementation of the queue.

QueueAr() - Constructor for class DataStructures.QueueAr

Construct the queue.

QueueAr(int) - Constructor for class DataStructures.QueueAr

Construct the queue.

quickSelect(Comparable[], int) - Static method in class DataStructures.Sort

Quick selection algorithm.

quicksort(Comparable[]) - Static method in class DataStructures.Sort

Quicksort algorithm.

R

Random - class DataStructures.Random.

Random number class, using a 31-bit linear congruential generator.

Random() - Constructor for class DataStructures.Random

Construct this Random object with initial state obtained from system clock.

Random(int) - Constructor for class DataStructures.Random

Construct this Random object with specified initial state.

random0_1() - Method in class DataStructures.Random

Return a pseudorandom double in the open range 0..1 and change the internal state.

randomInt() - Method in class DataStructures.Random

Return a pseudorandom int, and change the internal state.

randomInt(int, int) - Method in class DataStructures.Random

Return an int in the closed range [low,high], and change the internal state.

randomIntWRONG() - Method in class DataStructures.Random

Return a pseudorandom int, and change the internal state.

randomLong(long, long) - Method in class DataStructures.Random

Return an long in the closed range [low,high], and change the internal state.

RedBlackTree - class DataStructures.RedBlackTree.

Implements a red-black tree.

RedBlackTree(Comparable) - Constructor for class DataStructures.RedBlackTree

Construct the tree.

remove(Comparable) - Method in class DataStructures.BinarySearchTree

Remove from the tree.

remove(Comparable) - Method in class DataStructures.SplayTree

Remove from the tree.

remove(Comparable) - Method in class DataStructures.AATree

Remove from the tree.

remove(Comparable) - Method in class DataStructures.DSL

Remove from the DSL.

remove(Comparable) - Method in class DataStructures.RedBlackTree

Remove from the tree.

remove(Comparable) - Method in class DataStructures.AvlTree

Remove from the tree.

remove(Comparable) - Method in class DataStructures.Treap

Remove from the tree.

remove(Hashable) - Method in class DataStructures.SeparateChainingHashTable

Remove from the hash table.

remove(Hashable) - Method in class DataStructures.QuadraticProbingHashTable

Remove from the hash table.

remove(Object) - Method in class DataStructures.CursorList

Remove the first occurrence of an item.

remove(Object) - Method in class DataStructures.LinkedList

Remove the first occurrence of an item.

retrieve() - Method in class DataStructures.LinkedListItr

Return the item stored in the current position.

retrieve() - Method in class DataStructures.CursorListItr

Return the item stored in the current position.

S

SeparateChainingHashTable - class DataStructures.SeparateChainingHashTable.

Separate chaining table implementation of hash tables.

SeparateChainingHashTable() - Constructor for class DataStructures.SeparateChainingHashTable

Construct the hash table.

SeparateChainingHashTable(int) - Constructor for class DataStructures.SeparateChainingHashTable

Construct the hash table.

shellsort(Comparable[]) - Static method in class DataStructures.Sort

Shellsort, using Shell's (poor) increments.

Sort - class DataStructures.Sort.

A class that contains several sorting routines, implemented as static methods.

Sort() - Constructor for class DataStructures.Sort

SplayTree - class DataStructures.SplayTree.

Implements a top-down splay tree.

SplayTree() - Constructor for class DataStructures.SplayTree

Construct the tree.

StackAr - class DataStructures.StackAr.

Array-based implementation of the stack.

StackAr() - Constructor for class DataStructures.StackAr

Construct the stack.

StackAr(int) - Constructor for class DataStructures.StackAr

Construct the stack.

StackLi - class DataStructures.StackLi.

List-based implementation of the stack.

StackLi() - Constructor for class DataStructures.StackLi

Construct the stack.

swapReferences(Object[], int, int) - Static method in class DataStructures.Sort

Method to swap to elements in an array.

T

top() - Method in class DataStructures.StackLi

Get the most recently inserted item in the stack.

top() - Method in class DataStructures.StackAr

Get the most recently inserted item in the stack.

topAndPop() - Method in class DataStructures.StackLi

Return and remove the most recently inserted item from the stack.

topAndPop() - Method in class DataStructures.StackAr

Return and remove most recently inserted item from the stack.

toString() - Method in class DataStructures.MyInteger

Implements the toString method.

Treap - class DataStructures.Treap.

Implements a treap.

Treap() - Constructor for class DataStructures.Treap

Construct the treap.

U

Underflow - exception DataStructures.Underflow.

Exception class for access in empty containers such as stacks, queues, and priority queues.

Underflow() - Constructor for class DataStructures.Underflow

union(int, int) - Method in class DataStructures.DisjSetsFast

Union two disjoint sets using the height heuristic.

Z

zeroth() - Method in class DataStructures.CursorList

Return an iterator representing the header node.

zeroth() - Method in class DataStructures.LinkedList

Return an iterator representing the header node.

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