1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
|
/* Sequential list data type implemented by a hash table with a linked list.
Copyright (C) 2006, 2008-2011 Free Software Foundation, Inc.
Written by Bruno Haible <bruno@clisp.org>, 2006.
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 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
#include <config.h>
/* Specification. */
#include "gl_linkedhash_list.h"
#include <stdint.h> /* for SIZE_MAX */
#include <stdlib.h>
#include "xsize.h"
#ifndef uintptr_t
# define uintptr_t unsigned long
#endif
#define WITH_HASHTABLE 1
/* -------------------------- gl_list_t Data Type -------------------------- */
/* Generic hash-table code. */
#include "gl_anyhash_list1.h"
/* Generic linked list code. */
#include "gl_anylinked_list1.h"
/* Generic hash-table code. */
#include "gl_anyhash_list2.h"
/* Resize the hash table if needed, after list->count was incremented. */
static inline void
hash_resize_after_add (gl_list_t list)
{
size_t count = list->count;
size_t estimate = xsum (count, count / 2); /* 1.5 * count */
if (estimate > list->table_size)
hash_resize (list, estimate);
}
/* Add a node to the hash table structure. */
static inline void
add_to_bucket (gl_list_t list, gl_list_node_t node)
{
size_t bucket = node->h.hashcode % list->table_size;
node->h.hash_next = list->table[bucket];
list->table[bucket] = &node->h;
}
/* Tell all compilers that the return value is 0. */
#define add_to_bucket(list,node) ((add_to_bucket) (list, node), 0)
/* Remove a node from the hash table structure. */
static inline void
remove_from_bucket (gl_list_t list, gl_list_node_t node)
{
size_t bucket = node->h.hashcode % list->table_size;
gl_hash_entry_t *p;
for (p = &list->table[bucket]; ; p = &(*p)->hash_next)
{
if (*p == &node->h)
{
*p = node->h.hash_next;
break;
}
if (*p == NULL)
/* node is not in the right bucket. Did the hash codes
change inadvertently? */
abort ();
}
}
/* Generic linked list code. */
#include "gl_anylinked_list2.h"
const struct gl_list_implementation gl_linkedhash_list_implementation =
{
gl_linked_nx_create_empty,
gl_linked_nx_create,
gl_linked_size,
gl_linked_node_value,
gl_linked_node_nx_set_value,
gl_linked_next_node,
gl_linked_previous_node,
gl_linked_get_at,
gl_linked_nx_set_at,
gl_linked_search_from_to,
gl_linked_indexof_from_to,
gl_linked_nx_add_first,
gl_linked_nx_add_last,
gl_linked_nx_add_before,
gl_linked_nx_add_after,
gl_linked_nx_add_at,
gl_linked_remove_node,
gl_linked_remove_at,
gl_linked_remove,
gl_linked_list_free,
gl_linked_iterator,
gl_linked_iterator_from_to,
gl_linked_iterator_next,
gl_linked_iterator_free,
gl_linked_sortedlist_search,
gl_linked_sortedlist_search_from_to,
gl_linked_sortedlist_indexof,
gl_linked_sortedlist_indexof_from_to,
gl_linked_sortedlist_nx_add,
gl_linked_sortedlist_remove
};
|
