oxidecomputer / oxidecomputer/iddqd
Keep insertion-order?
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 405
- Forks
- 15
- Avg merge
- 14m
- Merged PRs (30d)
- 25
Description
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.
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reviewing iddqd's existing hash-map and B-tree-map approaches, then compare the requirements with the linked indexmap project. Determine whether preserving insertion order fits the library's performance and design constraints; done would be a decided implementation direction rather than only a plan question.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100