Module org.apache.sis.util
Package org.apache.sis.util.collection
package org.apache.sis.util.collection
Addition to the collection framework. Most classes in this package implement interfaces
from the Java Collection Framework defined in the
java.util
package.
-
WeakHashSet
provides a way to ensure that a factory returns unique instances for all values that are equal in the sense ofObjects.deepEquals(Object, Object)
. The values that were created in previous factory operations are retained by weak references for reuse. -
Cache
andWeakValueHashMap
arejava.util.Map
implementations that may be used for some caching or pseudo-caching functionalities. TheCache
implementation is the most full-featured one and supports concurrency, while the other implementations are more lightweight, sometimes 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 another collection. The can also be used for creating filtered views.
-
IntegerList
,CodeListSet
andRangeSet
are collections specialized for a particular kind of content, providing more efficient storage than what we would get with the general-purpose collection implementations. -
FrequencySortedSet
provides specialized ways to organize its elements.
- Since:
- 0.3
-
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 byCache.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.CodeListSet<E extends CodeList<E>>A specializedSet
implementation for use withCodeList
values.Static methods working onCollection
orCheckedContainer
objects.ATreeTable
implementation with a list of columns given at construction time.ATreeTable.Node
implementation which can store values for a predefined list of columns.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.TableColumn<V>Identifies a column inTreeTable.Node
instances.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 forTreeTable
instances.Static methods working onTreeTable
objects 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.