0
0
Fork 0
mirror of https://github.com/bitcoin/bitcoin.git synced 2025-02-09 10:43:19 -05:00

test: add missing comparison of node1's mempool in MempoolPackagesTest

This commit is contained in:
umiumi 2024-04-24 09:51:01 +08:00
parent a7129f827c
commit e912717ff6
No known key found for this signature in database
GPG key ID: F20077F0C648EAD8

View file

@ -199,13 +199,13 @@ class MempoolPackagesTest(BitcoinTestFramework):
assert set(mempool1).issubset(set(mempool0)) assert set(mempool1).issubset(set(mempool0))
for tx in chain[:CUSTOM_ANCESTOR_LIMIT]: for tx in chain[:CUSTOM_ANCESTOR_LIMIT]:
assert tx in mempool1 assert tx in mempool1
# TODO: more detailed check of node1's mempool (fees etc.) entry0 = self.nodes[0].getmempoolentry(tx)
# check transaction unbroadcast info (should be false if in both mempools) entry1 = self.nodes[1].getmempoolentry(tx)
mempool = self.nodes[0].getrawmempool(True) assert not entry0['unbroadcast']
for tx in mempool: assert not entry1['unbroadcast']
assert_equal(mempool[tx]['unbroadcast'], False) assert_equal(entry1['fees']['base'], entry0['fees']['base'])
assert_equal(entry1['vsize'], entry0['vsize'])
# TODO: test ancestor size limits assert_equal(entry1['depends'], entry0['depends'])
# Now test descendant chain limits # Now test descendant chain limits
@ -251,10 +251,14 @@ class MempoolPackagesTest(BitcoinTestFramework):
assert tx in mempool1 assert tx in mempool1
for tx in chain[CUSTOM_DESCENDANT_LIMIT:]: for tx in chain[CUSTOM_DESCENDANT_LIMIT:]:
assert tx not in mempool1 assert tx not in mempool1
# TODO: more detailed check of node1's mempool (fees etc.) for tx in mempool1:
entry0 = self.nodes[0].getmempoolentry(tx)
# TODO: test descendant size limits entry1 = self.nodes[1].getmempoolentry(tx)
assert not entry0['unbroadcast']
assert not entry1['unbroadcast']
assert_equal(entry1['fees']['base'], entry0['fees']['base'])
assert_equal(entry1['vsize'], entry0['vsize'])
assert_equal(entry1['depends'], entry0['depends'])
# Test reorg handling # Test reorg handling
# First, the basics: # First, the basics:
self.generate(self.nodes[0], 1) self.generate(self.nodes[0], 1)