Rev 1708 | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
| Rev 1708 | Rev 1757 | ||
|---|---|---|---|
| Line 555... | Line 555... | ||
| 555 | panic("node %p does not contain key %d\n", node, key); |
555 | panic("node %p does not contain key %d\n", node, key); |
| 556 | } |
556 | } |
| 557 | 557 | ||
| 558 | /** Split full B-tree node and insert new key-value-right-subtree triplet. |
558 | /** Split full B-tree node and insert new key-value-right-subtree triplet. |
| 559 | * |
559 | * |
| 560 | * This function will split a node and return pointer to a newly created |
560 | * This function will split a node and return a pointer to a newly created |
| 561 | * node containing keys greater than or equal to the greater of medians |
561 | * node containing keys greater than or equal to the greater of medians |
| 562 | * (or median) of the old keys and the newly added key. It will also write |
562 | * (or median) of the old keys and the newly added key. It will also write |
| 563 | * the median key to a memory address supplied by the caller. |
563 | * the median key to a memory address supplied by the caller. |
| 564 | * |
564 | * |
| 565 | * If the node being split is an index node, the median will not be |
565 | * If the node being split is an index node, the median will not be |
| Line 998... | Line 998... | ||
| 998 | printf("\n"); |
998 | printf("\n"); |
| 999 | } |
999 | } |
| 1000 | 1000 | ||
| 1001 | /** @} |
1001 | /** @} |
| 1002 | */ |
1002 | */ |
| 1003 | - | ||