The handler returned by
A container that ensures that all elements are assignable to a given base type.
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 concurrent cache mechanism.
|CodeListSet<E extends CodeList<E>>||
A set with elements ordered by the amount of time they were added.
A list of unsigned integer values.
|RangeSet<E extends Comparable<? super E>>||
An ordered set of disjoint ranges where overlapping ranges are merged.
Identifies a column in
A parser and formatter for
Static methods working on
A set of objects hold by weak references.
A hashtable-based map implementation that uses weak references, leaving memory when an entry is not used anymore.
Thrown to indicate that an operation could not complete because of a failure in the backing store (a file or a database).
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.
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
Copyright © 2010–2017 The Apache Software Foundation. All rights reserved.