bitset
functor-friends
bitset | functor-friends | |
---|---|---|
- | - | |
12 | 3 | |
- | - | |
0.0 | 0.0 | |
almost 3 years ago | over 6 years ago | |
Haskell | Haskell | |
MIT 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.
bitset
We haven't tracked posts mentioning bitset yet.
Tracking mentions began in Dec 2020.
functor-friends
We haven't tracked posts mentioning functor-friends yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
containers - Assorted concrete container types
nonempty-containers - Efficient non-empty variants of containers data types, with full API
DrIFT - A mirror of DrIFT.
monadic-arrays - MArray instances for monad transformers
justified-containers - Standard containers, with keys that carry type-level proofs of their own presence.
naperian - Efficient representable functors
claferIG - Support for reasoning on Clafer models by instantiation and counter example generation.
heaps - Asymptotically optimal Brodal/Okasaki heaps
repa-array - High performance, regular, shape polymorphic parallel arrays.
void - Provides Data.Void, which is in base since ghc 7.8 or so
distributive - Dual Traversable