#lru-cache #cache #linked-list #array

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

#300 in Data structures

Download history 191744/week @ 2025-12-07 176474/week @ 2025-12-14 123226/week @ 2025-12-21 129852/week @ 2025-12-28 205321/week @ 2026-01-04 237330/week @ 2026-01-11 276244/week @ 2026-01-18 338972/week @ 2026-01-25 399479/week @ 2026-02-01 454947/week @ 2026-02-08 346875/week @ 2026-02-15 264362/week @ 2026-02-22 299456/week @ 2026-03-01 373993/week @ 2026-03-08 321842/week @ 2026-03-15 291227/week @ 2026-03-22

1,313,903 downloads per month
Used in 60 crates (14 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

~66KB