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

A

add(Comparable) - Method in class DataStructures.BinaryHeap

Adds and item to the heap.

add(Comparable) - Method in interface DataStructures.PriorityQueue

Adds an item to the queue.

add(Comparable) - Method in class DataStructures.StrictBinaryHeap

Adds and item to the heap.

add(Comparable) - Method in class DataStructures.SearchTree

Adds an item into the tree, preserving the ordering property.

add(Object, Object) - Method in class DataStructures.ProbingHashTable

add(Object, Object) - Method in interface DataStructures.LookupTable

Adds the specified entry to the table.

add(Object, Object, int) - Method in class DataStructures.WeightedGraph

Adds a weighted directed arc into the graph.

addFirst(Object) - Method in class DataStructures.LinkedList

Inserts an item at the front of the list.

arcs() - Method in class DataStructures.WeightedGraph

Iterates over the arcs in the graph.

B

BinaryHeap - class DataStructures.BinaryHeap.

Binary heap implementation of a priority queue.

BinaryHeap() - Constructor for class DataStructures.BinaryHeap

Constructs the binary heap.

C

contains(Comparable) - Method in class DataStructures.SearchTree

Tests whether the item is present in the tree.

contains(Object) - Method in class DataStructures.LinkedList

Tests whether an item is present in the list.

contains(Object) - Method in class DataStructures.WeightedGraph

Tests whether a node is present in the graph.

contains(Object) - Method in class DataStructures.ProbingHashTable

contains(Object) - Method in interface DataStructures.LookupTable

Returns true if the table contains an entry for this key.

D

DataStructures - package DataStructures

dequeue() - Method in interface DataStructures.Queue

Detaches an item from the queue.

dequeue() - Method in class DataStructures.QueueList

dequeue() - Method in class DataStructures.QueueArray

DoubleHashingTable - class DataStructures.DoubleHashingTable.

A probing hash table implementation of a LookupTable with collisions resolved by double hashing.

DoubleHashingTable() - Constructor for class DataStructures.DoubleHashingTable

Constructs the hash table with default capacity and load factor.

DoubleHashingTable(int) - Constructor for class DataStructures.DoubleHashingTable

Constructs the hash table with given capacity and default load factor.

DoubleHashingTable(int, double) - Constructor for class DataStructures.DoubleHashingTable

Constructs the hash table with given initial capacity and load factor.

E

elementsInOrder() - Method in class DataStructures.SearchTree

Provides an enumeration of the elements of the tree in order.

elementsLevelOrder() - Method in class DataStructures.SearchTree

Provides an enumeration of the elements of the tree in level order.

empty() - Static method in class DataStructures.SearchTree

Returns an empty tree.

enqueue(Object) - Method in interface DataStructures.Queue

Attaches an item to the queue.

enqueue(Object) - Method in class DataStructures.QueueList

enqueue(Object) - Method in class DataStructures.QueueArray

equals(Object) - Method in class DataStructures.LinkedList

Implements the equals method.

F

findIndex(Object) - Method in class DataStructures.ProbingHashTable

Abstract method returning the index in the table of a key, if present, or the index at which to insert it, if absent.

findIndex(Object) - Method in class DataStructures.QuadraticProbingTable

Method returning the index in ProbingHashTable.table of a key, if present, or the index at which to insert it, if absent.

findIndex(Object) - Method in class DataStructures.DoubleHashingTable

Method returning the index in ProbingHashTable.table of a key, if present, or the index at which to insert it, if absent.

firstItem() - Method in class DataStructures.LinkedList

Returns the first item in the list.

H

head() - Method in class DataStructures.WeightedGraph.Arc

Returns the head or destination of this arc.

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

Sorts an array a[0..n-1] of Comparable objects in ascending order using the Heapsort algorithm.

I

isEmpty() - Method in interface DataStructures.Queue

Indicates the status of the queue.

isEmpty() - Method in class DataStructures.BinaryHeap

Tests if the heap is empty.

isEmpty() - Method in class DataStructures.QueueList

isEmpty() - Method in class DataStructures.LinkedList

Tests if the list is empty.

isEmpty() - Method in interface DataStructures.PriorityQueue

Indicates the status of the queue.

isEmpty() - Method in class DataStructures.QueueArray

isEmpty() - Method in class DataStructures.StackArray

isEmpty() - Method in class DataStructures.StrictBinaryHeap

Tests if the heap is empty.

isEmpty() - Method in class DataStructures.StackList

isEmpty() - Method in class DataStructures.ProbingHashTable

isEmpty() - Method in interface DataStructures.LookupTable

Tests if the table is empty.

isEmpty() - Method in interface DataStructures.Stack

Indicates the status of the stack.

isEmpty() - Method in class DataStructures.SearchTree

Tests if the tree is empty.

iterator() - Method in class DataStructures.LinkedList

Iterates over the items in the list.

iterator() - Method in class DataStructures.ProbingHashTable

iterator() - Method in interface DataStructures.LookupTable

Iterates over the table's entries.

K

key() - Method in class DataStructures.ProbingHashTable.Entry

key() - Method in interface DataStructures.LookupTable.Entry

Returns the key of this entry.

L

LinkedList - class DataStructures.LinkedList.

A simple implementation of singly linked lists.

LinkedList() - Constructor for class DataStructures.LinkedList

Constructs an empty list.

lookup(Object) - Method in class DataStructures.ProbingHashTable

lookup(Object) - Method in interface DataStructures.LookupTable

Returns the value associated with the specified key.

LookupTable - interface DataStructures.LookupTable.

A simple interface for a lookup table.

LookupTable.Entry - interface DataStructures.LookupTable.Entry.

A class of objects returned by iteration over entries.

N

nodeMap - Variable in class DataStructures.WeightedGraph

nodes() - Method in class DataStructures.WeightedGraph

Iterates over the nodes in the graph.

nrArcs() - Method in class DataStructures.WeightedGraph

Returns the number of arcs in the graph

nrNodes() - Method in class DataStructures.WeightedGraph

Returns the number of nodes in the graph

nrNodes() - Method in class DataStructures.SearchTree

Counts the number of nodes in the tree.

P

pathExists(Object, Object) - Method in class DataStructures.PositiveWeightedGraph

Tests whether a path exists between two given nodes.

pop() - Method in class DataStructures.StackArray

pop() - Method in class DataStructures.StackList

pop() - Method in interface DataStructures.Stack

Pops an item off the stack.

PositiveWeightedGraph - class DataStructures.PositiveWeightedGraph.

A class implementing shortest path algorithms for positively weighted directed graphs.

PositiveWeightedGraph() - Constructor for class DataStructures.PositiveWeightedGraph

Constructs an empty positive weighted graph

PriorityQueue - interface DataStructures.PriorityQueue.

Interface for a priority queue.

ProbingHashTable - class DataStructures.ProbingHashTable.

An abstract class implementing the LookupTable interface by means of a hash table.

ProbingHashTable.Entry - class DataStructures.ProbingHashTable.Entry.

A class of objects returned by iteration over entries.

push(Object) - Method in class DataStructures.StackArray

push(Object) - Method in class DataStructures.StackList

push(Object) - Method in interface DataStructures.Stack

Pushes an item onto the stack.

Q

QuadraticProbingTable - class DataStructures.QuadraticProbingTable.

A probing hash table implementation of a LookupTable with collisions resolved by quadratic probing.

QuadraticProbingTable() - Constructor for class DataStructures.QuadraticProbingTable

Constructs the hash table with default capacity and load factor.

QuadraticProbingTable(int) - Constructor for class DataStructures.QuadraticProbingTable

Constructs the hash table with given capacity and default load factor.

QuadraticProbingTable(int, double) - Constructor for class DataStructures.QuadraticProbingTable

Constructs the hash table with given initial capacity and load factor.

Queue - interface DataStructures.Queue.

A first-in-first-out (FIFO) queue of objects.

QueueArray - class DataStructures.QueueArray.

An array implementation of a queue

QueueArray() - Constructor for class DataStructures.QueueArray

QueueList - class DataStructures.QueueList.

A linked list implementation of a queue

QueueList() - Constructor for class DataStructures.QueueList

R

readGraphTxtFile(String) - Method in class DataStructures.WeightedGraph

Reads a graph description from the text file fileName.

remove() - Method in class DataStructures.BinaryHeap

Removes an item of highest priority from the heap.

remove() - Method in interface DataStructures.PriorityQueue

Removes an item of highest priority from the queue.

remove() - Method in class DataStructures.StrictBinaryHeap

Removes an item of highest priority item from the heap.

remove(Comparable) - Method in class DataStructures.SearchTree

Removes an item from the tree, preserving the ordering property.

remove(Object) - Method in class DataStructures.ProbingHashTable

remove(Object) - Method in interface DataStructures.LookupTable

Removes the entry corresponding to the key.

removeFirst() - Method in class DataStructures.LinkedList

Removes the first item from the list.

reverse() - Method in class DataStructures.LinkedList

Reverses the list.

S

SearchTree - class DataStructures.SearchTree.

A class implementing binary search trees.

SearchTree() - Constructor for class DataStructures.SearchTree

shortestPath(Object, Object) - Method in class DataStructures.PositiveWeightedGraph

Enumerates the nodes in a shortest path between two given nodes.

shortestPathLength(Object, Object) - Method in class DataStructures.PositiveWeightedGraph

Returns the length of a shortest path between two given nodes.

size() - Method in class DataStructures.BinaryHeap

Returns the current size of the queue

size() - Method in class DataStructures.LinkedList

Returns the length of the list

size() - Method in interface DataStructures.PriorityQueue

Returns the current size of the queue

size() - Method in class DataStructures.StrictBinaryHeap

Returns the current size of the queue.

size() - Method in class DataStructures.ProbingHashTable

size() - Method in interface DataStructures.LookupTable

Returns the number of entries in the table.

Sort - class DataStructures.Sort.

A class providing static array sorting routines

Stack - interface DataStructures.Stack.

A last-in-first-out (LIFO) stack of objects.

StackArray - class DataStructures.StackArray.

An array implementation of a stack

StackArray() - Constructor for class DataStructures.StackArray

StackList - class DataStructures.StackList.

A linked list implementation of a stack

StackList() - Constructor for class DataStructures.StackList

StrictBinaryHeap - class DataStructures.StrictBinaryHeap.

Binary heap implementation of a priority queue, in which items of the same priority are removed in order of insertion.

StrictBinaryHeap() - Constructor for class DataStructures.StrictBinaryHeap

Constructs the binary heap.

T

table - Variable in class DataStructures.ProbingHashTable

the underlying table of hash entries

tail() - Method in class DataStructures.WeightedGraph.Arc

Returns the tail or source of this arc.

toString() - Method in class DataStructures.LinkedList

Converts the list to a string.

toString() - Method in class DataStructures.ProbingHashTable.Entry

toString() - Method in class DataStructures.SearchTree

Converts the tree to a string.

V

value() - Method in class DataStructures.ProbingHashTable.Entry

value() - Method in interface DataStructures.LookupTable.Entry

Returns the value of this entry.

version - Variable in class DataStructures.WeightedGraph

W

weight() - Method in class DataStructures.WeightedGraph.Arc

Returns the weight attached to this arc.

WeightedGraph - class DataStructures.WeightedGraph.

A class implementing a weighted directed graph.

WeightedGraph.Arc - class DataStructures.WeightedGraph.Arc.

A public class returned by the arcs() iteration over arcs.

WeightedGraph.Node - class DataStructures.WeightedGraph.Node.

WeightedGraph.Tip - class DataStructures.WeightedGraph.Tip.

WeightedGraph() - Constructor for class DataStructures.WeightedGraph

Constructs an empty weighted graph

writeGraphTxtFile(String) - Method in class DataStructures.WeightedGraph

Writes a graph description to the text file fileName.

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