until -package:numeric-prelude -package:yesod-paginator -package:prelude-compat -package:numhask -package:dimensional is:exact -package:elerea -package:hedgehog -package:ghc -package:protolude

until :: (a -> Bool) -> (a -> a) -> a -> a
base Prelude GHC.Base, Cabal Distribution.Compat.Prelude.Internal, base-prelude BasePrelude, classy-prelude ClassyPrelude, basic-prelude CorePrelude, foundation Foundation, clash-prelude Clash.HaskellPrelude, ghc-lib-parser GHC.Prelude, llvm-hs-pure LLVM.Prelude, rebase Rebase.Prelude, xmonad-contrib XMonad.Config.Prime, linear-base Prelude.Linear, LambdaHack Game.LambdaHack.Core.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, 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.
until :: Monad m => (a -> Bool) -> m a -> m a
utility-ht Control.Monad.HT
repeat action until result fulfills condition
until :: (Monoid e) => Wire s e m (a, Event b) a
netwire Control.Wire.Interval
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 :: () => (a -> Bool) -> (a -> a) -> a -> a
intro Intro
until p f yields the result of applying f until p holds.