cache
cache copied to clipboard
LRU-based cache package for Go.
Results
2
cache issues
Sort by
recently updated
recently updated
newest added
Keys and values(as an object) can be stored in a map to access in `O(1)` time complexity. Also, updates can be done faster.
enhancement
good first issue
[`cache_test.go`](https://github.com/gozeloglu/cache/blob/main/cache_test.go) should be refactored to follow Go-style table-driven test. ## Why was it written like that? I was a newbie in Go while I was implementing this package. ## Why...
help wanted
good first issue