Uses of Class
io.debezium.util.BoundedConcurrentHashMap.LIRSHashEntry
-
Uses of BoundedConcurrentHashMap.LIRSHashEntry in io.debezium.util
Modifier and TypeFieldDescriptionprivate final BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRS.header
This header encompasses two data structures:private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRSHashEntry.nextInQueue
private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRSHashEntry.nextInStack
private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRSHashEntry.previousInQueue
private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRSHashEntry.previousInStack
Modifier and TypeFieldDescriptionprivate final ConcurrentLinkedQueue<BoundedConcurrentHashMap.LIRSHashEntry<K,
V>> BoundedConcurrentHashMap.LIRS.accessQueue
The accessQueue for reducing lock contention See "BP-Wrapper: a system framework making any replacement algorithms (almost) lock contention free"Modifier and TypeMethodDescriptionprivate BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRS.queueEnd()
Returns the entry at the end of the queue.private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRS.queueFront()
Returns the entry at the front of the queue.private BoundedConcurrentHashMap.LIRSHashEntry<K,
V> BoundedConcurrentHashMap.LIRS.stackBottom()
Returns the entry at the bottom of the stack.Modifier and TypeMethodDescriptionprivate void
BoundedConcurrentHashMap.LIRSHashEntry.addToQueueBefore
(BoundedConcurrentHashMap.LIRSHashEntry<K, V> existingEntry) Inserts this entry before the specified existing entry in the queue.private void
BoundedConcurrentHashMap.LIRSHashEntry.addToStackBefore
(BoundedConcurrentHashMap.LIRSHashEntry<K, V> existingEntry) Inserts this entry before the specified existing entry in the stack.