A B C D E F G H I J K M N P R S T U V 

A

AbstractHashMap<K,V> - Class in <Unnamed>
An abstract base class supporting Map implementations that use hash tables with MAD compression.
AbstractMap<K,V> - Class in <Unnamed>
An abstract base class to ease the implementation of the Map interface.
AbstractMap.MapEntry<K,V> - Class in <Unnamed>
A concrete implementation of the Entry interface to be used within a Map implementation.
AbstractSortedMap<K,V> - Class in <Unnamed>
An abstract base class to ease the implementation of the SortedMap interface.
AbstractHashMap() - Constructor for class AbstractHashMap
Creates a hash table with capacity 17 and prime factor 109345121.
AbstractHashMap(int) - Constructor for class AbstractHashMap
Creates a hash table with given capacity and prime factor 109345121.
AbstractHashMap(int, int) - Constructor for class AbstractHashMap
Creates a hash table with the given capacity and prime factor.
AbstractMap() - Constructor for class AbstractMap
 
AbstractSortedMap() - Constructor for class AbstractSortedMap
Initializes the map with a default comparator.
AbstractSortedMap(Comparator<K>) - Constructor for class AbstractSortedMap
Initializes the comparator for the map.

B

bucketGet(int, K) - Method in class AbstractHashMap
Returns value associated with key k in bucket with hash value h.
bucketGet(int, K) - Method in class ChainHashMap
Returns value associated with key k in bucket with hash value h.
bucketGet(int, K) - Method in class ProbeHashMap
Returns value associated with key k in bucket with hash value h.
bucketPut(int, K, V) - Method in class AbstractHashMap
Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketPut(int, K, V) - Method in class ChainHashMap
Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketPut(int, K, V) - Method in class ProbeHashMap
Associates key k with value v in bucket with hash value h, returning the previously associated value, if any.
bucketRemove(int, K) - Method in class AbstractHashMap
Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.
bucketRemove(int, K) - Method in class ChainHashMap
Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.
bucketRemove(int, K) - Method in class ProbeHashMap
Removes entry having key k from bucket with hash value h, returning the previously associated value, if found.

C

ChainHashMap<K,V> - Class in <Unnamed>
Map implementation using hash table with separate chaining.
capacity - Variable in class AbstractHashMap
 
comp - Variable in class AbstractSortedMap
The comparator defining the ordering of keys in the map.
ChainHashMap() - Constructor for class ChainHashMap
Creates a hash table with capacity 11 and prime factor 109345121.
ChainHashMap(int) - Constructor for class ChainHashMap
Creates a hash table with given capacity and prime factor 109345121.
ChainHashMap(int, int) - Constructor for class ChainHashMap
Creates a hash table with the given capacity and prime factor.
checkKey(K) - Method in class AbstractSortedMap
Determines whether a key is valid.
compare(Entry<K, V>, Entry<K, V>) - Method in class AbstractSortedMap
Method for comparing two entries according to key
compare(Entry<K, V>, K) - Method in class AbstractSortedMap
Method for comparing a key and an entry's key
compare(E, E) - Method in class DefaultComparator
Compares two elements.
compare(K, Entry<K, V>) - Method in class AbstractSortedMap
Method for comparing a key and an entry's key
compare(K, K) - Method in class AbstractSortedMap
Method for comparing two keys
createTable() - Method in class AbstractHashMap
Creates an empty table having length equal to current capacity.
createTable() - Method in class ChainHashMap
Creates an empty table having length equal to current capacity.
createTable() - Method in class ProbeHashMap
Creates an empty table having length equal to current capacity.

D

DefaultComparator<E> - Class in <Unnamed>
Comparator based on the compareTo method of a Comparable element type.
DefaultComparator() - Constructor for class DefaultComparator
 

E

Entry<K,V> - Interface in <Unnamed>
Interface for a key-value pair.
EntryIterable() - Constructor for class UnsortedTableMap.EntryIterable
 
EntryIterator() - Constructor for class UnsortedTableMap.EntryIterator
 
entrySet() - Method in class ChainHashMap
Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in interface Map
Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class ProbeHashMap
Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class SortedTableMap
Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class TreeMap
Returns an iterable collection of all key-value entries of the map.
entrySet() - Method in class UnsortedTableMap
Returns an iterable collection of all key-value entries of the map.
equals(Entry<K, V>) - Method in class AbstractMap.MapEntry
Determine equality of two entries
equals(Entry<K, V>) - Method in class TestMap.TestEntry
Returns equality of two entries
equals(Object) - Method in class AbstractMap.MapEntry
Determine equality of entry and object

F

findIndex(K) - Method in class UnsortedTableMap
Returns the index of an entry with equal key, or -1 if none found.

G

get(K) - Method in class AbstractHashMap
Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in interface Map
Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class SortedTableMap
Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class TreeMap
Returns the value associated with the specified key, or null if no such entry exists.
get(K) - Method in class UnsortedTableMap
Returns the value associated with the specified key, or null if no such entry exists.
getKey() - Method in class AbstractMap.MapEntry
Returns the key stored in this entry.
getKey() - Method in interface Entry
Returns the key stored in this entry.
getKey() - Method in class TestMap.TestEntry
Returns the key stored in this entry.
getValue() - Method in class AbstractMap.MapEntry
Returns the value stored in this entry.
getValue() - Method in interface Entry
Returns the value stored in this entry.
getValue() - Method in class TestMap.TestEntry
Returns the value stored in this entry.

H

hashValue(K) - Method in class AbstractHashMap
Hash function applying MAD method to default hash code.
hasNext() - Method in class UnsortedTableMap.EntryIterator
 

I

isEmpty() - Method in class AbstractMap
Tests whether the map is empty.
isEmpty() - Method in interface Map
Tests whether the map is empty.
iterator() - Method in class UnsortedTableMap.EntryIterable
 

J

j - Variable in class UnsortedTableMap.EntryIterator
 

K

k - Variable in class AbstractMap.MapEntry
 
key - Variable in class TestMap.TestEntry
 

M

Map<K,V> - Interface in <Unnamed>
An interface for an associative collecction, i.e., a map, that contains key/value entries.
MapEntry(K, V) - Constructor for class AbstractMap.MapEntry
Construct a map entry
main(String[]) - Static method in class TestMap
 

N

n - Variable in class AbstractHashMap
 
next() - Method in class UnsortedTableMap.EntryIterator
 

P

ProbeHashMap<K,V> - Class in <Unnamed>
Map implementation using hash table with linear probing.
prime - Variable in class AbstractHashMap
 
ProbeHashMap() - Constructor for class ProbeHashMap
Creates a hash table with capacity 17 and prime factor 109345121.
ProbeHashMap(int) - Constructor for class ProbeHashMap
Creates a hash table with given capacity and prime factor 109345121.
ProbeHashMap(int, int) - Constructor for class ProbeHashMap
Creates a hash table with the given capacity and prime factor.
put(K, V) - Method in class AbstractHashMap
Associates the given value with the given key.
put(K, V) - Method in interface Map
Associates the given value with the given key.
put(K, V) - Method in class SortedTableMap
Associates the given value with the given key.
put(K, V) - Method in class TreeMap
Associates the given value with the given key.
put(K, V) - Method in class UnsortedTableMap
Associates the given value with the given key.

R

remove() - Method in class UnsortedTableMap.EntryIterator
 
remove(K) - Method in class AbstractHashMap
Removes the entry with the specified key, if present, and returns its associated value.
remove(K) - Method in interface Map
Removes the entry with the specified key, if present, and returns its associated value.
remove(K) - Method in class SortedTableMap
Removes the entry with the specified key, if present, and returns its associated value.
remove(K) - Method in class TreeMap
Removes the entry with the specified key, if present, and returns its associated value.
remove(K) - Method in class UnsortedTableMap
Removes the entry with the specified key, if present, and returns its value.
resize(int) - Method in class AbstractHashMap
Updates the size of the hash table and rehashes all entries.

S

SortedTableMap<K,V> - Class in <Unnamed>
An implementation of a map using a sorted table.
scale - Variable in class AbstractHashMap
 
shift - Variable in class AbstractHashMap
 
SortedTableMap() - Constructor for class SortedTableMap
Constructs an empty map using the natural ordering of keys.
SortedTableMap(Comparator<K>) - Constructor for class SortedTableMap
Constructs an empty map using the given comparator to order keys.
setKey(K) - Method in class AbstractMap.MapEntry
Set the key
setValue(V) - Method in class AbstractMap.MapEntry
Set the value and return the old value
size() - Method in class AbstractHashMap
Tests whether the map is empty.
size() - Method in interface Map
Returns the number of entries in the map.
size() - Method in class SortedTableMap
Returns the number of entries in the map.
size() - Method in class TreeMap
Returns the number of entries in the map.
size() - Method in class UnsortedTableMap
Returns the number of entries in the map.

T

TestMap - Class in <Unnamed>
Class to unit test an arbitrary map implementation
TestMap.TestEntry<K,V> - Class in <Unnamed>
Class to hold test entries for comparison
TreeMap<K,V> - Class in <Unnamed>
An implementation of a sorted map using a binary search tree.
table - Variable in class ChainHashMap
a fixed capacity array of UnsortedTableMap that serve as buckets
table - Variable in class UnsortedTableMap
Underlying storage for the map of entries.
TestEntry(K, V) - Constructor for class TestMap.TestEntry
Constructor
TestMap() - Constructor for class TestMap
 
TreeMap() - Constructor for class TreeMap
Constructs an empty map using the natural ordering of keys.
TreeMap(Comparator<K>) - Constructor for class TreeMap
Constructs an empty map using the given comparator to order keys.
TestEntrySet(Supplier<M>) - Static method in class TestMap
Test entrySet method of arbitrary map
TestGet(Supplier<M>) - Static method in class TestMap
Test get method of arbitrary map
TestMap(String, Supplier<M>) - Static method in class TestMap
Test methods of arbitrary map
TestPut(Supplier<M>) - Static method in class TestMap
Test get method of arbitrary map
TestRemove(Supplier<M>) - Static method in class TestMap
Test get method of arbitrary map
toString() - Method in class AbstractMap.MapEntry
Give a string representation to help debugging

U

UnsortedTableMap<K,V> - Class in <Unnamed>
An implementation of a map using an unsorted table.
UnsortedTableMap.EntryIterable - Class in <Unnamed>
Iterator class for entries.
UnsortedTableMap.EntryIterator - Class in <Unnamed>
Iterator class for entries.
UnsortedTableMap() - Constructor for class UnsortedTableMap
Constructs an initially empty map.

V

v - Variable in class AbstractMap.MapEntry
 
value - Variable in class TestMap.TestEntry
 
A B C D E F G H I J K M N P R S T U V