Lib.rs

› Data structures
#cache #array #linked-list #no-std

no-std uluru

A simple, fast, LRU cache implementation

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

13 releases (stable)

3.1.0 Apr 8, 2024
3.0.0 Aug 22, 2021
2.2.0 Jul 19, 2021
1.1.1 Feb 5, 2021
0.1.0 Nov 15, 2017

#306 in Data structures

Download history 27477/week @ 2024-01-24 30502/week @ 2024-01-31 30781/week @ 2024-02-07 33501/week @ 2024-02-14 29236/week @ 2024-02-21 30559/week @ 2024-02-28 29523/week @ 2024-03-06 30775/week @ 2024-03-13 33808/week @ 2024-03-20 34094/week @ 2024-03-27 34117/week @ 2024-04-03 37726/week @ 2024-04-10 38845/week @ 2024-04-17 41183/week @ 2024-04-24 40441/week @ 2024-05-01 34082/week @ 2024-05-08

160,899 downloads per month
Used in 33 crates (11 directly)

MPL-2.0 license

17KB
365 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

~66KB