Documentation
¶
Index ¶
- func DefaultNodeDir() string
- func IntToHex(num int64) []byte
- func PrintMemUsage()
- func SortByteArrays(src [][]byte) [][]byte
- type EvictCallback
- type LRU
- func (c *LRU) Add(key, value interface{}) bool
- func (c *LRU) Contains(key interface{}) (ok bool)
- func (c *LRU) Get(key interface{}) (value interface{}, ok bool)
- func (c *LRU) GetOldest() (interface{}, interface{}, bool)
- func (c *LRU) Keys() []interface{}
- func (c *LRU) Len() int
- func (c *LRU) Peek(key interface{}) (value interface{}, ok bool)
- func (c *LRU) Purge()
- func (c *LRU) Remove(key interface{}) bool
- func (c *LRU) RemoveOldest() (interface{}, interface{}, bool)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func DefaultNodeDir ¶
func DefaultNodeDir() string
func PrintMemUsage ¶
func PrintMemUsage()
Types ¶
type EvictCallback ¶
type EvictCallback func(key interface{}, value interface{})
EvictCallback is used to get a callback when a cache entry is evicted
type LRU ¶
type LRU struct {
// contains filtered or unexported fields
}
LRU implements a thread safe fixed size LRU cache
func NewLRU ¶
func NewLRU(size int, onEvict EvictCallback) *LRU
NewLRU constructs an LRU of the given size
func (*LRU) Contains ¶
Check if a key is in the cache, without updating the recent-ness or deleting it for being stale.
func (*LRU) Keys ¶
func (c *LRU) Keys() []interface{}
Keys returns a slice of the keys in the cache, from oldest to newest.
func (*LRU) Peek ¶
Returns the key value (or undefined if not found) without updating the "recently used"-ness of the key.
func (*LRU) Remove ¶
Remove removes the provided key from the cache, returning if the key was contained.
func (*LRU) RemoveOldest ¶
RemoveOldest removes the oldest item from the cache.
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.