critbit

Bit tree library

An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell

A Haskell implementation of crit-bit trees.

GitHub

138 stars
18 watching
40 forks
Language: Haskell
last commit: over 4 years ago

Related projects:

RepositoryDescriptionStars
bgamari/b-treeAn implementation of an immutable B-tree data structure optimized for disk storage and efficient querying.116
cronokirby/hazeA Haskell implementation of the Bittorrent protocol for learning and development purposes.107
haskell-haskey/haskeyA high-performance, ACID compliant key-value store designed to be embedded in other applications92
barncastle/bitskitA C# library for efficient bit-level operations and manipulation of bit fields in various data types43
cronokirby/haskell-in-haskellA compiler that translates Haskell code into C99, simulating various stages of compilation and intermediate representations.119
tree-sitter/haskell-tree-sitterHaskell bindings for an incremental parsing toolkit used in compiler development and language analysis.156
haskell/binaryEfficient serialisation of values to and from lazy ByteStrings in Haskell.109
haskell/parsecA parser combinator library designed to be industrial-strength and easy to use850
cyga/real-world-haskellA tool to parse and fix code samples from the book 'Real World Haskell'89
roaringbitmap/roaring-rsA data structure library for efficient bitset management770
yourbasic/bitAn efficient data structure for compactly storing and manipulating binary numbers using bit-level parallelism.159
bits-and-blooms/bitsetA Go package implementing bitsets as a mapping between non-negative integers and boolean values1,363
haskell-suite/haskell-src-extsA toolset for manipulating and analyzing Haskell source code194
hdbc/hdbcA Haskell interface to various databases allowing programmatic access and manipulation of their data structures127
b-lang-org/bscA toolchain for designing and synthesizing digital electronic hardware960