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