Interface | Description |
---|---|
IAddOnlySet<T> | |
MapFactory<K,V> | |
ReadOnlyIterator<E> |
Acts as an
Iterator which supports only read operation, hence it does not contain the
remove operation |
SelfCleaningTable.ICleanerListener<V> |
Class | Description |
---|---|
BasedHashSet<E> |
Provides a base for any Map based HashSet implementation.
|
CheckedConcurrentSkipListMap<K,V> |
ConcurrentSkipListMap doesn't throw a ClassCastException on the first key if it is not Comparable.
|
ConcurrentBoundedCache |
Concurrent bounded cache.
|
ConcurrentHashSet<E> |
Provides a concurrent HashSet implementation.
|
ConcurrentSoftCache | Deprecated
Since 10.1.0 - use ConcurrentBoundedSoftCache instead
|
CopyOnUpdateMap<K,V> |
Provides a ConcurrentMap implementation.
|
CopyOnUpdateOnceMap<K,V> |
Provides a ConcurrentMap implementation.
|
CopyOnUpdateSafeArray<T> |
Copy on update implementation of
ISafeArray |
CopyOnUpdateSet<E> |
Provides a concurrent HashSet implementation.
|
HashMapFactory<K,V> | |
ReadOnlyIterableWrapper<T> | |
ReadOnlyIteratorAdapter<E> | |
SelfCleaningTable<K,V> |
Holds a weak key for each value and make sure each value will be cleaned when key is weakly
held.
|
SelfCleaningValueTable<K,V> |
Holds a weak reference for each value and make sure each value will be cleaned when is weakly
held.
|
SingleElementList<E> |
An unmodifiable
List holding a single element. |
THashMapFactory<K,V> | |
WeakHashSet<E> |
This classes uses
WeakReference so that contained objects can be collected
by the GC. |
Copyright © GigaSpaces.