indexmap-amortized
v1.6.1crates.io· RustA hash table with consistent order and fast iteration. The indexmap is a hash table where the iteration order of the key-value pairs is independent of the hash values of the keys. It has the usual hash table functionality, it preserves insertion order except after removals, and it allows lookup of its elements by either hash table key or numerical index. A corresponding hash set type is also provided. This crate is an ongoing fork of bluss/indexmap that provides amortized resizes.
The verdict
Abandoned. Last published 5 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the crates.io registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published 5 years ago.
Popularity
40 downloads / week
Security
No known advisories for this version (OSV).
License
Apache-2.0 OR MIT
Dependencies
No runtime dependencies
Recent releases
- 1.6.15 years ago
- 1.0.15 years ago
- 1.0.05 years ago