Lib.rs

› Data structures
#cache #linkedlist #array #no-std

no-std uluru

A simple, fast, LRU cache implementation

by Matt Brubeck, Emilio Cobos Álvarez, The Servo Project Developers (7 contributors). Co-owned by Servo.

12 releases (stable)

3.0.0 Aug 22, 2021
2.2.0 Jul 19, 2021
2.1.1 Jun 7, 2021
1.1.1 Feb 5, 2021
0.1.0 Nov 15, 2017

#193 in Data structures

Download history 6218/week @ 2022-08-17 5966/week @ 2022-08-24 5855/week @ 2022-08-31 5632/week @ 2022-09-07 6013/week @ 2022-09-14 5580/week @ 2022-09-21 4993/week @ 2022-09-28 5015/week @ 2022-10-05 5261/week @ 2022-10-12 6518/week @ 2022-10-19 6388/week @ 2022-10-26 6868/week @ 2022-11-02 6712/week @ 2022-11-09 7848/week @ 2022-11-16 5969/week @ 2022-11-23 6412/week @ 2022-11-30

28,538 downloads per month
Used in 23 crates (10 directly)

MPL-2.0 license

17KB
393 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. It is implemented in 100% safe Rust.

lib.rs:

A simple, fast, least-recently-used (LRU) cache.

[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.

See the LRUCache docs for details.

Dependencies

~65KB