.

wcfs/δbtail_test.go

@@ -976,6 +976,7 @@ func TestΔBTreeAllStructs(t *testing.T) {
 	maxdepth := 2	// XXX -> 3?
 	maxsplit := 1	// XXX -> 2?
 	n := 10		// XXX -> more?
+	nkeys := 5;  if testing.Short() { nkeys -= 2 }
 
 	// server to generate AllStructs(kv1, kv2, ...)
 	sg, err := StartAllStructsSrv(); X(err)
@@ -994,14 +995,13 @@ func TestΔBTreeAllStructs(t *testing.T) {
 		}
 	}
 	rng := rand.New(rand.NewSource(seed))
-	t.Logf("# maxdepth=%d maxsplit=%d n=%d seed=%d", maxdepth, maxsplit, n, seed)
+	t.Logf("# maxdepth=%d maxsplit=%d nkeys=%d n=%d seed=%d", maxdepth, maxsplit, nkeys, n, seed)
 
 	// generate (kv1, kv2) pairs randomly
 
 	// keysv1 and keysv2 are random shuffle of IntSets
 	var keysv1 [][]int
 	var keysv2 [][]int
-	nkeys := 5;  if testing.Short() { nkeys -= 2 }
 	for keys := range IntSets(nkeys) {
 		keysv1 = append(keysv1, keys)
 		keysv2 = append(keysv2, keys)