|8 months ago||16 days 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.
-🎄- 2021 Day 15 Solutions -🎄-
127 projects | reddit.com/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.
An elegant approach to solve this problem?
1 project | reddit.com/r/haskell | 10 Jun 2022
Note that the list index operator has O(n) complexity. Ideally you'd want to use something like Seq from the containers package
Monthly Hask Anything (June 2022)
5 projects | reddit.com/r/haskell | 3 Jun 2022
Why is seemingly infinite (lazy) recursion faster?
2 projects | reddit.com/r/haskell | 24 May 2022
Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.
Haskell - Important Libraries
11 projects | reddit.com/r/haskell | 24 Mar 2022
Assessing Haskell (blogpost, slightly negative!)
3 projects | reddit.com/r/haskell | 30 Nov 2021
Calling linked lists Haskell's "primary data structure" seems off-base to me. Yes, there's String, yes, there's built-in syntax for List... but there's also everything in containers, and vector is pretty easy to use in practice, though it would probably be good for more learning material to mention it more prominently.
Is a a MONAD in Haskell just the functional equivalent of a generic type (such as in C#) and how do MONADs enable things like saving data?
1 project | reddit.com/r/haskell | 25 Nov 2021
Haskell has much more sophisticated immutable data structures, you can find them in the "containers" package: https://hackage.haskell.org/package/containers
Looking for projects that make heavy use of IntMap which have benchmarks
4 projects | reddit.com/r/haskell | 18 Sep 2021
I asked this on the libraries mailing list but thought posting here would bring in potentially more responses. I made a recent change to the behaviour of lookup and find (see here for more details: https://github.com/haskell/containers/pull/800).
Semver doesn't mean MAJOR.MINOR.PATCH, it means FAILS.FEATURES.BUGS
2 projects | reddit.com/r/programmingcirclejerk | 7 Aug 2021
Rust has nothing on Haskell. containers, which might as well be considered part of the standard library, has been out for almost 14 years and is still 0.x
Monthly Hask Anything (July 2021)
2 projects | reddit.com/r/haskell | 5 Jul 2021
When I was first learning I did a bunch of leetcode/codewars to get familiar with the containers library and GHCI repl workflow. Then using Real World Haskell as a reference I implemented a few coreutils to play with IO.
What are some alternatives?
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
hevm - Dapp, Seth, Hevm, and more
miso - :ramen: A tasty Haskell front-end framework
singletons - Fake dependent types in Haskell using singletons
EdisonAPI - Edison: A Library of Efficient Data Structures
adjunctions - Simple adjunctions
fgl - A Functional Graph Library for Haskell
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface