psqueues VS distributive

Compare psqueues vs distributive and see what are their differences.

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
psqueues distributive
1 6
63 41
- -
5.2 2.7
5 months ago 11 months ago
Haskell Haskell
BSD 3-clause "New" or "Revised" License GNU General Public License v3.0 or later
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.

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.

distributive

Posts with mentions or reviews of distributive. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-07-17.

What are some alternatives?

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

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

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

fgl - A Functional Graph Library for Haskell

containers - Assorted concrete container types

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

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

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

graphite - Haskell graphs and networks library

slist - ♾️ Sized list