Commit 8376e5b7 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent 788cfd92
...@@ -367,11 +367,11 @@ def test_restructure(): ...@@ -367,11 +367,11 @@ def test_restructure():
z = Z0() z = Z0()
R(z, 'T/T/B') R(z, 'T/T/B')
kind, keys, kids = crack_btree(z) kind, keys, kids = crack_btree(z)
assert kind, keys == (BTREE_NORMAL, []) assert (kind, keys) == (BTREE_NORMAL, [])
assert len(kids) == 1 assert len(kids) == 1
assert isinstance(kids[0], XLOTree) assert isinstance(kids[0], XLOTree)
kind, keys, kids = crack_btree(kids[0]) kind, keys, kids = crack_btree(kids[0])
assert kind, keys == (BTREE_NORMAL, []) assert (kind, keys) == (BTREE_NORMAL, [])
assert len(kids) == 0 assert len(kids) == 0
assert isinstance(kids[0], LOBucket) assert isinstance(kids[0], LOBucket)
assert kids[0].keys() == [] assert kids[0].keys() == []
...@@ -380,14 +380,14 @@ def test_restructure(): ...@@ -380,14 +380,14 @@ def test_restructure():
z = Z0() z = Z0()
R(z, 'T1/T-B/B') R(z, 'T1/T-B/B')
kind, keys, kids = crack_btree(z) kind, keys, kids = crack_btree(z)
assert kind, keys == (BTREE_NORMAL, 0) assert (kind, keys) == (BTREE_NORMAL, 0)
assert len(kids) == 1 assert len(kids) == 1
# ø -> T/T-T/B-B # ø -> T/T-T/B-B
z = Z0() z = Z0()
R(z, 'T0/T-T/B-B') R(z, 'T0/T-T/B-B')
kind, keys, kids = crack_btree(z) kind, keys, kids = crack_btree(z)
assert kind, keys == (BTREE_NORMAL, 0) assert (kind, keys) == (BTREE_NORMAL, 0)
assert len(kids) == 2 assert len(kids) == 2
assert isinstance(kids[0], XLOTree) assert isinstance(kids[0], XLOTree)
assert isinstance(kids[1], XLOTree) assert isinstance(kids[1], XLOTree)
......
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