Overview
Package
Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
A
B
C
D
E
F
G
H
I
K
L
M
N
P
Q
R
S
T
U
V
W
Z
A
AATree
- class weiss.nonstandard.
AATree
.
Implements an AA-tree.
AATree()
- Constructor for class weiss.nonstandard.
AATree
Construct the tree.
AbstractCollection
- class weiss.util.
AbstractCollection
.
AbstractCollection provides default implementations for some of the easy methods in the Collection interface.
AbstractCollection()
- Constructor for class weiss.util.
AbstractCollection
add(int, Object)
- Method in class weiss.util.
LinkedList
Adds an item to this collection, at specified position.
add(Object)
- Method in class weiss.util.
LinkedList
Adds an item to this collection, at the end.
add(Object)
- Method in class weiss.util.
ArrayList
Adds an item to this collection, at the end.
add(Object)
- Method in interface weiss.util.
Collection
Adds an item to this collection.
add(Object)
- Method in class weiss.util.
TreeSet
Adds an item to this collection.
add(Object)
- Method in class weiss.util.
HashSet
Adds an item to this collection.
addFirst(Object)
- Method in class weiss.util.
LinkedList
Adds an item to this collection, at front.
addLast(Object)
- Method in class weiss.util.
LinkedList
Adds an item to this collection, at end.
advance()
- Method in class weiss.nonstandard.
LinkedListIterator
Advance the current position to the next node in the list.
ArrayList
- class weiss.util.
ArrayList
.
The ArrayList implements a growable array.
ArrayList()
- Constructor for class weiss.util.
ArrayList
Construct an empty ArrayList.
ArrayList(Collection)
- Constructor for class weiss.util.
ArrayList
Construct an ArrayList with same items as another Collection.
ArrayQueue
- class weiss.nonstandard.
ArrayQueue
.
Array-based implementation of the queue.
ArrayQueue()
- Constructor for class weiss.nonstandard.
ArrayQueue
Construct the queue.
Arrays
- class weiss.util.
Arrays
.
Instanceless class that contains static methods to manipulate arrays.
ArrayStack
- class weiss.nonstandard.
ArrayStack
.
Array-based implementation of the stack.
ArrayStack()
- Constructor for class weiss.nonstandard.
ArrayStack
Construct the stack.
B
BinaryHeap
- class weiss.nonstandard.
BinaryHeap
.
Implements a binary heap.
BinaryHeap()
- Constructor for class weiss.nonstandard.
BinaryHeap
Construct the binary heap.
BinaryHeap(Comparable[])
- Constructor for class weiss.nonstandard.
BinaryHeap
Construct the binary heap from an array.
binarySearch(Object[], Object)
- Static method in class weiss.util.
Arrays
Performs a search on sorted array arr.
binarySearch(Object[], Object, Comparator)
- Static method in class weiss.util.
Arrays
Performs a search on sorted array arr using a comparator.
BinarySearchTree
- class weiss.nonstandard.
BinarySearchTree
.
Implements an unbalanced binary search tree.
BinarySearchTree()
- Constructor for class weiss.nonstandard.
BinarySearchTree
Construct the tree.
BinarySearchTreeWithRank
- class weiss.nonstandard.
BinarySearchTreeWithRank
.
Implements an unbalanced binary search tree.
BinarySearchTreeWithRank()
- Constructor for class weiss.nonstandard.
BinarySearchTreeWithRank
C
clear()
- Method in interface weiss.util.
Map
Removes all key value pairs from the map.
clear()
- Method in class weiss.util.
AbstractCollection
Change the size of this collection to zero.
clear()
- Method in class weiss.util.
LinkedList
Change the size of this collection to zero.
clear()
- Method in class weiss.util.
ArrayList
Change the size of this collection to zero.
clear()
- Method in class weiss.util.
Stack
clear()
- Method in interface weiss.util.
Collection
Change the size of this collection to zero.
clear()
- Method in class weiss.util.
TreeSet
Change the size of this collection to zero.
clear()
- Method in class weiss.util.
HashSet
Change the size of this collection to zero.
clonePairSet(Set)
- Method in class weiss.util.
TreeMap
clonePairSet(Set)
- Method in class weiss.util.
HashMap
Collection
- interface weiss.util.
Collection
.
Collection interface; the root of all 1.2 collections.
Collections
- class weiss.util.
Collections
.
Instanceless class contains static methods that operate on collections.
Comparator
- interface weiss.util.
Comparator
.
Comparator function object interface.
comparator()
- Method in class weiss.util.
TreeMap
Gets the comparator; returns null if default.
comparator()
- Method in interface weiss.util.
SortedSet
Return the comparator used by this SortedSet.
comparator()
- Method in class weiss.util.
TreeSet
Return the comparator used by this TreeSet.
compare(Object, Object)
- Method in interface weiss.util.
Comparator
Return the result of comparing lhs and rhs.
ConcurrentModificationException
- exception weiss.util.
ConcurrentModificationException
.
ConcurrentModificationException()
- Constructor for class weiss.util.
ConcurrentModificationException
Constructs a ConcurrentModificationException with no detail message.
ConcurrentModificationException(String)
- Constructor for class weiss.util.
ConcurrentModificationException
contains(Object)
- Method in class weiss.util.
AbstractCollection
Returns true if this collection contains x.
contains(Object)
- Method in class weiss.util.
LinkedList
Tests if some item is in this collection.
contains(Object)
- Method in class weiss.util.
ArrayList
Tests if some item is in this collection.
contains(Object)
- Method in interface weiss.util.
Collection
Tests if some item is in this collection.
contains(Object)
- Method in class weiss.util.
TreeSet
Tests if some item is in this collection.
contains(Object)
- Method in class weiss.util.
HashSet
Tests if some item is in this collection.
containsKey(Object)
- Method in interface weiss.util.
Map
Tests if this map contains a given key.
D
decreaseKey(PriorityQueue.Position, Comparable)
- Method in class weiss.nonstandard.
PairingHeap
Change the value of the item stored in the pairing heap.
decreaseKey(PriorityQueue.Position, Comparable)
- Method in interface weiss.nonstandard.
PriorityQueue
Change the value of the item stored in the pairing heap.
decreaseKey(PriorityQueue.Position, Comparable)
- Method in class weiss.nonstandard.
BinaryHeap
deleteMin()
- Method in class weiss.nonstandard.
PairingHeap
Remove the smallest item from the priority queue.
deleteMin()
- Method in interface weiss.nonstandard.
PriorityQueue
Remove the smallest item from the priority queue.
deleteMin()
- Method in class weiss.nonstandard.
BinaryHeap
Remove the smallest item from the priority queue.
dequeue()
- Method in class weiss.nonstandard.
ArrayQueue
Return and remove the least recently inserted item from the queue.
dequeue()
- Method in class weiss.nonstandard.
ListQueue
Return and remove the least recently inserted item from the queue.
dequeue()
- Method in interface weiss.nonstandard.
Queue
Return and remove the least recently inserted item from the queue.
DisjointSets
- class weiss.nonstandard.
DisjointSets
.
Disjoint set class, using union by rank and path compression.
DisjointSets(int)
- Constructor for class weiss.nonstandard.
DisjointSets
Construct the disjoint sets object.
DisjointSetsFast
- class weiss.nonstandard.
DisjointSetsFast
.
Disjoint set class, using union by rank and path compression.
DisjointSetsFast(int)
- Constructor for class weiss.nonstandard.
DisjointSetsFast
Construct the disjoint sets object.
DuplicateItemException
- exception weiss.nonstandard.
DuplicateItemException
.
Exception class for duplicate item errors in search tree insertions.
DuplicateItemException()
- Constructor for class weiss.nonstandard.
DuplicateItemException
Construct this exception object.
DuplicateItemException(String)
- Constructor for class weiss.nonstandard.
DuplicateItemException
Construct this exception object.
E
EmptyStackException
- exception weiss.util.
EmptyStackException
.
EmptyStackException()
- Constructor for class weiss.util.
EmptyStackException
Constructs a EmptyStackException with no detail message.
EmptyStackException(String)
- Constructor for class weiss.util.
EmptyStackException
enqueue(Object)
- Method in class weiss.nonstandard.
ArrayQueue
Insert a new item into the queue.
enqueue(Object)
- Method in class weiss.nonstandard.
ListQueue
Insert a new item into the queue.
enqueue(Object)
- Method in interface weiss.nonstandard.
Queue
Insert a new item into the queue.
entrySet()
- Method in interface weiss.util.
Map
Return a set of Map.Entry objects corresponding to the key/value pairs in the map.
equals(Object)
- Method in class weiss.util.
AbstractCollection
Return true if items in other collection are equal to items in this collection (same order, and same according to equals).
Exiting
- class weiss.nonstandard.
Exiting
.
Exiting()
- Constructor for class weiss.nonstandard.
Exiting
F
find(Comparable)
- Method in class weiss.nonstandard.
SplayTree
Find an item in the tree.
find(Comparable)
- Method in class weiss.nonstandard.
AATree
Find an item in the tree.
find(Comparable)
- Method in class weiss.nonstandard.
RedBlackTree
Find an item in the tree.
find(Comparable)
- Method in class weiss.nonstandard.
BinarySearchTree
Find an item in the tree.
find(int)
- Method in class weiss.nonstandard.
DisjointSetsFast
Perform a find with path compression.
find(int)
- Method in class weiss.nonstandard.
DisjointSets
Perform a find with path compression.
find(Object)
- Method in class weiss.nonstandard.
LinkedList
Return iterator corresponding to the first node containing an item.
find(Object)
- Method in interface weiss.nonstandard.
SimpleContainer
findKth(int)
- Method in class weiss.nonstandard.
BinarySearchTreeWithRank
Find the kth smallest item in the tree.
findKth(int, BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTreeWithRank
Internal method to find kth smallest item in a subtree.
findMax()
- Method in class weiss.nonstandard.
SplayTree
Find the largest item in the tree.
findMax()
- Method in class weiss.nonstandard.
AATree
Find the largest item in the tree.
findMax()
- Method in class weiss.nonstandard.
RedBlackTree
Find the largest item in the tree.
findMax()
- Method in class weiss.nonstandard.
BinarySearchTree
Find the largest item in the tree.
findMin()
- Method in class weiss.nonstandard.
PairingHeap
Find the smallest item in the priority queue.
findMin()
- Method in class weiss.nonstandard.
SplayTree
Find the smallest item in the tree.
findMin()
- Method in class weiss.nonstandard.
AATree
Find the smallest item in the tree.
findMin()
- Method in class weiss.nonstandard.
RedBlackTree
Find the smallest item the tree.
findMin()
- Method in interface weiss.nonstandard.
PriorityQueue
Find the smallest item in the priority queue.
findMin()
- Method in class weiss.nonstandard.
BinarySearchTree
Find the smallest item in the tree.
findMin()
- Method in class weiss.nonstandard.
BinaryHeap
Find the smallest item in the priority queue.
findMin(BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTree
Internal method to find the smallest item in a subtree.
findPrevious(Object)
- Method in class weiss.nonstandard.
LinkedList
Return iterator prior to the first node containing an item.
first()
- Method in interface weiss.util.
SortedSet
Find the smallest item in the set.
first()
- Method in class weiss.util.
TreeSet
Find the smallest item in the set.
first()
- Method in class weiss.nonstandard.
LinkedList
Return an iterator representing the first node in the list.
G
get(int)
- Method in class weiss.util.
LinkedList
Returns the item at position idx.
get(int)
- Method in interface weiss.util.
List
Returns the item at position idx.
get(int)
- Method in class weiss.util.
ArrayList
Returns the item at position idx.
get(Object)
- Method in interface weiss.util.
Map
Returns the value in the map associated with the key.
getFirst()
- Method in class weiss.util.
LinkedList
Returns the first item in the list.
getFront()
- Method in class weiss.nonstandard.
ArrayQueue
Get the least recently inserted item in the queue.
getFront()
- Method in class weiss.nonstandard.
ListQueue
Get the least recently inserted item in the queue.
getFront()
- Method in interface weiss.nonstandard.
Queue
Get the least recently inserted item in the queue.
getKey()
- Method in interface weiss.util.
Map.Entry
Obtains this pair's key.
getLast()
- Method in class weiss.util.
LinkedList
Returns the last item in the list.
getMatch(Object)
- Method in interface weiss.util.
Set
This method is not part of standard Java 1.2.
getMatch(Object)
- Method in class weiss.util.
TreeSet
This method is not part of standard Java 1.2.
getMatch(Object)
- Method in class weiss.util.
HashSet
This method is not part of standard Java 1.2.
getValue()
- Method in interface weiss.util.
Map.Entry
Obtains this pair's value.
getValue()
- Method in interface weiss.nonstandard.
PriorityQueue.Position
Returns the value stored at this position.
H
hashCode()
- Method in class weiss.util.
AbstractCollection
Return the hashCode.
HashMap
- class weiss.util.
HashMap
.
Hash table implementation of the Map.
HashMap()
- Constructor for class weiss.util.
HashMap
Construct an empty HashMap.
HashMap(Map)
- Constructor for class weiss.util.
HashMap
Construct a HashMap with same key/value pairs as another map.
HashSet
- class weiss.util.
HashSet
.
HashSet implementation.
HashSet()
- Constructor for class weiss.util.
HashSet
Construct an empty HashSet.
HashSet(Collection)
- Constructor for class weiss.util.
HashSet
Construct a HashSet from any collection.
hasNext()
- Method in interface weiss.util.
Iterator
Tests if there are items not yet iterated over.
hasPrevious()
- Method in interface weiss.util.
ListIterator
Tests if there are more items in the collection when iterating in reverse.
I
IllegalValueException
- exception weiss.nonstandard.
IllegalValueException
.
Exception class for illegal decrease key operations in pairing heaps.
IllegalValueException(String)
- Constructor for class weiss.nonstandard.
IllegalValueException
Construct this exception object.
insert(Comparable)
- Method in class weiss.nonstandard.
PairingHeap
Insert into the priority queue, and return a Position that can be used by decreaseKey.
insert(Comparable)
- Method in class weiss.nonstandard.
SplayTree
Insert into the tree.
insert(Comparable)
- Method in class weiss.nonstandard.
AATree
Insert into the tree.
insert(Comparable)
- Method in class weiss.nonstandard.
RedBlackTree
Insert into the tree.
insert(Comparable)
- Method in interface weiss.nonstandard.
PriorityQueue
Insert into the priority queue, maintaining heap order.
insert(Comparable)
- Method in class weiss.nonstandard.
BinarySearchTree
Insert into the tree.
insert(Comparable)
- Method in class weiss.nonstandard.
BinaryHeap
Insert into the priority queue.
insert(Comparable)
- Method in class weiss.nonstandard.
SortedLinkedList
Insert in sorted order.
insert(Comparable, BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTree
Internal method to insert into a subtree.
insert(Comparable, BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTreeWithRank
Internal method to insert into a subtree.
insert(Object)
- Method in interface weiss.nonstandard.
SimpleContainer
insert(Object, LinkedListIterator)
- Method in class weiss.nonstandard.
LinkedList
Insert after p.
insert(Object, LinkedListIterator)
- Method in class weiss.nonstandard.
SortedLinkedList
Insert after p.
isEmpty()
- Method in interface weiss.util.
Map
Tests if this map is empty.
isEmpty()
- Method in class weiss.util.
AbstractCollection
Tests if this collection is empty.
isEmpty()
- Method in class weiss.util.
Stack
Tests if stack is empty.
isEmpty()
- Method in interface weiss.util.
Collection
Tests if this collection is empty.
isEmpty()
- Method in class weiss.nonstandard.
PairingHeap
Test if the priority queue is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
SplayTree
Test if the tree is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
ArrayQueue
Test if the queue is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
AATree
Test if the tree is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
RedBlackTree
Test if the tree is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
ListStack
Test if the stack is logically empty.
isEmpty()
- Method in interface weiss.nonstandard.
PriorityQueue
Test if the priority queue is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
ListQueue
Test if the queue is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
BinarySearchTree
Test if the tree is logically empty.
isEmpty()
- Method in interface weiss.nonstandard.
Stack
Test if the stack is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
BinaryHeap
Test if the priority queue is logically empty.
isEmpty()
- Method in class weiss.nonstandard.
LinkedList
Test if the list is logically empty.
isEmpty()
- Method in interface weiss.nonstandard.
Queue
Test if the queue is logically empty.
isEmpty()
- Method in interface weiss.nonstandard.
SimpleContainer
isEmpty()
- Method in class weiss.nonstandard.
ArrayStack
Test if the stack is logically empty.
isValid()
- Method in class weiss.nonstandard.
LinkedListIterator
Test if the current position is a valid position in the list.
ItemNotFoundException
- exception weiss.nonstandard.
ItemNotFoundException
.
Exception class for failed finds/removes in search trees, hash tables, and list and tree iterators.
ItemNotFoundException()
- Constructor for class weiss.nonstandard.
ItemNotFoundException
Construct this exception object.
ItemNotFoundException(String)
- Constructor for class weiss.nonstandard.
ItemNotFoundException
Construct this exception object.
Iterator
- interface weiss.util.
Iterator
.
Iterator interface.
iterator()
- Method in class weiss.util.
LinkedList
Obtains an Iterator object used to traverse the collection.
iterator()
- Method in class weiss.util.
ArrayList
Obtains an Iterator object used to traverse the collection.
iterator()
- Method in interface weiss.util.
Collection
Obtains an Iterator object used to traverse the collection.
iterator()
- Method in class weiss.util.
TreeSet
Obtains an Iterator object used to traverse the collection.
iterator()
- Method in class weiss.util.
HashSet
Obtains an Iterator object used to traverse the collection.
K
keySet()
- Method in interface weiss.util.
Map
Returns the keys in the map.
L
last()
- Method in interface weiss.util.
SortedSet
Find the largest item in the set.
last()
- Method in class weiss.util.
TreeSet
Find the largest item in the set.
LinkedList
- class weiss.util.
LinkedList
.
LinkedList class implements a doubly-linked list.
LinkedList
- class weiss.nonstandard.
LinkedList
.
Linked list implementation of the list using a header node.
LinkedList()
- Constructor for class weiss.util.
LinkedList
Construct an empty LinkedList.
LinkedList()
- Constructor for class weiss.nonstandard.
LinkedList
Construct the list
LinkedList(Collection)
- Constructor for class weiss.util.
LinkedList
Construct a LinkedList with same items as another Collection.
LinkedListIterator
- class weiss.nonstandard.
LinkedListIterator
.
Linked list implementation of the list iterator using a header node.
List
- interface weiss.util.
List
.
List interface.
ListIterator
- interface weiss.util.
ListIterator
.
ListIterator interface for List interface.
listIterator(int)
- Method in class weiss.util.
LinkedList
Obtains a ListIterator object used to traverse the collection bidirectionally.
listIterator(int)
- Method in interface weiss.util.
List
Obtains a ListIterator object used to traverse the collection bidirectionally.
listIterator(int)
- Method in class weiss.util.
ArrayList
Obtains a ListIterator object used to traverse the collection bidirectionally.
ListQueue
- class weiss.nonstandard.
ListQueue
.
List-based implementation of the queue.
ListQueue()
- Constructor for class weiss.nonstandard.
ListQueue
Construct the queue.
listSize(LinkedList)
- Static method in class weiss.nonstandard.
LinkedList
ListStack
- class weiss.nonstandard.
ListStack
.
List-based implementation of the stack.
ListStack()
- Constructor for class weiss.nonstandard.
ListStack
Construct the stack.
longPause()
- Static method in class weiss.nonstandard.
Exiting
M
main(String[])
- Static method in class weiss.util.
Random
main(String[])
- Static method in class weiss.nonstandard.
PairingHeap
main(String[])
- Static method in class weiss.nonstandard.
SplayTree
main(String[])
- Static method in class weiss.nonstandard.
AATree
main(String[])
- Static method in class weiss.nonstandard.
RedBlackTree
main(String[])
- Static method in class weiss.nonstandard.
BinarySearchTree
main(String[])
- Static method in class weiss.nonstandard.
BinarySearchTreeWithRank
main(String[])
- Static method in class weiss.nonstandard.
BinaryHeap
main(String[])
- Static method in class weiss.nonstandard.
LinkedList
main(String[])
- Static method in class weiss.nonstandard.
SortedLinkedList
main(String[])
- Static method in class weiss.nonstandard.
DisjointSetsFast
main(String[])
- Static method in class weiss.nonstandard.
DisjointSets
makeEmpty()
- Method in class weiss.nonstandard.
PairingHeap
Make the priority queue logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
SplayTree
Make the tree logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
ArrayQueue
Make the queue logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
AATree
Make the tree logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
RedBlackTree
Make the tree logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
ListStack
Make the stack logically empty.
makeEmpty()
- Method in interface weiss.nonstandard.
PriorityQueue
Make the priority queue logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
ListQueue
Make the queue logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
BinarySearchTree
Make the tree logically empty.
makeEmpty()
- Method in interface weiss.nonstandard.
Stack
Make the stack logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
BinaryHeap
Make the priority queue logically empty.
makeEmpty()
- Method in class weiss.nonstandard.
LinkedList
Make the list logically empty.
makeEmpty()
- Method in interface weiss.nonstandard.
Queue
Make the queue logically empty.
makeEmpty()
- Method in interface weiss.nonstandard.
SimpleContainer
makeEmpty()
- Method in class weiss.nonstandard.
ArrayStack
Make the stack logically empty.
makeEmptyKeySet()
- Method in class weiss.util.
TreeMap
makeEmptyKeySet()
- Method in class weiss.util.
HashMap
makePair(Object, Object)
- Method in class weiss.util.
TreeMap
makePair(Object, Object)
- Method in class weiss.util.
HashMap
Map
- interface weiss.util.
Map
.
Map interface.
Map.Entry
- interface weiss.util.
Map.Entry
.
The interface used to access the key/value pairs in a map.
max(Collection)
- Static method in class weiss.util.
Collections
Returns the maximum object in the collection, using default ordering
max(Collection, Comparator)
- Static method in class weiss.util.
Collections
Returns the maximum object in the collection, using comparator.
N
next()
- Method in interface weiss.util.
Iterator
Obtains the next (as yet unseen) item in the collection.
nextDouble()
- Method in class weiss.util.
Random
Return a pseudorandom double in the open range 0..1 and change the internal state.
nextInt()
- Method in class weiss.util.
Random
Return a pseudorandom int, and change the internal state.
nextInt(int)
- Method in class weiss.util.
Random
Return a pseudorandom int in range [0..high), and change the internal state.
nextInt(int, int)
- Method in class weiss.util.
Random
Return an int in the closed range [low,high], and change the internal state.
nextIntWRONG()
- Method in class weiss.util.
Random
Return a pseudorandom int, and change the internal state.
nextLong()
- Method in class weiss.util.
Random
Return an long in the range [0, 2^62-1], and change the internal state.
nextLong(long, long)
- Method in class weiss.util.
Random
Return an long in the closed range [low,high], and change the internal state.
nextNegExp(double)
- Method in class weiss.util.
Random
Return an double using a negative exponential distribution, and change the internal state.
nextPoisson(double)
- Method in class weiss.util.
Random
Return an int using a Poisson distribution, and change the internal state.
NoSuchElementException
- exception weiss.util.
NoSuchElementException
.
NoSuchElementException()
- Constructor for class weiss.util.
NoSuchElementException
Constructs a NoSuchElementException with no detail message.
NoSuchElementException(String)
- Constructor for class weiss.util.
NoSuchElementException
P
PairingHeap
- class weiss.nonstandard.
PairingHeap
.
Implements a pairing heap.
PairingHeap()
- Constructor for class weiss.nonstandard.
PairingHeap
Construct the pairing heap.
peek()
- Method in class weiss.util.
Stack
Returns item from the top of the stack.
permute(Object[])
- Static method in class weiss.util.
Random
Randomly rearrange an array.
pop()
- Method in class weiss.util.
Stack
Removes and returns item from the top of the stack.
pop()
- Method in class weiss.nonstandard.
ListStack
Remove the most recently inserted item from the stack.
pop()
- Method in interface weiss.nonstandard.
Stack
Remove the most recently inserted item from the stack.
pop()
- Method in class weiss.nonstandard.
ArrayStack
Remove the most recently inserted item from the stack.
previous()
- Method in interface weiss.util.
ListIterator
Obtains the previous item in the collection.
printList(LinkedList)
- Static method in class weiss.nonstandard.
LinkedList
printTree()
- Method in class weiss.nonstandard.
RedBlackTree
Print all items.
PriorityQueue
- interface weiss.nonstandard.
PriorityQueue
.
PriorityQueue interface.
PriorityQueue.Position
- interface weiss.nonstandard.
PriorityQueue.Position
.
The Position interface represents a type that can be used for the decreaseKey operation.
push(Object)
- Method in class weiss.util.
Stack
Adds an item to the top of the stack.
push(Object)
- Method in class weiss.nonstandard.
ListStack
Insert a new item into the stack.
push(Object)
- Method in interface weiss.nonstandard.
Stack
Insert a new item into the stack.
push(Object)
- Method in class weiss.nonstandard.
ArrayStack
Insert a new item into the stack.
put(Object, Object)
- Method in interface weiss.util.
Map
Adds the key value pair to the map, overriding the original value if the key was already present.
Q
Queue
- interface weiss.nonstandard.
Queue
.
Protocol for queues.
R
Random
- class weiss.util.
Random
.
Random number class, using a 31-bit linear congruential generator.
Random()
- Constructor for class weiss.util.
Random
Construct this Random object with initial state obtained from system clock.
Random(int)
- Constructor for class weiss.util.
Random
Construct this Random object with specified initial state.
RedBlackTree
- class weiss.nonstandard.
RedBlackTree
.
Implements a red-black tree.
RedBlackTree()
- Constructor for class weiss.nonstandard.
RedBlackTree
Construct the tree.
remove()
- Method in interface weiss.util.
Iterator
Remove the last item returned by next.
remove()
- Method in interface weiss.util.
ListIterator
Remove the last item returned by next or previous.
remove(Comparable)
- Method in class weiss.nonstandard.
SplayTree
Remove from the tree.
remove(Comparable)
- Method in class weiss.nonstandard.
AATree
Remove from the tree.
remove(Comparable)
- Method in class weiss.nonstandard.
RedBlackTree
Remove from the tree.
remove(Comparable)
- Method in class weiss.nonstandard.
BinarySearchTree
Remove from the tree..
remove(Comparable, BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTree
Internal method to remove from a subtree.
remove(Comparable, BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTreeWithRank
Internal method to remove from a subtree.
remove(int)
- Method in class weiss.util.
LinkedList
Removes an item from this collection.
remove(int)
- Method in class weiss.util.
ArrayList
Removes an item from this collection.
remove(Object)
- Method in interface weiss.util.
Map
Remove the key and its value from the map.
remove(Object)
- Method in class weiss.util.
AbstractCollection
Removes non-null x from this collection.
remove(Object)
- Method in class weiss.util.
LinkedList
Removes an item from this collection.
remove(Object)
- Method in class weiss.util.
ArrayList
Removes an item from this collection.
remove(Object)
- Method in interface weiss.util.
Collection
Removes an item from this collection.
remove(Object)
- Method in class weiss.util.
TreeSet
Removes an item from this collection.
remove(Object)
- Method in class weiss.util.
HashSet
Removes an item from this collection.
remove(Object)
- Method in class weiss.nonstandard.
LinkedList
Remove the first occurrence of an item.
remove(Object)
- Method in interface weiss.nonstandard.
SimpleContainer
removeFirst()
- Method in class weiss.util.
LinkedList
Removes the first item in the list.
removeLast()
- Method in class weiss.util.
LinkedList
Removes the last item in the list.
removeMin()
- Method in class weiss.nonstandard.
BinarySearchTree
Remove minimum item from the tree.
removeMin(BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTree
Internal method to remove minimum item from a subtree.
removeMin(BinaryNode)
- Method in class weiss.nonstandard.
BinarySearchTreeWithRank
Internal method to remove the smallest item from a subtree, adjusting size fields as appropriate.
retrieve()
- Method in class weiss.nonstandard.
LinkedListIterator
Return the item stored in the current position.
reverseOrder()
- Static method in class weiss.util.
Collections
root
- Variable in class weiss.nonstandard.
BinarySearchTree
The tree root.
S
Set
- interface weiss.util.
Set
.
Set interface.
set(int, Object)
- Method in class weiss.util.
LinkedList
Changes the item at position idx.
set(int, Object)
- Method in interface weiss.util.
List
Changes the item at position idx.
set(int, Object)
- Method in class weiss.util.
ArrayList
Changes the item at position idx.
SimpleContainer
- interface weiss.nonstandard.
SimpleContainer
.
size()
- Method in interface weiss.util.
Map
Returns the number of keys in this map.
size()
- Method in class weiss.util.
LinkedList
Returns the number of items in this collection.
size()
- Method in class weiss.util.
ArrayList
Returns the number of items in this collection.
size()
- Method in class weiss.util.
Stack
Returns the size of the stack.
size()
- Method in interface weiss.util.
Collection
Returns the number of items in this collection.
size()
- Method in class weiss.util.
TreeSet
Returns the number of items in this collection.
size()
- Method in class weiss.util.
HashSet
Returns the number of items in this collection.
size()
- Method in class weiss.nonstandard.
PairingHeap
Returns number of items stored in the priority queue.
size()
- Method in interface weiss.nonstandard.
PriorityQueue
Returns the size.
size()
- Method in class weiss.nonstandard.
BinaryHeap
Returns size.
SortedLinkedList
- class weiss.nonstandard.
SortedLinkedList
.
Linked list implementation of the list using a header node.
SortedLinkedList()
- Constructor for class weiss.nonstandard.
SortedLinkedList
SortedSet
- interface weiss.util.
SortedSet
.
SortedSet interface.
SplayTree
- class weiss.nonstandard.
SplayTree
.
Implements a top-down splay tree.
SplayTree()
- Constructor for class weiss.nonstandard.
SplayTree
Construct the tree.
Stack
- class weiss.util.
Stack
.
Stack class.
Stack
- interface weiss.nonstandard.
Stack
.
Protocol for stacks.
Stack()
- Constructor for class weiss.util.
Stack
Constructs an empty stack.
T
toArray()
- Method in class weiss.util.
AbstractCollection
Obtains a primitive array view of the collection.
toArray()
- Method in interface weiss.util.
Collection
Obtains a primitive array view of the collection.
top()
- Method in class weiss.nonstandard.
ListStack
Get the most recently inserted item in the stack.
top()
- Method in interface weiss.nonstandard.
Stack
Get the most recently inserted item in the stack.
top()
- Method in class weiss.nonstandard.
ArrayStack
Get the most recently inserted item in the stack.
topAndPop()
- Method in class weiss.nonstandard.
ListStack
Return and remove the most recently inserted item from the stack.
topAndPop()
- Method in interface weiss.nonstandard.
Stack
Return and remove the most recently inserted item from the stack.
topAndPop()
- Method in class weiss.nonstandard.
ArrayStack
Return and remove the most recently inserted item from the stack.
toString()
- Method in class weiss.util.
Stack
TreeMap
- class weiss.util.
TreeMap
.
Balanced search tree implementation of the Map.
TreeMap()
- Constructor for class weiss.util.
TreeMap
Construct an empty TreeMap with default comparator.
TreeMap(Comparator)
- Constructor for class weiss.util.
TreeMap
Construct a TreeMap using comparator.
TreeMap(Map)
- Constructor for class weiss.util.
TreeMap
Construct a TreeMap with same key/value pairs and comparator as another map..
TreeSet
- class weiss.util.
TreeSet
.
Balanced search tree implementation of SortedSet.
TreeSet()
- Constructor for class weiss.util.
TreeSet
Construct an empty TreeSet.
TreeSet(Collection)
- Constructor for class weiss.util.
TreeSet
Construct a TreeSet from any collection.
TreeSet(Comparator)
- Constructor for class weiss.util.
TreeSet
Construct an empty TreeSet with a specified comparator.
TreeSet(TreeSet)
- Constructor for class weiss.util.
TreeSet
Construct a TreeSet from another TreeSet.
U
UnderflowException
- exception weiss.nonstandard.
UnderflowException
.
Exception class for access in empty containers such as stacks, queues, and priority queues.
UnderflowException(String)
- Constructor for class weiss.nonstandard.
UnderflowException
Construct this exception object.
union(int, int)
- Method in class weiss.nonstandard.
DisjointSetsFast
Union two disjoint sets using the height heuristic.
union(int, int)
- Method in class weiss.nonstandard.
DisjointSets
Union two disjoint sets using the height heuristic.
V
values()
- Method in interface weiss.util.
Map
Returns the values in the map.
W
weiss.nonstandard
- package weiss.nonstandard
weiss.util
- package weiss.util
Z
zeroth()
- Method in class weiss.nonstandard.
LinkedList
Return an iterator representing the header node.
A
B
C
D
E
F
G
H
I
K
L
M
N
P
Q
R
S
T
U
V
W
Z
Overview
Package
Class
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES