lrucache

Documentation

Overview

Package lrucache implements LRU (Least Recently Used) node

Index

• type LRUCache
  • func NewCache(capacity bytesize.ByteSize) *LRUCache
  • func (c *LRUCache) Delete(key string) (ok bool)
  • func (c *LRUCache) Get(key string) (value string, ok bool)
  • func (c *LRUCache) Put(key string, value string) (created bool)
  • func (c *LRUCache) Restore(closer io.ReadCloser) error
  • func (c *LRUCache) Snapshot() (raft.FSMSnapshot, error)

Types

type LRUCache

type LRUCache struct {
	sync.RWMutex
	cache.UnImplementedCache
	// contains filtered or unexported fields
}

LRUCache data structure

func NewCache

func NewCache(capacity bytesize.ByteSize) *LRUCache

NewCache LRUCache constructor

func (*LRUCache) Delete

func (c *LRUCache) Delete(key string) (ok bool)

applyDelete the key from the node

func (*LRUCache) Get

func (c *LRUCache) Get(key string) (value string, ok bool)

Get returns the value for the key

func (*LRUCache) Put

func (c *LRUCache) Put(key string, value string) (created bool)

applyPut updates or insert a new entry, evicts the old entry if node size is larger than capacity

func (*LRUCache) Restore

func (c *LRUCache) Restore(closer io.ReadCloser) error

func (*LRUCache) Snapshot

func (c *LRUCache) Snapshot() (raft.FSMSnapshot, error)