@ThreadSafe public class DefaultDataContainer extends Object implements DataContainer
Modifier and Type | Class and Description |
---|---|
static class |
DefaultDataContainer.EntryIterator |
Modifier and Type | Field and Description |
---|---|
protected ConcurrentMap<Object,InternalCacheEntry> |
entries |
protected InternalEntryFactory |
entryFactory |
protected org.infinispan.container.DefaultDataContainer.DefaultEvictionListener |
evictionListener |
Modifier | Constructor and Description |
---|---|
|
DefaultDataContainer(int concurrencyLevel) |
|
DefaultDataContainer(int concurrencyLevel,
Equivalence keyEq,
Equivalence valueEq) |
protected |
DefaultDataContainer(int concurrencyLevel,
int maxEntries,
EvictionStrategy strategy,
EvictionThreadPolicy policy,
Equivalence keyEquivalence,
Equivalence valueEquivalence) |
Modifier and Type | Method and Description |
---|---|
static DataContainer |
boundedDataContainer(int concurrencyLevel,
int maxEntries,
EvictionStrategy strategy,
EvictionThreadPolicy policy,
Equivalence keyEquivalence,
Equivalence valueEquivalence) |
void |
clear()
Removes all entries in the container
|
boolean |
containsKey(Object k)
Tests whether an entry exists in the container
|
Set<InternalCacheEntry> |
entrySet()
Returns a mutable set of immutable cache entries exposed as immutable Map.Entry instances.
|
InternalCacheEntry |
get(Object k)
Retrieves a cached entry
|
void |
initialize(EvictionManager evictionManager,
PassivationManager passivator,
InternalEntryFactory entryFactory,
ActivationManager activator,
PersistenceManager clm,
TimeService timeService) |
Iterator<InternalCacheEntry> |
iterator() |
Set<Object> |
keySet()
Returns a set of keys in the container.
|
InternalCacheEntry |
peek(Object key)
Retrieves a cache entry in the same way as
DataContainer.get(Object) }
except that it does not update or reorder any of the internal constructs. |
void |
purgeExpired()
Purges entries that have passed their expiry time
|
void |
put(Object k,
Object v,
Metadata metadata)
Puts an entry in the cache along with metadata adding information such
lifespan of entry, max idle time, version information...etc.
|
InternalCacheEntry |
remove(Object k)
Removes an entry from the cache
|
int |
size() |
static DataContainer |
unBoundedDataContainer(int concurrencyLevel) |
static DataContainer |
unBoundedDataContainer(int concurrencyLevel,
Equivalence keyEquivalence,
Equivalence valueEquivalence) |
Collection<Object> |
values() |
protected final ConcurrentMap<Object,InternalCacheEntry> entries
protected InternalEntryFactory entryFactory
protected final org.infinispan.container.DefaultDataContainer.DefaultEvictionListener evictionListener
public DefaultDataContainer(int concurrencyLevel)
public DefaultDataContainer(int concurrencyLevel, Equivalence keyEq, Equivalence valueEq)
protected DefaultDataContainer(int concurrencyLevel, int maxEntries, EvictionStrategy strategy, EvictionThreadPolicy policy, Equivalence keyEquivalence, Equivalence valueEquivalence)
public void initialize(EvictionManager evictionManager, PassivationManager passivator, InternalEntryFactory entryFactory, ActivationManager activator, PersistenceManager clm, TimeService timeService)
public static DataContainer boundedDataContainer(int concurrencyLevel, int maxEntries, EvictionStrategy strategy, EvictionThreadPolicy policy, Equivalence keyEquivalence, Equivalence valueEquivalence)
public static DataContainer unBoundedDataContainer(int concurrencyLevel, Equivalence keyEquivalence, Equivalence valueEquivalence)
public static DataContainer unBoundedDataContainer(int concurrencyLevel)
public InternalCacheEntry peek(Object key)
DataContainer
DataContainer.get(Object)
}
except that it does not update or reorder any of the internal constructs.
I.e., expiration does not happen, and in the case of the LRU container,
the entry is not moved to the end of the chain.
This method should be used instead of DataContainer.get(Object)
} when called
while iterating through the data container using methods like DataContainer.keySet()
to avoid changing the underlying collection's order.peek
in interface DataContainer
key
- key under which entry is storedpublic InternalCacheEntry get(Object k)
DataContainer
get
in interface DataContainer
k
- key under which entry is storedpublic void put(Object k, Object v, Metadata metadata)
DataContainer
put
in interface DataContainer
k
- key under which to store entryv
- value to storemetadata
- metadata of the entrypublic boolean containsKey(Object k)
DataContainer
containsKey
in interface DataContainer
k
- key to testpublic InternalCacheEntry remove(Object k)
DataContainer
remove
in interface DataContainer
k
- key to removepublic int size()
size
in interface DataContainer
public void clear()
DataContainer
clear
in interface DataContainer
public Set<Object> keySet()
DataContainer
#get()
method but instead #peek()
, in order to avoid
changing the order of the underlying collection as a side of effect of iterating through it.keySet
in interface DataContainer
public Collection<Object> values()
values
in interface DataContainer
public Set<InternalCacheEntry> entrySet()
DataContainer
entrySet
in interface DataContainer
public void purgeExpired()
DataContainer
purgeExpired
in interface DataContainer
public Iterator<InternalCacheEntry> iterator()
iterator
in interface Iterable<InternalCacheEntry>
Copyright © 2014 JBoss, a division of Red Hat. All Rights Reserved.