until -package:numeric-prelude -package:util -package:hedgehog package:rebase

until :: (a -> Bool) -> (a -> a) -> a -> a
rebase Rebase.Prelude
until p f yields the result of applying f until p holds.
untilRight :: (Monoid a, Selective f) => f (Either a b) -> f (a, b)
rebase Rebase.Prelude
Keep running an effectful computation until it returns a Right value, collecting the Left's using a supplied Monoid instance.