twoqueue

Jul 6, 2025

Changes in this version

type FIFOCache

+ func (c *FIFOCache[K, V]) All() map[K]V

type TwoQueueCache

+ func (c *TwoQueueCache[K, V]) All() map[K]V

Jun 27, 2025

Changes in this version

+ type FIFOCache struct

+ func (c *FIFOCache[K, V]) Delete(key K) bool

+ func (c *FIFOCache[K, V]) DeleteOldest() (k K, v V, ok bool)

+ func (c *FIFOCache[K, V]) Get(key K) (value V, ok bool)

+ func (c *FIFOCache[K, V]) Has(key K) bool

+ func (c *FIFOCache[K, V]) Keys() []K

+ func (c *FIFOCache[K, V]) Len() int

+ func (c *FIFOCache[K, V]) Peek(key K) (value V, ok bool)

+ func (c *FIFOCache[K, V]) Purge()

+ func (c *FIFOCache[K, V]) Range(f func(K, V) bool)

+ func (c *FIFOCache[K, V]) Set(key K, value V)

+ func (c *FIFOCache[K, V]) Values() []V

type TwoQueueCache

+ func (c *TwoQueueCache[K, V]) SizeBytes() int64

Apr 11, 2024

Changes in this version

type TwoQueueCache

+ func New2QCacheWithEvictionCallback[K comparable, V any](capacity int, onEviction base.EvictionCallback[K, V]) *TwoQueueCache[K, V]

+ func New2QCacheWithRatioAndEvictionCallback[K comparable, V any](capacity int, recentRatio, ghostRatio float64, ...) *TwoQueueCache[K, V]

Apr 2, 2024

Changes in this version

+ const Default2QGhostEntries

+ const Default2QRecentRatio

+ type TwoQueueCache struct

+ func New2QCacheWithRatio[K comparable, V any](capacity int, recentRatio, ghostRatio float64) *TwoQueueCache[K, V]

+ func New2QCache[K comparable, V any](capacity int) *TwoQueueCache[K, V]

+ func (c *TwoQueueCache[K, V]) Algorithm() string

+ func (c *TwoQueueCache[K, V]) Capacity() int

+ func (c *TwoQueueCache[K, V]) Delete(key K) bool

+ func (c *TwoQueueCache[K, V]) DeleteMany(keys []K) map[K]bool

+ func (c *TwoQueueCache[K, V]) Get(key K) (value V, ok bool)

+ func (c *TwoQueueCache[K, V]) GetMany(keys []K) (map[K]V, []K)

+ func (c *TwoQueueCache[K, V]) Has(key K) bool

+ func (c *TwoQueueCache[K, V]) HasMany(keys []K) map[K]bool

+ func (c *TwoQueueCache[K, V]) Keys() []K

+ func (c *TwoQueueCache[K, V]) Len() int

+ func (c *TwoQueueCache[K, V]) Peek(key K) (value V, ok bool)

+ func (c *TwoQueueCache[K, V]) PeekMany(keys []K) (map[K]V, []K)

+ func (c *TwoQueueCache[K, V]) Purge()

+ func (c *TwoQueueCache[K, V]) Range(f func(K, V) bool)

+ func (c *TwoQueueCache[K, V]) Set(key K, value V)

+ func (c *TwoQueueCache[K, V]) SetMany(items map[K]V)

+ func (c *TwoQueueCache[K, V]) Values() []V