Lib.rs

› Data structures
#lru-cache #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

#67 in Data structures

Download history 42839/week @ 2024-12-22 52234/week @ 2024-12-29 73695/week @ 2025-01-05 76374/week @ 2025-01-12 76559/week @ 2025-01-19 71872/week @ 2025-01-26 77087/week @ 2025-02-02 94165/week @ 2025-02-09 92946/week @ 2025-02-16 101005/week @ 2025-02-23 104211/week @ 2025-03-02 110257/week @ 2025-03-09 102034/week @ 2025-03-16 93348/week @ 2025-03-23 260647/week @ 2025-03-30 301466/week @ 2025-04-06

770,651 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