removed internal test files

Author: Code-Hex

lfu/lfu.go

@@ -2,15 +2,13 @@ package lfu
 
 import (
 	"container/heap"
-	"sync"
 )
 
 // Cache is a thread safe LRU cache
 type Cache[K comparable, V any] struct {
 	cap   int
 	queue *priorityQueue[K, V]
 	items map[K]*entry[K, V]
-	mu    sync.RWMutex
 }
 
 // NewCache creates a new LFU cache whose capacity is the default size (128).
@@ -29,9 +27,6 @@ func NewCacheWithCap[K comparable, V any](cap int) *Cache[K, V] {
 
 // Get looks up a key's value from the cache.
 func (c *Cache[K, V]) Get(key K) (zero V, _ bool) {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
-
 	e, ok := c.items[key]
 	if !ok {
 		return
@@ -43,9 +38,6 @@ func (c *Cache[K, V]) Get(key K) (zero V, _ bool) {
 
 // Set sets a value to the cache with key. replacing any existing value.
 func (c *Cache[K, V]) Set(key K, val V) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
-
 	if e, ok := c.items[key]; ok {
 		c.queue.update(e, val)
 		return
@@ -63,8 +55,6 @@ func (c *Cache[K, V]) Set(key K, val V) {
 
 // Keys returns the keys of the cache. the order is from oldest to newest.
 func (c *Cache[K, V]) Keys() []K {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
 	keys := make([]K, 0, len(c.items))
 	for _, entry := range *c.queue {
 		keys = append(keys, entry.key)
@@ -74,8 +64,6 @@ func (c *Cache[K, V]) Keys() []K {
 
 // Delete deletes the item with provided key from the cache.
 func (c *Cache[K, V]) Delete(key K) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
 	if e, ok := c.items[key]; ok {
 		heap.Remove(c.queue, e.index)
 		delete(c.items, key)
@@ -84,7 +72,5 @@ func (c *Cache[K, V]) Delete(key K) {
 
 // Len returns the number of items in the cache.
 func (c *Cache[K, V]) Len() int {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
 	return c.queue.Len()
 }

lfu/lfu_internal_test.go

@@ -2,15 +2,13 @@ package lru
 
 import (
 	"container/list"
-	"sync"
 )
 
 // Cache is a thread safe LRU cache
 type Cache[K comparable, V any] struct {
 	cap   int
 	list  *list.List
 	items map[K]*list.Element
-	mu    sync.RWMutex
 }
 
 type entry[K comparable, V any] struct {
@@ -34,8 +32,6 @@ func NewCacheWithCap[K comparable, V any](cap int) *Cache[K, V] {
 
 // Get looks up a key's value from the cache.
 func (c *Cache[K, V]) Get(key K) (zero V, _ bool) {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
 	e, ok := c.items[key]
 	if !ok {
 		return
@@ -47,9 +43,6 @@ func (c *Cache[K, V]) Get(key K) (zero V, _ bool) {
 
 // Set sets a value to the cache with key. replacing any existing value.
 func (c *Cache[K, V]) Set(key K, val V) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
-
 	if e, ok := c.items[key]; ok {
 		// updates cache order
 		c.list.MoveToFront(e)
@@ -72,8 +65,6 @@ func (c *Cache[K, V]) Set(key K, val V) {
 
 // Keys returns the keys of the cache. the order is from oldest to newest.
 func (c *Cache[K, V]) Keys() []K {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
 	keys := make([]K, 0, len(c.items))
 	for ent := c.list.Back(); ent != nil; ent = ent.Prev() {
 		entry := ent.Value.(*entry[K, V])
@@ -84,15 +75,11 @@ func (c *Cache[K, V]) Keys() []K {
 
 // Len returns the number of items in the cache.
 func (c *Cache[K, V]) Len() int {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
 	return c.list.Len()
 }
 
 // Delete deletes the item with provided key from the cache.
 func (c *Cache[K, V]) Delete(key K) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
 	if e, ok := c.items[key]; ok {
 		c.delete(e)
 	}

lru/lru.go

@@ -2,14 +2,12 @@ package simple
 
 import (
 	"sort"
-	"sync"
 	"time"
 )
 
 // Cache is a simple cache has no clear priority for evict cache.
 type Cache[K comparable, V any] struct {
 	items map[K]*entry[V]
-	mu    sync.RWMutex
 }
 
 type entry[V any] struct {
@@ -27,8 +25,6 @@ func NewCache[K comparable, V any]() *Cache[K, V] {
 // Set sets any item to the cache. replacing any existing item.
 // The default item never expires.
 func (c *Cache[K, V]) Set(k K, v V) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
 	c.items[k] = &entry[V]{
 		val:       v,
 		createdAt: time.Now(),
@@ -38,9 +34,6 @@ func (c *Cache[K, V]) Set(k K, v V) {
 // Get gets an item from the cache.
 // Returns the item or zero value, and a bool indicating whether the key was found.
 func (c *Cache[K, V]) Get(k K) (val V, ok bool) {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
-
 	got, found := c.items[k]
 	if !found {
 		return
@@ -50,9 +43,6 @@ func (c *Cache[K, V]) Get(k K) (val V, ok bool) {
 
 // Keys returns cache keys. the order is sorted by created.
 func (c *Cache[K, _]) Keys() []K {
-	c.mu.RLock()
-	defer c.mu.RUnlock()
-
 	ret := make([]K, 0, len(c.items))
 	for key := range c.items {
 		ret = append(ret, key)
@@ -67,7 +57,5 @@ func (c *Cache[K, _]) Keys() []K {
 
 // Delete deletes the item with provided key from the cache.
 func (c *Cache[K, V]) Delete(key K) {
-	c.mu.Lock()
-	defer c.mu.Unlock()
 	delete(c.items, key)
 }