Uses of Class
io.debezium.util.BoundedConcurrentHashMap.HashEntry

Packages that use BoundedConcurrentHashMap.HashEntry

Package	Description
io.debezium.util

Uses of BoundedConcurrentHashMap.HashEntry in io.debezium.util

Subclasses of BoundedConcurrentHashMap.HashEntry in io.debezium.util

Modifier and Type	Class and Description
private static class	BoundedConcurrentHashMap.LIRSHashEntry<K,V> Adapted 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 sources

Fields in io.debezium.util declared as BoundedConcurrentHashMap.HashEntry

Modifier and Type	Field and Description
(package private) BoundedConcurrentHashMap.HashEntry<K,V>[]	BoundedConcurrentHashMap.HashIterator.currentTable
(package private) BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.HashIterator.lastReturned
(package private) BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.HashEntry.next
(package private) BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.HashIterator.nextEntry
(package private) BoundedConcurrentHashMap.HashEntry<K,V>[]	BoundedConcurrentHashMap.Segment.table The per-segment table.

Fields in io.debezium.util with type parameters of type BoundedConcurrentHashMap.HashEntry

Modifier and Type	Field and Description
private ConcurrentLinkedQueue<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LRU.accessQueue
private Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LRU.evicted

Methods in io.debezium.util that return BoundedConcurrentHashMap.HashEntry

Modifier and Type	Method and Description
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.EvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.NullEvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.LRU.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.LIRS.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.HashEntry

Modifier and Type	Method and Description
private Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.Segment.attemptEviction(boolean lockedAlready)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.EvictionPolicy.execute() Invokes eviction policy algorithm and returns set of evicted entries.
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.NullEvictionPolicy.execute()
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LRU.execute()
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LIRS.execute()
private Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LIRSHashEntry.miss() Records a cache miss.
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	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.
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.NullEvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> e)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LRU.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> e)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LIRS.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> en)

Methods in io.debezium.util with parameters of type BoundedConcurrentHashMap.HashEntry

Modifier and Type	Method and Description
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.EvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.NullEvictionPolicy.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.LRU.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
BoundedConcurrentHashMap.HashEntry<K,V>	BoundedConcurrentHashMap.LIRS.createNewEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
boolean	BoundedConcurrentHashMap.EvictionPolicy.onEntryHit(BoundedConcurrentHashMap.HashEntry<K,V> e) Invoked to notify EvictionPolicy implementation that an entry in Segment has been accessed.
boolean	BoundedConcurrentHashMap.NullEvictionPolicy.onEntryHit(BoundedConcurrentHashMap.HashEntry<K,V> e)
boolean	BoundedConcurrentHashMap.LRU.onEntryHit(BoundedConcurrentHashMap.HashEntry<K,V> e)
boolean	BoundedConcurrentHashMap.LIRS.onEntryHit(BoundedConcurrentHashMap.HashEntry<K,V> e)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	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.
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.NullEvictionPolicy.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> e)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LRU.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> e)
Set<BoundedConcurrentHashMap.HashEntry<K,V>>	BoundedConcurrentHashMap.LIRS.onEntryMiss(BoundedConcurrentHashMap.HashEntry<K,V> en)
void	BoundedConcurrentHashMap.EvictionPolicy.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K,V> e) Invoked to notify EvictionPolicy implementation that an entry e has been removed from Segment.
void	BoundedConcurrentHashMap.NullEvictionPolicy.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K,V> e)
void	BoundedConcurrentHashMap.LRU.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K,V> e)
void	BoundedConcurrentHashMap.LIRS.onEntryRemove(BoundedConcurrentHashMap.HashEntry<K,V> e)
(package private) V	BoundedConcurrentHashMap.Segment.readValueUnderLock(BoundedConcurrentHashMap.HashEntry<K,V> e) Reads value field of an entry under lock.
(package private) void	BoundedConcurrentHashMap.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.HashEntry

Modifier and Type	Method and Description
private void	BoundedConcurrentHashMap.LIRSHashEntry.coldHit(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted) Records a cache hit on a cold block.
private void	BoundedConcurrentHashMap.LIRSHashEntry.fullMiss(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted) Records a miss when the hot entry set is full.
void	BoundedConcurrentHashMap.LIRSHashEntry.hit(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted) Records a cache hit.
private void	BoundedConcurrentHashMap.LIRSHashEntry.hotHit(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted) Records a cache hit on a hot block.
private void	BoundedConcurrentHashMap.Segment.notifyEvictionListener(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted)
private void	BoundedConcurrentHashMap.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 boolean	BoundedConcurrentHashMap.LRU.removeEldestEntry(Map.Entry<BoundedConcurrentHashMap.HashEntry<K,V>,V> eldest)
private void	BoundedConcurrentHashMap.LIRS.removeFromSegment(Set<BoundedConcurrentHashMap.HashEntry<K,V>> evicted)

Constructors in io.debezium.util with parameters of type BoundedConcurrentHashMap.HashEntry

Constructor and Description
HashEntry(K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)
LIRSHashEntry(BoundedConcurrentHashMap.LIRS<K,V> owner, K key, int hash, BoundedConcurrentHashMap.HashEntry<K,V> next, V value)