-
Updated
Oct 1, 2017 - Python
lru-cache
Here are 478 public repositories matching this topic...
Some famous design questions and their implementation
-
Updated
Jan 11, 2020 - Java
A collection of cache implementations in python
-
Updated
May 19, 2020 - Python
-
Updated
Feb 14, 2020 - Python
A python implementation of LRUCache from scratch
-
Updated
Mar 27, 2021 - Python
Simple LRU cache with more utility methods.
-
Updated
May 7, 2023 - TypeScript
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
No 🐦 URURU, just LRU (and friends)
-
Updated
Dec 14, 2023 - TypeScript
"Least Recently Used" (LRU) cache compatible to ES6 Map
-
Updated
Sep 14, 2021 - JavaScript
Project of algorithms and data structure made in Java 8 to perform the LRU Cache behavior.
-
Updated
Apr 4, 2018 - Java
A sample app to show images from Flickr api using LRU cache and without using any external library.
-
Updated
Oct 1, 2019 - Java
A C# reference implementation of a Least Recently Used (LRU) cache for educational purposes.
-
Updated
May 19, 2020 - C#
In this repository, we designed a LRU (Least Recently Used) cache.
-
Updated
Mar 21, 2020 - C++
Implementation of various page replacement policies including First in First out (FIFO), Least Recently Used (LRU), Approximate LRU and Random.
-
Updated
Dec 9, 2020 - C
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."