Skip to content

Keep insertion-order? #33

@killercup

Description

@killercup

Hi, I considered using iddqd where I use indexmap now (cause the map key is already a field on the value). However, it seems iddqd provides either hash maps or B-tree maps, which are sorted by hash order or Ord impl.

Are there any plans to provide a map that preserves insertion order? If the performance of indexmap is acceptable, maybe its implementation could be adapted.

Metadata

Metadata

Assignees

No one assigned

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions