igraph vs containers

igraph

Incomplete Haskell bindings to the igraph library (which is written in C) (by giorgidze)

#Data structures

Source Code

containers

Assorted concrete container types (by haskell)

#Data structures

Source Code

hackage.haskell.org

Our great sponsors

SonarLint - Clean code begins in your IDE with SonarLint

InfluxDB - Access the most powerful time series database as a service

SaaSHub - Software Alternatives and Reviews

Our great sponsors

igraph		containers
	Project
0	Mentions	11
7	Stars	306
-	Growth	0.7%
0.0	Activity	3.5
about 10 years ago	Latest Commit	9 days ago
Haskell	Language	Haskell
BSD 3-clause "New" or "Revised" License	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.

igraph

Posts with mentions or reviews of igraph. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning igraph yet.
Tracking mentions began in Dec 2020.

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
2 projects | reddit.com/r/haskell | 30 Dec 2022

"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)
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

containers
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.
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.