Interface IHash

All Known Implementing Classes:

HashTable

public interface IHash

Method Summary

Modifier and Type	Method and Description
boolean	insert(java.lang.String key) Add a key to the hash table, if it is not currently in the table
java.util.Iterator<java.lang.String>	iterator() Get an iterator that return the Strings stored in the hash table one at a time.
java.util.Iterator<java.lang.String>	iterator(int i) Get an iterator for the ith bucket
void	print() Print the entire hash table.
boolean	remove(java.lang.String key) Remove a key from the hash table
java.lang.String	search(java.lang.String key) Search for a key in the hash table
int	size() Get the number of elements in the hash table
int	size(int i) Get the number of elements in the hash table at the given index

Method Detail

insert

boolean insert(java.lang.String key)

Add a key to the hash table, if it is not currently in the table

Parameters:

key - - the key to add

Returns:

true on success, false on failure (duplicate)

remove

boolean remove(java.lang.String key)

Remove a key from the hash table

Parameters:

key - - the key to remove

Returns:

true on success, false on failure (not in table)

search

java.lang.String search(java.lang.String key)

Search for a key in the hash table

Parameters:

key - - the key to search for

Returns:

the key on success, null on failure (not in table)

size

int size()

Get the number of elements in the hash table

Returns:

the number of elements in the table

size

int size(int i)

Get the number of elements in the hash table at the given index

Parameters:

i - the index in the hash table (0 to size-1)

Returns:

the size of the list in the i^th bucket

iterator

java.util.Iterator<java.lang.String> iterator()

Get an iterator that return the Strings stored in the hash table one at a time. The order should be in order of entries in the hash table itself and for a given bucket, the order in that list.

Returns:

an Interator

iterator

java.util.Iterator<java.lang.String> iterator(int i)

Get an iterator for the i^th bucket

Parameters:

i - the index in the hash table (0 to size-1)

Returns:

null if the bucket is empty, otherwise an iterator for the bucket

print

void print()

Print the entire hash table.