Lowered minimum map size from 32 to 16 buckets

I'd expect small maps (<10 items) to be quite common, and 32 buckets is
a waste of memory in that case. It's not like growing the map takes that
much time at the small sizes anyway.

(This not-surprisingly changed the order of the object elements in a
json test)

2 files changed, 2 insertions, 2 deletions

diff --git a/tanja.c b/tanja.c
index 10663fd..c616ff8 100644
--- a/tanja.c
+++ b/tanja.c
@@ -374,7 +374,7 @@ static inline void tn_map_grow(tn_el *m, int new) {
 		return;
 	int s = m->size;
 	if(!s)
-		s = 32;
+		s = 16;
 	while(s < ((m->count+new)*4)/3)
 		s <<= 1;
 	assert(s < UINT16_MAX); // Might want to handle this
diff --git a/test/json.c b/test/json.c
index 821f786..0306e5a 100644
--- a/test/json.c
+++ b/test/json.c
@@ -125,7 +125,7 @@ static void test_tuples() {
 	t("[ {  }  ]", "[{}]");
 	t("[{\"\":true}]", "[{\"\":1}]");
 	e("[{\"a\":null,\"b\":\"str\"}]");
-	t("[{\"1\" : \"1\"  ,  \"\\t\" \t :  {} } ]", "[{\"\\t\":{},\"1\":\"1\"}]"); // order depends on hash function
+	t("[{\"1\" : \"1\"  ,  \"\\t\" \t :  {} } ]", "[{\"1\":\"1\",\"\\t\":{}}]"); // order depends on hash function
 	f("[{1:2}]", 2);
 	f("[{\"1\"}]", 5);
 	f("[{\"\":}]", 5);