int main() { struct hash_table *ht; struct hash_entry *entry; const uint32_t size = 1000; bool flags[size]; uint32_t i; ht = _mesa_hash_table_create(NULL, key_hash, key_equal); for (i = 0; i < size; ++i) { flags[i] = false; _mesa_hash_table_insert(ht, make_key(i), &flags[i]); } _mesa_hash_table_clear(ht, delete_function); assert(_mesa_hash_table_next_entry(ht, NULL) == NULL); /* Check that delete_function was called and that repopulating the table * works. */ for (i = 0; i < size; ++i) { assert(flags[i]); flags[i] = false; _mesa_hash_table_insert(ht, make_key(i), &flags[i]); } /* Check that exactly the right set of entries is in the table. */ for (i = 0; i < size; ++i) { assert(_mesa_hash_table_search(ht, make_key(i))); } hash_table_foreach(ht, entry) { assert(key_id(entry->key) < size); }
int main(int argc, char **argv) { struct hash_table *ht; struct hash_entry *entry; int size = 10000; uint32_t keys[size]; uint32_t i; ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals); for (i = 0; i < size; i++) { keys[i] = i; _mesa_hash_table_insert(ht, keys + i, NULL); if (i >= 100) { uint32_t delete_value = i - 100; entry = _mesa_hash_table_search(ht, &delete_value); _mesa_hash_table_remove(ht, entry); } } /* Make sure that all our entries were present at the end. */ for (i = size - 100; i < size; i++) { entry = _mesa_hash_table_search(ht, keys + i); assert(entry); assert(key_value(entry->key) == i); } /* Make sure that no extra entries got in */ for (entry = _mesa_hash_table_next_entry(ht, NULL); entry != NULL; entry = _mesa_hash_table_next_entry(ht, entry)) { assert(key_value(entry->key) >= size - 100 && key_value(entry->key) < size); } assert(ht->entries == 100); _mesa_hash_table_destroy(ht, NULL); return 0; }