Lines Matching refs:list
1 /* Sequential list data type implemented by a hash table with a linked list.
40 /* Generic linked list code. */
46 /* Resize the hash table if needed, after list->count was incremented. */
48 hash_resize_after_add (gl_list_t list)
50 size_t count = list->count;
52 if (estimate > list->table_size)
53 hash_resize (list, estimate);
58 add_to_bucket (gl_list_t list, gl_list_node_t node)
60 size_t bucket = node->h.hashcode % list->table_size;
62 node->h.hash_next = list->table[bucket];
63 list->table[bucket] = &node->h;
68 remove_from_bucket (gl_list_t list, gl_list_node_t node)
70 size_t bucket = node->h.hashcode % list->table_size;
73 for (p = &list->table[bucket]; ; p = &(*p)->hash_next)
87 /* Generic linked list code. */