-- | Useful auxiliary functions and definitions. module Data.MonadicStreamFunction.Util where -- External import Control.Applicative import Control.Arrow import Control.Category import Control.Monad import Control.Monad.Base import Data.Monoid import Prelude hiding (id, (.)) -- Internal import Data.MonadicStreamFunction.Core import Data.VectorSpace -- * Streams and sinks -- | A stream is an MSF that produces outputs ignoring the input. It can -- obtain the values from a monadic context. type MStream m a = MSF m () a -- | A stream is an MSF that produces outputs producing no output. It can -- consume the values with side effects. type MSink m a = MSF m a () -- * Lifting -- | Pre-inserts an input sample. {-# DEPRECATED insert "Don't use this. arrM id instead" #-} insert :: Monad m => MSF m (m a) a insert = arrM id -- | Lifts a computation into a Stream. arrM_ :: Monad m => m b -> MSF m a b arrM_ = arrM . const -- | Lift the first MSF into the monad of the second. (^>>>) :: MonadBase m1 m2 => MSF m1 a b -> MSF m2 b c -> MSF m2 a c sf1 ^>>> sf2 = liftMSFBase sf1 >>> sf2 {-# INLINE (^>>>) #-} -- | Lift the second MSF into the monad of the first. (>>>^) :: MonadBase m1 m2 => MSF m2 a b -> MSF m1 b c -> MSF m2 a c sf1 >>>^ sf2 = sf1 >>> liftMSFBase sf2 {-# INLINE (>>>^) #-} -- * Analogues of map and fmap -- | Apply an MSF to every input. mapMSF :: Monad m => MSF m a b -> MSF m [a] [b] mapMSF = MSF . consume where consume :: Monad m => MSF m a t -> [a] -> m ([t], MSF m [a] [t]) consume sf [] = return ([], mapMSF sf) consume sf (a:as) = do (b, sf') <- unMSF sf a (bs, sf'') <- consume sf' as b `seq` return (b:bs, sf'') -- | Apply an MSF to every input. Freezes temporarily if the input is -- 'Nothing', and continues as soon as a 'Just' is received. mapMaybeS :: Monad m => MSF m a b -> MSF m (Maybe a) (Maybe b) mapMaybeS msf = go where go = MSF $ \maybeA -> case maybeA of Just a -> do (b, msf') <- unMSF msf a return (Just b, mapMaybeS msf') Nothing -> return (Nothing, go) -- * Adding side effects -- | Applies a function to produce an additional side effect and passes the -- input unchanged. withSideEffect :: Monad m => (a -> m b) -> MSF m a a withSideEffect method = (id &&& arrM method) >>> arr fst -- | Produces an additional side effect and passes the input unchanged. withSideEffect_ :: Monad m => m b -> MSF m a a withSideEffect_ method = withSideEffect $ const method -- * Delays -- See also: 'iPre' -- | Preprends a fixed output to an MSF. The first input is completely -- ignored. iPost :: Monad m => b -> MSF m a b -> MSF m a b iPost b sf = MSF $ \_ -> return (b, sf) -- | Preprends a fixed output to an MSF, shifting the output. next :: Monad m => b -> MSF m a b -> MSF m a b next b sf = MSF $ \a -> do (b', sf') <- unMSF sf a return (b, next b' sf') -- rather, once delay is tested: -- next b sf = sf >>> delay b -- * Folding -- ** Folding for VectorSpace instances -- | Count the number of simulation steps. Produces 1, 2, 3,... count :: (Num n, Monad m) => MSF m a n count = arr (const 1) >>> accumulateWith (+) 0 -- | Sums the inputs, starting from zero. sumS :: (RModule v, Monad m) => MSF m v v sumS = sumFrom zeroVector -- | Sums the inputs, starting from an initial vector. sumFrom :: (RModule v, Monad m) => v -> MSF m v v sumFrom = accumulateWith (^+^) -- ** Folding for monoids -- | Accumulate the inputs, starting from 'mempty'. mappendS :: (Monoid n, Monad m) => MSF m n n mappendS = mappendFrom mempty {-# INLINE mappendS #-} -- | Accumulate the inputs, starting from an initial monoid value. mappendFrom :: (Monoid n, Monad m) => n -> MSF m n n mappendFrom = accumulateWith mappend -- ** Generic folding \/ accumulation -- | Applies a function to the input and an accumulator, outputing the -- accumulator. Equal to @\f s0 -> feedback s0 $ arr (uncurry f >>> dup)@. accumulateWith :: Monad m => (a -> s -> s) -> s -> MSF m a s accumulateWith f s0 = feedback s0 $ arr g where g (a, s) = let s' = f a s in (s', s') -- * Unfolding -- | Generate outputs using a step-wise generation function and an initial -- value. unfold :: Monad m => (a -> (b,a)) -> a -> MSF m () b unfold f a = MSF $ \_ -> let (b,a') = f a in b `seq` return (b, unfold f a') -- unfold f x = feedback x (arr (snd >>> f)) -- | Generate outputs using a step-wise generation function and an initial -- value. Version of 'unfold' in which the output and the new accumulator -- are the same. Should be equal to @\f a -> unfold (f >>> dup) a@. repeatedly :: Monad m => (a -> a) -> a -> MSF m () a repeatedly f = repeatedly' where repeatedly' a = MSF $ \() -> let a' = f a in a' `seq` return (a, repeatedly' a') -- repeatedly f x = feedback x (arr (f >>> \x -> (x,x))) -- * Running functions -- | Run an MSF fed from a list, discarding results. Useful when one needs to -- combine effects and streams (i.e., for testing purposes). -- TODO: This is not elementary, it can probably be built using other -- construts. Move to a non-core module? embed_ :: (Functor m, Monad m) => MSF m a () -> [a] -> m () embed_ msf as = void $ foldM (\sf a -> snd <$> unMSF sf a) msf as -- * Debugging -- | Outputs every input sample, with a given message prefix. trace :: Show a => String -> MSF IO a a trace = traceWith putStrLn -- | Outputs every input sample, with a given message prefix, using an -- auxiliary printing function. traceWith :: (Monad m, Show a) => (String -> m ()) -> String -> MSF m a a traceWith method msg = withSideEffect (method . (msg ++) . show) -- | Outputs every input sample, with a given message prefix, using an -- auxiliary printing function, when a condition is met. traceWhen :: (Monad m, Show a) => (a -> Bool) -> (String -> m ()) -> String -> MSF m a a traceWhen cond method msg = withSideEffect $ \a -> when (cond a) $ method $ msg ++ show a -- | Outputs every input sample, with a given message prefix, when a condition -- is met, and waits for some input \/ enter to continue. pauseOn :: Show a => (a -> Bool) -> String -> MSF IO a a pauseOn cond = traceWhen cond $ \s -> print s >> getLine >> return ()