Uses of Class
io.debezium.util.BoundedConcurrentHashMap.HashEntry
Packages that use BoundedConcurrentHashMap.HashEntry
-
Uses of BoundedConcurrentHashMap.HashEntry in io.debezium.util
Subclasses of BoundedConcurrentHashMap.HashEntry in io.debezium.utilModifier and TypeClassDescriptionprivate static final classAdapted to Infinispan BoundedConcurrentHashMap using LIRS implementation ideas from Charles Fry (fry@google.com) See http://code.google.com/p/concurrentlinkedhashmap/source/browse/trunk/src/test/java/com/googlecode/concurrentlinkedhashmap/caches/LirsMap.java for original sourcesFields in io.debezium.util declared as BoundedConcurrentHashMap.HashEntryModifier and TypeFieldDescription(package private) BoundedConcurrentHashMap.HashEntry<K,V>[] BoundedConcurrentHashMap.HashIterator.currentTable(package private) BoundedConcurrentHashMap.HashEntry<K,V> BoundedConcurrentHashMap.HashIterator.lastReturned(package private) final BoundedConcurrentHashMap.HashEntry<K,V> BoundedConcurrentHashMap.HashEntry.next(package private) BoundedConcurrentHashMap.HashEntry<K,V> BoundedConcurrentHashMap.HashIterator.nextEntry(package private) BoundedConcurrentHashMap.HashEntry<K,V>[] BoundedConcurrentHashMap.Segment.tableThe per-segment table.Fields in io.debezium.util with type parameters of type BoundedConcurrentHashMap.HashEntryModifier and TypeFieldDescriptionprivate final ConcurrentLinkedQueue<BoundedConcurrentHashMap.HashEntry<K,V>> BoundedConcurrentHashMap.LRU.accessQueueprivate final Set<BoundedConcurrentHashMap.HashEntry<K,V>> BoundedConcurrentHashMap.LRU.evictedMethods in io.debezium.util that return BoundedConcurrentHashMap.HashEntryModifier and TypeMethodDescriptionBoundedConcurrentHashMap.EvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.LIRS.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.LRU.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.NullEvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) (package private) BoundedConcurrentHashMap.HashEntry<K,V> BoundedConcurrentHashMap.Segment.getFirst(int hash) Returns properly casted first entry of bin for given hash.(package private) static <K,V> BoundedConcurrentHashMap.HashEntry<K, V>[] BoundedConcurrentHashMap.HashEntry.newArray(int i) (package private) BoundedConcurrentHashMap.HashEntry<K,V> BoundedConcurrentHashMap.HashIterator.nextEntry()Methods in io.debezium.util that return types with arguments of type BoundedConcurrentHashMap.HashEntryModifier and TypeMethodDescriptionprivate Set<BoundedConcurrentHashMap.HashEntry<K,V>> BoundedConcurrentHashMap.Segment.attemptEviction(boolean lockedAlready) BoundedConcurrentHashMap.EvictionPolicy.execute()Invokes eviction policy algorithm and returns set of evicted entries.BoundedConcurrentHashMap.LIRS.execute()BoundedConcurrentHashMap.LRU.execute()BoundedConcurrentHashMap.NullEvictionPolicy.execute()private Set<BoundedConcurrentHashMap.HashEntry<K,V>> BoundedConcurrentHashMap.LIRSHashEntry.miss()Records a cache miss.BoundedConcurrentHashMap.EvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) Invoked to notify EvictionPolicy implementation that there has been an attempt to access an entry in Segment, however that entry was not present in Segment.BoundedConcurrentHashMap.LIRS.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> en) BoundedConcurrentHashMap.LRU.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) BoundedConcurrentHashMap.NullEvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) Methods in io.debezium.util with parameters of type BoundedConcurrentHashMap.HashEntryModifier and TypeMethodDescriptionBoundedConcurrentHashMap.EvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.LIRS.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.LRU.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) BoundedConcurrentHashMap.NullEvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value) booleanBoundedConcurrentHashMap.EvictionPolicy.onEntryHit(BoundedConcurrentHashMap.HashEntry<K, V> e) Invoked to notify EvictionPolicy implementation that an entry in Segment has been accessed.booleanBoundedConcurrentHashMap.LIRS.onEntryHit(BoundedConcurrentHashMap.HashEntry<K, V> e) booleanBoundedConcurrentHashMap.LRU.onEntryHit(BoundedConcurrentHashMap.HashEntry<K, V> e) booleanBoundedConcurrentHashMap.NullEvictionPolicy.onEntryHit(BoundedConcurrentHashMap.HashEntry<K, V> e) BoundedConcurrentHashMap.EvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) Invoked to notify EvictionPolicy implementation that there has been an attempt to access an entry in Segment, however that entry was not present in Segment.BoundedConcurrentHashMap.LIRS.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> en) BoundedConcurrentHashMap.LRU.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) BoundedConcurrentHashMap.NullEvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K, V> e) voidBoundedConcurrentHashMap.EvictionPolicy.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K, V> e) Invoked to notify EvictionPolicy implementation that an entry e has been removed from Segment.voidBoundedConcurrentHashMap.LIRS.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K, V> e) voidBoundedConcurrentHashMap.LRU.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K, V> e) voidBoundedConcurrentHashMap.NullEvictionPolicy.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K, V> e) (package private) VBoundedConcurrentHashMap.Segment.readValueUnderLock(BoundedConcurrentHashMap.HashEntry<K, V> e) Reads value field of an entry under lock.(package private) voidBoundedConcurrentHashMap.Segment.setTable(BoundedConcurrentHashMap.HashEntry<K, V>[] newTable) Sets table to new HashEntry array.Method parameters in io.debezium.util with type arguments of type BoundedConcurrentHashMap.HashEntryModifier and TypeMethodDescriptionprivate voidBoundedConcurrentHashMap.LIRSHashEntry.coldHit(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Records a cache hit on a cold block.private voidBoundedConcurrentHashMap.LIRSHashEntry.fullMiss(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Records a miss when the hot entry set is full.voidBoundedConcurrentHashMap.LIRSHashEntry.hit(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Records a cache hit.private voidBoundedConcurrentHashMap.LIRSHashEntry.hotHit(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Records a cache hit on a hot block.private voidBoundedConcurrentHashMap.Segment.notifyEvictionListener(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) private voidBoundedConcurrentHashMap.LIRS.pruneStack(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Prunes HIR blocks in the bottom of the stack until an HOT block sits in the stack bottom.protected booleanBoundedConcurrentHashMap.LRU.removeEldestEntry(Map.Entry<BoundedConcurrentHashMap.HashEntry<K, V>, V> eldest) private voidBoundedConcurrentHashMap.LIRS.removeFromSegment(Set<BoundedConcurrentHashMap.HashEntry<K, V>> evicted) Constructors in io.debezium.util with parameters of type BoundedConcurrentHashMap.HashEntryModifierConstructorDescription(package private)(package private)LIRSHashEntry(BoundedConcurrentHashMap.LIRS<K, V> owner, K key, int hash, BoundedConcurrentHashMap.HashEntry<K, V> next, V value)