h*      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~                                                                  0.14.11(c) Ivan Perez, 2014-2023 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-2004BSD3ivan.perez@keera.co.uk provisionalportable Safe-InferredwV bearriverDuplicate an input.W bearriver%Lift a binary function onto an arrow.X bearriver$Lift a 3-ary function onto an arrow.Y bearriver$Lift a 4-ary function onto an arrow.Z bearriver$Lift a 5-ary function onto an arrow.VWXYZVWXYZ(c) Ivan Perez, 2014-2022 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-2004BSD3ivan.perez@keera.co.uk provisionalportable Safe-Inferred[ bearriverA single possible event occurrence, that is, a value that may or may not occur. Events are used to represent values that are not produced continuously, such as mouse clicks (only produced when the mouse is clicked, as opposed to mouse positions, which are always defined).^ bearriverMake the NoEvent constructor available. Useful e.g. for initialization, ((-->) & friends), and it's easily available anyway (e.g. mergeEvents [])._ bearriver4Suppress any event in the first component of a pair.` bearriver5Suppress any event in the second component of a pair.a bearriver-An event-based version of the maybe function.b bearriver)f bearriverTags an (occurring) event with a value ("replacing" the old value). Same as e with the arguments swapped.,Applicative-based definition: tagWith = (<$)g bearriver;Attaches an extra value to the value of an occurring event.h bearriver?Left-biased event merge (always prefer left event, if present).i bearriverRight-biased event merge (always prefer right event, if present).j bearriver:Unbiased event merge: simultaneous occurrence is an error.k bearriver t (Event a) -> Event a mergeEvents = asumn bearriver9Collect simultaneous event occurrences; no event if none.o bearriverJoin (conjunction) of two events. Only produces an event if both events exist.1Applicative-based definition: joinE = liftA2 (,)p bearriver+Split event carrying pairs into two events.q bearriver4Filter out events that don't satisfy some predicate.r bearriver2Combined event mapping and filtering. Note: since [ is a , see : for a simpler version of this function with no filtering.s bearriverEnable/disable event occurrences based on an external condition.t bearriver$Convert a maybe value into a event ([ is isomorphic to ).u bearriverNFData instance.v bearriverAlternative instance.w bearriverMonadFail instancex bearriverMonad instance.y bearriver!Applicative instance (similar to ).z bearriver$Functor instance (could be derived).l bearriver2Mapping function used when first event is present. bearriver3Mapping function used when second event is present. bearriver3Mapping function used when both events are present. bearriver First event bearriver Second event[\]^_`abcdefghijklmnopqrst[\]^_`abcdefghijklmnopqrste8g8h6i6j6o7s8(c) Ivan Perez, 2014-2022 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-20044BSD-style (see the LICENSE file in the distribution)ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferredw~ bearriver$Information on the progress of time. bearriverExtensible signal function (signal function with a notion of time, but which can be extended with actions).Signal function that transforms a signal carrying values of some type a- into a signal carrying values of some type b. You can think of it as (Signal a -> Signal b). A signal is, conceptually, a function from  to value. bearriverDTime is the time type for lengths of sample intervals. Conceptually, DTime = R+ = { x in R | x > 0 }. Don't assume Time and DTime have the same representation. bearriverTime is used both for time intervals (duration), and time w.r.t. some agreed reference point in time.&(')~(c) Ivan Perez, 2014-2022 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-20044BSD-style (see the LICENSE file in the distribution)ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferred bearriverIdentity: identity = arr idUsing  is preferred over lifting id, since the arrow combinators know how to optimise certain networks based on the transformations being applied. bearriver$Identity: constant b = arr (const b)Using  is preferred over lifting const, since the arrow combinators know how to optimise certain networks based on the transformations being applied. bearriver5Initialization operator (cf. Lustre/Lucid Synchrone).The output at time zero is the first argument, and from that point on it behaves like the signal function passed as second argument. bearriverOutput pre-insert operator.Insert a sample in the output, and from that point on, behave like the given sf. bearriverInput initialization operator.The input at time zero is the first argument, and from that point on it behaves like the signal function passed as second argument. bearriverTransform initial output value.Applies a transformation f- only to the first output value at time zero. bearriverTransform initial input value.Applies a transformation f, only to the first input value at time zero. bearriver'Override initial value of input signal.00000(c) Ivan Perez, 2014-2024 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-2004BSD3ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferred# bearriverNoise (random signal) with default range for type in question; based on "randoms". bearriverNoise (random signal) with specified range; based on "randomRs". bearriverTurn an infinite list of elements into an SF producing those elements. The SF ignores its input. bearriverStochastic event source with events occurring on average once every tAvg seconds. However, no more than one event results from any one sampling interval in the case of relatively sparse sampling, thus avoiding an "event backlog" should sampling become more frequent at some later point in time.  (c) Ivan Perez, 2014-2023 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-20044BSD-style (see the LICENSE file in the distribution)ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferred'l bearriverApplies a function point-wise, using the last output as next input. This creates a well-formed loop based on a pure, auxiliary function. bearriverGeneric version of , in which the auxiliary function produces an internal accumulator and an "held" output.4Applies a function point-wise, using the last known  output to form the output, and next input accumulator. If the output is , the last known accumulators are used. This creates a well-formed loop based on a pure, auxiliary function.(c) Ivan Perez, 2014-2023 (c) George Giorgidze, 2007-2012 (c) Henrik Nilsson, 2005-2006 (c) Antony Courtney and Henrik Nilsson, Yale University, 2003-20044BSD-style (see the LICENSE file in the distribution)ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferred, bearriverUninitialized delay operator.The output has an infinitesimal delay (1 sample), and the value at time zero is undefined. bearriverInitialized 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. bearriver  bearriver%Integration using the rectangle rule. bearriverIntegrate using an auxiliary function that takes the current and the last input, the time between those samples, and the last output, and returns a new output. bearriver"Immediate" integration (using the function's value at the current time). bearriverTrapezoid integral (using the average between the value at the last time and the value at the current time). bearriver-Integrate the first input signal and add the discrete; accumulation (sum) of the second, discrete, input signal. bearriver&Count the occurrences of input events.;embed count (deltaEncode 1 [Event 'a', NoEvent, Event 'b'])[Event 1,NoEvent,Event 2] bearriverA very crude version of a derivative. It simply divides the value difference by the time difference. Use at your own risk. bearriverA very crude version of a derivative. It simply divides the value difference by the time difference. Use at your own risk.= 0 to the outer time flow. When the ratio is 0, the embedded signal function is paused. bearriverSpaces a list of samples by a fixed time delta, avoiding unnecessary samples when the input has not changed since the last sample. bearriver$ parameterized by the equality test. bearriver;Evaluate an SF, and return an output and an initialized SF.WARN: Do not use this function for standard simulation. This function is intended only for debugging/testing. Apart from being potentially slower and consuming more memory, it also breaks the FRP abstraction by making samples discrete and step based. bearriverEvaluate an initialized SF, and return an output and a continuation.WARN: Do not use this function for standard simulation. This function is intended only for debugging/testing. Apart from being potentially slower and consuming more memory, it also breaks the FRP abstraction by making samples discrete and step based. bearriverGiven a signal function and time delta, it moves the signal function into the future, returning a new uninitialized SF and the initial output.While the input sample refers to the present, the time delta refers to the future (or to the time between the current sample and the next sample).WARN: Do not use this function for standard simulation. This function is intended only for debugging/testing. Apart from being potentially slower and consuming more memory, it also breaks the FRP abstraction by making samples discrete and step based. bearriverInitialization action bearriverInput sensing action bearriver'Actuation (output processing) action bearriverSignal function   (c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-InferredM bearriver Basic switch.By default, the first signal function is applied. Whenever the second value in the pair actually is an event, the value carried by the event is used to obtain a new signal function to be applied *at that time and at future times*. Until that happens, the first value in the pair is produced in the output signal.Important note: at the time of switching, the second signal function is applied immediately. If that second SF can also switch at time zero, then a double (nested) switch might take place. If the second SF refers to the first one, the switch might take place infinitely many times and never be resolved.Remember: The continuation is evaluated strictly at the time of switching! bearriver Switch with delayed observation.1By default, the first signal function is applied.Whenever the second value in the pair actually is an event, the value carried by the event is used to obtain a new signal function to be applied *at future times*.Until that happens, the first value in the pair is produced in the output signal.Important note: at the time of switching, the second signal function is used immediately, but the current input is fed by it (even though the actual output signal value at time 0 is discarded).If that second SF can also switch at time zero, then a double (nested) switch might take place. If the second SF refers to the first one, the switch might take place infinitely many times and never be resolved.Remember: The continuation is evaluated strictly at the time of switching! bearriverRecurring switch.Uses the given SF until an event comes in the input, in which case the SF in the event is turned on, until the next event comes in the input, and so on.See  'https://wiki.haskell.org/Yampa#Switches0 for more information on how this switch works. bearriver*Recurring switch with delayed observation.Uses the given SF until an event comes in the input, in which case the SF in the event is turned on, until the next event comes in the input, and so on.Uses decoupled switch ().See  'https://wiki.haskell.org/Yampa#Switches0 for more information on how this switch works. bearriver&Call-with-current-continuation switch.Applies the first SF until the input signal and the output signal, when passed to the second SF, produce an event, in which case the original SF and the event are used to build an new SF to switch into.See  'https://wiki.haskell.org/Yampa#Switches0 for more information on how this switch works. bearriver with delayed observation.Applies the first SF until the input signal and the output signal, when passed to the second SF, produce an event, in which case the original SF and the event are used to build an new SF to switch into.The switch is decoupled ().See  'https://wiki.haskell.org/Yampa#Switches0 for more information on how this switch works. bearriverTuple a value up with every element of a collection of signal functions. bearriverSpatial parallel composition of a signal function collection. Given a collection of signal functions, it returns a signal function that broadcasts its input signal to every element of the collection, to return a signal carrying a collection of outputs. See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriverParallel switch (dynamic collection of signal functions spatially composed in parallel) with broadcasting. See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriverDecoupled parallel switch with broadcasting (dynamic collection of signal functions spatially composed in parallel). See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriver,Recurring parallel switch with broadcasting.Uses the given collection of SFs, until an event comes in the input, in which case the function in the [= is used to transform the collections of SF to be used with < again, until the next event comes in the input, and so on.Broadcasting is used to decide which subpart of the input goes to each SF in the collection.See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriver6Decoupled recurring parallel switch with broadcasting.Uses the given collection of SFs, until an event comes in the input, in which case the function in the [= is used to transform the collections of SF to be used with < again, until the next event comes in the input, and so on.Broadcasting is used to decide which subpart of the input goes to each SF in the collection.!This is the decoupled version of .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriverSpatial parallel composition of a signal function collection parameterized on the routing function. bearriverParallel switch parameterized on the routing function. This is the most general switch from which all other (non-delayed) switches in principle can be derived. The signal function collection is spatially composed in parallel and run until the event signal function has an occurrence. Once the switching event occurs, all signal function are "frozen" and their continuations are passed to the continuation function, along with the event value. bearriverParallel switch with delayed observation parameterized on the routing function.The collection argument to the function invoked on the switching event is of particular interest: it captures the continuations of the signal functions running in the collection maintained by  at the time of the switching event, thus making it possible to preserve their state across a switch. Since the continuations are plain, ordinary signal functions, they can be resumed, discarded, stored, or combined with other signal functions. bearriverRecurring parallel switch parameterized on the routing function.Uses the given collection of SFs, until an event comes in the input, in which case the function in the [= is used to transform the collections of SF to be used with < again, until the next event comes in the input, and so on.The routing function is used to decide which subpart of the input goes to each SF in the collection. This is the parallel version of . bearriverRecurring parallel switch with delayed observation parameterized on the routing function.Uses the given collection of SFs, until an event comes in the input, in which case the function in the [= is used to transform the collections of SF to be used with < again, until the next event comes in the input, and so on.The routing function is used to decide which subpart of the input goes to each SF in the collection. This is the parallel version of . bearriver&Parallel composition of a list of SFs.Given a list of SFs, returns an SF that takes a list of inputs, applies each SF to each input in order, and returns the SFs' outputs.embed (parZ [arr (+1), arr (+2)]) (deltaEncode 0.1 [[0, 0], [1, 1]]) [[1,2],[2,3]]:If there are more SFs than inputs, an exception is thrown.embed (parZ [arr (+1), arr (+1), arr (+2)]) (deltaEncode 0.1 [[0, 0], [1, 1]])[[1,1,*** Exception: FRP.Yampa.Switches.parZ: Input list too short.If there are more inputs than SFs, the unused inputs are ignored.:embed (parZ [arr (+1)]) (deltaEncode 0.1 [[0, 0], [1, 1]]) [[1],[2]] bearriverParallel switch (dynamic collection of signal functions spatially composed in parallel). See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriverDecoupled parallel switch with broadcasting (dynamic collection of signal functions spatially composed in parallel). See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriver-Recurring parallel switch with "zip" routing.Uses the given list of SFs, until an event comes in the input, in which case the function in the [6 is used to transform the list of SF to be used with ; again, until the next event comes in the input, and so on.Zip routing is used to decide which subpart of the input goes to each SF in the list.See .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriver7Decoupled recurring parallel switch with "zip" routing.Uses the given list of SFs, until an event comes in the input, in which case the function in the [6 is used to transform the list of SF to be used with ; again, until the next event comes in the input, and so on.Zip routing is used to decide which subpart of the input goes to each SF in the list.See  and .?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf bearriverZip two lists.3PRE: The first list is not shorter than the second. bearriver'Apply an SF to every element of a list.Example:embed (parC integral) (deltaEncode 0.1 [[1, 2], [2, 4], [3, 6], [4.0, 8.0 :: Float]]))[[0.0,0.0],[0.1,0.2],[0.3,0.6],[0.6,1.2]]The number of SFs or expected inputs is determined by the first input list, and not expected to vary over time.;If more inputs come in a subsequent list, they are ignored.embed (parC (arr (+1))) (deltaEncode 0.1 [[0], [1, 1], [3, 4], [6, 7, 8], [1, 1], [0, 0], [1, 9, 8]])[[1],[2],[4],[7],[2],[1],[2]]If less inputs come in a subsequent list, an exception is thrown.embed (parC (arr (+1))) (deltaEncode 0.1 [[0, 0], [1, 1], [3, 4], [6, 7, 8], [1, 1], [0, 0], [1, 9, 8]]),[[1,1],[2,2],[4,5],[7,8],[2,2],[1,1],[2,10]] bearriverDetermines the input to each signal function in the collection. IMPORTANT! The routing function MUST preserve the structure of the signal function collection. bearriverSignal function collection. bearriverRouting function: determines the input to each signal function in the collection. IMPORTANT! The routing function has an obligation to preserve the structure of the signal function collection. bearriverSignal function collection. bearriver/Signal function generating the switching event. bearriver-Continuation to be invoked once event occurs. bearriverRouting function. Its purpose is to pair up each running signal function in the collection maintained by  with the input it is going to see at each point in time. All the routing function can do is specify how the input is distributed. bearriver'Initial collection of signal functions. bearriverSignal function that observes the external input signal and the output signals from the collection in order to produce a switching event. bearriverThe fourth argument is a function that is invoked when the switching event occurs, yielding a new signal function to switch into based on the collection of signal functions previously running and the value carried by the switching event. This allows the collection to be updated and then switched back in, typically by employing  again. bearriverRouting function: determines the input to each signal function in the collection. IMPORTANT! The routing function has an obligation to preserve the structure of the signal function collection. bearriver#Initial signal function collection. bearriverRouting function: determines the input to each signal function in the collection. IMPORTANT! The routing function has an obligation to preserve the structure of the signal function collection. bearriver#Initial signal function collection. (c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-Inferred bearriverEvent source that never occurs. bearriverEvent source with a single occurrence at time 0. The value of the event is given by the function argument. bearriverEvent source with a single occurrence at or as soon after (local) time q as possible. bearriver7Event source with repeated occurrences with interval q.Note: If the interval is too short w.r.t. the sampling intervals, the result will be that events occur at every sample. However, no more than one event results from any sampling interval, thus avoiding an "event backlog" should sampling become more frequent at some later point in time. bearriverEvent source with consecutive occurrences at the given intervals. Should more than one event be scheduled to occur in any sampling interval, only the first will in fact occur to avoid an event backlog. bearriverEvent source with consecutive occurrences at the given intervals. Should more than one event be scheduled to occur in any sampling interval, the output list will contain all events produced during that interval. bearriver8Delay for events. (Consider it a triggered after, hence basic.) bearriverDelay an event by a given delta and catenate events that occur so closely so as to be  inseparable. bearriverA rising edge detector. Useful for things like detecting key presses. It is initialised as up, meaning that events occurring at time 0 will not be detected. bearriver6A rising edge detector that can be initialized as up (, meaning that events occurring at time 0 will not be detected) or down (=, meaning that events occurring at time 0 will be detected). bearriver6A rising edge detector that can be initialized as up (, meaning that events occurring at time 0 will not be detected) or down (=, meaning that events occurring at time 0 will be detected). bearriverLike %, but parameterized on the tag value. bearriver> snapT = snapT bearriverImpose a time out on a task. bearriverRun a "guarding" event source (SF m a (Event b)) in parallel with a (possibly non-terminating) task.The task will be aborted at the first occurrence of the event source (if it has not terminated itself before that).Useful for separating sequencing and termination concerns. E.g. we can do something "useful", but in parallel watch for a (exceptional) condition which should terminate that activity, without having to check for that condition explicitly during each and every phase of the activity. Example: tsk  lbp  00(c) Ivan Perez, 2019-2023 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk provisionalnon-portable (GHC extensions) Safe-Inferred bearriverOutputs the time passed since the signal function instance was started. bearriverAlternative name for localTime.(c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-Inferred bearriver Convert an [ into a  value.Both types are isomorphic, where a value containing an event is mapped to a , and ] is mapped to . There is, however, a semantic difference: a signal carrying a Maybe may change constantly, but, for a signal carrying an [, there should be a bounded frequency such that sampling the signal faster does not render more event occurrences. bearriverCreate an event if a  is . bearriver9Loop with an initial value for the signal being fed back. [\] !"#$%&(')0;<LMNOPQRSTU~V*+,-./IHj123456789:=>?@ABCDEFGJKWXYZ^_`abcdefghiklmnopqrst(c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-Inferred/ bearriverFuture signal function (conceptually, a function between future signals that respects causality).A future signal is a signal that is only defined for positive times. bearriverSignal function (conceptually, a function between signals that respects causality). bearriverGiven a signal function and a pair with an initial input sample for the input signal, and a list of sampling times, possibly with new input samples at those times, it produces a list of output samples.3This is a simplified, purely-functional version of . [\] !"#$%&(')0;<LMNOPQRSTU~V*+,-./IHj123456789:=>?@ABCDEFGJKWXYZ^_`abcdefghiklmnopqrst [\] !"#$%&(')0;<LMNOPQRSTU~V*+,-./IHj123456789:=>?@ABCDEFGJKWXYZ^_`abcdefghiklmnopqrst !"#$%&'()(*(+(,(-./.01223456789:;<<=>?@ABCDEFGHIJHIKHILHMNHMOHMPHMQHMRHMSHMTHMUHVWHVXHVYHVZHV[HV\HV]HV^HV_HV`HVaHVbHVcHVdHVeHVfHVghijhikhilhimhinhiohiphiqhirhistuvwxyyz{|}~                                                                       'bearriver-0.14.11-DI3ou5JEV3krfyg3Fzrw1 FRP.YampaFRP.BearRiver.RandomFRP.BearRiver.ArrowFRP.BearRiver.EventFRP.BearRiver.BasicFRP.BearRiver.ScanFRP.BearRiver.DelaysFRP.BearRiver.HybridFRP.BearRiver.IntegrationFRP.BearRiver.LoopFRP.BearRiver.SimulationFRP.BearRiver.SwitchesFRP.BearRiver.EventSFRP.BearRiver.ConditionalFRP.BearRiver.TaskFRP.BearRiver.Time FRP.BearRiver bearriverFRP.BearRiver.InternalCorebase Control.Arrowarrfirstapp|||loop%random-1.2.1.2-BueTXQ4cpBz2A3gkI9h8O2System.Random.Internal RandomGennextgenWord8 genWord16 genWord32 genWord64 genWord32R genWord64RgenShortByteStringgenRangesplit System.RandomRandomrandomRrandomrandomRsrandomsControl.Category<<<>>> ArrowLoop ArrowMonad ArrowApply ArrowChoiceleftright+++ ArrowPlus<+> ArrowZero zeroArrowKleisli runKleisliArrowsecond***&&&returnA^>>>>^<<^^<<leftApp#dunai-0.13.2-6vxRv4PISFm74xHtMZyATo'Data.MonadicStreamFunction.InternalCoreMSFmorphGSfeedbackData.MonadicStreamFunction.CoreconstMarrM liftBaseM liftBaseS^>>>>>>^ liftTransSmorphSData.MonadicStreamFunction.UtilMSinkMStream mapMaybeSwithSideEffectwithSideEffect_iPostfifosumSsumFrommappendS mappendFromaccumulateWithmealyunfold traceWith traceWhenpauseOn0simple-affine-space-0.2.1-74ucbS7fm4g3wPtIMzWIo8Data.VectorSpace VectorSpace zeroVector*^^/^+^^-^ negateVectordotnorm normalizeduparr2arr3arr4arr5EventNoEventnoEvent noEventFst noEventSndevent fromEventisEvent isNoEventtagtagWithattachlMergerMergemergemergeBymapMerge mergeEvents catEventsjoinEsplitEfilterE mapFilterEgate maybeToEvent $fNFDataEvent$fAlternativeEvent$fMonadFailEvent $fMonadEvent$fApplicativeEvent$fFunctorEvent $fEqEvent $fOrdEvent $fShowEvent ClockInfoDTimeTimeidentityconstant-->-:>>---=>>=- initiallynoisenoiseR occasionallysscan sscanPrimpreiPrefbydelayholddHold trackAndHold dTrackAndHoldaccum accumHold dAccumHoldaccumBy accumHoldBy dAccumHoldBy accumFilterintegral imIntegraltrapezoidIntegralimpulseIntegralcount derivativeiterFromloopPre loopIntegralFutureSF ReactHandle reactimate reactInitreactembed embedSynch deltaEncode deltaEncodeBy evalAtZeroevalAt evalFutureswitchdSwitchrSwitchdrSwitchkSwitchdkSwitchparBpSwitchB dpSwitchB rpSwitchB drpSwitchBparpSwitchdpSwitchrpSwitch drpSwitchparZpSwitchZ dpSwitchZ rpSwitchZ drpSwitchZparCnevernowafter repeatedly afterEach afterEachCat delayEvent delayEventCatedgeiEdgeedgeTagedgeJustedgeBynotYetonce takeEvents dropEventssnap snapAftersample sampleWindowrecurandThenprovidedpauseTaskmkTaskrunTaskrunTask_taskToSFconstTsleepTsnapTtimeOut abortWhen $fMonadTask$fApplicativeTask $fFunctorTask localTimetime eventToMaybe boolToEventSFGHC.BaseidFunctorfmap GHC.MaybeMaybe streamToSFJustNothing mapEventS integralFromderivativeFrom broadcastsafeZipghc-prim GHC.TypesTrueFalseedgeFromBool