Index

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

A

AbstractBinaryTree<E> - Class in net.datastructures: An abstract base class providing some functionality of the BinaryTree interface.
AbstractBinaryTree() - Constructor for class net.datastructures.AbstractBinaryTree
AbstractHashMap<K,V> - Class in net.datastructures: An abstract base class supporting Map implementations that use hash tables with MAD compression.
AbstractHashMap(int, int) - Constructor for class net.datastructures.AbstractHashMap: Creates a hash table with the given capacity and prime factor.
AbstractHashMap(int) - Constructor for class net.datastructures.AbstractHashMap: Creates a hash table with given capacity and prime factor 109345121.
AbstractHashMap() - Constructor for class net.datastructures.AbstractHashMap: Creates a hash table with capacity 17 and prime factor 109345121.
AbstractMap<K,V> - Class in net.datastructures: An abstract base class to ease the implementation of the Map interface.
AbstractMap() - Constructor for class net.datastructures.AbstractMap
AbstractMap.MapEntry<K,V> - Class in net.datastructures: A concrete implementation of the Entry interface to be used within a Map implementation.
AbstractMap.MapEntry(K, V) - Constructor for class net.datastructures.AbstractMap.MapEntry
AbstractPriorityQueue<K,V> - Class in net.datastructures: An abstract base class to ease the implementation of the PriorityQueue interface.
AbstractPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.AbstractPriorityQueue: Creates an empty priority queue using the given comparator to order keys.
AbstractPriorityQueue() - Constructor for class net.datastructures.AbstractPriorityQueue: Creates an empty priority queue based on the natural ordering of its keys.
AbstractPriorityQueue.PQEntry<K,V> - Class in net.datastructures: A concrete implementation of the Entry interface to be used within a PriorityQueue implementation.
AbstractPriorityQueue.PQEntry(K, V) - Constructor for class net.datastructures.AbstractPriorityQueue.PQEntry
AbstractProgression - Class in dsaj.design: Generates a simple progression.
AbstractProgression() - Constructor for class dsaj.design.AbstractProgression: Constructs a progression starting at zero.
AbstractProgression(long) - Constructor for class dsaj.design.AbstractProgression: Constructs a progression with given start value.
AbstractSortedMap<K,V> - Class in net.datastructures: An abstract base class to ease the implementation of the SortedMap interface.
AbstractSortedMap(Comparator<K>) - Constructor for class net.datastructures.AbstractSortedMap: Initializes the comparator for the map.
AbstractSortedMap() - Constructor for class net.datastructures.AbstractSortedMap: Initializes the map with a default comparator.
AbstractTree<E> - Class in net.datastructures: An abstract base class providing some functionality of the Tree interface.
AbstractTree() - Constructor for class net.datastructures.AbstractTree
access(E) - Method in class dsaj.lists.FavoritesList: Accesses element e, thereby increasing its access count.
AdaptablePriorityQueue<K,V> - Interface in net.datastructures: Interface for the adaptable priority queue ADT.
add(GameEntry) - Method in class dsaj.arrays.Scoreboard: Attempt to add a new score to the collection (if it is high enough)
add(int, int) - Method in class dsaj.maps.CostPerformanceDatabase: Add a new entry with given cost c and performance p.
add(int, E) - Method in class net.datastructures.ArrayList: Inserts the given element at the specified index of the list, shifting all subsequent elements in the list one position further to make room.
add(int, E) - Method in interface net.datastructures.List: Inserts the given element at the specified index of the list, shifting all subsequent elements in the list one position further to make room.
addAfter(Position<E>, E) - Method in class net.datastructures.LinkedPositionalList: Inserts an element immediately after the given Position.
addAfter(Position<E>, E) - Method in interface net.datastructures.PositionalList: Inserts an element immediately after the given Position.
addBefore(Position<E>, E) - Method in class net.datastructures.LinkedPositionalList: Inserts an element immediately before the given Position.
addBefore(Position<E>, E) - Method in interface net.datastructures.PositionalList: Inserts an element immediately before the given Position.
addChild(Position<E>, E) - Method in class dsaj.trees.LinkedTree
addFirst(E) - Method in class net.datastructures.CircularlyLinkedList: Adds an element to the front of the list.
addFirst(E) - Method in interface net.datastructures.Deque: Inserts an element at the front of the deque.
addFirst(E) - Method in class net.datastructures.DoublyLinkedList: Adds an element to the front of the list.
addFirst(E) - Method in class net.datastructures.LinkedDeque
addFirst(E) - Method in class net.datastructures.LinkedPositionalList: Inserts an element at the front of the list.
addFirst(E) - Method in interface net.datastructures.PositionalList: Inserts an element at the front of the list.
addFirst(E) - Method in class net.datastructures.SinglyLinkedList: Adds an element to the front of the list.
addLast(E) - Method in class net.datastructures.CircularlyLinkedList: Adds an element to the end of the list.
addLast(E) - Method in interface net.datastructures.Deque: Inserts an element at the back of the deque.
addLast(E) - Method in class net.datastructures.DoublyLinkedList: Adds an element to the end of the list.
addLast(E) - Method in class net.datastructures.LinkedDeque
addLast(E) - Method in class net.datastructures.LinkedPositionalList: Inserts an element at the back of the list.
addLast(E) - Method in interface net.datastructures.PositionalList: Inserts an element at the back of the list.
addLast(E) - Method in class net.datastructures.SinglyLinkedList: Adds an element to the end of the list.
addLeft(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree: Creates a new left child of Position p storing element e and returns its Position.
addRight(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree: Creates a new right child of Position p storing element e and returns its Position.
addRoot(E) - Method in class dsaj.trees.LinkedTree
addRoot(E) - Method in class net.datastructures.LinkedBinaryTree: Places element e at the root of an empty tree and returns its new Position.
AdjacencyMapGraph<V,E> - Class in net.datastructures: An implementation for a graph structure using an adjacency map for each vertex.
AdjacencyMapGraph(boolean) - Constructor for class net.datastructures.AdjacencyMapGraph: Constructs an empty graph.
advance() - Method in class dsaj.design.AbstractProgression: Advances the current value to the next value of the progression.
advance() - Method in class dsaj.design.ArithmeticProgression: Adds the arithmetic increment to the current value.
advance() - Method in class dsaj.design.FibonacciProgression: Replaces (prev,current) with (current, current+prev).
advance() - Method in class dsaj.design.GeometricProgression: Multiplies the current value by the geometric base.
advance() - Method in class dsaj.design.Progression: Advances the current value to the next value of the progression.
advance() - Method in class dsaj.primer.Robot
after(Position<E>) - Method in class net.datastructures.LinkedPositionalList: Returns the Position immediately after Position p.
after(Position<E>) - Method in interface net.datastructures.PositionalList: Returns the Position immediately after Position p.
age - Variable in class dsaj.primer.Gnome
alpha - Static variable in class dsaj.arrays.Caesar
ALPHASIZE - Static variable in class dsaj.arrays.Caesar
ArithmeticProgression - Class in dsaj.design
ArithmeticProgression() - Constructor for class dsaj.design.ArithmeticProgression: Constructs progression 0, 1, 2, ...
ArithmeticProgression(long) - Constructor for class dsaj.design.ArithmeticProgression: Constructs progression 0, stepsize, 2*stepsize, ...
ArithmeticProgression(long, long) - Constructor for class dsaj.design.ArithmeticProgression: Constructs arithmetic progression with arbitrary start and increment.
ArrayCount - Class in dsaj.primer
ArrayCount() - Constructor for class dsaj.primer.ArrayCount
ArrayFragments - Class in dsaj.primer
ArrayFragments() - Constructor for class dsaj.primer.ArrayFragments
ArrayList<E> - Class in net.datastructures: Realization of a list by means of a dynamic array.
ArrayList() - Constructor for class net.datastructures.ArrayList: Creates an array list with default initial capacity.
ArrayList(int) - Constructor for class net.datastructures.ArrayList: Creates an array list with given initial capacity.
ArrayMax - Class in dsaj.primer
ArrayMax() - Constructor for class dsaj.primer.ArrayMax
ArrayQueue<E> - Class in net.datastructures: Implementation of the queue ADT using a fixed-length array.
ArrayQueue() - Constructor for class net.datastructures.ArrayQueue: Constructs an empty queue using the default array capacity.
ArrayQueue(int) - Constructor for class net.datastructures.ArrayQueue: Constructs and empty queue with the given array capacity.
ArrayReverse - Class in dsaj.recursion: Demonstration of recursive method for reversing an array's elements.
ArrayReverse() - Constructor for class dsaj.recursion.ArrayReverse
ArrayScale - Class in dsaj.primer: Example of valid and invalid method for scaling a numeric array.
ArrayScale() - Constructor for class dsaj.primer.ArrayScale
ArrayStack<E> - Class in net.datastructures: Implementation of the stack ADT using a fixed-length array.
ArrayStack() - Constructor for class net.datastructures.ArrayStack: Constructs an empty stack using the default array capacity.
ArrayStack(int) - Constructor for class net.datastructures.ArrayStack: Constructs and empty stack with the given array capacity.
ArraySum - Class in dsaj.primer: Example of a static method that analyzes an array
ArraySum() - Constructor for class dsaj.primer.ArraySum
ArraySum - Class in dsaj.recursion: Demonstration of two recursive approaches to computing the sum of an array of integers.
ArraySum() - Constructor for class dsaj.recursion.ArraySum
ArraySumForeach - Class in dsaj.primer: Example of a static method that analyzes an array using for-each loop.
ArraySumForeach() - Constructor for class dsaj.primer.ArraySumForeach
ArrayTest - Class in dsaj.arrays: Program showing some array uses.
ArrayTest() - Constructor for class dsaj.arrays.ArrayTest
attach(Position<E>, LinkedBinaryTree<E>, LinkedBinaryTree<E>) - Method in class net.datastructures.LinkedBinaryTree: Attaches trees t1 and t2, respectively, as the left and right subtree of the leaf Position p.
AVLTreeMap<K,V> - Class in net.datastructures: An implementation of a sorted map using an AVL tree.
AVLTreeMap() - Constructor for class net.datastructures.AVLTreeMap: Constructs an empty map using the natural ordering of keys.
AVLTreeMap(Comparator<K>) - Constructor for class net.datastructures.AVLTreeMap: Constructs an empty map using the given comparator to order keys.

B

badReset(Counter) - Static method in class dsaj.primer.CounterDemo
balance - Variable in class dsaj.primer.CreditCard
base - Variable in class dsaj.design.GeometricProgression
before(Position<E>) - Method in class net.datastructures.LinkedPositionalList: Returns the Position immediately before Position p.
before(Position<E>) - Method in interface net.datastructures.PositionalList: Returns the Position immediately before Position p.
best(int) - Method in class dsaj.maps.CostPerformanceDatabase: Returns the (cost,performance) entry with largest cost not exceeding c.
BFS(Graph<V, E>, Vertex<V>, Set<Vertex<V>>, Map<Vertex<V>, Edge<E>>) - Static method in class net.datastructures.GraphAlgorithms: Performs breadth-first search of the undiscovered portion of Graph g starting at Vertex s.
BFSComplete(Graph<V, E>) - Static method in class net.datastructures.GraphAlgorithms: Performs BFS for the entire graph and returns the BFS forest as a map.
BinarySearch - Class in dsaj.recursion: Simple demonstration of the binary search algorithm.
BinarySearch() - Constructor for class dsaj.recursion.BinarySearch
binarySearch(int[], int, int, int) - Static method in class dsaj.recursion.BinarySearch: Returns true if the target value is found in the indicated portion of the data array.
binarySearch(int[], int) - Static method in class dsaj.recursion.BinarySearch: Returns true if the target value is found in the data array.
binarySearchIterative(int[], int) - Static method in class dsaj.recursion.BinarySearch: Returns true if the target value is found in the data array.
binarySum(int[], int, int) - Static method in class dsaj.recursion.ArraySum: Returns the sum of subarray data[low] through data[high] inclusive.
BinaryTree<E> - Interface in net.datastructures: An interface for a binary tree, in which each node has at most two children.
BoxedItem - Class in dsaj.design: Class for objects that can be sold, packed, and shipped.
BoxedItem(String, int, int, boolean) - Constructor for class dsaj.design.BoxedItem: Constructor
BoxedItem2 - Class in dsaj.design
BoxedItem2(String, int, int, boolean) - Constructor for class dsaj.design.BoxedItem2: Constructor
breadthfirst() - Method in class net.datastructures.AbstractTree: Returns an iterable collection of positions of the tree in breadth-first order.
bubble(int) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Restores the heap property by moving the entry at index j upward/downward.
bucketGet(int, K) - Method in class net.datastructures.AbstractHashMap: Returns value associated with key k in bucket with hash value h.
bucketGet(int, K) - Method in class net.datastructures.ChainHashMap: Returns value associated with key k in bucket with hash value h.
bucketGet(int, K) - Method in class net.datastructures.ChainHashMapOld
bucketGet(int, K) - Method in class net.datastructures.ProbeHashMap: Returns value associated with key k in bucket with hash value h.
bucketPut(int, K, V) - Method in class net.datastructures.AbstractHashMap: Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketPut(int, K, V) - Method in class net.datastructures.ChainHashMap: Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketPut(int, K, V) - Method in class net.datastructures.ChainHashMapOld
bucketPut(int, K, V) - Method in class net.datastructures.ProbeHashMap: Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketRemove(int, K) - Method in class net.datastructures.AbstractHashMap: Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.
bucketRemove(int, K) - Method in class net.datastructures.ChainHashMap: Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.
bucketRemove(int, K) - Method in class net.datastructures.ChainHashMapOld
bucketRemove(int, K) - Method in class net.datastructures.ProbeHashMap: Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.
buildQueue(E[]) - Static method in class dsaj.queues.Josephus: Builds a circular queue from an array of objects.
buildTree(Tree<String>, String[]) - Static method in class dsaj.trees.TreeBuilder
buildTreeRecurse(String[], int, Tree<String>, Position<String>) - Static method in class dsaj.trees.TreeBuilder

C

Caesar - Class in dsaj.arrays: Class for doing encryption and decryption using the Caesar Cipher.
Caesar() - Constructor for class dsaj.arrays.Caesar: Constructor that initializes the encryption and decryption arrays
CaesarCipher - Class in dsaj.arrays: Class for doing encryption and decryption using the Caesar Cipher.
CaesarCipher(int) - Constructor for class dsaj.arrays.CaesarCipher: Constructor that initializes the encryption and decryption arrays
capacity - Variable in class net.datastructures.AbstractHashMap
CAPACITY - Static variable in class net.datastructures.ArrayList: Default array capacity.
CAPACITY - Static variable in class net.datastructures.ArrayQueue: Default array capacity.
CAPACITY - Static variable in class net.datastructures.ArrayStack: Default array capacity.
ceilingEntry(K) - Method in interface net.datastructures.SortedMap: Returns the entry with least key greater than or equal to given key (or null if no such key exists).
ceilingEntry(K) - Method in class net.datastructures.SortedTableMap: Returns the entry with least key greater than or equal to given key (or null if no such key exists).
ceilingEntry(K) - Method in class net.datastructures.TreeMap: Returns the entry with least key greater than or equal to given key (or null if no such key exists).
ChainHashMap<K,V> - Class in net.datastructures
ChainHashMap() - Constructor for class net.datastructures.ChainHashMap: Creates a hash table with capacity 11 and prime factor 109345121.
ChainHashMap(int) - Constructor for class net.datastructures.ChainHashMap: Creates a hash table with given capacity and prime factor 109345121.
ChainHashMap(int, int) - Constructor for class net.datastructures.ChainHashMap: Creates a hash table with the given capacity and prime factor.
ChainHashMapOld<K,V> - Class in net.datastructures
ChainHashMapOld() - Constructor for class net.datastructures.ChainHashMapOld: Creates a hash table with capacity 11 and prime factor 109345121.
ChainHashMapOld(int) - Constructor for class net.datastructures.ChainHashMapOld: Creates a hash table with given capacity and prime factor 109345121.
ChainHashMapOld(int, int) - Constructor for class net.datastructures.ChainHashMapOld: Creates a hash table with the given capacity and prime factor.
charge(double) - Method in class dsaj.design.PredatoryCreditCard
charge(double) - Method in class dsaj.primer.CreditCard: Charges the given price to the card, assuming sufficient credit limit.
checkIndex(int, int) - Method in class net.datastructures.ArrayList: Checks whether the given index is in the range [0, n-1].
checkKey(K) - Method in class net.datastructures.AbstractPriorityQueue: Determines whether a key is valid.
checkKey(K) - Method in class net.datastructures.AbstractSortedMap: Determines whether a key is valid.
children(Position<E>) - Method in class dsaj.trees.LinkedTree
children(Position<E>) - Method in class net.datastructures.AbstractBinaryTree: Returns an iterable collection of the Positions representing p's children.
children(Position<E>) - Method in interface net.datastructures.Tree: Returns an iterable collection of the Positions representing p's children.
CircularlyLinkedList<E> - Class in net.datastructures: An implementation of a circularly linked list.
CircularlyLinkedList() - Constructor for class net.datastructures.CircularlyLinkedList: Constructs an initially empty list.
CircularQueue<E> - Interface in net.datastructures: This provides one additional method not part of the general Queue interface.
clearBoard() - Method in class dsaj.arrays.TicTacToe: Clears the board
clone() - Method in class net.datastructures.SinglyLinkedList
compare(String, String) - Method in class dsaj.pq.StringLengthComparator: Compares two strings according to their lengths.
compare(Entry<K, V>, Entry<K, V>) - Method in class net.datastructures.AbstractPriorityQueue: Method for comparing two entries according to key
compare(Entry<K, V>, Entry<K, V>) - Method in class net.datastructures.AbstractSortedMap: Method for comparing two entries according to key
compare(K, Entry<K, V>) - Method in class net.datastructures.AbstractSortedMap: Method for comparing a key and an entry's key
compare(Entry<K, V>, K) - Method in class net.datastructures.AbstractSortedMap: Method for comparing a key and an entry's key
compare(K, K) - Method in class net.datastructures.AbstractSortedMap: Method for comparing two keys
compare(E, E) - Method in class net.datastructures.DefaultComparator: Compares two elements.
complex() - Method in class dsaj.primer.Robot
constructPath(Graph<V, E>, Vertex<V>, Vertex<V>, Map<Vertex<V>, Edge<E>>) - Static method in class net.datastructures.GraphAlgorithms: Returns an ordered list of edges comprising the directed path from u to v.
CostPerformanceDatabase - Class in dsaj.maps: Maintains a database of maximal (cost,performance) pairs.
CostPerformanceDatabase() - Constructor for class dsaj.maps.CostPerformanceDatabase: Constructs an initially empty database.
count(Position<FavoritesList.Item<E>>) - Method in class dsaj.lists.FavoritesList: Provides shorthand notation to retrieve count of item stored at Position p.
count(int[], int) - Static method in class dsaj.primer.ArrayCount: Returns the number of times the given value appears in the data array.
Counter - Class in dsaj.primer: An integer counter that can be incremented and reset to zero.
Counter() - Constructor for class dsaj.primer.Counter: Constructs a new Counter with value zero.
Counter(int) - Constructor for class dsaj.primer.Counter: Constructs a new Counter with given initial value.
CounterDemo - Class in dsaj.primer: A demonstration of the use of the Counter class.
CounterDemo() - Constructor for class dsaj.primer.CounterDemo
createNode(E, LinkedBinaryTree.Node<E>, LinkedBinaryTree.Node<E>, LinkedBinaryTree.Node<E>) - Method in class net.datastructures.LinkedBinaryTree: Factory function to create a new node storing element e.
createNode(Entry<K, V>, LinkedBinaryTree.Node<Entry<K, V>>, LinkedBinaryTree.Node<Entry<K, V>>, LinkedBinaryTree.Node<Entry<K, V>>) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree
createTable() - Method in class net.datastructures.AbstractHashMap: Creates an empty table having length equal to current capacity.
createTable() - Method in class net.datastructures.ChainHashMap: Creates an empty table having length equal to current capacity.
createTable() - Method in class net.datastructures.ChainHashMapOld
createTable() - Method in class net.datastructures.ProbeHashMap: Creates an empty table having length equal to current capacity.
CreditCard - Class in dsaj.primer: A simple model for a consumer credit card.
CreditCard(String, String, String, int, double) - Constructor for class dsaj.primer.CreditCard: Constructs a new credit card instance.
CreditCard(String, String, String, int) - Constructor for class dsaj.primer.CreditCard: Constructs a new credit card instance with default balance of zero.
current - Variable in class dsaj.design.AbstractProgression
current - Variable in class dsaj.design.Progression

D

decoder - Variable in class dsaj.arrays.CaesarCipher
decrypt - Variable in class dsaj.arrays.Caesar
decrypt(String) - Method in class dsaj.arrays.Caesar: Decryption method
decrypt(String) - Method in class dsaj.arrays.CaesarCipher: Returns decrypted message given encrypted secret.
DeepClone - Class in dsaj.arrays
DeepClone() - Constructor for class dsaj.arrays.DeepClone
deepClone(int[][]) - Static method in class dsaj.arrays.DeepClone
DefaultComparator<E> - Class in net.datastructures: Comparator based on the compareTo method of a Comparable element type.
DefaultComparator() - Constructor for class net.datastructures.DefaultComparator
Demonstration - Class in dsaj.design
Demonstration() - Constructor for class dsaj.design.Demonstration
depth(Position<E>) - Method in class net.datastructures.AbstractTree: Returns the number of levels separating Position p from the root.
Deque<E> - Interface in net.datastructures: Interface for a double-ended queue: a collection of elements that can be inserted and removed at both ends; this interface is a simplified version of java.util.Deque.
dequeue() - Method in class net.datastructures.ArrayQueue: Removes and returns the first element of the queue.
dequeue() - Method in class net.datastructures.LinkedCircularQueue: Removes and returns the first element of the queue.
dequeue() - Method in class net.datastructures.LinkedQueue: Removes and returns the first element of the queue.
dequeue() - Method in interface net.datastructures.Queue: Removes and returns the first element of the queue.
description() - Method in class dsaj.design.BoxedItem
description() - Method in class dsaj.design.BoxedItem2
description() - Method in class dsaj.design.Photograph
description() - Method in interface dsaj.design.Sellable: Returns a description of the object.
DFS(Graph<V, E>, Vertex<V>, Set<Vertex<V>>, Map<Vertex<V>, Edge<E>>) - Static method in class net.datastructures.GraphAlgorithms: Performs depth-first search of the unknown portion of Graph g starting at Vertex u.
DFSComplete(Graph<V, E>) - Static method in class net.datastructures.GraphAlgorithms: Performs DFS for the entire graph and returns the DFS forest as a map.
DiskSpace - Class in dsaj.recursion: Supports the computation of the total disk space usage within a file system.
DiskSpace() - Constructor for class dsaj.recursion.DiskSpace
diskSpace(Tree<Integer>, Position<Integer>) - Static method in class dsaj.trees.TraversalExamples: Returns total disk space for subtree of T rooted at p.
diskSpaceFake(Tree<String>, Position<String>) - Static method in class dsaj.trees.TraversalExamples: Returns total disk space for subtree of T rooted at p.
diskUsage(File) - Static method in class dsaj.recursion.DiskSpace: Calculates the total disk usage (in bytes) of the portion of the file system rooted at the given path, while printing a summary akin to the standard 'du' Unix tool.
DoublyLinkedList<E> - Class in net.datastructures: A basic doubly linked list implementation.
DoublyLinkedList() - Constructor for class net.datastructures.DoublyLinkedList: Constructs a new empty list.
downheap(int) - Method in class net.datastructures.HeapPriorityQueue: Moves the entry at index j lower, if necessary, to restore the heap property.
drawRuler(int, int) - Static method in class dsaj.recursion.Ruler: Draws an English ruler.
dsaj.arrays - package dsaj.arrays
dsaj.asymptotics - package dsaj.asymptotics
dsaj.design - package dsaj.design
dsaj.lists - package dsaj.lists
dsaj.maps - package dsaj.maps
dsaj.pq - package dsaj.pq
dsaj.primer - package dsaj.primer
dsaj.queues - package dsaj.queues
dsaj.recursion - package dsaj.recursion
dsaj.sorting - package dsaj.sorting
dsaj.stacks - package dsaj.stacks
dsaj.text - package dsaj.text
dsaj.trees - package dsaj.trees
dump() - Method in class net.datastructures.TreeMap: Prints textual representation of tree structure (for debug purpose only).

E

Edge<E> - Interface in net.datastructures: An edge of a graph.
edges() - Method in class net.datastructures.AdjacencyMapGraph: Returns the edges of the graph as an iterable collection
edges() - Method in interface net.datastructures.Graph: Returns the edges of the graph as an iterable collection
EMPTY - Static variable in class dsaj.arrays.TicTacToe
encoder - Variable in class dsaj.arrays.CaesarCipher
encrypt - Variable in class dsaj.arrays.Caesar
encrypt(String) - Method in class dsaj.arrays.Caesar: Encryption method
encrypt(String) - Method in class dsaj.arrays.CaesarCipher: Returns String representing encrypted message.
endVertices(Edge<E>) - Method in class net.datastructures.AdjacencyMapGraph: Returns the vertices of edge e as an array of length two.
endVertices(Edge<E>) - Method in interface net.datastructures.Graph: Returns the vertices of edge e as an array of length two.
enqueue(E) - Method in class net.datastructures.ArrayQueue: Inserts an element at the rear of the queue.
enqueue(E) - Method in class net.datastructures.LinkedCircularQueue: Inserts an element at the rear of the queue.
enqueue(E) - Method in class net.datastructures.LinkedQueue: Inserts an element at the rear of the queue.
enqueue(E) - Method in interface net.datastructures.Queue: Inserts an element at the rear of the queue.
ensurePositive(int) - Method in class dsaj.design.ExceptionDemo
Entry<K,V> - Interface in net.datastructures: Interface for a key-value pair.
entrySet() - Method in class net.datastructures.ChainHashMap: Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class net.datastructures.ChainHashMapOld
entrySet() - Method in interface net.datastructures.Map: Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class net.datastructures.ProbeHashMap: Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class net.datastructures.SortedTableMap: Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class net.datastructures.TreeMap: Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class net.datastructures.UnsortedTableMap: Returns an iterable collection of all key-value entries of the map.
EnumDemo - Class in dsaj.primer: An example that uses an enumerated type.
EnumDemo() - Constructor for class dsaj.primer.EnumDemo
EnumDemo.Day - Enum in dsaj.primer
equals(Person) - Method in interface dsaj.design.Person
equals(Person) - Method in class dsaj.design.Student
equals(Object) - Method in class net.datastructures.SinglyLinkedList
evaluate() - Method in class dsaj.trees.ExpressionTree: Returns the numeric result of the expression.
Example - Class in dsaj.primer: A simple example class.
Example() - Constructor for class dsaj.primer.Example
ExceptionDemo - Class in dsaj.design
ExceptionDemo() - Constructor for class dsaj.design.ExceptionDemo
ExpressionTree - Class in dsaj.trees: An Arithmetic expression tree.
ExpressionTree(String, ExpressionTree, ExpressionTree) - Constructor for class dsaj.trees.ExpressionTree: Constructs an expression tree using the given operator at the root, and the given expression trees as subexpressions.
ExpressionTree(String) - Constructor for class dsaj.trees.ExpressionTree: Constructs an expression tree representing a single literal.

F

Factorial - Class in dsaj.recursion: Demonstration of recursive factorial function.
Factorial() - Constructor for class dsaj.recursion.Factorial
factorial(int) - Static method in class dsaj.recursion.Factorial: Computes the factorial of the given (nonnegative) integer)
FavoritesList<E> - Class in dsaj.lists: Maintains a list of elements ordered according to access frequency.
FavoritesList() - Constructor for class dsaj.lists.FavoritesList: Constructs initially empty favorites list.
FavoritesList.Item<E> - Class in dsaj.lists
FavoritesList.Item(E) - Constructor for class dsaj.lists.FavoritesList.Item: Constructs new item with initial count of zero.
FavoritesListMTF<E> - Class in dsaj.lists: Maintains a list of elements ordered with move-to-front heuristic.
FavoritesListMTF() - Constructor for class dsaj.lists.FavoritesListMTF
Fibonacci - Class in dsaj.recursion: Demonstration of two recursive approaches to computing Fibonacci numbers.
Fibonacci() - Constructor for class dsaj.recursion.Fibonacci
fibonacci(int) - Static method in class dsaj.recursion.Fibonacci: Don't call this (infinite) version.
fibonacciBad(int) - Static method in class dsaj.recursion.Fibonacci: Returns the nth Fibonacci number (inefficiently).
fibonacciGood(int) - Static method in class dsaj.recursion.Fibonacci: Returns array containing the pair of Fibonacci numbers, F(n) and F(n-1).
FibonacciProgression - Class in dsaj.design
FibonacciProgression() - Constructor for class dsaj.design.FibonacciProgression: Constructs traditional Fibonacci, starting 0, 1, 1, 2, 3, ...
FibonacciProgression(long, long) - Constructor for class dsaj.design.FibonacciProgression: Constructs generalized Fibonacci, with give first and second values.
figure14_11() - Static method in class net.datastructures.GraphExamples: Returns the unweighted, directed graph from Figure 14.11 of DSAJ6.
figure14_12() - Static method in class net.datastructures.GraphExamples: Returns the unweighted, directed graph from Figure 14.12 of DSAJ6.
figure14_14() - Static method in class net.datastructures.GraphExamples: Returns the weighted, undirected graph from Figure 14.14 of DSAJ6.
figure14_15() - Static method in class net.datastructures.GraphExamples: Returns the weighted, undirected graph from Figure 14.15 of DSAJ6.
figure14_3() - Static method in class net.datastructures.GraphExamples: Returns the unweighted, directed graph from Figure 14.3 of DSAJ6.
figure14_8() - Static method in class net.datastructures.GraphExamples: Returns the unweighted, directed graph from Figure 14.8 of DSAJ6.
figure14_9() - Static method in class net.datastructures.GraphExamples: Returns the unweighted, undirected graph from Figure 14.9 of DSAJ6.
figure_8_13 - Static variable in class dsaj.trees.TreeBuilder
figure_8_2 - Static variable in class dsaj.trees.TreeBuilder
figure_8_3 - Static variable in class dsaj.trees.TreeBuilder
figure_8_6 - Static variable in class dsaj.trees.TreeBuilder
find(Position<E>) - Method in class net.datastructures.Partition: Finds the cluster containing the element identified by Position p and returns the Position of the cluster's leader.
findBoyerMoore(char[], char[]) - Static method in class dsaj.text.PatternMatching: Returns the lowest index at which substring pattern begins in text (or else -1).
findBrute(char[], char[]) - Static method in class dsaj.text.PatternMatching: Returns the lowest index at which substring pattern begins in text (or else -1).
findKMP(char[], char[]) - Static method in class dsaj.text.PatternMatching: Returns the lowest index at which substring pattern begins in text (or else -1).
findPosition(E) - Method in class dsaj.lists.FavoritesList: Returns Position having element equal to e (or null if not found).
first() - Method in class net.datastructures.ArrayQueue: Returns, but does not remove, the first element of the queue.
first() - Method in class net.datastructures.CircularlyLinkedList: Returns (but does not remove) the first element of the list
first() - Method in interface net.datastructures.Deque: Returns (but does not remove) the first element of the deque.
first() - Method in class net.datastructures.DoublyLinkedList: Returns (but does not remove) the first element of the list.
first() - Method in class net.datastructures.LinkedCircularQueue: Returns, but does not remove, the first element of the queue.
first() - Method in class net.datastructures.LinkedDeque
first() - Method in class net.datastructures.LinkedPositionalList: Returns the first Position in the list.
first() - Method in class net.datastructures.LinkedQueue: Returns, but does not remove, the first element of the queue.
first() - Method in interface net.datastructures.PositionalList: Returns the first Position in the list.
first() - Method in interface net.datastructures.Queue: Returns, but does not remove, the first element of the queue.
first() - Method in class net.datastructures.SinglyLinkedList: Returns (but does not remove) the first element of the list
firstEntry() - Method in interface net.datastructures.SortedMap: Returns the entry having the least key (or null if map is empty).
firstEntry() - Method in class net.datastructures.SortedTableMap: Returns the entry having the least key (or null if map is empty).
firstEntry() - Method in class net.datastructures.TreeMap: Returns the entry having the least key (or null if map is empty).
floorEntry(K) - Method in interface net.datastructures.SortedMap: Returns the entry with greatest key less than or equal to given key (or null if no such key exists).
floorEntry(K) - Method in class net.datastructures.SortedTableMap: Returns the entry with greatest key less than or equal to given key (or null if no such key exists).
floorEntry(K) - Method in class net.datastructures.TreeMap: Returns the entry with greatest key less than or equal to given key (or null if no such key exists).

G

GameEntry - Class in dsaj.arrays
GameEntry(String, int) - Constructor for class dsaj.arrays.GameEntry: Constructs a game entry with given parameters..
GenericDemo - Class in dsaj.design
GenericDemo() - Constructor for class dsaj.design.GenericDemo
GeometricProgression - Class in dsaj.design
GeometricProgression() - Constructor for class dsaj.design.GeometricProgression: Constructs progression 1, 2, 4, 8, 16, ...
GeometricProgression(long) - Constructor for class dsaj.design.GeometricProgression: Constructs progression 1, b, b^2, b^3, b^4, ...
GeometricProgression(long, long) - Constructor for class dsaj.design.GeometricProgression: Constructs geometric progression with arbitrary base and start.
get(int) - Method in class dsaj.design.Portfolio
get(K) - Method in class net.datastructures.AbstractHashMap: Returns the value associated with the specified key, or null if no such entry exists.
get(int) - Method in class net.datastructures.ArrayList: Returns (but does not remove) the element at index i.
get(int) - Method in interface net.datastructures.List: Returns (but does not remove) the element at index i.
get(K) - Method in interface net.datastructures.Map: Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class net.datastructures.SortedTableMap: Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class net.datastructures.TreeMap: Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class net.datastructures.UnsortedTableMap: Returns the value associated with the specified key, or null if no such entry exists.
getAccount() - Method in class dsaj.primer.CreditCard: Return the account identifier.
getAge() - Method in interface dsaj.design.Person
getAge() - Method in class dsaj.design.Student
getAux() - Method in class net.datastructures.TreeMap.BalanceableBinaryTree.BSTNode
getAux(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree
getBalance() - Method in class dsaj.primer.CreditCard: Return the current balance.
getBank() - Method in class dsaj.primer.CreditCard: Returns the name of the bank
getChildren() - Method in class dsaj.trees.LinkedTree.Node
getCount() - Method in class dsaj.lists.FavoritesList.Item
getCount() - Method in class dsaj.primer.Counter: Returns the current count.
getCustomer() - Method in class dsaj.primer.CreditCard: Returns the name of the customer.
getEdge(Vertex<V>, Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Returns the edge from u to v, or null if they are not adjacent.
getEdge(Vertex<V>, Vertex<V>) - Method in interface net.datastructures.Graph: Returns the edge from u to v, or null if they are not adjacent.
getElement() - Method in class dsaj.trees.LinkedTree.Node
getElement() - Method in interface net.datastructures.Edge: Returns the element associated with the edge.
getElement() - Method in class net.datastructures.LinkedBinaryTree.Node
getElement() - Method in interface net.datastructures.Position: Returns the element stored at this position.
getElement() - Method in interface net.datastructures.Vertex: Returns the element associated with the vertex.
getFavorites(int) - Method in class dsaj.lists.FavoritesList: Returns an iterable collection of the k most frequently accessed elements.
getFavorites(int) - Method in class dsaj.lists.FavoritesListMTF: Returns an iterable collection of the k most frequently accessed elements.
getFirst() - Method in class dsaj.design.ObjectPair
getFirst() - Method in class dsaj.design.Pair
getID() - Method in class dsaj.design.Student
getIndex() - Method in class net.datastructures.HeapAdaptablePriorityQueue.AdaptablePQEntry
getInt() - Static method in class dsaj.primer.InputExample
getKey() - Method in class net.datastructures.AbstractMap.MapEntry
getKey() - Method in class net.datastructures.AbstractPriorityQueue.PQEntry
getKey() - Method in interface net.datastructures.Entry: Returns the key stored in this entry.
getLeft() - Method in class net.datastructures.LinkedBinaryTree.Node
getLimit() - Method in class dsaj.primer.CreditCard: Return the credit limit.
getName() - Method in class dsaj.arrays.GameEntry: Returns the name field.
getName() - Method in interface dsaj.design.Person
getName() - Method in class dsaj.design.Student
getName() - Method in class dsaj.primer.Gnome
getParent() - Method in class dsaj.trees.LinkedTree.Node
getParent() - Method in class net.datastructures.LinkedBinaryTree.Node
getRealName() - Method in class dsaj.primer.Gnome
getRight() - Method in class net.datastructures.LinkedBinaryTree.Node
getScore() - Method in class dsaj.arrays.GameEntry: Returns the score field.
getSecond() - Method in class dsaj.design.ObjectPair
getSecond() - Method in class dsaj.design.Pair
getValue() - Method in class dsaj.lists.FavoritesList.Item
getValue() - Method in class net.datastructures.AbstractMap.MapEntry
getValue() - Method in class net.datastructures.AbstractPriorityQueue.PQEntry
getValue() - Method in interface net.datastructures.Entry: Returns the value stored in this entry.
Gnome - Class in dsaj.primer: Another example of a Java class.
Gnome(String, int, Gnome, double) - Constructor for class dsaj.primer.Gnome
Gnome() - Constructor for class dsaj.primer.Gnome
gnomeBuddy - Variable in class dsaj.primer.Gnome
goodReset(Counter) - Static method in class dsaj.primer.CounterDemo
Graph<V,E> - Interface in net.datastructures: An interface for a graph structure.
GraphAlgorithms - Class in net.datastructures: A collection of graph algorithms.
GraphAlgorithms() - Constructor for class net.datastructures.GraphAlgorithms
GraphExamples - Class in net.datastructures: This class provides a utility to build a graph from a list of edges.
GraphExamples() - Constructor for class net.datastructures.GraphExamples
graphFromEdgelist(String[][], boolean) - Static method in class net.datastructures.GraphExamples: Constructs a graph from an array of array strings.

H

HashCode - Class in dsaj.maps
HashCode() - Constructor for class dsaj.maps.HashCode
hashCode() - Method in class net.datastructures.SinglyLinkedList
HashMultimap<K,V> - Class in dsaj.maps
HashMultimap() - Constructor for class dsaj.maps.HashMultimap: Constructs an empty multimap.
hasLeft(int) - Method in class net.datastructures.HeapPriorityQueue
hasRight(int) - Method in class net.datastructures.HeapPriorityQueue
heap - Variable in class net.datastructures.HeapPriorityQueue: primary collection of priority queue entries
HeapAdaptablePriorityQueue<K,V> - Class in net.datastructures: An implementation of an adaptable priority queue using an array-based heap.
HeapAdaptablePriorityQueue() - Constructor for class net.datastructures.HeapAdaptablePriorityQueue: Creates an empty adaptable priority queue using natural ordering of keys.
HeapAdaptablePriorityQueue(Comparator<K>) - Constructor for class net.datastructures.HeapAdaptablePriorityQueue: Creates an empty adaptable priority queue using the given comparator to order keys.
HeapAdaptablePriorityQueue.AdaptablePQEntry<K,V> - Class in net.datastructures: Extension of the PQEntry to include location information.
HeapAdaptablePriorityQueue.AdaptablePQEntry(K, V, int) - Constructor for class net.datastructures.HeapAdaptablePriorityQueue.AdaptablePQEntry
heapify() - Method in class net.datastructures.HeapPriorityQueue: Performs a bottom-up construction of the heap in linear time.
HeapPriorityQueue<K,V> - Class in net.datastructures: An implementation of a priority queue using an array-based heap.
HeapPriorityQueue() - Constructor for class net.datastructures.HeapPriorityQueue: Creates an empty priority queue based on the natural ordering of its keys.
HeapPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.HeapPriorityQueue: Creates an empty priority queue using the given comparator to order keys.
HeapPriorityQueue(K[], V[]) - Constructor for class net.datastructures.HeapPriorityQueue: Creates a priority queue initialized with the respective key-value pairs.
height - Variable in class dsaj.primer.Gnome
height(Position<E>) - Method in class net.datastructures.AbstractTree: Returns the height of the subtree rooted at Position p.
height(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Returns the height of the given tree position.
higherEntry(K) - Method in interface net.datastructures.SortedMap: Returns the entry with least key strictly greater than given key (or null if no such key exists).
higherEntry(K) - Method in class net.datastructures.SortedTableMap: Returns the entry with least key strictly greater than given key (or null if no such key exists).
higherEntry(K) - Method in class net.datastructures.TreeMap: Returns the entry with least key strictly greater than given key (or null if no such key exists).

I

incomingEdges(Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Returns an iterable collection of edges for which vertex v is the destination.
incomingEdges(Vertex<V>) - Method in interface net.datastructures.Graph: Returns an iterable collection of edges for which vertex v is the destination.
increment - Variable in class dsaj.design.ArithmeticProgression
increment() - Method in class dsaj.lists.FavoritesList.Item
increment() - Method in class dsaj.primer.Counter: Increments the count by one.
increment(int) - Method in class dsaj.primer.Counter: Increments the count by the specified delta.
inDegree(Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Returns the number of edges for which vertex v is the destination.
inDegree(Vertex<V>) - Method in interface net.datastructures.Graph: Returns the number of edges for which vertex v is the destination.
inorder() - Method in class net.datastructures.AbstractBinaryTree: Returns an iterable collection of positions of the tree, reported in inorder.
InputExample - Class in dsaj.primer
InputExample() - Constructor for class dsaj.primer.InputExample
insert(K, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Inserts a key-value pair and return the entry created.
insert(K, V) - Method in class net.datastructures.HeapPriorityQueue: Inserts a key-value pair and return the entry created.
insert(K, V) - Method in interface net.datastructures.PriorityQueue: Inserts a key-value pair and returns the entry created.
insert(K, V) - Method in class net.datastructures.SortedPriorityQueue: Inserts a key-value pair and returns the entry created.
insert(K, V) - Method in class net.datastructures.UnsortedPriorityQueue: Inserts a key-value pair and returns the entry created.
insertEdge(Vertex<V>, Vertex<V>, E) - Method in class net.datastructures.AdjacencyMapGraph: Inserts and returns a new edge between vertices u and v, storing given element.
insertEdge(Vertex<V>, Vertex<V>, E) - Method in interface net.datastructures.Graph: Inserts and returns a new edge between vertices u and v, storing given element.
InsertionSort - Class in dsaj.arrays
InsertionSort() - Constructor for class dsaj.arrays.InsertionSort
insertionSort(char[]) - Static method in class dsaj.arrays.InsertionSort: Insertion-sort of an array of characters into nondecreasing order
InsertionSort - Class in dsaj.lists
InsertionSort() - Constructor for class dsaj.lists.InsertionSort
insertionSort(PositionalList<Integer>) - Static method in class dsaj.lists.InsertionSort: Insertion-sort of a positional list of integers into nondecreasing order
insertVertex(V) - Method in class net.datastructures.AdjacencyMapGraph: Inserts and returns a new vertex with the given element.
insertVertex(V) - Method in interface net.datastructures.Graph: Inserts and returns a new vertex with the given element.
Insurable - Interface in dsaj.design
insuredValue() - Method in class dsaj.design.BoxedItem
insuredValue() - Method in class dsaj.design.BoxedItem2
insuredValue() - Method in interface dsaj.design.Insurable: Returns insured value in cents
isBalanced(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Returns whether a position has balance factor between -1 and 1 inclusive.
isColor() - Method in class dsaj.design.Photograph
isEmpty() - Method in class dsaj.lists.FavoritesList: Returns true if the favorites list is empty.
isEmpty() - Method in class dsaj.maps.HashMultimap: Returns whether the multimap is empty.
isEmpty() - Method in class net.datastructures.AbstractMap: Tests whether the map is empty.
isEmpty() - Method in class net.datastructures.AbstractPriorityQueue: Tests whether the priority queue is empty.
isEmpty() - Method in class net.datastructures.AbstractTree: Tests whether the tree is empty.
isEmpty() - Method in class net.datastructures.ArrayList: Tests whether the array list is empty.
isEmpty() - Method in class net.datastructures.ArrayQueue: Tests whether the queue is empty.
isEmpty() - Method in class net.datastructures.ArrayStack: Tests whether the stack is empty.
isEmpty() - Method in class net.datastructures.CircularlyLinkedList: Tests whether the linked list is empty.
isEmpty() - Method in interface net.datastructures.Deque: Tests whether the deque is empty.
isEmpty() - Method in class net.datastructures.DoublyLinkedList: Tests whether the linked list is empty.
isEmpty() - Method in class net.datastructures.LinkedCircularQueue: Tests whether the queue is empty.
isEmpty() - Method in class net.datastructures.LinkedDeque
isEmpty() - Method in class net.datastructures.LinkedPositionalList: Tests whether the list is empty.
isEmpty() - Method in class net.datastructures.LinkedQueue: Tests whether the queue is empty.
isEmpty() - Method in class net.datastructures.LinkedStack: Tests whether the stack is empty.
isEmpty() - Method in interface net.datastructures.List: Tests whether the list is empty.
isEmpty() - Method in interface net.datastructures.Map: Tests whether the map is empty.
isEmpty() - Method in interface net.datastructures.PositionalList: Tests whether the list is empty.
isEmpty() - Method in interface net.datastructures.PriorityQueue: Tests whether the priority queue is empty.
isEmpty() - Method in interface net.datastructures.Queue: Tests whether the queue is empty.
isEmpty() - Method in class net.datastructures.SinglyLinkedList: Tests whether the linked list is empty.
isEmpty() - Method in interface net.datastructures.Stack: Tests whether the stack is empty.
isEmpty() - Method in interface net.datastructures.Tree: Tests whether the tree is empty.
isExternal(Position<E>) - Method in class net.datastructures.AbstractTree: Returns true if Position p does not have any children.
isExternal(Position<E>) - Method in interface net.datastructures.Tree: Returns true if Position p does not have any children.
isExternal(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
isHazardous() - Method in class dsaj.design.BoxedItem
isHazardous() - Method in class dsaj.design.BoxedItem2
isHazardous() - Method in interface dsaj.design.Transportable: Returns whether the object is hazardous.
isHTMLMatched(String) - Static method in class dsaj.stacks.MatchHTML: Tests if every opening tag has a matching closing tag in HTML string.
isInternal(Position<E>) - Method in class net.datastructures.AbstractTree: Returns true if Position p has one or more children.
isInternal(Position<E>) - Method in interface net.datastructures.Tree: Returns true if Position p has one or more children.
isInternal(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
isMagical() - Method in class dsaj.primer.Gnome
isMatched(String) - Static method in class dsaj.stacks.MatchDelimiters: Tests if delimiters in the given expression are properly matched.
isRoot(Position<E>) - Method in class net.datastructures.AbstractTree: Returns true if Position p represents the root of the tree.
isRoot(Position<E>) - Method in interface net.datastructures.Tree: Returns true if Position p represents the root of the tree.
isRoot(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
isWin(int) - Method in class dsaj.arrays.TicTacToe: Checks whether the board configuration is a win for the given player.
iterator() - Method in class net.datastructures.AbstractTree: Returns an iterator of the elements stored in the tree.
iterator() - Method in class net.datastructures.ArrayList: Returns an iterator of the elements stored in the list.
iterator() - Method in class net.datastructures.LinkedPositionalList: Returns an iterator of the elements stored in the list.
iterator() - Method in interface net.datastructures.List: Returns an iterator of the elements stored in the list.
iterator() - Method in interface net.datastructures.PositionalList: Returns an iterator of the elements stored in the list.
iterator() - Method in interface net.datastructures.Tree: Returns an iterator of the elements stored in the tree.
IteratorDemo - Class in dsaj.lists
IteratorDemo() - Constructor for class dsaj.lists.IteratorDemo

J

Josephus - Class in dsaj.queues
Josephus() - Constructor for class dsaj.queues.Josephus
Josephus(CircularQueue<E>, int) - Static method in class dsaj.queues.Josephus: Computes the winner of the Josephus problem using a circular queue.
junk() - Method in class dsaj.primer.ArrayFragments

K

keySet() - Method in class net.datastructures.AbstractMap: Returns an iterable collection of the keys contained in the map.
keySet() - Method in interface net.datastructures.Map: Returns an iterable collection of the keys contained in the map.

L

last() - Method in class net.datastructures.CircularlyLinkedList: Returns (but does not remove) the last element of the list
last() - Method in interface net.datastructures.Deque: Returns (but does not remove) the last element of the deque.
last() - Method in class net.datastructures.DoublyLinkedList: Returns (but does not remove) the last element of the list.
last() - Method in class net.datastructures.LinkedDeque
last() - Method in class net.datastructures.LinkedPositionalList: Returns the last Position in the list.
last() - Method in interface net.datastructures.PositionalList: Returns the last Position in the list.
last() - Method in class net.datastructures.SinglyLinkedList: Returns (but does not remove) the last element of the list.
lastEntry() - Method in interface net.datastructures.SortedMap: Returns the entry having the greatest key (or null if map is empty).
lastEntry() - Method in class net.datastructures.SortedTableMap: Returns the entry having the greatest key (or null if map is empty).
lastEntry() - Method in class net.datastructures.TreeMap: Returns the entry having the greatest key (or null if map is empty).
layout(BinaryTree<E>, Position<E>, int, int) - Static method in class dsaj.trees.TraversalExamples: Defines geometry for an inorder layout of subtree of a binary tree.
layoutFake(BinaryTree<E>, Position<E>, int, int) - Static method in class dsaj.trees.TraversalExamples
LCS - Class in dsaj.text
LCS() - Constructor for class dsaj.text.LCS
LCS(char[], char[]) - Static method in class dsaj.text.LCS: Returns table such that L[j][k] is length of LCS for X[0..j-1] and Y[0..k-1].
left(Position<E>) - Method in interface net.datastructures.BinaryTree: Returns the Position of p's left child (or null if no child exists).
left(int) - Method in class net.datastructures.HeapPriorityQueue
left(Position<E>) - Method in class net.datastructures.LinkedBinaryTree: Returns the Position of p's left child (or null if no child exists).
left(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
linearSum(int[], int) - Static method in class dsaj.recursion.ArraySum: Returns the sum of the first n integers of the given array.
LinkedBinaryTree<E> - Class in net.datastructures: Concrete implementation of a binary tree using a node-based, linked structure.
LinkedBinaryTree() - Constructor for class net.datastructures.LinkedBinaryTree: Construts an empty binary tree.
LinkedBinaryTree.Node<E> - Class in net.datastructures: Nested static class for a binary tree node.
LinkedBinaryTree.Node(E, LinkedBinaryTree.Node<E>, LinkedBinaryTree.Node<E>, LinkedBinaryTree.Node<E>) - Constructor for class net.datastructures.LinkedBinaryTree.Node: Constructs a node with the given element and neighbors.
LinkedCircularQueue<E> - Class in net.datastructures: Realization of a circular FIFO queue as an adaptation of a CircularlyLinkedList.
LinkedCircularQueue() - Constructor for class net.datastructures.LinkedCircularQueue: Creates an empty queue.
LinkedDeque<E> - Class in net.datastructures: Realization of a double-ended queue (deque) as an adaptation of a DoublyLinkedList.
LinkedDeque() - Constructor for class net.datastructures.LinkedDeque: Creates an empty deque.
LinkedPositionalList<E> - Class in net.datastructures: Implementation of a positional list stored as a doubly linked list.
LinkedPositionalList() - Constructor for class net.datastructures.LinkedPositionalList: Constructs a new empty list.
LinkedQueue<E> - Class in net.datastructures: Realization of a FIFO queue as an adaptation of a SinglyLinkedList.
LinkedQueue() - Constructor for class net.datastructures.LinkedQueue: Constructs an initially empty queue.
LinkedStack<E> - Class in net.datastructures: Realization of a stack as an adaptation of a SinglyLinkedList.
LinkedStack() - Constructor for class net.datastructures.LinkedStack: Constructs an initially empty stack.
LinkedTree<E> - Class in dsaj.trees
LinkedTree() - Constructor for class dsaj.trees.LinkedTree
LinkedTree.Node<E> - Class in dsaj.trees
LinkedTree.Node(E, LinkedTree.Node<E>) - Constructor for class dsaj.trees.LinkedTree.Node
List<E> - Interface in net.datastructures: A simplified version of the java.util.List interface.
listPrice() - Method in class dsaj.design.BoxedItem
listPrice() - Method in class dsaj.design.BoxedItem2
listPrice() - Method in class dsaj.design.Photograph
listPrice() - Method in interface dsaj.design.Sellable: Returns the list price in cents.
loadIntFromFile2(String) - Method in class dsaj.design.ExceptionDemo
loadIntFromFile3(String) - Method in class dsaj.design.ExceptionDemo
local() - Method in class dsaj.arrays.ArrayTest
lowerEntry(K) - Method in interface net.datastructures.SortedMap: Returns the entry with greatest key strictly less than given key (or null if no such key exists).
lowerEntry(K) - Method in class net.datastructures.SortedTableMap: Returns the entry with greatest key strictly less than given key (or null if no such key exists).
lowerEntry(K) - Method in class net.datastructures.TreeMap: Returns the entry with greatest key strictly less than given key (or null if no such key exists).
lowestPrice() - Method in class dsaj.design.BoxedItem
lowestPrice() - Method in class dsaj.design.BoxedItem2
lowestPrice() - Method in class dsaj.design.Photograph
lowestPrice() - Method in interface dsaj.design.Sellable: Returns the lowest price in cents we will accept.

M

main(String[]) - Static method in class dsaj.arrays.ArrayTest
main(String[]) - Static method in class dsaj.arrays.Caesar: Simple main method for testing the Caesar cipher
main(String[]) - Static method in class dsaj.arrays.CaesarCipher: Simple main method for testing the Caesar cipher
main(String[]) - Static method in class dsaj.arrays.DeepClone
main(String[]) - Static method in class dsaj.arrays.InsertionSort
main(String[]) - Static method in class dsaj.arrays.Scoreboard
main(String[]) - Static method in class dsaj.arrays.TicTacToe: Test run of a simple game
main(String[]) - Static method in class dsaj.asymptotics.StringExperiment: Tests the two versions of the 'repeat' algorithm, doubling the size of n each trial, beginning with the given start value.
main(String[]) - Static method in class dsaj.design.Demonstration
main(String[]) - Static method in class dsaj.design.ExceptionDemo
main(String[]) - Static method in class dsaj.design.Maryland
main(String[]) - Static method in class dsaj.design.ObjectPair
main(String[]) - Static method in class dsaj.design.Pair
main(String[]) - Static method in class dsaj.design.PredatoryCreditCard
main(String[]) - Static method in class dsaj.design.TestProgression
main(String[]) - Static method in class dsaj.lists.FavoritesList
main(String[]) - Static method in class dsaj.lists.FavoritesListMTF
main(String[]) - Static method in class dsaj.lists.InsertionSort
main(String[]) - Static method in class dsaj.lists.IteratorDemo
main(String[]) - Static method in class dsaj.maps.CostPerformanceDatabase
main(String[]) - Static method in class dsaj.maps.HashCode
main(String[]) - Static method in class dsaj.maps.HashMultimap
main(String[]) - Static method in class dsaj.maps.WordCount
main(String[]) - Static method in class dsaj.pq.StringLengthComparator
main(String[]) - Static method in class dsaj.primer.ArrayScale
main(String[]) - Static method in class dsaj.primer.CounterDemo
main(String[]) - Static method in class dsaj.primer.CreditCard
main(String[]) - Static method in class dsaj.primer.EnumDemo
main(String[]) - Static method in class dsaj.primer.Example
main(String[]) - Static method in class dsaj.primer.InputExample
main(String[]) - Static method in class dsaj.primer.PrimitiveDemo
main(String[]) - Static method in class dsaj.primer.Universe
main(String[]) - Static method in class dsaj.primer.WrapperDemo
main(String[]) - Static method in class dsaj.queues.Josephus: Tester method
main(String[]) - Static method in class dsaj.recursion.ArraySum
main(String[]) - Static method in class dsaj.recursion.BinarySearch: Simple test, assuming valid integer given as command-line argument
main(String[]) - Static method in class dsaj.recursion.DiskSpace: Computes disk usage of the path given as a command line argument.
main(String[]) - Static method in class dsaj.recursion.Factorial: Simple test, assuming valid integer given as command-line argument
main(String[]) - Static method in class dsaj.recursion.Fibonacci
main(String[]) - Static method in class dsaj.recursion.Power
main(String[]) - Static method in class dsaj.recursion.Ruler: Draws sample rulers with various parameters.
main(String[]) - Static method in class dsaj.stacks.MatchDelimiters
main(String[]) - Static method in class dsaj.stacks.MatchHTML: Test the text given as standard input as html.
main(String[]) - Static method in class dsaj.stacks.ReverseWithStack: Tester routine for reversing arrays
main(String[]) - Static method in class dsaj.text.LCS
main(String[]) - Static method in class dsaj.text.MatrixChain
main(String[]) - Static method in class dsaj.text.PatternMatching
main(String[]) - Static method in class dsaj.trees.ExpressionTree
main(String[]) - Static method in class dsaj.trees.TraversalExamples
main(String[]) - Static method in class dsaj.trees.TreeBuilder
main(String[]) - Static method in class net.datastructures.ArrayList
main(String[]) - Static method in class net.datastructures.ArrayStack: Demonstrates sample usage of a stack.
main(String[]) - Static method in class net.datastructures.GraphAlgorithms
main(String[]) - Static method in class net.datastructures.GraphExamples
main(String[]) - Static method in class net.datastructures.HeapPriorityQueue
main(String[]) - Static method in class net.datastructures.LinkedPositionalList
main(String[]) - Static method in class net.datastructures.SinglyLinkedList
makeCluster(E) - Method in class net.datastructures.Partition: Makes a new cluster containing element e and returns its position.
makeKing(Gnome) - Static method in class dsaj.primer.Gnome
makeMeKing() - Method in class dsaj.primer.Gnome
makePayment(double) - Method in class dsaj.primer.CreditCard: Processes customer payment that reduces balance.
Map<K,V> - Interface in net.datastructures: An interface for an associative map which binds a key uniquely to a value.
Maryland - Class in dsaj.design
MatchDelimiters - Class in dsaj.stacks: Simplified test of matching delimiters in a string.
MatchDelimiters() - Constructor for class dsaj.stacks.MatchDelimiters
MatchHTML - Class in dsaj.stacks: Simplified test of matching tags in an HTML document.
MatchHTML() - Constructor for class dsaj.stacks.MatchHTML
MatrixChain - Class in dsaj.text
MatrixChain() - Constructor for class dsaj.text.MatrixChain
matrixChain(int[]) - Static method in class dsaj.text.MatrixChain: Returns an n-by-n matrix such that N[i][j] represents the minimum number of multiplications to compute the product of matrix chain product Ai through Aj inclusive.
max(double[]) - Static method in class dsaj.primer.ArrayMax: Returns the maximum value within a nonempty array of doubles.
MAX_HEIGHT - Static variable in class dsaj.primer.Gnome
min() - Method in class net.datastructures.HeapPriorityQueue: Returns (but does not remove) an entry with minimal key.
min() - Method in interface net.datastructures.PriorityQueue: Returns (but does not remove) an entry with minimal key.
min() - Method in class net.datastructures.SortedPriorityQueue: Returns (but does not remove) an entry with minimal key.
min() - Method in class net.datastructures.UnsortedPriorityQueue: Returns (but does not remove) an entry with minimal key.
moveUp(Position<FavoritesList.Item<E>>) - Method in class dsaj.lists.FavoritesList: Moves item at Position p earlier in the list based on access count.
moveUp(Position<FavoritesList.Item<E>>) - Method in class dsaj.lists.FavoritesListMTF: Moves accessed item at Position p to the front of the list.
MST(Graph<V, Integer>) - Static method in class net.datastructures.GraphAlgorithms: Computes a minimum spanning tree of connected, weighted graph g using Kruskal's algorithm.
MSTPrimJarnik(Graph<V, Integer>) - Static method in class net.datastructures.GraphAlgorithms: Computes a minimum spanning tree of connected, weighted graph g using Prim-Jarnik algorithm.

N

n - Variable in class net.datastructures.AbstractHashMap
net.datastructures - package net.datastructures
nextValue() - Method in class dsaj.design.AbstractProgression: Returns the next value of the progression.
nextValue() - Method in class dsaj.design.Progression: Returns the next value of the progression.
numChildren(Position<E>) - Method in class dsaj.trees.LinkedTree
numChildren(Position<E>) - Method in class net.datastructures.AbstractBinaryTree: Returns the number of children of Position p.
numChildren(Position<E>) - Method in class net.datastructures.AbstractTree: Returns the number of children of Position p.
numChildren(Position<E>) - Method in interface net.datastructures.Tree: Returns the number of children of Position p.
numEdges() - Method in class net.datastructures.AdjacencyMapGraph: Returns the number of edges of the graph
numEdges() - Method in interface net.datastructures.Graph: Returns the number of edges of the graph
numVertices() - Method in class net.datastructures.AdjacencyMapGraph: Returns the number of vertices of the graph
numVertices() - Method in interface net.datastructures.Graph: Returns the number of vertices of the graph

O

O - Static variable in class dsaj.arrays.TicTacToe
ObjectPair - Class in dsaj.design
ObjectPair(Object, Object) - Constructor for class dsaj.design.ObjectPair
opposite(Vertex<V>, Edge<E>) - Method in class net.datastructures.AdjacencyMapGraph: Returns the vertex that is opposite vertex v on edge e.
opposite(Vertex<V>, Edge<E>) - Method in interface net.datastructures.Graph: Returns the vertex that is opposite vertex v on edge e.
outDegree(Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Returns the number of edges for which vertex v is the origin.
outDegree(Vertex<V>) - Method in interface net.datastructures.Graph: Returns the number of edges leaving vertex v.
outgoingEdges(Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Returns an iterable collection of edges for which vertex v is the origin.
outgoingEdges(Vertex<V>) - Method in interface net.datastructures.Graph: Returns an iterable collection of edges for which vertex v is the origin.

P

Pair<A,B> - Class in dsaj.design
Pair(A, B) - Constructor for class dsaj.design.Pair
parent(Position<E>) - Method in class dsaj.trees.LinkedTree
parent(int) - Method in class net.datastructures.HeapPriorityQueue
parent(Position<E>) - Method in class net.datastructures.LinkedBinaryTree: Returns the Position of p's parent (or null if p is root).
parent(Position<E>) - Method in interface net.datastructures.Tree: Returns the Position of p's parent (or null if p is root).
parent(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
parenthesize(Tree<E>, Position<E>) - Static method in class dsaj.trees.TraversalExamples: Prints parenthesized representation of subtree of T rooted at p.
parseExpression(String) - Static method in class dsaj.trees.ExpressionTree: Returns an expression tree corresponding to a fully-parenthesized string, such as "(((3+1)*4)/((9-5)+2))
Partition<E> - Class in net.datastructures: A Union-Find structure for maintaining disjoint sets.
Partition() - Constructor for class net.datastructures.Partition
PatternMatching - Class in dsaj.text
PatternMatching() - Constructor for class dsaj.text.PatternMatching
Person - Interface in dsaj.design
Photograph - Class in dsaj.design: Class for photographs that can be sold.
Photograph(String, int, boolean) - Constructor for class dsaj.design.Photograph
pop() - Method in class net.datastructures.ArrayStack: Removes and returns the top element from the stack.
pop() - Method in class net.datastructures.LinkedStack: Removes and returns the top element from the stack.
pop() - Method in interface net.datastructures.Stack: Removes and returns the top element from the stack.
Portfolio<T> - Class in dsaj.design
Portfolio(int) - Constructor for class dsaj.design.Portfolio
Position<E> - Interface in net.datastructures: An interface for a position which is an abstraction for the location at which a single element is stored in a positional container.
PositionalList<E> - Interface in net.datastructures: An interface for positional lists.
positions() - Method in class net.datastructures.AbstractBinaryTree: Returns an iterable collection of the positions of the tree using inorder traversal
positions() - Method in class net.datastructures.AbstractTree: Returns an iterable collection of the positions of the tree.
positions() - Method in class net.datastructures.LinkedPositionalList: Returns an iterable representation of the list's positions.
positions() - Method in interface net.datastructures.PositionalList: Returns the positions of the list in iterable form from first to last.
positions() - Method in interface net.datastructures.Tree: Returns an iterable collection of the positions of the tree.
postorder() - Method in class net.datastructures.AbstractTree: Returns an iterable collection of positions of the tree, reported in postorder.
Power - Class in dsaj.recursion: Demonstration of the more efficient method for computing the power function.
Power() - Constructor for class dsaj.recursion.Power
power(double, int) - Static method in class dsaj.recursion.Power: Computes the value of x raised to the nth power, for nonnegative integer n.
PQSort - Class in dsaj.pq
PQSort() - Constructor for class dsaj.pq.PQSort
pqSort(PositionalList<E>, PriorityQueue<E, ?>) - Static method in class dsaj.pq.PQSort: Sorts sequence S, using initially empty priority queue P to produce the order.
PredatoryCreditCard - Class in dsaj.design
PredatoryCreditCard(String, String, String, int, double, double) - Constructor for class dsaj.design.PredatoryCreditCard: Constructs a new credit card instance.
preorder() - Method in class net.datastructures.AbstractTree: Returns an iterable collection of positions of the tree, reported in preorder.
prev - Variable in class dsaj.design.FibonacciProgression
PrimitiveDemo - Class in dsaj.primer: A demonstration of primitive types.
PrimitiveDemo() - Constructor for class dsaj.primer.PrimitiveDemo
print(double[]) - Static method in class dsaj.primer.ArrayScale
printMe() - Method in class dsaj.design.Maryland
printPreorder(AbstractTree<E>) - Static method in class dsaj.trees.TraversalExamples
printPreorderIndent(Tree<E>, Position<E>, int) - Static method in class dsaj.trees.TraversalExamples: Prints preorder representation of subtree of T rooted at p having depth d.
printPreorderIndentSlow(AbstractTree<E>) - Static method in class dsaj.trees.TraversalExamples
printPreorderLabeled(Tree<E>, Position<E>, ArrayList<Integer>) - Static method in class dsaj.trees.TraversalExamples: Prints labeled representation of subtree of T rooted at p having depth d.
printProgression(int) - Method in class dsaj.design.AbstractProgression: Utility that prints the next n values of the progression.
printProgression(int) - Method in class dsaj.design.Progression: Prints the next n values of the progression, separated by spaces.
printSummary(CreditCard) - Static method in class dsaj.primer.CreditCard
PriorityQueue<K,V> - Interface in net.datastructures: Interface for the priority queue ADT.
ProbeHashMap<K,V> - Class in net.datastructures
ProbeHashMap() - Constructor for class net.datastructures.ProbeHashMap: Creates a hash table with capacity 17 and prime factor 109345121.
ProbeHashMap(int) - Constructor for class net.datastructures.ProbeHashMap: Creates a hash table with given capacity and prime factor 109345121.
ProbeHashMap(int, int) - Constructor for class net.datastructures.ProbeHashMap: Creates a hash table with the given capacity and prime factor.
processMonth() - Method in class dsaj.design.PredatoryCreditCard: Assess monthly interest on any outstanding balance.
Progression - Class in dsaj.design: Generates a simple progression.
Progression() - Constructor for class dsaj.design.Progression: Constructs a progression starting at zero.
Progression(long) - Constructor for class dsaj.design.Progression: Constructs a progression with given start value.
pruneSubtree(Position<E>) - Method in class dsaj.trees.LinkedTree
push(E) - Method in class net.datastructures.ArrayStack: Inserts an element at the top of the stack.
push(E) - Method in class net.datastructures.LinkedStack: Inserts an element at the top of the stack.
push(E) - Method in interface net.datastructures.Stack: Inserts an element at the top of the stack.
put(K, V) - Method in class net.datastructures.AbstractHashMap: Associates the given value with the given key.
put(K, V) - Method in interface net.datastructures.Map: Associates the given value with the given key.
put(K, V) - Method in class net.datastructures.SortedTableMap: Associates the given value with the given key.
put(K, V) - Method in class net.datastructures.TreeMap: Associates the given value with the given key.
put(K, V) - Method in class net.datastructures.UnsortedTableMap: Associates the given value with the given key.
putMark(int, int) - Method in class dsaj.arrays.TicTacToe: Puts an X or O mark at position i,j.

Q

Queue<E> - Interface in net.datastructures: Interface for a queue: a collection of elements that are inserted and removed according to the first-in first-out principle.

R

RBTreeMap<K,V> - Class in net.datastructures: An implementation of a sorted map using a red-black tree.
RBTreeMap() - Constructor for class net.datastructures.RBTreeMap: Constructs an empty map using the natural ordering of keys.
RBTreeMap(Comparator<K>) - Constructor for class net.datastructures.RBTreeMap: Constructs an empty map using the given comparator to order keys.
rebalance(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Utility used to rebalance after an insert or removal operation.
rebalanceAccess(Position<Entry<K, V>>) - Method in class net.datastructures.SplayTreeMap: Overrides the TreeMap rebalancing hook that is called after a node access.
rebalanceAccess(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap: Rebalances the tree after an access of specified position.
rebalanceDelete(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Overrides the TreeMap rebalancing hook that is called after a deletion.
rebalanceDelete(Position<Entry<K, V>>) - Method in class net.datastructures.RBTreeMap: Overrides the TreeMap rebalancing hook that is called after a deletion.
rebalanceDelete(Position<Entry<K, V>>) - Method in class net.datastructures.SplayTreeMap: Overrides the TreeMap rebalancing hook that is called after a deletion.
rebalanceDelete(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap: Rebalances the tree after a child of specified position has been removed.
rebalanceInsert(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Overrides the TreeMap rebalancing hook that is called after an insertion.
rebalanceInsert(Position<Entry<K, V>>) - Method in class net.datastructures.RBTreeMap: Overrides the TreeMap rebalancing hook that is called after an insertion.
rebalanceInsert(Position<Entry<K, V>>) - Method in class net.datastructures.SplayTreeMap: Overrides the TreeMap rebalancing hook that is called after an insertion.
rebalanceInsert(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap: Rebalances the tree after an insertion of specified position.
recomputeHeight(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Recomputes the height of the given position based on its children's heights.
reconstructLCS(char[], char[], int[][]) - Static method in class dsaj.text.LCS: Returns the longest common substring of X and Y, given LCS table L.
remove(int) - Method in class dsaj.arrays.Scoreboard: Remove and return the high score at index i.
remove(E) - Method in class dsaj.lists.FavoritesList: Removes element equal to e from the list of favorites (if found).
remove(K) - Method in class net.datastructures.AbstractHashMap: Removes the entry with the specified key, if present, and returns its associated value.
remove(Entry<K, V>) - Method in interface net.datastructures.AdaptablePriorityQueue: Removes the given entry from the priority queue.
remove(int) - Method in class net.datastructures.ArrayList: Removes and returns the element at the given index, shifting all subsequent elements in the list one position closer to the front.
remove(Entry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Removes the given entry from the priority queue.
remove(Position<E>) - Method in class net.datastructures.LinkedBinaryTree: Removes the node at Position p and replaces it with its child, if any.
remove(Position<E>) - Method in class net.datastructures.LinkedPositionalList: Removes the element stored at the given Position and returns it.
remove(int) - Method in interface net.datastructures.List: Removes and returns the element at the given index, shifting all subsequent elements in the list one position closer to the front.
remove(K) - Method in interface net.datastructures.Map: Removes the entry with the specified key, if present, and returns its associated value.
remove(Position<E>) - Method in interface net.datastructures.PositionalList: Removes the element stored at the given Position and returns it.
remove(K) - Method in class net.datastructures.SortedTableMap: Removes the entry with the specified key, if present, and returns its associated value.
remove(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
remove(K) - Method in class net.datastructures.TreeMap: Removes the entry with the specified key, if present, and returns its associated value.
remove(K) - Method in class net.datastructures.UnsortedTableMap: Removes the entry with the specified key, if present, and returns its value.
removeEdge(Edge<E>) - Method in class net.datastructures.AdjacencyMapGraph
removeEdge(Edge<E>) - Method in interface net.datastructures.Graph: Removes an edge from the graph.
removeFirst() - Method in class net.datastructures.CircularlyLinkedList: Removes and returns the first element of the list.
removeFirst() - Method in interface net.datastructures.Deque: Removes and returns the first element of the deque.
removeFirst() - Method in class net.datastructures.DoublyLinkedList: Removes and returns the first element of the list.
removeFirst() - Method in class net.datastructures.LinkedDeque
removeFirst() - Method in class net.datastructures.SinglyLinkedList: Removes and returns the first element of the list.
removeLast() - Method in interface net.datastructures.Deque: Removes and returns the last element of the deque.
removeLast() - Method in class net.datastructures.DoublyLinkedList: Removes and returns the last element of the list.
removeLast() - Method in class net.datastructures.LinkedDeque
removeMin() - Method in class net.datastructures.HeapPriorityQueue: Removes and returns an entry with minimal key.
removeMin() - Method in interface net.datastructures.PriorityQueue: Removes and returns an entry with minimal key.
removeMin() - Method in class net.datastructures.SortedPriorityQueue: Removes and returns an entry with minimal key.
removeMin() - Method in class net.datastructures.UnsortedPriorityQueue: Removes and returns an entry with minimal key.
removeVertex(Vertex<V>) - Method in class net.datastructures.AdjacencyMapGraph: Removes a vertex and all its incident edges from the graph.
removeVertex(Vertex<V>) - Method in interface net.datastructures.Graph: Removes a vertex and all its incident edges from the graph.
renameGnome(String) - Method in class dsaj.primer.Gnome
repeat1(char, int) - Static method in class dsaj.asymptotics.StringExperiment: Uses repeated concatenation to compose a String with n copies of character c.
repeat2(char, int) - Static method in class dsaj.asymptotics.StringExperiment: Uses StringBuilder to compose a String with n copies of character c.
replaceKey(Entry<K, V>, K) - Method in interface net.datastructures.AdaptablePriorityQueue: Replaces the key of an entry.
replaceKey(Entry<K, V>, K) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Replaces the key of an entry.
replaceValue(Entry<K, V>, V) - Method in interface net.datastructures.AdaptablePriorityQueue: Replaces the value of an entry.
replaceValue(Entry<K, V>, V) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Replaces the value of an entry.
reset() - Method in class dsaj.primer.Counter: Returns the count to zero.
resize(int) - Method in class net.datastructures.ArrayList: Resizes internal array to have given capacity >= size.
restructure(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree: Returns the Position that becomes the root of the restructured subtree.
restructure(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
reverse(T[]) - Static method in class dsaj.design.GenericDemo
reverse(E[]) - Static method in class dsaj.stacks.ReverseWithStack: A generic method for reversing an array.
reverseArray(int[], int, int) - Static method in class dsaj.recursion.ArrayReverse: Reverses the contents of subarray data[low] through data[high] inclusive.
reverseIterative(int[]) - Static method in class dsaj.recursion.ArrayReverse: Reverses the contents of the given array.
ReverseWithStack - Class in dsaj.stacks
ReverseWithStack() - Constructor for class dsaj.stacks.ReverseWithStack
right(Position<E>) - Method in interface net.datastructures.BinaryTree: Returns the Position of p's right child (or null if no child exists).
right(int) - Method in class net.datastructures.HeapPriorityQueue
right(Position<E>) - Method in class net.datastructures.LinkedBinaryTree: Returns the Position of p's right child (or null if no child exists).
right(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
Robot - Class in dsaj.primer: An example of nested conditional statements
Robot() - Constructor for class dsaj.primer.Robot
root() - Method in class dsaj.trees.LinkedTree
root - Variable in class net.datastructures.LinkedBinaryTree: The root of the binary tree
root() - Method in class net.datastructures.LinkedBinaryTree: Returns the root Position of the tree (or null if tree is empty).
root() - Method in interface net.datastructures.Tree: Returns the root Position of the tree (or null if tree is empty).
root() - Method in class net.datastructures.TreeMap
rotate() - Method in class net.datastructures.CircularlyLinkedList: Rotate the first element to the back of the list.
rotate() - Method in interface net.datastructures.CircularQueue: Rotates the front element of the queue to the back of the queue.
rotate() - Method in class net.datastructures.LinkedCircularQueue: Rotates the front element of the queue to the back of the queue.
rotate(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree: Rotates Position p above its parent.
rotate(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
Ruler - Class in dsaj.recursion: Provides support for drawing an English ruler.
Ruler() - Constructor for class dsaj.recursion.Ruler

S

scaleBad(double[], double) - Static method in class dsaj.primer.ArrayScale
scaleGood(double[], double) - Static method in class dsaj.primer.ArrayScale
Scoreboard - Class in dsaj.arrays: Class for storing high scores in an array in nondecreasing order.
Scoreboard(int) - Constructor for class dsaj.arrays.Scoreboard: Constructs an empty scoreboard with the given capacity for storing entries.
Sellable - Interface in dsaj.design: Interface for objects that can be sold.
set(int, T) - Method in class dsaj.design.Portfolio
set(Position<E>, E) - Method in class dsaj.trees.LinkedTree: Replaces the element at Position p with element e and returns the replaced element.
set(int, E) - Method in class net.datastructures.ArrayList: Replaces the element at the specified index, and returns the element previously stored.
set(Position<E>, E) - Method in class net.datastructures.LinkedBinaryTree: Replaces the element at Position p with element e and returns the replaced element.
set(Position<E>, E) - Method in class net.datastructures.LinkedPositionalList: Replaces the element stored at the given Position and returns the replaced element.
set(int, E) - Method in interface net.datastructures.List: Replaces the element at the specified index, and returns the element previously stored.
set(Position<E>, E) - Method in interface net.datastructures.PositionalList: Replaces the element stored at the given Position and returns the replaced element.
set(Position<Entry<K, V>>, Entry<K, V>) - Method in class net.datastructures.TreeMap
setAux(int) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree.BSTNode
setAux(Position<Entry<K, V>>, int) - Method in class net.datastructures.TreeMap.BalanceableBinaryTree
setBox(int, int, int) - Method in class dsaj.design.BoxedItem
setBox(int, int, int) - Method in class dsaj.design.BoxedItem2
setElement(E) - Method in class dsaj.trees.LinkedTree.Node
setElement(E) - Method in class net.datastructures.LinkedBinaryTree.Node
setHeight(int) - Method in class dsaj.primer.Gnome
setIndex(int) - Method in class net.datastructures.HeapAdaptablePriorityQueue.AdaptablePQEntry
setKey(K) - Method in class net.datastructures.AbstractMap.MapEntry
setKey(K) - Method in class net.datastructures.AbstractPriorityQueue.PQEntry
setLeft(LinkedBinaryTree.Node<E>) - Method in class net.datastructures.LinkedBinaryTree.Node
setParent(LinkedTree.Node<E>) - Method in class dsaj.trees.LinkedTree.Node
setParent(LinkedBinaryTree.Node<E>) - Method in class net.datastructures.LinkedBinaryTree.Node
setRight(LinkedBinaryTree.Node<E>) - Method in class net.datastructures.LinkedBinaryTree.Node
setValue(V) - Method in class net.datastructures.AbstractMap.MapEntry
setValue(V) - Method in class net.datastructures.AbstractPriorityQueue.PQEntry
setX(int) - Method in interface dsaj.trees.TraversalExamples.Geometric
setY(int) - Method in interface dsaj.trees.TraversalExamples.Geometric
shortestPathLengths(Graph<V, Integer>, Vertex<V>) - Static method in class net.datastructures.GraphAlgorithms: Computes shortest-path distances from src vertex to all reachable vertices of g.
sibling(Position<E>) - Method in class net.datastructures.AbstractBinaryTree: Returns the Position of p's sibling (or null if no sibling exists).
sibling(Position<E>) - Method in interface net.datastructures.BinaryTree: Returns the Position of p's sibling (or null if no sibling exists).
sibling(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap
simple() - Method in class dsaj.primer.Robot
SinglyLinkedList<E> - Class in net.datastructures: A basic singly linked list implementation.
SinglyLinkedList() - Constructor for class net.datastructures.SinglyLinkedList: Constructs an initially empty list.
size() - Method in class dsaj.lists.FavoritesList: Returns the number of items in the favorites list.
size() - Method in class dsaj.maps.HashMultimap: Returns the total number of entries in the multimap.
size() - Method in class dsaj.trees.LinkedTree
size() - Method in class net.datastructures.AbstractHashMap: Tests whether the map is empty.
size() - Method in class net.datastructures.AbstractTree: Returns the number of nodes in the tree.
size() - Method in class net.datastructures.ArrayList: Returns the number of elements in the list.
size() - Method in class net.datastructures.ArrayQueue: Returns the number of elements in the queue.
size() - Method in class net.datastructures.ArrayStack: Returns the number of elements in the stack.
size() - Method in class net.datastructures.CircularlyLinkedList: Returns the number of elements in the linked list.
size() - Method in interface net.datastructures.Deque: Returns the number of elements in the deque.
size() - Method in class net.datastructures.DoublyLinkedList: Returns the number of elements in the linked list.
size() - Method in class net.datastructures.HeapPriorityQueue: Returns the number of items in the priority queue.
size() - Method in class net.datastructures.LinkedBinaryTree: Returns the number of nodes in the tree.
size() - Method in class net.datastructures.LinkedCircularQueue: Returns the number of elements in the queue.
size() - Method in class net.datastructures.LinkedDeque
size() - Method in class net.datastructures.LinkedPositionalList: Returns the number of elements in the list.
size() - Method in class net.datastructures.LinkedQueue: Returns the number of elements in the queue.
size() - Method in class net.datastructures.LinkedStack: Returns the number of elements in the stack.
size() - Method in interface net.datastructures.List: Returns the number of elements in the list.
size() - Method in interface net.datastructures.Map: Returns the number of entries in the map.
size() - Method in interface net.datastructures.PositionalList: Returns the number of elements in the list.
size() - Method in interface net.datastructures.PriorityQueue: Returns the number of items in the priority queue.
size() - Method in interface net.datastructures.Queue: Returns the number of elements in the queue.
size() - Method in class net.datastructures.SinglyLinkedList: Returns the number of elements in the linked list.
size() - Method in class net.datastructures.SortedPriorityQueue: Returns the number of items in the priority queue.
size() - Method in class net.datastructures.SortedTableMap: Returns the number of entries in the map.
size() - Method in interface net.datastructures.Stack: Returns the number of elements in the stack.
size() - Method in interface net.datastructures.Tree: Returns the number of nodes in the tree.
size() - Method in class net.datastructures.TreeMap: Returns the number of entries in the map.
size() - Method in class net.datastructures.UnsortedPriorityQueue: Returns the number of items in the priority queue.
size() - Method in class net.datastructures.UnsortedTableMap: Returns the number of entries in the map.
sort(E[], Comparator<E>) - Method in interface dsaj.sorting.SortTest.ArrayAlgorithm
sort(Queue<E>, Comparator<E>) - Method in interface dsaj.sorting.SortTest.QueueAlgorithm
SortedMap<K,V> - Interface in net.datastructures: A map with additional support for keys from a total ordering.
SortedPriorityQueue<K,V> - Class in net.datastructures: An implementation of a priority queue with a sorted list.
SortedPriorityQueue() - Constructor for class net.datastructures.SortedPriorityQueue: Creates an empty priority queue based on the natural ordering of its keys.
SortedPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.SortedPriorityQueue: Creates an empty priority queue using the given comparator to order keys.
SortedTableMap<K,V> - Class in net.datastructures: An implementation of a map using a sorted table.
SortedTableMap() - Constructor for class net.datastructures.SortedTableMap: Constructs an empty map using the natural ordering of keys.
SortedTableMap(Comparator<K>) - Constructor for class net.datastructures.SortedTableMap: Constructs an empty map using the given comparator to order keys.
SortTest - Class in dsaj.sorting
SortTest() - Constructor for class dsaj.sorting.SortTest
SortTest.ArrayAlgorithm - Interface in dsaj.sorting
SortTest.QueueAlgorithm - Interface in dsaj.sorting
spaces(int) - Static method in class dsaj.trees.TraversalExamples: Returns a string containing n spaces.
SplayTreeMap<K,V> - Class in net.datastructures: An implementation of a sorted map using a splay tree.
SplayTreeMap() - Constructor for class net.datastructures.SplayTreeMap: Constructs an empty map using the natural ordering of keys.
SplayTreeMap(Comparator<K>) - Constructor for class net.datastructures.SplayTreeMap: Constructs an empty map using the given comparator to order keys.
spTree(Graph<V, Integer>, Vertex<V>, Map<Vertex<V>, Integer>) - Static method in class net.datastructures.GraphAlgorithms: Reconstructs a shortest-path tree rooted at vertex s, given distance map d.
Stack<E> - Interface in net.datastructures: A collection of objects that are inserted and removed according to the last-in first-out principle.
StringExperiment - Class in dsaj.asymptotics: Provides an empirical test of the efficiency of repeated string concatentation versus use of the StringBuilder class.
StringExperiment() - Constructor for class dsaj.asymptotics.StringExperiment
StringLengthComparator - Class in dsaj.pq
StringLengthComparator() - Constructor for class dsaj.pq.StringLengthComparator
Student - Class in dsaj.design
Student(String, String, int) - Constructor for class dsaj.design.Student
studyHours() - Method in class dsaj.design.Student
subMap(K, K) - Method in interface net.datastructures.SortedMap: Returns an iterable containing all keys in the range from fromKey inclusive to toKey exclusive.
subMap(K, K) - Method in class net.datastructures.SortedTableMap: Returns an iterable containing all keys in the range from fromKey inclusive to toKey exclusive.
subMap(K, K) - Method in class net.datastructures.TreeMap: Returns an iterable containing all entries with keys in the range from fromKey inclusive to toKey exclusive.
sum(double[]) - Static method in class dsaj.primer.ArraySum
sum(double[]) - Static method in class dsaj.primer.ArraySumForeach
sum(int[]) - Static method in class dsaj.recursion.ArraySum: Returns the sum of values in integer array A.
swap(int, int) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Exchanges the entries at indices i and j of the array list.
swap(int, int) - Method in class net.datastructures.HeapPriorityQueue: Exchanges the entries at indices i and j of the array list.
switchDemo(EnumDemo.Day) - Static method in class dsaj.primer.EnumDemo

T

tallerChild(Position<Entry<K, V>>) - Method in class net.datastructures.AVLTreeMap: Returns a child of p with height no smaller than that of the other child.
test(FavoritesList<Character>) - Static method in class dsaj.lists.FavoritesList
testArray(String[], String, SortTest.ArrayAlgorithm) - Static method in class dsaj.sorting.SortTest
TestProgression - Class in dsaj.design: Test program for the progression hierarchy.
TestProgression() - Constructor for class dsaj.design.TestProgression
testQueue(String[], String, SortTest.QueueAlgorithm) - Static method in class dsaj.sorting.SortTest
TicTacToe - Class in dsaj.arrays: Simulation of a Tic-Tac-Toe game (does not do strategy).
TicTacToe() - Constructor for class dsaj.arrays.TicTacToe: Constructor
top() - Method in class net.datastructures.ArrayStack: Returns, but does not remove, the element at the top of the stack.
top() - Method in class net.datastructures.LinkedStack: Returns, but does not remove, the element at the top of the stack.
top() - Method in interface net.datastructures.Stack: Returns, but does not remove, the element at the top of the stack.
topologicalSort(Graph<V, E>) - Static method in class net.datastructures.GraphAlgorithms: Returns a list of verticies of directed acyclic graph g in topological order.
toString() - Method in class dsaj.arrays.GameEntry: Returns a string representation of this entry.
toString() - Method in class dsaj.arrays.Scoreboard: Returns a string representation of the high scores list.
toString() - Method in class dsaj.arrays.TicTacToe: Returns a simple character string showing the current board.
toString() - Method in class dsaj.design.ObjectPair
toString() - Method in class dsaj.design.Pair
toString() - Method in class dsaj.design.Student
toString() - Method in class dsaj.lists.FavoritesList.Item
toString() - Method in class dsaj.lists.FavoritesList
toString() - Method in class dsaj.maps.CostPerformanceDatabase
toString() - Method in class dsaj.maps.HashMultimap
toString() - Method in class dsaj.trees.ExpressionTree: Produce a parenthesized string representation of the expression.
toString() - Method in class net.datastructures.AbstractMap.MapEntry: Returns string representation (for debugging only)
toString() - Method in class net.datastructures.AdjacencyMapGraph: Returns a string representation of the graph.
toString() - Method in class net.datastructures.ArrayList: Produces a string representation of the contents of the indexed list.
toString() - Method in class net.datastructures.ArrayQueue: Returns a string representation of the queue as a list of elements.
toString() - Method in class net.datastructures.ArrayStack: Produces a string representation of the contents of the stack.
toString() - Method in class net.datastructures.CircularlyLinkedList: Produces a string representation of the contents of the list.
toString() - Method in class net.datastructures.DoublyLinkedList: Produces a string representation of the contents of the list.
toString() - Method in class net.datastructures.LinkedCircularQueue: Produces a string representation of the contents of the queue.
toString() - Method in class net.datastructures.LinkedDeque: Produces a string representation of the contents of the deque.
toString() - Method in class net.datastructures.LinkedPositionalList: Produces a string representation of the contents of the list.
toString() - Method in class net.datastructures.LinkedQueue: Produces a string representation of the contents of the queue.
toString() - Method in class net.datastructures.LinkedStack: Produces a string representation of the contents of the stack.
toString() - Method in class net.datastructures.SinglyLinkedList: Produces a string representation of the contents of the list.
transitiveClosure(Graph<V, E>) - Static method in class net.datastructures.GraphAlgorithms: Converts graph g into its transitive closure.
transitiveClosureIndexed(Graph<V, E>) - Static method in class net.datastructures.GraphAlgorithms: Converts graph g into its transitive closure.
Transportable - Interface in dsaj.design: Interface for objects that can be transported.
TraversalExamples - Class in dsaj.trees
TraversalExamples() - Constructor for class dsaj.trees.TraversalExamples
TraversalExamples.Geometric - Interface in dsaj.trees
Tree<E> - Interface in net.datastructures: An interface for a tree where nodes can have an arbitrary number of children.
tree - Variable in class net.datastructures.TreeMap: Representation of the underlying tree structure.
TreeBuilder - Class in dsaj.trees: Tools to serialize/deserialize both general and binary trees.
TreeBuilder() - Constructor for class dsaj.trees.TreeBuilder
TreeMap<K,V> - Class in net.datastructures: An implementation of a sorted map using a binary search tree.
TreeMap() - Constructor for class net.datastructures.TreeMap: Constructs an empty map using the natural ordering of keys.
TreeMap(Comparator<K>) - Constructor for class net.datastructures.TreeMap: Constructs an empty map using the given comparator to order keys.
TreeMap.BalanceableBinaryTree<K,V> - Class in net.datastructures: A specialized version of the LinkedBinaryTree class with additional mutators to support binary search tree operations, and a specialized node class that includes an auxiliary instance variable for balancing data.
TreeMap.BalanceableBinaryTree() - Constructor for class net.datastructures.TreeMap.BalanceableBinaryTree
TreeMap.BalanceableBinaryTree.BSTNode<E> - Class in net.datastructures
treeMax(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap: Returns the position with the maximum key in the subtree rooted at p.
treeMin(Position<Entry<K, V>>) - Method in class net.datastructures.TreeMap: Returns position with the minimal key in the subtree rooted at Position p.

U

union(Position<E>, Position<E>) - Method in class net.datastructures.Partition: Merges the clusters containing elements with positions p and q (if distinct).
Unique3 - Class in dsaj.recursion: Demonstration of a recursive (and very bad) solution to element uniqueness problem.
Unique3() - Constructor for class dsaj.recursion.Unique3
unique3(int[], int, int) - Static method in class dsaj.recursion.Unique3: Returns true if there are no duplicate values from data[low] through data[high].
Universe - Class in dsaj.primer: Our version of the classic Hello World.
Universe() - Constructor for class dsaj.primer.Universe
UnsortedPriorityQueue<K,V> - Class in net.datastructures: An implementation of a priority queue with an unsorted list.
UnsortedPriorityQueue() - Constructor for class net.datastructures.UnsortedPriorityQueue: Creates an empty priority queue based on the natural ordering of its keys.
UnsortedPriorityQueue(Comparator<K>) - Constructor for class net.datastructures.UnsortedPriorityQueue: Creates an empty priority queue using the given comparator to order keys.
UnsortedTableMap<K,V> - Class in net.datastructures: An implementation of a map using an unsorted table.
UnsortedTableMap() - Constructor for class net.datastructures.UnsortedTableMap: Constructs an initially empty map.
upheap(int) - Method in class net.datastructures.HeapPriorityQueue: Moves the entry at index j higher, if necessary, to restore the heap property.

V

validate(Position<E>) - Method in class dsaj.trees.LinkedTree
validate(Entry<K, V>) - Method in class net.datastructures.HeapAdaptablePriorityQueue: Validates an entry to ensure it is location-aware.
validate(Position<E>) - Method in class net.datastructures.LinkedBinaryTree: Verifies that a Position belongs to the appropriate class, and is not one that has been previously removed.
value(Position<FavoritesList.Item<E>>) - Method in class dsaj.lists.FavoritesList: Provides shorthand notation to retrieve user's element stored at Position p.
valueOf(String) - Static method in enum dsaj.primer.EnumDemo.Day: Returns the enum constant of this type with the specified name.
values() - Static method in enum dsaj.primer.EnumDemo.Day: Returns an array containing the constants of this enum type, in the order they are declared.
values() - Method in class net.datastructures.AbstractMap: Returns an iterable collection of the values contained in the map.
values() - Method in interface net.datastructures.Map: Returns an iterable collection of the values contained in the map.
Vertex<V> - Interface in net.datastructures: A vertex of a graph.
vertices() - Method in class net.datastructures.AdjacencyMapGraph: Returns the vertices of the graph as an iterable collection
vertices() - Method in interface net.datastructures.Graph: Returns the vertices of the graph as an iterable collection

W

weight() - Method in class dsaj.design.BoxedItem
weight() - Method in class dsaj.design.BoxedItem2
weight() - Method in interface dsaj.design.Transportable: Returns the weight in grams.
winner() - Method in class dsaj.arrays.TicTacToe: Returns the winning player's code, or 0 to indicate a tie (or unfinished game).
WordCount - Class in dsaj.maps: A program that counts words in a document, printing the most frequent.
WordCount() - Constructor for class dsaj.maps.WordCount
WrapperDemo - Class in dsaj.primer: A demonstration of Java's wrapper types.
WrapperDemo() - Constructor for class dsaj.primer.WrapperDemo

X

X - Static variable in class dsaj.arrays.TicTacToe

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