lfu

lfu

Thead-safe Least Frequently Used (LFU) cache replacement policy implementation with O(1) complexity

Usages

capacity = 10
// create a new LFU cache with capacity
// if capacity is set to non-positive integer
// the cache won't do any eviction
lfu := lfu.New(capacity)

// set k, v
lfu.Set("k1", "v1")

// get v for k
v, ok := lfu.Get("k1")

// evict certain number of items
lfu.Evict(1)

// get current size of lfu
size := lfu.Size()

References

• An O(1) algorithm for implementing the LFU cache eviction scheme, chinese version