1 files changed, 0 insertions, 89 deletions
diff --git a/wm/table.c b/wm/table.c
deleted file mode 100644
index 945d401..0000000
--- a/wm/table.c
+++ /dev/null
@@ -1,89 +0,0 @@
-/*
- * Copyright © 2008 Ian Osgood <iano@quirkster.com>
- * Copyright © 2008 Josh Triplett <josh@freedesktop.org>
- * Copyright © 2008 Thomas Hunger <hto@arco.de>
- *
- * Permission is hereby granted, free of charge, to any person
- * obtaining a copy of this software and associated documentation
- * files (the "Software"), to deal in the Software without
- * restriction, including without limitation the rights to use, copy,
- * modify, merge, publish, distribute, sublicense, and/or sell copies
- * of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
- * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
- * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- * Except as contained in this notice, the names of the authors or
- * their institutions shall not be used in advertising or otherwise to
- * promote the sale, use or other dealings in this Software without
- * prior written authorization from the authors.
- */
-
-#include <stdlib.h>
-#include "xcb_wm.h"
-
-typedef struct node node;
-struct node {
-	node *next;
-	uint32_t key;
-	void *value;
-};
-
-struct table_t {
-	node *head;
-};
-
-table_t *alloc_table()
-{
-	return calloc(1, sizeof(table_t));
-}
-
-void free_table(table_t *table)
-{
-	free(table);
-}
-
-int table_put(table_t *table, uint32_t key, void *value)
-{
-	node *record = malloc(sizeof(node));
-	if(!record)
-		return 0;
-	record->next = table->head;
-	record->key = key;
-	record->value = value;
-	table->head = record;
-	return 1;
-}
-
-void *table_get(table_t *table, uint32_t key)
-{
-	node *cur;
-	for(cur = table->head; cur; cur = cur->next)
-		if(cur->key == key)
-			return cur->value;
-	return 0;
-}
-
-void *table_remove(table_t *table, uint32_t key)
-{
-	node **cur;
-	for(cur = &table->head; *cur; cur = &(*cur)->next)
-		if((*cur)->key == key)
-		{
-			node *tmp = *cur;
-			void *ret = tmp->value;
-			*cur = (*cur)->next;
-			free(tmp);
-			return ret;
-		}
-	return 0;
-}