The libintrusive from graphitemaster

libintrusive's People

Contributors

Stargazers

Watchers

libintrusive's Issues

Removal from a red-black tree is broken (segmentation fault)

I added only three lines to example.c (see the comments below for the specific additions) which insert a fourth node into the tree and attempt to remove a node from the tree. This results in a segmentation fault at rb.c:169.

void rb() {
    printf(">> RB\n");
    rb_tree_t tree;
    rb_init(&tree, NULL);

    test_rb_t a = { 1 };
    test_rb_t b = { 2 };
    test_rb_t c = { 3 };
    test_rb_t d = { 4 }; /* Addition 1 */

    rb_insert(&tree, &a.node, &test_rb_compare);
    rb_insert(&tree, &b.node, &test_rb_compare);
    rb_insert(&tree, &c.node, &test_rb_compare);
    rb_insert(&tree, &d.node, &test_rb_compare); /* Addition 2 */

    rb_remove(&tree, &a.node); /* Addition 3 */

    // Display them
    rb_node_t *node = rb_head(&tree);
    while (node) {
        rb_node_t *next = rb_next(node);
        rb_node_t *prev = rb_prev(node);
        test_rb_t *c = rb_ref(node, test_rb_t, node);
        test_rb_t *n = next ? rb_ref(next, test_rb_t, node) : NULL;
        test_rb_t *p = prev ? rb_ref(prev, test_rb_t, node) : NULL;
        printf("current: %d, next: %d, prev: %d\n",
                c->number,
                n ? n->number : -1,
                p ? p->number : -1);
        node = next;
    }
}

I know this project is fairly old and unmaintained, but I figured I might as well point this out in case future people attempt to use this as a resource.

Recommend Projects