X xbtree: Fix KAdj definition after treediff was reworked this summer to base...

X xbtree: Fix KAdj definition after treediff was reworked this summer to base decisions on node keycoverage instead of particular node keys

wcfs/internal/xbtree/δbtail_test.go

@@ -61,28 +61,27 @@ type Δstring = xbtreetest.Δstring
 //
 // Adjacency matrix
 //
-// A,  B  - topologies			ex T/B1    T2/B1-B3
-// Av, Bv - topologies with values	ex T/B1:a  T2/B1:b-B3:c
+// A,  B  - topologies			ex T3/B1,2-B3        T3/B1-B3,4
+// Av, Bv - topologies with values	ex T3/B1:a,2:b-B3:c  T3/B1:d-B3:c,4:e
 //
 // δ(Av, Bv) - full diff {k -> v} for changed keys; DEL = k -> ø
-//             ex δ(T/B1:a, T2/B1:b-B3:c) = {-1:a +1:b +3:c}
+//             ex δ(T3/B1:a,2:b-B3:c, T3/B1:d-B3:c,4:e) = {-1:a +1:d -2:b +4:e}
 //
 // Δ(T, Av, Bv) - subset of δ(Av, Bv) corresponding to initial tracking set T
-//             ex Δ({1}, T/B1:a, T2/B1:b-B3:c) = {-1:a +1:b}  (no +3:c)		XXX fix example +3 here
+//             ex Δ({1}, T3/B1:a,2:b-B3:c, T3/B1:d-B3:c,4:e) = {-1:a +1:d -2:b}  (no +4:e)
 //
 // kadj(A,B) {} k -> {k'}:	- adjacency matrix
 //	∃v1,v2:  k'∈ Δ({k}, Av1, Bv2)
 //
-//	ex kadj(T/B1, T2/B1-B3) = {1:{1} 3:{1,3} ∞:{1,3}}	k ∈ A+B+{∞}	XXX adjust to new kadj
-//                                + {0:{1} 2:{1,3} + ... all possible keys}
+//	ex kadj(T3/B1:a,2:b-B3:c, T3/B1:d-B3:c,4:e) =
+//		= {1:{1,2} 2:{1,2} 3:{3,4,∞} 4:{3,4,∞} ∞:{3,4,∞}}	k ∈ A+B+{∞}
+//		  + {0:{0,1,2} 5:{5,3,4,∞} + ... all possible keys}
 //
 // Δ(T, Av, Bv) = δ(Av, Bv)/kadj(A,B)[T]
 //
 // i.e. = δ(Av, Bv) for k: k ∈ U kadj(A,B)[·]
 //                            ·∈T
 //
-// XXX fix definition for "and changed, or coverage changed"
-//
 // Use:
 //
 //	- KAdj(A,B)         to build adjacency matrix for A -> B transition.