cover all functionsHEADmaster

+ Not quite all lines due to sptree being dumb >:(((((

1 files changed, 26 insertions, 2 deletions

diff --git a/tests/map.c b/tests/map.c
index a370413..505be58 100644
--- a/tests/map.c
+++ b/tests/map.c
@@ -5,7 +5,7 @@
 /* required defs */
 #define MAP_KEY int
 #define MAP_TYPE int
-#define MAP_HASH(a) CONTS_MAP_NO_HASH(a)
+#define MAP_HASH(a) ints_generic_hash(&(a))
 #define MAP_CMP(a, b) ((a) - (b))
 #define MAP_NAME ints
 
@@ -26,7 +26,17 @@ int main()
 
 	/* heuristic, but if we know how many elements we'll need, we should
 	 * give it to the create function. */
-	struct ints ints = ints_create(0);
+	struct ints ints = ints_create(10);
+
+	/* check that trying to search for something in an empty map doesn*t
+	 * crash */
+	assert(ints_find(&ints, 0) == NULL);
+
+	/* similarly, iterating an empty map doesn't do anything */
+	foreach(ints, iter, &ints) {
+		assert(false && "iterating empty map");
+	}
+
 	for (int i = 0; i < 1000000; ++i) {
 		if (!ints_insert(&ints, i, i)) {
 			fprintf(stderr, "failed inserting %d\n", i);
@@ -36,11 +46,25 @@ int main()
 	}
 	assert(ints_len(&ints) == 1000000);
 
+
 	for (int i = 0; i < 1000000; ++i) {
 		int *v = ints_find(&ints, i);
 		assert(v && *v == i);
 	}
 
+	/* check that trying to find something that doesn't exist doesn't crash */
+	assert(ints_find(&ints, 123456789) == NULL);
+
+	/* check that trying to remove something that doesn't exist is a noop */
+	size_t len = ints_len(&ints);
+	ints_remove(&ints, 123456789);
+	assert(ints_len(&ints) == len);
+
+	/* check that trying to insert 0 again gets us the existing 0 */
+	int *orig = ints_find(&ints, 0);
+	int *new = ints_insert(&ints, 0, 0);
+	assert(orig == new);
+
 	size_t count = 0;
 	foreach(ints, iter, &ints) {
 		assert(iter->key == iter->data);