Versions in this module Expand all Collapse all v1 v1.0.0 Jan 25, 2024 Changes in this version + type Node struct + func New[K comparable, V any](key K, value V, expiration, cost uint32) *Node[K, V] + func (n *Node[K, V]) Cost() uint32 + func (n *Node[K, V]) DecrementFrequency() + func (n *Node[K, V]) Expiration() uint32 + func (n *Node[K, V]) Frequency() uint8 + func (n *Node[K, V]) IncrementFrequency() + func (n *Node[K, V]) IsExpired() bool + func (n *Node[K, V]) IsMain() bool + func (n *Node[K, V]) IsSmall() bool + func (n *Node[K, V]) Key() K + func (n *Node[K, V]) MarkMain() + func (n *Node[K, V]) MarkSmall() + func (n *Node[K, V]) ResetFrequency() + func (n *Node[K, V]) Unmark() + func (n *Node[K, V]) Value() V + type Queue struct + func NewQueue[K comparable, V any]() *Queue[K, V] + func (q *Queue[K, V]) Clear() + func (q *Queue[K, V]) IsEmpty() bool + func (q *Queue[K, V]) Len() int + func (q *Queue[K, V]) Pop() *Node[K, V] + func (q *Queue[K, V]) Push(n *Node[K, V]) + func (q *Queue[K, V]) Remove(n *Node[K, V]) + type WriteTask struct + func NewAddTask[K comparable, V any](n *Node[K, V]) WriteTask[K, V] + func NewClearTask[K comparable, V any]() WriteTask[K, V] + func NewCloseTask[K comparable, V any]() WriteTask[K, V] + func NewDeleteTask[K comparable, V any](n *Node[K, V]) WriteTask[K, V] + func NewUpdateTask[K comparable, V any](n, oldNode *Node[K, V]) WriteTask[K, V] + func (t *WriteTask[K, V]) IsAdd() bool + func (t *WriteTask[K, V]) IsClear() bool + func (t *WriteTask[K, V]) IsClose() bool + func (t *WriteTask[K, V]) IsDelete() bool + func (t *WriteTask[K, V]) IsUpdate() bool + func (t *WriteTask[K, V]) Node() *Node[K, V] + func (t *WriteTask[K, V]) OldNode() *Node[K, V]
Go to main page