// color: 1 for leaf, 0 for inner
static int insert_internal(rxt_node *newleaf, rxt_node *n)
{
// FIRST: check for common bits
rxt_node *left = n->left, *right = n->right;
int bits = count_common_bits(newleaf->key, left->key,
rdx_min(newleaf->pos, left->pos));
int bits2 = count_common_bits(newleaf->key, right->key,
rdx_min(newleaf->pos, right->pos));
if (rdx_min(bits, bits2) < n->pos) {
if (bits >= bits2)
return insert_leaf(newleaf, n->left, n);
return insert_leaf(newleaf, n->right, n);
}
if (bits >= bits2) {
if (left->color)
return insert_leaf(newleaf, n->left, n);
return insert_internal(newleaf, left);
} else {
if (right->color)
return insert_leaf(newleaf, n->right, n);
return insert_internal(newleaf, right);
}
return -1; // this should never happen
}
static void insert_internal(struct Node** root, struct Node* node, int data) {
if (*root == NULL) {
*root = new_node(data);
return;
}
ASSERT(data != node->data, *root);
if (data < node->data) {
if (node->left == NULL) {
node->left = new_node(data);
node->left->parent = node;
update_height(node);
update_balance(root, node->parent);
} else {
insert_internal(root, node->left, data);
}
} else {
if (node->right == NULL) {
node->right = new_node(data);
node->right->parent = node;
update_height(node);
update_balance(root, node->parent);
} else {
insert_internal(root, node->right, data);
}
}
}
int rxt_put(char *key, void *value, rxt_node *n)
{
#define NEWLEAF(nl, k, v) \
nl = (rxt_node *)malloc(sizeof(rxt_node)); \
if (!nl) return -1; \
strncpy(nl->keycache, k, RADIXTREE_KEYSIZE); \
nl->keycache[RADIXTREE_KEYSIZE-1] = '\0'; \
nl->key = nl->keycache; \
nl->pos = keylen(k); \
nl->value = v; \
nl->color = 1; \
nl->parent = n; \
nl->left = NULL; \
nl->right = NULL
rxt_node *newleaf;
NEWLEAF(newleaf, key, value);
// this special case takes care of the first two entries
if (!(n->left || n->right)) {
rxt_node *sib;
int bits;
// create root
if (!n->value) {
// attach root
n->color = 2;
n->value = newleaf;
return 0;
}
// else convert root to inner and attach leaves
sib = (rxt_node *)n->value;
// count bits in common
bits = count_common_bits(key, sib->key,
rdx_min(newleaf->pos, sib->pos));
if (get_bit_at(key, bits)) {
n->right = newleaf;
n->left = sib;
} else {
n->right = sib;
n->left = newleaf;
}
n->value = NULL;
n->key = sib->key;
n->pos = bits;
n->color = 0;
return 0;
}
newleaf->parent = NULL; // null for now
return insert_internal(newleaf, n);
#undef NEWLEAF
}
void insert(struct Node** root, int data) {
insert_internal(root, *root, data);
}
