adjunctions
Simple adjunctions (by ekmett)
psqueues
Priority Search Queues in three different flavors for Haskell (by jaspervdj)
Our great sponsors
| adjunctions | psqueues | |
|---|---|---|
| 1 | 1 | |
| 44 | 63 | |
| - | - | |
| 3.3 | 5.2 | |
| 7 months ago | 6 months ago | |
| Haskell | Haskell | |
| GNU General Public License v3.0 or later | 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.
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.
adjunctions
Posts with mentions or reviews of adjunctions.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-11-16.
-
Version 0.6 of Flat, a principled, portable and compact binary data format
To specify a representing type I can generically derive Representable via More a `ShapedBy` [a].
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 -🎄-
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 adjunctions 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.
containers - Bitnami container images