packages feed

chatty-utils 0.7.3.5 → 0.7.3.6

raw patch · 12 files changed

+21/−25 lines, 12 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.Chatty.None: instance Data.Chatty.None.None GHC.Integer.Type.Integer
+ Data.Chatty.None: instance Data.Chatty.None.None GHC.Num.Integer.Integer
- Data.Chatty.Atoms: AtomStore :: (AVL (Int, Container) -> m (a, AVL (Int, Container))) -> AtomStoreT m a
+ Data.Chatty.Atoms: AtomStore :: (AVL (Int, Container) -> m (a, AVL (Int, Container))) -> AtomStoreT (m :: Type -> Type) a
- Data.Chatty.Atoms: Redundant :: (Atom a -> m (Atom b)) -> Redundant m a b
+ Data.Chatty.Atoms: Redundant :: (Atom a -> m (Atom b)) -> Redundant (m :: Type -> Type) a b
- Data.Chatty.Atoms: [runAtomStoreT] :: AtomStoreT m a -> AVL (Int, Container) -> m (a, AVL (Int, Container))
+ Data.Chatty.Atoms: [runAtomStoreT] :: AtomStoreT (m :: Type -> Type) a -> AVL (Int, Container) -> m (a, AVL (Int, Container))
- Data.Chatty.Atoms: [runRedundant] :: Redundant m a b -> Atom a -> m (Atom b)
+ Data.Chatty.Atoms: [runRedundant] :: Redundant (m :: Type -> Type) a b -> Atom a -> m (Atom b)
- Data.Chatty.Atoms: class ChCounter m => ChAtoms m
+ Data.Chatty.Atoms: class ChCounter m => ChAtoms (m :: Type -> Type)
- Data.Chatty.Atoms: newtype AtomStoreT m a
+ Data.Chatty.Atoms: newtype AtomStoreT (m :: Type -> Type) a
- Data.Chatty.Atoms: newtype Redundant m a b
+ Data.Chatty.Atoms: newtype Redundant (m :: Type -> Type) a b
- Data.Chatty.BST: class Indexable i o v => AnyBST t i o v
+ Data.Chatty.BST: class Indexable i o v => AnyBST (t :: Type -> Type) i o v
- Data.Chatty.Counter: Counter :: (Int -> m (a, Int)) -> CounterT m a
+ Data.Chatty.Counter: Counter :: (Int -> m (a, Int)) -> CounterT (m :: Type -> Type) a
- Data.Chatty.Counter: [runCounterT] :: CounterT m a -> Int -> m (a, Int)
+ Data.Chatty.Counter: [runCounterT] :: CounterT (m :: Type -> Type) a -> Int -> m (a, Int)
- Data.Chatty.Counter: class Monad m => ChCounter m
+ Data.Chatty.Counter: class Monad m => ChCounter (m :: Type -> Type)
- Data.Chatty.Counter: newtype CounterT m a
+ Data.Chatty.Counter: newtype CounterT (m :: Type -> Type) a
- Data.Chatty.Fail: Fail :: m (Either e a) -> FailT e m a
+ Data.Chatty.Fail: Fail :: m (Either e a) -> FailT e (m :: Type -> Type) a
- Data.Chatty.Fail: [runFailT] :: FailT e m a -> m (Either e a)
+ Data.Chatty.Fail: [runFailT] :: FailT e (m :: Type -> Type) a -> m (Either e a)
- Data.Chatty.Fail: newtype FailT e m a
+ Data.Chatty.Fail: newtype FailT e (m :: Type -> Type) a
- Data.Chatty.ListBuilder: LazyBuilder :: (([i] -> [i]) -> m (a, [i] -> [i])) -> LazyBuilderT i m a
+ Data.Chatty.ListBuilder: LazyBuilder :: (([i] -> [i]) -> m (a, [i] -> [i])) -> LazyBuilderT i (m :: Type -> Type) a
- Data.Chatty.ListBuilder: StrictBuilder :: ([i] -> m (a, [i])) -> StrictBuilderT i m a
+ Data.Chatty.ListBuilder: StrictBuilder :: ([i] -> m (a, [i])) -> StrictBuilderT i (m :: Type -> Type) a
- Data.Chatty.ListBuilder: [runLazyBuilderT] :: LazyBuilderT i m a -> ([i] -> [i]) -> m (a, [i] -> [i])
+ Data.Chatty.ListBuilder: [runLazyBuilderT] :: LazyBuilderT i (m :: Type -> Type) a -> ([i] -> [i]) -> m (a, [i] -> [i])
- Data.Chatty.ListBuilder: [runStrictBuilderT] :: StrictBuilderT i m a -> [i] -> m (a, [i])
+ Data.Chatty.ListBuilder: [runStrictBuilderT] :: StrictBuilderT i (m :: Type -> Type) a -> [i] -> m (a, [i])
- Data.Chatty.ListBuilder: class Monad l => ListBuilder l i | l -> i
+ Data.Chatty.ListBuilder: class Monad l => ListBuilder (l :: Type -> Type) i | l -> i
- Data.Chatty.ListBuilder: newtype LazyBuilderT i m a
+ Data.Chatty.ListBuilder: newtype LazyBuilderT i (m :: Type -> Type) a
- Data.Chatty.ListBuilder: newtype StrictBuilderT i m a
+ Data.Chatty.ListBuilder: newtype StrictBuilderT i (m :: Type -> Type) a

Files

Data/Chatty/AVL.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/Atoms.hs view
@@ -1,7 +1,7 @@ {-# LANGUAGE ExistentialQuantification, ScopedTypeVariables, Trustworthy #-} {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014, 2026 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.@@ -66,11 +66,10 @@   fmap f a = AtomStore $ \s -> fmap (first f) $ runAtomStoreT a s  instance (Functor m, Monad m) => Applicative (AtomStoreT m) where-  pure = return+  pure a = AtomStore $ \s -> return (a,s)   (<*>) = ap  instance Monad m => Monad (AtomStoreT m) where-  return a = AtomStore $ \s -> return (a,s)   m >>= f = AtomStore $ \s -> do (a,s') <- runAtomStoreT m s; runAtomStoreT (f a) s'  instance MonadTrans AtomStoreT where
Data/Chatty/BST.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/Counter.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014, 2026 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.@@ -36,11 +36,10 @@   fmap f a = Counter $ \s -> fmap (first f) $ runCounterT a s  instance (Functor m,Monad m) => Applicative (CounterT m) where-  pure = return+  pure a = Counter $ \s -> return (a,s)   (<*>) = ap  instance Monad m => Monad (CounterT m) where-  return a = Counter $ \s -> return (a,s)   m >>= f = Counter $ \s -> do (a,s') <- runCounterT m s; runCounterT (f a) s'  instance MonadTrans CounterT where
Data/Chatty/Fail.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014, 2026 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.@@ -42,11 +42,10 @@        Right x -> return $ Right (f x)  instance Monad m => Applicative (FailT e m) where-  pure = return+  pure a = Fail $ return $ Right a   (<*>) = ap  instance Monad m => Monad (FailT e m) where-  return a = Fail $ return $ Right a   m >>= f = Fail $ do     v <- runFailT m     case v of
Data/Chatty/Focus.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/Graph.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/Hetero.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/ListBuilder.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014, 2026 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.@@ -25,6 +25,7 @@  import Control.Applicative import Control.Arrow+import Control.Monad import Control.Monad.Trans.Class import Control.Monad.Identity @@ -40,10 +41,9 @@  instance (Functor m, Monad m) => Applicative (StrictBuilderT i m) where   (<*>) = ap-  pure = return+  pure a = StrictBuilder $ \s -> return (a,s)  instance Monad m => Monad (StrictBuilderT i m) where-  return a = StrictBuilder $ \s -> return (a,s)   m >>= f = StrictBuilder $ \s -> do (a,s') <- runStrictBuilderT m s; runStrictBuilderT (f a) s'  instance MonadTrans (StrictBuilderT i) where@@ -63,11 +63,10 @@   fmap f a = LazyBuilder $ \s -> fmap (first f) $ runLazyBuilderT a s  instance (Functor m,Monad m) => Applicative (LazyBuilderT i m) where-  pure = return+  pure a = LazyBuilder $ \s -> return (a,s)   (<*>) = ap  instance Monad m => Monad (LazyBuilderT i m) where-  return a = LazyBuilder $ \s -> return (a,s)   m >>= f = LazyBuilder $ \s -> do (a,s') <- runLazyBuilderT m s; runLazyBuilderT (f a) s'  instance MonadTrans (LazyBuilderT i) where@@ -75,7 +74,7 @@  instance ListBuilder (LazyBuilder i) i where   li a = LazyBuilder $ \s -> return ((),s.([a]++))-  buildList m = ($[]) $ snd $ runIdentity $ runLazyBuilderT m ([]++)+  buildList m = ($ []) $ snd $ runIdentity $ runLazyBuilderT m ([]++)  lazyBuild :: LazyBuilderT i Identity () -> [i] lazyBuild = buildList
Data/Chatty/None.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
Data/Chatty/TST.hs view
@@ -2,7 +2,7 @@  {-   This module is part of Chatty.-  Copyleft (c) 2014 Marvin Cohrs+  Copyleft (c) 2014, 2026 Enum Cohrs    All wrongs reversed. Sharing is an act of love, not crime.   Please share Chatty with everyone you like.
chatty-utils.cabal view
@@ -10,13 +10,13 @@ -- PVP summary:      +-+------- breaking API changes --                   | | +----- non-breaking API additions --                   | | | +--- code changes with no API change-version:             0.7.3.5+version:             0.7.3.6  -- A short (one-line) description of the package.-synopsis:            Some utilities every serious chatty-based application may need.+synopsis:            Some utilities any serious chatty-based application may need.  -- A longer description of the package.-description:         Some utilities every serious chatty-based application may need. Includes a graph type, search trees, a None class, a counter and an atom store. Note that the author does not recommend usage in new projects any more. Please use packages that are better suited for your individual need.+description:         Some utilities any serious chatty-based application may need. Includes a graph type, search trees, a None class, a counter and an atom store.  -- The license under which the package is released. license:             AGPL-3