.

wcfs/internal/xbtree/δbtail_test.go

@@ -1399,8 +1399,6 @@ func TestΔBTail(t *testing.T) {
 
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
-		// XXX add test where kadj does not grow to -oo,oo (start from several buckets)
-
 		// start from non-empty tree to verify both ->empty and empty-> transitions
 		"T/B1:a,2:b",
 
@@ -1523,6 +1521,21 @@ func TestΔBTail(t *testing.T) {
 		"T3/B1:a,2:b-B4:d,8:h",
 		"T2,5/B1:a-B2:b,4:d-B8:h", // XXX add A
 
+		// case where kadj does not grow too much as leafs coverage remains stable
+		"T4,8/B1:a,2:b-B5:d,6:e-B10:g,11:h",
+		Δ("T4,8/B2:b,3:c-B6:e,7:f-B11:h,12:i",
+			A{1:  K(1,2,3),
+			  2:  K(1,2,3),
+			  3:  K(1,2,3),
+			  5:  K(5,6,7),
+			  6:  K(5,6,7),
+			  7:  K(5,6,7,),
+			  10: K(10,11,12,oo),
+			  11: K(10,11,12,oo),
+			  12: K(10,11,12,oo),
+			  oo: K(10,11,12,oo)}),
+
+
 		// tree deletion
 		// having ø in the middle of the test cases exercises all:
 		// * `ø -> Tree ...`		(tree is created anew),