btree-concurrent
A backend agnostic, concurrent BTree written in Haskell (by brinchj)
bitset
A compact functional set data structure (by lambda-llama)
| btree-concurrent | bitset | |
|---|---|---|
| - | - | |
| 2 | 13 | |
| - | - | |
| 0.0 | 0.0 | |
| over 12 years ago | almost 4 years ago | |
| Haskell | Haskell | |
| LicenseRef-LGPL | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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
Posts with mentions or reviews of btree-concurrent.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning btree-concurrent yet.
Tracking mentions began in Dec 2020.
bitset
Posts with mentions or reviews of bitset.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning bitset yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
When comparing btree-concurrent and bitset you can also consider the following projects:
containers - Assorted concrete container types
nonempty-containers - Efficient non-empty variants of containers data types, with full API
heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
heaps - Asymptotically optimal Brodal/Okasaki heaps
repa-array - High performance, regular, shape polymorphic parallel arrays.
functor-friends - Friendly helpers for your recursion schemes.