Uses of Class
com.bigdata.cache.HardReferenceQueue

Packages that use HardReferenceQueue

Package	Description
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.

Uses of HardReferenceQueue in com.bigdata.btree

Subclasses of HardReferenceQueue in com.bigdata.btree

Modifier and Type	Class and Description
class	MyHardReferenceQueue<T> Wraps the basic implementation and exposes a protected method that we need to write the tests in this suite.

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

Modifier and Type	Method and Description
void	MyEvictionListener.evicted(HardReferenceQueue<PO> queue, PO ref)

Uses of HardReferenceQueue in com.bigdata.cache

Fields in com.bigdata.cache declared as HardReferenceQueue

Modifier and Type	Field and Description
protected HardReferenceQueue<T>	SynchronizedHardReferenceQueue.queue Note: Synchronization for the inner SynchronizedHardReferenceQueue.queue is realized using the outer reference!