lru-cache
Here are 96 public repositories matching this topic...
GoCache is a simple and efficient cache implementation that utilizes a doubly-linked list and a hash table to provide fast O(1) lookup and insertion times. It is designed to hold a fixed number of items and automatically flushes out the least recently used (LRU) item once the cache reaches its maximum capacity.
-
Updated
Apr 3, 2023 - Go
A Go Http server to get the nearest places, given location as input
-
Updated
Sep 26, 2020 - Go
An in-memory cache for golang (pre-alpha)
-
Updated
May 17, 2023 - Go
Simple go programs
-
Updated
Jul 26, 2021 - Go
The repository showcases a robust implementation of a cache in Go. It provides an efficient and customizable solution for caching data, improving performance in data-intensive applications. The codebase is well-documented and follows best practices, making it a valuable resource for developers seeking to build their own cache systems.
-
Updated
Jun 16, 2023 - Go
Adaptive bandit cache selection
-
Updated
Apr 14, 2024 - Go
学习DEMO,简易分布式缓存,实现Lru内存淘汰,一致性哈希,http客户端/服务端,避免缓存击穿,protobuf通信
-
Updated
Jul 31, 2021 - Go
Improve this page
Add a description, image, and links to the lru-cache topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the lru-cache topic, visit your repo's landing page and select "manage topics."