Based on Santanu Basu's BPlusJS, modified for stand-alone use. This is mostly just a port of the original code, so I cannot guarantee for anything.
If you are looking for a super-lean B-tree, you might want to try nodebase-btree instead.
- Insertion
- Deletion
- Key lookup
- Range retrieval
- Pretty-printed debug output
- CommonJS compatible
- RequireJS/AMD compatible
- Shim compatible (include the script, then use var BTree = dcodeIO.BTree;)
- node.js compatible, also available via npm
- Zero production dependencies
- Small footprint
MIT