btree-concurrent VS heap

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

btree-concurrent

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

heap

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. (by pruvisto)
Our great sponsors
  • SonarQube - Static code analysis for 29 languages.
  • InfluxDB - Access the most powerful time series database as a service
  • SaaSHub - Software Alternatives and Reviews
btree-concurrent heap
0 0
2 6
- -
0.0 0.0
over 10 years ago over 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.

heap

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

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

What are some alternatives?

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

containers - Assorted concrete container types

bytestring-trie - An efficient finite map from (byte)strings to values.

multiset - multiset haskell package

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

psqueues - Priority Search Queues in three different flavors for Haskell

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

ethereum-client-haskell

knit - Ties the knot on data structures that reference each other by unique keys

EdisonAPI - Edison: A Library of Efficient Data Structures

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

cubical - Implementation of Univalence in Cubical Sets

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