Function raxIteratorSetData

rax.c:2256–2296

Update the data associated to the element currently selected by the * iterator. The operation works both for regular key nodes and for inline * leaves represented virtually by the iterator. * * The function returns 1 on success or 0 on error. In case the iterator * is not positioned on an element errno is set to ENOENT. If the current * node needs to be reallocated in order to store a non-NU

 * node needs to be reallocated in order to store a non-NULL value and the
 * allocation fails, errno is set to ENOMEM. */
int raxIteratorSetData(raxIterator *it, void *data) {
    raxNode **parentlink;

    if (it->rt == NULL || (it->flags & RAX_ITER_EOF)) {
        errno = ENOENT;
        return 0;
    }

    parentlink = raxIteratorCurrentParentLink(it,NULL);
    if (parentlink == NULL) {
        errno = ENOENT;
        return 0;
    }

    if (raxIteratorIsInlineLeaf(it)) {
        memcpy(parentlink,&data,sizeof(data));
        it->data = data;
        return 1;
    }

    if (it->node == NULL || !it->node->iskey) {
        errno = ENOENT;
        return 0;
    }

    if (it->node->isnull && data != NULL) {
        raxNode *newnode = raxReallocForData(it->node,data);
        if (newnode == NULL) {
            errno = ENOMEM;
            return 0;
        }
        if (newnode != it->node) {
            memcpy(parentlink,&newnode,sizeof(newnode));
            it->node = newnode;
        }
    }

    raxSetData(it->node,data);
    it->data = data;
    return 1;
}

/* ----------------------- Defragmentation iterator -------------------------
 * The defragmentation iterator scans the radix tree structure itself and