ordered-containers

Set- and Map-like types that remember the order elements were inserted

Version on this page:0.2.2
LTS Haskell 22.37:0.2.4
Stackage Nightly 2024-10-10:0.2.4
Latest on Hackage:0.2.4

See all snapshots ordered-containers appears in

BSD-3-Clause licensed by Daniel Wagner
Maintained by [email protected]
This version can be pinned in stack with:ordered-containers-0.2.2@sha256:ebf2be3f592d9cf148ea6b8375f8af97148d44f82d8d04476899285e965afdbf,810

Module documentation for 0.2.2

Depends on 2 packages(full list with versions):
base, containers
Used by 2 packages in lts-18.6(full list with versions):
clash-lib, th-desugar

Changes

Revision history for ordered-containers

0.2.2 – 2019-07-05

  • Add toMap and toSet, which support efficient conversions from OMaps/OSets to Maps/Sets, respectively.

0.2.1 – 2019-03-25

  • Compatibility fixes from Ryan Scott (thanks!)

0.2 – 2019-03-24

  • Support many more operations:
    • Semigroup,Monoid,Data,Typeable for OSet
    • Semigroup,Monoid,Functor,Traversable,Data,Typeable for OMap
    • union and intersection primitives for both
  • Document asymptotics (when they vary from Set and Map)

0.1.1 – 2018-10-31

  • Metadata changes only

0.1.0 – 2016-12-26

  • Documentation fix
  • Live up to the package version boundary claims
  • Use enough version parts to conform to the PVP

0.0 – 2016-12-23

  • First version released on an unsuspecting world