mirror of
https://github.com/woodpecker-ci/woodpecker.git
synced 2024-12-18 08:26:45 +02:00
120 lines
2.5 KiB
Go
120 lines
2.5 KiB
Go
// This package provides a simple LRU cache. It is based on the
|
|
// LRU implementation in groupcache:
|
|
// https://github.com/golang/groupcache/tree/master/lru
|
|
package lru
|
|
|
|
import (
|
|
"container/list"
|
|
"errors"
|
|
"sync"
|
|
)
|
|
|
|
// Cache is a thread-safe fixed size LRU cache.
|
|
type Cache struct {
|
|
size int
|
|
evictList *list.List
|
|
items map[interface{}]*list.Element
|
|
lock sync.Mutex
|
|
}
|
|
|
|
// entry is used to hold a value in the evictList
|
|
type entry struct {
|
|
key interface{}
|
|
value interface{}
|
|
}
|
|
|
|
// New creates an LRU of the given size
|
|
func New(size int) (*Cache, error) {
|
|
if size <= 0 {
|
|
return nil, errors.New("Must provide a positive size")
|
|
}
|
|
c := &Cache{
|
|
size: size,
|
|
evictList: list.New(),
|
|
items: make(map[interface{}]*list.Element, size),
|
|
}
|
|
return c, nil
|
|
}
|
|
|
|
// Purge is used to completely clear the cache
|
|
func (c *Cache) Purge() {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.evictList = list.New()
|
|
c.items = make(map[interface{}]*list.Element, c.size)
|
|
}
|
|
|
|
// Add adds a value to the cache.
|
|
func (c *Cache) Add(key, value interface{}) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
// Check for existing item
|
|
if ent, ok := c.items[key]; ok {
|
|
c.evictList.MoveToFront(ent)
|
|
ent.Value.(*entry).value = value
|
|
return
|
|
}
|
|
|
|
// Add new item
|
|
ent := &entry{key, value}
|
|
entry := c.evictList.PushFront(ent)
|
|
c.items[key] = entry
|
|
|
|
// Verify size not exceeded
|
|
if c.evictList.Len() > c.size {
|
|
c.removeOldest()
|
|
}
|
|
}
|
|
|
|
// Get looks up a key's value from the cache.
|
|
func (c *Cache) Get(key interface{}) (value interface{}, ok bool) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
if ent, ok := c.items[key]; ok {
|
|
c.evictList.MoveToFront(ent)
|
|
return ent.Value.(*entry).value, true
|
|
}
|
|
return
|
|
}
|
|
|
|
// Remove removes the provided key from the cache.
|
|
func (c *Cache) Remove(key interface{}) {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
|
|
if ent, ok := c.items[key]; ok {
|
|
c.removeElement(ent)
|
|
}
|
|
}
|
|
|
|
// RemoveOldest removes the oldest item from the cache.
|
|
func (c *Cache) RemoveOldest() {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
c.removeOldest()
|
|
}
|
|
|
|
// removeOldest removes the oldest item from the cache.
|
|
func (c *Cache) removeOldest() {
|
|
ent := c.evictList.Back()
|
|
if ent != nil {
|
|
c.removeElement(ent)
|
|
}
|
|
}
|
|
|
|
// removeElement is used to remove a given list element from the cache
|
|
func (c *Cache) removeElement(e *list.Element) {
|
|
c.evictList.Remove(e)
|
|
kv := e.Value.(*entry)
|
|
delete(c.items, kv.key)
|
|
}
|
|
|
|
// Len returns the number of items in the cache.
|
|
func (c *Cache) Len() int {
|
|
c.lock.Lock()
|
|
defer c.lock.Unlock()
|
|
return c.evictList.Len()
|
|
}
|