Btree-concurrent Alternatives

Similar projects and alternatives to btree-concurrent

• heap

  - 6 0.0 Haskell btree-concurrent VS heap

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

• containers

  - 306 0.0 Haskell btree-concurrent VS containers

  Assorted concrete container types (by haskell)

  

• InfluxDB

  www.influxdata.com

  sponsored

  Access the most powerful time series database as a service. Ingest, store, & analyze all types of time series data in a fully-managed, purpose-built database. Keep data forever with low-cost storage and superior data compression.

  

• repa-array

  - 127 0.0 Haskell btree-concurrent VS repa-array

  High performance, regular, shape polymorphic parallel arrays.

  

• Agda

  - 2,118 9.8 Haskell btree-concurrent VS Agda

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

  

• nonempty-containers

  - 23 0.0 Haskell btree-concurrent VS nonempty-containers

  Efficient non-empty variants of containers data types, with full API

• map-syntax

  - 7 0.0 Haskell btree-concurrent VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps

• cubical

  - 137 0.0 Haskell btree-concurrent VS cubical

  Implementation of Univalence in Cubical Sets (by simhu)

• SonarQube

  www.sonarqube.org

  sponsored

  Static code analysis for 29 languages.. Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

  

• ethereum-client-haskell

  - 77 0.0 Haskell btree-concurrent VS ethereum-client-haskell

• EdisonAPI

  - 52 0.0 Haskell btree-concurrent VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• knit

  - 45 0.0 Haskell btree-concurrent VS knit

  Ties the knot on data structures that reference each other by unique keys (by pkamenarsky)