btree-concurrent VS selections

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

btree-concurrent

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

selections

Haskell Package for operating with selections over an underlying functor (by ChrisPenner)
Our great sponsors
  • WorkOS - The modern API for authentication & user identity.
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • LearnThisRepo.com - Learn 300+ open source libraries for free using AI.
btree-concurrent selections
0 0
2 22
- -
0.0 0.0
over 11 years ago over 3 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.

selections

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

We haven't tracked posts mentioning selections yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

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

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

containers - Assorted concrete container types

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

type-level-sets - Type-level sets for Haskell (with value-level counterparts and various operations)

bitset - A compact functional set data structure

psqueues - Priority Search Queues in three different flavors for Haskell

distributive - Dual Traversable

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

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

ixset-typed - More strongly typed variant of the ixset Haskell package

clafer - Clafer is a lightweight modeling language

naperian - Efficient representable functors