int(*compare)(const void *, const void *);
} heap_t;
+typedef struct _trie {
+ struct _trie*row[256];
+ unsigned char*rest;
+} trie_t;
+
+
char* strdup_n(const char*str, int size);
unsigned int crc32_add_byte(unsigned int crc32, unsigned char b);
void heap_dump(heap_t*h, FILE*fi);
void** heap_flatten(heap_t*h);
+void trie_put(trie_t**t, unsigned const char*id);
+int trie_lookup(trie_t*t, unsigned const char*id);
+
array_t* array_new();
array_t* array_new2(type_t*type);
void array_free(array_t*array);
void list_append_(void*_list, void*entry);
void list_prepend_(void*_list, void*entry);
void list_free_(void*_list);
+void list_deep_free_(void*_list);
void list_concat_(void*l1, void*l2);
#define list_new() ((void*)0)
#define list_append(list, e) {sizeof((list)->next);list_append_(&(list),(e));}
#define list_concat(l1, l2) {sizeof((l1)->next);sizeof((l2)->next);list_concat_(&(l1),&(l2));}
#define list_prepend(list, e) {sizeof((list)->next);list_prepend_(&(list),(e));}
#define list_free(list) {sizeof((list)->next);list_free_(&(list));}
+#define list_deep_free(list) {sizeof((list)->next);list_deep_free_(&(list));}
#define list_clone(list) (sizeof((list)->next),list_clone_(&(list)))
#define list_length(list) (sizeof((list)->next),list_length_(list))