Commit 3ab3c61d authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 97ecc0ab
...@@ -646,30 +646,6 @@ func TestΔFtailSliceUntrackedUniform(t_ *testing.T) { ...@@ -646,30 +646,6 @@ func TestΔFtailSliceUntrackedUniform(t_ *testing.T) {
} }
// dataTabTxt returns string representation of {} dataTab.
func dataTabTxt(dataTab map[string]string) string {
// XXX dup wrt xbtreetest.KVTxt but uses string instead of Key for keys.
if len(dataTab) == 0 {
return "ø"
}
keyv := []string{}
for k := range dataTab { keyv = append(keyv, k) }
sort.Strings(keyv)
sv := []string{}
for _, k := range keyv {
v := dataTab[k]
if strings.ContainsAny(v, " \n\t,:") {
panicf("[%v]=%q: invalid value", k, v)
}
sv = append(sv, fmt.Sprintf("%v:%s", k, v))
}
return strings.Join(sv, ",")
}
// newT creates new T. // newT creates new T.
func newT(t *testing.T) *T { func newT(t *testing.T) *T {
t.Helper() t.Helper()
...@@ -757,6 +733,29 @@ func (t *T) vδfstr(vδf []*ΔFile) string { ...@@ -757,6 +733,29 @@ func (t *T) vδfstr(vδf []*ΔFile) string {
} }
// dataTabTxt returns string representation of {} dataTab.
func dataTabTxt(dataTab map[string]string) string {
// XXX dup wrt xbtreetest.KVTxt but uses string instead of Key for keys.
if len(dataTab) == 0 {
return "ø"
}
keyv := []string{}
for k := range dataTab { keyv = append(keyv, k) }
sort.Strings(keyv)
sv := []string{}
for _, k := range keyv {
v := dataTab[k]
if strings.ContainsAny(v, " \n\t,:") {
panicf("[%v]=%q: invalid value", k, v)
}
sv = append(sv, fmt.Sprintf("%v:%s", k, v))
}
return strings.Join(sv, ",")
}
// b is shorthand to create setI64(blocks). // b is shorthand to create setI64(blocks).
func b(blocks ...int64) setI64 { func b(blocks ...int64) setI64 {
......
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