.

wcfs/treediff.go

@@ -934,6 +934,29 @@ func pathEqual(patha, pathb []zodb.Oid) bool {
 	return true
 }
 
+/*
+// vtree returns human-readable representation of Tree data.
+func vtree(v []TreeEntry) string {
+	s := ""
+	for _, e := range v {
+		if s != "" {
+			s += " "
+		}
+		s += fmt.Sprintf("%v %s", e.Key(), vnode(e.Child()))
+	}
+	return s
+}
+*/
+
+// vnode returns brief human-readable representation of node.
+func vnode(node Node) string {
+	kind := "?"
+	switch node.(type) {
+	case *Tree:   kind = "T"
+	case *Bucket: kind = "B"
+	}
+	return kind + node.POid().String()
+}
 
 const debug = false
 func tracef(format string, argv ...interface{}) {

wcfs/δbtail.go

@@ -581,28 +581,3 @@ func δassertSlice(δ interface { Head() zodb.Tid; Tail() zodb.Tid }, lo, hi zod
 		panicf("invalid slice: (%s, %s];  (tail, head] = (%s, %s]", lo, hi, tail, head)
 	}
 }
-
-
-/*
-// vtree returns human-readable representation of Tree data.
-func vtree(v []TreeEntry) string {
-	s := ""
-	for _, e := range v {
-		if s != "" {
-			s += " "
-		}
-		s += fmt.Sprintf("%v %s", e.Key(), vnode(e.Child()))
-	}
-	return s
-}
-*/
-
-// vnode returns brief human-readable representation of node.
-func vnode(node Node) string {
-	kind := "?"
-	switch node.(type) {
-	case *Tree:   kind = "T"
-	case *Bucket: kind = "B"
-	}
-	return kind + node.POid().String()
-}