mirror of
https://gitlab.com/pulsechaincom/go-pulse.git
synced 2024-12-22 03:30:35 +00:00
9afc6816d2
It seems there is no fully typed library implementation of an LRU cache. So I wrote one. Method names are the same as github.com/hashicorp/golang-lru, and the new type can be used as a drop-in replacement. Two reasons to do this: - It's much easier to understand what a cache is for when the types are right there. - Performance: the new implementation is slightly faster and performs zero memory allocations in Add when the cache is at capacity. Overall, memory usage of the cache is much reduced because keys are values are no longer wrapped in interface.
96 lines
2.5 KiB
Go
96 lines
2.5 KiB
Go
// Copyright 2022 The go-ethereum Authors
|
|
// This file is part of the go-ethereum library.
|
|
//
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public License
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
package lru
|
|
|
|
import "sync"
|
|
|
|
// Cache is a LRU cache.
|
|
// This type is safe for concurrent use.
|
|
type Cache[K comparable, V any] struct {
|
|
cache BasicLRU[K, V]
|
|
mu sync.Mutex
|
|
}
|
|
|
|
// NewCache creates an LRU cache.
|
|
func NewCache[K comparable, V any](capacity int) *Cache[K, V] {
|
|
return &Cache[K, V]{cache: NewBasicLRU[K, V](capacity)}
|
|
}
|
|
|
|
// Add adds a value to the cache. Returns true if an item was evicted to store the new item.
|
|
func (c *Cache[K, V]) Add(key K, value V) (evicted bool) {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Add(key, value)
|
|
}
|
|
|
|
// Contains reports whether the given key exists in the cache.
|
|
func (c *Cache[K, V]) Contains(key K) bool {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Contains(key)
|
|
}
|
|
|
|
// Get retrieves a value from the cache. This marks the key as recently used.
|
|
func (c *Cache[K, V]) Get(key K) (value V, ok bool) {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Get(key)
|
|
}
|
|
|
|
// Len returns the current number of items in the cache.
|
|
func (c *Cache[K, V]) Len() int {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Len()
|
|
}
|
|
|
|
// Peek retrieves a value from the cache, but does not mark the key as recently used.
|
|
func (c *Cache[K, V]) Peek(key K) (value V, ok bool) {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Peek(key)
|
|
}
|
|
|
|
// Purge empties the cache.
|
|
func (c *Cache[K, V]) Purge() {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
c.cache.Purge()
|
|
}
|
|
|
|
// Remove drops an item from the cache. Returns true if the key was present in cache.
|
|
func (c *Cache[K, V]) Remove(key K) bool {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Remove(key)
|
|
}
|
|
|
|
// Keys returns all keys of items currently in the LRU.
|
|
func (c *Cache[K, V]) Keys() []K {
|
|
c.mu.Lock()
|
|
defer c.mu.Unlock()
|
|
|
|
return c.cache.Keys()
|
|
}
|