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