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.
-
WeakHashSetprovides 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. -
CacheandWeakValueHashMaparejava.util.Mapimplementations that may be used for some caching or pseudo-caching functionalities. TheCacheimplementation 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,CodeListSetandRangeSetare 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.
- Since:
- 0.3
- Version:
- 1.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.Cache.Deferred<K,V> Key-value pairs of new entries created duringCache.ReplaceAdapterexecution, as a chained list.The handler returned byCache.lock(K), to be used for unlocking and storing the result.CacheEntries<K,V> The set of entries in theCache.map.CacheEntries.Iter<K,V> An iterator over the entries in theCache.map.A container that ensures that all elements are assignable to a given base type.CodeListSet<E extends org.opengis.util.CodeList<E>>A specializedSetimplementation for use withCodeListvalues.Static methods working onCollectionorCheckedContainerobjects.ATreeTableimplementation with a list of columns given at construction time.ATreeTable.Nodeimplementation which can store values for a predefined list of columns.Implementation ofDefaultTreeTable.Nodechildren list.DerivedIterator<S,E> An iterator which performs conversions on the fly using the given converter.DerivedMap<SK,SV, K, V> A map whose keys and values are derived on-the-fly from another map.DerivedMap.Invertible<SK,SV, K, V> ADerivedMapused when both theDerivedMap.keyConverterandDerivedMap.valueConverterare invertible.DerivedMap.InvertibleKey<SK,SV, K, V> ADerivedMapused when theDerivedMap.keyConverteris invertible.DerivedMap.InvertibleValue<SK,SV, K, V> ADerivedMapused when theDerivedMap.valueConverteris invertible.DerivedSet<S,E> A set whose values are derived on-the-fly from another set.DerivedSet.Bijective<S,E> ADerivedSetfor converters that are both invertible and bijective.ADerivedSetfor invertible converters.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.RangeSet.Compare<E extends Comparable<? super E>>The range comparator returned byRangeSet.comparator().ARangeSetimplementation forNumberRangeelements.TableColumn<V>Identifies a column inTreeTable.Nodeinstances.Implementation ofTableColumnfor the predefined constants.A list of children in aTreeTable.Node.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 forTreeTableinstances.Static methods working onTreeTableobjects and their nodes.WeakEntry<E>A weak reference to an element in aWeakHashSetorWeakValueHashMap.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.Wildcard forWeakValueHashMap.intern(Object, Object, Object)condition meaning whether a key shall be associated to a value or not.