insert-ordered-containers

Associative containers retaining insertion order for traversals.

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

Version on this page:0.2.3
LTS Haskell 22.14:0.2.5.3@rev:1
Stackage Nightly 2024-03-28: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.3@sha256:5401f5f337782f43f3d16a833b49767287eaa72e13af8ba5b6d2b021c19062c8,2292

Module documentation for 0.2.3

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

  • 0.2.3

    • Add support for indexed optics
    • Only support GHC-8.0+
  • 0.2.2

    • Add Data.HashSet.InsOrd
  • 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