Fusing conduits with multiple inputs

后端 未结 2 1355
闹比i
闹比i 2021-01-02 09:23

I am trying to create a conduit that can consume multiple input streams. I need to be able to await on one or the other of the input streams in no particular order (e.g., no

相关标签:
2条回答
  • 2021-01-02 09:49

    If you want to combine two IO-generated streams, then Gabriel's comment is the solution.

    Otherwise, you can't wait for both streams, which one produces a value first. Conduits are single-threaded and deterministic - it processes only one pipe at a time. But you could create a function that interleaves two streams, letting them decide when to switch:

    {-# OPTIONS_GHC -fwarn-incomplete-patterns #-}
    import Control.Monad (liftM)
    import Data.Conduit.Internal (
        Pipe (..), Source, Sink,
        injectLeftovers, ConduitM (..),
        mapOutput, mapOutputMaybe
      )
    
    -- | Alternate two given sources, running one until it yields `Nothing`,
    -- then switching to the other one.
    merge :: Monad m
          => Source m (Maybe a)
          -> Source m (Maybe b)
          -> Source m (Either a b)
    merge (ConduitM l) (ConduitM r) = ConduitM $ goL l r
      where
        goL :: Monad m => Pipe () () (Maybe a) () m () 
                       -> Pipe () () (Maybe b) () m ()
                       -> Pipe () () (Either a b) () m ()
        goL (Leftover l ()) r           = goL l r
        goL (NeedInput _ c) r           = goL (c ()) r
        goL (PipeM mx) r                = PipeM $ liftM (`goL` r) mx
        goL (Done _) r                  = mapOutputMaybe (liftM Right) r
        goL (HaveOutput c f (Just o)) r = HaveOutput (goL c r) f (Left o)
        goL (HaveOutput c f Nothing) r  = goR c r
        -- This is just a mirror copy of goL. We should combine them together to
        -- avoid code repetition.
        goR :: Monad m => Pipe () () (Maybe a) () m ()
                       -> Pipe () () (Maybe b) () m ()
                       -> Pipe () () (Either a b) () m ()
        goR l (Leftover r ())           = goR l r
        goR l (NeedInput _ c)           = goR l (c ())
        goR l (PipeM mx)                = PipeM $ liftM (goR l) mx
        goR l (Done _)                  = mapOutputMaybe (liftM Left) l
        goR l (HaveOutput c f (Just o)) = HaveOutput (goR l c) f (Right o)
        goR l (HaveOutput c f Nothing)  = goL l c
    

    It processes one source until it returns Nothing, then switches to another, etc. If one source finishes, the other one is processed to the end.

    As an example, we can combine and interleave two lists:

    import Control.Monad.Trans
    import Data.Conduit (($$), awaitForever)
    import Data.Conduit.List (sourceList)
    
    main =  (merge (sourceList $ concatMap (\x -> [Just x, Just x, Nothing]) [  1..10])
                   (sourceList $ concatMap (\x -> [Just x, Nothing]) [101..110]) )
             $$ awaitForever (\x -> lift $ print x)
    

    If you need multiple sources, merge could be adapted to something like

    mergeList :: Monad m => [Source m (Maybe a)] -> Source m a
    

    which would cycle through the given list of sources until all of them are finished.

    0 讨论(0)
  • 2021-01-02 09:58

    This can be done by diving into the internals of conduit. I wanted to avoid this because it looked extremely messy. Based on the responses here, it sounds like there is no way around it (but I would really appreciate a cleaner solution).

    The key difficulty is that (x =$=) is a pure function, but to make transPipe give the correct answer, it needs a kind of stateful, function-like thing:

    data StatefulMorph m n = StatefulMorph
        { stepStatefulMorph :: forall a. m a -> n (StatefulMorph m n, a)
        , finalizeStatefulMorph :: n () }
    

    Stepping StatefulMorph m n takes a value in m and returns, in n, both that value and the next StatefulMorph, which should be used to transform the next m value. The last StatefulMorph should be finalized (which, in the case of the "stateful (x =$=)", finalizes the x conduit.

    Conduit fusion can be implemented as a StatefulMorph, using the code for pipeL with minor changes. The signature is:

    fuseStateful :: Monad m
                 => Conduit a m b
                 -> StatefulMorph (ConduitM b c m) (ConduitM a c m)
    

    I also need a replacement for transPipe (a special case of hoist) that uses StatefulMorph values instead of functions.

    class StatefulHoist t where
        statefulHoist :: (Monad m, Monad n)
                      => StatefulMorph m n
                      -> t m r -> t n r
    

    A StatefulHoist instance for ConduitM i o can be written using the code for transPipe with some minor changes.

    fuseInner is then easy to implement.

    fuseInner :: Monad m
              => Conduit a m b
              -> ConduitM i o (ConduitM b c m) r
              -> ConduitM i o (ConduitM a c m) r
    fuseInner left = statefulHoist (fuseStateful left)
    

    I've written a more detailed explanation here and posted the full code here. If someone can come up with a cleaner solution, or one that uses the conduit public API, please post it.

    Thanks for all the suggestions and input!

    0 讨论(0)
提交回复
热议问题