Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. pseq :: a -> b -> b

    rebase Rebase.Prelude

    No documentation available.

  2. seq :: a -> b -> b

    rebase Rebase.Prelude

    The value of seq a b is bottom if a is bottom, and otherwise equal to b. In other words, it evaluates the first argument a to weak head normal form (WHNF). seq is usually introduced to improve performance by avoiding unneeded laziness. A note on evaluation order: the expression seq a b does not guarantee that a will be evaluated before b. The only guarantee given by seq is that the both a and b will be evaluated before seq returns a value. In particular, this means that b may be evaluated before a. If you need to guarantee a specific order of evaluation, you must use the function pseq from the "parallel" package.

  3. sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()

    rebase Rebase.Prelude

    Evaluate each action in the structure from left to right, and ignore the results. For a version that doesn't ignore the results see sequenceA. sequenceA_ is just like sequence_, but generalised to Applicative actions.

    Examples

    Basic usage:
    >>> sequenceA_ [print "Hello", print "world", print "!"]
    "Hello"
    "world"
    "!"
    

  4. SequentialProxy :: forall cl1 cl2 . ClockProxy cl1 -> ClockProxy cl2 -> ClockProxy (SequentialClock cl1 cl2)

    rhine FRP.Rhine.Clock.Proxy

    No documentation available.

  5. collectSequence :: forall (m :: Type -> Type) cl1 cl2 a . Monad m => ResamplingBuffer m cl1 cl2 a (Seq a)

    rhine FRP.Rhine.ResamplingBuffer.Collect

    Reimplementation of collect with sequences, which gives a performance benefit if the sequence needs to be reversed or searched.

  6. Sequential :: forall (m :: Type -> Type) clab clcd a b1 c b . (Clock m clab, Clock m clcd, Clock m (Out clab), Clock m (Out clcd), Clock m (In clab), Clock m (In clcd), GetClockProxy clab, GetClockProxy clcd, Time clab ~ Time clcd, Time clab ~ Time (Out clab), Time clcd ~ Time (In clcd)) => SN m clab a b1 -> ResamplingBuffer m (Out clab) (In clcd) b1 c -> SN m clcd c b -> SN m (SequentialClock clab clcd) a b

    rhine FRP.Rhine.SN

    Two SNs may be sequentially composed if there is a matching ResamplingBuffer between them.

  7. type SeqClock cl1 cl2 = SequentialClock cl1 cl2

    rhine FRP.Rhine.Schedule

    Abbrevation synonym.

  8. data SequentialClock cl1 cl2

    rhine FRP.Rhine.Schedule

    Two clocks can be combined with a schedule as a clock for an asynchronous sequential composition of signal networks.

  9. SequentialClock :: cl1 -> cl2 -> SequentialClock cl1 cl2

    rhine FRP.Rhine.Schedule

    No documentation available.

  10. SequentialLastTime :: forall cl1 cl2 . LastTime cl1 -> LastTime cl2 -> LastTime (SequentialClock cl1 cl2)

    rhine FRP.Rhine.Schedule

    No documentation available.

Page 501 of many | Previous | Next