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, base-compat Prelude.Compat, base-prelude BasePrelude, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, basic-prelude CorePrelude, ihaskell IHaskellPrelude, clash-prelude Clash.HaskellPrelude, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, ghc-internal GHC.Internal.Base, rebase Rebase.Prelude, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import
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 :: Firstable es es' (ISig s (es :+: es') a r) r' => Sig s es a r -> React s es' r' -> Sig s (es :+: es') a (Either r (a, r'))
moffy Control.Moffy Control.Moffy.NoThreadId
until :: Integral a => a -> Stream Bool -> Stream Bool -> Stream Bool
copilot-libraries Copilot.Library.LTL
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.
until :: (Typed a, Integral a) => a -> a -> Stream a -> a -> Stream Bool -> Stream Bool -> Stream Bool
copilot-libraries Copilot.Library.MTL
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.
until :: (ContiguousU arr, Element arr b) => (a -> Bool) -> Parser a e s b -> Parser a e s (arr b)
smith Data.Parser
Variant of foldUntil that collects elements into an array.