@InterfaceAudience.Private public class CachedEntryQueue extends java.lang.Object
Use this when you want to find the largest elements (according to their ordering, not their heap size) that consume as close to the specified maxSize as possible. Default behavior is to grow just above rather than just below specified max.
Constructor and Description |
---|
CachedEntryQueue(long maxSize,
long blockSize) |
Modifier and Type | Method and Description |
---|---|
void |
add(java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> entry)
Attempt to add the specified entry to this queue.
|
long |
cacheSize()
Total size of all elements in this queue.
|
java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> |
poll() |
java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> |
pollLast() |
public CachedEntryQueue(long maxSize, long blockSize)
maxSize
- the target size of elements in the queueblockSize
- expected average size of blockspublic void add(java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> entry)
If the queue is smaller than the max size, or if the specified element is ordered after the smallest element in the queue, the element will be added to the queue. Otherwise, there is no side effect of this call.
entry
- a bucket entry with key to try to add to the queuepublic java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> poll()
null
if the queue is
empty.public java.util.Map.Entry<BlockCacheKey,org.apache.hadoop.hbase.io.hfile.bucket.BucketCache.BucketEntry> pollLast()
null
if the queue is
empty.public long cacheSize()