Package goldman.collection.set

A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent.

See:
          Description

Interface Summary
Hasher<E> The Hasher interface provides the application program the flexibility to specify how the hash codes are to be computed over the elements of the set.
Set<E> A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent.
 

Class Summary
DirectAddressing<E> This data structure provides excellent performance, but O(|U|) space is required.
DirectAddressing.DirectAddressingHasher<E> The direct addressing hasher allocates slot 0 for the null element and adds one to each of the naturally computed hash codes for the elements.
OpenAddressing<E> This data structure should also be considered when only a small fraction of the elements in the universe will be stored in the collection.
OpenAddressing.DefaultOpenAddressingHasher<E> The default open addressing hasher provides a default hasher for open addressing that hashes null to slot 0, and uses the element's hash code for all other elements.
SeparateChaining<E> This data structure should be considered when only a small fraction of the elements in U will be stored in the collection.
SeparateChaining.DefaultSeparateChainingHasher<E> The default separate chaining hasher provides a default hasher for separate chaining that hashes null to slot 0, and uses the element's hash code for all other elements.
 

Exception Summary
IllegalHashCodeException The IllegalHashCodeException is thrown when an attempt is made to use a hash code that is not between 0 and m-1 where m is the size of the hash table.
 

Package goldman.collection.set Description

A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. The primary methods are to add an element, to determine if an element is in the set, and to remove an element