noselasd/libucore
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Rework RBTree to use RBNode in the compare function

Browse Source
This commit is contained in:
Nils O. Selåsdal
2013-06-10 23:00:24 +02:00
parent eba7590e6c
commit 150edaeada
3 changed files with 12 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/rbtree.c
+3 -3
View File
@@ -251,11 +251,11 @@ uc_rb_remove(RBTree *root, RBNode *node)
}
RBNode*
uc_rb_find(RBTree *root, const void *val)
uc_rb_find(RBTree *root, const RBNode *val)
{
RBNode *n = root->node;
while (n) {
int d = root->compare(val,n->data);
int d = root->compare(val,n);
if (d < 0)
n = n->left;
else if (d > 0)
@@ -274,7 +274,7 @@ uc_rb_insert(RBTree *root, RBNode *child)
int d;
while (*p) {
parent = *p;
d = root->compare(child->data, parent->data);
d = root->compare(child, parent);
if (d < 0)
p = &(*p)->left;
else if (d > 0)