#cache #array #no-std #linkedlist

no-std uluru

A simple, fast, LRU cache implementation

8 releases (4 stable)

Uses old Rust 2015

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

#63 in Data structures

Download history 505/week @ 2020-12-25 506/week @ 2021-01-01 603/week @ 2021-01-08 552/week @ 2021-01-15 615/week @ 2021-01-22 546/week @ 2021-01-29 610/week @ 2021-02-05 383/week @ 2021-02-12 788/week @ 2021-02-19 584/week @ 2021-02-26 3739/week @ 2021-03-05 8966/week @ 2021-03-12 9918/week @ 2021-03-19 10234/week @ 2021-03-26 8351/week @ 2021-04-02 7893/week @ 2021-04-09

14,044 downloads per month
Used in 6 crates (3 directly)

MPL-2.0 license

14KB
335 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

~65KB