hw-fingertree
hw-fingertree-strict
| hw-fingertree | hw-fingertree-strict | |
|---|---|---|
| - | - | |
| 5 | 2 | |
| - | - | |
| 2.7 | 0.0 | |
| 4 months ago | over 1 year 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
We haven't tracked posts mentioning hw-fingertree yet.
Tracking mentions began in Dec 2020.
hw-fingertree-strict
We haven't tracked posts mentioning hw-fingertree-strict yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)
exposed-containers - A redistribution of 'containers', with all hidden modules exposed.
containers - Assorted concrete container types
permutation - git import of patrick perry permutations lib from darcs
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
naperian - Efficient representable functors
representable-functors - representable functors
selections - Haskell Package for operating with selections over an underlying functor
graphite - Haskell graphs and networks library
void - Provides Data.Void, which is in base since ghc 7.8 or so