permutation
psqueues
Our great sponsors
permutation | psqueues | |
---|---|---|
0 | 1 | |
8 | 63 | |
- | - | |
0.0 | 5.2 | |
almost 6 years ago | 5 months ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
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.
permutation
We haven't tracked posts mentioning permutation yet.
Tracking mentions began in Dec 2020.
psqueues
-
-🎄- 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?
miso - :ramen: A tasty Haskell front-end framework
multiset - multiset haskell package
fgl - A Functional Graph Library for Haskell
Agda - Agda is a dependently typed programming language / interactive theorem prover.
containers - Assorted concrete container types
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
graphite - Haskell graphs and networks library
singletons - Fake dependent types in Haskell using singletons
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
repa-array - High performance, regular, shape polymorphic parallel arrays.
representable-functors - representable functors