| Interface | Description |
|---|---|
| DoubleNavigableSet |
A Type Specific Navigable Set interface with a couple helper methods
|
| DoubleOrderedSet |
A Special Set Interface giving Access to some really usefull functions
The Idea behind this interface is to allow access to functions that give control to the Order of elements.
|
| DoubleSet |
A Type Specific Set class to reduce boxing/unboxing
|
| DoubleSortedSet |
A Type Specific SortedSet implementation to reduce boxing/unboxing
with a couple extra methods that allow greater control over sets.
|
| Class | Description |
|---|---|
| AbstractDoubleSet |
Abstract Type Specific Set that reduces boxing/unboxing
|
| DoubleArraySet |
A Type Specific ArraySet implementation.
|
| DoubleAVLTreeSet |
A Simple Type Specific AVL TreeSet implementation that reduces boxing/unboxing.
|
| DoubleLinkedOpenCustomHashSet |
A Type Specific LinkedHashSet that allows for custom HashControl.
|
| DoubleLinkedOpenHashSet |
A Type Specific LinkedHashMap implementation that uses specific arrays to create links between nodes to remove the wrapping of elements
to greatly reduce memory usage.
|
| DoubleOpenCustomHashSet |
A Type Specific HashSet that allows for custom HashControl.
|
| DoubleOpenHashSet |
A Type Specific Custom implementation of the HashSet
Instead of using Wrapper Object Arrays for storing keys and values there is dedicated arrays for storing keys.
|
| DoubleRBTreeSet |
A Simple Type Specific RB TreeSet implementation that reduces boxing/unboxing.
|
| ImmutableDoubleOpenHashSet |
A Type Specific Custom implementation of the HashSet
Instead of using Wrapper Object Arrays for storing keys and values there is dedicated arrays for storing keys.
|