Store dentry children in red-black trees

[wimlib] / src / rbtree.h

diff --git a/src/rbtree.h b/src/rbtree.h
index 6aa184957752dce6fbe809ab9652c030e2d657a3..3fa0f16c3a9937454bbbb1f4c782621c3d29f74e 100644 (file)
--- a/src/rbtree.h
+++ b/src/rbtree.h
@@ -1,7 +1,7 @@
 /*
   Red Black Trees
   (C) 1999  Andrea Arcangeli <andrea@suse.de>
-  
+
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2 of the License, or
@@ -68,7 +68,7 @@ extern struct rb_node *rb_first(const struct rb_root *);
 extern struct rb_node *rb_last(const struct rb_root *);
 
 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
-extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, 
+extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
                            struct rb_root *root);
 
 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,