feat(graph): add convenience function for inserting relevant evicted_ats

Author: LagginTimes

crates/bitcoind_rpc/tests/test_emitter.rs

@@ -835,11 +835,10 @@ fn test_expect_tx_evicted() -> anyhow::Result<()> {
     assert!(mempool_event.evicted_txids.contains(&txid_1));
 
     // Update graph with evicted tx.
-    for txid in mempool_event.evicted_txids {
-        if graph.graph().get_tx_node(txid).is_some() {
-            let _ = graph.insert_evicted_at(txid, mempool_event.latest_update_time);
-        }
-    }
+    let _ = graph.insert_relevant_evicted_ats(
+        mempool_event.evicted_txids,
+        mempool_event.latest_update_time,
+    );
 
     let canonical_txids = graph
         .graph()

crates/chain/src/indexed_tx_graph.rs

@@ -145,6 +145,23 @@ where
         }
     }
 
+    /// Inserts the given `evicted_at` for a set of `txid`s that the graph is tracking.
+    ///
+    /// The `evicted_at` timestamp represents the last known time when the transaction was observed
+    /// to be missing from the mempool. If `txid` was previously recorded with an earlier
+    /// `evicted_at` value, it is updated only if the new value is greater.
+    pub fn insert_relevant_evicted_ats(
+        &mut self,
+        txids: impl IntoIterator<Item = Txid>,
+        evicted_at: u64,
+    ) -> ChangeSet<A, I::ChangeSet> {
+        let tx_graph = self.graph.insert_relevant_evicted_ats(txids, evicted_at);
+        ChangeSet {
+            tx_graph,
+            ..Default::default()
+        }
+    }
+
     /// Batch insert transactions, filtering out those that are irrelevant.
     ///
     /// Relevancy is determined by the [`Indexer::is_tx_relevant`] implementation of `I`. Irrelevant

crates/chain/src/tx_graph.rs

@@ -777,6 +777,27 @@ impl<A: Anchor> TxGraph<A> {
         changeset
     }
 
+    /// Inserts the given `evicted_at` into [`TxGraph`] for a set of `txid`s that the graph is
+    /// tracking.
+    ///
+    /// The `evicted_at` timestamp represents the last known time when the transaction was observed
+    /// to be missing from the mempool. If `txid` was previously recorded with an earlier
+    /// `evicted_at` value, it is updated only if the new value is greater.
+    pub fn insert_relevant_evicted_ats(
+        &mut self,
+        txids: impl IntoIterator<Item = Txid>,
+        evicted_at: u64,
+    ) -> ChangeSet<A> {
+        let mut changeset = ChangeSet::default();
+        for txid in txids {
+            // Only record evictions for transactions the graph is tracking.
+            if self.get_tx_node(txid).is_some() {
+                changeset.merge(self.insert_evicted_at(txid, evicted_at));
+            }
+        }
+        changeset
+    }
+
     /// Extends this graph with the given `update`.
     ///
     /// The returned [`ChangeSet`] is the set difference between `update` and `self` (transactions that