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.

• miso

  10.0 6.0 bk-tree VS miso

  :ramen: A tasty Haskell front-end framework

• hevm

  10.0 4.8 bk-tree VS hevm

  Dapp, Seth, Hevm, and more
  

WorkOS - The modern identity platform for B2B SaaS

The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.

Promo workos.com



• Agda

  10.0 9.8 bk-tree VS Agda

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

• containers

  9.8 6.2 bk-tree VS containers

  Assorted concrete container types
  

• vinyl

  9.7 0.0 bk-tree VS vinyl

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

• singletons

  9.7 6.3 bk-tree VS singletons

  Fake dependent types in Haskell using singletons

• fgl

  9.6 7.5 bk-tree VS fgl

  A Functional Graph Library for Haskell
  

• repa-eval

  9.5 0.0 bk-tree VS repa-eval

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-scalar

  9.5 0.0 bk-tree VS repa-scalar

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-convert

  9.5 0.0 bk-tree VS repa-convert

  High performance, regular, shape polymorphic parallel arrays.
  

• repa-array

  9.5 0.0 bk-tree VS repa-array

  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 6.1 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

• psqueues

  9.0 5.2 bk-tree VS psqueues

  Priority Search Queues in three different flavors for Haskell

• hoq

  9.0 0.0 bk-tree VS hoq

  A language based on homotopy type theory with an interval

• adjunctions

  9.0 3.3 bk-tree VS adjunctions

  Simple adjunctions

• distributive

  8.9 2.7 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.5 3.9 bk-tree VS clafer

  Clafer is a lightweight modeling language
  

• EdisonAPI

  8.4 3.7 bk-tree VS EdisonAPI

  Edison: A Library of Efficient Data Structures

• 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
  

• bytestring-trie

  8.2 4.6 bk-tree VS bytestring-trie

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

• 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

• haggle

  8.0 5.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

• hamtmap

  7.9 0.0 bk-tree VS hamtmap

  A purely functional and persistent hash map

• bitset

  7.7 0.0 bk-tree VS bitset

  A compact functional set data structure
  

• nonempty-containers

  7.7 3.1 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.5 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

• helf

  7.3 3.3 bk-tree VS helf

  Haskell implementation of the Edinburgh Logical Framework

• map-exts

  7.3 0.0 bk-tree VS map-exts

  Extensions to Data.Map
  

• rawr

  7.2 0.0 bk-tree VS rawr

  Anonymous extensible records and variant types

• eliminators

  7.2 4.5 bk-tree VS eliminators

  Dependently typed elimination functions using singletons

• data-r-tree

  7.2 4.7 bk-tree VS data-r-tree

  Haskell implementatio of R-Trees

• claferIG

  6.8 3.9 bk-tree VS claferIG

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

• TypeCompose

  6.8 0.0 bk-tree VS TypeCompose

  Type composition classes & instances & misc

• mtl-c

  6.7 0.0 bk-tree VS mtl-c

  Monad transformers in CPS

• 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?

InfluxDB - Power Real-Time Data Analytics at Scale sponsored www.influxdata.com

Popular Comparisons

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

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