Commit 8b595000 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 502079d0
...@@ -876,6 +876,7 @@ func diffT(ctx context.Context, a, b *Tree, δZTC SetOid, trackIdx map[zodb.Oid] ...@@ -876,6 +876,7 @@ func diffT(ctx context.Context, a, b *Tree, δZTC SetOid, trackIdx map[zodb.Oid]
// process B buckets that cover new keys into δ+ // process B buckets that cover new keys into δ+
Aqueue = SetKey{} Aqueue = SetKey{}
for k := range Bqueue { for k := range Bqueue {
fmt.Printf(" B [%v]\n", k)
Bdone.Add(k) Bdone.Add(k)
bnode, ok, err := bv.GetToLeaf(ctx, k) bnode, ok, err := bv.GetToLeaf(ctx, k)
if err != nil { if err != nil {
...@@ -918,6 +919,7 @@ func diffT(ctx context.Context, a, b *Tree, δZTC SetOid, trackIdx map[zodb.Oid] ...@@ -918,6 +919,7 @@ func diffT(ctx context.Context, a, b *Tree, δZTC SetOid, trackIdx map[zodb.Oid]
// A queue // A queue
Bqueue = SetKey{} Bqueue = SetKey{}
for k := range Aqueue { for k := range Aqueue {
fmt.Printf(" A [%v]\n", k)
Adone.Add(k) Adone.Add(k)
abucket, ok, err := av.GetToLeaf(ctx, k) abucket, ok, err := av.GetToLeaf(ctx, k)
if err != nil { if err != nil {
...@@ -1479,7 +1481,7 @@ func vnode(node Node) string { ...@@ -1479,7 +1481,7 @@ func vnode(node Node) string {
func (rn nodeInRange) String() string { func (rn nodeInRange) String() string {
slo := "-∞"; if rn.lo > KeyMin { slo = fmt.Sprintf("%v", rn.lo) } slo := "-∞"; if rn.lo > KeyMin { slo = fmt.Sprintf("%v", rn.lo) }
shi := "∞"; if rn.hi_ < KeyMax { shi = fmt.Sprintf("%v", rn.hi_+1) } shi := "∞"; if rn.hi_ < KeyMax { shi = fmt.Sprintf("%v", rn.hi_+1) }
done := ""; if rn.done { done = "*" } done := " "; if rn.done { done = "*" }
return fmt.Sprintf("%s[%s,%s)%s", done, slo, shi, vnode(rn.node)) return fmt.Sprintf("%s[%s,%s)%s", done, slo, shi, vnode(rn.node))
} }
......
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