name: union-find-array version: 0.1.0.4 stability: experimental author: Bertram Felgenhauer maintainer: Bertram Felgenhauer copyright: Copyright (c) 2010-2014, 2021, 2024, Bertram Felgenhauer license: MIT license-file: LICENSE category: Algorithms, Data synopsis: union find data structure description: ST based implementation of Tarjan\'s disjoint set forests, using mutable arrays storing indices instead of references internally. There is also a pure, immutable version of the data structure, which is useful for querying the result of a union find construction. homepage: https://github.com/haskell-rewriting/union-find-array build-type: Simple cabal-version: >= 1.10 source-repository head type: git location: git://github.com/haskell-rewriting/union-find-array library hs-source-dirs: src exposed-modules: Data.Union Data.Union.ST Data.Union.Type Control.Monad.Union.Class Control.Monad.Union build-depends: array >= 0.3 && < 0.6, mtl >= 1.1 && < 2.4, base >= 4 && < 5 default-language: Haskell2010 other-extensions: GeneralizedNewtypeDeriving RankNTypes MultiParamTypeClasses FunctionalDependencies FlexibleInstances UndecidableInstances