Skip to content

Commit

Permalink
tiny test fix for mempool_tests
Browse files Browse the repository at this point in the history
  • Loading branch information
morcos authored and furszy committed Jan 18, 2021
1 parent 8c0016e commit 6ebfd17
Showing 1 changed file with 11 additions and 2 deletions.
13 changes: 11 additions & 2 deletions src/test/mempool_tests.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -387,7 +387,12 @@ BOOST_AUTO_TEST_CASE(MempoolAncestorIndexingTest)

pool.addUnchecked(tx6.GetHash(), entry.Fee(0LL).FromTx(tx6));
BOOST_CHECK_EQUAL(pool.size(), 6);
sortedOrder.push_back(tx6.GetHash().ToString());
// Ties are broken by hash
if (tx3.GetHash() < tx6.GetHash())
sortedOrder.push_back(tx6.GetHash().ToString());
else
sortedOrder.insert(sortedOrder.end()-1,tx6.GetHash().ToString());

CheckSort<ancestor_score>(pool, sortedOrder);

CMutableTransaction tx7 = CMutableTransaction();
Expand Down Expand Up @@ -415,7 +420,11 @@ BOOST_AUTO_TEST_CASE(MempoolAncestorIndexingTest)
pool.removeForBlock(vtx, 1, dummy, false);

sortedOrder.erase(sortedOrder.begin()+1);
sortedOrder.pop_back();
// Ties are broken by hash
if (tx3.GetHash() < tx6.GetHash())
sortedOrder.pop_back();
else
sortedOrder.erase(sortedOrder.end()-2);
sortedOrder.insert(sortedOrder.begin(), tx7.GetHash().ToString());
CheckSort<ancestor_score>(pool, sortedOrder);
}
Expand Down

0 comments on commit 6ebfd17

Please sign in to comment.