Cabal revisions of equivalence-0.3.5

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

 Name:            equivalence Version:         0.3.5+x-revision: 1 License:         BSD3 License-File:    LICENSE Author:          Patrick Bahr Homepage:        https://github.com/pa-ba/equivalence bug-reports:     https://github.com/pa-ba/equivalence/issues/new Synopsis:        Maintaining an equivalence relation implemented as union-find using STT.-Description:	 +Description:   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. -  +  relation.+   This implementation is a port of the /union-find/ package using the   ST monad transformer (instead of the IO monad). Category:        Algorithms, Data   Main-is:		Data_Test.hs   Other-Modules:	Data.Equivalence.Monad_Test,Data.Equivalence.Monad, Data.Equivalence.STT   hs-source-dirs:	src testsuite/tests-  Build-Depends:        base >= 4, template-haskell, containers, mtl >= 2.0.1, QuickCheck >= 2,+  Build-Depends:        base >= 4, template-haskell, containers, mtl >= 2.2.1 && < 2.3, QuickCheck >= 2,                         STMonadTrans >= 0.4.3, transformers >= 0.2, transformers-compat >= 0.3, fail  Library   Build-Depends:-    base >= 4 && < 5, containers, mtl >= 2.0.1, STMonadTrans >= 0.4.3,-    transformers >= 0.2, transformers-compat >= 0.3+    base >= 4 && < 5, containers, mtl >= 2.2.1 && < 2.3, STMonadTrans >= 0.4.3,+    transformers >= 0.2 && < 0.6, transformers-compat >= 0.3   Exposed-Modules:     Data.Equivalence.STT,     Data.Equivalence.Monad