until -package:numeric-prelude -package:base-prelude -package:LambdaHack -package:monad-loops -package:netwire -package:IfElse is:exact

until :: (a -> Bool) -> (a -> a) -> a -> a
base Prelude GHC.Base, hedgehog Hedgehog.Internal.Prelude, ghc GHC.Prelude.Basic, base-compat Prelude.Compat, protolude Protolude Protolude.Base, 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, 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.
until :: Monad m => (a -> Bool) -> m a -> m a
utility-ht Control.Monad.HT
repeat action until result fulfills condition
until :: () => (a -> Bool) -> (a -> a) -> a -> a
prelude-compat Prelude2010
until p f yields the result of applying f until p holds.