hw-fingertree-strict
representable-functors
hw-fingertree-strict | representable-functors | |
---|---|---|
- | - | |
2 | 9 | |
- | - | |
0.0 | 0.0 | |
over 1 year ago | over 10 years ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" 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.
hw-fingertree-strict
We haven't tracked posts mentioning hw-fingertree-strict yet.
Tracking mentions began in Dec 2020.
representable-functors
We haven't tracked posts mentioning representable-functors yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)
ethereum-client-haskell
exposed-containers - A redistribution of 'containers', with all hidden modules exposed.
fgl - A Functional Graph Library for Haskell
hw-fingertree
psqueues - Priority Search Queues in three different flavors for Haskell
containers - Assorted concrete container types
Agda - Agda is a dependently typed programming language / interactive theorem prover.
permutation - git import of patrick perry permutations lib from darcs
singletons - Fake dependent types in Haskell using singletons
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
containers - Bitnami container images