|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use goldman.collection.set | |
---|---|
goldman.collection.set | A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. |
goldman.graph | A graph represents general relationships between pairs of elements from among a set of elements. |
Classes in goldman.collection.set used by goldman.collection.set | |
---|---|
DirectAddressing
This data structure provides excellent performance, but O(|U|) space is required. |
|
Hasher
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
A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. |
Classes in goldman.collection.set used by goldman.graph | |
---|---|
Set
A set is an untagged algorithmically positioned collection of elements in which no two elements are equivalent. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |