Safe Haskell	Safe-Inferred
Language	Haskell2010

FRP.Rhine.ResamplingBuffer

Description

This module introduces ResamplingBuffers, which are primitives that consume and produce data at different rates. Just as schedules form the boundaries between different clocks, (resampling) buffers form the boundaries between synchronous signal functions ticking at different speeds.

Synopsis

data ResamplingBuffer m cla clb a b = forall s.ResamplingBuffer {
- buffer :: s
- put :: TimeInfo cla -> a -> s -> m s
- get :: TimeInfo clb -> s -> m (Result s b)
}
type ResBuf m cla clb a b = ResamplingBuffer m cla clb a b
hoistResamplingBuffer :: (Monad m1, Monad m2) => (forall c. m1 c -> m2 c) -> ResamplingBuffer m1 cla clb a b -> ResamplingBuffer m2 cla clb a b
module FRP.Rhine.Clock

Documentation

data ResamplingBuffer m cla clb a b Source #

A stateful buffer from which one may get a value, or to which one may put a value, depending on the clocks. ResamplingBuffers can be clock-polymorphic, or specific to certain clocks.

m: Monad in which the ResamplingBuffer may have side effects
cla: The clock at which data enters the buffer
clb: The clock at which data leaves the buffer
a: The input type
b: The output type

Constructors

forall s. ResamplingBuffer
Fields buffer :: s The internal state of the buffer. put :: TimeInfo cla -> a -> s -> m s Store one input value of type `a` at a given time stamp, and return an updated state. get :: TimeInfo clb -> s -> m (Result s b) Retrieve one output value of type `b` at a given time stamp, and an updated state.

type ResBuf m cla clb a b = ResamplingBuffer m cla clb a b Source #

A type synonym to allow for abbreviation.

hoistResamplingBuffer :: (Monad m1, Monad m2) => (forall c. m1 c -> m2 c) -> ResamplingBuffer m1 cla clb a b -> ResamplingBuffer m2 cla clb a b Source #

Hoist a ResamplingBuffer along a monad morphism.

module FRP.Rhine.Clock