btree-concurrent
heap
Our great sponsors
| btree-concurrent | heap | |
|---|---|---|
| 0 | 0 | |
| 2 | 6 | |
| - | - | |
| 0.0 | 0.0 | |
| over 10 years ago | over 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.
heap
We haven't tracked posts mentioning heap yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
containers - Assorted concrete container types
bytestring-trie - An efficient finite map from (byte)strings to values.
multiset - multiset haskell package
repa-array - High performance, regular, shape polymorphic parallel arrays.
psqueues - Priority Search Queues in three different flavors for Haskell
Agda - Agda is a dependently typed programming language / interactive theorem prover.
ethereum-client-haskell
knit - Ties the knot on data structures that reference each other by unique keys
EdisonAPI - Edison: A Library of Efficient Data Structures
map-syntax - Syntax sugar and explicit semantics for statically defined maps
cubical - Implementation of Univalence in Cubical Sets
nonempty-containers - Efficient non-empty variants of containers data types, with full API