///
/// The supplied closure returns an `Option<T>`, allowing the caller to map each node it visits
/// and decide whether to visit descendants.
- pub fn walk_descendants<'g, F, O>(&'g self, txid: Txid, walk_map: F) -> TxDescendants<A, F, O>
+ pub fn walk_descendants<'g, F, O>(
+ &'g self,
+ txid: Txid,
+ walk_map: F,
+ ) -> TxDescendants<'g, A, F, O>
where
F: FnMut(usize, Txid) -> Option<O> + 'g,
{
&'g self,
tx: &'g Transaction,
walk_map: F,
- ) -> TxDescendants<A, F, O>
+ ) -> TxDescendants<'g, A, F, O>
where
F: FnMut(usize, Txid) -> Option<O> + 'g,
{
pub fn direct_conflicts<'g>(
&'g self,
tx: &'g Transaction,
- ) -> impl Iterator<Item = (usize, Txid)> + '_ {
+ ) -> impl Iterator<Item = (usize, Txid)> + 'g {
let txid = tx.compute_txid();
tx.input
.iter()
-use alloc::string::String;
use bdk_chain::{
indexed_tx_graph, keychain_txout, local_chain, tx_graph, ConfirmationBlockTime, Merge,
};
pub const WALLET_TABLE_NAME: &'static str = "bdk_wallet";
/// Get v0 sqlite [ChangeSet] schema
- pub fn schema_v0() -> String {
+ pub fn schema_v0() -> alloc::string::String {
format!(
"CREATE TABLE {} ( \
id INTEGER PRIMARY KEY NOT NULL CHECK (id = 0), \