nonempty-containers
Efficient non-empty variants of containers data types, with full API (by mstksg)
bitset
A compact functional set data structure (by lambda-llama)
| nonempty-containers | bitset | |
|---|---|---|
| - | - | |
| 26 | 13 | |
| - | - | |
| 6.0 | 0.0 | |
| about 1 month ago | about 4 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | MIT 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.
nonempty-containers
Posts with mentions or reviews of nonempty-containers.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning nonempty-containers yet.
Tracking mentions began in Dec 2020.
bitset
Posts with mentions or reviews of bitset.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning bitset yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing nonempty-containers and bitset you can also consider the following projects:
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
repa-array - High performance, regular, shape polymorphic parallel arrays.
heaps - Asymptotically optimal Brodal/Okasaki heaps
selections - Haskell Package for operating with selections over an underlying functor
functor-friends - Friendly helpers for your recursion schemes.