fixed compilation

Author: Code-Hex

lfu/lfu.go

@@ -3,8 +3,6 @@ package lfu
 import (
 	"container/heap"
 	"sync"
-
-	cache "github.com/Code-Hex/go-generics-cache"
 )
 
 // Cache is a thread safe LRU cache
@@ -15,8 +13,6 @@ type Cache[K comparable, V any] struct {
 	mu    sync.RWMutex
 }
 
-var _ cache.Interface[interface{}, any] = (*Cache[interface{}, any])(nil)
-
 // NewCache creates a new LFU cache whose capacity is the default size (128).
 func NewCache[K comparable, V any]() *Cache[K, V] {
 	return NewCacheWithCap[K, V](128)

lfu/priotiry_queue.go

@@ -3,8 +3,6 @@ package lfu
 import (
 	"container/heap"
 	"time"
-
-	cache "github.com/Code-Hex/go-generics-cache"
 )
 
 type entry[K comparable, V any] struct {
@@ -15,7 +13,7 @@ type entry[K comparable, V any] struct {
 	referencedAt   time.Time
 }
 
-func newEntry[K comparable, V any](key K, val V, opts ...cache.ItemOption) *entry[K, V] {
+func newEntry[K comparable, V any](key K, val V) *entry[K, V] {
 	return &entry[K, V]{
 		index:          0,
 		key:            key,

lru/lru.go

@@ -3,8 +3,6 @@ package lru
 import (
 	"container/list"
 	"sync"
-
-	cache "github.com/Code-Hex/go-generics-cache"
 )
 
 // Cache is a thread safe LRU cache
@@ -20,8 +18,6 @@ type entry[K comparable, V any] struct {
 	val V
 }
 
-var _ cache.Interface[interface{}, any] = (*Cache[interface{}, any])(nil)
-
 // NewCache creates a new LRU cache whose capacity is the default size (128).
 func NewCache[K comparable, V any]() *Cache[K, V] {
 	return NewCacheWithCap[K, V](128)

simple/simple.go

@@ -4,8 +4,6 @@ import (
 	"sort"
 	"sync"
 	"time"
-
-	cache "github.com/Code-Hex/go-generics-cache"
 )
 
 // Cache is a simple cache has no clear priority for evict cache.
@@ -19,8 +17,6 @@ type entry[V any] struct {
 	createdAt time.Time
 }
 
-var _ cache.Interface[interface{}, any] = (*Cache[interface{}, any])(nil)
-
 // NewCache creates a new cache.
 func NewCache[K comparable, V any]() *Cache[K, V] {
 	return &Cache[K, V]{