BTree Implementation on Dart.

  • Free software: GPL v3.0

Note

This project has not been tested in any way. Use at your own risk.

Documentation

This data structure is intended to be used as a key-value.

Constructor

 BTree bTree = BTree(degree: 1000); // degree - How many keys can a node contain

Insert

btree.insert("key1", "value1");

Update

btree.update("key1", "value0");

Search

btree.search("key1"); // return "value0"

Delete

btree.delete("key1"); // Deleting key key1. The next search will result in null

Libraries

btreedart