b-tree alternatives and similar packages

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

• lens

  10.0 7.6 b-tree VS lens

  Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens

• semantic-source

  10.0 8.9 b-tree VS semantic-source

  Parsing, analyzing, and comparing source code across many languages
  

SaaSHub - Software Alternatives and Reviews

SaaSHub helps you find the best software and product alternatives

Promo www.saashub.com



• hnix

  9.9 6.8 b-tree VS hnix

  A Haskell re-implementation of the Nix expression language
  

• text

  9.8 8.3 b-tree VS text

  Haskell library for space- and time-efficient operations over Unicode text.
  

• code-builder

  9.8 0.0 b-tree VS code-builder

  Packages for defining APIs, running them, generating client code and documentation.
  

• unordered-containers

  9.7 2.9 b-tree VS unordered-containers

  Efficient hashing-based container types
  

• massiv

  9.7 4.5 b-tree VS massiv

  Efficient Haskell Arrays featuring Parallel computation

• cassava

  9.7 4.8 b-tree VS cassava

  A CSV parsing and encoding library optimized for ease of use and high performance
  

• Frames

  9.7 6.1 b-tree VS Frames

  Data frames for tabular data.

• compendium-client

  9.7 0.0 b-tree VS compendium-client

  Mu (μ) is a purely functional framework for building micro services.
  

• alfred-margaret

  9.6 5.7 b-tree VS alfred-margaret

  Fast Aho-Corasick string searching
  

• holmes

  9.6 0.0 b-tree VS holmes

  A reference library for constraint-solving with propagators and CDCL.

• binary

  9.5 4.1 b-tree VS binary

  Efficient, pure binary serialisation using ByteStrings in Haskell.
  

• critbit

  9.5 0.0 b-tree VS critbit

  A Haskell implementation of crit-bit trees.
  

• refined

  9.5 3.0 b-tree VS refined

  Refinement types with static checking

• resource-pool

  9.5 0.0 b-tree VS resource-pool

  A high-performance striped resource pooling implementation for Haskell

• hashable

  9.5 7.1 b-tree VS hashable

  A class for types that can be converted to a hash value
  

• primitive

  9.5 5.6 b-tree VS primitive

  This package provides various primitive memory-related operations.
  

• higgledy

  9.4 2.6 b-tree VS higgledy

  Higher-kinded data via generics

• json-autotype

  9.4 0.0 b-tree VS json-autotype

  Automatic Haskell type inference from JSON input
  

• jump

  9.4 0.0 b-tree VS jump

  Jump start your Haskell development
  

• diskhash

  9.4 0.0 b-tree VS diskhash

  Diskbased (persistent) hashtable

• hashtables

  9.4 1.0 b-tree VS hashtables

  Mutable hash tables for Haskell, in the ST monad

• network-msgpack-rpc

  9.4 b-tree VS network-msgpack-rpc

  A MessagePack-RPC Implementation

• caledon

  9.4 0.0 b-tree VS caledon

  higher order dependently typed logic programing

• data-msgpack

  9.4 b-tree VS data-msgpack

  A Haskell implementation of MessagePack

• cereal

  9.4 0.0 b-tree VS cereal

  A binary serialization library
  

• aeson-qq

  9.4 3.6 b-tree VS aeson-qq

  JSON quasiquoter for Haskell

• certificate

  9.3 0.0 b-tree VS certificate

  Certificate and Key Reader/Writer in haskell
  

• audiovisual

  9.3 3.5 b-tree VS audiovisual

  Extensible records, variants, structs, effects, tangles

• dependent-map

  9.3 4.7 b-tree VS dependent-map

  Dependently-typed finite maps (partial dependent products)
  

• discrimination

  9.3 3.1 b-tree VS discrimination

  Fast linear time sorting and discrimination for a large class of data types

• IORefCAS

  9.3 5.7 b-tree VS IORefCAS

  A collection of different packages for CAS based data structures.

• dependent-sum

  9.3 4.3 b-tree VS dependent-sum

  Dependent sums and supporting typeclasses for comparing and displaying them
  

• uuid

  9.2 5.6 b-tree VS uuid

  A Haskell library for creating, printing and parsing UUIDs
  

• rei

  9.2 0.0 b-tree VS rei

  Process lists easily

• reflection

  9.2 5.3 b-tree VS reflection

  Reifies arbitrary Haskell terms into types that can be reflected back into terms

• orgmode-parse

  9.2 0.0 b-tree VS orgmode-parse

  Attoparsec parser combinators for parsing org-mode structured text!

• uuid-types

  9.2 5.6 b-tree VS uuid-types

  A Haskell library for creating, printing and parsing UUIDs
  

• protobuf

  9.2 2.6 b-tree VS protobuf

  An implementation of Google's Protocol Buffers in Haskell.
  

• safecopy

  9.2 5.9 b-tree VS safecopy

  An extension to Data.Serialize with built-in version control
  

• bifunctors

  9.2 5.6 b-tree VS bifunctors

  Haskell 98 bifunctors, bifoldables and bitraversables

• streaming

  9.2 0.0 b-tree VS streaming

  An optimized general monad transformer for streaming applications, with a simple prelude of functions

• avro

  9.2 5.2 b-tree VS avro

  Haskell Avro Encoding and Decoding Native Support (no RPC)
  

• scientific

  9.2 0.0 b-tree VS scientific

  Arbitrary-precision floating-point numbers represented using scientific notation

• text-icu

  9.1 5.8 b-tree VS text-icu

  This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
  

• stdio

  9.1 1.8 b-tree VS stdio

  Haskell Standard Input and Output
  

• tables

  9.1 0.0 b-tree VS tables

  Deprecated because of

• witherable

  9.1 5.1 b-tree VS witherable

  Filter with effects

• MemoTrie

  9.1 2.7 b-tree VS MemoTrie

  Trie-based memo functions

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

Popular Comparisons

• b-tree
  vs
  hashmap
• b-tree
  vs
  hnix
• b-tree
  vs
  murmur-hash
• b-tree
  vs
  wide-word
• b-tree
  vs
  elf