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

#267 in Data structures

Download history 28199/week @ 2024-01-20 28144/week @ 2024-01-27 31522/week @ 2024-02-03 30087/week @ 2024-02-10 33645/week @ 2024-02-17 28535/week @ 2024-02-24 31000/week @ 2024-03-02 29382/week @ 2024-03-09 32755/week @ 2024-03-16 32928/week @ 2024-03-23 34813/week @ 2024-03-30 35440/week @ 2024-04-06 38675/week @ 2024-04-13 38964/week @ 2024-04-20 41496/week @ 2024-04-27 41180/week @ 2024-05-04

165,900 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