|5 months ago||3 months 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.
7 projects | /r/haskell | 17 Jul 2022
Is there an idiomatic way to have a record but with enum values as keys?
2 projects | /r/haskell | 15 Jun 2022
Moving discussion to a github issue.2 projects | /r/haskell | 15 Jun 2022
The part I was referring to is https://github.com/ekmett/distributive/blob/7f25d1013403d1c5d507cfbeaab75c0ae188918d/src/Data/HKD/Record/Internal.hs which can be indexed by https://github.com/ekmett/hkd/blob/85cee5aa594b66f2d03d6366df776ced742e4635/src/Data/HKD/Index/Internal.hs#L40
Monthly Hask Anything (November 2021)
4 projects | /r/haskell | 2 Nov 2021
Seems like a neat signature. Is it an instance of some deeper concept or property? Is there a general typeclass for it? It looks a little bit like distribute from distributive.
Library for Tree-like data structure
2 projects | /r/haskell | 3 Oct 2022
I am about to start a new project in Haskell, model checking with (new) tree-like data structures. I think it is best to start building on a library such that i can already have elegant base functions, yet i am wondering what library is currently the standard? I read about fgl ( https://hackage.haskell.org/package/fgl ), yet it is a very old library.
-🎄- 2021 Day 12 Solutions -🎄-
145 projects | /r/adventofcode | 11 Dec 2021
Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-🎄- 2021 Day 9 Solutions -🎄-
185 projects | /r/adventofcode | 8 Dec 2021
For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.
What are some alternatives?
Agda - Agda is a dependently typed programming language / interactive theorem prover.
miso - :ramen: A tasty Haskell front-end framework
psqueues - Priority Search Queues in three different flavors for Haskell
adjunctions - Simple adjunctions
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
slist - ♾️ Sized list
containers - Assorted concrete container types
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)