#cache #array #linkedlist #no_std

no-std uluru

A simple, fast, LRU cache implementation

4 releases (breaking)

0.4.0 Nov 6, 2019
0.3.0 Sep 23, 2018
0.2.0 Dec 7, 2017
0.1.0 Nov 15, 2017

#129 in Data structures

Download history 594/week @ 2019-07-24 472/week @ 2019-07-31 682/week @ 2019-08-07 885/week @ 2019-08-14 1051/week @ 2019-08-21 679/week @ 2019-08-28 764/week @ 2019-09-04 757/week @ 2019-09-11 1195/week @ 2019-09-18 1818/week @ 2019-09-25 1711/week @ 2019-10-02 1509/week @ 2019-10-09 1790/week @ 2019-10-16 1483/week @ 2019-10-23 886/week @ 2019-10-30

5,027 downloads per month

MPL-2.0 license

12KB
214 lines

uluru

A simple, fast, least-recently-used (LRU) cache implementation used for Servo's style system.

LRUCache uses a fixed-capacity array for storage. It provides O(1) insertion, and O(n) lookup. It does not require an allocator and can be used in no_std crates.

Dependencies

~65KB