Lib.rs

› Data structures
#cache #linked-list #array

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

#94 in Data structures

Download history 67029/week @ 2024-11-30 69168/week @ 2024-12-07 68127/week @ 2024-12-14 45641/week @ 2024-12-21 50843/week @ 2024-12-28 72893/week @ 2025-01-04 75505/week @ 2025-01-11 77445/week @ 2025-01-18 71430/week @ 2025-01-25 76670/week @ 2025-02-01 93143/week @ 2025-02-08 92388/week @ 2025-02-15 98091/week @ 2025-02-22 104822/week @ 2025-03-01 108068/week @ 2025-03-08 93914/week @ 2025-03-15

420,767 downloads per month
Used in 30 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

~68KB