-
A hash table supporting full concurrency of retrievals, adjustable expected
concurrency for updates, and a maximum capacity to bound the map by.
A skeletal implementation of the Task interface.
A listener that ignores all notifications.
The draining status of the buffers.
A node contains the key, the weighted value, and the linkage pointers on
the page-replacement algorithm's data structures.
Updates the node's location in the page replacement policy.
An operation that can be lazily applied to the page replacement policy.
A value, its weight, and the entry's status.
A class that can determine the weight of an entry.
A listener registered for notification when an entry is evicted.
An element that is linked on the
Deque.
Linked list implementation of the
Deque interface where the link
pointers are tightly integrated with the element.
A class that can determine the weight of a value.