btree-concurrent

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

Btree-concurrent Alternatives

Similar projects and alternatives to btree-concurrent

  1. heap

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

  2. SaaSHub

    SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives

    SaaSHub logo
  3. repa-array

    High performance, regular, shape polymorphic parallel arrays.

  4. containers

    Assorted concrete container types (by haskell)

  5. bitset

    A compact functional set data structure (by lambda-llama)

  6. helf

    Haskell implementation of the Edinburgh Logical Framework

  7. justified-containers

    Standard containers, with keys that carry type-level proofs of their own presence.

  8. selections

    Haskell Package for operating with selections over an underlying functor

  9. TypeCompose

    Type composition classes & instances & misc

  10. hoq

    A language based on homotopy type theory with an interval

  11. slist

    ♾️ Sized list

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better btree-concurrent alternative or higher similarity.

btree-concurrent discussion

Log in or Post with

btree-concurrent reviews and mentions

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.

Stats

Basic btree-concurrent repo stats
0
2
0.0
over 13 years ago

Sponsored
SaaSHub - Software Alternatives and Reviews
SaaSHub helps you find the best software and product alternatives
www.saashub.com

Did you know that Haskell is
the 30th most popular programming language
based on number of references?