public class BoundaryCache extends TreeMap<Integer,Object>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
BoundaryCache(int maxSize) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
void |
evictOne()
Removes eldest entry from the boundary cache.
|
void |
evictThisAndAllBefore(int rowIdx) |
Map.Entry<Integer,Object> |
getMaxEntry()
Returns entry corresponding to highest row index.
|
boolean |
isComplete()
True if the last range(s) of the partition are loaded into the cache.
|
Boolean |
isFull()
Checks if cache is full.
|
Object |
put(Integer key,
Object value) |
Boolean |
putIfNotFull(Integer key,
Object value)
Puts new key-value pair in cache.
|
void |
setComplete(boolean complete) |
ceilingEntry, ceilingKey, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, valuesequals, hashCode, isEmpty, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, equals, getOrDefault, hashCode, isEmpty, merge, putIfAbsent, removepublic boolean isComplete()
public void setComplete(boolean complete)
public Boolean putIfNotFull(Integer key, Object value)
key - value - public Boolean isFull()
public void clear()
public Map.Entry<Integer,Object> getMaxEntry()
public void evictOne()
public void evictThisAndAllBefore(int rowIdx)
Copyright © 2022 The Apache Software Foundation. All rights reserved.