Implement quadrant based resizing

[wmpus] / util.h

diff --git a/util.h b/util.h
index a572a0aabd01d9528b751777ccb241e1c0584536..c4772727fe0b52a45575b04d366b8559acb1ac33 100644 (file)
--- a/util.h
+++ b/util.h
@@ -1,3 +1,4 @@
+/* Misc macros */
 #define MAX(a,b) ((a) > (b) ? (a) : (b))
 #define MIN(a,b) ((a) < (b) ? (a) : (b))
 
@@ -5,9 +6,33 @@
 
 #define countof(x) (sizeof(x)/sizeof((x)[0]))
 
-#define map_get(map, key) ({ \
+/* Constant lenght map functitons */
+#define map_getg(map, test) ({ \
        int i; \
-       for (i = 0; i < countof(map) && \
-               *((typeof(key)*)&map[i]) != key; i++); \
+       for (i = 0; i < countof(map) && !(test); i++); \
        i < countof(map) ? &map[i] : NULL ; \
 })
+
+#define map_get(m,k)    map_getg(m,k==*((typeof(k)*)&m[i]))
+#define map_getr(m,k)   map_getg(m,k==*(((typeof(k)*)&m[i+1])-1))
+#define map_getk(m,k,a) map_getg(m,k==m[i].a)
+
+/* Linked lists */
+typedef struct list {
+       struct list *prev;
+       struct list *next;
+       void   *data;
+} list_t;
+
+list_t *list_insert(list_t *after, void *data);
+
+void list_insert_after(list_t *after, void *data);
+
+list_t *list_append(list_t *before, void *data);
+
+list_t *list_remove(list_t *head, list_t *item);
+
+int list_length(list_t *item);
+
+/* Misc */
+int error(char *fmt, ...);