#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

#139 in Data structures

Download history 1811/week @ 2019-09-26 1689/week @ 2019-10-03 1494/week @ 2019-10-10 1745/week @ 2019-10-17 1330/week @ 2019-10-24 941/week @ 2019-10-31 1003/week @ 2019-11-07 1212/week @ 2019-11-14 1143/week @ 2019-11-21 920/week @ 2019-11-28 1279/week @ 2019-12-05 1337/week @ 2019-12-12 710/week @ 2019-12-19 403/week @ 2019-12-26 1185/week @ 2020-01-02

5,572 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

~64KB