btree-concurrent VS EdisonAPI

Compare btree-concurrent vs EdisonAPI 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

EdisonAPI

Edison: A Library of Efficient Data Structures (by robdockins)
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 EdisonAPI
- -
2 53
- -
0.0 3.7
over 11 years ago 4 months 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.

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.

EdisonAPI

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

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

What are some alternatives?

When comparing btree-concurrent and EdisonAPI 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

exposed-containers - A redistribution of 'containers', with all hidden modules exposed.

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

multiset - multiset haskell package

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

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

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

ethereum-client-haskell

btree-concurrent vs heap EdisonAPI vs containers btree-concurrent vs containers EdisonAPI vs exposed-containers btree-concurrent vs repa-array EdisonAPI vs type-level-sets btree-concurrent vs bitset EdisonAPI vs multiset btree-concurrent vs Agda EdisonAPI vs miso btree-concurrent vs map-syntax EdisonAPI vs ethereum-client-haskell