mirror of
git://projects.qi-hardware.com/wernermisc.git
synced 2024-11-22 08:13:11 +02:00
qpkg/jrb.c: major whitespace readjustment (converted from GNU to K&R style)
This commit is contained in:
Werner Almesberger
parent
dec07f359a
commit
009f56c927
748
qpkg/jrb.c
748
qpkg/jrb.c
@ -51,453 +51,503 @@ static JRB rprev(JRB n);
|
||||
static void recolor(JRB n);
|
||||
static void single_rotate(JRB y, int l);
|
||||
|
||||
#define isred(n) (n->red)
|
||||
#define isblack(n) (!isred(n))
|
||||
#define isleft(n) (n->left)
|
||||
#define isright(n) (!isleft(n))
|
||||
#define isint(n) (n->internal)
|
||||
#define isext(n) (!isint(n))
|
||||
#define ishead(n) (n->roothead & 2)
|
||||
#define isroot(n) (n->roothead & 1)
|
||||
#define getlext(n) ((struct jrb_node *)(n->key))
|
||||
#define isred(n) (n->red)
|
||||
#define isblack(n) (!isred(n))
|
||||
#define isleft(n) (n->left)
|
||||
#define isright(n) (!isleft(n))
|
||||
#define isint(n) (n->internal)
|
||||
#define isext(n) (!isint(n))
|
||||
#define ishead(n) (n->roothead & 2)
|
||||
#define isroot(n) (n->roothead & 1)
|
||||
#define getlext(n) ((struct jrb_node *) (n->key))
|
||||
#define setlext(node, val) node->key = (void *) (val)
|
||||
#define getrext(n) ((struct jrb_node *)(n->val))
|
||||
#define getrext(n) ((struct jrb_node *) (n->val))
|
||||
#define setrext(node, value) node->val = (void *) (value)
|
||||
#define setred(n) n->red = 1
|
||||
#define setblack(n) n->red = 0
|
||||
#define setleft(n) n->left = 1
|
||||
#define setright(n) n->left = 0
|
||||
#define sethead(n) (n->roothead |= 2)
|
||||
#define setroot(n) (n->roothead |= 1)
|
||||
#define setint(n) n->internal = 1
|
||||
#define setext(n) n->internal = 0
|
||||
#define setnormal(n) n->roothead = 0
|
||||
#define sibling(n) ((isleft(n)) ? n->parent->blink : n->parent->flink)
|
||||
#define setred(n) n->red = 1
|
||||
#define setblack(n) n->red = 0
|
||||
#define setleft(n) n->left = 1
|
||||
#define setright(n) n->left = 0
|
||||
#define sethead(n) (n->roothead |= 2)
|
||||
#define setroot(n) (n->roothead |= 1)
|
||||
#define setint(n) n->internal = 1
|
||||
#define setext(n) n->internal = 0
|
||||
#define setnormal(n) n->roothead = 0
|
||||
#define sibling(n) (isleft(n) ? n->parent->blink : n->parent->flink)
|
||||
|
||||
|
||||
static void insert(JRB item, JRB list) /* Inserts to the end of a list */
|
||||
{
|
||||
JRB last_node;
|
||||
JRB last_node;
|
||||
|
||||
last_node = list->blink;
|
||||
last_node = list->blink;
|
||||
|
||||
list->blink = item;
|
||||
last_node->flink = item;
|
||||
item->blink = last_node;
|
||||
item->flink = list;
|
||||
list->blink = item;
|
||||
last_node->flink = item;
|
||||
item->blink = last_node;
|
||||
item->flink = list;
|
||||
}
|
||||
|
||||
|
||||
static void delete_item(JRB item) /* Deletes an arbitrary iterm */
|
||||
{
|
||||
item->flink->blink = item->blink;
|
||||
item->blink->flink = item->flink;
|
||||
item->flink->blink = item->blink;
|
||||
item->blink->flink = item->flink;
|
||||
}
|
||||
|
||||
#define mk_new_ext(new, kkkey, vvval) {\
|
||||
new = (JRB) malloc(sizeof(struct jrb_node));\
|
||||
new->val = vvval;\
|
||||
new->key = kkkey;\
|
||||
setext(new);\
|
||||
setblack(new);\
|
||||
setnormal(new);\
|
||||
#define mk_new_ext(new, kkkey, vvval) { \
|
||||
new = (JRB) malloc(sizeof(struct jrb_node)); \
|
||||
new->val = vvval; \
|
||||
new->key = kkkey; \
|
||||
setext(new); \
|
||||
setblack(new); \
|
||||
setnormal(new); \
|
||||
}
|
||||
|
||||
static void mk_new_int(JRB l, JRB r, JRB p, int il)
|
||||
{
|
||||
JRB newnode;
|
||||
JRB newnode;
|
||||
|
||||
newnode = (JRB) malloc(sizeof(struct jrb_node));
|
||||
setint(newnode);
|
||||
setred(newnode);
|
||||
setnormal(newnode);
|
||||
newnode->flink = l;
|
||||
newnode->blink = r;
|
||||
newnode->parent = p;
|
||||
setlext(newnode, l);
|
||||
setrext(newnode, r);
|
||||
l->parent = newnode;
|
||||
r->parent = newnode;
|
||||
setleft(l);
|
||||
setright(r);
|
||||
if (ishead(p)) {
|
||||
p->parent = newnode;
|
||||
setroot(newnode);
|
||||
} else if (il) {
|
||||
setleft(newnode);
|
||||
p->flink = newnode;
|
||||
} else {
|
||||
setright(newnode);
|
||||
p->blink = newnode;
|
||||
}
|
||||
recolor(newnode);
|
||||
newnode = (JRB) malloc(sizeof(struct jrb_node));
|
||||
setint(newnode);
|
||||
setred(newnode);
|
||||
setnormal(newnode);
|
||||
newnode->flink = l;
|
||||
newnode->blink = r;
|
||||
newnode->parent = p;
|
||||
setlext(newnode, l);
|
||||
setrext(newnode, r);
|
||||
l->parent = newnode;
|
||||
r->parent = newnode;
|
||||
setleft(l);
|
||||
setright(r);
|
||||
if (ishead(p)) {
|
||||
p->parent = newnode;
|
||||
setroot(newnode);
|
||||
} else if (il) {
|
||||
setleft(newnode);
|
||||
p->flink = newnode;
|
||||
} else {
|
||||
setright(newnode);
|
||||
p->blink = newnode;
|
||||
}
|
||||
recolor(newnode);
|
||||
}
|
||||
|
||||
|
||||
JRB lprev(JRB n)
|
||||
{
|
||||
if (ishead(n)) return n;
|
||||
while (!isroot(n)) {
|
||||
if (isright(n)) return n->parent;
|
||||
n = n->parent;
|
||||
}
|
||||
return n->parent;
|
||||
if (ishead(n))
|
||||
return n;
|
||||
while (!isroot(n)) {
|
||||
if (isright(n))
|
||||
return n->parent;
|
||||
n = n->parent;
|
||||
}
|
||||
return n->parent;
|
||||
}
|
||||
|
||||
|
||||
JRB rprev(JRB n)
|
||||
{
|
||||
if (ishead(n)) return n;
|
||||
while (!isroot(n)) {
|
||||
if (isleft(n)) return n->parent;
|
||||
n = n->parent;
|
||||
}
|
||||
return n->parent;
|
||||
if (ishead(n))
|
||||
return n;
|
||||
while (!isroot(n)) {
|
||||
if (isleft(n))
|
||||
return n->parent;
|
||||
n = n->parent;
|
||||
}
|
||||
return n->parent;
|
||||
}
|
||||
|
||||
|
||||
JRB make_jrb(void)
|
||||
{
|
||||
JRB head;
|
||||
JRB head;
|
||||
|
||||
head = (JRB) malloc (sizeof(struct jrb_node));
|
||||
head->flink = head;
|
||||
head->blink = head;
|
||||
head->parent = head;
|
||||
head->key = NULL;
|
||||
sethead(head);
|
||||
return head;
|
||||
head = (JRB) malloc(sizeof(struct jrb_node));
|
||||
head->flink = head;
|
||||
head->blink = head;
|
||||
head->parent = head;
|
||||
head->key = NULL;
|
||||
sethead(head);
|
||||
return head;
|
||||
}
|
||||
|
||||
|
||||
JRB jrb_find_gte(JRB n, const void *key,
|
||||
int (*fxn)(const void *, const void *), int *fnd)
|
||||
{
|
||||
int cmp;
|
||||
int cmp;
|
||||
|
||||
*fnd = 0;
|
||||
if (!ishead(n)) {
|
||||
fprintf(stderr, "jrb_find_gte_str called on non-head %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
if (n->parent == n) return n;
|
||||
cmp = (*fxn)(key, n->blink->key);
|
||||
if (cmp == 0) {
|
||||
*fnd = 1;
|
||||
return n->blink;
|
||||
}
|
||||
if (cmp > 0) return n;
|
||||
else n = n->parent;
|
||||
while (1) {
|
||||
if (isext(n)) return n;
|
||||
cmp = (*fxn)(key, getlext(n)->key);
|
||||
if (cmp == 0) {
|
||||
*fnd = 1;
|
||||
return getlext(n);
|
||||
}
|
||||
if (cmp < 0) n = n->flink ; else n = n->blink;
|
||||
}
|
||||
*fnd = 0;
|
||||
if (!ishead(n)) {
|
||||
fprintf(stderr, "jrb_find_gte_str called on non-head %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
if (n->parent == n)
|
||||
return n;
|
||||
cmp = (*fxn)(key, n->blink->key);
|
||||
if (cmp == 0) {
|
||||
*fnd = 1;
|
||||
return n->blink;
|
||||
}
|
||||
if (cmp > 0)
|
||||
return n;
|
||||
else
|
||||
n = n->parent;
|
||||
while (1) {
|
||||
if (isext(n))
|
||||
return n;
|
||||
cmp = (*fxn)(key, getlext(n)->key);
|
||||
if (cmp == 0) {
|
||||
*fnd = 1;
|
||||
return getlext(n);
|
||||
}
|
||||
if (cmp < 0)
|
||||
n = n->flink;
|
||||
else
|
||||
n = n->blink;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
JRB jrb_find(JRB n, const void *key, int (*fxn)(const void *, const void *))
|
||||
{
|
||||
int fnd;
|
||||
JRB j;
|
||||
int fnd;
|
||||
JRB j;
|
||||
|
||||
j = jrb_find_gte(n, key, fxn, &fnd);
|
||||
if (fnd) return j; else return NULL;
|
||||
j = jrb_find_gte(n, key, fxn, &fnd);
|
||||
if (fnd)
|
||||
return j;
|
||||
else
|
||||
return NULL;
|
||||
}
|
||||
|
||||
|
||||
static JRB jrb_insert_b(JRB n, void *key, void *val)
|
||||
{
|
||||
JRB newleft, newright, newnode, p;
|
||||
JRB newleft, newright, newnode, p;
|
||||
|
||||
if (ishead(n)) {
|
||||
if (n->parent == n) { /* Tree is empty */
|
||||
mk_new_ext(newnode, key, val);
|
||||
insert(newnode, n);
|
||||
n->parent = newnode;
|
||||
newnode->parent = n;
|
||||
setroot(newnode);
|
||||
return newnode;
|
||||
} else {
|
||||
mk_new_ext(newright, key, val);
|
||||
insert(newright, n);
|
||||
newleft = newright->blink;
|
||||
setnormal(newleft);
|
||||
mk_new_int(newleft, newright, newleft->parent, isleft(newleft));
|
||||
p = rprev(newright);
|
||||
if (!ishead(p)) setlext(p, newright);
|
||||
return newright;
|
||||
}
|
||||
} else {
|
||||
mk_new_ext(newleft, key, val);
|
||||
insert(newleft, n);
|
||||
setnormal(n);
|
||||
mk_new_int(newleft, n, n->parent, isleft(n));
|
||||
p = lprev(newleft);
|
||||
if (!ishead(p)) setrext(p, newleft);
|
||||
return newleft;
|
||||
}
|
||||
if (ishead(n)) {
|
||||
if (n->parent == n) { /* Tree is empty */
|
||||
mk_new_ext(newnode, key, val);
|
||||
insert(newnode, n);
|
||||
n->parent = newnode;
|
||||
newnode->parent = n;
|
||||
setroot(newnode);
|
||||
return newnode;
|
||||
} else {
|
||||
mk_new_ext(newright, key, val);
|
||||
insert(newright, n);
|
||||
newleft = newright->blink;
|
||||
setnormal(newleft);
|
||||
mk_new_int(newleft, newright, newleft->parent,
|
||||
isleft(newleft));
|
||||
p = rprev(newright);
|
||||
if (!ishead(p))
|
||||
setlext(p, newright);
|
||||
return newright;
|
||||
}
|
||||
} else {
|
||||
mk_new_ext(newleft, key, val);
|
||||
insert(newleft, n);
|
||||
setnormal(n);
|
||||
mk_new_int(newleft, n, n->parent, isleft(n));
|
||||
p = lprev(newleft);
|
||||
if (!ishead(p))
|
||||
setrext(p, newleft);
|
||||
return newleft;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void recolor(JRB n)
|
||||
{
|
||||
JRB p, gp, s;
|
||||
int done = 0;
|
||||
JRB p, gp, s;
|
||||
int done = 0;
|
||||
|
||||
while(!done) {
|
||||
if (isroot(n)) {
|
||||
setblack(n);
|
||||
return;
|
||||
}
|
||||
while(!done) {
|
||||
if (isroot(n)) {
|
||||
setblack(n);
|
||||
return;
|
||||
}
|
||||
|
||||
p = n->parent;
|
||||
p = n->parent;
|
||||
|
||||
if (isblack(p)) return;
|
||||
if (isblack(p))
|
||||
return;
|
||||
|
||||
if (isroot(p)) {
|
||||
setblack(p);
|
||||
return;
|
||||
}
|
||||
if (isroot(p)) {
|
||||
setblack(p);
|
||||
return;
|
||||
}
|
||||
|
||||
gp = p->parent;
|
||||
s = sibling(p);
|
||||
if (isred(s)) {
|
||||
setblack(p);
|
||||
setred(gp);
|
||||
setblack(s);
|
||||
n = gp;
|
||||
} else {
|
||||
done = 1;
|
||||
}
|
||||
}
|
||||
/* p's sibling is black, p is red, gp is black */
|
||||
gp = p->parent;
|
||||
s = sibling(p);
|
||||
if (isred(s)) {
|
||||
setblack(p);
|
||||
setred(gp);
|
||||
setblack(s);
|
||||
n = gp;
|
||||
} else {
|
||||
done = 1;
|
||||
}
|
||||
}
|
||||
/* p's sibling is black, p is red, gp is black */
|
||||
|
||||
if ((isleft(n) == 0) == (isleft(p) == 0)) {
|
||||
single_rotate(gp, isleft(n));
|
||||
setblack(p);
|
||||
setred(gp);
|
||||
} else {
|
||||
single_rotate(p, isleft(n));
|
||||
single_rotate(gp, isleft(n));
|
||||
setblack(n);
|
||||
setred(gp);
|
||||
}
|
||||
if ((isleft(n) == 0) == (isleft(p) == 0)) {
|
||||
single_rotate(gp, isleft(n));
|
||||
setblack(p);
|
||||
setred(gp);
|
||||
} else {
|
||||
single_rotate(p, isleft(n));
|
||||
single_rotate(gp, isleft(n));
|
||||
setblack(n);
|
||||
setred(gp);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
static void single_rotate(JRB y, int l)
|
||||
{
|
||||
int rl = 0 /* for gcc */, ir;
|
||||
JRB x, yp;
|
||||
int rl = 0 /* for gcc */, ir;
|
||||
JRB x, yp;
|
||||
|
||||
ir = isroot(y);
|
||||
yp = y->parent;
|
||||
if (!ir) {
|
||||
rl = isleft(y);
|
||||
}
|
||||
ir = isroot(y);
|
||||
yp = y->parent;
|
||||
if (!ir)
|
||||
rl = isleft(y);
|
||||
|
||||
if (l) {
|
||||
x = y->flink;
|
||||
y->flink = x->blink;
|
||||
setleft(y->flink);
|
||||
y->flink->parent = y;
|
||||
x->blink = y;
|
||||
setright(y);
|
||||
} else {
|
||||
x = y->blink;
|
||||
y->blink = x->flink;
|
||||
setright(y->blink);
|
||||
y->blink->parent = y;
|
||||
x->flink = y;
|
||||
setleft(y);
|
||||
}
|
||||
if (l) {
|
||||
x = y->flink;
|
||||
y->flink = x->blink;
|
||||
setleft(y->flink);
|
||||
y->flink->parent = y;
|
||||
x->blink = y;
|
||||
setright(y);
|
||||
} else {
|
||||
x = y->blink;
|
||||
y->blink = x->flink;
|
||||
setright(y->blink);
|
||||
y->blink->parent = y;
|
||||
x->flink = y;
|
||||
setleft(y);
|
||||
}
|
||||
|
||||
x->parent = yp;
|
||||
y->parent = x;
|
||||
if (ir) {
|
||||
yp->parent = x;
|
||||
setnormal(y);
|
||||
setroot(x);
|
||||
} else {
|
||||
if (rl) {
|
||||
yp->flink = x;
|
||||
setleft(x);
|
||||
} else {
|
||||
yp->blink = x;
|
||||
setright(x);
|
||||
}
|
||||
}
|
||||
x->parent = yp;
|
||||
y->parent = x;
|
||||
if (ir) {
|
||||
yp->parent = x;
|
||||
setnormal(y);
|
||||
setroot(x);
|
||||
} else {
|
||||
if (rl) {
|
||||
yp->flink = x;
|
||||
setleft(x);
|
||||
} else {
|
||||
yp->blink = x;
|
||||
setright(x);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
void jrb_delete_node(JRB n)
|
||||
{
|
||||
JRB s, p, gp;
|
||||
char ir;
|
||||
JRB s, p, gp;
|
||||
char ir;
|
||||
|
||||
if (isint(n)) {
|
||||
fprintf(stderr, "Cannot delete an internal node: %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
if (ishead(n)) {
|
||||
fprintf(stderr, "Cannot delete the head of an jrb_tree: %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
delete_item(n); /* Delete it from the list */
|
||||
p = n->parent; /* The only node */
|
||||
if (isroot(n)) {
|
||||
p->parent = p;
|
||||
free(n);
|
||||
return;
|
||||
}
|
||||
s = sibling(n); /* The only node after deletion */
|
||||
if (isroot(p)) {
|
||||
s->parent = p->parent;
|
||||
s->parent->parent = s;
|
||||
setroot(s);
|
||||
free(p);
|
||||
free(n);
|
||||
return;
|
||||
}
|
||||
gp = p->parent; /* Set parent to sibling */
|
||||
s->parent = gp;
|
||||
if (isleft(p)) {
|
||||
gp->flink = s;
|
||||
setleft(s);
|
||||
} else {
|
||||
gp->blink = s;
|
||||
setright(s);
|
||||
}
|
||||
ir = isred(p);
|
||||
free(p);
|
||||
free(n);
|
||||
if (isint(n)) {
|
||||
fprintf(stderr, "Cannot delete an internal node: %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
if (ishead(n)) {
|
||||
fprintf(stderr,
|
||||
"Cannot delete the head of an jrb_tree: %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
delete_item(n); /* Delete it from the list */
|
||||
p = n->parent; /* The only node */
|
||||
if (isroot(n)) {
|
||||
p->parent = p;
|
||||
free(n);
|
||||
return;
|
||||
}
|
||||
s = sibling(n); /* The only node after deletion */
|
||||
if (isroot(p)) {
|
||||
s->parent = p->parent;
|
||||
s->parent->parent = s;
|
||||
setroot(s);
|
||||
free(p);
|
||||
free(n);
|
||||
return;
|
||||
}
|
||||
gp = p->parent; /* Set parent to sibling */
|
||||
s->parent = gp;
|
||||
if (isleft(p)) {
|
||||
gp->flink = s;
|
||||
setleft(s);
|
||||
} else {
|
||||
gp->blink = s;
|
||||
setright(s);
|
||||
}
|
||||
ir = isred(p);
|
||||
free(p);
|
||||
free(n);
|
||||
|
||||
if (isext(s)) { /* Update proper rext and lext values */
|
||||
p = lprev(s);
|
||||
if (!ishead(p)) setrext(p, s);
|
||||
p = rprev(s);
|
||||
if (!ishead(p)) setlext(p, s);
|
||||
} else if (isblack(s)) {
|
||||
fprintf(stderr, "DELETION PROB -- sib is black, internal\n");
|
||||
exit(1);
|
||||
} else {
|
||||
p = lprev(s);
|
||||
if (!ishead(p)) setrext(p, s->flink);
|
||||
p = rprev(s);
|
||||
if (!ishead(p)) setlext(p, s->blink);
|
||||
setblack(s);
|
||||
return;
|
||||
}
|
||||
if (isext(s)) { /* Update proper rext and lext values */
|
||||
p = lprev(s);
|
||||
if (!ishead(p))
|
||||
setrext(p, s);
|
||||
p = rprev(s);
|
||||
if (!ishead(p))
|
||||
setlext(p, s);
|
||||
} else if (isblack(s)) {
|
||||
fprintf(stderr, "DELETION PROB -- sib is black, internal\n");
|
||||
exit(1);
|
||||
} else {
|
||||
p = lprev(s);
|
||||
if (!ishead(p))
|
||||
setrext(p, s->flink);
|
||||
p = rprev(s);
|
||||
if (!ishead(p))
|
||||
setlext(p, s->blink);
|
||||
setblack(s);
|
||||
return;
|
||||
}
|
||||
|
||||
if (ir) return;
|
||||
if (ir)
|
||||
return;
|
||||
|
||||
/* Recolor */
|
||||
/* Recolor */
|
||||
|
||||
n = s;
|
||||
p = n->parent;
|
||||
s = sibling(n);
|
||||
while(isblack(p) && isblack(s) && isint(s) &&
|
||||
isblack(s->flink) && isblack(s->blink)) {
|
||||
setred(s);
|
||||
n = p;
|
||||
if (isroot(n)) return;
|
||||
p = n->parent;
|
||||
s = sibling(n);
|
||||
}
|
||||
n = s;
|
||||
p = n->parent;
|
||||
s = sibling(n);
|
||||
while(isblack(p) && isblack(s) && isint(s) &&
|
||||
isblack(s->flink) && isblack(s->blink)) {
|
||||
setred(s);
|
||||
n = p;
|
||||
if (isroot(n))
|
||||
return;
|
||||
p = n->parent;
|
||||
s = sibling(n);
|
||||
}
|
||||
|
||||
if (isblack(p) && isred(s)) { /* Rotation 2.3b */
|
||||
single_rotate(p, isright(n));
|
||||
setred(p);
|
||||
setblack(s);
|
||||
s = sibling(n);
|
||||
}
|
||||
if (isblack(p) && isred(s)) { /* Rotation 2.3b */
|
||||
single_rotate(p, isright(n));
|
||||
setred(p);
|
||||
setblack(s);
|
||||
s = sibling(n);
|
||||
}
|
||||
|
||||
{ JRB x, z; char il;
|
||||
{
|
||||
JRB x, z; char il;
|
||||
|
||||
if (isext(s)) {
|
||||
fprintf(stderr, "DELETION ERROR: sibling not internal\n");
|
||||
exit(1);
|
||||
}
|
||||
if (isext(s)) {
|
||||
fprintf(stderr,
|
||||
"DELETION ERROR: sibling not internal\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
il = isleft(n);
|
||||
x = il ? s->flink : s->blink ;
|
||||
z = sibling(x);
|
||||
il = isleft(n);
|
||||
x = il ? s->flink : s->blink;
|
||||
z = sibling(x);
|
||||
|
||||
if (isred(z)) { /* Rotation 2.3f */
|
||||
single_rotate(p, !il);
|
||||
setblack(z);
|
||||
if (isred(p)) setred(s); else setblack(s);
|
||||
setblack(p);
|
||||
} else if (isblack(x)) { /* Recoloring only (2.3c) */
|
||||
if (isred(s) || isblack(p)) {
|
||||
fprintf(stderr, "DELETION ERROR: 2.3c not quite right\n");
|
||||
exit(1);
|
||||
}
|
||||
setblack(p);
|
||||
setred(s);
|
||||
return;
|
||||
} else if (isred(p)) { /* 2.3d */
|
||||
single_rotate(s, il);
|
||||
single_rotate(p, !il);
|
||||
setblack(x);
|
||||
setred(s);
|
||||
return;
|
||||
} else { /* 2.3e */
|
||||
single_rotate(s, il);
|
||||
single_rotate(p, !il);
|
||||
setblack(x);
|
||||
return;
|
||||
}
|
||||
}
|
||||
if (isred(z)) { /* Rotation 2.3f */
|
||||
single_rotate(p, !il);
|
||||
setblack(z);
|
||||
if (isred(p))
|
||||
setred(s);
|
||||
else
|
||||
setblack(s);
|
||||
setblack(p);
|
||||
} else if (isblack(x)) { /* Recoloring only (2.3c) */
|
||||
if (isred(s) || isblack(p)) {
|
||||
fprintf(stderr,
|
||||
"DELETION ERROR: 2.3c not quite right\n");
|
||||
exit(1);
|
||||
}
|
||||
setblack(p);
|
||||
setred(s);
|
||||
return;
|
||||
} else if (isred(p)) { /* 2.3d */
|
||||
single_rotate(s, il);
|
||||
single_rotate(p, !il);
|
||||
setblack(x);
|
||||
setred(s);
|
||||
return;
|
||||
} else { /* 2.3e */
|
||||
single_rotate(s, il);
|
||||
single_rotate(p, !il);
|
||||
setblack(x);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
int jrb_nblack(JRB n)
|
||||
{
|
||||
int nb;
|
||||
if (ishead(n) || isint(n)) {
|
||||
fprintf(stderr, "ERROR: jrb_nblack called on a non-external node %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
nb = 0;
|
||||
while(!ishead(n)) {
|
||||
if (isblack(n)) nb++;
|
||||
n = n->parent;
|
||||
}
|
||||
return nb;
|
||||
int nb;
|
||||
|
||||
if (ishead(n) || isint(n)) {
|
||||
fprintf(stderr,
|
||||
"ERROR: jrb_nblack called on a non-external node %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
nb = 0;
|
||||
while(!ishead(n)) {
|
||||
if (isblack(n)) nb++;
|
||||
n = n->parent;
|
||||
}
|
||||
return nb;
|
||||
}
|
||||
|
||||
|
||||
int jrb_plength(JRB n)
|
||||
{
|
||||
int pl;
|
||||
if (ishead(n) || isint(n)) {
|
||||
fprintf(stderr, "ERROR: jrb_plength called on a non-external node %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
pl = 0;
|
||||
while(!ishead(n)) {
|
||||
pl++;
|
||||
n = n->parent;
|
||||
}
|
||||
return pl;
|
||||
int pl;
|
||||
|
||||
if (ishead(n) || isint(n)) {
|
||||
fprintf(stderr,
|
||||
"ERROR: jrb_plength called on a non-external node %p\n", n);
|
||||
exit(1);
|
||||
}
|
||||
pl = 0;
|
||||
while (!ishead(n)) {
|
||||
pl++;
|
||||
n = n->parent;
|
||||
}
|
||||
return pl;
|
||||
}
|
||||
|
||||
|
||||
void jrb_free_tree(JRB n)
|
||||
{
|
||||
if (!ishead(n)) {
|
||||
fprintf(stderr, "ERROR: Rb_free_tree called on a non-head node\n");
|
||||
exit(1);
|
||||
}
|
||||
if (!ishead(n)) {
|
||||
fprintf(stderr,
|
||||
"ERROR: Rb_free_tree called on a non-head node\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
while(jrb_first(n) != jrb_nil(n)) {
|
||||
jrb_delete_node(jrb_first(n));
|
||||
}
|
||||
free(n);
|
||||
while(jrb_first(n) != jrb_nil(n))
|
||||
jrb_delete_node(jrb_first(n));
|
||||
|
||||
free(n);
|
||||
}
|
||||
|
||||
|
||||
void *jrb_val(JRB n)
|
||||
{
|
||||
return n->val;
|
||||
return n->val;
|
||||
}
|
||||
|
||||
|
||||
JRB jrb_insert(JRB tree, void *key, void *val,
|
||||
int (*func)(const void *, const void *))
|
||||
int (*func)(const void *a, const void *b))
|
||||
{
|
||||
int fnd;
|
||||
int fnd;
|
||||
|
||||
return jrb_insert_b(jrb_find_gte(tree, key, func, &fnd), key, val);
|
||||
return jrb_insert_b(jrb_find_gte(tree, key, func, &fnd), key, val);
|
||||
}
|
||||
|
||||
Loading…
Reference in New Issue
Block a user