insert-ordered-containers

Associative containers retaining insertion order for traversals.

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

LTS Haskell 24.32:0.2.7@rev:1
Stackage Nightly 2026-03-04:0.3.0
Latest on Hackage:0.3.0

See all snapshots insert-ordered-containers appears in

BSD-3-Clause licensed by Oleg Grenrus
Maintained by Erik de Castro Lopo, Oleg Grenrus
This version can be pinned in stack with:insert-ordered-containers-0.3.0@sha256:6b8b8042d9f0a45309589f2d495596229ac4e65bcc216f63399757c4df87b1e4,2346

Module documentation for 0.3.0

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

  • 0.3.0

  • 0.2.7

    • Support GHC-8.6.5…9.12.1
    • Haskell code modernisation

  • 0.2.6

    • Support GHC-8.6.5…9.10.1

  • 0.2.5.3

    • Support aeson-2.2
    • Make Prelude import explicit (safe guard against additions to Prelude).

  • 0.2.5.2

    • Actually drop semigroups dependency
    • Update bounds

  • 0.2.5.1

    • Drop unnecessary dependencies semigroups, base-compat
    • Update bounds

  • 0.2.5

    • Add NFData(/1/2) instances

  • 0.2.4

    • Add indexed-traversable instances
    • lens-5 and optics-0.4 support

  • 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