Function BPlusTreeIterator_next

python/bplustree_c_src/bplustree_module.c:138–195

}

static PyObject *
BPlusTreeIterator_next(BPlusTreeIterator *self) {
    /* Check if the tree has been modified since iterator creation */
    if (self->modification_count != self->tree->modification_count) {
        PyErr_SetString(PyExc_RuntimeError, 
                       "tree changed size during iteration");
        return NULL;
    }
    
    if (!self->current_node) {
        PyErr_SetNone(PyExc_StopIteration);
        return NULL;
    }
    
    /* Handle empty leaves at the beginning or during traversal */
    while (self->current_node && self->current_node->num_keys == 0) {
        self->current_node = self->current_node->next;
    }
    
    if (!self->current_node) {
        PyErr_SetNone(PyExc_StopIteration);
        return NULL;
    }
    
    if (self->current_index >= self->current_node->num_keys) {
        /* Move to next leaf, skipping empty ones */
        self->current_node = self->current_node->next;
        while (self->current_node && self->current_node->num_keys == 0) {
            self->current_node = self->current_node->next;
        }
        
        if (!self->current_node) {
            PyErr_SetNone(PyExc_StopIteration);
            return NULL;
        }
        
        self->current_index = 0;
    }
    
    PyObject *key = node_get_key(self->current_node, self->current_index);
    
    if (self->include_values) {
        PyObject *value = node_get_value(self->current_node, self->current_index);
        PyObject *tuple = PyTuple_New(2);
        if (!tuple) return NULL;
        
        Py_INCREF(key);
        Py_INCREF(value);
        PyTuple_SET_ITEM(tuple, 0, key);
        PyTuple_SET_ITEM(tuple, 1, value);
        self->current_index++;
        return tuple;
    } else {
        self->current_index++;
        Py_INCREF(key);
        return key;
    }
}