data-r-tree
Haskell implementatio of R-Trees (by sebastian-philipp)
containers
Assorted concrete container types (by haskell)
Our great sponsors
| data-r-tree | containers | |
|---|---|---|
| - | 11 | |
| 12 | 313 | |
| - | -0.3% | |
| 4.7 | 6.0 | |
| 20 days ago | 9 days ago | |
| Haskell | Haskell | |
| MIT 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.
data-r-tree
Posts with mentions or reviews of data-r-tree.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning data-r-tree 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
"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?
When comparing data-r-tree and containers you can also consider the following projects:
data-forest - A simple multi-way tree data structure
singletons - Fake dependent types in Haskell using singletons
data-stringmap - Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet
EdisonAPI - Edison: A Library of Efficient Data Structures
data-clist - A purely functional ring data structure for Haskell.
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
permutation - git import of patrick perry permutations lib from darcs
hevm - Dapp, Seth, Hevm, and more
tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.
miso - :ramen: A tasty Haskell front-end framework
monadic-arrays - MArray instances for monad transformers
indexed-containers
data-r-tree vs data-forest
containers vs singletons
data-r-tree vs data-stringmap
containers vs EdisonAPI
data-r-tree vs data-clist
containers vs igraph
data-r-tree vs permutation
containers vs hevm
data-r-tree vs tie-knot
containers vs miso
data-r-tree vs monadic-arrays
containers vs indexed-containers