1 files changed, 106 insertions, 0 deletions
diff --git a/core/map.c b/core/map.c
new file mode 100644
index 0000000..5fdc2eb
--- /dev/null
+++ b/core/map.c
@@ -0,0 +1,106 @@
+#include <ccan/tap/tap.h>
+#include <stddef.h>
+#include <stdbool.h>
+#include <string.h>
+#include <stdio.h>
+#include <errno.h>
+#include "map.h"
+
+static bool get(Map *map, const char *key, const void *data) {
+	return map_get(map, key) == data && map_closest(map, key) == data;
+}
+
+static bool compare(const char *key, void *value, void *data) {
+	Map *map = data;
+	ok(map_get(map, key) == value, "Compare map content");
+	return true;
+}
+
+static bool once(const char *key, void *value, void *data) {
+	int *counter = data;
+	(*counter)++;
+	return false;
+}
+
+static bool visit(const char *key, void *value, void *data) {
+	int *index = value;
+	int *visited = data;
+	visited[*index]++;
+	return true;
+}
+
+static int order_counter;
+
+static bool order(const char *key, void *value, void *data) {
+	int *index = value;
+	int *order = data;
+	order[*index] = ++order_counter;
+	return true;
+}
+
+int main(int argc, char *argv[]) {
+	const int values[3] = { 0, 1, 2 };
+
+	plan_no_plan();
+
+	Map *map = map_new();
+
+	ok(map && map_empty(map), "Creation");
+
+	ok(!map_get(map, "404"), "Get non-existing key");
+	ok(!map_contains(map, "404"), "Contains non-existing key");
+	ok(!map_closest(map, "404") && errno == ENOENT, "Closest non-existing key");
+
+	ok(!map_put(map, "a", NULL) && errno == EINVAL && map_empty(map) && !map_get(map, "a"), "Put NULL value");
+	ok(map_put(map, "a", &values[0]) && !map_empty(map) && get(map, "a", &values[0]), "Put 1");
+	ok(map_contains(map, "a"), "Contains existing key");
+	ok(map_closest(map, "a") == &values[0], "Closest match existing key");
+	ok(!map_put(map, "a", &values[1]) && errno == EEXIST && get(map, "a", &values[0]), "Put duplicate");
+	ok(map_put(map, "cafebabe", &values[2]) && get(map, "cafebabe", &values[2]), "Put 2");
+	ok(map_put(map, "cafe", &values[1]) && get(map, "cafe", &values[1]), "Put 3");
+
+	Map *copy = map_new();
+	ok(map_copy(copy, map), "Copy");
+	ok(!map_empty(copy), "Not empty after copying");
+	map_iterate(copy, compare, map);
+	map_iterate(map, compare, copy);
+
+	int counter = 0;
+	map_iterate(copy, once, &counter);
+	ok(counter == 1, "Iterate stop condition");
+
+	ok(!map_get(map, "ca") && !map_closest(map, "ca") && errno == 0, "Closest ambigious");
+
+	int visited[] = { 0, 0, 0 };
+
+	map_iterate(map, visit, &visited);
+	ok(visited[0] == 1 && visited[1] == 1 && visited[2] == 1, "Iterate map");
+
+	memset(visited, 0, sizeof visited);
+	order_counter = 0;
+	map_iterate(map, order, &visited);
+	ok(visited[0] == 1 && visited[1] == 2 && visited[2] == 3, "Ordered iteration");
+
+	memset(visited, 0, sizeof visited);
+	map_iterate(map_prefix(map, "ca"), visit, &visited);
+	ok(visited[0] == 0 && visited[1] == 1 && visited[2] == 1, "Iterate sub map");
+
+	memset(visited, 0, sizeof visited);
+	order_counter = 0;
+	map_iterate(map_prefix(map, "ca"), order, &visited);
+	ok(visited[0] == 0 && visited[1] == 1 && visited[2] == 2, "Ordered sub map iteration");
+
+	ok(map_empty(map_prefix(map, "404")), "Empty map for non-existing prefix");
+
+	ok(!map_delete(map, "404"), "Delete non-existing key");
+	ok(map_delete(map, "cafe") == &values[1] && !map_get(map, "cafe"), "Delete existing key");
+	ok(map_closest(map, "cafe") == &values[2], "Closest unambigious");
+
+	map_clear(map);
+	ok(map_empty(map), "Empty after clean");
+
+	map_free(map);
+	map_free(copy);
+
+	return exit_status();
+}