containers VS graph-wrapper

containers

• Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
  2 projects | /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).

• How are Lists & Sequences (from containers package) control structures?
  1 project | /r/haskell | 22 Jul 2022

  Indeed it's rather subtle. See https://github.com/haskell/containers/issues/752 for more discussion on the matter. Nonetheless, I believe it is "spine strict" in the sense that thunks for all values always exist, even if the spine that holds them can be rearranged due to laziness.

• An elegant approach to solve this problem?
  1 project | /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 | /r/haskell | 3 Jun 2022
• Why is seemingly infinite (lazy) recursion faster?
  2 projects | /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 | /r/haskell | 24 Mar 2022

  containers

• Assessing Haskell (blogpost, slightly negative!)
  3 projects | /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 | /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 | /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 | /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

graph-wrapper

We haven't tracked posts mentioning graph-wrapper yet.
Tracking mentions began in Dec 2020.