1 /* Sequential list data type implemented by a binary tree.
2 Copyright (C) 2006, 2008-2010 Free Software Foundation, Inc.
3 Written by Bruno Haible <bruno@clisp.org>, 2006.
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>. */
21 #include "gl_avltree_list.h"
25 /* -------------------------- gl_list_t Data Type -------------------------- */
27 /* Generic AVL tree code. */
28 #include "gl_anyavltree_list1.h"
30 /* Generic binary tree code. */
31 #include "gl_anytree_list1.h"
33 /* Generic AVL tree code. */
34 #include "gl_anyavltree_list2.h"
36 /* Generic binary tree code. */
37 #include "gl_anytree_list2.h"
41 check_invariants (gl_list_node_t node, gl_list_node_t parent)
43 unsigned int left_height =
44 (node->left != NULL ? check_invariants (node->left, node) : 0);
45 unsigned int right_height =
46 (node->right != NULL ? check_invariants (node->right, node) : 0);
47 int balance = (int)right_height - (int)left_height;
49 if (!(node->parent == parent))
51 if (!(node->branch_size
52 == (node->left != NULL ? node->left->branch_size : 0)
53 + 1 + (node->right != NULL ? node->right->branch_size : 0)))
55 if (!(balance >= -1 && balance <= 1))
57 if (!(node->balance == balance))
60 return 1 + (left_height > right_height ? left_height : right_height);
63 gl_avltree_list_check_invariants (gl_list_t list)
65 if (list->root != NULL)
66 check_invariants (list->root, NULL);
69 const struct gl_list_implementation gl_avltree_list_implementation =
71 gl_tree_nx_create_empty,
75 gl_tree_node_nx_set_value,
77 gl_tree_previous_node,
80 gl_tree_search_from_to,
81 gl_tree_indexof_from_to,
84 gl_tree_nx_add_before,
92 gl_tree_iterator_from_to,
93 gl_tree_iterator_next,
94 gl_tree_iterator_free,
95 gl_tree_sortedlist_search,
96 gl_tree_sortedlist_search_from_to,
97 gl_tree_sortedlist_indexof,
98 gl_tree_sortedlist_indexof_from_to,
99 gl_tree_sortedlist_nx_add,
100 gl_tree_sortedlist_remove