Function raxRemoveChild

rax.c:1211–1220

Low level child removal from node. The new node pointer (after the child * removal) is returned. Note that this function does not fix the pointer * of the parent node in its parent, so this task is up to the caller. * The function never fails for out of memory. */

 * of the parent node in its parent, so this task is up to the caller.
 * The function never fails for out of memory. */
raxNode *raxRemoveChild(raxNode *parent, raxNode *child) {
    raxNode **cp = raxNodeFirstChildPtr(parent);
    while(1) {
        raxNode *aux;
        memcpy(&aux,cp,sizeof(aux));
        if (aux == child) break;
        cp++;
    }
    return raxRemoveChildAtPtr(parent,cp);
}

/* Free the useless node 'h' that was left after a deletion, and keep moving
 * upward while the parent would also become a non-key single-child node.