具有一致顺序和快速迭代的哈希表;通过键或序列索引访问项
A pure-Rust hash table which preserves (in a limited sense) insertion order.
This crate implements compact map and set data-structures, where the iteration order of the keys is independent from their hash or value. It preserves insertion order (except after removals), and it allows lookup of entries by either hash table key or numerical index.
Note: this crate was originally released under the name ordermap,
but it was renamed to indexmap to better reflect its features.
The ordermap crate now exists
as a wrapper over indexmap with stronger ordering properties.
This was inspired by Python 3.6's new dict implementation (which remembers the insertion order and is fast to iterate, and is compact in memory).
Some of those features were translated to Rust, and some were not. The result was indexmap, a hash table that has following properties:
.remove(),
.swap_remove(), or other methods that explicitly change order.
The alternate .shift_remove() does preserve relative order.HashMap does.IndexMap derives a couple of performance facts directly from how it is constructed,
which is roughly:
A raw hash table of key-value indices, and a vector of key-value pairs.
Iteration is very fast since it is on the dense key-values.
Removal is fast since it moves memory areas only in the table, and uses a single swap in the vector.
Lookup is fast-ish because the initial 7-bit hash lookup uses SIMD, and indices are densely stored. Lookup also is slow-ish since the actual key-value pairs are stored separately. (Visible when cpu caches size is limiting.)
In practice, IndexMap has been tested out as the hashmap in rustc in PR45282 and
the performance was roughly on par across the whole workload.
If you want the properties of IndexMap, or its strongest performance points
fits your workload, it might be the best hash table implementation.
See RELEASES.md.
暂无开放 Issues，或尚未同步最近议题。