1 /* Sequential list data type implemented by a hash table with a binary tree.
2 Copyright (C) 2006, 2008-2011 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_rbtreehash_list.h"
23 #include <stdint.h> /* for SIZE_MAX */
26 #include "gl_rbtree_oset.h"
30 # define uintptr_t unsigned long
33 #define WITH_HASHTABLE 1
35 /* Which kind of binary trees to use for ordered sets. Quite arbitrary. */
36 #define OSET_TREE_FLAVOR GL_RBTREE_OSET
38 /* -------------------------- gl_list_t Data Type -------------------------- */
40 /* Generic hash-table code: Type definitions. */
41 #include "gl_anyhash_list1.h"
43 /* Generic red-black tree code: Type definitions. */
44 #include "gl_anyrbtree_list1.h"
46 /* Generic hash-table code: Low-level code. */
47 #include "gl_anyhash_list2.h"
49 /* Generic binary tree code: Type definitions. */
50 #include "gl_anytree_list1.h"
52 /* Hash-table with binary tree code: Handling of hash buckets. */
53 #include "gl_anytreehash_list1.h"
55 /* Generic red-black tree code: Insertion/deletion algorithms. */
56 #include "gl_anyrbtree_list2.h"
58 /* Generic binary tree code: Functions taking advantage of the hash table. */
59 #include "gl_anytreehash_list2.h"
61 /* Generic binary tree code: All other functions. */
62 #include "gl_anytree_list2.h"
66 check_invariants (gl_list_node_t node, gl_list_node_t parent)
68 unsigned int left_blackheight =
69 (node->left != NULL ? check_invariants (node->left, node) : 0);
70 unsigned int right_blackheight =
71 (node->right != NULL ? check_invariants (node->right, node) : 0);
73 if (!(node->parent == parent))
75 if (!(node->branch_size
76 == (node->left != NULL ? node->left->branch_size : 0)
77 + 1 + (node->right != NULL ? node->right->branch_size : 0)))
79 if (!(node->color == BLACK || node->color == RED))
81 if (parent == NULL && !(node->color == BLACK))
83 if (!(left_blackheight == right_blackheight))
86 return left_blackheight + (node->color == BLACK ? 1 : 0);
89 gl_rbtreehash_list_check_invariants (gl_list_t list)
91 if (list->root != NULL)
92 check_invariants (list->root, NULL);
96 const struct gl_list_implementation gl_rbtreehash_list_implementation =
98 gl_tree_nx_create_empty,
102 gl_tree_node_nx_set_value,
104 gl_tree_previous_node,
107 gl_tree_search_from_to,
108 gl_tree_indexof_from_to,
109 gl_tree_nx_add_first,
111 gl_tree_nx_add_before,
112 gl_tree_nx_add_after,
119 gl_tree_iterator_from_to,
120 gl_tree_iterator_next,
121 gl_tree_iterator_free,
122 gl_tree_sortedlist_search,
123 gl_tree_sortedlist_search_from_to,
124 gl_tree_sortedlist_indexof,
125 gl_tree_sortedlist_indexof_from_to,
126 gl_tree_sortedlist_nx_add,
127 gl_tree_sortedlist_remove