indexmap-amortized 1.6.1

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.
Documentation

indexmap-amortized

There is very little structured metadata to build this page from currently. You should check the main library docs, readme, or Cargo.toml in case the author documented the features in them.

This version has 7 feature flags, 0 of them enabled by default.

rayon

  • rayon_
  • atone/rayon

serde-1

  • serde

std

    This feature flag does not enable additional features.

test_low_transition_point

    This feature flag does not enable additional features.

test_debug

    This feature flag does not enable additional features.

serde

    This feature flag does not enable additional features.

rayon_

    This feature flag does not enable additional features.