type-level-sets VS psqueues

Compare type-level-sets vs psqueues and see what are their differences.

type-level-sets

Type-level sets for Haskell (with value-level counterparts and various operations) (by dorchard)
Data structures Type
Source Code
Suggest alternative
Edit details

psqueues

Priority Search Queues in three different flavors for Haskell (by jaspervdj)
Data structures
Source Code
hackage.haskell.org
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
type-level-sets psqueues
- 1
65 63
- -
0.0 5.2
4 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.

type-level-sets

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

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

EdisonAPI - Edison: A Library of Efficient Data Structures

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

type-level-bst - Type-Level Binary Search Tree in Haskell

fgl - A Functional Graph Library for Haskell

type-indexed-queues - Queues with verified and unverified versions

containers - Assorted concrete container types

distributive - Dual Traversable

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

permutation - git import of patrick perry permutations lib from darcs

graphite - Haskell graphs and networks library

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

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

type-level-sets vs EdisonAPI psqueues vs miso type-level-sets vs type-level-bst psqueues vs fgl type-level-sets vs type-indexed-queues psqueues vs containers type-level-sets vs distributive psqueues vs heap type-level-sets vs permutation psqueues vs graphite type-level-sets vs selections psqueues vs parameterized-utils