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

heap

A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps. (by pruvisto)
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 heap
- -
2 6
- -
0.0 0.0
over 11 years ago about 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.

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.

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

multiset - multiset haskell package

bitset - A compact functional set data structure

psqueues - Priority Search Queues in three different flavors for Haskell

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

naperian - Efficient representable functors

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

safer-file-handles - Type-safe file handling

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

vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.

btree-concurrent vs containers heap vs bytestring-trie btree-concurrent vs repa-array heap vs multiset btree-concurrent vs bitset heap vs psqueues btree-concurrent vs Agda heap vs naperian btree-concurrent vs map-syntax heap vs safer-file-handles btree-concurrent vs ixset-typed heap vs vinyl