btree 1.0

btree software can store records. Each record is stored as a line in which the different fields are separated by spaces. The first field is the index.

Instead of allocating a node every time a node must be splitted, I use an array of nodes. When I run out of nodes, I reallocate the array of nodes.

Building:

make

Installation:

make install

Product's homepage