either
recursion-schemes
either | recursion-schemes | |
---|---|---|
3 | 20 | |
443 | 335 | |
3.4% | 0.3% | |
7.3 | 4.3 | |
19 days ago | 17 days ago | |
Rust | Haskell | |
Apache License 2.0 | BSD 2-clause "Simplified" 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.
either
-
What's the deal with Error Handling - Custom Error enum and the different libraries out there.
Restricting what can go into a Result in the error variant is quite restrictive. It's often very convenient to use Result as a sort of "this or that" type without any connotations about errors, particularly as an internal convenience. Arguably one might want to use either instead, but it's a lot of ceremony to bring that in for simple use cases.
-
Is there a RFE for this feature and if so, what is it called?
P.S. you can use either to make it work on stable rustc
-
Ask HN: Would you support government open source grants?
The European Union does not have as large a software industry as the USA so there would be a less strong argument of government/corporate competition. It could take the form of government grants depending on the size. My rationale is that governments benefit from the general prosperity of open source more so than solo authors or small companies.
I am restricting the scope to simple and small libraries where investment is more clearly beneficial unlike Tensorflow as that is large and complex.
Here is an extreme example, the 'either' crate is a 'rayon' dependency and many others. Paradoxically a project of this size likely does not need funding but it is really important.
https://github.com/bluss/either
recursion-schemes
-
-❄️- 2023 Day 4 Solutions -❄️-
Reasonably proud of my part 2 solution, although would like to try using a recursion scheme rather than unstructured recursion:
-
Interactive animations
Yeah, that project is pretty much at the bottom of my list, unfortunately. My top projects these days are mgmt, klister, recursion-schemes, and hint... And that's already too much!
-
Science of Recursion
In a programming context, recursion schemes can be used to write recursive (or corecursive) functions, by automating/abstracting away the common boilerplate part of actually doing the recursion. They take the form of polymorphic higher-order functions, which can be imported from a library like this classic one.
-
Is there a way to avoid call overhead?
Maybe I didn't link the best post. It is unfortunately the only one I know that uses Rust. If you are able to read Haskell, the documentation for the recursion-schemes package might be a better resource?
-
Ah yes I love arrays with a length of infinity!!!
Writing something as a type of fold over an infinite sequence is nicer than using recursion directly in my opinion. See: https://hackage.haskell.org/package/recursion-schemes
-
Tips on mastering recursion and trees and shit?
Consider recursion schemes! It let's you separate the logic of how your recursion is structured on your data, and the logic of what you're doing on each recursion stage. So e.g. you can write the core logic of a recursive linked list summation as just fun x accum -> x + accum, and then you just find the appropriate recursion scheme to pipe the list values into x and handle recursing to build accum (a catamorphism in this case)
-
So you come across an undocumented library…
It's a pretty complicated bug, documented in details at https://github.com/recursion-schemes/recursion-schemes/issues/50
-
Beautiful ideas in programming: generators and continuations
It’s also trivial and easy in Haskell — you just need an instance of `Foldable` or `Traversable` on your collection, and then you can fold or traverse it in a configurable way. Or for recursive structures, use https://hackage.haskell.org/package/recursion-schemes. Or even just pass a traversal function as an argument for maximum flexibility.
-
fromMaybe is Just a fold
https://hackage.haskell.org/package/recursion-schemes is the "normal" library for this type of generalized folding. It even contains Base instances for Maybe and Either.
-
Annotation via anamorphism?
I've been working on a system which uses recursion-schemes to annotate a recursive type. The annotated tree itself is pretty simple; at each level, we pair the annotation with the base functor, or
What are some alternatives?
distributed-process-platform - DEPRECATED (Cloud Haskell Platform) in favor of distributed-process-extras, distributed-process-async, distributed-process-client-server, distributed-process-registry, distributed-process-supervisor, distributed-process-task and distributed-process-execution
exceptions - mtl friendly exceptions
record - Anonymous records
tauri - Build smaller, faster, and more secure desktop applications with a web frontend.
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
categories - categories from category-extras
machines - Networks of composable stream transducers
streamproc - Haskell library providing a continuation-based stream processor arrow
chr-core - Constraint Handling Rules
pipes-core - Compositional pipelines