| 26,13 → 26,17 |
|---|
| * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| /* |
| * This B-tree has the following properties: |
| * - it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5) |
| * - values (i.e. pointers to values) are stored only in leaves |
| * - leaves are linked in a list |
| * - technically, it is a B+tree (because of the previous properties) |
| /** |
| * @file btree.c |
| * @brief B+tree implementation. |
| * |
| * This file implements B+tree type and operations. |
| * |
| * The B+tree has the following properties: |
| * @li it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5) |
| * @li values (i.e. pointers to values) are stored only in leaves |
| * @li leaves are linked in a list |
| * |
| * Be carefull when using these trees. They need to allocate |
| * and deallocate memory for their index nodes and as such |
| * can sleep. |