basic lru cache implementation in golang

An in-memory key:value store/cache library for Go, suitable for single-machine applications.

some useful datatypes

In-Memory LRU Cache for Golang Applications

An in-memory cache for golang (pre-alpha)

Microservice for order management

Package ncache implements a simple LRU cache as well as a cache wrapper for populating caches that deduplicates lookups for the same cache key.

LFU (least frequently used) - The algorithm is based on a ring data structure

🛠️ Build type-safe database queries in Go with Relica, a lightweight tool that requires no external dependencies for high performance and ease of use.

a lightweight package that implements lru cache algorithm in 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.

Adaptive selection cache

Golang LRU cache

Simple go programs

A replication of tiny-lru npm package in golang

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.

A multi tenant cache implementation in Go which allows for custom eviction policy and max memory allocation per tenant

📊 Minimal LRU Cache implemented in Go

LRU cache go package implementation with generic support. this package is modification of https://github.com/projectdiscovery/expirablelru and container/list packages