ixset-typed
psqueues
Our great sponsors
| ixset-typed | psqueues | |
|---|---|---|
| 1 | 1 | |
| 23 | 63 | |
| - | - | |
| 3.2 | 5.2 | |
| almost 2 years ago | 6 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.
ixset-typed
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?
ixset - A Set type which supports multiple indexes
miso - :ramen: A tasty Haskell front-end framework
multiset - multiset haskell package
fgl - A Functional Graph Library for Haskell
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
containers - Assorted concrete container types
nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
permutation - git import of patrick perry permutations lib from darcs
graphite - Haskell graphs and networks library
naperian - Efficient representable functors
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.