+struct data1_hash_table {
+ NMEM nmem;
+ int size;
+ struct data1_hash_entry **ar;
+};
+
+struct data1_hash_entry {
+ void *clientData;
+ char *str;
+ struct data1_hash_entry *next;
+};
+
+unsigned data1_hash_calc(struct data1_hash_table *ht, const char *str)
+{
+ unsigned v = 0;
+ assert(str);
+ while (*str)
+ {
+ if (*str >= 'a' && *str <= 'z')
+ v = v*65509 + *str -'a'+10;
+ else if (*str >= 'A' && *str <= 'Z')
+ v = v*65509 + *str -'A'+10;
+ else if (*str >= '0' && *str <= '9')
+ v = v*65509 + *str -'0';
+ str++;
+ }
+ return v % ht->size;
+}
+
+struct data1_hash_table *data1_hash_open(int size, NMEM nmem)
+{
+ int i;
+ struct data1_hash_table *ht = nmem_malloc(nmem, sizeof(*ht));
+ ht->nmem = nmem;
+ ht->size = size;
+ if (ht->size <= 0)
+ ht->size = 29;
+ ht->ar = nmem_malloc(nmem, sizeof(*ht->ar) * ht->size);
+ for (i = 0; i<ht->size; i++)
+ ht->ar[i] = 0;
+ return ht;
+}
+
+void data1_hash_insert(struct data1_hash_table *ht, const char *str,
+ void *clientData, int copy)
+{
+ char *dstr = copy ? nmem_strdup(ht->nmem, str) : (char*) str;
+ if (strchr(str, '?') || strchr(str, '.'))
+ {
+ int i;
+ for (i = 0; i<ht->size; i++)
+ {
+ struct data1_hash_entry **he = &ht->ar[i];
+ for (; *he && strcmp(str, (*he)->str); he = &(*he)->next)
+ ;
+ if (!*he)
+ {
+ *he = nmem_malloc(ht->nmem, sizeof(**he));
+ (*he)->str = dstr;
+ (*he)->next = 0;
+ }
+ (*he)->clientData = clientData;
+ }
+ }
+ else
+ {
+ struct data1_hash_entry **he = &ht->ar[data1_hash_calc(ht, str)];
+ for (; *he && strcmp(str, (*he)->str); he = &(*he)->next)
+ ;
+ if (!*he)
+ {
+ *he = nmem_malloc(ht->nmem, sizeof(**he));
+ (*he)->str = dstr;
+ (*he)->next = 0;
+ }
+ (*he)->clientData = clientData;
+ }
+}
+
+void *data1_hash_lookup(struct data1_hash_table *ht, const char *str)
+{
+ struct data1_hash_entry **he = &ht->ar[data1_hash_calc(ht, str)];
+
+ for (; *he && yaz_matchstr(str, (*he)->str); he = &(*he)->next)
+ ;
+ if (*he)
+ return (*he)->clientData;
+ return 0;
+}
+