containers
Assorted concrete container types (by haskell)
distributive
Dual Traversable (by ekmett)
Our great sponsors
| containers | distributive | |
|---|---|---|
| 11 | 6 | |
| 306 | 41 | |
| 0.3% | - | |
| 3.6 | 0.0 | |
| 13 days ago | 3 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
containers
Posts with mentions or reviews of containers.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-30.
-
Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
"Make invalid laziness unrepresentable" means you should use strict versions of container types instead of lazy ones. However, for better or for worse, sometimes the "strict version" of a data type is not actually a strict data type, it's just a strict API to the lazy type. Examples include Data.Map.Strict (not Data.Map or Data.Map.Lazy) or Data.HashMap.Strict (not Data.HashMap.Lazy) (sadly there is no Data.Sequence.Strict but perhaps there will be one day).
- Monthly Hask Anything (June 2022)
-
Why is seemingly infinite (lazy) recursion faster?
Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.
-
Haskell - Important Libraries
containers
-
Assessing Haskell (blogpost, slightly negative!)
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.
-
Looking for projects that make heavy use of IntMap which have benchmarks
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
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)
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.
distributive
Posts with mentions or reviews of distributive.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-17.
- stack
-
Is there an idiomatic way to have a record but with enum values as keys?
Moving discussion to a github issue.
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)
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.
What are some alternatives?
When comparing containers and distributive you can also consider the following projects:
singletons - Fake dependent types in Haskell using singletons
EdisonAPI - Edison: A Library of Efficient Data Structures
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
hevm - Dapp, Seth, Hevm, and more
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
indexed-containers
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
adjunctions - Simple adjunctions
fgl - A Functional Graph Library for Haskell