|0.3.2||Aug 24, 2021|
|0.3.1||May 27, 2021|
|0.2.2||Mar 6, 2021|
|0.1.0||Mar 3, 2021|
#251 in Data structures
24,540 downloads per month
Used in 29 crates (8 directly)
RiteLinked -- HashMap-like containers that hold their key-value pairs in a user controllable order
RiteLinked provides more up to date versions of
You can easily use it on
Support some practical feature combinations to help you better embed them in existing code:
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)
ritelinked = "x.y.z"
Write some code like this:
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));
ritelinked time: [165.09 ns 165.40 ns 165.79 ns] Found 12 outliers among 100 measurements (12.00%) 5 (5.00%) high mild 7 (7.00%) high severe hashlink time: [168.11 ns 168.48 ns 168.96 ns] Found 13 outliers among 100 measurements (13.00%) 2 (2.00%) high mild 11 (11.00%) high severe linked-hash-map time: [370.98 ns 382.59 ns 397.44 ns] Found 7 outliers among 100 measurements (7.00%) 7 (7.00%) high mild
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:
- MIT license LICENSE-MIT or http://opensource.org/licenses/MIT
- Apache License 2.0 LICENSE-APACHE or https://opensource.org/licenses/Apache-2.0
at your option.