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

#113 in Data structures

Download history 44114/week @ 2024-10-30 42995/week @ 2024-11-06 45136/week @ 2024-11-13 59153/week @ 2024-11-20 55174/week @ 2024-11-27 69580/week @ 2024-12-04 70985/week @ 2024-12-11 60863/week @ 2024-12-18 44226/week @ 2024-12-25 56920/week @ 2025-01-01 76414/week @ 2025-01-08 79834/week @ 2025-01-15 73053/week @ 2025-01-22 74285/week @ 2025-01-29 81393/week @ 2025-02-05 79228/week @ 2025-02-12

322,018 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