Îõ³h&NºJé¨      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§Ô(c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-Inferred×ÜFiÖJ bearriver“A 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).M bearriver$Information on the progress of time.N bearriverìExtensible 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 P to value.O bearriver¢DTime 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.P bearriveræTime is used both for time intervals (duration), and time w.r.t. some agreed reference point in time.Q bearriverÁLifts a pure function into a signal function (applied pointwise).R bearriverÔLifts a pure function into a signal function applied to events (applied pointwise).S bearriverIdentity: identity = arr idUsing SŽ is preferred over lifting id, since the arrow combinators know how to optimise certain networks based on the transformations being applied.T bearriver$Identity: constant b = arr (const b)Using T‘ is preferred over lifting const, since the arrow combinators know how to optimise certain networks based on the transformations being applied.U bearriverÇOutputs the time passed since the signal function instance was started.V bearriverAlternative name for localTime.W 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.X bearriverOutput pre-insert operator.ÑInsert a sample in the output, and from that point on, behave like the given sf.Y 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.Z bearriverTransform initial input value.Applies a transformation f, only to the first input value at time zero.[ bearriver'Override initial value of input signal.\ bearriver‰Applies 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.^ bearriverEvent source that never occurs._ bearriverëEvent source with a single occurrence at time 0. The value of the event is given by the function argument.` bearriverÇEvent source with a single occurrence at or as soon after (local) time q as possible.a 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.b bearriverÁEvent 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.c bearriverÁEvent 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.d bearriver Apply an ?6 to every input. Freezes temporarily if the input is L, and continues as soon as an J is received.e bearriver Convert an J into a ª value.ÍBoth types are isomorphic, where a value containing an event is mapped to a ¨, and L is mapped to ©ý. There is, however, a semantic difference: a signal carrying a Maybe may change constantly, but, for a signal carrying an Jó, there should be a bounded frequency such that sampling the signal faster does not render more event occurrences.f bearriverCreate an event if a « is ¬.g bearriverÜA 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.h 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).i bearriverLike g%, but parameterized on the tag value. From Yampaj bearriver) & friends), and it's easily available anyway (e.g. mergeEvents []).s bearriver4Suppress any event in the first component of a pair.t bearriver5Suppress any event in the second component of a pair.u bearriver-An event-based version of the maybe function.v bearriver)z bearriverÍTags an (occurring) event with a value ("replacing" the old value). Same as y with the arguments swapped.-Applicative-based definition: tagWith = (<$){ bearriver;Attaches an extra value to the value of an occurring event.| bearriver?Left-biased event merge (always prefer left event, if present).} bearriverÁRight-biased event merge (always prefer right event, if present).~ bearriver:Unbiased event merge: simultaneous occurrence is an error.€ bearriverÕA generic event merge-map utility that maps event occurrences, merging the results. The first three arguments are mapping functions, the third of which will only be used when both events are present. Therefore,  = € ® ®=Applicative-based definition: mapMerge lf rf lrf le re = (f  $ le  * re)  | (lf  $ le)  | (rf  $ re) bearriver4Merge a list of events; foremost event has priority.äFoldable-based definition: mergeEvents :: Foldable t => t (Event a) -> Event a mergeEvents = asum‚ bearriver9Collect simultaneous event occurrences; no event if none.ƒ bearriverÏJoin (conjunction) of two events. Only produces an event if both events exist.1Applicative-based definition: joinE = liftA2 (,)„ bearriver+Split event carrying pairs into two events.… bearriver4Filter out events that don't satisfy some predicate.† bearriver2Combined event mapping and filtering. Note: since J is a ¯, see °: for a simpler version of this function with no filtering.‡ bearriverÀEnable/disable event occurrences based on an external condition.ˆ 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!Š bearriver„Spatial 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 par.?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdf‹ bearriverúDecoupled parallel switch with broadcasting (dynamic collection of signal functions spatially composed in parallel). See dpSwitch.?For more information on how parallel composition works, check ,https://www.antonycourtney.com/pubs/hw03.pdfŒ 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]] bearriverZero-order hold.ŠConverts a discrete-time signal into a continuous-time signal, by holding the last value until it changes in the input signal. The given parameter may be used for time zero, and until the first event occurs in the input signal, so hold is always well-initialized.×embed (hold 1) (deltaEncode 0.1 [NoEvent, NoEvent, Event 2, NoEvent, Event 3, NoEvent]) [1,1,2,2,3,3]Ž bearriver7Accumulator parameterized by the accumulation function. bearriverÇZero-order hold accumulator parameterized by the accumulation function. bearriver9Loop with an initial value for the signal being fed back.‘ bearriver%Integration using the rectangle rule.’ bearriver¡Integrate 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ûA very crude version of a derivative. It simply divides the value difference by the time difference. Use at your own risk.” bearriverûA very crude version of a derivative. It simply divides the value difference by the time difference. Use at your own risk.?I@ABCDEFHGJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œÓPONMJKLQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œW0X0Y0Z0Ô(c) Ivan Perez, 2019-2022 (c) Ivan Perez and Manuel Baerenz, 2016-2018BSD3ivan.perez@keera.co.uk Safe-InferredIi¦ bearriverâFuture signal function (conceptually, a function between future signals that respects causality).ÄA future signal is a signal that is only defined for positive times.§ bearriverÔSignal function (conceptually, a function between signals that respects causality).ž   !"#$%&'()*+,-./0123456789:;<=>?I@ABCDEFHGJKLMOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œ¦§ž   !"#$%&'()*+,-./0123456789:;<=>?I@ABCDEFHGJKLMOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œ§¦´       !"!#$%&$%'$%($%)$%*$%+$%,$%-$%.$%/$%0$%1$%2$%3$%4$%5$%6$%7$%8$%9$:;$:<$:=$:>$:?$:@$:A$:B$CD$CE$CF$CGHIJHIKHILHIMHINHIOHIPHIQHIRHISTTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£¤¥¦§¨©ª«¬­®¯W°±°²°³´µ¶´µ·´µ¸¹º¹»¹¼¹½¹¾¹¿À'bearriver-0.14.2-353zzf8PLTlEwQR6SePCRr FRP.Yampa FRP.BearRiverbase Control.Arrowarrfirstapp|||loop runKleisliKleisli zeroArrow ArrowZero<+> ArrowPlus ArrowMonad ArrowLooprightleft+++ ArrowChoice ArrowApplysecond***&&&ArrowreturnAleftApp^>>^<<>>^<<^Control.Category>>><<<#dunai-0.11.0-7yZpShlHYwF8y9VYSXrvssData.MonadicStreamFunction.UtilpauseOn traceWhen traceWithunfoldmealyaccumulateWith mappendFrommappendSsumFromsumScountfifonextiPostiPrewithSideEffect_withSideEffect mapMaybeSMStreamMSinkData.MonadicStreamFunction.CoremorphS liftTransS>>>^^>>> liftBaseS liftBaseMarrMconstM'Data.MonadicStreamFunction.InternalCoreembedfeedbackmorphGSMSF0simple-affine-space-0.2.1-5U7b2jMMVKYG6R5JnFSAHBData.VectorSpace normalizenormdot negateVector^-^^+^^/*^ zeroVector VectorSpaceEventNoEvent ClockInfoSFDTimeTimearrPrimarrEPrimidentityconstant localTimetime-->-:>>-->=- initiallysscan sscanPrimnevernowafter repeatedly afterEach afterEachCat mapEventS eventToMaybe boolToEventedgeiEdgeedgeTagedgeJustedgeBy maybeToEventedgeFromnotYetonce takeEvents dropEventsnoEvent noEventFst noEventSndevent fromEventisEvent isNoEventtagtagWithattachlMergerMergemergemergeBymapMerge mergeEvents catEventsjoinEsplitEfilterE mapFilterEgateswitchdSwitchparB dpSwitchBparCholdaccumBy accumHoldByloopPreintegral integralFrom derivativederivativeFromiterFrom occasionally reactimate evalAtZeroevalAt evalFuture replaceOncedup $fNFDataEvent$fAlternativeEvent$fMonadFailEvent $fMonadEvent$fApplicativeEvent$fFunctorEvent $fEqEvent $fOrdEvent $fShowEventFutureSF GHC.MaybeJustNothingMaybeghc-prim GHC.TypesBoolTrueFalseGHC.BaseidFunctorfmapMonad Applicative<*>