1 /* Sequential list data type implemented by a hash table with a binary tree.
2 Copyright (C) 2006-2007 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 2, or (at your option)
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, write to the Free Software Foundation,
17 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
19 /* Common code of gl_avltreehash_list.c and gl_rbtreehash_list.c. */
21 /* Hash table entry representing the same value at more than one position. */
22 struct gl_multiple_nodes
24 struct gl_hash_entry h; /* hash table entry fields; must be first */
25 void *magic; /* used to distinguish from single node */
26 gl_oset_t nodes; /* set of nodes, sorted by position */
28 /* A value that cannot occur at the corresponding field (->left) in
30 #define MULTIPLE_NODES_MAGIC (void *) -1
32 /* Resize the hash table if needed, after list->count was incremented. */
34 hash_resize_after_add (gl_list_t list)
36 size_t count = (list->root != 0 ? list->root->branch_size : 0);
37 size_t estimate = xsum (count, count / 2); /* 1.5 * count */
38 if (estimate > list->table_size)
39 hash_resize (list, estimate);
42 /* Return the position of the given node in the tree. */
44 node_position (gl_list_node_t node)
48 if (node->left != NULL)
49 position += node->left->branch_size;
52 gl_list_node_t parent = node->parent;
56 /* position is now relative to the subtree of node. */
57 if (parent->right == node)
60 if (parent->left != NULL)
61 position += parent->left->branch_size;
63 /* position is now relative to the subtree of parent. */
68 /* Compares two nodes by their position in the tree. */
70 compare_by_position (const void *x1, const void *x2)
72 gl_list_node_t node1 = (gl_list_node_t) x1;
73 gl_list_node_t node2 = (gl_list_node_t) x2;
74 size_t position1 = node_position (node1);
75 size_t position2 = node_position (node2);
77 return (position1 > position2 ? 1 :
78 position1 < position2 ? -1 : 0);
81 /* Compares a node's position in the tree with a given threshold. */
83 compare_position_threshold (const void *x, const void *threshold)
85 gl_list_node_t node = (gl_list_node_t) x;
86 size_t position = node_position (node);
87 return (position >= (uintptr_t)threshold);
90 /* Return the first element of a non-empty ordered set of nodes. */
91 static inline gl_list_node_t
92 gl_oset_first (gl_oset_t set)
94 gl_oset_iterator_t iter = gl_oset_iterator (set);
97 if (!gl_oset_iterator_next (&iter, &first))
99 gl_oset_iterator_free (&iter);
100 return (gl_list_node_t) first;
103 /* Add a node to the hash table structure.
104 If duplicates are allowed, this function performs in average time
105 O((log n)^2): gl_oset_add may need to add an element to an ordered set of
106 size O(n), needing O(log n) comparison function calls. The comparison
107 function is compare_by_position, which is O(log n) worst-case.
108 If duplicates are forbidden, this function is O(1). */
110 add_to_bucket (gl_list_t list, gl_list_node_t new_node)
112 size_t bucket = new_node->h.hashcode % list->table_size;
114 /* If no duplicates are allowed, multiple nodes are not needed. */
115 if (list->base.allow_duplicates)
117 size_t hashcode = new_node->h.hashcode;
118 const void *value = new_node->value;
119 gl_listelement_equals_fn equals = list->base.equals_fn;
120 gl_hash_entry_t *entryp;
122 for (entryp = &list->table[bucket]; *entryp != NULL; entryp = &(*entryp)->hash_next)
124 gl_hash_entry_t entry = *entryp;
126 if (entry->hashcode == hashcode)
128 if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC)
130 /* An entry representing multiple nodes. */
131 gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
132 /* Only the first node is interesting. */
133 gl_list_node_t node = gl_oset_first (nodes);
134 if (equals != NULL ? equals (value, node->value) : value == node->value)
136 /* Found already multiple nodes with the same value.
137 Add the new_node to it. */
138 gl_oset_add (nodes, new_node);
144 /* An entry representing a single node. */
145 gl_list_node_t node = (struct gl_list_node_impl *) entry;
146 if (equals != NULL ? equals (value, node->value) : value == node->value)
148 /* Found already a node with the same value. Turn it
149 into an ordered set, and add new_node to it. */
151 struct gl_multiple_nodes *multi_entry;
154 gl_oset_create_empty (OSET_TREE_FLAVOR,
155 compare_by_position, NULL);
157 gl_oset_add (nodes, node);
158 gl_oset_add (nodes, new_node);
160 multi_entry = XMALLOC (struct gl_multiple_nodes);
161 multi_entry->h.hash_next = entry->hash_next;
162 multi_entry->h.hashcode = entry->hashcode;
163 multi_entry->magic = MULTIPLE_NODES_MAGIC;
164 multi_entry->nodes = nodes;
165 *entryp = &multi_entry->h;
172 /* If no duplicates are allowed, multiple nodes are not needed. */
173 new_node->h.hash_next = list->table[bucket];
174 list->table[bucket] = &new_node->h;
177 /* Remove a node from the hash table structure.
178 If duplicates are allowed, this function performs in average time
179 O((log n)^2): gl_oset_remove may need to remove an element from an ordered
180 set of size O(n), needing O(log n) comparison function calls. The
181 comparison function is compare_by_position, which is O(log n) worst-case.
182 If duplicates are forbidden, this function is O(1) on average. */
184 remove_from_bucket (gl_list_t list, gl_list_node_t old_node)
186 size_t bucket = old_node->h.hashcode % list->table_size;
188 if (list->base.allow_duplicates)
190 size_t hashcode = old_node->h.hashcode;
191 const void *value = old_node->value;
192 gl_listelement_equals_fn equals = list->base.equals_fn;
193 gl_hash_entry_t *entryp;
195 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next)
197 gl_hash_entry_t entry = *entryp;
199 if (entry == &old_node->h)
201 /* Found old_node as a single node in the bucket. Remove it. */
202 *entryp = old_node->h.hash_next;
206 /* node is not in the right bucket. Did the hash codes
207 change inadvertently? */
209 if (((struct gl_multiple_nodes *) entry)->magic == MULTIPLE_NODES_MAGIC
210 && entry->hashcode == hashcode)
212 /* An entry representing multiple nodes. */
213 gl_oset_t nodes = ((struct gl_multiple_nodes *) entry)->nodes;
214 /* Only the first node is interesting. */
215 gl_list_node_t node = gl_oset_first (nodes);
216 if (equals != NULL ? equals (value, node->value) : value == node->value)
218 /* Found multiple nodes with the same value.
219 old_node must be one of them. Remove it. */
220 if (!gl_oset_remove (nodes, old_node))
222 if (gl_oset_size (nodes) == 1)
224 /* Replace a one-element set with a single node. */
225 node = gl_oset_first (nodes);
226 node->h.hash_next = entry->hash_next;
228 gl_oset_free (nodes);
238 /* If no duplicates are allowed, multiple nodes are not needed. */
239 gl_hash_entry_t *entryp;
241 for (entryp = &list->table[bucket]; ; entryp = &(*entryp)->hash_next)
243 if (*entryp == &old_node->h)
245 *entryp = old_node->h.hash_next;
249 /* node is not in the right bucket. Did the hash codes
250 change inadvertently? */
256 /* Build up the hash table during initialization: Store all the nodes of
257 list->root in the hash table. */
259 add_nodes_to_buckets (gl_list_t list)
261 /* Iterate across all nodes. */
262 gl_list_node_t node = list->root;
264 iterstack_item_t *stack_ptr = &stack[0];
268 /* Descend on left branch. */
273 stack_ptr->node = node;
274 stack_ptr->rightp = false;
278 /* Climb up again. */
281 if (stack_ptr == &stack[0])
284 if (!stack_ptr->rightp)
287 node = stack_ptr->node;
288 /* Add the current node to the hash table. */
290 (list->base.hashcode_fn != NULL
291 ? list->base.hashcode_fn (node->value)
292 : (size_t)(uintptr_t) node->value);
293 add_to_bucket (list, node);
294 /* Descend on right branch. */
295 stack_ptr->rightp = true;