Documentation
¶
Index ¶
Examples ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Cache ¶
type Cache[K comparable, V any] struct { // contains filtered or unexported fields }
Cache is used a MRU (Most recently used) cache replacement policy.
In contrast to Least Recently Used (LRU), MRU discards the most recently used items first.
func NewCache ¶
func NewCache[K comparable, V any](opts ...Option) *Cache[K, V]
NewCache creates a new non-thread safe MRU cache whose capacity is the default size (128).
Example ¶
package main
import (
"fmt"
"github.com/Code-Hex/go-generics-cache/policy/mru"
)
func main() {
c := mru.NewCache[string, int]()
c.Set("a", 1)
c.Set("b", 2)
av, aok := c.Get("a")
bv, bok := c.Get("b")
cv, cok := c.Get("c")
fmt.Println(av, aok)
fmt.Println(bv, bok)
fmt.Println(cv, cok)
}
Output: 1 true 2 true 0 false
func (*Cache[K, V]) Delete ¶
func (c *Cache[K, V]) Delete(key K)
Delete deletes the item with provided key from the cache.
func (*Cache[K, V]) Keys ¶
func (c *Cache[K, V]) Keys() []K
Keys returns the keys of the cache. the order is from recently used.
Example ¶
package main
import (
"fmt"
"github.com/Code-Hex/go-generics-cache/policy/mru"
)
func main() {
c := mru.NewCache[string, int]()
c.Set("a", 1)
c.Set("b", 2)
c.Set("c", 3)
keys := c.Keys()
for _, key := range keys {
fmt.Println(key)
}
}
Output: c b a
Source Files
Click to show internal directories.
Click to hide internal directories.