indexmap-amortized
A 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.
- Latest release
- Dec 21, 2020
- Releases
- 3
- Known CVEs
- 0
- First release
- Jul 27, 2020
- License
- unknown
Repository
Source
- Stars
- —
- Forks
- —
- Open issues
- —
Security score
No OpenSSF Scorecard available for this repository.
Packages from this repo
No other tracked packages from this repository.
Insights
Activity
- Total releases
- 3
- Last 12 months
- 0
- Cadence
- ~2 months
- Dependencies
- 12
Releases per month
last 12 monthsRelease mix
- minor 1
- patch 1
3
releases
Dependencies
Depends on
1.6.1-
atone
^0.3.4
-
autocfg
^1
build
-
fnv
^1.0
dev
-
fxhash
^0.2.1
dev
-
griddle
^0.4.0
-
itertools
^0.9
dev
-
lazy_static
^1.3
dev
-
quickcheck
^0.9
dev
-
rand
^0.7
dev
-
rayon
^1.0
1–10 of 12
Used by
Nothing tracked depends on this yet.
Releases
| Version | Released | |
|---|---|---|
1.6.1
minor
| ||
1.0.1
patch
| ||
1.0.0
initial
|