Improve coverage of the tet suite

tests/test-mbptree.c

@@ -333,6 +333,16 @@ static void test4(void)
   assert(btree_size(b1) == 0);
   assert (btree_equal_p(b1, b2));
 
+  btree_set_at(b1, 0, 1);
+  btree_set_at(b2, 0, 2);
+  assert (!btree_equal_p(b1, b2));
+
+  btree_set_at(b1, 0, 1);
+  btree_set_at(b2, 1, 1);
+  bool b = btree_erase(b2, 0);
+  assert( b );
+  assert (!btree_equal_p(b1, b2));
+
   btree_clear(b1);
   btree_clear(b2);
 

tests/test-mbuffer.c

@@ -568,7 +568,12 @@ static void test_spsc(void)
   b = squeue_uint_pop(&j, q);
   assert(b);
   assert(j == 65536);
-  
+  do {
+      l = 189;
+      b = squeue_uint_push_move(q, &l);
+  } while (b);
+  assert( squeue_uint_size(q) == 256);
+
   squeue_uint_clear(q);
 }
 

tests/test-mdeque.c

@@ -234,8 +234,15 @@ static void test_set(void)
       deque_push_back(d, i);
     assert (!deque_equal_p(d, e));
     deque_set(e, d);
-    deque_set (e, e);
+    deque_set(e, e);
     assert (deque_size(e) == deque_size (d));
+    assert (deque_equal_p(d, e));
+    deque_push_back(d, 15);
+    deque_push_back(e, 16);
+    assert (!deque_equal_p(d, e));
+    deque_pop_back(NULL, d);
+    deque_pop_back(NULL, e);
+    assert (deque_equal_p(d, e));
     deque_it_t it1, it2;
     for(deque_it(it1, e), deque_it (it2, d) ;
 	!deque_end_p (it1) && !deque_end_p (it2) ;