ixset-typed
btree-concurrent
Our great sponsors
| ixset-typed | btree-concurrent | |
|---|---|---|
| 1 | - | |
| 23 | 2 | |
| - | - | |
| 3.2 | 0.0 | |
| almost 2 years ago | over 11 years ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | LicenseRef-LGPL |
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.
ixset-typed
btree-concurrent
We haven't tracked posts mentioning btree-concurrent yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
ixset - A Set type which supports multiple indexes
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
multiset - multiset haskell package
containers - Assorted concrete container types
psqueues - Priority Search Queues in three different flavors for Haskell
repa-array - High performance, regular, shape polymorphic parallel arrays.
nibblestring - Packed, strict nibble arrays with a list interface (ByteString for nibbles)
bitset - A compact functional set data structure
permutation - git import of patrick perry permutations lib from darcs
Agda - Agda is a dependently typed programming language / interactive theorem prover.
naperian - Efficient representable functors
map-syntax - Syntax sugar and explicit semantics for statically defined maps