#linked-list #array #cache #no-std

no-std uluru

A simple, fast, LRU cache implementation

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

#71 in Data structures

Download history 71875/week @ 2025-01-28 80602/week @ 2025-02-04 93082/week @ 2025-02-11 95746/week @ 2025-02-18 105054/week @ 2025-02-25 106733/week @ 2025-03-04 107215/week @ 2025-03-11 98264/week @ 2025-03-18 98443/week @ 2025-03-25 302838/week @ 2025-04-01 310157/week @ 2025-04-08 173222/week @ 2025-04-15 153557/week @ 2025-04-22 157430/week @ 2025-04-29 194942/week @ 2025-05-06 152011/week @ 2025-05-13

680,257 downloads per month
Used in 35 crates (11 directly)

MPL-2.0 license

17KB
365 lines

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.


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.

Dependencies

~68KB