Lib.rs

› Data structures
#cache #array #linked-list

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

#95 in Data structures

Download history 53188/week @ 2024-11-25 69459/week @ 2024-12-02 70025/week @ 2024-12-09 68017/week @ 2024-12-16 44488/week @ 2024-12-23 50340/week @ 2024-12-30 74221/week @ 2025-01-06 77424/week @ 2025-01-13 76392/week @ 2025-01-20 71180/week @ 2025-01-27 79667/week @ 2025-02-03 92793/week @ 2025-02-10 93744/week @ 2025-02-17 102938/week @ 2025-02-24 104851/week @ 2025-03-03 101158/week @ 2025-03-10

409,684 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