b-tree
by bgamari
Haskell on-disk B* tree implementation
AI summary
B-tree library
An implementation of an immutable B-tree data structure optimized for disk storage and efficient querying.
- stars
- 116
- forks
- 7
- watching
- 9
Similar projects
Found by comparing what the projects do, not just their names.
Bit tree library
An implementation of crit-bit trees for efficient key/value storage and lookup in Haskell
B+Tree index
A minimal B+Tree indexing structure implementation for efficient key-value storage
Heap Inspector
Enables heap inspection and analysis of running Haskell programs from an external debugger
attaswift/btree1.3K
B-tree collection library
A package that provides fast and efficient in-memory data structures using B-tree technology
Tree data structure library
Provides efficient tree data structures for Django web applications
Parsing library
Haskell bindings for an incremental parsing toolkit used in compiler development and language analysis.
Hardware design tool
A toolchain for designing and synthesizing digital electronic hardware
Binary tree simulator
An interactive code editor with a live visual representation of binary trees to teach data structures and algorithms.
Haskell GUI library
A cross-platform GUI library for writing native Haskell applications
Tree math library
A library that provides mathematical operations for JAX pytrees.
Binary search tree
A data structure implementation of a semi-balanced binary search tree that optimizes access to frequently accessed items
HDL library
A Haskell library for creating hardware descriptions using a functional programming style
B-tree
A stable B-tree data structure implementation in Motoko for storing and retrieving key-value pairs.
ByteString serializer
Efficient serialisation of values to and from lazy ByteStrings in Haskell.
DBF file reader
An interface for reading and writing DBF files
