Uses of Interface
com.bigdata.cache.IHardReferenceQueue

Packages that use IHardReferenceQueue

com.bigdata.btree	The BTree is a scalable B+-Tree with copy-on-write semantics mapping variable length unsigned byte[] keys to variable length byte[] values (null values are allowed).
com.bigdata.cache	A canonicalizing object cache may be constructed from an outer weak reference value hash map backed by an inner hard reference LRU policy.
com.bigdata.htree

Uses of IHardReferenceQueue in com.bigdata.btree

Fields in com.bigdata.btree declared as IHardReferenceQueue

protected IHardReferenceQueue<PO>

AbstractBTree.writeRetentionQueue Nodes (that is nodes or leaves) are added to a hard reference queue when they are created or read from the store.

Methods in com.bigdata.btree with parameters of type IHardReferenceQueue

void	DefaultEvictionListener.evicted(IHardReferenceQueue<PO> cache, PO ref)
void	IEvictionListener.evicted(IHardReferenceQueue<PO> cache, PO ref)
void	NOPEvictionListener.evicted(IHardReferenceQueue<PO> cache, PO ref)

Uses of IHardReferenceQueue in com.bigdata.cache

Classes in com.bigdata.cache that implement IHardReferenceQueue

class	HardReferenceQueue<T> A cache for hard references using an LRU policy.
class	HardReferenceQueueWithBatchingUpdates<T> A variant relying on thread-local IHardReferenceQueues to batch updates and thus minimize thread contention for the lock required to synchronize calls to HardReferenceQueueWithBatchingUpdates.add(Object).
class	SynchronizedHardReferenceQueue<T> Thread-safe version.
class	SynchronizedHardReferenceQueueWithTimeout<T> Thread-safe version with timeout for clearing stale references from the queue.

Methods in com.bigdata.cache with parameters of type IHardReferenceQueue

void	HardReferenceQueueEvictionListener.evicted(IHardReferenceQueue<T> cache, T ref) Notice that a reference is being evicted from the cache.

Constructors in com.bigdata.cache with parameters of type IHardReferenceQueue

ConcurrentWeakValueCache(IHardReferenceQueue<V> queue, float loadFactor, int concurrencyLevel, boolean removeClearedReferences)
Defaults the initial capacity of the map based on the capacity of the optional IHardReferenceQueue and uses the Java default of 16 if there is no queue.

ConcurrentWeakValueCache(IHardReferenceQueue<V> queue, int initialCapacity, float loadFactor, int concurrencyLevel, boolean removeClearedReferences)
Uses the specified values.

ConcurrentWeakValueCacheWithBatchedUpdates(IHardReferenceQueue<V> queue, float loadFactor, int concurrencyLevel, boolean removeClearedReferences)
Defaults the initial capacity of the map based on the capacity of the IHardReferenceQueue.

ConcurrentWeakValueCacheWithBatchedUpdates(IHardReferenceQueue<V> queue, int initialCapacity, float loadFactor, int concurrencyLevel, boolean removeClearedReferences)
Uses the specified values.

HardReferenceQueueWithBatchingUpdates(boolean threadLocalBuffers, int concurrencyLevel, IHardReferenceQueue<T> sharedQueue, int threadLocalQueueNScan, int threadLocalQueueCapacity, int threadLocalTryLockSize, com.bigdata.cache.IBatchedUpdateListener<T> batchedUpdateListener)

HardReferenceQueueWithBatchingUpdates(IHardReferenceQueue<T> sharedQueue, int threadLocalQueueNScan, int threadLocalQueueCapacity, int threadLocalTryLockSize, com.bigdata.cache.IBatchedUpdateListener<T> batchedUpdateListener)
Designated constructor.

Uses of IHardReferenceQueue in com.bigdata.htree

Fields in com.bigdata.htree declared as IHardReferenceQueue

protected IHardReferenceQueue<PO>

AbstractHTree.writeRetentionQueue Nodes (that is nodes or leaves) are added to a hard reference queue when they are created or read from the store.

Methods in com.bigdata.htree with parameters of type IHardReferenceQueue

void	DefaultEvictionListener.evicted(IHardReferenceQueue<PO> cache, PO ref)