sets

Various set implementations in Haskell.

Version on this page:	0.0.5@rev:1
LTS Haskell 21.25:	0.0.6.2@rev:1
Stackage Nightly 2023-06-21:	0.0.6.2@rev:1
Latest on Hackage:	0.0.6.2@rev:2

See all snapshots sets appears in

MIT licensed and maintained by Athan Clark

This version can be pinned in stack with:sets-0.0.5@sha256:6a3f99b425c6a4ed373e1f1d2836a40b09e462f4e2744b76227f27a133acb34e,4612

Module documentation for 0.0.5

Data
- Data.Set
  - Data.Set.Class
  - Data.Set.Ordered
    - Data.Set.Ordered.Many
      - Data.Set.Ordered.Many.With
    - Data.Set.Ordered.Unique
      - Data.Set.Ordered.Unique.Finite
      - Data.Set.Ordered.Unique.With
  - Data.Set.Unordered
    - Data.Set.Unordered.Many
    - Data.Set.Unordered.Unique

Depends on 16 packages(full list with versions):

base, commutative, composition, containers, contravariant, hashable, invariant, keys, mtl, QuickCheck, semigroupoids, semigroups, transformers, transformers-base, unordered-containers, witherable

Used by 2 packages in lts-7.0(full list with versions):

rose-trees, tries

This also includes overloaded functions for common set operations. See Data.Set.Class.