singletons VS psqueues

Compare singletons vs psqueues and see what are their differences.

singletons

Fake dependent types in Haskell using singletons (by goldfirere)

psqueues

Priority Search Queues in three different flavors for Haskell (by jaspervdj)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
singletons psqueues
2 1
282 63
- -
6.3 5.2
3 months ago 6 months 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.

psqueues

Posts with mentions or reviews of psqueues. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-12-14.
  • -🎄- 2021 Day 15 Solutions -🎄-
    127 projects | /r/adventofcode | 14 Dec 2021
    A super-ugly Dijkstra implementation with psqueues for priority queues. Before I took them into use the first part took ~10 sec, after that it's ~60ms, and 2.5s for the second part. I believe, there's still room for optimization, but it's enough for today.

What are some alternatives?

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

containers - Assorted concrete container types

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

helf - Haskell implementation of the Edinburgh Logical Framework

fgl - A Functional Graph Library for Haskell

permutation - git import of patrick perry permutations lib from darcs

cubical - Implementation of Univalence in Cubical Sets

heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.

graphite - Haskell graphs and networks library

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