#define __KB_ITR(name, key_t, kbnode_t) \

static inline void kb_itr_first_##name(kbtree_##name##_t *b, kbitr_##name##_t *itr) \

{ \

if (b->n_keys == 0) return; \

itr->p = itr->stack; \

itr->p->x = b->root; itr->p->i = 0; \

} \

static inline int kb_itr_next_##name(kbtree_##name##_t *b, kbitr_##name##_t *itr) \

{ \

for (;;) { \

++itr->p->i; \

while (itr->p->x && itr->p->i <= itr->p->x->n) { \

itr->p[1].i = 0; \

itr->p[1].x = itr->p->x->is_internal? __KB_PTR(b, itr->p->x)[itr->p->i] : 0; \

++itr->p; \

} \

--itr->p; \

if (itr->p->x && itr->p->i < itr->p->x->n) return 1; \

} \

} \

static inline int kb_itr_prev_##name(kbtree_##name##_t *b, kbitr_##name##_t *itr) \

{ \

for (;;) { \

while (itr->p->x && itr->p->i >= 0) { \

itr->p[1].x = itr->p->x->is_internal? __KB_PTR(b, itr->p->x)[itr->p->i] : 0; \

itr->p[1].i = itr->p[1].x ? itr->p[1].x->n : -1; \

++itr->p; \

} \

--itr->p; \

--itr->p->i; \

if (itr->p->x && itr->p->i >= 0) return 1; \

} \

itr->p[1].x = itr->p->x->is_internal? __KB_PTR(b, itr->p->x)[i + 1] : 0; \

++itr->p; \

} \

return 0; \

} \

static inline int kb_itr_get_##name(kbtree_##name##_t *b, key_t k, kbitr_##name##_t *itr) \