|
Algorithm Development Kit 1.0 |
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
IHash<V> | Default interface for producing the slot within the hashtable for an element. |
IHashtableAccess<K,V> | Abstraction of methods that one expects a Hashtable to perform. |
Class Summary | |
---|---|
AssociativeHashTable<K,V> | HashTable that uses list collision to store objects whose keys collide. |
BinarySearch<T extends Comparable<T>> | Binary Search in Java given a pre-sorted array of the parameterized type. |
HashTable<K,V> | Provides the abstract base class for hash tables. |
ListHashTable<V> | HashTable that uses list collision to store objects whose keys collide. |
ListHashTableReporter<V> | Generate useful statistics about ListHashTable object. |
SequentialSearch<T> | Sequential Search in Java (both for indexed collections as well as collections accessed via iterators). |
SimpleHash | Implements standard java.lang.String hash computation on String objects. |
StandardHash<V> | Implements standard hashCode computation on objects. |
StringFileIterator | Return an Iterator |
Defines classes to support a variety of Search algorithms.
|
Algorithm Development Kit 1.0 | ||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |