cache

Documentation

Index

• type ByteSlice
  • func (s ByteSlice) Get(fn func() []byte) []byte
• type Coster
• type CosterLRU
  • 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
  • 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 LRUCache
  • 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
  • func NewSimpleCache(cap int) *SimpleCache
  • func (c *SimpleCache) Get(key []byte) interface{}
  • func (c *SimpleCache) Put(key []byte, value interface{})

Types

type ByteSlice

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

func (ByteSlice) Get

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

type Coster

type Coster interface {
	Cost() int
}

type CosterLRU

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

func MakeCosterLRU

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

func NewCosterLRU

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

func (*CosterLRU[K, V]) Get

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

func (*CosterLRU[K, V]) Put

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

type CosterRandom

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

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

MakeCosterRandom returns a new CosterRandom object.

func NewCosterRandom

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

func (*CosterRandom[K, V]) Get

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

func (*CosterRandom[K, V]) Put

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

func NewLRUCache(size int, create Create) *LRUCache

func (*LRUCache) Get

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

func (*LRUCache) Len

func (c *LRUCache) Len() int

func (*LRUCache) Put

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

func (*LRUCache) Size

func (c *LRUCache) Size() int

type SimpleCache

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

func NewSimpleCache

func NewSimpleCache(cap int) *SimpleCache

func (*SimpleCache) Get

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

func (*SimpleCache) Put

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