Class raxIterator

rax.h:186–201

#define RAX_ITER_INLINE_LEAF (1<<3) /* Iterator is positioned on an inline
                                       leaf stored in the current parent. */
typedef struct raxIterator {
    int flags;
    rax *rt;                /* Radix tree we are iterating. */
    unsigned char *key;     /* The current string. */
    void *data;             /* Data associated to this key. */
    size_t key_len;         /* Current key length. */
    size_t key_max;         /* Max key len the current key buffer can hold. */
    unsigned char key_static_string[RAX_ITER_STATIC_LEN];
    raxNode *node;          /* Current node, or the parent node if the
                               iterator is on an inline leaf. */
    int node_child;         /* Cached child index of the current node in its
                               parent, or of the inline leaf in 'node'.
                               -1 if unknown. */
    raxStack stack;         /* Stack used for unsafe iteration. */
    raxNodeCallback node_cb; /* Optional node callback. Normally set to NULL. */
} raxIterator;

/* Defragmentation iterator. Unlike the normal iterator, this iterator scans
 * the radix tree structure itself, yielding both real raxNode allocations and