def test_chain_locking():
SIZE = 2000
COUNT = 200
ITEMS = [(i, i-1, 1) for i in range(SIZE*COUNT)]
ITEMS[0] = (0, parent_for_0, 1)
BC = BlockChain(parent_for_0)
assert longest_block_chain(BC) == []
assert BC.locked_length() == 0
assert BC.length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
for i in range(COUNT):
start, end = i*SIZE, (i+1)*SIZE
lock_start = max(0, start-10)
expected_parent = lock_start-1 if lock_start else parent_for_0
assert BC.length() == start
assert BC.locked_length() == lock_start
ops = BC.add_nodes(ITEMS[start:end])
assert ops == [("add", i, i) for i in range(start, end)]
assert longest_locked_block_chain(BC) == list(range(lock_start, end))
assert set(BC.chain_finder.missing_parents()) == {expected_parent}
assert BC.parent_hash == expected_parent
assert BC.locked_length() == lock_start
assert BC.length() == end
for i in range(start, end):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
assert BC.locked_length() == max(0, lock_start)
BC.lock_to_index(end-10)
assert BC.locked_length() == end-10
def test_chain_locking():
SIZE = 2000
COUNT = 200
ITEMS = [(i, i - 1, 1) for i in range(SIZE * COUNT)]
ITEMS[0] = (0, parent_for_0, 1)
BC = BlockChain(parent_for_0)
assert longest_block_chain(BC) == []
assert BC.locked_length() == 0
assert BC.length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
for i in range(COUNT):
start, end = i * SIZE, (i + 1) * SIZE
lock_start = max(0, start - 10)
expected_parent = lock_start - 1 if lock_start else parent_for_0
assert BC.length() == start
assert BC.locked_length() == lock_start
ops = BC.add_nodes(ITEMS[start:end])
assert ops == [("add", i, i) for i in range(start, end)]
assert longest_locked_block_chain(BC) == list(range(lock_start, end))
assert set(BC.chain_finder.missing_parents()) == {expected_parent}
assert BC.parent_hash == expected_parent
assert BC.locked_length() == lock_start
assert BC.length() == end
for i in range(start, end):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
assert BC.locked_length() == max(0, lock_start)
BC.lock_to_index(end - 10)
assert BC.locked_length() == end - 10
def test_large():
SIZE = 3000
ITEMS = [(i, i-1, 1) for i in range(SIZE)]
ITEMS[0] = (0, parent_for_0, 1)
BC = BlockChain(parent_for_0)
assert longest_block_chain(BC) == []
assert BC.locked_length() == 0
assert BC.length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
ops = BC.add_nodes(ITEMS)
assert ops == [("add", i, i) for i in range(SIZE)]
assert longest_block_chain(BC) == list(range(SIZE))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == SIZE
for i in range(SIZE):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
def test_large():
SIZE = 3000
ITEMS = [(i, i - 1, 1) for i in range(SIZE)]
ITEMS[0] = (0, parent_for_0, 1)
BC = BlockChain(parent_for_0)
assert longest_block_chain(BC) == []
assert BC.locked_length() == 0
assert BC.length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
ops = BC.add_nodes(ITEMS)
assert ops == [("add", i, i) for i in range(SIZE)]
assert longest_block_chain(BC) == list(range(SIZE))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == SIZE
for i in range(SIZE):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
def test_basic():
BC = BlockChain(parent_for_0)
ITEMS = [(i, i-1, 1) for i in range(100)]
ITEMS[0] = (0, parent_for_0, 1)
assert longest_block_chain(BC) == []
assert BC.length() == 0
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
assert BC.parent_hash == parent_for_0
assert BC.index_for_hash(0) is None
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[:5])
assert ops == [("add", i, i) for i in range(5)]
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == list(range(5))
assert BC.length() == 5
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
for i in range(5):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[:7])
assert ops == [("add", i, i) for i in range(5,7)]
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == list(range(7))
assert BC.length() == 7
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
for i in range(7):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[10:14])
assert ops == []
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == [0, 1, 2, 3, 4, 5, 6]
assert BC.locked_length() == 0
assert BC.locked_length() == 0
assert BC.length() == 7
assert set(BC.chain_finder.missing_parents()) == {parent_for_0, 9}
for i in range(7):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[7:10])
assert ops == [("add", i, i) for i in range(7,14)]
assert longest_block_chain(BC) == list(range(14))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 14
for i in range(14):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[90:])
assert ops == []
assert longest_block_chain(BC) == list(range(14))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0, 89}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 14
for i in range(14):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[14:90])
assert ops == [("add", i, i) for i in range(14,100)]
assert longest_block_chain(BC) == list(range(100))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 100
for i in range(100):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
def test_basic():
BC = BlockChain(parent_for_0)
ITEMS = [(i, i - 1, 1) for i in range(100)]
ITEMS[0] = (0, parent_for_0, 1)
assert longest_block_chain(BC) == []
assert BC.length() == 0
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == set()
assert BC.parent_hash == parent_for_0
assert BC.index_for_hash(0) is None
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[:5])
assert ops == [("add", i, i) for i in range(5)]
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == list(range(5))
assert BC.length() == 5
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
for i in range(5):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[:7])
assert ops == [("add", i, i) for i in range(5, 7)]
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == list(range(7))
assert BC.length() == 7
assert BC.locked_length() == 0
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
for i in range(7):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[10:14])
assert ops == []
assert BC.parent_hash == parent_for_0
assert longest_block_chain(BC) == [0, 1, 2, 3, 4, 5, 6]
assert BC.locked_length() == 0
assert BC.locked_length() == 0
assert BC.length() == 7
assert set(BC.chain_finder.missing_parents()) == {parent_for_0, 9}
for i in range(7):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[7:10])
assert ops == [("add", i, i) for i in range(7, 14)]
assert longest_block_chain(BC) == list(range(14))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 14
for i in range(14):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[90:])
assert ops == []
assert longest_block_chain(BC) == list(range(14))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0, 89}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 14
for i in range(14):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
ops = BC.add_nodes(ITEMS[14:90])
assert ops == [("add", i, i) for i in range(14, 100)]
assert longest_block_chain(BC) == list(range(100))
assert set(BC.chain_finder.missing_parents()) == {parent_for_0}
assert BC.parent_hash == parent_for_0
assert BC.locked_length() == 0
assert BC.length() == 100
for i in range(100):
v = BC.tuple_for_index(i)
assert v[0] == i
assert v[1] == parent_for_0 if i == 0 else i
assert BC.index_for_hash(-1) is None
