insert-ordered-containers

Associative containers retaining insertion order for traversals.

https://github.com/phadej/insert-ordered-containers#readme

Version on this page:	0.2.1.0@rev:5
LTS Haskell 22.17:	0.2.5.3@rev:1
Stackage Nightly 2024-04-19:	0.2.5.3@rev:1
Latest on Hackage:	0.2.5.3@rev:1

See all snapshots insert-ordered-containers appears in

BSD-3-Clause licensed and maintained by Oleg Grenrus

This version can be pinned in stack with:insert-ordered-containers-0.2.1.0@sha256:ece46b4c41b2c2d619a20b5e9ff878fa56e12b2eca89e8109bd3f76e9b1ca88e,2073

Module documentation for 0.2.1.0

Data
- Data.HashMap
  - Data.HashMap.Strict
    - Data.HashMap.Strict.InsOrd

Depends on 10 packages(full list with versions):

aeson, base, base-compat, hashable, lens, semigroupoids, semigroups, text, transformers, unordered-containers

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

0.2.1.0
- Fix Traversable, TraversableWithIndex, FoldableWithIndex to traverse in insertion order (#12)
- Add unorderedTraverse, unorderedTraverseWithKey, unoderedFoldMap, and unorderedFoldMapWithKey.
- union doesn’t overflow the internal counter (#10)
0.2.0.0
- Use aeson-1
- removed our FromJSONKey and ToJSONKey in favour of aeson variants