btree-concurrent VS containers

Compare btree-concurrent vs containers and see what are their differences.

btree-concurrent

A backend agnostic, concurrent BTree written in Haskell (by brinchj)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
btree-concurrent containers
0 11
2 315
- 0.3%
0.0 6.2
over 11 years ago 8 days ago
Haskell Haskell
LicenseRef-LGPL BSD 3-clause "New" or "Revised" 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.

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.

containers

Posts with mentions or reviews of containers. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-12-30.

What are some alternatives?

When comparing btree-concurrent and containers you can also consider the following projects:

singletons - Fake dependent types in Haskell using singletons

EdisonAPI - Edison: A Library of Efficient Data Structures

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

hevm - Dapp, Seth, Hevm, and more

miso - :ramen: A tasty Haskell front-end framework

indexed-containers

heap - A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.

adjunctions - Simple adjunctions

psqueues - Priority Search Queues in three different flavors for Haskell

repa-array - High performance, regular, shape polymorphic parallel arrays.

distributive - Dual Traversable

fgl - A Functional Graph Library for Haskell