diff --git a/algorithm/lrucache.go b/algorithm/lrucache.go index db32053..382435d 100644 --- a/algorithm/lrucache.go +++ b/algorithm/lrucache.go @@ -77,6 +77,7 @@ func (l *LRUCache[K, V]) Delete(key K) bool { if ok { key := l.deleteNode(node) delete(l.cache, key) + l.length = len(l.cache) return true } l.length = len(l.cache) diff --git a/algorithm/lrucache_test.go b/algorithm/lrucache_test.go index 6145445..96bfd2f 100644 --- a/algorithm/lrucache_test.go +++ b/algorithm/lrucache_test.go @@ -32,3 +32,27 @@ func TestLRUCache(t *testing.T) { _, ok = cache.Get(2) assert.Equal(false, ok) } + +func TestLRUCacheDeleteLen(t *testing.T) { + t.Parallel() + cache := NewLRUCache[int, int](3) + for key := 1; key <= 3; key++ { + cache.Put(key, key) + } + + for _, key := range []int{2, 1, 3} { + before := cache.Len() + if !cache.Delete(key) { + t.Fatalf("Delete(%d) = false, want true", key) + } + if got := cache.Len(); got != before-1 { + t.Fatalf("Len() after Delete(%d) = %d, want %d", key, got, before-1) + } + if cache.Delete(key) { + t.Fatalf("Delete(%d) = true for a missing key", key) + } + if got := cache.Len(); got != before-1 { + t.Fatalf("Len() after missing Delete(%d) = %d, want %d", key, got, before-1) + } + } +}