diff options
Diffstat (limited to 'src/avltree.h')
| -rw-r--r-- | src/avltree.h | 100 |
1 files changed, 50 insertions, 50 deletions
diff --git a/src/avltree.h b/src/avltree.h index ce6c49f..4d78b5b 100644 --- a/src/avltree.h +++ b/src/avltree.h @@ -31,8 +31,8 @@ * provide better average performance. */ -#ifndef _AVLTREE_H -#define _AVLTREE_H +#ifndef AVLTREE_H +#define AVLTREE_H #include <assert.h> #include <stddef.h> @@ -128,22 +128,22 @@ avltree_empty(const struct avltree *tree) */ #define avltree_lookup(tree, key, cmp_fn) \ MACRO_BEGIN \ - struct avltree_node *___cur; \ - int ___diff; \ + struct avltree_node *cur___; \ + int diff___; \ \ - ___cur = (tree)->root; \ + cur___ = (tree)->root; \ \ - while (___cur != NULL) { \ - ___diff = cmp_fn(key, ___cur); \ + while (cur___ != NULL) { \ + diff___ = cmp_fn(key, cur___); \ \ - if (___diff == 0) { \ + if (diff___ == 0) { \ break; \ } \ \ - ___cur = ___cur->children[avltree_d2i(___diff)]; \ + cur___ = cur___->children[avltree_d2i(diff___)]; \ } \ \ - ___cur; \ + cur___; \ MACRO_END /* @@ -158,30 +158,30 @@ MACRO_END */ #define avltree_lookup_nearest(tree, key, cmp_fn, dir) \ MACRO_BEGIN \ - struct avltree_node *___cur, *___prev; \ - int ___diff, ___index; \ + struct avltree_node *cur___, *prev___; \ + int diff___, index___; \ \ - ___prev = NULL; \ - ___index = 0; \ - ___cur = (tree)->root; \ + prev___ = NULL; \ + index___ = 0; \ + cur___ = (tree)->root; \ \ - while (___cur != NULL) { \ - ___diff = cmp_fn(key, ___cur); \ + while (cur___ != NULL) { \ + diff___ = cmp_fn(key, cur___); \ \ - if (___diff == 0) { \ + if (diff___ == 0) { \ break; \ } \ \ - ___prev = ___cur; \ - ___index = avltree_d2i(___diff); \ - ___cur = ___cur->children[___index]; \ + prev___ = cur___; \ + index___ = avltree_d2i(diff___); \ + cur___ = cur___->children[index___]; \ } \ \ - if (___cur == NULL) { \ - ___cur = avltree_nearest(___prev, ___index, dir); \ + if (cur___ == NULL) { \ + cur___ = avltree_nearest(prev___, index___, dir); \ } \ \ - ___cur; \ + cur___; \ MACRO_END /* @@ -200,22 +200,22 @@ MACRO_END */ #define avltree_insert(tree, node, cmp_fn) \ MACRO_BEGIN \ - struct avltree_node *___cur, *___prev; \ - int ___diff, ___index; \ + struct avltree_node *cur___, *prev___; \ + int diff___, index___; \ \ - ___prev = NULL; \ - ___index = 0; \ - ___cur = (tree)->root; \ + prev___ = NULL; \ + index___ = 0; \ + cur___ = (tree)->root; \ \ - while (___cur != NULL) { \ - ___diff = cmp_fn(node, ___cur); \ - assert(___diff != 0); \ - ___prev = ___cur; \ - ___index = avltree_d2i(___diff); \ - ___cur = ___cur->children[___index]; \ + while (cur___ != NULL) { \ + diff___ = cmp_fn(node, cur___); \ + assert(diff___ != 0); \ + prev___ = cur___; \ + index___ = avltree_d2i(diff___); \ + cur___ = cur___->children[index___]; \ } \ \ - avltree_insert_rebalance(tree, ___prev, ___index, node); \ + avltree_insert_rebalance(tree, prev___, index___, node); \ MACRO_END /* @@ -231,27 +231,27 @@ MACRO_END */ #define avltree_lookup_slot(tree, key, cmp_fn, slot) \ MACRO_BEGIN \ - struct avltree_node *___cur, *___prev; \ - int ___diff, ___index; \ + struct avltree_node *cur___, *prev___; \ + int diff___, index___; \ \ - ___prev = NULL; \ - ___index = 0; \ - ___cur = (tree)->root; \ + prev___ = NULL; \ + index___ = 0; \ + cur___ = (tree)->root; \ \ - while (___cur != NULL) { \ - ___diff = cmp_fn(key, ___cur); \ + while (cur___ != NULL) { \ + diff___ = cmp_fn(key, cur___); \ \ - if (___diff == 0) { \ + if (diff___ == 0) { \ break; \ } \ \ - ___prev = ___cur; \ - ___index = avltree_d2i(___diff); \ - ___cur = ___cur->children[___index]; \ + prev___ = cur___; \ + index___ = avltree_d2i(diff___); \ + cur___ = cur___->children[index___]; \ } \ \ - (slot) = avltree_slot(___prev, ___index); \ - ___cur; \ + (slot) = avltree_slot(prev___, index___); \ + cur___; \ MACRO_END /* @@ -326,4 +326,4 @@ for (node = avltree_postwalk_deepest(tree), \ node != NULL; \ node = tmp, tmp = avltree_postwalk_unlink(node)) -#endif /* _AVLTREE_H */ +#endif /* AVLTREE_H */ |