until -package:numeric-prelude -package:yesod-paginator -package:prelude-compat -package:numhask -package:clash-prelude -package:ghc-lib-parser -package:base is:exact -package:mixed-types-num -package:classy-prelude -package:elerea -package:cabal-install-solver -package:protolude -package:xmonad-contrib
amazonka-core Amazonka.Prelude,
hedgehog Hedgehog.Internal.Prelude,
base-compat Prelude.Compat,
base-prelude BasePrelude,
Cabal-syntax Distribution.Compat.Prelude,
basic-prelude CorePrelude,
ihaskell IHaskellPrelude,
github GitHub.Internal.Prelude,
foundation Foundation,
dimensional Numeric.Units.Dimensional.Prelude,
rebase Rebase.Prelude,
linear-base Prelude.Linear,
LambdaHack Game.LambdaHack.Core.Prelude,
faktory Faktory.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
Produce until the given event occurs. When it occurs, inhibit with its
value forever.
- Depends: now until event occurs.
- Inhibits: forever after event occurs.
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.