btree-concurrent VS repa-array

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

btree-concurrent

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

repa-array

High performance, regular, shape polymorphic parallel arrays. (by haskell-repa)
Our great sponsors
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • WorkOS - The modern identity platform for B2B SaaS
  • SaaSHub - Software Alternatives and Reviews
btree-concurrent repa-array
0 0
2 131
- 0.8%
0.0 0.0
over 11 years ago about 2 months 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.

repa-array

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

We haven't tracked posts mentioning repa-array yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

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

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

repa-sndfile - Reading and writing audio data with repa

repa-fftw - Performs fft on repa array with FFTW

repa-devil - Image library based on the DevIL open source image library for the repa array library.

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

containers - Assorted concrete container types

miso - :ramen: A tasty Haskell front-end framework

monadic-arrays - MArray instances for monad transformers

naperian - Efficient representable functors

nonemptymap - NonEmpty Map Libary

permutation - git import of patrick perry permutations lib from darcs

bitset - A compact functional set data structure