btree-concurrent VS ixset-typed

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

btree-concurrent

A backend agnostic, concurrent BTree written in Haskell (by brinchj)

ixset-typed

More strongly typed variant of the ixset Haskell package (by well-typed)
Our great sponsors
  • WorkOS - The modern API for authentication & user identity.
  • Onboard AI - ChatGPT with full context of any GitHub repo.
  • InfluxDB - Power Real-Time Data Analytics at Scale
btree-concurrent ixset-typed
0 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
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.

ixset-typed

Posts with mentions or reviews of ixset-typed. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning ixset-typed yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

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

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.

bitset - A compact functional set data structure

map-syntax - Syntax sugar and explicit semantics for statically defined maps

Agda - Agda is a dependently typed programming language / interactive theorem prover.

psqueues - Priority Search Queues in three different flavors for Haskell

EdisonAPI - Edison: A Library of Efficient Data Structures

ethereum-client-haskell

selections - Haskell Package for operating with selections over an underlying functor