X-Git-Url: http://git.asbjorn.biz/?a=blobdiff_plain;f=lib%2Fq.h;h=18e7f3a7cfca6ed4a86ea41296cbf7709b48ed99;hb=f58dce81384e4324f00f4ca51830f3245d15136b;hp=42c938df0b863f4100a76d861c0a2354d6eba25f;hpb=a12a13df2798b89ec5550a01544b74e4f3265784;p=swftools.git

diff --git a/lib/q.h b/lib/q.h
index 42c938d..18e7f3a 100644
--- a/lib/q.h
+++ b/lib/q.h
@@ -3,9 +3,21 @@
 
    Part of the swftools package.
    
-   Copyright (c) 2001 Matthias Kramm <kramm@quiss.org>
-
-   This file is distributed under the GPL, see file COPYING for details */
+   Copyright (c) 2001,2002,2003,2004 Matthias Kramm <kramm@quiss.org>
+ 
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2 of the License, or
+   (at your option) any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
 
 #ifndef __q_h__
 #define __q_h__
@@ -24,6 +36,7 @@ typedef struct _mem_t {
     int pos;
 } mem_t;
 
+/* fifo buffered growing mem region */
 typedef struct _ringbuffer_t
 {
     void*internal;
@@ -52,6 +65,17 @@ typedef struct _stringarray_t
     void*internal;
 } stringarray_t;
 
+/* heap */
+typedef struct _heap
+{
+    void**elements;
+    char*data;
+    int elem_size;
+    int size;
+    int max_size;
+    int(*compare)(const void *, const void *);
+} heap_t;
+
 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);
@@ -87,21 +111,25 @@ void map_destroy(map_t*map);
 void dictionary_init(dictionary_t*dict);
 void dictionary_put(dictionary_t*dict, string_t t1, void* t2);
 void dictionary_put2(dictionary_t*dict, const char* t1, void* t2);
+stringarray_t* dictionary_index(dictionary_t*dict);
+int dictionary_count(dictionary_t* dict);
 void* dictionary_lookup(dictionary_t*dict, const char*name);
 void dictionary_dump(dictionary_t*dict, FILE*fi, const char*prefix);
 void dictionary_del(dictionary_t*dict, const char* name);
 void dictionary_clear(dictionary_t*dict);
 void dictionary_destroy(dictionary_t*dict);
+void dictionary_free_all(dictionary_t* dict, void (*freeFunction)(void*));
 
-char* strdup_n(const char*str, int size);
-
-void* qmalloc_internal(int len);
-void* qrealloc_internal(void*old, int len);
-void qfree_internal(void*old);
+void heap_init(heap_t*h,int n,int elem_size, int(*compare)(const void *, const void *));
+void heap_clear(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_chopmax(heap_t*h);
+void heap_dump(heap_t*h, FILE*fi);
+void** heap_flatten(heap_t*h);
 
-#define qmalloc(len) qmalloc_internal(len)
-#define qrealloc(old, len) qmalloc_internal(old, len)
-#define qfree(old) qmalloc_internal(old)
+char* strdup_n(const char*str, int size);
 
 #ifdef __cplusplus
 }