heaps
Asymptotically optimal Brodal/Okasaki heaps (by ekmett)
void
Provides Data.Void, which is in base since ghc 7.8 or so (by ekmett)
Our great sponsors
| heaps | void | |
|---|---|---|
| 1 | - | |
| 29 | 19 | |
| - | - | |
| 0.0 | 0.0 | |
| about 1 year ago | about 2 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" 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.
heaps
Posts with mentions or reviews of heaps.
We have used some of these posts to build our list of alternatives
and similar projects.
-
What's "One Cool Thing" about OCaml? I.e. some piece of code or language concept which is more elegant or powerful in ocaml than in most or all other mainstream languages, but that could be explained to a room of unfamiliar cs majors in under five minutes?
You can implement all this in Haskell (and Kmett has), but the double-layer functor presentation is beautiful in its expression of recursion and memoization through the composition of first-class modules. Yes, you could do this with typeclasses in Haskell, but typeclasses but I think there's just an element of elegance to first-class modules that can't be found with typeclasses. (Not the mention Haskell's horridly bare-bones module system.)
void
Posts with mentions or reviews of void.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning void yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing heaps and void you can also consider the following projects:
fgl - A Functional Graph Library for Haskell
justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.
EdisonAPI - Edison: A Library of Efficient Data Structures
repa-array - High performance, regular, shape polymorphic parallel arrays.
helf - Haskell implementation of the Edinburgh Logical Framework
miso - :ramen: A tasty Haskell front-end framework
flux-monoid - A monoid which counts changing values in a sequence
map-syntax - Syntax sugar and explicit semantics for statically defined maps
naperian - Efficient representable functors
hoq - A language based on homotopy type theory with an interval