/* * Driver code */ int main() { hash_table_t *table = NULL; table = hash_table_init(INITIAL_SIZE, 1); hash_table_insert(table, "hardik"); hash_table_insert(table, "goel"); hash_table_insert(table, "goel"); hash_table_insert(table, "goel"); hash_table_insert(table, "koel"); hash_table_insert(table, "loge"); hash_table_insert(table, "goel"); hash_table_insert(table, "hardik"); hash_table_insert(table, "aljkjkafd"); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_print(table); hash_table_delete(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_delete(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_print(table); hash_table_insert(table, "asldfjasldkjsflasjdfashdfajkdhfkajjdsklfajslkdfjalsdkjfalkj"); hash_table_print(table); hash_table_cleanup(table); return 0; }
int main() { hash_table_t* people = hash_table_init(100); entry_t oliv = { "Pinon", "Olivier", "01 02 03 04", "Paris" }; entry_t pa = { "Durand", "Pierre-Alexandre", "33 04 10", "Lyon" }; printf("Does string equality work ? %d\n", eq_str(pa.name, "Durand")); hash_table_insert( people, &oliv ); hash_table_insert( people, &pa ); hash_table_print( people ); list_t test = hash_table_find_by_name(people, "Durand"); printf("%s\n ", "Is M.Durand here ?"); print_list(test); destroy_list(test); test = hash_table_find_by_surname(people, "Pierre-Alexandre"); printf("%s\n ", "Is Pierre-Alexandre here ?"); print_list(test); destroy_list(test); printf("hash map test done\n"); hash_table_print(people); hash_table_destroy( people ); return 0; };
int main() { int ret = 0, i = 0; size_t offset1 = 256; size_t offset10 = 256 + 10; void * ptr10 = (void *)0xDEAD; void * ptr11 = (void *)0xFF; size_t offset2 = 512; void * ptr20 = (void *)0xBABE; size_t offset3 = 1024; void * temp = NULL; hash_table_t * my_hash_table = NULL; ret = hash_table_construct(&my_hash_table, 5); printf("Construct: ret = %d\n", ret); HASH_TABLE_ADD(my_hash_table, &offset1, &ptr10); HASH_TABLE_ADD(my_hash_table, &offset2, &ptr20); HASH_TABLE_ADD(my_hash_table, &offset1, &ptr10); HASH_TABLE_ADD(my_hash_table, &offset10, &ptr11); HASH_TABLE_ADD(my_hash_table, &offset1, &ptr10); hash_table_print(my_hash_table); //HASH_TABLE_REMOVE(my_hash_table, &offset1); ret = HASH_TABLE_GET(my_hash_table, &offset1, &temp); printf("Get: ret = %d\n", ret); if (temp) printf("GET: value = %p\n",*(void **)temp); hash_table_print(my_hash_table); HASH_TABLE_REMOVE(my_hash_table, &offset1); HASH_TABLE_REMOVE(my_hash_table, &offset10); HASH_TABLE_REMOVE(my_hash_table, &offset2); hash_table_print(my_hash_table); ret = hash_table_destruct(&my_hash_table); printf("Destruct: ret = %d\n", ret); return 0; }
int main() { hash_table_t* t = hash_table_constructor(); // Insert printf("Insert Begin\n"); hash_table_insert_elem(&t, "*****@*****.**", "1"); hash_table_insert_elem(&t, "*****@*****.**", "2"); hash_table_insert_elem(&t, "*****@*****.**", "3"); hash_table_insert_elem(&t, "*****@*****.**", "4"); hash_table_insert_elem(&t, "*****@*****.**", "5"); hash_table_insert_elem(&t, "*****@*****.**", "6"); printf("Insert End\n"); hash_table_print(t); // Find printf("Find Begin\n"); printf("%s\n", hash_table_find_elem(t, "*****@*****.**")); printf("%s\n", hash_table_find_elem(t, "*****@*****.**")); printf("%s\n", hash_table_find_elem(t, "*****@*****.**")); char* value = hash_table_find_elem(t, "*****@*****.**"); if(value != NULL) return 1; else { printf("Value not found.. as it should be\n"); } printf("Find End\n"); // Update printf("Update Begin\n"); hash_table_update_elem(t, "*****@*****.**", "Novo Valor"); printf("Update End\n"); hash_table_print(t); // Delete printf("Delete Begin\n"); hash_table_delete_elem(t, "*****@*****.**"); printf("Delete End\n"); hash_table_print(t); hash_table_destructor(t); return 0; }
int main() { hash_table* h = hash_table_new(); hash_table_register_print(h, int_print); hash_table_register_copy(h, int_copy); hash_table_register_delete(h, int_delete); hash_table_print(h); char buff[3]; int ints[20]; for(int i=0; i < 20; i++) { ints[i] = i; sprintf(buff, "%i", i); hash_table_add(h, buff, &(ints[i])); } hash_table_print(h); hash_table_get(h, "1"); hash_table_remove(h, "1"); hash_table_print(h); hash_table_delete(h); return 0; }
/* * Fifo function to print entries from current hash table */ void trusted_dump(rpc_t* rpc, void* ctx) { if (db_mode != ENABLE_CACHE) { rpc->fault(ctx, 400, "Database cache is not enabled"); return; } if (hash_table) { hash_table_print(*hash_table, rpc, ctx); } }