use different iteration values for test/benchHEADmaster

+ Regular tests are pretty darn slow with valgrind on certain virtual
  machines, speed them up a bit

1 files changed, 11 insertions, 9 deletions

diff --git a/tests/sptree.c b/tests/sptree.c
index 9eff356..3499d61 100644
--- a/tests/sptree.c
+++ b/tests/sptree.c
@@ -16,6 +16,10 @@
 
 #include <conts/sptree.h>
 
+#define RANDITER (ITER / 100)
+
+int inserted[RANDITER];
+
 int main()
 {
 #if defined(COVERAGE)
@@ -29,16 +33,16 @@ int main()
 		assert(false && "iterating empty tree");
 	}
 
-	for (int i = 0; i < 1000000; ++i) {
+	for (int i = 0; i < ITER; ++i) {
 		if (!ints_insert(&ints, i)) {
 			fprintf(stderr, "failed inserting %d\n", i);
 			ints_destroy(&ints);
 			return -1;
 		}
 	}
-	assert(ints_len(&ints) == 1000000);
+	assert(ints_len(&ints) == ITER);
 
-	for (int i = 0; i < 1000000; ++i) {
+	for (int i = 0; i < ITER; ++i) {
 		int *v = ints_find(&ints, i);
 		assert(v && *v == i);
 	}
@@ -57,7 +61,7 @@ int main()
 		i++;
 	}
 
-	for (int i = 0; i < 1000000; ++i) {
+	for (int i = 0; i < ITER; ++i) {
 		ints_remove(&ints, i);
 	}
 
@@ -69,25 +73,23 @@ int main()
 	/* insert random integers to hopefully exercise the code a bit more */
 	srand(0);
 
-	int inserted[1000];
-	for (int i = 0; i < 1000; ++i) {
+	for (int i = 0; i < RANDITER; ++i) {
 		inserted[i] = rand();
 
 		/* covsrv shouldn't fail anymore */
 		assert(ints_insert(&ints, inserted[i]));
 	}
 
-	for (int i = 0; i < 1000; ++i) {
+	for (int i = 0; i < RANDITER; ++i) {
 		int *v = ints_find(&ints, inserted[i]);
 		assert(v && *v == inserted[i]);
 	}
 
-	for (int i = 0; i < 1000; ++i) {
+	for (int i = 0; i < RANDITER; ++i) {
 		ints_remove(&ints, inserted[i]);
 	}
 
 	assert(ints_len(&ints) == 0);
 
-
 	ints_destroy(&ints);
 }