until -package:numeric-prelude -package:base-prelude -package:distribution-opensuse -package:Cabal is:exact -package:protolude -package:yesod-paginator -package:basic-prelude -package:netwire -package:llvm-hs-pure -package:classy-prelude -package:termonad -package:base -package:ghc-lib-parser -package:foundation
amazonka-core Amazonka.Prelude,
hedgehog Hedgehog.Internal.Prelude,
base-compat Prelude.Compat,
Cabal-syntax Distribution.Compat.Prelude,
ihaskell IHaskellPrelude,
github GitHub.Internal.Prelude,
numhask NumHask.Prelude,
clash-prelude Clash.HaskellPrelude,
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,
hledger-web Hledger.Web.Import 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.