Lines Matching +full:to +full:- +full:fast +full:- +full:properties
6 [](https://img.shields.io/badge/rust-…
8 A pure-Rust hash table which preserves (in a limited sense) insertion order.
10 This crate implements compact map and set data-structures,
16 but it was renamed to `indexmap` to better reflect its features.
21 the insertion order and is fast to iterate, and is compact in memory).
23 Some of those features were translated to Rust, and some were not. The result
24 was indexmap, a hash table that has following properties:
26 - Order is **independent of hash function** and hash values of keys.
27 - Fast to iterate.
28 - Indexed in compact space.
29 - Preserves insertion order **as long** as you don't call `.remove()`.
30 - Uses hashbrown for the inner table, just like Rust's libstd `HashMap` does.
37 > A raw hash table of key-value indices, and a vector of key-value pairs.
39 - Iteration is very fast since it is on the dense key-values.
40 - Removal is fast since it moves memory areas only in the table,
42 - Lookup is fast-ish because the initial 7-bit hash lookup uses SIMD, and indices are
43 densely stored. Lookup also is slow-ish since the actual key-value pairs are stored
46 - In practice, `IndexMap` has been tested out as the hashmap in rustc in [PR45282] and
48 - If you want the properties of `IndexMap`, or its strongest performance points
51 [PR45282]: https://github.com/rust-lang/rust/pull/45282