hjsonschema
witherable
Our great sponsors
| hjsonschema | witherable | |
|---|---|---|
| - | 4 | |
| 45 | 71 | |
| - | - | |
| 3.4 | 6.4 | |
| - | 6 months ago | |
| Haskell | Haskell | |
| MIT 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.
hjsonschema
We haven't tracked posts mentioning hjsonschema yet.
Tracking mentions began in Dec 2020.
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?
diskhash - Diskbased (persistent) hashtable
proto-lens - API for protocol buffers using modern Haskell language and library patterns.
compendium-client - Mu (μ) is a purely functional framework for building micro services.
rcu - experimenting with STM-backed read-copy-update in Haskell
typerep-map - ⚡️Efficient implementation of Map with types as keys
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
safecopy - An extension to Data.Serialize with built-in version control
discrimination - Fast linear time sorting and discrimination for a large class of data types
cereal
boombox - Seekable sources and efficient incremental sinks
critbit - A Haskell implementation of crit-bit trees.
data-kiln - Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable lazy structure