Commit caa31ef6 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 604eeab7
...@@ -18,7 +18,7 @@ ...@@ -18,7 +18,7 @@
// See https://www.nexedi.com/licensing for rationale and options. // See https://www.nexedi.com/licensing for rationale and options.
package xbtree package xbtree
// tests for δbtail.go // tests for δbtail.go / treediff.go
// //
// This are the main tests for ΔBtail functionality. There are two primary testing concerns: // This are the main tests for ΔBtail functionality. There are two primary testing concerns:
// //
...@@ -1520,7 +1520,7 @@ func _KAdj(t1, t2 *xbtreetest.Commit, keysv ...setKey) (kadj KAdjMatrix) { ...@@ -1520,7 +1520,7 @@ func _KAdj(t1, t2 *xbtreetest.Commit, keysv ...setKey) (kadj KAdjMatrix) {
func assertΔTtail(t *testing.T, subj string, δbtail *ΔBtail, tj *xbtreetest.Commit, treeRoot zodb.Oid, vδTok ...map[Key]Δstring) { func assertΔTtail(t *testing.T, subj string, δbtail *ΔBtail, tj *xbtreetest.Commit, treeRoot zodb.Oid, vδTok ...map[Key]Δstring) {
t.Helper() t.Helper()
T := tj.T // XXX better require t to be xbtreetest.T instead? T := tj.T // TODO better require t to be xbtreetest.T instead
l := len(vδTok) l := len(vδTok)
var vatOK []zodb.Tid var vatOK []zodb.Tid
...@@ -1765,7 +1765,6 @@ func sortedKeys(kv map[Key]Δstring) []Key { ...@@ -1765,7 +1765,6 @@ func sortedKeys(kv map[Key]Δstring) []Key {
return keyv return keyv
} }
// XXX place
func tidvEqual(av, bv []zodb.Tid) bool { func tidvEqual(av, bv []zodb.Tid) bool {
if len(av) != len(bv) { if len(av) != len(bv) {
return false return false
......
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