Data containers which store cache entries. This package contains different implementations of containers based on their performance and ordering characteristics, as well as the entries that live in the containers. This package also contains the factory for creating entries, and is typically used by the
to wrap an entry and put it in a thread's
Interface Summary Interface Description EntryFactory InternalDataContainer<K,V>Interface describing methods of a data container where operations can be indexed by the segment of the key stored in the map. InternalEntryFactory KeyValueMetadataSizeCalculator<K,V>Size calculator that takes into account not only key and value but also metadata. MergeOnStoreThis interface is not a public API. PeekableTouchableMap<K,V> TouchableMap
Class Summary Class Description AbstractDelegatingDataContainer<K,V>Delegating data container that delegates all calls to the container returned from
AbstractDelegatingInternalDataContainer<K,V> AbstractInternalDataContainer<K,V>Abstract class implemenation for a segmented data container. BoundedSegmentedDataContainer<K,V>Bounded implementation of segmented data container. DefaultDataContainer<K,V>DefaultDataContainer is both eviction and non-eviction based data container. DefaultSegmentedDataContainer<K,V>DataContainer implementation that internally stores entries in an array of maps. EntryFactoryImpl
EntryFactoryimplementation to be used for optimistic locking scheme.
InternalDataContainerAdapter<K,V> InternalEntryFactoryImplAn implementation that generates non-versioned entries L1SegmentedDataContainer<K,V>Segmented data container that also allows for non owned segments to be written to a temporary map (L1). PeekableTouchableContainerMap<K,V>