})
}
+ /// Iterate over graph transactions with no anchors or last-seen.
+ pub fn txs_with_no_anchor_or_last_seen(
+ &self,
+ ) -> impl Iterator<Item = TxNode<'_, Arc<Transaction>, A>> {
+ self.full_txs().filter_map(|tx| {
+ if tx.anchors.is_empty() && tx.last_seen_unconfirmed.is_none() {
+ Some(tx)
+ } else {
+ None
+ }
+ })
+ }
+
/// Get a transaction by txid. This only returns `Some` for full transactions.
///
/// Refer to [`get_txout`] for getting a specific [`TxOut`].
let mut graph = TxGraph::<BlockId>::new(txs);
let full_txs: Vec<_> = graph.full_txs().collect();
assert_eq!(full_txs.len(), 2);
+ let unseen_txs: Vec<_> = graph.txs_with_no_anchor_or_last_seen().collect();
+ assert_eq!(unseen_txs.len(), 2);
// chain
let blocks: BTreeMap<u32, BlockHash> = [(0, h!("g")), (1, h!("A")), (2, h!("B"))]
.map(|tx| tx.tx_node.txid)
.collect();
assert!(canonical_txids.contains(&txids[1]));
+ assert!(graph.txs_with_no_anchor_or_last_seen().next().is_none());
}
#[test]
self, ApplyHeaderError, CannotConnectError, CheckPoint, CheckPointIter, LocalChain,
},
spk_client::{FullScanRequest, FullScanResult, SyncRequest, SyncResult},
- tx_graph::{CanonicalTx, TxGraph},
+ tx_graph::{CanonicalTx, TxGraph, TxNode},
Append, BlockId, ChainPosition, ConfirmationTime, ConfirmationTimeHeightAnchor, FullTxOut,
Indexed, IndexedTxGraph,
};
self.indexed_graph.graph()
}
+ /// Iterate over transactions in the wallet that are unseen and unanchored likely
+ /// because they haven't been broadcast.
+ pub fn unbroadcast_transactions(
+ &self,
+ ) -> impl Iterator<Item = TxNode<'_, Arc<Transaction>, ConfirmationTimeHeightAnchor>> {
+ self.tx_graph().txs_with_no_anchor_or_last_seen()
+ }
+
/// Get a reference to the inner [`KeychainTxOutIndex`].
pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind> {
&self.indexed_graph.index