hamtmap VS btree-concurrent

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

hamtmap

By exclipy
Data structures

DISCONTINUED

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
hamtmap btree-concurrent
- -
45 2
- -
0.0 0.0
- 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.

hamtmap

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

We haven't tracked posts mentioning hamtmap 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 hamtmap and btree-concurrent you can also consider the following projects:

naperian - Efficient representable functors

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

monadic-arrays - MArray instances for monad transformers

containers - Assorted concrete container types

distributive - Dual Traversable

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

igraph - Incomplete Haskell bindings to the igraph library (which is written in C)

bitset - A compact functional set data structure

void - Provides Data.Void, which is in base since ghc 7.8 or so

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

functor-friends - Friendly helpers for your recursion schemes.

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

hamtmap vs naperian btree-concurrent vs heap hamtmap vs monadic-arrays btree-concurrent vs containers hamtmap vs distributive btree-concurrent vs repa-array hamtmap vs igraph btree-concurrent vs bitset hamtmap vs void btree-concurrent vs Agda hamtmap vs functor-friends btree-concurrent vs map-syntax