heap VS psqueues

Compare heap vs psqueues and see what are their differences.

heap

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. (by pruvisto)
Data structures
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 - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
heap psqueues
- 1
6 63
- -
0.0 5.2
about 3 years 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.

heap

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

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

btree-concurrent - A backend agnostic, concurrent BTree written in Haskell

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

bytestring-trie - An efficient finite map from (byte)strings to values.

fgl - A Functional Graph Library for Haskell

multiset - multiset haskell package

containers - Assorted concrete container types

naperian - Efficient representable functors

graphite - Haskell graphs and networks library

safer-file-handles - Type-safe file handling

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

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

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

heap vs btree-concurrent psqueues vs miso heap vs bytestring-trie psqueues vs fgl heap vs multiset psqueues vs containers heap vs naperian psqueues vs graphite heap vs safer-file-handles psqueues vs parameterized-utils heap vs vinyl psqueues vs nonempty-containers