|about 1 year ago||about 1 month ago|
|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.
We haven't tracked posts mentioning algebra-checkers yet.
Tracking mentions began in Dec 2020.
-🎄- 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?
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
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
haggle - An efficient graph library for Haskell
permutation - git import of patrick perry permutations lib from darcs
selections - Haskell Package for operating with selections over an underlying functor
nonempty-containers - Efficient non-empty variants of containers data types, with full API
Agda - Agda is a dependently typed programming language / interactive theorem prover.