concurrent-machines 0.3.1.3 → 0.3.1.4
raw patch · 1 files changed
+5/−5 lines, 1 filesdep ~containersdep ~machinesdep ~semigroupsPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: containers, machines, semigroups
API changes (from Hackage documentation)
+ Data.Machine.Concurrent: (<~) :: forall (m :: Type -> Type) b c (k :: Type -> Type). Monad m => ProcessT m b c -> MachineT m k b -> MachineT m k c
+ Data.Machine.Concurrent: (~>) :: forall (m :: Type -> Type) (k :: Type -> Type) b c. Monad m => MachineT m k b -> ProcessT m b c -> MachineT m k c
+ Data.Machine.Concurrent: Await :: (t -> r) -> k t -> r -> Step (k :: Type -> Type) o r
+ Data.Machine.Concurrent: MachineT :: m (Step k o (MachineT m k o)) -> MachineT (m :: Type -> Type) (k :: Type -> Type) o
+ Data.Machine.Concurrent: Mealy :: (a -> (b, Mealy a b)) -> Mealy a b
+ Data.Machine.Concurrent: Moore :: b -> (a -> Moore a b) -> Moore a b
+ Data.Machine.Concurrent: PlanT :: (forall r. () => (a -> m r) -> (o -> m r -> m r) -> (forall z. () => (z -> m r) -> k z -> m r -> m r) -> m r -> m r) -> PlanT (k :: Type -> Type) o (m :: Type -> Type) a
+ Data.Machine.Concurrent: Stop :: Step (k :: Type -> Type) o r
+ Data.Machine.Concurrent: Yield :: o -> r -> Step (k :: Type -> Type) o r
+ Data.Machine.Concurrent: [L] :: forall a b. T a b a
+ Data.Machine.Concurrent: [R] :: forall a b. T a b b
+ Data.Machine.Concurrent: [Refl] :: forall a. Is a a
+ Data.Machine.Concurrent: [X] :: forall a b. Y a b a
+ Data.Machine.Concurrent: [Y] :: forall a b. Y a b b
+ Data.Machine.Concurrent: [Z] :: forall a b. Y a b (Either a b)
+ Data.Machine.Concurrent: [runMachineT] :: MachineT (m :: Type -> Type) (k :: Type -> Type) o -> m (Step k o (MachineT m k o))
+ Data.Machine.Concurrent: [runMealy] :: Mealy a b -> a -> (b, Mealy a b)
+ Data.Machine.Concurrent: [runPlanT] :: PlanT (k :: Type -> Type) o (m :: Type -> Type) a -> forall r. () => (a -> m r) -> (o -> m r -> m r) -> (forall z. () => (z -> m r) -> k z -> m r -> m r) -> m r -> m r
+ Data.Machine.Concurrent: addL :: forall (m :: Type -> Type) a b c d. Monad m => ProcessT m a b -> TeeT m b c d -> TeeT m a c d
+ Data.Machine.Concurrent: addR :: forall (m :: Type -> Type) b c a d. Monad m => ProcessT m b c -> TeeT m a c d -> TeeT m a b d
+ Data.Machine.Concurrent: addX :: forall (m :: Type -> Type) a b c d. Monad m => ProcessT m a b -> WyeT m b c d -> WyeT m a c d
+ Data.Machine.Concurrent: addY :: forall (m :: Type -> Type) b c a d. Monad m => ProcessT m b c -> WyeT m a c d -> WyeT m a b d
+ Data.Machine.Concurrent: applied :: forall (m :: Type -> Type) a b. (Appliance k, Monad m) => MachineT m k (a -> b) -> MachineT m k a -> MachineT m k b
+ Data.Machine.Concurrent: asParts :: forall (f :: Type -> Type) a. Foldable f => Process (f a) a
+ Data.Machine.Concurrent: auto :: Automaton k => k a b -> Process a b
+ Data.Machine.Concurrent: autoM :: forall (k :: Type -> Type -> Type) m a b. (Category k, Monad m) => (a -> m b) -> MachineT m (k a) b
+ Data.Machine.Concurrent: autoT :: forall (m :: Type -> Type) a b. (AutomatonM x, Monad m) => x m a b -> ProcessT m a b
+ Data.Machine.Concurrent: await :: forall (k :: Type -> Type -> Type) i o. Category k => Plan (k i) o i
+ Data.Machine.Concurrent: awaits :: k i -> Plan k o i
+ Data.Machine.Concurrent: before :: forall (m :: Type -> Type) (k :: Type -> Type) o a. Monad m => MachineT m k o -> PlanT k o m a -> MachineT m k o
+ Data.Machine.Concurrent: buffered :: Int -> Process a [a]
+ Data.Machine.Concurrent: cap :: Process a b -> Source a -> Source b
+ Data.Machine.Concurrent: capL :: forall (m :: Type -> Type) a b c. Monad m => SourceT m a -> TeeT m a b c -> ProcessT m b c
+ Data.Machine.Concurrent: capR :: forall (m :: Type -> Type) b a c. Monad m => SourceT m b -> TeeT m a b c -> ProcessT m a c
+ Data.Machine.Concurrent: capT :: forall (m :: Type -> Type) a b c. Monad m => SourceT m a -> SourceT m b -> TeeT m a b c -> SourceT m c
+ Data.Machine.Concurrent: capWye :: forall (m :: Type -> Type) a b c. Monad m => SourceT m a -> SourceT m b -> WyeT m a b c -> SourceT m c
+ Data.Machine.Concurrent: capX :: forall (m :: Type -> Type) a b c. Monad m => SourceT m a -> WyeT m a b c -> ProcessT m b c
+ Data.Machine.Concurrent: capY :: forall (m :: Type -> Type) b a c. Monad m => SourceT m b -> WyeT m a b c -> ProcessT m a c
+ Data.Machine.Concurrent: class Appliance (k :: Type -> Type)
+ Data.Machine.Concurrent: class Automaton (k :: Type -> Type -> Type)
+ Data.Machine.Concurrent: class AutomatonM (x :: Type -> Type -> Type -> Type -> Type)
+ Data.Machine.Concurrent: construct :: forall (m :: Type -> Type) (k :: Type -> Type) o a. Monad m => PlanT k o m a -> MachineT m k o
+ Data.Machine.Concurrent: cycled :: Foldable f => f b -> Source b
+ Data.Machine.Concurrent: data Is a b
+ Data.Machine.Concurrent: data Moore a b
+ Data.Machine.Concurrent: data Step (k :: Type -> Type) o r
+ Data.Machine.Concurrent: data T a b c
+ Data.Machine.Concurrent: data Y a b c
+ Data.Machine.Concurrent: deconstruct :: forall (m :: Type -> Type) (k :: Type -> Type) a o. Monad m => MachineT m k (Either a o) -> PlanT k o m a
+ Data.Machine.Concurrent: dropping :: Int -> Process a a
+ Data.Machine.Concurrent: droppingWhile :: (a -> Bool) -> Process a a
+ Data.Machine.Concurrent: echo :: Process a a
+ Data.Machine.Concurrent: encased :: forall (m :: Type -> Type) (k :: Type -> Type) o. Monad m => Step k o (MachineT m k o) -> MachineT m k o
+ Data.Machine.Concurrent: enumerateFromTo :: Enum a => a -> a -> Source a
+ Data.Machine.Concurrent: exhaust :: forall m a (k :: Type -> Type). Monad m => m (Maybe a) -> PlanT k a m ()
+ Data.Machine.Concurrent: filtered :: (a -> Bool) -> Process a a
+ Data.Machine.Concurrent: final :: forall (k :: Type -> Type -> Type) a. Category k => Machine (k a) a
+ Data.Machine.Concurrent: finalOr :: forall (k :: Type -> Type -> Type) a. Category k => a -> Machine (k a) a
+ Data.Machine.Concurrent: finishWith :: forall (m :: Type -> Type) o r (k :: Type -> Type). Monad m => (o -> Maybe r) -> MachineT m k o -> MachineT m k (Either r o)
+ Data.Machine.Concurrent: fit :: forall (m :: Type -> Type) k k' o. Monad m => (forall a. () => k a -> k' a) -> MachineT m k o -> MachineT m k' o
+ Data.Machine.Concurrent: fitM :: forall m m' (k :: Type -> Type) o. (Monad m, Monad m') => (forall a. () => m a -> m' a) -> MachineT m k o -> MachineT m' k o
+ Data.Machine.Concurrent: flattened :: forall (f :: Type -> Type) a. Foldable f => Process (f a) a
+ Data.Machine.Concurrent: fold :: forall (k :: Type -> Type -> Type) a b. Category k => (a -> b -> a) -> a -> Machine (k b) a
+ Data.Machine.Concurrent: fold1 :: forall (k :: Type -> Type -> Type) a. Category k => (a -> a -> a) -> Machine (k a) a
+ Data.Machine.Concurrent: infixl 9 ~>
+ Data.Machine.Concurrent: infixr 9 <~
+ Data.Machine.Concurrent: intersperse :: forall (k :: Type -> Type -> Type) a. Category k => a -> Machine (k a) a
+ Data.Machine.Concurrent: iterated :: (a -> a) -> a -> Source a
+ Data.Machine.Concurrent: largest :: forall (k :: Type -> Type -> Type) a. (Category k, Ord a) => Machine (k a) a
+ Data.Machine.Concurrent: logMealy :: Semigroup a => Mealy a a
+ Data.Machine.Concurrent: logMoore :: Monoid m => Moore m m
+ Data.Machine.Concurrent: mapping :: forall (k :: Type -> Type -> Type) a b. Category k => (a -> b) -> Machine (k a) b
+ Data.Machine.Concurrent: maybeYield :: forall o (k :: Type -> Type). Maybe o -> Plan k o ()
+ Data.Machine.Concurrent: newtype MachineT (m :: Type -> Type) (k :: Type -> Type) o
+ Data.Machine.Concurrent: newtype Mealy a b
+ Data.Machine.Concurrent: newtype PlanT (k :: Type -> Type) o (m :: Type -> Type) a
+ Data.Machine.Concurrent: pass :: k o -> Machine k o
+ Data.Machine.Concurrent: plug :: forall (m :: Type -> Type) (k :: Type -> Type) o. Monad m => MachineT m k o -> SourceT m o
+ Data.Machine.Concurrent: prepended :: Foldable f => f a -> Process a a
+ Data.Machine.Concurrent: preplan :: forall (m :: Type -> Type) (k :: Type -> Type) o. Monad m => PlanT k o m (MachineT m k o) -> MachineT m k o
+ Data.Machine.Concurrent: process :: forall (m :: Type -> Type) k i o. Monad m => (forall a. () => k a -> i -> a) -> MachineT m k o -> ProcessT m i o
+ Data.Machine.Concurrent: reading :: forall (k :: Type -> Type -> Type) a. (Category k, Read a) => Machine (k String) a
+ Data.Machine.Concurrent: repeated :: o -> Source o
+ Data.Machine.Concurrent: repeatedly :: forall (m :: Type -> Type) (k :: Type -> Type) o a. Monad m => PlanT k o m a -> MachineT m k o
+ Data.Machine.Concurrent: replicated :: Int -> a -> Source a
+ Data.Machine.Concurrent: run :: forall (k :: Type -> Type) b. MachineT Identity k b -> [b]
+ Data.Machine.Concurrent: runMachine :: forall (k :: Type -> Type) o. MachineT Identity k o -> Step k o (MachineT Identity k o)
+ Data.Machine.Concurrent: runPlan :: PlanT k o Identity a -> (a -> r) -> (o -> r -> r) -> (forall z. () => (z -> r) -> k z -> r -> r) -> r -> r
+ Data.Machine.Concurrent: runT :: forall m (k :: Type -> Type) b. Monad m => MachineT m k b -> m [b]
+ Data.Machine.Concurrent: runT_ :: forall m (k :: Type -> Type) b. Monad m => MachineT m k b -> m ()
+ Data.Machine.Concurrent: scan :: forall (k :: Type -> Type -> Type) a b. Category k => (a -> b -> a) -> a -> Machine (k b) a
+ Data.Machine.Concurrent: scan1 :: forall (k :: Type -> Type -> Type) a. Category k => (a -> a -> a) -> Machine (k a) a
+ Data.Machine.Concurrent: scanMap :: forall (k :: Type -> Type -> Type) b a. (Category k, Monoid b) => (a -> b) -> Machine (k a) b
+ Data.Machine.Concurrent: sequencing :: forall (k :: Type -> Type -> Type) m a. (Category k, Monad m) => MachineT m (k (m a)) a
+ Data.Machine.Concurrent: showing :: forall (k :: Type -> Type -> Type) a. (Category k, Show a) => Machine (k a) String
+ Data.Machine.Concurrent: sinkPart_ :: forall (m :: Type -> Type) a b c. Monad m => (a -> (b, c)) -> ProcessT m c Void -> ProcessT m a b
+ Data.Machine.Concurrent: smallest :: forall (k :: Type -> Type -> Type) a. (Category k, Ord a) => Machine (k a) a
+ Data.Machine.Concurrent: source :: Foldable f => f b -> Source b
+ Data.Machine.Concurrent: starve :: forall (m :: Type -> Type) (k0 :: Type -> Type) b (k :: Type -> Type). Monad m => MachineT m k0 b -> MachineT m k b -> MachineT m k b
+ Data.Machine.Concurrent: stepMachine :: forall (m :: Type -> Type) (k :: Type -> Type) o (k' :: Type -> Type) o'. Monad m => MachineT m k o -> (Step k o (MachineT m k o) -> MachineT m k' o') -> MachineT m k' o'
+ Data.Machine.Concurrent: stop :: forall (k :: Type -> Type) o a. Plan k o a
+ Data.Machine.Concurrent: stopped :: forall (k :: Type -> Type) b. Machine k b
+ Data.Machine.Concurrent: strippingPrefix :: forall b (m :: Type -> Type) (k :: Type -> Type -> Type) a. (Eq b, Monad m) => MachineT m (k a) b -> MachineT m (k a) b -> MachineT m (k a) b
+ Data.Machine.Concurrent: supply :: forall f (m :: Type -> Type) a b. (Foldable f, Monad m) => f a -> ProcessT m a b -> ProcessT m a b
+ Data.Machine.Concurrent: tagDone :: forall (m :: Type -> Type) o (k :: Type -> Type). Monad m => (o -> Bool) -> MachineT m k o -> MachineT m k (Either o o)
+ Data.Machine.Concurrent: taking :: Int -> Process a a
+ Data.Machine.Concurrent: takingJusts :: Process (Maybe a) a
+ Data.Machine.Concurrent: takingWhile :: (a -> Bool) -> Process a a
+ Data.Machine.Concurrent: teeT :: forall (m :: Type -> Type) a b c (k :: Type -> Type). Monad m => TeeT m a b c -> MachineT m k a -> MachineT m k b -> MachineT m k c
+ Data.Machine.Concurrent: traversing :: forall (k :: Type -> Type -> Type) m a b. (Category k, Monad m) => (a -> m b) -> MachineT m (k a) b
+ Data.Machine.Concurrent: type Source b = forall (k :: Type -> Type). () => Machine k b
+ Data.Machine.Concurrent: type Machine (k :: Type -> Type) o = forall (m :: Type -> Type). Monad m => MachineT m k o
+ Data.Machine.Concurrent: type Plan (k :: Type -> Type) o a = forall (m :: Type -> Type). () => PlanT k o m a
+ Data.Machine.Concurrent: type Process a b = Machine Is a b
+ Data.Machine.Concurrent: type ProcessT (m :: Type -> Type) a b = MachineT m Is a b
+ Data.Machine.Concurrent: type Tee a b c = Machine T a b c
+ Data.Machine.Concurrent: type TeeT (m :: Type -> Type) a b c = MachineT m T a b c
+ Data.Machine.Concurrent: type Wye a b c = Machine Y a b c
+ Data.Machine.Concurrent: type WyeT (m :: Type -> Type) a b c = MachineT m Y a b c
+ Data.Machine.Concurrent: unfold :: (r -> Maybe (a, r)) -> r -> Source a
+ Data.Machine.Concurrent: unfoldMealy :: (s -> a -> (b, s)) -> s -> Mealy a b
+ Data.Machine.Concurrent: unfoldMoore :: (s -> (b, a -> s)) -> s -> Moore a b
+ Data.Machine.Concurrent: unfoldPlan :: forall (m :: Type -> Type) s (k :: Type -> Type) o. Monad m => s -> (s -> PlanT k o m s) -> MachineT m k o
+ Data.Machine.Concurrent: unfoldT :: Monad m => (r -> m (Maybe (a, r))) -> r -> SourceT m a
+ Data.Machine.Concurrent: yield :: forall o (k :: Type -> Type). o -> Plan k o ()
+ Data.Machine.Concurrent: zipWith :: (a -> b -> c) -> Tee a b c
+ Data.Machine.Concurrent: zipWithT :: forall a b c (m :: Type -> Type). (a -> b -> c) -> PlanT (T a b) c m ()
+ Data.Machine.Concurrent: zipping :: Tee a b (a, b)
- Data.Machine.Concurrent: wye :: forall m a a' b b' c. (MonadBaseControl IO m) => ProcessT m a a' -> ProcessT m b b' -> WyeT m a' b' c -> WyeT m a b c
+ Data.Machine.Concurrent: wye :: forall m a a' b b' c. MonadBaseControl IO m => ProcessT m a a' -> ProcessT m b b' -> WyeT m a' b' c -> WyeT m a b c
- Data.Machine.Concurrent.Wye: wye :: forall m a a' b b' c. (MonadBaseControl IO m) => ProcessT m a a' -> ProcessT m b b' -> WyeT m a' b' c -> WyeT m a b c
+ Data.Machine.Concurrent.Wye: wye :: forall m a a' b b' c. MonadBaseControl IO m => ProcessT m a a' -> ProcessT m b b' -> WyeT m a' b' c -> WyeT m a b c
Files
concurrent-machines.cabal view
@@ -1,5 +1,5 @@ name: concurrent-machines-version: 0.3.1.3+version: 0.3.1.4 synopsis: Concurrent networked stream transducers description: A simple use-case for this library is to run the stages@@ -31,7 +31,7 @@ build-type: Simple extra-source-files: README.md, CHANGELOG.md cabal-version: >=1.10-tested-with: GHC == 7.10.3, GHC == 8.0.1+tested-with: GHC == 8.6.5, GHC == 8.8.4, GHC == 8.10.4, GHC == 9.0.1 source-repository head type: git@@ -58,12 +58,12 @@ monad-control >= 1.0 && < 1.1, transformers >= 0.4 && < 0.6, time >= 1.4 && < 1.10,- containers >= 0.5 && < 0.6,+ containers >= 0.5 && < 0.7, transformers-base >= 0.4 && < 0.6,- machines >= 0.5 && < 0.7,+ machines >= 0.5 && < 0.8, async >= 2.0.1 && < 2.3, lifted-async >= 0.1 && < 0.11,- semigroups >= 0.8 && < 0.19+ semigroups >= 0.8 && < 0.20 hs-source-dirs: src default-language: Haskell2010 ghc-options: -Wall