Îõ³h$ ¿¤      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œžŸ ¡¢£ Safe-InferredÔÙê#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.^ 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.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.i bearriverLike g%, but parameterized on the tag value. From Yampaj bearriverÀEdge detector particularized for detecting transtitions on a ¤ signal from ¥ to ¦. From Yampan bearriver/Suppression of initial (at local time 0) event.o bearriver!Suppress all but the first event.p bearriver$Suppress all but the first n events.q bearriverSuppress first n events.s bearriver4Suppress any event in the first component of a pair.t bearriver5Suppress any event in the second component of a pair.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Ö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.Traverable-based definition: catEvents :: Foldable t => t (Event a) -> Event (t a) carEvents e = if (null e) then NoEvent else (sequenceA e)ƒ 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 occurences based on an external condition.Ž bearriver7Accumulator parameterized by the accumulation function.˜ 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.™ bearriverÄEvaluate 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.š bearriver‘Given 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. bearriver The type J is isomorphic to ¤. The ª instance of J is analogous to the ª instance of ¤$, where the lack of a value (i.e., L#) causes bind to produce no value (L).ž bearriver The type J is isomorphic to ¤. The « instance of J is analogous to the « instance of ¤$, where the lack of a value (i.e., L ) causes ¬ to produce no value (L).Ÿ bearriver The type J is isomorphic to ¤. The ¨ instance of J is analogous to the Functo instance of ¤?, where the given function is applied to the value inside the J , if any.` bearriver The time q) after which the event should be produced bearriverValue to produce at that time– bearriver The time q4 after which the event should be produced on average bearriver!Value to produce at time of event   !"#$%&'()*+,-./0123456789:;<=>?I@ABCDEFHGJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~€‚ƒ„…†‡ˆ‰Š‹ŒŽ‘’“”•–—˜™š›œ   !"#$%&'()*+,-./0123456789:;<=>?I@ABCDEFHGW0X0Y0Z0 Safe-Inferredžž   !"#$%&'()*+,-./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.13.3-KYADtB5RlJ4Fax0FKPEFOP FRP.BearRiver FRP.Yampabase Control.Arrowarrfirstapp|||loopleftApp^<<<<^>>^^>>returnA&&&***secondArrow runKleisliKleisli zeroArrow ArrowZero<+> ArrowPlus+++rightleft ArrowChoice ArrowApply ArrowMonad ArrowLoopControl.Category>>><<<"dunai-0.8.1-86Lo0JAJzodIhAhL3WK4ZUData.MonadicStreamFunction.UtilpauseOn traceWhen traceWithunfoldmealyaccumulateWith mappendFrommappendSsumFromsumScountfifonextiPostiPrewithSideEffect_withSideEffect mapMaybeSMStreamMSinkData.MonadicStreamFunction.CoremorphS liftTransS>>>^^>>> liftBaseS liftBaseMarrMconstM'Data.MonadicStreamFunction.InternalCoreembedfeedbackmorphGSMSF0simple-affine-space-0.1.1-9z4UBOU3doUGnBVZZgtpZFData.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 $fMonadEvent$fApplicativeEvent$fFunctorEvent $fEqEvent $fShowEventFutureSF GHC.MaybeMaybeNothingJustGHC.BaseidFunctorfmapMonad Applicative<*>