hierarchy 0.3.1.1 → 0.3.1.2
raw patch · 2 files changed
+7/−7 lines, 2 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Control.Cond: instance (GHC.Base.Monad m, GHC.Base.Functor m) => GHC.Base.Alternative (Control.Cond.CondT a m)
- Control.Cond: instance (GHC.Base.Monad m, GHC.Base.Functor m) => GHC.Base.Applicative (Control.Cond.CondT a m)
+ Control.Cond: instance GHC.Base.Monad m => GHC.Base.Alternative (Control.Cond.CondT a m)
+ Control.Cond: instance GHC.Base.Monad m => GHC.Base.Applicative (Control.Cond.CondT a m)
Files
- Control/Cond.hs +6/−6
- hierarchy.cabal +1/−1
Control/Cond.hs view
@@ -161,7 +161,7 @@ mappend = liftM2 mappend {-# INLINE mappend #-} -instance (Monad m, Functor m) => Applicative (CondT a m) where+instance Monad m => Applicative (CondT a m) where pure = return {-# INLINE pure #-} (<*>) = ap@@ -182,10 +182,10 @@ (v, Continue) -> return (v, Recurse (n >>= k)) x -> return x {-# INLINEABLE (>>=) #-}-#if __GLASGOW_HASKELL__ >= 710- {-# SPECIALIZE (>>=)- :: CondT e IO a -> (a -> CondT e IO b) -> CondT e IO b #-}-#endif+-- #if __GLASGOW_HASKELL__ >= 710+-- {-# SPECIALIZE (>>=)+-- :: CondT e IO a -> (a -> CondT e IO b) -> CondT e IO b #-}+-- #endif instance MonadReader r m => MonadReader r (CondT a m) where ask = lift R.ask@@ -213,7 +213,7 @@ state = lift . S.state {-# INLINE state #-} -instance (Monad m, Functor m) => Alternative (CondT a m) where+instance Monad m => Alternative (CondT a m) where empty = CondT $ return recurse' {-# INLINE empty #-} CondT f <|> CondT g = CondT $ do
hierarchy.cabal view
@@ -1,5 +1,5 @@ name: hierarchy-version: 0.3.1.1+version: 0.3.1.2 synopsis: Pipes-based library for predicated traversal of generated trees description: Pipes-based library for predicated traversal of generated trees homepage: https://github.com/jwiegley/hierarchy