Store dentry children in red-black trees

[wimlib] / src / rbtree.c

diff --git a/src/rbtree.c b/src/rbtree.c
index 465d7148400f6cbcd1fba68feeedc069e814dae3..978844084dca8b22197b58f6c6d667a893a7318e 100644 (file)
--- a/src/rbtree.c
+++ b/src/rbtree.c
@@ -433,7 +433,7 @@ struct rb_node *rb_next(const struct rb_node *node)
         * as we can.
         */
        if (node->rb_right) {
-               node = node->rb_right; 
+               node = node->rb_right;
                while (node->rb_left)
                        node=node->rb_left;
                return (struct rb_node *)node;
@@ -464,7 +464,7 @@ struct rb_node *rb_prev(const struct rb_node *node)
         * as we can.
         */
        if (node->rb_left) {
-               node = node->rb_left; 
+               node = node->rb_left;
                while (node->rb_right)
                        node=node->rb_right;
                return (struct rb_node *)node;