Safe Haskell	None
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.

Synopsis

data FixedStep (n :: Nat) where
- FixedStep :: KnownNat n => FixedStep n
stepsize :: FixedStep n -> Integer
type Count = FixedStep 1
scheduleFixedStep :: Monad m => Schedule m (FixedStep n1) (FixedStep n2)
downsampleFixedStep :: (KnownNat n, Monad m) => ResamplingBuffer m (FixedStep k) (FixedStep (n * k)) a (Vector n a)

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.

Constructors

FixedStep :: KnownNat n => FixedStep n

Instances

Monad m => Clock m (FixedStep n) Source #
Instance details Defined in FRP.Rhine.Clock.FixedStep Associated Types type Time (FixedStep n) :: Type Source # type Tag (FixedStep n) :: Type Source # Methods initClock :: FixedStep n -> RunningClockInit m (Time (FixedStep n)) (Tag (FixedStep n)) Source #
type Time (FixedStep n) Source #
Instance details Defined in FRP.Rhine.Clock.FixedStep type Time (FixedStep n) = Integer
type Tag (FixedStep n) Source #
Instance details Defined in FRP.Rhine.Clock.FixedStep type Tag (FixedStep n) = ()

stepsize :: FixedStep n -> Integer Source #

Extract the type-level natural number as an integer.

type Count = FixedStep 1 Source #

A singleton clock that counts the ticks.

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 #