Copyright	(c) Ivan Perez 2014-2023 (c) George Giorgidze 2007-2012 (c) Henrik Nilsson 2005-2006 (c) Antony Courtney and Henrik Nilsson Yale University 2003-2004
License	BSD-style (see the LICENSE file in the distribution)
Maintainer	ivan.perez@keera.co.uk
Stability	provisional
Portability	non-portable (GHC extensions)
Safe Haskell	Safe-Inferred
Language	Haskell2010

FRP.BearRiver.Delays

Contents

Basic delays
Timed delays

Description

SF primitives and combinators to delay signals, introducing new values in them.

Synopsis

pre :: Monad m => SF m a a
iPre :: Monad m => a -> SF m a a
fby :: Monad m => b -> SF m a b -> SF m a b
delay :: Monad m => Time -> a -> SF m a a

Basic delays

pre :: Monad m => SF m a a Source #

Uninitialized delay operator.

The output has an infinitesimal delay (1 sample), and the value at time zero is undefined.

iPre :: Monad m => a -> SF m a a Source #

Initialized delay operator.

Creates an SF that delays the input signal, introducing an infinitesimal delay (one sample), using the given argument to fill in the initial output at time zero.

fby :: Monad m => b -> SF m a b -> SF m a b infixr 0 Source #

Lucid-Synchrone-like initialized delay (read "followed by").

Initialized delay combinator, introducing an infinitesimal delay (one sample) in given SF, using the given argument to fill in the initial output at time zero.

The difference with iPre is that fby takes an SF as argument.

Timed delays

delay :: Monad m => Time -> a -> SF m a a Source #

Delay a signal by a fixed time t, using the second parameter to fill in the initial t seconds.