Function node_find_position

python/bplustree_c_src/node_ops.c:68–89

Binary search to find position for key */

/* Binary search to find position for key */
int node_find_position(BPlusNode *node, PyObject *key) {
    int left = 0;
    int right = node->num_keys;
    
    while (left < right) {
        int mid = (left + right) / 2;
        PyObject *mid_key = node_get_key(node, mid);
        
        int result = fast_compare_lt(mid_key, key);
        if (result < 0) {
            return -1;  /* Error in comparison */
        }
        
        if (result) {
            left = mid + 1;
        } else {
            right = mid;
        }
    }
    
    return left;
}

/* Create a new node */
BPlusNode* node_create(NodeType type, uint16_t capacity) {