insert-ordered-containers

Associative containers retaining insertion order for traversals.

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

Version on this page:0.2.5.1@rev:1
LTS Haskell 19.13:0.2.5.1@rev:2
Stackage Nightly 2022-06-30:0.2.5.1@rev:2
Latest on Hackage:0.2.5.1@rev:2

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.5.1@sha256:d57dfac7ae050b222bb621963f7a4c8da25af14d6ddaefd63865890c90a81aef,2501

Module documentation for 0.2.5.1

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

  • 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