Commit a182bf14 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 2aa8e196
...@@ -195,6 +195,8 @@ func (t *BTree) VGet(ctx context.Context, key KEY, visit func(node Node)) (_ int ...@@ -195,6 +195,8 @@ func (t *BTree) VGet(ctx context.Context, key KEY, visit func(node Node)) (_ int
return key < t.data[j].key return key < t.data[j].key
}) })
// FIXME panic index out of range (empty T without children;
// logically incorrect, but Restructure generated it once)
child := t.data[i].child child := t.data[i].child
t.PDeactivate() t.PDeactivate()
err = child.PActivate(ctx) err = child.PActivate(ctx)
......
...@@ -151,6 +151,7 @@ func TestBTree(t *testing.T) { ...@@ -151,6 +151,7 @@ func TestBTree(t *testing.T) {
obj := xobj.(bmapping) obj := xobj.(bmapping)
// XXX also verify all keys without value -> !ok
for _, kv := range tt.itemv { for _, kv := range tt.itemv {
value, ok, err := obj.Get(ctx, kv.key) value, ok, err := obj.Get(ctx, kv.key)
if err != nil { if err != nil {
......
...@@ -197,6 +197,8 @@ func (t *LOBTree) VGet(ctx context.Context, key int64, visit func(node LONode)) ...@@ -197,6 +197,8 @@ func (t *LOBTree) VGet(ctx context.Context, key int64, visit func(node LONode))
return key < t.data[j].key return key < t.data[j].key
}) })
// FIXME panic index out of range (empty T without children;
// logically incorrect, but Restructure generated it once)
child := t.data[i].child child := t.data[i].child
t.PDeactivate() t.PDeactivate()
err = child.PActivate(ctx) err = child.PActivate(ctx)
......
...@@ -328,7 +328,7 @@ type IStorage interface { ...@@ -328,7 +328,7 @@ type IStorage interface {
Loader Loader
Iterator Iterator
// similar to IStorage // similar to IStorageDriver
// Sync syncs to storage and updates current view of it. // Sync syncs to storage and updates current view of it.
// //
......
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