#cache #array #no-std #linkedlist

no-std uluru

A simple, fast, LRU cache implementation

11 releases (7 stable)

2.2.0 Jul 19, 2021
2.0.0 Apr 6, 2021
1.1.1 Feb 5, 2021
1.0.0 Jul 17, 2020
0.1.0 Nov 15, 2017

#47 in Data structures

Download history 9419/week @ 2021-04-08 10248/week @ 2021-04-15 9368/week @ 2021-04-22 8688/week @ 2021-04-29 8936/week @ 2021-05-06 8696/week @ 2021-05-13 5944/week @ 2021-05-20 7214/week @ 2021-05-27 7080/week @ 2021-06-03 8359/week @ 2021-06-10 7449/week @ 2021-06-17 6917/week @ 2021-06-24 6972/week @ 2021-07-01 9263/week @ 2021-07-08 8192/week @ 2021-07-15 6895/week @ 2021-07-22

33,305 downloads per month
Used in 8 crates (5 directly)

MPL-2.0 license

16KB
392 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