File Exchange

image thumbnail

Least-Recently Used (LRU) Cache

version 1.0.0 (3.36 KB) by Richard Lange
A map-like container of (key, value) pairs that automatically enforces a maximum size by deleting oldest keys when new ones are added.

1 Download

Updated 17 Sep 2018

View License

This package provides a Matlab implementation of a LRU cache. An LRU cache is a container of (key, value) pairs with some upper limit on size. Whenever a new element is added that would go over this limit, the least-recently-used item is discarded. This implementation allows for a limit either on the total number of items and/or on the total memory usage in bytes. This makes it a useful tool for caching results in memory while keeping the size of the cache under a pre-specified limit, for example.

The file `LRU.m` contains the class definition for the cache. `DLL.m` contains a simple doubly-linked list, which is needed inside of `LRU`. `testLRUCache.m` contains three simple test cases that also serve as examples.

Comments and Ratings (1)

MATLAB Release Compatibility
Created with R2018b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags