fifocache

Documentation

Index

• func ShardInt[T constraints.Integer](v T) uint8
• type Cache
  • func New[K comparable, V any](capacity int, onEvict func(K, V), keyShardFunc func(K) uint8) *Cache[K, V]
  • func (c *Cache[K, V]) Delete(key K)
  • func (c *Cache[K, V]) Get(key K) (value V, ok bool)
  • func (c *Cache[K, V]) Set(key K, value V, size int)
• type Queue
  • func NewQueue[T any]() *Queue[T]

Functions

func ShardInt

func ShardInt[T constraints.Integer](v T) uint8

Types

type Cache

type Cache[K comparable, V any] struct {
	// contains filtered or unexported fields
}

Cache implements an in-memory cache with FIFO-based eviction it's mostly like the S3-fifo, only without the ghost queue part

func New

func New[K comparable, V any](
	capacity int,
	onEvict func(K, V),
	keyShardFunc func(K) uint8,
) *Cache[K, V]

func (*Cache[K, V]) Delete

func (c *Cache[K, V]) Delete(key K)

func (*Cache[K, V]) Get

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

func (*Cache[K, V]) Set

func (c *Cache[K, V]) Set(key K, value V, size int)

type Queue

type Queue[T any] struct {
	// contains filtered or unexported fields
}

func NewQueue

func NewQueue[T any]() *Queue[T]