b-tree is a Haskell implementation of a disk-backed B* tree. The
library uses streaming IO to write an immutable B-tree to disk from
ordered keys. This tree can then be opened via mmap for lookups. The
tree can also be iterated over as well as merged with other trees and
leaf sources.
b
b-tree
public
116 stars
7 forks
2 issues
Commits
List of commits on branch master.Unverified
5d1c0ab0e8815417a8437e501666a0d646adcd14Bump bounds
bbgamari committed 3 years ago
Unverified
dc4e7196895fa144501b14ad5fa0eb84f8a5c969Bump bounds
bbgamari committed 5 years ago
Unverified
8ca56f5611506cace731594df07d596a1c0a80f2Don't rely on MonadFail
bbgamari committed 6 years ago
Unverified
96a3f7d78654ca29d902632d8935b05b136b72d2Merge branch 'master' of github.com:bgamari/b-tree
bbgamari committed 6 years ago
Unverified
70618a6dd407b66dcb6170c0957cba2ab4ce8623Bump version
bbgamari committed 6 years ago
Unverified
2509613ca24b42a6e8406b983c712204620e451bBounds bumps
bbgamari committed 6 years ago