almost-fix alternatives and similar packages
Based on the "Unclassified" category.
Alternatively, view almost-fix alternatives based on common mentions on social networks and blogs.
-
-
-
-
-
-
-
-
bit-stream
Lazy infinite compact streams with cache-friendly O(1) indexing and applications for memoization -
-
-
-
-
-
-
-
dependent-sum-template
DISCONTINUED. Template Haskell code to generate instances of classes in dependent-sum package -
-
argon2
Haskell bindings to libargon2 - the reference implementation of the Argon2 password-hashing function -
-
-
-
-
-
-
-
-
-
-
-
network-carbon
A Haskell implementation of the Carbon protocol (part of the Graphite monitoring tools) -
CodeRabbit: AI Code Reviews for Developers
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of almost-fix or a related project?
README
almost-fix
Combinators for predicative recursion
Usage
Simple Predicative Recursion
Say you want to perform f until some boolean test b:
almostFix b f
will run f until b returns False.
almostFix True f ~ f . f . f ...
Monadic Predicates
Say you've got a monadic step f :: a -> m a, and some boolean test in the
monad b :: m Bool - a good example of this would be in a MonadState Integer m
stateful monad, and the monadic predicate liftM (< 5) get :: m Bool. Now, we
bind until the predicate is falsified:
exclaimAgain :: MonadState Integer m => String -> m String
exclaimAgain a = do modify (+1)
return (a ++ "!")
exclaimFive :: String -> String
exclaimFive s = evalState (almostFix (liftM (<= 5) get) exclaimAgain s) 1