#cache #array #linked-list #no-std

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

#407 in Data structures

Download history 29886/week @ 2024-01-29 30486/week @ 2024-02-05 31848/week @ 2024-02-12 31828/week @ 2024-02-19 29301/week @ 2024-02-26 30280/week @ 2024-03-04 29488/week @ 2024-03-11 33501/week @ 2024-03-18 32582/week @ 2024-03-25 34262/week @ 2024-04-01 37656/week @ 2024-04-08 38109/week @ 2024-04-15 40119/week @ 2024-04-22 40585/week @ 2024-04-29 41376/week @ 2024-05-06 46201/week @ 2024-05-13

171,433 downloads per month
Used in 33 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

~66KB