datastructures

May 11, 2026

Changes in this version

type LRU

+ func (c *LRU[K, V]) FilterMissing(keys []K) []K

Apr 13, 2026

Changes in this version

type LRU

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

Mar 4, 2026

Changes in this version

+ type BloomSet struct

+ func NewBloomSet(opts BloomSetOptions) *BloomSet

+ func (b *BloomSet) Add(hash common.Hash)

+ func (b *BloomSet) AddMany(hashes []common.Hash)

+ func (b *BloomSet) Contains(hash common.Hash) bool

+ func (b *BloomSet) Count() uint

+ func (b *BloomSet) FilterNotContained(hashes []common.Hash) []common.Hash

+ func (b *BloomSet) MemoryUsage() uint

+ func (b *BloomSet) Reset()

+ func (b *BloomSet) Rotate()

+ type BloomSetOptions struct

+ HashCount uint

+ Size uint

+ func DefaultBloomSetOptions() BloomSetOptions

+ type BoundedSet struct

+ func NewBoundedSet[T comparable](max int) *BoundedSet[T]

+ func (b *BoundedSet[T]) Add(elem T)

+ func (b *BoundedSet[T]) Clear()

+ func (b *BoundedSet[T]) Contains(elem T) bool

+ func (b *BoundedSet[T]) Len() int

+ type LRU struct

+ func NewLRU[K comparable, V any](opts LRUOptions) *LRU[K, V]

+ func (c *LRU[K, V]) Add(key K, value V)

+ func (c *LRU[K, V]) AddBatch(keys []K, values []V)

+ func (c *LRU[K, V]) Get(key K) (V, bool)

+ func (c *LRU[K, V]) Peek(key K) (V, bool)

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

+ func (c *LRU[K, V]) PeekManyWithKeys(keys []K) ([]K, []V)

+ func (c *LRU[K, V]) Remove(key K) (V, bool)

+ func (c *LRU[K, V]) Update(key K, updateFn func(V) V)

+ type LRUOptions struct

+ MaxSize int

+ TTL time.Duration

+ type Locked struct

+ func (l *Locked[T]) Get() T

+ func (l *Locked[T]) Set(value T)

+ func (l *Locked[T]) Update(fn func(T) (T, bool)) bool