until -package:numeric-prelude -package:language-bash -package:base-compat -package:conferer -package:netwire -package:hledger-web -package:IfElse -package:free
base Prelude GHC.Base,
hedgehog Hedgehog.Internal.Prelude,
ghc GHC.Prelude.Basic,
protolude Protolude Protolude.Base,
base-prelude BasePrelude,
classy-prelude ClassyPrelude,
basic-prelude CorePrelude,
Cabal-syntax Distribution.Compat.Prelude,
github GitHub.Internal.Prelude,
numhask NumHask.Prelude,
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,
yesod-paginator Yesod.Paginator.Prelude,
distribution-opensuse OpenSuse.Prelude,
faktory Faktory.Prelude,
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.
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.
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.
Create a new serial context by moving the focus forward and collecting
nodes until the scraper matches the focused node. The serial scraper
is then executed on the collected nodes.
The provided serial scraper is unable to see nodes outside the new
restricted context.
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.
Create a new serial context by moving the focus forward and collecting
nodes until the scraper matches the focused node. The serial scraper
is then executed on the collected nodes.
The provided serial scraper is unable to see nodes outside the new
restricted context.