rawr VS btree-concurrent

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

rawr

Anonymous extensible records and variant types (by PkmX)
Data structures Records rawr Haskell
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
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
rawr btree-concurrent
- -
26 2
- -
0.0 0.0
over 2 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.

rawr

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

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

graphite - Haskell graphs and networks library

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

containers - Assorted concrete container types

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

bitset - A compact functional set data structure

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

naperian - Efficient representable functors

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

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

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

algebra-checkers - checkers for algebra driven design

EdisonAPI - Edison: A Library of Efficient Data Structures

rawr vs graphite btree-concurrent vs heap btree-concurrent vs containers btree-concurrent vs repa-array btree-concurrent vs bitset rawr vs vinyl rawr vs naperian btree-concurrent vs ixset-typed btree-concurrent vs Agda btree-concurrent vs map-syntax btree-concurrent vs algebra-checkers btree-concurrent vs EdisonAPI