| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
FRP.Rhine.Clock.FixedStep
Description
Implements pure clocks ticking at every multiple of a fixed number of steps, and a deterministic schedule for such clocks.
Documentation
data FixedStep (n :: Nat) where Source #
A pure (side effect free) clock with fixed step size,
i.e. ticking at multiples of n.
The tick rate is in the type signature,
which prevents composition of signals at different rates.
Instances
| Monad m => Clock m (FixedStep n) Source # | |
| GetClockProxy (FixedStep n) Source # | |
Defined in FRP.Rhine.Clock.FixedStep Methods getClockProxy :: ClockProxy (FixedStep n) Source # | |
| type Tag (FixedStep n) Source # | |
Defined in FRP.Rhine.Clock.FixedStep | |
| type Time (FixedStep n) Source # | |
Defined in FRP.Rhine.Clock.FixedStep | |
scheduleFixedStep :: Monad m => Schedule m (FixedStep n1) (FixedStep n2) Source #
Two FixedStep clocks can always be scheduled without side effects.
downsampleFixedStep :: (KnownNat n, Monad m) => ResamplingBuffer m (FixedStep k) (FixedStep (n * k)) a (Vector n a) Source #