containers VS psqueues

Compare containers vs psqueues and see what are their differences.

containers

Assorted concrete container types (by haskell)

psqueues

Priority Search Queues in three different flavors for Haskell (by jaspervdj)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • Scout APM - Less time debugging, more time building
  • SaaSHub - Software Alternatives and Reviews
containers psqueues
6 1
287 61
1.4% -
4.7 2.5
6 days ago 7 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.

containers

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

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 | reddit.com/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 containers and psqueues you can also consider the following projects:

hevm - Dapp, Seth, Hevm, and more

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

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

fgl - A Functional Graph Library for Haskell

singletons - Fake dependent types in Haskell using singletons

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

adjunctions - Simple adjunctions

indexed-containers

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

EdisonAPI - Edison: A Library of Efficient Data Structures