#cache #array #linked-list

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

#169 in Data structures

Download history 48391/week @ 2024-09-06 42997/week @ 2024-09-13 37343/week @ 2024-09-20 37950/week @ 2024-09-27 42717/week @ 2024-10-04 43858/week @ 2024-10-11 44416/week @ 2024-10-18 40991/week @ 2024-10-25 44139/week @ 2024-11-01 44335/week @ 2024-11-08 48327/week @ 2024-11-15 57244/week @ 2024-11-22 62099/week @ 2024-11-29 70438/week @ 2024-12-06 67811/week @ 2024-12-13 50456/week @ 2024-12-20

259,297 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

~69KB