return no_error;
}
-int main() {
+int main(int argc,char **argv) {
gras_error_t errcode;
gras_dict_t *head=NULL;
int i,j,k, nb;
char *key;
void *data;
- TRY(gras_log_control_set("root.thresh=info"));
+ gras_init_defaultlog(&argc,argv,"dict.thresh=verbose");
srand((unsigned int)time(NULL));
printf("Dictionnary: CRASH test:\n");
key[k]=rand() % ('z' - 'a') + 'a';
key[k]='\0';
// printf("[%d %s]\n",j,key);
- TRYFAIL(gras_dict_insert(head,strdup(key),key,&free));
+ TRYFAIL(gras_dict_set(head,key,key,&free));
}
nb=0;
// gras_dict_dump(head,(void (*)(void*))&printf);
printf("\n Fill 200 000 elements, with keys being the number of element\n");
printf(" (a point is 10 000 elements)\n");
for (j=0;j<NB_ELM;j++) {
- if (!(j%10000)) printf("."); fflush(stdout);
+ if (!(j%10000)) {
+ printf(".");
+ fflush(stdout);
+ }
if (!(key=malloc(10))) {
fprintf(stderr,"Out of memory\n");
abort();
}
sprintf(key,"%d",j);
- TRYFAIL(gras_dict_insert(head,key,key,&free));
+ TRYFAIL(gras_dict_set(head,key,key,&free));
}
printf("\n Count the elements (retrieving the key and data for each): \n");
for (j=0;j<NB_ELM;j++) {
sprintf(key,"%d",j);
- TRYFAIL(gras_dict_retrieve(head,key,&data));
+ TRYFAIL(gras_dict_get(head,key,&data));
if (strcmp(key,(char*)data)) {
printf("key=%s != data=%s\n",key,(char*)data);
abort();
}
}
}
+ free(key);
printf("\n Remove my 200 000 elements. (a point is 10 000 elements)\n");
if (!(key=malloc(10))) {
fprintf(stderr,"Out of memory\n");
- return 3;
+ abort();
}
for (j=0;j<NB_ELM;j++) {
if (!(j%10000)) printf("."); fflush(stdout);
sprintf(key,"%d",j);
TRYFAIL(gras_dict_remove(head,key));
}
+ printf("\n");
+ free(key);
+
+ printf("\n Free the structure (twice)\n");
gras_dict_free(&head);
gras_dict_free(&head);
- printf("\n");
+
+ gras_exit();
return 0;
}