until -package:numeric-prelude -package:streaming -package:util -package:scalpel-core -package:hosc -package:singletons-base -package:netwire -package:probability -package:scalpel
base Prelude GHC.Base,
amazonka-core Amazonka.Prelude,
hedgehog Hedgehog.Internal.Prelude,
base-compat Prelude.Compat,
protolude Protolude Protolude.Base,
base-prelude BasePrelude,
classy-prelude ClassyPrelude,
Cabal-syntax Distribution.Compat.Prelude,
basic-prelude CorePrelude,
ihaskell IHaskellPrelude,
github GitHub.Internal.Prelude,
numhask NumHask.Prelude,
clash-prelude Clash.HaskellPrelude,
foundation Foundation,
ghc-lib-parser GHC.Prelude.Basic,
dimensional Numeric.Units.Dimensional.Prelude,
elerea FRP.Elerea.Simple.Pure,
rebase Rebase.Prelude,
mixed-types-num Numeric.MixedTypes.PreludeHiding,
xmonad-contrib XMonad.Config.Prime,
linear-base Prelude.Linear,
LambdaHack Game.LambdaHack.Core.Prelude,
cabal-install-solver Distribution.Solver.Compat.Prelude,
faktory Faktory.Prelude,
yesod-paginator Yesod.Paginator.Prelude,
distribution-opensuse OpenSuse.Prelude,
hledger-web Hledger.Web.Import,
termonad Termonad.Prelude until p f yields the result of applying
f
until
p holds.
repeat action until result fulfills condition
until p f yields the result of applying
f
until
p holds.
until n s0 s1 means that
eventually n s1, and up
until at least the period before
s1 holds,
s0
continuously holds.
Note: Both argument streams must have sufficient history to
drop n values from them.
True until another stream is true, within the time bounds specified.
until l u clk dist s0 s1 is true at time t iff there
exists a d, with l <= d <= u, such that
s1 is true at time (t + d), and for all times
t' with t <= t' < t + d, s0 is true
at those times.
Keep running an operation until it becomes a
Just, then return
the value inside the
Just as the result of the overall loop.
Repeatedly run a computation until it produces a
Just value.
This can be useful when paired with a monad that has side effects.
For example, we may have
genId :: IO (Maybe Id) that uses a
random number generator to allocate ids, but fails if it finds a
collision. We can repeatedly run this with
retract (untilJust genId) :: IO Id
Run the supplied
Maybe computation repeatedly until it returns
a value. Returns that value.
Execute an action repeatedly until the condition expression returns
True. The condition is evaluated after the loop body. Collects results
into a list. Parameters are arranged for infix usage. eg. do {...}
untilM_ ...
Execute an action repeatedly until the condition expression returns
True. The condition is evaluated after the loop body. Collects results
into a
MonadPlus value. Parameters are arranged for infix
usage. eg. do {...}
untilM_ ...
Execute an action repeatedly until the condition expression returns
True. The condition is evaluated after the loop body. Discards
results. Parameters are arranged for infix usage. eg. do {...}
untilM_ ...
Negation of
whileM: execute an action so long as the boolean
returns false.
This utility function run a list of IO actions and returns the first
that return a
Just, if no one does, returns
Nothing
Keep running an effectful computation until it returns a
Right value, collecting the Left's using a supplied
Monoid instance.
Similar to Yampa's delayed switching. Loses a b in case of an
exception.
Run the first automaton until the second one produces
True from
the output of the first.
Create a spline from a stream and an event stream. The spline uses the
stream's values as its own output values. The spline will run until
the event stream produces an event, at that point the last known
output value and the event value are tupled and returned as the
spline's result.