until -package:clash-prelude -package:utility-ht -package:hledger-web -package:linear-base -package:monad-loops package:numeric-prelude

until :: (a -> Bool) -> (a -> a) -> a -> a
numeric-prelude NumericPrelude NumericPrelude.Base
until p f yields the result of applying f until p holds.
takeUntilRepetition :: Ord a => [a] -> [a]
numeric-prelude MathObj.Permutation.CycleList
candidates for Utility ?
takeUntilRepetitionSlow :: Eq a => [a] -> [a]
numeric-prelude MathObj.Permutation.CycleList
trimUntil :: Exponent -> T -> T
numeric-prelude Number.Positional
Trim until a minimum exponent is reached. Safe for zeros.