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

A

AbstractListing - class brutil.AbstractListing.

AbstractListing() - Constructor for class brutil.AbstractListing

AbstractMap - class brutil.AbstractMap.

AbstractMap() - Constructor for class brutil.AbstractMap

AbstractMultiSet - class brutil.AbstractMultiSet.

Same as the Set interface, only a MultiSet may contain more than one instance of a single object.

AbstractMultiSet() - Constructor for class brutil.AbstractMultiSet

AbstractQueue - class brutil.AbstractQueue.

AbstractQueue() - Constructor for class brutil.AbstractQueue

AbstractSet - class brutil.AbstractSet.

AbstractSet() - Constructor for class brutil.AbstractSet

AbstractSortedList - class brutil.AbstractSortedList.

AbstractSortedList() - Constructor for class brutil.AbstractSortedList

AbstractSortedMultiSet - class brutil.AbstractSortedMultiSet.

AbstractSortedMultiSet() - Constructor for class brutil.AbstractSortedMultiSet

AbstractSortedSet - class brutil.AbstractSortedSet.

AbstractSortedSet() - Constructor for class brutil.AbstractSortedSet

AbstractStack - class brutil.AbstractStack.

AbstractStack() - Constructor for class brutil.AbstractStack

acquire() - Method in class brutil.Mutex

add(Object) - Method in class brutil.AbstractMultiSet

Add the specified object to the Set.

add(Object) - Method in class brutil.AbstractSet

Add the specified object to the Set.

add(Object) - Method in class brutil.AbstractSortedMultiSet

Add the specified object to the Set.

add(Object) - Method in class brutil.RBSet

add(Object) - Method in class brutil.HashSet

Add the specified object to the Set.

add(Object) - Method in class brutil.AbstractSortedSet

Add the specified object to the Set.

add(Object) - Method in class brutil.AbstractSortedList

Add the specified object to the Set.

add(Object) - Method in interface brutil.Set

Add the specified object to the Set.

afterRead() - Method in class brutil.ReadWriteMutex

afterWrite() - Method in class brutil.ReadWriteMutex

append(Object) - Method in class brutil.ArrayList

Appends the given element to the end of the list.

append(Object) - Method in class brutil.LinkedList

Appends given element to the end of the list.

append(Object) - Method in interface brutil.List

Appends given element to the end of the list.

array - Variable in class brutil.Subarray

Array - class brutil.Array.

This is an automatically-resizing array list.

Array.Subarray - class brutil.Array.Subarray.

Subarrays act as sub-modules for the Array.

Array.Subarray(Array, int) - Constructor for class brutil.Array.Subarray

Initializes the array to this capacity.

Array() - Constructor for class brutil.Array

Default Constructor, initial capacity = 10, increment = 10

Array(int) - Constructor for class brutil.Array

Instantiates array with specified initial capacity.

Array(int, int) - Constructor for class brutil.Array

Instantiates array with specified initial capacity and capacityIncrement, uses the default value for the maximum number of SubArrays

Array(int, int, int) - Constructor for class brutil.Array

The main constructor.

ArrayList - class brutil.ArrayList.

This is circular buffer implementation of a list with a standard java array as the underlying data structure.

ArrayList(int) - Constructor for class brutil.ArrayList

An ArrayList of size maxSize

ArrayMap - class brutil.ArrayMap.

Array implementation of the Map interface.

ArrayMap() - Constructor for class brutil.ArrayMap

ArrayMultiSet - class brutil.ArrayMultiSet.

ArrayMultiSet() - Constructor for class brutil.ArrayMultiSet

ArrayQueue - class brutil.ArrayQueue.

ArrayQueue() - Constructor for class brutil.ArrayQueue

ArraySet - class brutil.ArraySet.

ArraySet() - Constructor for class brutil.ArraySet

ArraySet(int) - Constructor for class brutil.ArraySet

ArraySortedSet - class brutil.ArraySortedSet.

ArraySortedSet() - Constructor for class brutil.ArraySortedSet

ArrayStack - class brutil.ArrayStack.

ArrayStack() - Constructor for class brutil.ArrayStack

B

beforeRead() - Method in class brutil.ReadWriteMutex

beforeWrite() - Method in class brutil.ReadWriteMutex

BinaryHeap - class brutil.BinaryHeap.

BinaryHeap.Element - class brutil.BinaryHeap.Element.

BinaryHeap.Element(BinaryHeap, Comparable, Handle, Object) - Constructor for class brutil.BinaryHeap.Element

BinaryHeap(int, int) - Constructor for class brutil.BinaryHeap

brutil - package brutil

BSTree - class brutil.BSTree.

BSTree.BSTIterator - class brutil.BSTree.BSTIterator.

BSTree.BSTIterator(BSTree, BSTree.Entry) - Constructor for class brutil.BSTree.BSTIterator

BSTree.Entry - class brutil.BSTree.Entry.

BSTree.Entry(BSTree, BSTree.Entry, Object, Object) - Constructor for class brutil.BSTree.Entry

BSTree.Entry(BSTree, Object, Object, BSTree.Entry) - Constructor for class brutil.BSTree.Entry

BSTree() - Constructor for class brutil.BSTree

BSTree(BSTree.Entry) - Constructor for class brutil.BSTree

Constructor, constructing a tree with one element as its root

bucket - Variable in class brutil.HashCoord

The bucket number.

C

clean() - Method in class brutil.ArrayList

Use this method when you want to fully clear the underlying array and free up all objects for collection.

clear() - Method in class brutil.ArrayList

This clear method simply removes the pointer to the first item and resets the size Functionally, this clears the list, but the objects in the list are not freed for collection.

clear() - Method in class brutil.AbstractListing

Clears out the contents of the listing.

clear() - Method in class brutil.BSTree

clear() - Method in class brutil.Array

Sets every element in the Array to null

clear() - Method in class brutil.AbstractMap

Clears out the contents of the Collection (optional operation)

clear() - Method in class brutil.RBSet

Clears all the items out of this tree

clear() - Method in class brutil.HashSet

Removes all the items from this HashSet

clear() - Method in class brutil.BinaryHeap

clear() - Method in interface brutil.Collection

Clears out the contents of the Collection (optional operation)

clear() - Method in class brutil.LinkedList

Removes all elements from the list.

clear() - Method in interface brutil.List

Removes all elements from the list.

Collection - interface brutil.Collection.

Ron doubts the wisdom or usefulness of having size() implemented by collections.

colorCount - Variable in class brutil.RBSet

compareTo(Object) - Method in class brutil.RBSet.RBNode

compareTo(Object) - Method in class brutil.Entry

contains(Object) - Method in class brutil.AbstractMultiSet

Tells if the specified object is contained within this set.

contains(Object) - Method in class brutil.RBSet

Tells if the specified object is contained within this set.

contains(Object) - Method in class brutil.HashSet

Tells if the specified object is contained within this set.

contains(Object) - Method in interface brutil.Set

Tells if the specified object is contained within this set.

containsKey(Object) - Method in class brutil.BSTree

Whether or not a specified mapping exists in the tree

containsKey(Object) - Method in interface brutil.Map

Checks to see if the specified key object is in the Map.

containsKey(Object) - Method in class brutil.AbstractMap

Checks to see if the specified key object is in the Map.

createArray(int) - Method in class brutil.Array.Subarray

createArray(int) - Method in class brutil.Subarray

createElement(Comparable, Handle, Object) - Method in class brutil.BinaryHeap

createEntry(BSTree.Entry, Object, Object) - Method in class brutil.BSTree

createHandle(int) - Method in class brutil.BinaryHeap

createIterator() - Method in class brutil.BSTree

createRandoms() - Method in class brutil.MapTestResults

Initializes the set of testing keys with random data

createSequential() - Method in class brutil.MapTestResults

Initializes the set of testing keys with sequential data

createSubarray(int) - Method in class brutil.Array

createSubarrayArray(int) - Method in class brutil.Array

currentElement() - Method in interface brutil.ListIterator

Returns the current element this Iterator points to, which is the value returned by the last call to next().

D

decreaseKey(HandlePQ, int) - Method in class brutil.PriorityQueueHeap

Look at the (key, value) pair referenced by Handle h.

decreaseKey(HandlePQ, int) - Method in class brutil.PriorityQueueRadix

Decreases the key value of the specified element.

decreaseKey(HandlePQ, int) - Method in class brutil.PriorityQueueHeapArray

Look at the (key, value) pair referenced by Handle h.

defaultCapacityIncrement - Static variable in class brutil.Array

defaultInitialCapacity - Static variable in class brutil.Array

defaultMaxSize - Static variable in class brutil.ArraySet

delete() - Method in class brutil.HandlePQ

Sets the boolean variable "deleted" to true

depth() - Method in class brutil.BSTree

dequeue() - Method in class brutil.AbstractQueue

Remove an object from the front of the Queue.

dequeue() - Method in interface brutil.Queue

Remove an object from the front of the Queue.

doGets(int, int) - Method in class brutil.MapTestResults

Performs timings on the get method of the Map.

doMath() - Method in class brutil.MapTestResults

Performs basic mathematical analysis on the data collected.

doPuts(int, int, Object) - Method in class brutil.MapTestResults

Performs timings on the put method of the Map.

doRemoves(int, int) - Method in class brutil.MapTestResults

Performs timings on the remove method of the Map.

doubleArray(int) - Method in class brutil.PriorityQueueHeapArray

Doubles the array size

E

enqueue(Object) - Method in class brutil.AbstractQueue

Add an object to the back of the Queue.

enqueue(Object) - Method in interface brutil.Queue

Add an object to the back of the Queue.

Entry - class brutil.Entry.

Entry() - Constructor for class brutil.Entry

Entry(Object, Object) - Constructor for class brutil.Entry

equals(Object) - Method in class brutil.Entry

equals(TreeEntry) - Method in class brutil.TreeEntry

extractFirst() - Method in interface brutil.PriorityQueue

Get the element with greatest priority out of the queue

extractFirst() - Method in class brutil.BinaryHeap

extractMin() - Method in class brutil.PriorityQueueHeap

Extract the (key, value) pair associated with the smallest key in the queue and return its "value" object.

extractMin() - Method in class brutil.PriorityQueueRadix

Extracts the object with the smallest key value from the array Then the array is traversed to find the next smallest key

extractMin() - Method in class brutil.PriorityQueueHeapArray

Extract the (key, value) pair associated with the smallest key in the queue and return its "value" object.

F

find(Object) - Method in class brutil.AbstractMultiSet

find(Object) - Method in class brutil.AbstractSortedMultiSet

find(Object) - Method in class brutil.RBSet

Returns the object that is mapped to the given key.

find(Object) - Method in class brutil.HashSet

find(Object) - Method in class brutil.AbstractSortedList

find(Object) - Method in interface brutil.Set

findEntry(Object) - Method in class brutil.BSTree

FULLOUTPUT - Static variable in class brutil.MapTestResults

G

get() - Method in class brutil.NoncyclicReference

get(int) - Method in class brutil.Array

Gets the object at the specified index.

get(Object) - Method in class brutil.BSTree

Find an Object in the Tree, return the Node where object found or null if object is not found

get(Object) - Method in interface brutil.Map

Returns the value to which the specified key is mapped in this Map.

get(Object) - Method in class brutil.AbstractMap

Returns the value to which the specified key is mapped in this Map.

getContents() - Method in class brutil.BinaryHeap.Element

getData(Handle) - Method in class brutil.BinaryHeap

getFirst() - Method in class brutil.ArrayList

Returns the first element of the list

getFirst() - Method in class brutil.LinkedList

Returns the element at the beginning of the list.

getFirst() - Method in interface brutil.List

Returns the element at the beginning of the list.

getFirstKey() - Method in interface brutil.PriorityQueue

Get the key of the object with greatest priority.

getFirstKey() - Method in class brutil.BinaryHeap

getHandle() - Method in class brutil.BinaryHeap.Element

getIndex() - Method in class brutil.BinaryHeap.Element

getIndex() - Method in class brutil.Handle

getKey() - Method in class brutil.TreeEntry

getKey() - Method in class brutil.BinaryHeap.Element

getKey() - Method in class brutil.HandlePQ

Returns the key value stored

getKey() - Method in class brutil.Entry

Returns the key in this Entry.

getKey(Handle) - Method in class brutil.BinaryHeap

getLast() - Method in class brutil.ArrayList

Returns the element at the end of the list.

getLast() - Method in class brutil.LinkedList

Returns the element at the end of the list.

getLast() - Method in interface brutil.List

Returns the element at the end of the list.

getObj() - Method in class brutil.HandlePQ

Returns the object value

getPosition() - Method in class brutil.HandlePQ

Returns the array postion of this object

getSize() - Method in class brutil.BSTree

return the size of the tree

getType() - Method in class brutil.BinaryHeap

getValue() - Method in class brutil.TreeEntry

getValue() - Method in class brutil.Entry

Returns the data value of this Entry.

H

Handle - class brutil.Handle.

A handle for use with a BinaryHeap.

Handle(int) - Constructor for class brutil.Handle

handleGetKey(HandlePQ) - Method in class brutil.PriorityQueueHeapArray

Get the key of the (key, value) pair associated with a given Handle.

handleGetValue(HandlePQ) - Method in class brutil.PriorityQueueHeapArray

Get the value object of the (key, value) pair associated with a given Handle.

HandlePQ - class brutil.HandlePQ.

HandlePQ(Object, int) - Constructor for class brutil.HandlePQ

hash(Object) - Method in class brutil.SimpleModHashFunction

Hashes a key for use in a RealtimeHashLite.

hash(Object) - Method in interface brutil.HashFunction

Returns a HashCoord corresponding to the given key object.

hashCode() - Method in class brutil.Entry

Returns the hashcode of the key object.

HashCoord - class brutil.HashCoord.

This class encapsulates the subtable number, and the bucket number, used in a HashMap.

HashCoord(int, int) - Constructor for class brutil.HashCoord

Sole constructor.

HashFunction - interface brutil.HashFunction.

This class provides a HashFunction interface that encapsulates a function that creates a HashCoord from a key object.

HashMap - class brutil.HashMap.

A HashMap implements the Map interface; therefore its purpose is associating keys and values.

HashMap() - Constructor for class brutil.HashMap

HashSet - class brutil.HashSet.

HashSet.Table - class brutil.HashSet.Table.

HashSet.Table.Bucket - class brutil.HashSet.Table.Bucket.

HashSet.Table.Bucket(HashSet.Table) - Constructor for class brutil.HashSet.Table.Bucket

HashSet.Table(HashSet) - Constructor for class brutil.HashSet.Table

HashSet() - Constructor for class brutil.HashSet

hasNext() - Method in interface brutil.ListIterator

Returns true if an element exists after the cursor.

hasNext() - Method in class brutil.BSTree.BSTIterator

hasNext() - Method in class brutil.RBSet.RBIterator

hasPrevious() - Method in interface brutil.ReverseListIterator

Returns true if an element exists before the cursor (i.e., if previous will return an element).

heap - Variable in class brutil.BinaryHeap

heapify(int) - Method in class brutil.PriorityQueueHeap

Recusive method that maintains the heap property of the priority queue

I

initialize() - Method in class brutil.MapTestResults

Performs a put followed by a remove on the Map.

initMemory() - Method in class brutil.ArrayList

initMemory() - Method in class brutil.BSTree

initMemory() - Method in class brutil.Array

initMemory() - Method in class brutil.Array.Subarray

initMemory() - Method in class brutil.RBSet

Associates the given key with the given value.

initMemory() - Method in class brutil.Subarray

initMemory(int) - Method in class brutil.BinaryHeap

inputDepth() - Method in class brutil.BSTree

insert(Comparable, Object) - Method in interface brutil.PriorityQueue

Insert this the given item in the heap, and organize it based on the specified key.

insert(Comparable, Object) - Method in class brutil.BinaryHeap

Places the specified element into the heap and arranges it based on the value of key.

insert(int, Object) - Method in class brutil.PriorityQueueHeap

Insert a pair (key, obj) into the queue, and return a Handle to this pair so that we can find it later in constant time.

insert(int, Object) - Method in class brutil.PriorityQueueRadix

Appends a wrapper object with the value and its key to a list in the array The key is used as the radix postion of the array.

insert(int, Object) - Method in class brutil.PriorityQueueHeapArray

Insert a pair (key, value) into the queue, and return a Handle to this pair so that we can find it later in constant time.

insert(Object) - Method in interface brutil.ReverseListIterator

The given element is inserted immediately after the cursor.

insert(Object) - Method in interface brutil.ListIterator

The given element is inserted immediately before the cursor.

isDeleted() - Method in class brutil.HandlePQ

Returns the value of the "deleted" variable

isEmpty() - Method in class brutil.ArrayList

Returns true if there are no elements in the list (size == 0).

isEmpty() - Method in class brutil.AbstractListing

Returns true if the List/Collection contains no elements, false otherwise

isEmpty() - Method in class brutil.BSTree

isEmpty() - Method in class brutil.Array

Returns true if empty

isEmpty() - Method in class brutil.AbstractMap

Returns true if the Collection contains no elements, false otherwise

isEmpty() - Method in class brutil.RBSet

Returns true if the Tree is empty, false otherwise

isEmpty() - Method in class brutil.HashSet

isEmpty() - Method in class brutil.BinaryHeap

isEmpty() - Method in interface brutil.Queue

isEmpty() - Method in class brutil.PriorityQueueHeap

Return true if there are no elements in the Priority Queue

isEmpty() - Method in class brutil.PriorityQueueRadix

Returns true if the Priority Queue is empty

isEmpty() - Method in interface brutil.Collection

Returns true if the Collection contains no elements, false otherwise

isEmpty() - Method in interface brutil.Set

isEmpty() - Method in class brutil.PriorityQueueHeapArray

Return true if there are no elements in the Priority Queue

isEmpty() - Method in class brutil.LinkedList

Returns true if there are no elements in the list size == 0.

isEmpty() - Method in interface brutil.List

Returns true if there are no elements in the list size == 0.

iterator() - Method in class brutil.ArrayList

Returns a ListIterator pointing to the head of the list.

iterator() - Method in class brutil.AbstractMultiSet

Returns an iterator over the elements in the set.

iterator() - Method in class brutil.BSTree

Return a binary search tree \iterator

iterator() - Method in interface brutil.SortedMap

Returns an Iterator for this tree.

iterator() - Method in class brutil.RBSet

Returns an Iterator for this tree.

iterator() - Method in class brutil.HashSet

iterator() - Method in interface brutil.Set

Returns an iterator over the elements in the set.

iterator() - Method in class brutil.LinkedList

Returns an ListIterator.

iterator() - Method in interface brutil.List

Returns an ListIterator.

L

level - Variable in class brutil.BSTree

LinkedList - class brutil.LinkedList.

SinglyLinkedList implementation - caters to the List interface.

LinkedList() - Constructor for class brutil.LinkedList

LinkedMap - class brutil.LinkedMap.

LinkedMap() - Constructor for class brutil.LinkedMap

LinkedMultiSet - class brutil.LinkedMultiSet.

LinkedMultiSet() - Constructor for class brutil.LinkedMultiSet

LinkedQueue - class brutil.LinkedQueue.

LinkedQueue() - Constructor for class brutil.LinkedQueue

LinkedSet - class brutil.LinkedSet.

This is a simple version of Set based on a LinkedList.

LinkedSet() - Constructor for class brutil.LinkedSet

LinkedSortedSet - class brutil.LinkedSortedSet.

LinkedSortedSet() - Constructor for class brutil.LinkedSortedSet

LinkedStack - class brutil.LinkedStack.

LinkedStack() - Constructor for class brutil.LinkedStack

list - Variable in class brutil.AbstractListing

List - interface brutil.List.

An interface for methods common to any sequence of elements.

listFactory() - Method in class brutil.AbstractListing

Override this in concrete implementation.

listFactory() - Method in class brutil.LinkedStack

listFactory() - Method in class brutil.ArraySet

listFactory() - Method in class brutil.ArrayStack

listFactory() - Method in class brutil.LinkedSet

listFactory() - Method in class brutil.LinkedQueue

listFactory() - Method in class brutil.LinkedMultiSet

listFactory() - Method in class brutil.ArrayQueue

listFactory() - Method in class brutil.LinkedSortedSet

listFactory() - Method in class brutil.ArrayMultiSet

listFactory() - Method in class brutil.ArraySortedSet

ListIterator - interface brutil.ListIterator.

A uni-directional iterator that moves in the forward direction.

M

main(String[]) - Static method in class brutil.ArrayList

main(String[]) - Static method in class brutil.PriorityQueueDemo

main(String[]) - Static method in class brutil.SetTester

Map - interface brutil.Map.

Used for associating (key, value) pairs of objects.

MapTestResults - class brutil.MapTestResults.

It performs unit timing tests using a HighResTimer upon the get, put, and remove methods.

MapTestResults(Map, HighResTimer, int, int) - Constructor for class brutil.MapTestResults

Constructs a MapTestResults using the Map, HighResTimer, number of Elements, and specified Random seed

MAX - Static variable in class brutil.BinaryHeap

MAX_PERMITS - Variable in class brutil.Mutex

maxElement() - Method in class brutil.AbstractSortedMultiSet

Returns the maximum element in the Set.

maxElement() - Method in class brutil.RBSet

Returns the maximum key in the tree.

maxElement() - Method in interface brutil.SortedSet

Returns the maximum element in the Set.

maxEntry(BSTree.Entry) - Method in class brutil.BSTree

maxKey() - Method in class brutil.BSTree

return Node with largest key

maxKey() - Method in interface brutil.SortedMap

Returns the maximum key in the Map.

maxLength() - Method in class brutil.ArrayList

maxLength() - Method in class brutil.Array

Returns the maximum length of the Array.

MIN - Static variable in class brutil.BinaryHeap

min() - Method in class brutil.PriorityQueueHeap

Return the HandlePQ object with the smallest key in the queue.

min() - Method in class brutil.PriorityQueueRadix

Returns the smallest key value in the Priority Queue

min() - Method in class brutil.PriorityQueueHeapArray

Return the HandlePQ object with the smallest key in the queue.

minElement() - Method in class brutil.AbstractSortedMultiSet

Returns the minimum element in the Set.

minElement() - Method in class brutil.RBSet

Returns the minimum key in the tree.

minElement() - Method in interface brutil.SortedSet

Returns the minimum element in the Set.

minEntry(BSTree.Entry) - Method in class brutil.BSTree

minKey() - Method in class brutil.BSTree

return Node with the smallest key

minKey() - Method in interface brutil.SortedMap

Returns the minimum key in the Map.

MultiSet - interface brutil.MultiSet.

Same as the Set interface, only a MultiSet may contain more than one instance of a single object.

Mutex - class brutil.Mutex.

Mutex() - Constructor for class brutil.Mutex

N

next - Variable in class brutil.BSTree.BSTIterator

next() - Method in interface brutil.ListIterator

Returns the element after the cursor and advances the cursor forwards.

next() - Method in class brutil.BSTree.BSTIterator

next() - Method in class brutil.RBSet.RBIterator

nextElement(Object) - Method in class brutil.AbstractSortedMultiSet

Returns the lowest element that is greater that the specified element.

nextElement(Object) - Method in class brutil.RBSet

Returns the lowest key that is greater that the specified key.

nextElement(Object) - Method in interface brutil.SortedSet

Returns the lowest element that is greater that the specified element.

nextEntry(Object) - Method in class brutil.BSTree

nextKey(Object) - Method in class brutil.BSTree

Returns the smallest key that is greater than the specified key

nextKey(Object) - Method in interface brutil.SortedMap

Returns the lowest key that is greater that the specified key.

NoncyclicReference - class brutil.NoncyclicReference.

NoncyclicReference() - Constructor for class brutil.NoncyclicReference

NoncyclicReference(ReferenceCountable) - Constructor for class brutil.NoncyclicReference

numOccurences(Object) - Method in class brutil.AbstractMultiSet

Return the number of times the specified object occurs in the set.

numOccurences(Object) - Method in class brutil.AbstractSortedList

Return the number of times the specified object occurs in the set.

numOccurences(Object) - Method in interface brutil.MultiSet

Return the number of times the specified object occurs in the set.

O

OUTPUT - Static variable in class brutil.MapTestResults

P

peek() - Method in class brutil.AbstractStack

Returns the object at the top of the stack

peek() - Method in interface brutil.Stack

Returns the object at the top of the stack

peek() - Method in class brutil.AbstractQueue

Returns the first object in the Queue without removing it.

peek() - Method in interface brutil.Queue

Returns the first object in the Queue without removing it.

permits - Variable in class brutil.Mutex

pop() - Method in class brutil.AbstractStack

Removes and returns the object at the top of the stack

pop() - Method in interface brutil.Stack

Removes and returns the object at the top of the stack

predictTime(String, State) - Method in class brutil.Array

prepend(Object) - Method in class brutil.ArrayList

Prepends the given element to the beginning of the list.

prepend(Object) - Method in class brutil.LinkedList

Prepends given element to the beginning of the list.

prepend(Object) - Method in interface brutil.List

Prepends given element to the beginning of the list.

prev - Variable in class brutil.BSTree.BSTIterator

prevElement(Object) - Method in class brutil.AbstractSortedMultiSet

Returns the greatest element that is less that the specified element.

prevElement(Object) - Method in class brutil.RBSet

Returns the greatest key that is less that the specified key.

prevElement(Object) - Method in interface brutil.SortedSet

Returns the greatest element that is less that the specified element.

prevEntry(Object) - Method in class brutil.BSTree

previous() - Method in interface brutil.ReverseListIterator

Returns the element before the cursor and advances the cursor backwards.

prevKey(Object) - Method in class brutil.BSTree

Returns the greatest key that is smaller than the specified key

prevKey(Object) - Method in interface brutil.SortedMap

Returns the greatest key that is less that the specified key.

printArray() - Method in class brutil.ArrayList

PriorityQueue - interface brutil.PriorityQueue.

PriorityQueueDemo - class brutil.PriorityQueueDemo.

This class tests the different versions of priority queues for correctness

PriorityQueueDemo() - Constructor for class brutil.PriorityQueueDemo

PriorityQueueHeap - class brutil.PriorityQueueHeap.

PriorityQueue.java Created: Wed Sep 25 16:04:47 2002

PriorityQueueHeap() - Constructor for class brutil.PriorityQueueHeap

PriorityQueueHeapArray - class brutil.PriorityQueueHeapArray.

PriorityQueueHeapArray() - Constructor for class brutil.PriorityQueueHeapArray

PriorityQueueRadix - class brutil.PriorityQueueRadix.

PriorityQueueRadix(int) - Constructor for class brutil.PriorityQueueRadix

push(Object) - Method in class brutil.AbstractStack

Inserts the specified object at the top of the stack

push(Object) - Method in interface brutil.Stack

Inserts the specified object at the top of the stack

put(Object, Object) - Method in class brutil.BSTree

Insert the object accordingly maintaining the binary search tree structure

put(Object, Object) - Method in interface brutil.Map

Maps the specified key to the specified value in this Map.

put(Object, Object) - Method in class brutil.AbstractMap

Maps the specified key to the specified value in this Map.

Q

Queue - interface brutil.Queue.

R

RBMap - class brutil.RBMap.

RBMap() - Constructor for class brutil.RBMap

RBSet - class brutil.RBSet.

An implementation of the Set interface based on RBTree.

RBSet.RBIterator - class brutil.RBSet.RBIterator.

RBSet.RBIterator(RBSet) - Constructor for class brutil.RBSet.RBIterator

RBSet.RBNode - class brutil.RBSet.RBNode.

RBSet.RBNode(RBSet, Object, RBSet.RBNode) - Constructor for class brutil.RBSet.RBNode

RBSet() - Constructor for class brutil.RBSet

Creates an empty tree

ReadWriteMutex - class brutil.ReadWriteMutex.

This class uses a Readers-Writers mutex from Doug Lea's book, Concurrent Programming in Java, Second Edition.

ReadWriteMutex() - Constructor for class brutil.ReadWriteMutex

release() - Method in class brutil.Mutex

remove() - Method in interface brutil.ReverseListIterator

Removes the current item from the list.

remove() - Method in interface brutil.ListIterator

Removes the current item from the list.

remove() - Method in class brutil.BSTree.BSTIterator

remove() - Method in class brutil.RBSet.RBIterator

remove(Object) - Method in class brutil.AbstractMultiSet

Removes the specified object from the Set, if present.

remove(Object) - Method in class brutil.BSTree

Find the object and delete it from the tree, return true after after deleting succesfully, return false otherwise

remove(Object) - Method in interface brutil.Map

Removes the key (and its corresponding value) from this Map.

remove(Object) - Method in class brutil.AbstractMap

Removes the key (and its corresponding value) from this Map.

remove(Object) - Method in class brutil.RBSet

Removes the mapping associated with the specified key from the tree.

remove(Object) - Method in class brutil.HashSet

Removes the specified object from the Set, if present.

remove(Object) - Method in interface brutil.Set

Removes the specified object from the Set, if present.

removeAll() - Method in class brutil.BSTree

remove all element in the tree

removeAll(Object) - Method in class brutil.AbstractMultiSet

Remove all instances of specified object from the MultiSet

removeAll(Object) - Method in class brutil.AbstractSortedList

Remove all instances of specified object from the MultiSet

removeAll(Object) - Method in interface brutil.MultiSet

Remove all instances of specified object from the MultiSet

removeFirst() - Method in class brutil.ArrayList

Removes the first element of the list.

removeFirst() - Method in class brutil.LinkedList

Removes and returns the first element in the list.

removeFirst() - Method in interface brutil.List

Removes and returns the first element in the list.

removeLast() - Method in class brutil.ArrayList

Removes the last element of the list.

removeLast() - Method in class brutil.LinkedList

Removes last element in the list (optional operation).

removeLast() - Method in interface brutil.List

Removes last element in the list (optional operation).

reset() - Method in class brutil.LinkedList

reset() - Method in class brutil.NoncyclicReference

reset(Object, Object) - Method in class brutil.Entry

reset(ReferenceCountable) - Method in class brutil.NoncyclicReference

reverseIterator() - Method in class brutil.ArrayList

Returns a ReverseListIterator pointing to the end of the list.

reverseIterator() - Method in class brutil.LinkedList

Creates a ReverseListIterator (optional operation).]

reverseIterator() - Method in interface brutil.List

Creates a ReverseListIterator (optional operation).]

ReverseListIterator - interface brutil.ReverseListIterator.

A uni-directional iterator that moves in the reverse direction.

root - Variable in class brutil.BSTree

rotateCount - Variable in class brutil.RBSet

S

set - Variable in class brutil.AbstractMap

Set - interface brutil.Set.

set(Object) - Method in interface brutil.ReverseListIterator

Replaces the current item.

set(Object) - Method in interface brutil.ListIterator

Replaces the current item.

set(Object, int) - Method in class brutil.Array

Overwrites the element at this index to be the specified object and returns the former object.

set(ReferenceCountable) - Method in class brutil.NoncyclicReference

setContents(Object) - Method in class brutil.BinaryHeap.Element

setFactory() - Method in class brutil.AbstractMap

This method is abstract, to be replaced by subclasses to provide the correct implementation.

setFactory() - Method in class brutil.ArrayMap

setFactory() - Method in class brutil.RBMap

setFactory() - Method in class brutil.HashMap

setFactory() - Method in class brutil.LinkedMap

setHandle(Handle) - Method in class brutil.BinaryHeap.Element

setIndex(int) - Method in class brutil.BinaryHeap.Element

setIndex(int) - Method in class brutil.Handle

setKey(Comparable) - Method in class brutil.BinaryHeap.Element

setKey(int) - Method in class brutil.HandlePQ

Sets the key value

setMap(Map) - Method in class brutil.MapTestResults

Resets the MapTestResults to use the specified Map and clears any stored timing data

setPosition(int) - Method in class brutil.HandlePQ

Stores the array postion at which the object is stored

SetTester - class brutil.SetTester.

SetTester() - Constructor for class brutil.SetTester

setValue(Object) - Method in class brutil.TreeEntry

setValue(Object) - Method in class brutil.Entry

Changes the value to the given value, and returns the old value.

SimpleModHashFunction - class brutil.SimpleModHashFunction.

This class is a simple HashFunction for use with a RealtimeHashLite.

SimpleModHashFunction(int, int) - Constructor for class brutil.SimpleModHashFunction

Sole constructor.

size() - Method in class brutil.ArrayList

Returns the number of elements in the list.

size() - Method in class brutil.AbstractListing

Returns the size of the given List/Collection.

size() - Method in class brutil.BSTree

Default constructor, constructing an empty tree

size() - Method in class brutil.Array

Returns the size of the array from List interface.

size() - Method in class brutil.AbstractMap

Returns the size of the given Collection.

size() - Method in class brutil.RBSet

Returns the number of mappings in the tree.

size() - Method in class brutil.HashSet

Returns the number of elements in the Set.

size() - Method in class brutil.BinaryHeap

size() - Method in interface brutil.Collection

Returns the size of the given Collection.

size() - Method in class brutil.LinkedList

Returns the size of the List.

size() - Method in interface brutil.List

Returns the size of the List.

SortedMap - interface brutil.SortedMap.

SortedMultiSet - interface brutil.SortedMultiSet.

SortedSet - interface brutil.SortedSet.

Stack - interface brutil.Stack.

STARTSIZE - Static variable in class brutil.Array

Subarray - class brutil.Subarray.

Subarrays act as sub-modules for the Array.

Subarray() - Constructor for class brutil.Subarray

Protected default constructor provided for the use of subclasses.

Subarray(int) - Constructor for class brutil.Subarray

Initializes the array to this capacity.

T

table - Variable in class brutil.HashCoord

The subtable number.

toString() - Method in class brutil.TreeEntry

toString() - Method in class brutil.RBSet

toString() - Method in class brutil.RBSet.RBNode

toString() - Method in class brutil.BinaryHeap

toString() - Method in class brutil.BinaryHeap.Element

toString() - Method in class brutil.HandlePQ

Return the toString values of the key and the object stored

toString() - Method in class brutil.Entry

Returns a String representation of the key and value in this Entry.

toString() - Method in class brutil.PriorityQueueHeap

Returns all the elements in the PriorityQueue

toString() - Method in class brutil.MapTestResults

toString() - Method in class brutil.PriorityQueueRadix

Return a list of element stored inside the Priority Queue

toString() - Method in class brutil.HashCoord

returns a String representation of this HashCoord's values.

toString() - Method in class brutil.PriorityQueueHeapArray

Returns all the elements in the PriorityQueue

toString() - Method in class brutil.LinkedList

TreeEntry - class brutil.TreeEntry.

TreeEntry(Object, Object) - Constructor for class brutil.TreeEntry

MPH--These are commented out because they are specific to the Red-Black Tree.

U

updateKey(Handle, Comparable) - Method in interface brutil.PriorityQueue

Change the key of the item in the queue pointed to by the specified Handle to the specified Comparable.

updateKey(Handle, Comparable) - Method in class brutil.BinaryHeap

Changes the key of the entry with the specified handle to the newKey.

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