equivalence

Maintaining an equivalence relation implemented as union-find using STT. https://github.com/pa-ba/equivalence

Version on this page:	0.3.2
LTS Haskell 9.5:	0.3.2
Stackage Nightly 2017-09-20:	0.3.2
Latest on Hackage:	0.3.2

BSD3 licensed by Patrick Bahr

Maintained by paba@di.ku.dk

Module documentation for 0.3.2

Data
- Data.Equivalence
  - Data.Equivalence.Monad
  - Data.Equivalence.STT

This is an implementation of Tarjan's Union-Find algorithm (Robert E. Tarjan. "Efficiency of a Good But Not Linear Set Union Algorithm", JACM 22(2), 1975) in order to maintain an equivalence relation. This implementation is a port of the union-find package using the ST monad transformer (instead of the IO monad).

Changes

0.3.2
-----
* add Applicative constraints for backwards compatibility with GHC 7.8

0.3.1
-----
* use transformers-compat for backwards compatibility with older versions of transformers

0.3.0.1
-------
* add CHANGES.txt to .cabal file

0.3
---
* add suport for Control.Monad.Except (thus the new dependency constraint 'mtl >= 2.2.1')

Depends on:

base, containers, mtl, STMonadTrans, transformers, transformers-compat

Used by 1 package:

Agda