I1M VS psqueues

Compare I1M vs psqueues and see what are their differences.

I1M

Código Haskell usado en el curso de I1M (Informática de 1º de Matemática) (by jaalonso)

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
I1M psqueues
0 1
4 63
- -
0.0 5.2
almost 2 years ago 5 months ago
HTML Haskell
GNU General Public License v2.0 only 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.

I1M

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

We haven't tracked posts mentioning I1M 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 I1M and psqueues you can also consider the following projects:

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

fgl - A Functional Graph Library for Haskell

containers - Assorted concrete container types

graphite - Haskell graphs and networks library

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.

representable-functors - representable functors

selections - Haskell Package for operating with selections over an underlying functor

permutation - git import of patrick perry permutations lib from darcs

ethereum-client-haskell

nonempty-containers - Efficient non-empty variants of containers data types, with full API

haggle - An efficient graph library for Haskell