Commit 7533257b authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 6eeaff06
...@@ -319,6 +319,9 @@ def AllStructs(kv1txt, kv2txt, maxdepth, maxsplit, n, seed=None): ...@@ -319,6 +319,9 @@ def AllStructs(kv1txt, kv2txt, maxdepth, maxsplit, n, seed=None):
t1structv.insert(0, t1struct0) t1structv.insert(0, t1struct0)
t2structv.insert(0, t2struct0) t2structv.insert(0, t2struct0)
# XXX rework allstructs to accept only 1 kv and emit n structs for that one kv only
# -> iterate through the pairs/triplets in the caller (TestΔBTailAllStructs)
# emit topologies for tree1->tree2 and tree1<-tree2 transitions for all # emit topologies for tree1->tree2 and tree1<-tree2 transitions for all
# combinations of tree1 and tree2. # combinations of tree1 and tree2.
t12travel = list(bitravel2Way(t1structv, t2structv)) t12travel = list(bitravel2Way(t1structv, t2structv))
......
...@@ -1854,6 +1854,10 @@ func TestΔBTailAllStructs(t *testing.T) { ...@@ -1854,6 +1854,10 @@ func TestΔBTailAllStructs(t *testing.T) {
return vv[i:i+1] return vv[i:i+1]
} }
// XXX rework to be effective with testing rebuild:
// - AllStructs accept only 1 kv
// - we call it 3 times for kv1 kv2 kv3
// - iterate via triTravelXXXway ... here instead of in treegen.py
testq := make(chan ΔBTestEntry) testq := make(chan ΔBTestEntry)
go func() { go func() {
defer close(testq) defer close(testq)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment