bk-tree alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view bk-tree alternatives based on common mentions on social networks and blogs.

• hevm

  10.0 5.3 bk-tree VS hevm

  Dapp, Seth, Hevm, and more
  

• miso

  10.0 0.0 bk-tree VS miso

  :ramen: A tasty Haskell front-end framework

Learn any GitHub repo in 59 seconds

Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.

Promo getonboard.dev



• Agda

  10.0 9.6 bk-tree VS Agda

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

• containers

  9.8 7.3 bk-tree VS containers

  Assorted concrete container types
  

• singletons

  9.7 0.0 bk-tree VS singletons

  Fake dependent types in Haskell using singletons

• vinyl

  9.7 0.0 bk-tree VS vinyl

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

• fgl

  9.6 0.0 bk-tree VS fgl

  A Functional Graph Library for Haskell
  

• repa-scalar

  9.4 0.0 bk-tree VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-eval

  9.4 0.0 bk-tree VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-array

  9.4 0.0 bk-tree VS repa-array

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-convert

  9.4 0.0 bk-tree VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• cubical

  9.4 0.0 bk-tree VS cubical

  Implementation of Univalence in Cubical Sets

• parameterized-utils

  9.1 0.0 bk-tree VS parameterized-utils

  A set of utilities for using indexed types including containers, equality, and comparison.
  

• ethereum-client-haskell

  9.0 0.0 bk-tree VS ethereum-client-haskell

  A Haskell version of an Ethereum client

• adjunctions

  9.0 0.0 bk-tree VS adjunctions

  Simple adjunctions

• psqueues

  9.0 0.0 bk-tree VS psqueues

  Priority Search Queues in three different flavors for Haskell

• hoq

  8.9 0.0 bk-tree VS hoq

  A language based on homotopy type theory with an interval

• distributive

  8.9 0.0 bk-tree VS distributive

  Dual Traversable

• type-level-sets

  8.8 0.0 bk-tree VS type-level-sets

  Type-level sets for Haskell (with value-level counterparts and various operations)

• bookkeeper

  8.7 0.0 bk-tree VS bookkeeper

  Anonymous records and overloaded labels
  

• justified-containers

  8.7 0.0 bk-tree VS justified-containers

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

• clafer

  8.6 0.0 bk-tree VS clafer

  Clafer is a lightweight modeling language
  

• EdisonAPI

  8.4 0.0 bk-tree VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• bytestring-trie

  8.3 0.0 bk-tree VS bytestring-trie

  An efficient finite map from (byte)strings to values.

• ixset-typed

  8.2 3.2 bk-tree VS ixset-typed

  More strongly typed variant of the ixset Haskell package
  

• slist

  8.2 0.0 bk-tree VS slist

  ♾️ Sized list
  

• void

  8.1 0.0 bk-tree VS void

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

• heaps

  8.0 0.0 bk-tree VS heaps

  Asymptotically optimal Brodal/Okasaki heaps

• hamtmap

  7.9 0.0 bk-tree VS hamtmap

  A purely functional and persistent hash map

• haggle

  7.9 0.0 bk-tree VS haggle

  An efficient graph library for Haskell

• knit

  7.9 0.0 bk-tree VS knit

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

• bitset

  7.8 0.0 bk-tree VS bitset

  A compact functional set data structure
  

• nonempty-containers

  7.7 0.0 bk-tree VS nonempty-containers

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

• multiset

  7.7 0.0 bk-tree VS multiset

  multiset haskell package

• graphite

  7.6 0.0 bk-tree VS graphite

  Haskell graphs and networks library

• algebra-checkers

  7.5 0.0 bk-tree VS algebra-checkers

  checkers for algebra driven design

• map-exts

  7.4 0.0 bk-tree VS map-exts

  Extensions to Data.Map
  

• rawr

  7.3 0.0 bk-tree VS rawr

  Anonymous extensible records and variant types

• helf

  7.2 0.0 bk-tree VS helf

  Haskell implementation of the Edinburgh Logical Framework

• data-r-tree

  7.2 0.0 bk-tree VS data-r-tree

  Haskell implementatio of R-Trees

• eliminators

  7.0 0.0 bk-tree VS eliminators

  Dependently typed elimination functions using singletons

• claferIG

  6.9 0.0 bk-tree VS claferIG

  Support for reasoning on Clafer models by instantiation and counter example generation.
  

• mtl-c

  6.8 0.0 bk-tree VS mtl-c

  Monad transformers in CPS

• TypeCompose

  6.8 0.0 bk-tree VS TypeCompose

  Type composition classes & instances & misc

• selections

  6.7 0.0 bk-tree VS selections

  Haskell Package for operating with selections over an underlying functor

• map-syntax

  6.7 0.0 bk-tree VS map-syntax

  Syntax sugar and explicit semantics for statically defined maps

• ixset

  6.6 0.0 bk-tree VS ixset

  A Set type which supports multiple indexes
  

• supermonad

  6.6 0.0 bk-tree VS supermonad

  A plugin for GHC to support super monads.

• igraph

  6.6 0.0 bk-tree VS igraph

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

• representable-functors

  6.6 0.0 bk-tree VS representable-functors

  representable functors

Do you think we are missing an alternative of bk-tree or a related project?

Collect and Analyze Billions of Data Points in Real Time sponsored www.influxdata.com

Popular Comparisons

• bk-tree
  vs
  ethereum-merkle-patricia-db
• data-clist
  vs
  pomaps
• naperian
  vs
  justified-containers
• ethereum-client-haskell
  vs
  ethereum-analyzer
• rawr
  vs
  graphite

SaaSHub - Software Alternatives and Reviews sponsored www.saashub.com