flat
witherable
flat | witherable | |
---|---|---|
5 | 4 | |
60 | 71 | |
- | - | |
0.0 | 6.4 | |
over 1 year ago | 6 months ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" 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.
flat
-
Version 0.6 of Flat, a principled, portable and compact binary data format
Now we have Generically(1) in base (since 4.17) so any class with generic default methods can have an instance of Generically. I made an issue: https://github.com/Quid2/flat/issues/33
-
Version 0.6 of Flat
Version 0.6 of Flat, a principled, portable and compact binary data format is on Hackage.
-
Learn From Errors: Overlapping Instances
Here is link number 1 - Previous text "one"
witherable
-
CS SYD - A dancing space leak
Generic operations: mapMaybe and the witherable package are two good examples.
-
Version 0.6 of Flat, a principled, portable and compact binary data format
Yes or if you have instances of the polynomial functors, you can create a trivial instance like https://github.com/fumieval/witherable/issues/89
-
A functor is a container that implements map. Is there a special name for containers that implement filter or reduce?
I think filter would correspond to the Filterable class from witherable.
-
Name of operation
I'm not sure about the parts of the above implementation like takeOne though. I've used this takeOne few times. Also, traverse combined with catMaybes is a pattern captured in witherable package. Like this:
What are some alternatives?
text - Haskell library for space- and time-efficient operations over Unicode text.
proto-lens - API for protocol buffers using modern Haskell language and library patterns.
kind-generics
rcu - experimenting with STM-backed read-copy-update in Haskell
adjunctions - Simple adjunctions
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
symbiote - Data serialization verification implementation
boombox - Seekable sources and efficient incremental sinks
massiv - Efficient Haskell Arrays featuring Parallel computation
discrimination - Fast linear time sorting and discrimination for a large class of data types
data-kiln - Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure
make-monofoldable-foldable - A simple package with a wrapper to make a MonoFoldable type Foldable