Much faster to search and add to the string pool as a binary tree

This commit is contained in:
Eric Fischer
2014-09-22 22:31:55 -07:00
parent d7cdbec980
commit 581105dc9a
3 changed files with 32 additions and 7 deletions
+3 -1
View File
@@ -59,6 +59,8 @@ void write_tile(struct index *start, struct index *end, char *metabase, unsigned
struct pool keys;
keys.n = 0;
keys.vals = NULL;
keys.head = NULL;
keys.tail = NULL;
struct index *i;
//printf("tile -----------------------------------------------\n");
@@ -165,7 +167,7 @@ void write_tile(struct index *start, struct index *end, char *metabase, unsigned
}
struct pool_val *pv;
for (pv = keys.vals; pv != NULL; pv = pv->next) {
for (pv = keys.head; pv != NULL; pv = pv->next) {
layer->add_keys(pv->s, strlen(pv->s));
}
pool_free(&keys);