.

wcfs/δbtail.go

@@ -35,12 +35,13 @@ import (
 type Tree   = btree.LOBTree
 type Bucket = btree.LOBucket
 type Node   = btree.LONode
-type Key    = int64
-type Value  = zodb.Oid // XXX assumes key points to IPersistent
-                       // XXX how to represent deletion? InvalidOid?
 
+type Key    = int64
+type Value  = zodb.Oid // assumes key points to IPersistent
+                       // deletion is represented as InvalidOid
 type SetKey = SetI64
 
+
 // ΔBtail represents tail of revisional changes to BTrees.
 //
 // It semantically consists of

wcfs/δbtail_test.go

@@ -244,6 +244,10 @@ func xverifyΔBTail1(t *testing.T, db *zodb.DB, treeRoot zodb.Oid, at1,at2 zodb.
 	// δbtail <- δZ
 	δB := δbtail.Update(δZ)
 
+	_ = δB
+	//assert δB.Rev == δZ.Tid
+	//assert len(δB.ByRoot) == 1
+
 	// XXX assert δB.keys == treeRoot
 	// δT = δB[treeRoot]