Addition to the collection framework. Most classes in this package implement interfaces from the Java Collection Framework defined in the
WeakHashSetprovides a way to ensure that a factory returns unique instances for all values that are equal in the sense of
Objects.deepEquals(Object, Object). The values that were created in previous factory operations are retained by weak references for reuse.
java.util.Mapimplementations that may be used for some caching or pseudo-caching functionalities. The
Cacheimplementation is the most full-featured one and supports concurrency, while the other implementations are more lightweight, sometime thread-safe but without concurrency support.
- Derived Map and derived Set are wrapper collections in which the keys or the values are derived on-the-fly from the content of an other collection. The can also be used for creating filtered views.
RangeSetare collections specialized for a particular kind of content, providing more efficient storage than what we would get with the general-purpose collection implementations.
FrequencySortedSetprovides specialized ways to organize its elements.
Defined in the
ClassDescriptionThrown to indicate that an operation could not complete because of a failure in the backing store (a file or a database).Cache<K,
V>A concurrent map capable to locks entries for which the value is in process of being computed.The handler returned by
Cache.lock(K), to be used for unlocking and storing the result.A container that ensures that all elements are assignable to a given base type.A specialized
Setimplementation for use with
TreeTable.Nodeimplementation which can store values for a pre-defined list of columns.A set with elements ordered by the amount of time they were added.A list of unsigned integer values.An ordered set of disjoint ranges where overlapping ranges are merged.TableColumn<V>Identifies a column in
TreeTable.Nodeinstances.Defines the structure (list of columns) of a table and provides the root of the tree containing the data.A node in a tree combined with a row in a table.A parser and formatter for
TreeTableinstances.Static methods working on
TreeTableobjects and their nodes.WeakHashSet<E>A set of objects hold by weak references.WeakValueHashMap<K,
V>A hashtable-based map implementation that uses weak references, leaving memory when an entry is not used anymore.