From f89e2cf1f1b500bc1201aa3fa946a239a0e40d96 Mon Sep 17 00:00:00 2001
From: Martin Sumner <martin.sumner@adaptip.co.uk>
Date: Tue, 17 Oct 2017 22:06:30 +0100
Subject: [PATCH] Improve test coverage

---
 test/end_to_end/tictac_SUITE.erl | 14 +++++++++++++-
 1 file changed, 13 insertions(+), 1 deletion(-)

diff --git a/test/end_to_end/tictac_SUITE.erl b/test/end_to_end/tictac_SUITE.erl
index 1a3c9f8..3ec3df5 100644
--- a/test/end_to_end/tictac_SUITE.erl
+++ b/test/end_to_end/tictac_SUITE.erl
@@ -82,7 +82,7 @@ many_put_compare(_Config) ->
     % state between stores is consistent
 
     TicTacQ = {tictactree_obj,
-                {o_rkv, "Bucket", null, null, false},
+                {o_rkv, "Bucket", null, null, true},
                 TreeSize,
                 fun(_B, _K) -> accumulate end},
     {async, TreeAFolder} = leveled_bookie:book_returnfolder(Bookie2, TicTacQ),
@@ -111,6 +111,18 @@ many_put_compare(_Config) ->
     true = length(AltList) > 10000,
     % check there are a significant number of differences from empty
 
+    WrongPartitionTicTacQ = {tictactree_obj,
+                            {o_rkv, "Bucket", null, null, false},
+                            TreeSize,
+                            fun(_B, _K) -> pass end},
+    {async, TreeAFolder_WP} = 
+        leveled_bookie:book_returnfolder(Bookie2, WrongPartitionTicTacQ),
+    TreeAWP = TreeAFolder_WP(),
+    DoubleEmpty =
+        leveled_tictac:find_dirtyleaves(TreeAWP,
+                                        leveled_tictac:new_tree(0, TreeSize)),
+    true = length(DoubleEmpty) == 0,
+
     % Now run the same query by putting the tree-building responsibility onto
     % the fold_objects_fun