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

#221 in Data structures

Download history 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 41717/week @ 2024-05-08 47554/week @ 2024-05-15 43638/week @ 2024-05-22 42983/week @ 2024-05-29 37727/week @ 2024-06-05 40657/week @ 2024-06-12 39716/week @ 2024-06-19 39652/week @ 2024-06-26 41512/week @ 2024-07-03 39857/week @ 2024-07-10 31328/week @ 2024-07-17

159,036 downloads per month
Used in 35 crates (10 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