214,7 → 214,7 |
|
/** Remove B-tree node. |
* |
* @param B-tree. |
* @param t B-tree. |
* @param key Key to be removed from the B-tree along with its associated value. |
* @param leaf_node If not NULL, pointer to the leaf node where the key is found. |
*/ |
234,7 → 234,7 |
|
/** Recursively remove B-tree node. |
* |
* @param B-tree. |
* @param t B-tree. |
* @param key Key to be removed from the B-tree along with its associated value. |
* @param node Node where the key being removed resides. |
*/ |
902,7 → 902,7 |
|
/** Rotate in a key from the right sibling or from the index node, if this operation can be done. |
* |
* @param rnode Node into which to add key from its right sibling or from the index node. |
* @param lnode Node into which to add key from its right sibling or from the index node. |
* |
* @return True if the rotation was performed, false otherwise. |
*/ |