containers
Assorted concrete container types (by haskell)
EdisonAPI
Edison: A Library of Efficient Data Structures (by robdockins)
Our great sponsors
| containers | EdisonAPI | |
|---|---|---|
| 6 | 0 | |
| 287 | 52 | |
| 1.4% | - | |
| 4.8 | 0.0 | |
| 10 days ago | 11 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | MIT 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-03-24.
-
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.
-
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?
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
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.
EdisonAPI
Posts with mentions or reviews of EdisonAPI.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning EdisonAPI yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing containers and EdisonAPI you can also consider the following projects:
hevm - Dapp, Seth, Hevm, and more
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
psqueues - Priority Search Queues in three different flavors for Haskell
miso - :ramen: A tasty Haskell front-end framework
singletons - Fake dependent types in Haskell using singletons
adjunctions - Simple adjunctions
fgl - A Functional Graph Library for Haskell
indexed-containers
type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)
graph-wrapper - A wrapper around the standard Data.Graph with a less awkward interface
graphite - Haskell graphs and networks library