text
containers
Our great sponsors
text | containers | |
---|---|---|
13 | 11 | |
395 | 313 | |
0.5% | -0.3% | |
8.4 | 6.2 | |
1 day ago | 6 days ago | |
C++ | Haskell | |
BSD 2-clause "Simplified" 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.
text
- Super Colliding Nix Stores: Nix Flakes for Millions of Developers
-
The Spinnaker Programming Language
String is a linked list of UTF-32 codepoints, which is just as bad as it sounds. Haskell programmers usually use Text from the text package instead.
-
[ANN] GHCup-0.1.19.0 released
This is the first release that was executed via the new GitHub CI. Everything went smoothly, except for an unexpected packaging bug on windows due to text-2.0 linking against libstdc++ by default.
-
Limits of possible performance improvements of Haskell/GHC code?
In addition to what's mentioned, the "default" libraries people use are often not the best-performing ones. E.g. Data.Vector.Hashtables is often much faster than Data.HashMap.Strict (which again is typically faster than Data.Map). And we find performance papercuts in common libraries that may simply be due to not enough people optimising for speed.
-
What is the idiomatic way to test "hidden" module functions in a Cabal project
Used by nearly every Haskell project: https://hackage.haskell.org/package/text 60% of the modules are ".Internal".
- Monthly Hask Anything (June 2022)
-
Haskell - Important Libraries
text
-
Switch internal representation to UTF8 by Bodigrim · Pull Request #365 · haskell/text
Here is a representative patch for text: https://github.com/haskell/text/pull/365/commits/37a2157245457a287d638bbceb472fe93b71f224 Hopefully it clarifies why achieving C performance is problematic even if you have enough primitive operations.
- Size hints for streams in text package
-
Can I wait forever without getLine?
I want to run an app in a Docker container, but detached. This causes getLine to throw an EOF exception, since the terminal detaches. That is, if I understand this thread correctly https://github.com/haskell/text/issues/258.
containers
-
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).
-
How are Lists & Sequences (from containers package) control structures?
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?
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)
-
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.
-
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
What are some alternatives?
attempt - Concrete data type for handling extensible exceptions as failures.
singletons - Fake dependent types in Haskell using singletons
base58string - Bitcoin script compilation, manipulation and decompilation
EdisonAPI - Edison: A Library of Efficient Data Structures
algebraic-classes - Conversions between algebraic classes and F-algebras.
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
text-trie - An efficient finite map from Text to values, based on bytestring-trie.
hevm - Dapp, Seth, Hevm, and more
gps2htmlReport - Generates a HTML page report detailing a GPS journey, with charts, statistics and an OpenStreetMap graphic.
miso - :ramen: A tasty Haskell front-end framework
text-binary - Binary instances for strict and lazy Text data types
indexed-containers