heap VS btree-concurrent

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

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

btree-concurrent

A backend agnostic, concurrent BTree written in Haskell (by brinchj)
Data structures
Source Code
Suggest alternative
Edit details
InfluxDB - Power Real-Time Data Analytics at Scale
Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
www.influxdata.com
featured
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com
featured
heap btree-concurrent
- -
6 2
- -
0.0 0.0
about 3 years ago over 11 years ago
Haskell Haskell
BSD 3-clause "New" or "Revised" 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.

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.

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 heap and btree-concurrent you can also consider the following projects:

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

containers - Assorted concrete container types

multiset - multiset haskell package

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

psqueues - Priority Search Queues in three different flavors for Haskell

bitset - A compact functional set data structure

naperian - Efficient representable functors

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

safer-file-handles - Type-safe file handling

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

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

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

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