This version can be pinned in stack with:insert-ordered-containers-0.2.7@sha256:4b96e57417b85b56ce6ca68eb9bc4bcb9e50d44af1c660e00cb861793abdc5fe,2413
Module documentation for 0.2.7
- Data
- Data.HashMap
- Data.HashSet
Depends on 12 packages
(full list with versions):
aeson,
base,
deepseq,
hashable,
indexed-traversable,
lens,
optics-core,
optics-extra,
semigroupoids,
text,
transformers,
unordered-containers insert-ordered-containers
Associative containers retaining insertion order for traversals.
-
0.2.6
- Support GHC-8.6.5…9.12.1
- Haskell code modernisation
-
0.2.6
-
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
-
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
