nonempty-containers
bitset
| nonempty-containers | bitset | |
|---|---|---|
| - | - | |
| 25 | 13 | |
| - | - | |
| 4.8 | 0.0 | |
| 3 months ago | over 3 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | MIT 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.
nonempty-containers
We haven't tracked posts mentioning nonempty-containers yet.
Tracking mentions began in Dec 2020.
bitset
We haven't tracked posts mentioning bitset yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
hoq - A language based on homotopy type theory with an interval
functor-friends - Friendly helpers for your recursion schemes.
bookkeeper
monadic-arrays - MArray instances for monad transformers
psqueues - Priority Search Queues in three different flavors for Haskell
heaps - Asymptotically optimal Brodal/Okasaki heaps
flux-monoid - A monoid which counts changing values in a sequence
naperian - Efficient representable functors
selections - Haskell Package for operating with selections over an underlying functor
subwordgraph - An implementation of a classic Subword Graph (also known as Directed Acyclic Word Graph).