93bb43c5e7
uthash's hashtable implementation will be used by libGLX for storing various mappings needed for correct dispatching.
39 lines
939 B
C
39 lines
939 B
C
#include "uthash.h"
|
|
#include <stdlib.h> /* malloc */
|
|
#include <stdio.h> /* printf */
|
|
|
|
typedef struct example_user_t {
|
|
int id;
|
|
int cookie;
|
|
UT_hash_handle hh;
|
|
} example_user_t;
|
|
|
|
int main(int argc,char *argv[]) {
|
|
int i;
|
|
example_user_t *user, *tmp, *users=NULL;
|
|
|
|
/* create elements */
|
|
for(i=0;i<10;i++) {
|
|
if ( (user = (example_user_t*)malloc(sizeof(example_user_t))) == NULL)
|
|
exit(-1);
|
|
user->id = i;
|
|
user->cookie = i*i;
|
|
HASH_ADD_INT(users,id,user);
|
|
}
|
|
|
|
/* delete each even ID */
|
|
for(i=0;i<10;i+=2) {
|
|
HASH_FIND_INT(users,&i,tmp);
|
|
if (tmp) {
|
|
HASH_DEL(users,tmp);
|
|
free(tmp);
|
|
} else printf("user id %d not found\n", i);
|
|
}
|
|
|
|
/* show the hash */
|
|
for(user=users; user != NULL; user=(example_user_t*)(user->hh.next)) {
|
|
printf("user %d, cookie %d\n", user->id, user->cookie);
|
|
}
|
|
return 0;
|
|
}
|