Commit 5796829c authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 77c54f64
...@@ -39,6 +39,8 @@ type Key = int64 ...@@ -39,6 +39,8 @@ type Key = int64
type Value = zodb.Oid // XXX assumes key points to IPersistent type Value = zodb.Oid // XXX assumes key points to IPersistent
// XXX how to represent deletion? InvalidOid? // XXX how to represent deletion? InvalidOid?
type SetKey = SetI64
// ΔBtail represents tail of revisional changes to BTrees. // ΔBtail represents tail of revisional changes to BTrees.
// //
// It semantically consists of // It semantically consists of
......
...@@ -312,7 +312,7 @@ func TestΔBTail(t *testing.T) { ...@@ -312,7 +312,7 @@ func TestΔBTail(t *testing.T) {
} }
*/ */
// direct tree_i -> tree_{i+1} // direct tree_i -> tree_{i+1} -> _{i+2} ... plus reverse ... tree_i <- _{i+1} <- _{i+2}
at1 := tg.head at1 := tg.head
kv1 := XGetTree(db, at1, tg.treeRoot) kv1 := XGetTree(db, at1, tg.treeRoot)
for _, tree := range testv { for _, tree := range testv {
...@@ -387,7 +387,7 @@ type kvdelta1 struct { ...@@ -387,7 +387,7 @@ type kvdelta1 struct {
} }
func kvdiff(kv1, kv2 map[Key]string) []kvdelta1 { func kvdiff(kv1, kv2 map[Key]string) []kvdelta1 {
delta := []kvdelta1{} delta := []kvdelta1{}
keys := SetI64{} keys := SetKey{}
for k := range kv1 { keys.Add(k) } for k := range kv1 { keys.Add(k) }
for k := range kv2 { keys.Add(k) } for k := range kv2 { keys.Add(k) }
keyv := []Key{} keyv := []Key{}
......
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