until -package:numeric-prelude -package:util -package:xmonad-contrib -package:LambdaHack -package:protolude -package:base-compat -package:ghc-lib-parser -package:hedgehog -package:scalpel-core -package:free -package:conferer
base Prelude GHC.Base,
ghc GHC.Prelude.Basic,
base-prelude BasePrelude,
classy-prelude ClassyPrelude,
basic-prelude CorePrelude,
Cabal-syntax Distribution.Compat.Prelude,
github GitHub.Internal.Prelude,
numhask NumHask.Prelude,
foundation Foundation,
dimensional Numeric.Units.Dimensional.Prelude,
elerea FRP.Elerea.Simple.Pure,
rebase Rebase.Prelude,
mixed-types-num Numeric.MixedTypes.PreludeHiding,
linear-base Prelude.Linear,
cabal-install-solver Distribution.Solver.Compat.Prelude,
yesod-paginator Yesod.Paginator.Prelude,
distribution-opensuse OpenSuse.Prelude,
faktory Faktory.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.
Produce until the given event occurs. When it occurs, inhibit with its
value forever.
- Depends: now until event occurs.
- Inhibits: forever after event occurs.
Keep running an operation until it becomes a
Just, then return
the value inside the
Just as the result of the overall loop.
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_ ...
Repeat action until
f does not give
Nothing when applied
to result.
Repeat action until predicate
f is
True when applied to
result.
Negation of
whileM: execute an action so long as the boolean
returns false.
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
msf until the second one produces
True
from the output of the first.
Create a new serial context by moving the focus backward and
collecting nodes until the scraper matches the focused node. The
serial scraper is then executed on the collected nodes.