fixed some comments

Author: Code-Hex

fifo/fifo.go

@@ -5,6 +5,7 @@ import (
 )
 
 // Cache is used a FIFO (First in first out) cache replacement policy.
+//
 // In FIFO the item that enter the cache first is evicted first
 // w/o any regard of how often or how many times it was accessed before.
 type Cache[K comparable, V any] struct {
@@ -38,7 +39,7 @@ func WithCapacity(cap int) Option {
 	}
 }
 
-// NewCache creates a new cache.
+// NewCache creates a new FIFO cache whose capacity is the default size (128).
 func NewCache[K comparable, V any](opts ...Option) *Cache[K, V] {
 	o := newOptions()
 	for _, optFunc := range opts {

lfu/lfu.go

@@ -4,7 +4,12 @@ import (
 	"container/heap"
 )
 
-// Cache is a thread safe LRU cache
+// Cache is used a LFU (Least-frequently used) cache replacement policy.
+//
+// Counts how often an item is needed. Those that are used least often are discarded first.
+// This works very similar to LRU except that instead of storing the value of how recently
+// a block was accessed, we store the value of how many times it was accessed. So of course
+// while running an access sequence we will replace a block which was used fewest times from our cache.
 type Cache[K comparable, V any] struct {
 	cap   int
 	queue *priorityQueue[K, V]

lru/lru.go

@@ -4,7 +4,11 @@ import (
 	"container/list"
 )
 
-// Cache is a thread safe LRU cache
+// Cache is used a LRU (Least recently used) cache replacement policy.
+//
+// Discards the least recently used items first. This algorithm requires
+// keeping track of what was used when, which is expensive if one wants
+// to make sure the algorithm always discards the least recently used item.
 type Cache[K comparable, V any] struct {
 	cap   int
 	list  *list.List