EdisonAPI VS btree-concurrent

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

EdisonAPI

Edison: A Library of Efficient Data Structures (by robdockins)
Data structures
Source Code
Suggest alternative
Edit details

btree-concurrent

A backend agnostic, concurrent BTree written in Haskell (by brinchj)
Data structures
Source Code
Suggest alternative
Edit details
WorkOS
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
EdisonAPI btree-concurrent
- -
53 2
- -
3.7 0.0
4 months ago over 11 years ago
Haskell Haskell
MIT License LicenseRef-LGPL
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.

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.

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.

What are some alternatives?

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

containers - Assorted concrete container types

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

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

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

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

multiset - multiset haskell package

bitset - A compact functional set data structure

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

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

ethereum-client-haskell

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

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