psqueues VS graphite

Compare psqueues vs graphite 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
Suggest alternative
Edit details

graphite

Haskell graphs and networks library (by alx741)
Data structures Graphs Haskell Library
Source Code
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
psqueues graphite
1 -
63 31
- -
5.2 0.0
6 months ago about 2 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.

graphite

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

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

What are some alternatives?

When comparing psqueues and graphite you can also consider the following projects:

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

fgl - A Functional Graph Library for Haskell

rawr - Anonymous extensible records and variant types

containers - Assorted concrete container types

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

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

bookkeeper

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

adjunctions - Simple adjunctions

psqueues vs miso graphite vs miso psqueues vs fgl graphite vs rawr psqueues vs containers graphite vs bytestring-trie psqueues vs heap graphite vs bookkeeper psqueues vs parameterized-utils graphite vs vinyl psqueues vs nonempty-containers graphite vs adjunctions