Skip to content

Instantly share code, notes, and snippets.

@osiyuk
osiyuk / BTree.cpp
Created October 21, 2018 01:27 — forked from pervognsen/BTree.cpp
B-tree with iterators and more aggressive deletion
enum { BMAX = 32, BMIN = BMAX / 2, BHEIGHT = 6 };
struct BNode {
uint32_t length;
Key keys[BMAX];
union {
BNode *children[BMAX];
Value values[BMAX];
};
};