@@ -460,7 +460,11 @@ impl<A: Clone + Ord> TxGraph<A> {
460
460
///
461
461
/// The supplied closure returns an `Option<T>`, allowing the caller to map each node it visits
462
462
/// and decide whether to visit descendants.
463
- pub fn walk_descendants < ' g , F , O > ( & ' g self , txid : Txid , walk_map : F ) -> TxDescendants < A , F , O >
463
+ pub fn walk_descendants < ' g , F , O > (
464
+ & ' g self ,
465
+ txid : Txid ,
466
+ walk_map : F ,
467
+ ) -> TxDescendants < ' g , A , F , O >
464
468
where
465
469
F : FnMut ( usize , Txid ) -> Option < O > + ' g ,
466
470
{
@@ -477,7 +481,7 @@ impl<A> TxGraph<A> {
477
481
& ' g self ,
478
482
tx : & ' g Transaction ,
479
483
walk_map : F ,
480
- ) -> TxDescendants < A , F , O >
484
+ ) -> TxDescendants < ' g , A , F , O >
481
485
where
482
486
F : FnMut ( usize , Txid ) -> Option < O > + ' g ,
483
487
{
@@ -495,7 +499,7 @@ impl<A> TxGraph<A> {
495
499
pub fn direct_conflicts < ' g > (
496
500
& ' g self ,
497
501
tx : & ' g Transaction ,
498
- ) -> impl Iterator < Item = ( usize , Txid ) > + ' _ {
502
+ ) -> impl Iterator < Item = ( usize , Txid ) > + ' g {
499
503
let txid = tx. compute_txid ( ) ;
500
504
tx. input
501
505
. iter ( )
0 commit comments