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.3
LTS Haskell 22.21:	0.2.5.3@rev:1
Stackage Nightly 2024-05-06:	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.5.3@sha256:40b1454477141796d9647904c09d1a03ca792e6111161d854c2e806156c4cf37,2384

Module documentation for 0.2.5.3

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

Depends on 12 packages(full list with versions):

aeson, base, deepseq, hashable, indexed-traversable, lens, optics-core, optics-extra, semigroupoids, text, transformers, unordered-containers

Used by 6 packages in nightly-2023-09-18(full list with versions):

autodocodec-openapi3, openapi3, servant-openapi3, servant-swagger, swagger2, webgear-openapi

insert-ordered-containers

Associative containers retaining insertion order for traversals.

Changes

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