RiteLinked provides more up to date versions of LinkedHashMap & LinkedHashSet .
You can easily use it on std or no_std environment.
Support some practical feature combinations to help you better embed them in existing code: serde, inline-more etc.
Especially, it uses griddle by default, if you have a lot of data, it can effectively help you reduce the possible tail delay. (Of course, hashbrown can also be used)
Add ritelinked to Cargo.toml:
toml
ritelinked = "x.y.z"
Write some code like this:
rust
let mut lru_cache = LinkedHashMap::new();
let key = "key".to_owned();
let _cached_val = lru_cache
.raw_entry_mut()
.from_key(&key)
.or_insert_with(|| (key.clone(), 42));
It is a fork of the popular crate hashlink, but more adjustments and improvements have been made to the code .
This library is licensed the same as hashlink, it is licensed under either of:
at your option.