union-find-array 0.1.0.4 → 0.1.0.5
raw patch · 4 files changed
+7/−14 lines, 4 filesdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base
API changes (from Hackage documentation)
- Control.Monad.Union: class Monad m => MonadUnion l m | m -> l
+ Control.Monad.Union: class Monad m => MonadUnion l (m :: Type -> Type) | m -> l
- Control.Monad.Union.Class: class Monad m => MonadUnion l m | m -> l
+ Control.Monad.Union.Class: class Monad m => MonadUnion l (m :: Type -> Type) | m -> l
- Data.Union.ST: runUnionST :: (forall s. ST s (UnionST s l)) -> Union l
+ Data.Union.ST: runUnionST :: (forall s. () => ST s (UnionST s l)) -> Union l
Files
- LICENSE +1/−1
- src/Control/Monad/Union.hs +1/−2
- src/Data/Union/ST.hs +1/−7
- union-find-array.cabal +4/−4
LICENSE view
@@ -1,6 +1,6 @@ union-find-array -- Union Find Data Structure -Copyright (c) 2010-2013, Bertram Felgenhauer+Copyright (c) 2010-2014, 2021, 2024, 2026, Bertram Felgenhauer Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal
src/Control/Monad/Union.hs view
@@ -40,14 +40,13 @@ } instance Monad (UnionM l) where- return x = U (return x) f >>= b = U (runU f >>= \v -> runU (b v)) instance Functor (UnionM l) where fmap = liftM instance Applicative (UnionM l) where- pure = return+ pure x = U (return x) (<*>) = ap instance MonadFix (UnionM l) where
src/Data/Union/ST.hs view
@@ -3,7 +3,7 @@ -- -- Authors: Bertram Felgenhauer -{-# LANGUAGE RankNTypes, FlexibleContexts, CPP #-}+{-# LANGUAGE RankNTypes, FlexibleContexts #-} -- | -- Low-level interface for managing a disjoint set data structure, based on -- 'Control.Monad.ST'. For a higher level convenience interface, look at@@ -40,12 +40,6 @@ size :: !Int, def :: l }--#if __GLASGOW_HASKELL__ < 702-instance Applicative (ST s) where- (<*>) = ap- pure = return-#endif -- Use http://www.haskell.org/pipermail/libraries/2008-March/009465.html ?
union-find-array.cabal view
@@ -1,9 +1,9 @@ name: union-find-array-version: 0.1.0.4+version: 0.1.0.5 stability: experimental author: Bertram Felgenhauer maintainer: Bertram Felgenhauer <int-e@gmx.de>-copyright: Copyright (c) 2010-2014, 2021, 2024, Bertram Felgenhauer+copyright: Copyright (c) 2010-2014, 2021, 2024, 2026, Bertram Felgenhauer license: MIT license-file: LICENSE category: Algorithms, Data@@ -19,7 +19,7 @@ source-repository head type: git- location: git://github.com/haskell-rewriting/union-find-array+ location: https://github.com/haskell-rewriting/union-find-array library hs-source-dirs:@@ -33,7 +33,7 @@ build-depends: array >= 0.3 && < 0.6, mtl >= 1.1 && < 2.4,- base >= 4 && < 5+ base >= 4.8 && < 5 default-language: Haskell2010 other-extensions: GeneralizedNewtypeDeriving