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)
Data structures
Source Code
Suggest alternative
Edit details

selections

Haskell Package for operating with selections over an underlying functor (by ChrisPenner)
Data structures
Source Code
Suggest alternative
Edit details
InfluxDB
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
btree-concurrent selections
- -
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.

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

containers - Assorted concrete container types

psqueues - Priority Search Queues in three different flavors for Haskell

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

distributive - Dual Traversable

bitset - A compact functional set data structure

clafer - Clafer is a lightweight modeling language

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

nonempty-containers - Efficient non-empty variants of containers data types, with full API

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

naperian - Efficient representable functors

btree-concurrent vs heap selections vs type-level-sets btree-concurrent vs containers selections vs psqueues btree-concurrent vs repa-array selections vs distributive btree-concurrent vs bitset selections vs clafer btree-concurrent vs Agda selections vs nonempty-containers btree-concurrent vs map-syntax selections vs naperian