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

#178 in Data structures

Download history 42853/week @ 2024-08-15 41211/week @ 2024-08-22 39321/week @ 2024-08-29 50207/week @ 2024-09-05 43717/week @ 2024-09-12 37108/week @ 2024-09-19 37193/week @ 2024-09-26 42209/week @ 2024-10-03 44422/week @ 2024-10-10 45381/week @ 2024-10-17 40269/week @ 2024-10-24 43361/week @ 2024-10-31 43687/week @ 2024-11-07 47219/week @ 2024-11-14 58555/week @ 2024-11-21 46700/week @ 2024-11-28

202,956 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

~69KB