vinyl
Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode. (by VinylRecords)
fgl
A Functional Graph Library for Haskell (by haskell)
Our great sponsors
| vinyl | fgl | |
|---|---|---|
| 1 | 2 | |
| 247 | 166 | |
| 0.0% | 0.6% | |
| 5.3 | 0.0 | |
| about 1 month ago | 3 months ago | |
| Haskell | Haskell | |
| MIT License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
vinyl
Posts with mentions or reviews of vinyl.
We have used some of these posts to build our list of alternatives
and similar projects.
-
Typed Markdown Revisited
I would also like to see how this compares with data types à la carte or an extensible records solution like vinyl.
fgl
Posts with mentions or reviews of fgl.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-12-11.
-
-🎄- 2021 Day 12 Solutions -🎄-
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 -🎄-
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?
When comparing vinyl and fgl you can also consider the following projects:
slist - ♾️ Sized list
psqueues - Priority Search Queues in three different flavors for Haskell
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
adjunctions - Simple adjunctions
miso - :ramen: A tasty Haskell front-end framework
graphite - Haskell graphs and networks library
Agda - Agda is a dependently typed programming language / interactive theorem prover.
rawr - Anonymous extensible records and variant types
distributive - Dual Traversable
containers - Assorted concrete container types
ethereum-client-haskell