.

wcfs/δbtail.go

@@ -22,6 +22,8 @@ package main
 // TODO move -> btree when ΔTail matures.
 // XXX doc
 
+// FIXME the algorythm is different: recursion is implemented by expanding rangeSplit step by step.
+//
 // δ(BTree) notes
 // ==============
 //
@@ -78,6 +80,7 @@ import (
 	"math"
 	"reflect"
 	"sort"
+	"strings"
 
 	"lab.nexedi.com/kirr/go123/xerr"
 	"lab.nexedi.com/kirr/neo/go/transaction"
@@ -295,9 +298,9 @@ func (δBtail *ΔBtail) Track(ctx context.Context, key Key, keyPresent bool, pat
 	// XXX assert Tree Tree ... Tree Bucket
 	root := treeRoot.POid()
 
-	oidv := []Oid{}
-	for _, node := range path { oidv = append(oidv, node.POid()) }
-	fmt.Printf("Track %v %v\n", key, oidv)
+	pathv := []string{}
+	for _, node := range path { pathv = append(pathv, vnode(node)) }
+	fmt.Printf("Track [%v] %s\n", key, strings.Join(pathv, " -> "))
 
 	parent := zodb.InvalidOid
 	var track    nodeTrack

wcfs/δbtail_test.go

@@ -797,6 +797,8 @@ func TestΔBTail(t *testing.T) {
 
 	// test known cases going through tree1 -> tree2 -> ...
 	testv := []interface{} {
+		"T2/B1:a-B7:g", "T2,8/B1:a-B7:g-B9:i",
+
 		"T2/B1:a-B2:b", "T/B1:a,2:b",
 		"T2,3/B1:a-B2:b-B3:c", "T/B1:a,2:b",
 		"T2,3/B1:a-B2:c-B3:c", "T/B1:a,2:b",