Strongly typed least frequently used (LFU) cache in Go with constant time complexity O(1) on all operations
-
Updated
Mar 4, 2024 - Go
Strongly typed least frequently used (LFU) cache in Go with constant time complexity O(1) on all operations
LFU implemented in very basic (no interior mutability)
Simple implementations of LRU / LFU cache.
Add a description, image, and links to the lfu-implementation topic page so that developers can more easily learn about it.
To associate your repository with the lfu-implementation topic, visit your repo's landing page and select "manage topics."