Function raxIteratorPrevStep

rax.c:1803–1893

Like raxIteratorNextStep() but implements an iteration step moving * to the lexicographically previous element. The 'noup' option has a similar * effect to the one of raxIteratorNextStep(). */

 * to the lexicographically previous element. The 'noup' option has a similar
 * effect to the one of raxIteratorNextStep(). */
int raxIteratorPrevStep(raxIterator *it, int noup) {
    if (it->flags & RAX_ITER_EOF) {
        return 1;
    } else if (it->flags & RAX_ITER_JUST_SEEKED) {
        it->flags &= ~RAX_ITER_JUST_SEEKED;
        return 1;
    }

    /* Save key len, stack items and the node where we are currently
     * so that on iterator EOF we can restore the current key and state. */
    size_t orig_key_len = it->key_len;
    size_t orig_stack_items = it->stack.items;
    raxNode *orig_node = it->node;
    int orig_flags = it->flags;
    void *orig_data = it->data;
    int orig_node_child = it->node_child;

    if (raxIteratorIsInlineLeaf(it)) {
        raxIteratorClearInlineLeaf(it);
        noup = 1;
    }

    while(1) {
        int old_noup = noup;

        /* Already on head? Can't go up, iteration finished. */
        if (!noup && it->node == it->rt->head) {
            it->flags = orig_flags | RAX_ITER_EOF;
            it->stack.items = orig_stack_items;
            it->key_len = orig_key_len;
            it->node = orig_node;
            it->data = orig_data;
            it->node_child = orig_node_child;
            return 1;
        }

        unsigned char prevchild = it->key[it->key_len-1];
        int prevchildidx = it->node_child;
        if (!noup) {
            it->node = raxStackPop(&it->stack);
            it->node_child = -1;
        } else {
            noup = 0;
        }

        /* Adjust the current key to represent the node we are
         * at. */
        int todel = it->node->iscompr ? it->node->size : 1;
        raxIteratorDelChars(it,todel);

        /* Try visiting the prev child if there is at least one
         * child. */
        if (!it->node->iscompr && it->node->size > (old_noup ? 0 : 1)) {
            raxNode **cp;
            int i;

            if (prevchildidx != -1) {
                i = prevchildidx-1;