A C# reference implementation of a Least Recently Used (LRU) cache for educational purposes.
-
Updated
May 19, 2020 - C#
A C# reference implementation of a Least Recently Used (LRU) cache for educational purposes.
Coding challenges from leetcode/hackerrank with Arrays, Trees, LinkedList, Stack/Queues, Heap, Graphs (Path finding for minimum weight along with routes, Minimum Spanning Tree), and Dynamic Programming.
Supercharge your C# caching capabilities with an expansive library that enriches IDistributedCache, MemoryCache, and ObjectCache, while introducing specialized caches like LruCache and ThreadSafeMemoryCache.
Least-recently-used cache implementation of C# IDictionary
Least Recently Used (LRU) cache implementation in C#
Trace-driven cache memory simulator with LRU, MRU, RR and Belady replacement policies.
A C# .Net Core implementation of a LRUCache with per-item expiration support. Contains two implementations: simple and lockfree
Add a description, image, and links to the lru-cache topic page so that developers can more easily learn about it.
To associate your repository with the lru-cache topic, visit your repo's landing page and select "manage topics."