psqueues VS selections

Compare psqueues vs selections and see what are their differences.

psqueues

Priority Search Queues in three different flavors for Haskell (by jaspervdj)
#Data structures
Source Code
hackage.haskell.org

selections

Haskell Package for operating with selections over an underlying functor (by ChrisPenner)
#Data structures
Source Code
Our great sponsors
  • Revelo Payroll - Free Global Payroll designed for tech teams
  • Onboard AI - Learn any GitHub repo in 59 seconds
  • InfluxDB - Collect and Analyze Billions of Data Points in Real Time
  • SonarLint - Clean code begins in your IDE with SonarLint
Our great sponsors
psqueues selections
1 0
63 22
- -
0.0 0.0
4 months ago almost 3 years 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.

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.

selections

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

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

What are some alternatives?

When comparing psqueues and selections 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

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)

ethereum-client-haskell

permutation - git import of patrick perry permutations lib from darcs

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

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

representable-functors - representable functors

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

psqueues vs miso
psqueues vs fgl
psqueues vs containers
psqueues vs graphite
psqueues vs parameterized-utils
selections vs type-level-sets
psqueues vs ethereum-client-haskell
psqueues vs permutation
psqueues vs Agda
psqueues vs nonempty-containers
psqueues vs representable-functors
psqueues vs heap