singletons VS fgl

Compare singletons vs fgl and see what are their differences.

singletons

Fake dependent types in Haskell using singletons (by goldfirere)

fgl

A Functional Graph Library for Haskell (by haskell)
Our great sponsors
  • SonarLint - Deliver Cleaner and Safer Code - Right in Your IDE of Choice!
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
singletons fgl
1 2
260 165
- 0.0%
5.8 0.0
9 days ago about 1 month ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

singletons

Posts with mentions or reviews of singletons. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-03-22.

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 -🎄-
    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?

When comparing singletons and fgl you can also consider the following projects:

psqueues - Priority Search Queues in three different flavors for Haskell

adjunctions - Simple adjunctions

miso - :ramen: A tasty Haskell front-end framework

containers - Assorted concrete container types

permutation - git import of patrick perry permutations lib from darcs

Sit - Prototypical type checker for Type Theory with Sized Natural Numbers

distributive - Dual Traversable

Agda - Agda is a dependently typed programming language / interactive theorem prover.

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface