🦄【轻量级本地内存缓存】🤏代码少于300行⌚️30s接入🚀高性能、极简设计、并发安全🌈支持LRU 和 LRU-2模式 🦖支持分布式一致性 [ecache] Extremely easy, ultra fast, concurrency-safe and support distributed consistency. Similar to bigcache, cachego, freecache, gcache, gocache, groupcache, lrucache.

TypeScript implementation of LRU Cache

Rust cache structures and easy function memoization

This project is an Android application developed for an interview task. It fetches media coverages from a remote service and displays them in a paginated list. The app utilizes modern Android development practices and libraries such as Retrofit for network operations, Dagger Hilt for dependency injection, and Paging 3 for pagination.-By NimeshPatel

One of The Fastest Zero Alloc LRU Cache for Golang (Go). Maximizes memory use, no garbage collection issues. Use memory size limit instead of specifying item capacity. Batch eviction feature for faster processing

A fast cache that automatically deletes the least recently used items

LRU8 is an extremely fast "least recently used" (LRU) cache designed for 64-bit machines. This lightweight implementation is tailored for efficiency and speed, managing up to 8 elements in memory.

gotcha: inmemory-cache in Go (Golang) with customizable algorithm

LRU (Least recently used) cache with additional weak map layer.

Least recently used (LRU) in-memory cache.

An Android library for data load with cache and loading state

Least Recently Used Cache

Like @functools.cache / @functools.lru_cache but with non-hashable objects

Template implementation of a dynamically memory allocated linked list cache using the least recently used (LRU) algorithm.

A Custom Swift Cache Object using LRU Algorithm

Generic go cache

A LRU cache implemented using object oriented approach

In memory Go implementation of LRU Cache

Fast and lightweight lru cache for javascript

📦 Thread-safe, crypto-protected, multi-level lru caching with a life cycle