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

A

add(TimeAssociation<T>) - Method in class heaps.event.hierarchy.BetweenHeap
 
add(TimeAssociation<T>) - Method in class heaps.event.hierarchy.LeafHeap
 
add(TimeAssociation<T>) - Method in class heaps.event.hierarchy.RootHeap
 
add(TimeAssociation<E>) - Method in class heaps.event.SortedList
 
add(E) - Method in class heaps.generic.DuplicateGenericHeap
 
add(E) - Method in class heaps.generic.FastGenericHeap
 
add(E) - Method in class heaps.generic.GenericHeap
Adds the object element to the heap.
add(E) - Method in class heaps.generic.SingletonGenericHeap
 
addAll(Collection<? extends TimeAssociation<E>>) - Method in class heaps.event.SortedList
 
allowsDuplicates() - Method in class heaps.event.hierarchy.BetweenHeap
 
allowsDuplicates() - Method in class heaps.event.hierarchy.LeafHeap
 
allowsDuplicates() - Method in class heaps.event.hierarchy.RootHeap
 
allowsDuplicates() - Method in class heaps.generic.DuplicateGenericHeap
 
allowsDuplicates() - Method in class heaps.generic.FastGenericHeap
 
allowsDuplicates() - Method in class heaps.generic.GenericHeap
Returns whether this heap allows duplicate elements.
allowsDuplicates() - Method in class heaps.generic.SingletonGenericHeap
 
ArrayBackedEventHeap<T> - Class in heaps.event
A implementation of the EventHeap interface that executes all methods it defines in O(N) time.
ArrayBackedEventHeap() - Constructor for class heaps.event.ArrayBackedEventHeap
 
ArrayBackedMappingHeap<K,V> - Class in heaps.mapping
A implementation of the MappingHeap interface that is only backed by an array.
ArrayBackedMappingHeap() - Constructor for class heaps.mapping.ArrayBackedMappingHeap
Creates a new heap with the backing array having an initial size of 16.
ArrayBackedMappingHeap(int) - Constructor for class heaps.mapping.ArrayBackedMappingHeap
Creates a new heap with the backing array having the specified initial size.
ArrayBackedMappingHeap(Comparator<? super K>) - Constructor for class heaps.mapping.ArrayBackedMappingHeap
Creates a new heap with the backing array having an initial size of 16.
ArrayBackedMappingHeap(Comparator<? super K>, int) - Constructor for class heaps.mapping.ArrayBackedMappingHeap
Creates a new heap with the backing array having the specified initial size.

B

BetweenHeap<T extends HeapChild> - Class in heaps.event.hierarchy
A wrapper for a EventHeap object, allowing it to be presented as both a timer (by implementing interface HeapChild, enabling it to be added into other heaps), and a heap into which timers can be added (by implementing interface HeapParent).
BetweenHeap(HeapParent<HeapChild>, EventHeap<T>) - Constructor for class heaps.event.hierarchy.BetweenHeap
Creates a new wrapper for a TimedHeap object, allowing it to be used as an intermediate node along a hierarchy of heaps.

C

clear() - Method in class heaps.event.hierarchy.BetweenHeap
 
clear() - Method in class heaps.event.hierarchy.LeafHeap
 
clear() - Method in class heaps.event.hierarchy.RootHeap
 
clear() - Method in class heaps.event.SortedList
 
clear() - Method in class heaps.generic.FastGenericHeap
 
clear() - Method in interface heaps.Heap
Removes all elements from the heap.
clear() - Method in class heaps.mapping.ArrayBackedMappingHeap
 
clear() - Method in class heaps.mapping.FastMappingHeap
 
ComparableTimeAssociation<T> - Class in heaps.event
An class representing an association between an object and a specified time.
ComparableTimeAssociation(T, long) - Constructor for class heaps.event.ComparableTimeAssociation
Creates a new association between object _obj and time _time.
compareTo(ComparableTimeAssociation<T>) - Method in class heaps.event.ComparableTimeAssociation
Compares the time of this TimeAssociation object with the time of TimeAssociation object ta.
contains(TimeAssociation<T>) - Method in class heaps.event.hierarchy.BetweenHeap
 
contains(TimeAssociation<T>) - Method in class heaps.event.hierarchy.LeafHeap
 
contains(TimeAssociation<T>) - Method in class heaps.event.hierarchy.RootHeap
 
contains(TimeAssociation<E>) - Method in class heaps.event.SortedList
Returns whether the given TimeAssociation is contained in the list.
contains(Object) - Method in class heaps.event.SortedList
 
contains(E) - Method in class heaps.generic.FastGenericHeap
 
contains(E) - Method in class heaps.generic.GenericHeap
Returns whether the heap contains the argument element.
contains(K) - Method in class heaps.mapping.ArrayBackedMappingHeap
 
contains(K) - Method in class heaps.mapping.FastMappingHeap
 
contains(K) - Method in class heaps.mapping.MappingHeap
Returns whether a value is mapped to by the given key.
containsAll(Collection<?>) - Method in class heaps.event.SortedList
 
containsElement(T) - Method in class heaps.event.EventHeap
Returns whether there exists a TimeAssociation in the heap that is associated with the given element parameter.
containsElement(T) - Method in class heaps.event.hierarchy.BetweenHeap
 
containsElement(T) - Method in class heaps.event.hierarchy.LeafHeap
 
containsElement(T) - Method in class heaps.event.hierarchy.RootHeap
 
containsElement(E) - Method in class heaps.event.SortedList
Returns whether there exists a TimeAssociation in the list that is associated with the given element parameter.

D

DuplicateGenericHeap<E> - Class in heaps.generic
An implementation of interface GenericHeap that allows duplicates.
DuplicateGenericHeap() - Constructor for class heaps.generic.DuplicateGenericHeap
Creates a new heap with the backing array having an initial size of 16.
DuplicateGenericHeap(int) - Constructor for class heaps.generic.DuplicateGenericHeap
Creates a new heap with the backing array having the specified initial size.
DuplicateGenericHeap(Comparator<? super E>) - Constructor for class heaps.generic.DuplicateGenericHeap
Creates a new heap with the backing array having an initial size of 16.
DuplicateGenericHeap(Comparator<? super E>, int) - Constructor for class heaps.generic.DuplicateGenericHeap
Creates a new heap with the backing array having the specified initial size.

E

equals(Object) - Method in class heaps.event.ComparableTimeAssociation
Returns whether this TimeAssociation object is equal to arg.
equals(Object) - Method in class heaps.event.TimeAssociation
Returns whether this TimeAssociation object is equal to arg.
EventHeap<T> - Class in heaps.event
An interface for all heaps that contain timers as their elements.
extract() - Method in class heaps.event.hierarchy.BetweenHeap
 
extract() - Method in class heaps.event.hierarchy.LeafHeap
 
extract() - Method in class heaps.event.hierarchy.RootHeap
 
extract() - Method in class heaps.generic.FastGenericHeap
 
extract() - Method in interface heaps.Heap
Extracts the next element from the heap.
extract() - Method in class heaps.mapping.ArrayBackedMappingHeap
 
extract() - Method in class heaps.mapping.FastMappingHeap
 

F

FastEventHeap<T> - Class in heaps.event
A implementation of the EventHeap interface that executes all methods it defines in O(lg N) time.
FastEventHeap() - Constructor for class heaps.event.FastEventHeap
 
FastGenericHeap<E> - Class in heaps.generic
A fast implementation of the GenericHeap interface that does not allow duplicates.
FastGenericHeap() - Constructor for class heaps.generic.FastGenericHeap
Creates a new heap with the backing array having an initial size of 16.
FastGenericHeap(int) - Constructor for class heaps.generic.FastGenericHeap
Creates a new heap with the backing array having the specified initial size.
FastGenericHeap(Comparator<? super E>) - Constructor for class heaps.generic.FastGenericHeap
Creates a new heap with the backing array having an initial size of 16.
FastGenericHeap(Comparator<? super E>, int) - Constructor for class heaps.generic.FastGenericHeap
Creates a new heap with the backing array having the specified initial size.
FastMappingHeap<K,V> - Class in heaps.mapping
A fast implementation of the MappingHeap interface.
FastMappingHeap() - Constructor for class heaps.mapping.FastMappingHeap
Creates a new heap with the backing array having an initial size of 16.
FastMappingHeap(int) - Constructor for class heaps.mapping.FastMappingHeap
Creates a new heap with the backing array having the specified initial size.
FastMappingHeap(Comparator<? super K>) - Constructor for class heaps.mapping.FastMappingHeap
Creates a new heap with the backing array having an initial size of 16.
FastMappingHeap(Comparator<? super K>, int) - Constructor for class heaps.mapping.FastMappingHeap
Creates a new heap with the backing array having the specified initial size.

G

GenericHeap<E> - Class in heaps.generic
An extension of the Heap interface that provides methods for adding, removing, and querying the membership of heap elements.
get(int) - Method in class heaps.event.SortedList
Returns the element at the specified position in this list.
get(K) - Method in class heaps.mapping.ArrayBackedMappingHeap
 
get(K) - Method in class heaps.mapping.FastMappingHeap
 
get(K) - Method in class heaps.mapping.MappingHeap
Returns the value that is mapped to by the given key.
getComparator() - Method in class heaps.generic.GenericHeap
Returns the comparator associated with this heap, or null if it uses its elements' natural ordering.
getComparator() - Method in class heaps.mapping.MappingHeap
Returns the comparator associated with this heap, or null if it uses its elements' natural ordering.
getFirst() - Method in class heaps.event.SortedList
Returns the first element from this list.
getKey() - Method in class heaps.mapping.MappingHeapEntry
Returns the key in this key-value mapping.
getLast() - Method in class heaps.event.SortedList
Returns the last element from this list.
getMaxComparator() - Static method in class heaps.event.TimeAssociation
Returns a comparator such that for two TimeAssociation objects ta1 and ta2, ta1 < ta2 if and only if ta1.getTime() > ta2.getTime.
getMinComparator() - Static method in class heaps.event.TimeAssociation
Returns a comparator such that for two TimeAssociation objects ta1 and ta2, ta1 < ta2 if and only if ta1.getTime() < ta2.getTime.
getNextTime(T) - Method in class heaps.event.EventHeap
Returns the first TimeAssociation in the heap that is associated with the given element parameter.
getNextTime(T) - Method in class heaps.event.hierarchy.BetweenHeap
 
getNextTime(T) - Method in class heaps.event.hierarchy.LeafHeap
 
getNextTime(T) - Method in class heaps.event.hierarchy.RootHeap
 
getNextTime(E) - Method in class heaps.event.SortedList
Returns the first TimeAssociation that is associated with the given element parameter.
getObject() - Method in class heaps.event.ComparableTimeAssociation
Returns the object in this association.
getObject() - Method in class heaps.event.TimeAssociation
Returns the object in this association.
getSize() - Method in class heaps.event.hierarchy.BetweenHeap
 
getSize() - Method in class heaps.event.hierarchy.LeafHeap
 
getSize() - Method in class heaps.event.hierarchy.RootHeap
 
getSize() - Method in class heaps.generic.FastGenericHeap
 
getSize() - Method in interface heaps.Heap
Returns the number of elements in the heap.
getSize() - Method in class heaps.mapping.ArrayBackedMappingHeap
 
getSize() - Method in class heaps.mapping.FastMappingHeap
 
getTime() - Method in class heaps.event.ComparableTimeAssociation
Returns the time in this association.
getTime() - Method in class heaps.event.TimeAssociation
Returns the time in this association.
getValue() - Method in class heaps.mapping.MappingHeapEntry
Returns the value in this key-value mapping

H

hashCode() - Method in class heaps.event.ComparableTimeAssociation
Returns the hash code of this object.
hashCode() - Method in class heaps.event.TimeAssociation
Returns the hash code of this object.
Heap<E> - Interface in heaps
A basic interface shared by all heap implementations that only defines methods for inspecting and extracting the top element, removing all elements, and querying the heap size.
HeapChild - Interface in heaps.event.hierarchy
An interface for any timer that can be part of a heap.
HeapParent<E extends HeapChild> - Interface in heaps.event.hierarchy
An interface for any heap that can contain timers as its children.
heaps - package heaps
 
heaps.event - package heaps.event
 
heaps.event.hierarchy - package heaps.event.hierarchy
 
heaps.generic - package heaps.generic
 
heaps.mapping - package heaps.mapping
 

I

isEmpty() - Method in class heaps.event.hierarchy.BetweenHeap
 
isEmpty() - Method in class heaps.event.hierarchy.LeafHeap
 
isEmpty() - Method in class heaps.event.hierarchy.RootHeap
 
isEmpty() - Method in class heaps.event.SortedList
 
isEmpty() - Method in class heaps.generic.FastGenericHeap
 
isEmpty() - Method in interface heaps.Heap
Returns true if the heap is empty, false otherwise.
isEmpty() - Method in class heaps.mapping.ArrayBackedMappingHeap
 
isEmpty() - Method in class heaps.mapping.FastMappingHeap
 
iterator() - Method in class heaps.event.SortedList
 

L

LeafHeap<T> - Class in heaps.event.hierarchy
A wrapper for a EventHeap object, allowing it to be presented as a heap into which timers can be added by virtue of it implementing interface HeapParent.
LeafHeap(HeapParent<HeapChild>, EventHeap<T>) - Constructor for class heaps.event.hierarchy.LeafHeap
Creates a new wrapper for a TimedHeap object, allowing it to be used as a leaf node along a hierarchy of heaps.

M

MappingHeap<K,V> - Class in heaps.mapping
An extension to the Heap interface that allows for mappings between keys and values.
MappingHeapEntry<K,V> - Class in heaps.mapping
An entry in a mapping heap, consisting of a key and a value.

P

process(long) - Method in class heaps.event.hierarchy.BetweenHeap
 
process(long) - Method in interface heaps.event.hierarchy.HeapChild
This callback method is invoked when the heap that this timer is part of has determined that the timer has expired.
process(T, long) - Method in class heaps.event.hierarchy.LeafHeap
This method is invoked each time a timer expires.
put(K, V) - Method in class heaps.mapping.ArrayBackedMappingHeap
 
put(K, V) - Method in class heaps.mapping.FastMappingHeap
 
put(K, V) - Method in class heaps.mapping.MappingHeap
Creates a mapping from the given key to the given value.

R

remove(TimeAssociation<T>) - Method in class heaps.event.hierarchy.BetweenHeap
 
remove(T) - Method in class heaps.event.hierarchy.BetweenHeap
 
remove(E) - Method in interface heaps.event.hierarchy.HeapParent
This method is invoked by a timer when it wishes to remove itself from the heap, so that its process method is never invoked.
remove(TimeAssociation<T>) - Method in class heaps.event.hierarchy.LeafHeap
 
remove(TimeAssociation<T>) - Method in class heaps.event.hierarchy.RootHeap
 
remove(T) - Method in class heaps.event.hierarchy.RootHeap
 
remove(TimeAssociation<E>) - Method in class heaps.event.SortedList
Removes the first TimeAssociation object from the list that is equal to parameter obj.
remove(int) - Method in class heaps.event.SortedList
Removes the element at the specified position in this list and returns it.
remove(Object) - Method in class heaps.event.SortedList
 
remove(E) - Method in class heaps.generic.FastGenericHeap
 
remove(E) - Method in class heaps.generic.GenericHeap
Finds the object in the heap equal to element, removes it, and returns true.
remove(K) - Method in class heaps.mapping.ArrayBackedMappingHeap
 
remove(K) - Method in class heaps.mapping.FastMappingHeap
 
remove(K) - Method in class heaps.mapping.MappingHeap
Removes the mapping for the given key if one exists.
removeAll(Collection<?>) - Method in class heaps.event.SortedList
 
removeFirst() - Method in class heaps.event.SortedList
Removes and returns the first element from this list.
removeLast() - Method in class heaps.event.SortedList
Removes and returns the last element from this list.
removeNextTime(T) - Method in class heaps.event.EventHeap
Returns and removes the first TimeAssociation in the heap that is associated with the given element parameter.
removeNextTime(T) - Method in class heaps.event.hierarchy.BetweenHeap
 
removeNextTime(T) - Method in class heaps.event.hierarchy.LeafHeap
 
removeNextTime(T) - Method in class heaps.event.hierarchy.RootHeap
 
removeNextTime(E) - Method in class heaps.event.SortedList
Removes and returns the first TimeAssociation in the list that is associated with the given element parameter.
retainAll(Collection<?>) - Method in class heaps.event.SortedList
 
RootHeap<T extends HeapChild> - Class in heaps.event.hierarchy
A wrapper for a EventHeap object, allowing it to be presented as a heap into which timers can be added by virtue of it implementing interface HeapParent.
RootHeap(EventHeap<T>) - Constructor for class heaps.event.hierarchy.RootHeap
Creates a new wrapper for a TimedHeap object, allowing it to be used as a root node along a hierarchy of heaps.

S

setNextTime(TimeAssociation<T>, boolean) - Method in class heaps.event.EventHeap
Substitues the given parameter for the first TimeAssociation in the heap that is associated with the object returned by method getObject of the parameter.
setNextTime(TimeAssociation<T>, boolean) - Method in class heaps.event.hierarchy.BetweenHeap
 
setNextTime(TimeAssociation<T>, boolean) - Method in class heaps.event.hierarchy.LeafHeap
 
setNextTime(TimeAssociation<T>, boolean) - Method in class heaps.event.hierarchy.RootHeap
 
SingletonGenericHeap<E> - Class in heaps.generic
An implementation of interface GenericHeap that does not allow duplicates.
SingletonGenericHeap() - Constructor for class heaps.generic.SingletonGenericHeap
Creates a new heap with the backing array having an initial size of 16.
SingletonGenericHeap(int) - Constructor for class heaps.generic.SingletonGenericHeap
Creates a new heap with the backing array having the specified initial size.
SingletonGenericHeap(Comparator<? super E>) - Constructor for class heaps.generic.SingletonGenericHeap
Creates a new heap with the backing array having an initial size of 16.
SingletonGenericHeap(Comparator<? super E>, int) - Constructor for class heaps.generic.SingletonGenericHeap
Creates a new heap with the backing array having the specified initial size.
size() - Method in class heaps.event.SortedList
 
SortedList<E> - Class in heaps.event
A class that maintains a sorted list of TimeAssociation objects.
SortedList() - Constructor for class heaps.event.SortedList
Creates a new sorted list of TimeAssociation elements.
SortedList(Comparator<? super TimeAssociation<E>>) - Constructor for class heaps.event.SortedList
Creates a new sorted list of TimeAssociation elements.

T

TimeAssociation<T> - Class in heaps.event
An class representing an association between an object and a specified time.
TimeAssociation(T, long) - Constructor for class heaps.event.TimeAssociation
Creates a new association between object _obj and time _time.
toArray() - Method in class heaps.event.SortedList
 
toArray(T[]) - Method in class heaps.event.SortedList
 
top() - Method in class heaps.event.hierarchy.BetweenHeap
 
top() - Method in class heaps.event.hierarchy.LeafHeap
 
top() - Method in class heaps.event.hierarchy.RootHeap
 
top() - Method in class heaps.generic.FastGenericHeap
 
top() - Method in interface heaps.Heap
Returns the next object element to be extracted from the heap without actually removing it from the heap.
top() - Method in class heaps.mapping.ArrayBackedMappingHeap
 
top() - Method in class heaps.mapping.FastMappingHeap
 

U

update(TimeAssociation<T>) - Method in class heaps.event.hierarchy.BetweenHeap
 
update(TimeAssociation<E>) - Method in interface heaps.event.hierarchy.HeapParent
This method is invoked by a timer when it wishes to add itself to the heap, or when it wishes to change the time at which it should be invoked.
update(TimeAssociation<T>) - Method in class heaps.event.hierarchy.RootHeap
 

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