indexmap-amortized
v1.6.1 GrowingA 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.
Quick Verdict
- ✕Not updated for 5+ years
- ✓Stable API (1.x for 5+ years)
- ✓Permissive license (Apache-2.0/MIT)
Security
Deep Insights
166 downloads in the last 30 days (6/day), up 13% from the previous period.
The primary maintainer publishes 92 crates. This suggests deep Rust expertise and long-term commitment to the ecosystem.
The API has been stable (1.x) for over 5 years with 3 releases. This level of maturity means you can depend on it without worrying about breaking changes.
At 46KB, indexmap-amortized is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Recency, release consistency, active ratio
Yanked ratio, deps, size, maturity, features
Reverse deps, ownership, ecosystem
Downloads, momentum, growth trend
Docs, repo, license, metadata
Download Trend
Top Dependents
Most downloaded crates that depend on indexmap-amortized
