| prefuse.util.collections |
|
Utility classes providing useful data structures not present in the Java
Collections framework. This package includes Map implementations for
various primitive types, a copy-on-write array list, and iterators supporting
primitive types.
|
| Java Source File Name | Type | Comment |
| AbstractHashMap.java | Class | Abstract base class for hash maps holding objects or primitive data types
such as int, float, etc. |
| AbstractLiteralIterator.java | Class | Abstract base class for a LiteralIterator implementations. |
| AbstractTreeMap.java | Class | Abstract base class for red-black trees that map a key value to
an int value. |
| BooleanIntBitSetMap.java | Class | Sorted map implementation using bit vectors to map from boolean keys to
int values. |
| BooleanIntSortedMap.java | Interface | Sorted map that maps from a boolean key to an int value. |
| ByteArrayList.java | Class | A resizable array that maintains a list of byte values. |
| CompositeComparator.java | Class | |
| CompositeIntIterator.java | Class | IntIterator implementation that combines the results of multiple
int iterators. |
| CompositeIterator.java | Class | Iterator implementation that combines the results of multiple iterators. |
| CopyOnWriteArrayList.java | Class | A thread-safe variant of
java.util.ArrayList in which all mutative
operations (add, set, and so on) are implemented by
making a fresh copy of the underlying array.
This is ordinarily too costly, but may be more efficient
than alternatives when traversal operations vastly outnumber
mutations, and is useful when you cannot or don't want to
synchronize traversals, yet need to preclude interference among
concurrent threads. |
| DefaultLiteralComparator.java | Class | Default LiteralComparator implementation that uses the natural ordering
of all data types for comparing values. |
| DoubleIntSortedMap.java | Interface | Sorted map that maps from a double key to an int value. |
| DoubleIntTreeMap.java | Class | Sorted map implementation using a red-black tree to map from double keys to
int values. |
| FloatIntSortedMap.java | Interface | Sorted map that maps from a float key to an int value. |
| FloatIntTreeMap.java | Class | Sorted map implementation using a red-black tree to map from float keys to
int values. |
| IncompatibleComparatorException.java | Class | Exception indicating a comparator is incompatible with the data type
to be compared. |
| IntArrayIterator.java | Class | IntIterator implementation that provides an iteration over the
contents of an int array. |
| IntIntSortedMap.java | Interface | Sorted map that maps from an int key to an int value. |
| IntIntTreeMap.java | Class | Sorted map implementation using a red-black tree to map from int keys to
int values. |
| IntIterator.java | Class | Abstract LiteralIterator implementation that supports an iteration over
int values. |
| IntObjectHashMap.java | Class | Hash map holding (key,value) associations of type (int-->Object);
Automatically grows and shrinks as needed; Implemented using open addressing
with double hashing. |
| IntSortedMap.java | Interface | |
| LiteralComparator.java | Interface | |
| LiteralIterator.java | Interface | |
| LongIntSortedMap.java | Interface | Sorted map that maps from a long key to an int value. |
| LongIntTreeMap.java | Class | Sorted map implementation using a red-black tree to map from long keys to
int values. |
| NullComparator.java | Class | A do-nothing comparator that simply treats all objects as equal. |
| ObjectIntSortedMap.java | Interface | Sorted map that maps from an Object key to an int value. |
| ObjectIntTreeMap.java | Class | Sorted map implementation using a red-black tree to map from Object keys to
int values. |
| PrimeFinder.java | Class | Not of interest for users; only for implementors of hashtables. |
| Queue.java | Class | Maintains a breadth-first-search queue as well as depth labels. |
| SortedMapFactory.java | Class | Factory class that generates the appropriate IntSortedMap implementation
given a key data type. |