README
¶
lru
Simple implementation of LRU caching algorithms
Usage:
import "fmt"
func main() {
lru, _ := NewLRU(3, func(key string, value interface{}) {
fmt.Println("Evicted")
fmt.Println("Key ", key)
fmt.Println("Value", value)
})
lru.Put("a", 1)
lru.Print()
lru.Put("b", 2)
lru.Print()
lru.Put("c", 3)
lru.Print()
lru.Put("d", 4)
lru.Print()
lru.Get("b")
lru.Print()
lru.Clear()
}
Documentation
¶
Index ¶
- type Cache
- type Elem
- type EvictCallback
- type LRU
- func (lru *LRU) All() []*Elem
- func (lru *LRU) Clear()
- func (lru *LRU) Contains(key string) interface{}
- func (lru *LRU) Get(key string) (interface{}, bool)
- func (lru *LRU) Init(data []*Elem) bool
- func (lru *LRU) Len() int
- func (lru *LRU) Print()
- func (lru *LRU) Put(key string, value interface{}) (interface{}, bool)
- func (lru *LRU) Remove(key string) bool
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type EvictCallback ¶
type EvictCallback func(key string, value interface{})
Source Files
Click to show internal directories.
Click to hide internal directories.