93bb43c5e7
uthash's hashtable implementation will be used by libGLX for storing various mappings needed for correct dispatching.
35 lines
989 B
C
35 lines
989 B
C
#include "uthash.h"
|
|
#include <stdio.h>
|
|
#include <stdlib.h> /* malloc */
|
|
|
|
typedef struct person_t {
|
|
char first_name[10];
|
|
int id;
|
|
UT_hash_handle hh;
|
|
} person_t;
|
|
|
|
int main(int argc, char*argv[]) {
|
|
person_t *people=NULL, *person;
|
|
const char **name;
|
|
const char * names[] = { "bob", "jack", "gary", "ty", "bo", "phil", "art",
|
|
"gil", "buck", "ted", NULL };
|
|
int id=0;
|
|
|
|
for(name=names; *name; name++) {
|
|
if ( (person = (person_t*)malloc(sizeof(person_t))) == NULL) exit(-1);
|
|
strncpy(person->first_name, *name,10);
|
|
person->id = id++;
|
|
HASH_ADD_STR(people,first_name,person);
|
|
printf("added %s (id %d)\n", person->first_name, person->id);
|
|
}
|
|
|
|
for(name=names; *name; name++) {
|
|
HASH_FIND_STR(people,*name,person);
|
|
if (person)
|
|
printf("found %s (id %d)\n", person->first_name, person->id);
|
|
else
|
|
printf("failed to find %s\n", *name);
|
|
}
|
|
return 0;
|
|
}
|