26 releases

0.4.23 Sep 25, 2025
0.4.21 Oct 14, 2024
0.4.18 May 15, 2024
0.4.15 Feb 13, 2024
0.3.1 Jul 10, 2022

#27 in Caching

Download history 13708/week @ 2025-09-24 13785/week @ 2025-10-01 11712/week @ 2025-10-08 13487/week @ 2025-10-15 9504/week @ 2025-10-22 13208/week @ 2025-10-29 11007/week @ 2025-11-05 8685/week @ 2025-11-12 10196/week @ 2025-11-19 10792/week @ 2025-11-26 11075/week @ 2025-12-03 10163/week @ 2025-12-10 8856/week @ 2025-12-17 5262/week @ 2025-12-24 5872/week @ 2025-12-31 9796/week @ 2026-01-07

31,555 downloads per month
Used in 35 crates (11 directly)

MIT/Apache

66KB
2K SLoC

once_map

Crates.io Docs.rs Minimum rustc version

This crate provides OnceMap, a type of HashMap where entries can be written with a shared reference, but can be written ony once. This is similar to once_cell, but with a map. This enables to reference values inside the map for the lifetime of the map, without the need of further locks.

This makes this type perfect for implementation of caches. A type LazyMap is provided for such cases.

This crate provides such a map heavily optimized for concurrent use, but also a single-threaded version.

Example

let map = OnceMap::new();

// All these are `&str` pointing directly in the map.
// Note that we don't need a mutable reference, so we can have several of
// them at the same time.
let roses = map.insert(String::from("rose"), |_| String::from("red"));
let violets = map.insert(String::from("violets"), |_| String::from("blue"));
let sugar = map.insert(String::from("sugar"), |_| String::from("sweet"));

assert_eq!(roses, "red");
assert_eq!(violets, "blue");
assert_eq!(sugar, "sweet");

// The closure is never run here, because we already have a value for "rose"
let roses = map.insert(String::from("rose"), |_| String::from("green"));
// The old value did not change
assert_eq!(roses, "red");

Dependencies

~1.1–2.2MB
~33K SLoC