EdisonAPI VS psqueues

Compare EdisonAPI vs psqueues and see what are their differences.

EdisonAPI

Edison: A Library of Efficient Data Structures (by robdockins)

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
EdisonAPI psqueues
- 1
53 63
- -
3.7 5.2
4 months ago 6 months ago
Haskell Haskell
MIT 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.

EdisonAPI

Posts with mentions or reviews of EdisonAPI. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning EdisonAPI yet.
Tracking mentions began in Dec 2020.

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 EdisonAPI and psqueues you can also consider the following projects:

containers - Assorted concrete container types

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

exposed-containers - A redistribution of 'containers', with all hidden modules exposed.

fgl - A Functional Graph Library for Haskell

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

multiset - multiset haskell package

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

graphite - Haskell graphs and networks library

ethereum-client-haskell

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