@@ -199,13 +199,13 @@ def run_test(self):
199
199
assert set (mempool1 ).issubset (set (mempool0 ))
200
200
for tx in chain [:CUSTOM_ANCESTOR_LIMIT ]:
201
201
assert tx in mempool1
202
- # TODO: more detailed check of node1's mempool (fees etc. )
203
- # check transaction unbroadcast info (should be false if in both mempools )
204
- mempool = self . nodes [ 0 ]. getrawmempool ( True )
205
- for tx in mempool :
206
- assert_equal (mempool [ tx ]['unbroadcast ' ], False )
207
-
208
- # TODO: test ancestor size limits
202
+ entry0 = self . nodes [ 0 ]. getmempoolentry ( tx )
203
+ entry1 = self . nodes [ 1 ]. getmempoolentry ( tx )
204
+ assert not entry0 [ 'unbroadcast' ]
205
+ assert not entry1 [ 'unbroadcast' ]
206
+ assert_equal (entry1 [ 'fees' ]['base ' ], entry0 [ 'fees' ][ 'base' ] )
207
+ assert_equal ( entry1 [ 'vsize' ], entry0 [ 'vsize' ])
208
+ assert_equal ( entry1 [ 'depends' ], entry0 [ 'depends' ])
209
209
210
210
# Now test descendant chain limits
211
211
@@ -251,10 +251,14 @@ def run_test(self):
251
251
assert tx in mempool1
252
252
for tx in chain [CUSTOM_DESCENDANT_LIMIT :]:
253
253
assert tx not in mempool1
254
- # TODO: more detailed check of node1's mempool (fees etc.)
255
-
256
- # TODO: test descendant size limits
257
-
254
+ for tx in mempool1 :
255
+ entry0 = self .nodes [0 ].getmempoolentry (tx )
256
+ entry1 = self .nodes [1 ].getmempoolentry (tx )
257
+ assert not entry0 ['unbroadcast' ]
258
+ assert not entry1 ['unbroadcast' ]
259
+ assert_equal (entry1 ['fees' ]['base' ], entry0 ['fees' ]['base' ])
260
+ assert_equal (entry1 ['vsize' ], entry0 ['vsize' ])
261
+ assert_equal (entry1 ['depends' ], entry0 ['depends' ])
258
262
# Test reorg handling
259
263
# First, the basics:
260
264
self .generate (self .nodes [0 ], 1 )
0 commit comments