Interface | Description |
---|---|
Cache.Handler<V> |
The handler returned by
Cache.lock(K) , to be used for unlocking and storing the
result. |
CheckedContainer<E> |
A container that ensures that all elements are assignable to a given base type.
|
TreeTable |
Defines the structure (list of columns) of a table and provides the root of the tree
containing the data.
|
TreeTable.Node |
A node in a tree combined with a row in a table.
|
Class | Description |
---|---|
Cache<K,V> |
A concurrent cache mechanism.
|
CodeListSet<E extends CodeList<E>> |
A specialized
Set implementation for use with CodeList values. |
Containers |
Static methods working on
Collection or CheckedContainer objects. |
DefaultTreeTable |
A
TreeTable implementation with a list of columns given at
construction time. |
DefaultTreeTable.Node |
A
TreeTable.Node implementation which can store values for a pre-defined list
of columns. |
RangeSet<E extends Comparable<? super E>> |
An ordered set of disjoint ranges where overlapping ranges are merged.
|
TableColumn<V> |
Identifies a column in
TreeTable.Node instances. |
TreeTableFormat |
A parser and formatter for
TreeTable instances. |
TreeTables |
Static methods working on
TreeTable 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.
|
Exception | Description |
---|---|
BackingStoreException |
Thrown to indicate that an operation could not complete because of a failure in the backing
store (a file or a database).
|
java.util
package.
WeakHashSet
provides 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.
Cache
and
WeakValueHashMap
are java.util.Map
implementations that may be used for some caching or pseudo-caching functionalities. The
Cache
implementation is the most full-featured one
and supports concurrency, while the other implementations are more lightweight, sometime
thread-safe but without concurrency support.
org.apache.sis.util.collection.IntegerList
,
CodeListSet
and
RangeSet
are collections specialized for a particular kind
of content, providing more efficient storage than what we would get with the general-purpose
collection implementations.
org.apache.sis.util.collection.FrequencySortedSet
provides specialized ways to
organize its elements.
Defined in the sis-utility
module
Copyright © 2010–2015 The Apache Software Foundation. All rights reserved.