insert-ordered-containers

Associative containers retaining insertion order for traversals. https://github.com/phadej/insert-ordered-containers#readme

Version on this page:0.2.2@rev:1
LTS Haskell 14.16:0.2.2@rev:1
Stackage Nightly 2019-12-08:0.2.3
Latest on Hackage:0.2.3

See all snapshots insert-ordered-containers appears in

BSD-3-Clause licensed and maintained by Oleg Grenrus

Module documentation for 0.2.2

This version can be pinned in stack with:insert-ordered-containers-0.2.2@sha256:987a0bd7fa85016d03ee3883d9c4878b5d18e796c8f1a19b619f4a6b11b391c2,2273

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

  • 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
comments powered byDisqus