#define __q_h__
#include <stdio.h>
+#include "mem.h"
#ifdef __cplusplus
extern "C" {
char*buffer;
int len;
int pos;
+ int read_pos;
} mem_t;
/* fifo buffered growing mem region */
} stringarray_t;
/* heap */
-typedef struct _heap
-{
+typedef struct _heap {
void**elements;
char*data;
int elem_size;
int(*compare)(const void *, const void *);
} heap_t;
+/* trie (with rollback) */
+typedef struct _trielayer {
+ struct _trielayer*row[256];
+ unsigned char*rest;
+ void*data;
+} trielayer_t;
+
+typedef struct _trie {
+ trielayer_t* start;
+ void*rollback;
+} trie_t;
+
char* strdup_n(const char*str, int size);
+char* allocprintf(const char*str, ...);
+
+float medianf(float*values, int n);
unsigned int crc32_add_byte(unsigned int crc32, unsigned char b);
unsigned int crc32_add_string(unsigned int crc32, const char*s);
void mem_init(mem_t*mem);
int mem_put(mem_t*m, void*data, int length);
int mem_putstring(mem_t*m, string_t str);
+int mem_get(mem_t*m, void*data, int length);
void mem_clear(mem_t*mem);
void mem_destroy(mem_t*mem);
dict_t*dict_new();
dict_t*dict_new2(type_t*type);
void dict_init(dict_t*dict, int size);
+void dict_init2(dict_t*dict, type_t*type, int size);
dictentry_t*dict_put(dict_t*h, const void*key, void* data);
void dict_put2(dict_t*h, const char*s, void*data);
int dict_count(dict_t*h);
char dict_contains(dict_t*h, const void*s);
void* dict_lookup(dict_t*h, const void*s);
char dict_del(dict_t*h, const void*s);
+char dict_del2(dict_t*h, const void*key, void*data);
dict_t*dict_clone(dict_t*);
void dict_foreach_keyvalue(dict_t*h, void (*runFunction)(void*data, const void*key, void*val), void*data);
void dict_foreach_value(dict_t*h, void (*runFunction)(void*));
-void dict_free_all(dict_t*h, void (*freeFunction)(void*));
+void dict_free_all(dict_t*h, char free_keys, void (*free_data_function)(void*));
void dict_clear(dict_t*h);
+void dict_destroy_shallow(dict_t*dict);
void dict_destroy(dict_t*dict);
+#define DICT_ITERATE_DATA(d,t,v) \
+ int v##_i;dictentry_t*v##_e;t v;\
+ for(v##_i=0;v##_i<(d)->hashsize;v##_i++) \
+ for(v##_e=(d)->slots[v##_i]; v##_e && ((v=(t)v##_e->data)||1); v##_e=v##_e->next)
+#define DICT_ITERATE_KEY(d,t,v) \
+ int v##_i;dictentry_t*v##_e;t v;\
+ for(v##_i=0;v##_i<(d)->hashsize;v##_i++) \
+ for(v##_e=(d)->slots[v##_i];v##_e && ((v=(t)v##_e->key)||1);v##_e=v##_e->next)
+#define DICT_ITERATE_ITEMS(d,t1,v1,t2,v2) \
+ int v1##_i;dictentry_t*v1##_e;t1 v1;t2 v2; \
+ for(v1##_i=0;v1##_i<(d)->hashsize;v1##_i++) \
+ for(v1##_e=(d)->slots[v1##_i]; v1##_e && (((v1=(t1)v1##_e->key)&&(v2=(t2)v1##_e->data))||1); v1##_e=v1##_e->next)
void map_init(map_t*map);
void map_put(map_t*map, string_t t1, string_t t2);
void map_clear(map_t*map);
void map_destroy(map_t*map);
-void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *));
+void heap_init(heap_t*h,int elem_size, int(*compare)(const void *, const void *));
+heap_t* heap_new(int elem_size, int(*compare)(const void *, const void *));
+heap_t* heap_clone(heap_t*o);
void heap_clear(heap_t*h);
+void heap_destroy(heap_t*h);
void heap_put(heap_t*h, void*e);
int heap_size(heap_t*h);
-void* heap_max(heap_t*h);
+void* heap_peek(heap_t*h);
void* heap_chopmax(heap_t*h);
void heap_dump(heap_t*h, FILE*fi);
void** heap_flatten(heap_t*h);
+trie_t*trie_new();
+void trie_put(trie_t*t, unsigned const char*id, void*data);
+char trie_remove(trie_t*t, unsigned const char*id);
+void*trie_lookup(trie_t*t, unsigned const char*id);
+int trie_contains(trie_t*t, unsigned const char*id);
+void trie_remember(trie_t*t);
+void trie_rollback(trie_t*t);
+void trie_dump(trie_t*t);
+
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_clone(list) (sizeof((list)->next),list_clone_(&(list)))
+#define list_deep_free(list) {sizeof((list)->next);list_deep_free_(&(list));}
+#define list_clone(list) (sizeof((list)->next),(list?list_clone_(&(list)):0))
#define list_length(list) (sizeof((list)->next),list_length_(list))
#ifdef __cplusplus