Interface | Description |
---|---|
BitSet |
An interface of BitSet supports get/set/clear.
|
FieldIndex<T,V> |
An interface representing an index for
IndexedSet , each index for this set must
implement the interface to define how to get the value of the field chosen as the index. |
TwoKeyConcurrentMap.TriFunction<A,B,C,R> |
A function with three arguments.
|
Class | Description |
---|---|
BuiltinBitSet |
This class is a wrapper of java's builtin BitSet.
|
ConcurrentHashSet<T> |
A concurrent hash set.
|
ConcurrentIdentityHashMap<K,V> |
An implementation
ConcurrentHashMap that utilizes identity semantics
with its keys
Having identity semantics means that it is possible to have two objects with which are
equal based on the object's equals() implementation, but not be overridden in the hash
map if you try to put both. |
DelegatingSet<T> |
A set which delegates all methods to another set.
|
DirectedAcyclicGraph<T> |
A Directed Acyclic Graph (DAG).
|
DirectedAcyclicGraphNode<T> |
A Directed Acyclic Graph (DAG) node.
|
IndexDefinition<T,V> |
A class representing an index for an
IndexedSet . |
IndexedSet<T> |
A set of objects that are indexed and thus can be queried by specific fields of the object.
|
LockPool<K> |
A resource pool specifically designed to contain locks and will NOT evict any entries
that are in use.
|
NonUniqueFieldIndex<T,V> |
A class representing a non-unique index.
|
Pair<T1,T2> |
A pair representation defined by two elements (of type First and type Second).
|
PrefixList |
Prefix list is used to do file filtering.
|
TwoKeyConcurrentMap<K1,K2,V,M extends Map<K2,V>> |
A two-level concurrent map implementation.
|
TwoKeyConcurrentSortedMap<K1,K2,V,M extends SortedMap<K2,V>> |
A two-level concurrent map implementation where the inner map is sorted.
|
UniqueFieldIndex<T,V> |
A class representing a unique index.
|
UnmodifiableArrayList<T> |
This class provides an unmodifiable List proxy for an underlying array.
|
Copyright © 2023. All Rights Reserved.