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.
138 stars
18 watching
40 forks
Language: Haskell
last commit: almost 3 years ago Related projects:
Repository | Description | Stars |
---|---|---|
| An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying. | 116 |
| A Haskell implementation of the Bittorrent protocol for learning and development purposes. | 107 |
| A high-performance, ACID compliant key-value store designed to be embedded in other applications | 92 |
| A C# library for efficient bit-level operations and manipulation of bit fields in various data types | 43 |
| A compiler that translates Haskell code into C99, simulating various stages of compilation and intermediate representations. | 119 |
| Haskell bindings for an incremental parsing toolkit used in compiler development and language analysis. | 156 |
| Efficient serialisation of values to and from lazy ByteStrings in Haskell. | 109 |
| A parser combinator library designed to be industrial-strength and easy to use | 850 |
| A tool to parse and fix code samples from the book 'Real World Haskell' | 89 |
| A data structure library for efficient bitset management | 770 |
| An efficient data structure for compactly storing and manipulating binary numbers using bit-level parallelism. | 159 |
| A Go package implementing bitsets as a mapping between non-negative integers and boolean values | 1,363 |
| A toolset for manipulating and analyzing Haskell source code | 194 |
| A Haskell interface to various databases allowing programmatic access and manipulation of their data structures | 127 |
| A toolchain for designing and synthesizing digital electronic hardware | 960 |