public async Task Tree_tracker_reorganization([ValueSource(nameof(ReorganizationTestCases))] ReorganizedInsertLeafTest test)
{
Address address = TestItem.Addresses[0];
(TestRpcBlockchain TestRpc, BaselineModule BaselineModule)result = await InitializeTestRpc(address);
TestRpcBlockchain testRpc = result.TestRpc;
BaselineTree baselineTree = BuildATree();
Address contractAddress = ContractAddress.From(address, 0L);
BaselineTreeHelper baselineTreeHelper = new (testRpc.LogFinder, _baselineDb, _metadataBaselineDb, LimboNoErrorLogger.Instance);
_ = new BaselineTreeTracker(contractAddress, baselineTree, testRpc.BlockProcessor, baselineTreeHelper, testRpc.BlockFinder, LimboNoErrorLogger.Instance);
MerkleTreeSHAContract contract = new (_abiEncoder, contractAddress);
for (int i = 0; i < test.LeavesInBlocksCounts.Length; i++)
{
InsertLeafFromArray(test.LeavesInTransactionsAndBlocks[i], testRpc, contract, address);
await testRpc.AddBlock();
Assert.AreEqual(test.LeavesInBlocksCounts[i], baselineTree.Count);
}
int initBlocksCount = 4;
int allBlocksCount = initBlocksCount + test.LeavesInBlocksCounts.Length;
TestBlockProducer testRpcBlockProducer = (TestBlockProducer)testRpc.BlockProducer;
Block lastProducedBlock = null;
testRpcBlockProducer.BlockProduced += (o, e) => lastProducedBlock = e.Block;
testRpcBlockProducer.BlockParent = testRpc.BlockTree.FindHeader(allBlocksCount);
InsertLeafFromArray(test.LeavesInMiddleOfReorganization, testRpc, contract, address);
await testRpc.AddBlock(false);
testRpcBlockProducer.BlockParent = lastProducedBlock.Header;
InsertLeafFromArray(test.LeavesInAfterReorganization, testRpc, contract, address);
await testRpc.AddBlock();
Assert.AreEqual(test.FinalLeavesCount, baselineTree.Count);
}
public async Task Tree_tracker_reorganization([ValueSource(nameof(ReorganizationTestCases))] ReorganizedInsertLeafTest test)
{
var address = TestItem.Addresses[0];
var result = await InitializeTestRpc(address);
var testRpc = result.TestRpc;
BaselineTree baselineTree = BuildATree();
var fromContractAdress = ContractAddress.From(address, 0L);
var baselineTreeHelper = new BaselineTreeHelper(testRpc.LogFinder, _baselineDb, _metadataBaselineDb, LimboNoErrorLogger.Instance);
new BaselineTreeTracker(fromContractAdress, baselineTree, testRpc.BlockProcessor, baselineTreeHelper, testRpc.BlockFinder, LimboNoErrorLogger.Instance);
var contract = new MerkleTreeSHAContract(_abiEncoder, fromContractAdress);
UInt256 nonce = 1L;
for (int i = 0; i < test.LeavesInBlocksCounts.Length; i++)
{
nonce = await InsertLeafFromArray(test.LeavesInTransactionsAndBlocks[i], nonce, testRpc, contract, address);
await testRpc.AddBlock();
Assert.AreEqual(test.LeavesInBlocksCounts[i], baselineTree.Count);
}
var initBlocksCount = 4;
var allBlocksCount = initBlocksCount + test.LeavesInBlocksCounts.Length;
testRpc.BlockProducer.BlockParent = testRpc.BlockTree.FindHeader(allBlocksCount);
nonce = 1L;
nonce = await InsertLeafFromArray(test.LeavesInMiddleOfReorganization, nonce, testRpc, contract, address);
await testRpc.AddBlock(false);
testRpc.BlockProducer.BlockParent = testRpc.BlockProducer.LastProducedBlock.Header;
await InsertLeafFromArray(test.LeavesInAfterReorganization, nonce, testRpc, contract, address);
await testRpc.AddBlock();
Assert.AreEqual(test.FinalLeavesCount, baselineTree.Count);
}
