|over 6 years ago||8 months ago|
|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.
We haven't tracked posts mentioning ethereum-client-haskell yet.
Tracking mentions began in Dec 2020.
-🎄- 2021 Day 12 Solutions -🎄-
145 projects | reddit.com/r/adventofcode | 11 Dec 2021
Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-🎄- 2021 Day 9 Solutions -🎄-
185 projects | reddit.com/r/adventofcode | 8 Dec 2021
For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.
What are some alternatives?
miso - :ramen: A tasty Haskell front-end framework
hevm - Dapp, Seth, Hevm, and more
containers - Assorted concrete container types
Agda - Agda is a dependently typed programming language / interactive theorem prover.
ethereum-analyzer - An Ethereum contract analyzer.
adjunctions - Simple adjunctions
distributive - Dual Traversable
EdisonAPI - Edison: A Library of Efficient Data Structures
psqueues - Priority Search Queues in three different flavors for Haskell
graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)