cache

type ByteSlice ¶ added in v1.3.0

type ByteSlice struct {
	// contains filtered or unexported fields
}

func (s ByteSlice) Get(fn func() []byte) []byte

type Coster ¶ added in v1.3.10

type Coster interface {
	Cost() int
}

type CosterLRU ¶ added in v1.3.10

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

func MakeCosterLRU[K comparable, V Coster](cap int) CosterLRU[K, V]

func NewCosterLRU[K comparable, V Coster](cap int) *CosterLRU[K, V]

func (c *CosterLRU[K, V]) Get(key K) (val V, ok bool)

func (c *CosterLRU[K, V]) Put(key K, value V)

type CosterRandom ¶ added in v1.3.13

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

CosterRandom is a key value cache with random eviction. The cache holds key values under cost cap and evicts random items if the cache holds cache items beyond the cost cap.

func MakeCosterRandom[K comparable, V Coster](cap int, src rand.Source) CosterRandom[K, V]

func NewCosterRandom[K comparable, V Coster](cap int, src rand.Source) *CosterRandom[K, V]

func (c *CosterRandom[K, V]) Get(key K) (val V, ok bool)

func (c *CosterRandom[K, V]) Put(key K, value V)

type Create ¶

type Create func([]byte) (interface{}, error)

type LRUCache ¶

type LRUCache struct {
	// contains filtered or unexported fields
}

func NewLRUCache(size int, create Create) *LRUCache

func (c *LRUCache) Get(key []byte) (interface{}, error)

func (c *LRUCache) Len() int

func (c *LRUCache) Put(key string, value interface{})

func (c *LRUCache) Size() int

type SimpleCache ¶ added in v0.9.7

type SimpleCache struct {
	// contains filtered or unexported fields
}

func NewSimpleCache(cap int) *SimpleCache

func (c *SimpleCache) Get(key []byte) interface{}

func (c *SimpleCache) Put(key []byte, value interface{})