exceptions
funflow
exceptions | funflow | |
---|---|---|
1 | 3 | |
48 | 360 | |
- | -0.3% | |
5.4 | 3.5 | |
13 days ago | 3 months ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
exceptions
-
Async Control Flow
I see. Do you think rethrowing the original exception is the the right approach in all cases, or only in this case? In the documentation I wrote for the exceptions package, I recommend to let the release block's exceptions take priority, to match base's behavior. Should I recommend the opposite?
funflow
-
Is there anything like funflow for rust?
funflow is a cool library for writing "workflows", but basically it's a library that implements caching. So if you have a process that reads a file A, does transformation A → B, then does B → C, then C → D, then writes D to disk, each step of that will be cached to disk and you won't need to redo the A → B step if your program crashes during the B → C step.
-
Need a reason to start Haskell learning
You might wanna check out funflow
-
Experiences with workflow managers implemented in Haskell (funflow, porcupine, bioshake, ?)
Funflow: https://github.com/tweag/funflow
What are some alternatives?
either - the EitherT monad transformer
ChannelT - Generalized stream processors
control-monad-exception - Explicitly Typed exceptions as a library
hask - Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)
failure - A simple type class for success/failure computations.
lens-tutorial - The missing tutorial module for the lens library
categories - categories from category-extras
apecs - a fast, extensible, type driven Haskell ECS framework for games
control-monad-omega - A Haskell monad for fair enumeration of infinite sets.
selective - Selective Applicative Functors: Declare Your Effects Statically, Select Which to Execute Dynamically
recursion-schemes - Generalized bananas, lenses and barbed wire