FRP.Rhine.Clock.FixedStep

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

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

GetClockProxy (FixedStep n)

Defined in FRP.Rhine.Clock.FixedStep

Methods

getClockProxy :: ClockProxy (FixedStep n)

(MonadSchedule m, Monad m) => Clock (ScheduleT Integer m) (FixedStep n)

Defined in FRP.Rhine.Clock.FixedStep

Associated Types

type Time (FixedStep n)

type Tag (FixedStep n)

Methods

initClock :: FixedStep n -> RunningClockInit (ScheduleT Integer m) (Time (FixedStep n)) (Tag (FixedStep n))

type Tag (FixedStep n)

Defined in FRP.Rhine.Clock.FixedStep

type Tag (FixedStep n) = ()

type Time (FixedStep n)

Defined in FRP.Rhine.Clock.FixedStep

type Time (FixedStep n) = Integer

stepsize :: FixedStep n -> Integer

Extract the type-level natural number as an integer.

type Count = FixedStep 1

A singleton clock that counts the ticks.

downsampleFixedStep :: (KnownNat n, Monad m) => ResamplingBuffer m (FixedStep k) (FixedStep (n * k)) a (Vector n a)

Resample into a FixedStep clock that ticks n times slower, by collecting all values into a vector.