Struct bdk::wallet::Balance

pub struct Balance {
+

`Balance`

`Struct bdk::wallet::Balance`

source Â·

pub struct Balance {
     pub immature: u64,
     pub trusted_pending: u64,
     pub untrusted_pending: u64,
@@ -9,13 +9,13 @@

Â§trusted_pending: u64Unconfirmed UTXOs generated by a wallet tx
 
Â§untrusted_pending: u64Unconfirmed UTXOs received from an external wallet
 
Â§confirmed: u64Confirmed and immediately spendable balance
-
ImplementationsÂ§Â§impl Balance
pub fn trusted_spendable(&self) -> u64
Get sum of trusted_pending and confirmed coins.
+
ImplementationsÂ§
sourceÂ§impl Balance
sourcepub fn trusted_spendable(&self) -> u64
Get sum of trusted_pending and confirmed coins.
 This is the balance you can spend right now that shouldnât get cancelled via another party
 double spending it.
-
pub fn total(&self) -> u64
Get the whole balance visible to the wallet.
-
Trait ImplementationsÂ§
Â§impl Add<Balance> for Balance
Â§type Output = Balance
The resulting type after applying the + operator.
Â§fn add(self, other: Balance) -> Balance
Performs the + operation. Read more
Â§impl Clone for Balance
Â§fn clone(&self) -> Balance
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
Â§impl Debug for Balance
Â§fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
Â§impl Default for Balance
Â§fn default() -> Balance
Returns the âdefault valueâ for a type. Read more
Â§impl<'de> Deserialize<'de> for Balance
Â§fn deserialize<__D>(
    __deserializer: __D
) -> Result<Balance, <__D as Deserializer<'de>>::Error>where
    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Â§impl Display for Balance
Â§fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
Â§impl PartialEq<Balance> for Balance
Â§fn eq(&self, other: &Balance) -> bool
This method tests for self and other values to be equal, and is used
+
sourcepub fn total(&self) -> u64
Get the whole balance visible to the wallet.
+
Trait ImplementationsÂ§
sourceÂ§impl Add<Balance> for Balance
Â§type Output = Balance
The resulting type after applying the + operator.
sourceÂ§fn add(self, other: Balance) -> Balance
Performs the + operation. Read more
sourceÂ§impl Clone for Balance
sourceÂ§fn clone(&self) -> Balance
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceÂ§impl Debug for Balance
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
sourceÂ§impl Default for Balance
sourceÂ§fn default() -> Balance
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<'de> Deserialize<'de> for Balance
sourceÂ§fn deserialize<__D>(
    __deserializer: __D
) -> Result<Balance, <__D as Deserializer<'de>>::Error>where
    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl Display for Balance
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
sourceÂ§impl PartialEq<Balance> for Balance
sourceÂ§fn eq(&self, other: &Balance) -> bool
This method tests for self and other values to be equal, and is used
 by ==. Read more
1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason. Read more
Â§impl Serialize for Balance
Â§fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
    __S: Serializer,
Serialize this value into the given Serde serializer. Read more
Â§impl Eq for Balance
Â§impl StructuralEq for Balance
Â§impl StructuralPartialEq for Balance
Auto Trait ImplementationsÂ§
Â§impl RefUnwindSafe for Balance
Â§impl Send for Balance
Â§impl Sync for Balance
Â§impl Unpin for Balance
Â§impl UnwindSafe for Balance
Blanket ImplementationsÂ§
sourceÂ§impl<T> Any for Twhere
    T: 'static + ?Sized,
sourceÂ§fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
sourceÂ§impl<T> Borrow<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
+sufficient, and should not be overridden without very good reason. Read more
sourceÂ§impl Serialize for Balance
sourceÂ§fn serialize<__S>(
    &self,
    __serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
    __S: Serializer,
Serialize this value into the given Serde serializer. Read more
sourceÂ§impl Eq for Balance
sourceÂ§impl StructuralEq for Balance
sourceÂ§impl StructuralPartialEq for Balance
Auto Trait ImplementationsÂ§
Â§impl RefUnwindSafe for Balance
Â§impl Send for Balance
Â§impl Sync for Balance
Â§impl Unpin for Balance
Â§impl UnwindSafe for Balance
Blanket ImplementationsÂ§
sourceÂ§impl<T> Any for Twhere
    T: 'static + ?Sized,
sourceÂ§fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
sourceÂ§impl<T> Borrow<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
 
sourceÂ§impl<T, U> Into<U> for Twhere
    U: From<T>,
const: unstable Â· sourceÂ§fn into(self) -> U
Calls U::from(self).
 That is, this conversion is whatever the implementation of
 From<T> for U chooses to do.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/struct.Wallet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/struct.Wallet.html
index 66d461f985..964962ac6a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/struct.Wallet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/struct.Wallet.html
@@ -7,14 +7,14 @@ Its main components are:
 signers that can contribute signatures to addresses instantiated from the descriptors.
 
 
ImplementationsÂ§
sourceÂ§impl Wallet
sourcepub fn new_no_persist<E: IntoWalletDescriptor>(
    descriptor: E,
    change_descriptor: Option<E>,
    network: Network
) -> Result<Self, DescriptorError>
Creates a wallet that does not persist data.
-
sourceÂ§impl<D> Wallet<D>
sourcepub fn new<E: IntoWalletDescriptor>(
    descriptor: E,
    change_descriptor: Option<E>,
    db: D,
    network: Network
) -> Result<Self, NewError<D::LoadError>>where
    D: PersistBackend<ChangeSet>,
Create a wallet from a descriptor (and an optional change_descriptor) and load related
+
sourceÂ§impl<D> Wallet<D>
sourcepub fn new<E: IntoWalletDescriptor>(
    descriptor: E,
    change_descriptor: Option<E>,
    db: D,
    network: Network
) -> Result<Self, NewError<D::LoadError>>where
    D: PersistBackend<ChangeSet>,
Create a wallet from a descriptor (and an optional change_descriptor) and load related
 transaction data from db.
 
sourcepub fn network(&self) -> Network
Get the Bitcoin network the wallet is using.
 
sourcepub fn keychains(&self) -> &BTreeMap<KeychainKind, ExtendedDescriptor>
Iterator over all keychains in this wallet
-
sourcepub fn get_address(&mut self, address_index: AddressIndex) -> AddressInfowhere
    D: PersistBackend<ChangeSet>,
Return a derived address using the external descriptor, see AddressIndex for
+
sourcepub fn get_address(&mut self, address_index: AddressIndex) -> AddressInfowhere
    D: PersistBackend<ChangeSet>,
Return a derived address using the external descriptor, see AddressIndex for
 available address index selection strategies. If none of the keys in the descriptor are derivable
 (i.e. does not end with /*) then the same address will always be returned for any AddressIndex.
-
sourcepub fn get_internal_address(
    &mut self,
    address_index: AddressIndex
) -> AddressInfowhere
    D: PersistBackend<ChangeSet>,
Return a derived address using the internal (change) descriptor.
+
sourcepub fn get_internal_address(
    &mut self,
    address_index: AddressIndex
) -> AddressInfowhere
    D: PersistBackend<ChangeSet>,
Return a derived address using the internal (change) descriptor.
 If the wallet doesnât have an internal descriptor it will use the external descriptor.
 see AddressIndex for available address index selection strategies. If none of the keys
 in the descriptor are derivable (i.e. does not end with /*) then the same address will always
@@ -23,8 +23,8 @@ be returned for any 
 
sourcepub fn derivation_of_spk(&self, spk: &Script) -> Option<(KeychainKind, u32)>
Finds how the wallet derived the script pubkey spk.

 Will only return Some(_) if the wallet has given out the spk.
 
sourcepub fn list_unspent(&self) -> impl Iterator<Item = LocalUtxo> + '_
Return the list of unspent outputs of this wallet

-
sourcepub fn checkpoints(&self) -> CheckPointIter
Get all the checkpoints the wallet is currently storing indexed by height.

-
sourcepub fn latest_checkpoint(&self) -> Option<CheckPoint>
Returns the latest checkpoint.

+
sourcepub fn checkpoints(&self) -> CheckPointIter
Get all the checkpoints the wallet is currently storing indexed by height.

+
sourcepub fn latest_checkpoint(&self) -> Option<CheckPoint>
Returns the latest checkpoint.

 
sourcepub fn spks_of_all_keychains(
    &self
) -> BTreeMap<KeychainKind, impl Iterator<Item = (u32, ScriptBuf)> + Clone>
Returns a iterators of all the script pubkeys for the Internal and Externalvariants inKeychainKind`.

 This is inteded to be used when doing a full scan of your addresses (e.g. after restoring
 from seed words). You pass the BTreeMap of iterators to a blockchain data source (e.g.
@@ -35,12 +35,12 @@ script pubkeys the wallet is storing internally).
 See spks_of_all_keychains for more documentation
 
sourcepub fn get_utxo(&self, op: OutPoint) -> Option<LocalUtxo>
Returns the utxo owned by this wallet corresponding to outpoint if it exists in the
 walletâs database.

-
sourcepub fn insert_txout(&mut self, outpoint: OutPoint, txout: TxOut)where
    D: PersistBackend<ChangeSet>,
Inserts a [TxOut] at [OutPoint] into the walletâs transaction graph.
+
sourcepub fn insert_txout(&mut self, outpoint: OutPoint, txout: TxOut)where
    D: PersistBackend<ChangeSet>,
Inserts a [TxOut] at [OutPoint] into the walletâs transaction graph.
 Any inserted TxOuts are not persisted until commit is called.

 This can be used to add a TxOut that the wallet doesnât own but is used as an input to
 a [Transaction] passed to the calculate_fee or calculate_fee_rate functions.
 Only insert TxOuts you trust the values for!
-
sourcepub fn calculate_fee(&self, tx: &Transaction) -> Result<u64, CalculateFeeError>
Calculates the fee of a given transaction. Returns 0 if tx is a coinbase transaction.

+
sourcepub fn calculate_fee(&self, tx: &Transaction) -> Result<u64, CalculateFeeError>
Calculates the fee of a given transaction. Returns 0 if tx is a coinbase transaction.

 To calculate the fee for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
 Note tx does not have to be in the graph for this to work.
@@ -50,7 +50,7 @@ manually insert the TxOut(s) into the tx graph using the let tx = &psbt.clone().extract_tx();
 let fee = wallet.calculate_fee(tx).expect("fee");

-
sourcepub fn calculate_fee_rate(
    &self,
    tx: &Transaction
) -> Result<FeeRate, CalculateFeeError>
Calculate the FeeRate for a given transaction.

+
sourcepub fn calculate_fee_rate(
    &self,
    tx: &Transaction
) -> Result<FeeRate, CalculateFeeError>
Calculate the FeeRate for a given transaction.

 To calculate the fee rate for a [Transaction] with inputs not owned by this wallet you must
 manually insert the TxOut(s) into the tx graph using the insert_txout function.
 Note tx does not have to be in the graph for this to work.
@@ -71,12 +71,12 @@ so it will be correct even if it has not been scanned.
 
 let tx = &psbt.clone().extract_tx();
 let (sent, received) = wallet.sent_and_received(tx);
-
sourcepub fn get_tx(
    &self,
    txid: Txid
) -> Option<CanonicalTx<'_, Transaction, ConfirmationTimeAnchor>>
Get a single transaction from the wallet as a [CanonicalTx] (if the transaction exists).

+
sourcepub fn get_tx(
    &self,
    txid: Txid
) -> Option<CanonicalTx<'_, Transaction, ConfirmationTimeAnchor>>
Get a single transaction from the wallet as a CanonicalTx (if the transaction exists).

 CanonicalTx contains the full transaction alongside meta-data such as:
 
-Blocks that the transaction is Anchored in. These may or may not be blocks that exist
+
Blocks that the transaction is Anchored in. These may or may not be blocks that exist
 in the best chain.
-The [ChainPosition] of the transaction in the best chain - whether the transaction is
+
The ChainPosition of the transaction in the best chain - whether the transaction is
 confirmed or unconfirmed. If the transaction is confirmed, the anchor which proves the
 confirmation is provided. If the transaction is unconfirmed, the unix timestamp of when
 the transaction was last seen in the mempool is provided.
@@ -109,11 +109,11 @@ the transaction was last seen in the mempool is provided.
         last_seen,
     ),
 }
-
sourcepub fn insert_checkpoint(
    &mut self,
    block_id: BlockId
) -> Result<bool, InsertBlockError>where
    D: PersistBackend<ChangeSet>,
Add a new checkpoint to the walletâs internal view of the chain.
+
sourcepub fn insert_checkpoint(
    &mut self,
    block_id: BlockId
) -> Result<bool, InsertBlockError>where
    D: PersistBackend<ChangeSet>,
Add a new checkpoint to the walletâs internal view of the chain.
 This stages but does not commit the change.
 Returns whether anything changed with the insertion (e.g. false if checkpoint was already
 there).
-
sourcepub fn insert_tx(
    &mut self,
    tx: Transaction,
    position: ConfirmationTime
) -> Result<bool, InsertTxError>where
    D: PersistBackend<ChangeSet>,
Add a transaction to the walletâs internal view of the chain. This stages but does not
+
sourcepub fn insert_tx(
    &mut self,
    tx: Transaction,
    position: ConfirmationTime
) -> Result<bool, InsertTxError>where
    D: PersistBackend<ChangeSet>,
Add a transaction to the walletâs internal view of the chain. This stages but does not
 commit the change.
 Returns whether anything changed with the transaction insertion (e.g. false if the
 transaction was already inserted at the same position).
@@ -123,7 +123,7 @@ inserting new transactions.
 WARNING: If position is confirmed, we anchor the tx to a the lowest checkpoint that
 is >= the positionâs height. The caller is responsible for ensuring the tx exists in our
 local view of the best chainâs history.
-
sourcepub fn transactions(
    &self
) -> impl Iterator<Item = CanonicalTx<'_, Transaction, ConfirmationTimeAnchor>> + '_
Iterate over the transactions in the wallet.
+
sourcepub fn transactions(
    &self
) -> impl Iterator<Item = CanonicalTx<'_, Transaction, ConfirmationTimeAnchor>> + '_
Iterate over the transactions in the wallet.
 
sourcepub fn get_balance(&self) -> Balance
Return the balance, separated into available, trusted-pending, untrusted-pending and immature
 values.
 
sourcepub fn add_signer(
    &mut self,
    keychain: KeychainKind,
    ordering: SignerOrdering,
    signer: Arc<dyn TransactionSigner>
)
Add an external signer
@@ -207,17 +207,17 @@ Otherwise, it will return the index of the highest address it has derived.
 
sourcepub fn get_psbt_input(
    &self,
    utxo: LocalUtxo,
    sighash_type: Option<PsbtSighashType>,
    only_witness_utxo: bool
) -> Result<Input, Error>
get the corresponding PSBT Input for a LocalUtxo
 
sourcepub fn descriptor_checksum(&self, keychain: KeychainKind) -> String
Return the checksum of the public descriptor associated to keychain
 Internally calls Self::get_descriptor_for_keychain to fetch the right descriptor
-
sourcepub fn apply_update(&mut self, update: Update) -> Result<(), CannotConnectError>where
    D: PersistBackend<ChangeSet>,
Applies an update to the wallet and stages the changes (but does not commit them).
+
sourcepub fn apply_update(&mut self, update: Update) -> Result<(), CannotConnectError>where
    D: PersistBackend<ChangeSet>,
Applies an update to the wallet and stages the changes (but does not commit them).
 Usually you create an update by interacting with some blockchain data source and inserting
 transactions related to your wallet into it.
-
sourcepub fn commit(&mut self) -> Result<bool, D::WriteError>where
    D: PersistBackend<ChangeSet>,
Commits all currently staged changed to the persistence backend returning and error when
+
sourcepub fn commit(&mut self) -> Result<bool, D::WriteError>where
    D: PersistBackend<ChangeSet>,
Commits all currently staged changed to the persistence backend returning and error when
 this fails.
 This returns whether the update resulted in any changes.
-
sourcepub fn staged(&self) -> &ChangeSetwhere
    D: PersistBackend<ChangeSet>,
Returns the changes that will be staged with the next call to commit.
-
sourcepub fn tx_graph(&self) -> &TxGraph<ConfirmationTimeAnchor>
Get a reference to the inner [TxGraph].
-
sourcepub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
Get a reference to the inner [KeychainTxOutIndex].
-
sourcepub fn local_chain(&self) -> &LocalChain
Get a reference to the inner [LocalChain].
-
Trait ImplementationsÂ§
sourceÂ§impl<D> AsRef<TxGraph<ConfirmationTimeAnchor>> for Wallet<D>
sourceÂ§fn as_ref(&self) -> &TxGraph<ConfirmationTimeAnchor>
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl<D: Debug> Debug for Wallet<D>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait ImplementationsÂ§
Â§impl<D = ()> !RefUnwindSafe for Wallet<D>
Â§impl<D> Send for Wallet<D>where
    D: Send,
Â§impl<D> Sync for Wallet<D>where
    D: Sync,
Â§impl<D> Unpin for Wallet<D>where
    D: Unpin,
Â§impl<D = ()> !UnwindSafe for Wallet<D>
Blanket ImplementationsÂ§
sourceÂ§impl<T> Any for Twhere
    T: 'static + ?Sized,
sourceÂ§fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
sourceÂ§impl<T> Borrow<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
+
sourcepub fn staged(&self) -> &ChangeSetwhere
    D: PersistBackend<ChangeSet>,
Returns the changes that will be staged with the next call to commit.
+
sourcepub fn tx_graph(&self) -> &TxGraph<ConfirmationTimeAnchor>
Get a reference to the inner TxGraph.
+
sourcepub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>
Get a reference to the inner KeychainTxOutIndex.
+
sourcepub fn local_chain(&self) -> &LocalChain
Get a reference to the inner LocalChain.
+
Trait ImplementationsÂ§
sourceÂ§impl<D> AsRef<TxGraph<ConfirmationTimeAnchor>> for Wallet<D>
sourceÂ§fn as_ref(&self) -> &TxGraph<ConfirmationTimeAnchor>
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl<D: Debug> Debug for Wallet<D>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait ImplementationsÂ§
Â§impl<D = ()> !RefUnwindSafe for Wallet<D>
Â§impl<D> Send for Wallet<D>where
    D: Send,
Â§impl<D> Sync for Wallet<D>where
    D: Sync,
Â§impl<D> Unpin for Wallet<D>where
    D: Unpin,
Â§impl<D = ()> !UnwindSafe for Wallet<D>
Blanket ImplementationsÂ§sourceÂ§impl<T> Any for Twhere
    T: 'static + ?Sized,
sourceÂ§fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
sourceÂ§impl<T> Borrow<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
 sourceÂ§impl<T, U> Into<U> for Twhere
    U: From<T>,const: unstable Â· sourceÂ§fn into(self) -> U
Calls U::from(self).
 That is, this conversion is whatever the implementation of
 From<T> for U chooses to do.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/tx_builder/struct.TxBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/tx_builder/struct.TxBuilder.html
index 721a9cf3c0..3433aa2a4f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/tx_builder/struct.TxBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/tx_builder/struct.TxBuilder.html
@@ -164,7 +164,7 @@ BitBox and ColdCard are known to require this.
 
sourcepub fn coin_selection<P: CoinSelectionAlgorithm>(
    self,
    coin_selection: P
) -> TxBuilder<'a, D, P, Ctx>
Choose the coin selection algorithm
 Overrides the DefaultCoinSelectionAlgorithm.
 Note that this function consumes the builder and returns it so it is usually best to put this as the first call on the builder.
-
sourcepub fn finish(self) -> Result<Psbt, Error>where
    D: PersistBackend<ChangeSet>,
Finish building the transaction.
+
sourcepub fn finish(self) -> Result<Psbt, Error>where
    D: PersistBackend<ChangeSet>,
Finish building the transaction.
 Returns the BIP174 âPSBTâ and summary details about the transaction.
 sourcepub fn enable_rbf(&mut self) -> &mut SelfEnable signaling RBF
 This will use the default nSequence value of 0xFFFFFFFD.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.ChangeSet.html
index 48cd94d27f..32571f1f38 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.ChangeSet.html
@@ -1,3 +1,3 @@
 ChangeSet in bdk::wallet - Rust

-                    ChangeSet
In bdk::wallet?
Type Definition bdk::wallet::ChangeSet
source Â· 
pub type ChangeSet = WalletChangeSet<KeychainKind, ConfirmationTimeAnchor>;
Expand description
The changeset produced internally by Wallet when mutated.
+                    
ChangeSet
In bdk::wallet
?
Type Definition bdk::wallet::ChangeSet
source Â· 
pub type ChangeSet = WalletChangeSet<KeychainKind, ConfirmationTimeAnchor>;
Expand description
The changeset produced internally by Wallet when mutated.
 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.Update.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.Update.html
index fa70cc01e7..54fc3c7f2b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.Update.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk/wallet/type.Update.html
@@ -1,3 +1,3 @@
 Update in bdk::wallet - Rust

-                    Update
In bdk::wallet
?
Type Definition bdk::wallet::Update
source Â· 
pub type Update = WalletUpdate<KeychainKind, ConfirmationTimeAnchor>;
Expand description
The update to a Wallet used in Wallet::apply_update. This is usually returned from blockchain data sources.
+                    
Update
In bdk::wallet
?
Type Definition bdk::wallet::Update
source Â· 
pub type Update = WalletUpdate<KeychainKind, ConfirmationTimeAnchor>;
Expand description
The update to a Wallet used in Wallet::apply_update. This is usually returned from blockchain data sources.
 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html
index 305ab0c4b3..3d0021c063 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.SpkIterator.html
@@ -9,8 +9,8 @@ when using their default implementations.
 let mut spk_iter = SpkIterator::new(&descriptor);
 assert_eq!(spk_iter.next(), Some((0, external_spk_0)));
 assert_eq!(spk_iter.next(), None);
-
ImplementationsÂ§
sourceÂ§impl<D> SpkIterator<D>where
    D: Borrow<Descriptor<DescriptorPublicKey>>,
sourcepub fn new(descriptor: D) -> Self
Creates a new script pubkey iterator starting at 0 from a descriptor.

-
Trait ImplementationsÂ§
sourceÂ§impl<D: Clone> Clone for SpkIterator<D>
sourceÂ§fn clone(&self) -> SpkIterator<D> â
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceÂ§impl<D> Iterator for SpkIterator<D>where
    D: Borrow<Descriptor<DescriptorPublicKey>>,
Â§type Item = (u32, ScriptBuf)
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
sourceÂ§fn next_chunk<const N: usize>(
    &mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
    Self: Sized,
ð¬This is a nightly-only experimental API. (iter_next_chunk)Advances the iterator and returns an array containing the next N values. Read more
1.0.0 Â· sourceÂ§fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
1.0.0 Â· sourceÂ§fn count(self) -> usizewhere
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
+
ImplementationsÂ§
sourceÂ§impl<D> SpkIterator<D>where
    D: Borrow<Descriptor<DescriptorPublicKey>>,
sourcepub fn new(descriptor: D) -> Self
Creates a new script pubkey iterator starting at 0 from a descriptor.

+
Trait ImplementationsÂ§
sourceÂ§impl<D: Clone> Clone for SpkIterator<D>
sourceÂ§fn clone(&self) -> SpkIterator<D> â
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceÂ§impl<D> Iterator for SpkIterator<D>where
    D: Borrow<Descriptor<DescriptorPublicKey>>,
Â§type Item = (u32, ScriptBuf)
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
sourceÂ§fn next_chunk<const N: usize>(
    &mut self
) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
    Self: Sized,
ð¬This is a nightly-only experimental API. (iter_next_chunk)Advances the iterator and returns an array containing the next N values. Read more
1.0.0 Â· sourceÂ§fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
1.0.0 Â· sourceÂ§fn count(self) -> usizewhere
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
 the given amount at each iteration. Read more
1.0.0 Â· sourceÂ§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 Â· sourceÂ§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator,
âZips upâ two iterators into a single iterator of pairs. Read more
sourceÂ§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
    Self: Sized,
    G: FnMut() -> Self::Item,
ð¬This is a nightly-only experimental API. (iter_intersperse)Creates a new iterator which places an item generated by separator
 between adjacent items of the original iterator. Read more
1.0.0 Â· sourceÂ§fn map<B, F>(self, f: F) -> Map<Self, F>where
    Self: Sized,
    F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each
 element. Read more
1.21.0 Â· sourceÂ§fn for_each<F>(self, f: F)where
    Self: Sized,
    F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
1.0.0 Â· sourceÂ§fn filter<P>(self, predicate: P) -> Filter<Self, P>where
    Self: Sized,
    P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
index 033b106809..008172a2a2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
@@ -1,4 +1,4 @@
-bdk_electrum - Rust
Crate bdk_electrum
Version 0.3.0
All Items
Re-exports
Structs
Traits
?
Crate bdk_electrum
source Â· 
Expand description
This crate is used for updating structures of the [bdk_chain] crate with data from electrum.
+bdk_electrum - Rust
Crate bdk_electrum
Version 0.3.0
All Items
Re-exports
Structs
Traits
?
Crate bdk_electrum
source Â· 
Expand description
This crate is used for updating structures of the bdk_chain crate with data from electrum.
 The star of the show is the ElectrumExt::scan method, which scans for relevant blockchain
 data (via electrum) and outputs an ElectrumUpdate.
 An ElectrumUpdate only includes txids and no full transactions. The caller is responsible
@@ -15,4 +15,4 @@ these steps:
 
 
 Refer to bdk_electrum_example for a complete example.
-
Re-exports
pub use bdk_chain;
pub use electrum_client;
Structs
ElectrumUpdate
Represents an update fetched from an Electrum server, but excludes full transactions.
Traits
ElectrumExt
Trait to extend [Client] functionality.

\ No newline at end of file
+
Re-exports
pub use bdk_chain;
pub use electrum_client;
Structs
ElectrumUpdate
Represents an update fetched from an Electrum server, but excludes full transactions.
Traits
ElectrumExt
Trait to extend [Client] functionality.

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.ElectrumUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.ElectrumUpdate.html
index 59af13fd61..c70fc88681 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.ElectrumUpdate.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.ElectrumUpdate.html
@@ -1,20 +1,20 @@
 ElectrumUpdate in bdk_electrum - Rust
ElectrumUpdate
Fields
graph_update
keychain_update
new_tip
Methods
finalize
finalize_as_confirmation_time
missing_full_txs
Trait Implementations
Clone
Debug
Auto Trait Implementations
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_electrum
?
Struct bdk_electrum::ElectrumUpdate
source Â· 
pub struct ElectrumUpdate<K, A> {
     pub graph_update: HashMap<Txid, BTreeSet<A>>,
-    pub new_tip: CheckPoint,
+    pub new_tip: CheckPoint,
     pub keychain_update: BTreeMap<K, u32>,
 }
Expand description
Represents an update fetched from an Electrum server, but excludes full transactions.
-To provide a complete update to [TxGraph], youâll need to call Self::missing_full_txs to
-determine the full transactions missing from [TxGraph]. Then call Self::finalize to fetch
+
To provide a complete update to TxGraph, youâll need to call Self::missing_full_txs to
+determine the full transactions missing from TxGraph. Then call Self::finalize to fetch
 the full transactions from Electrum and finalize the update.
-
FieldsÂ§
Â§graph_update: HashMap<Txid, BTreeSet<A>>Map of [Txid]s to associated [Anchor]s.
-
Â§new_tip: CheckPointThe latest chain tip, as seen by the Electrum server.
-
Â§keychain_update: BTreeMap<K, u32>Last-used index update for KeychainTxOutIndex.
-
ImplementationsÂ§
sourceÂ§impl<K, A: Anchor> ElectrumUpdate<K, A>
sourcepub fn missing_full_txs<A2>(&self, graph: &TxGraph<A2>) -> Vec<Txid>
Determine the full transactions that are missing from graph.
+
FieldsÂ§
Â§graph_update: HashMap<Txid, BTreeSet<A>>Map of [Txid]s to associated Anchors.
+
Â§new_tip: CheckPointThe latest chain tip, as seen by the Electrum server.
+
Â§keychain_update: BTreeMap<K, u32>Last-used index update for KeychainTxOutIndex.
+
ImplementationsÂ§
sourceÂ§impl<K, A: Anchor> ElectrumUpdate<K, A>
sourcepub fn missing_full_txs<A2>(&self, graph: &TxGraph<A2>) -> Vec<Txid>
Determine the full transactions that are missing from graph.
 Refer to ElectrumUpdate.
-
sourcepub fn finalize(
    self,
    client: &Client,
    seen_at: Option<u64>,
    missing: Vec<Txid>
) -> Result<WalletUpdate<K, A>, Error>
Finalizes update with missing txids to fetch from client.
+
sourcepub fn finalize(
    self,
    client: &Client,
    seen_at: Option<u64>,
    missing: Vec<Txid>
) -> Result<WalletUpdate<K, A>, Error>
Finalizes update with missing txids to fetch from client.
 Refer to ElectrumUpdate.
-
sourceÂ§impl<K> ElectrumUpdate<K, ConfirmationHeightAnchor>
sourcepub fn finalize_as_confirmation_time(
    self,
    client: &Client,
    seen_at: Option<u64>,
    missing: Vec<Txid>
) -> Result<WalletUpdate<K, ConfirmationTimeAnchor>, Error>
Finalizes the ElectrumUpdate with new_txs and anchors of type
-[ConfirmationTimeAnchor].
+
sourceÂ§impl<K> ElectrumUpdate<K, ConfirmationHeightAnchor>
sourcepub fn finalize_as_confirmation_time(
    self,
    client: &Client,
    seen_at: Option<u64>,
    missing: Vec<Txid>
) -> Result<WalletUpdate<K, ConfirmationTimeAnchor>, Error>
Finalizes the ElectrumUpdate with new_txs and anchors of type
+ConfirmationTimeAnchor.
 Note: The confirmation time might not be precisely correct if there has been a reorg.
 Electrumâs API intends that we use the merkle proof API, we should change bdk_electrum to
 use it.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/trait.ElectrumExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/trait.ElectrumExt.html
index 7142fbc965..0fbe07ae31 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/trait.ElectrumExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/trait.ElectrumExt.html
@@ -1,18 +1,18 @@
 ElectrumExt in bdk_electrum - Rust
ElectrumExt
Required Methods
scan
Provided Methods
scan_without_keychain
Implementations on Foreign Types
Client
Implementors
In bdk_electrum
?
Trait bdk_electrum::ElectrumExt
source Â· 
pub trait ElectrumExt<A> {
-    fn scan<K: Ord + Clone>(
        &self,
        prev_tip: Option<CheckPoint>,
        keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        stop_gap: usize,
        batch_size: usize
    ) -> Result<ElectrumUpdate<K, A>, Error>;
+    fn scan<K: Ord + Clone>(
        &self,
        prev_tip: Option<CheckPoint>,
        keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        stop_gap: usize,
        batch_size: usize
    ) -> Result<ElectrumUpdate<K, A>, Error>;
 
-    fn scan_without_keychain(
        &self,
        prev_tip: Option<CheckPoint>,
        misc_spks: impl IntoIterator<Item = ScriptBuf>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        batch_size: usize
    ) -> Result<ElectrumUpdate<(), A>, Error> { ... }
+    fn scan_without_keychain(
        &self,
        prev_tip: Option<CheckPoint>,
        misc_spks: impl IntoIterator<Item = ScriptBuf>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        batch_size: usize
    ) -> Result<ElectrumUpdate<(), A>, Error> { ... }
 }
Expand description
Trait to extend [Client] functionality.
-
Required MethodsÂ§
sourcefn scan<K: Ord + Clone>(
    &self,
    prev_tip: Option<CheckPoint>,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    batch_size: usize
) -> Result<ElectrumUpdate<K, A>, Error>
Scan the blockchain (via electrum) for the data specified and returns a ElectrumUpdate.
+
Required MethodsÂ§
sourcefn scan<K: Ord + Clone>(
    &self,
    prev_tip: Option<CheckPoint>,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    batch_size: usize
) -> Result<ElectrumUpdate<K, A>, Error>
Scan the blockchain (via electrum) for the data specified and returns a ElectrumUpdate.
 
 prev_tip: the most recent blockchain tip present locally
 keychain_spks: keychains that we want to scan transactions for
-txids: transactions for which we want updated [Anchor]s
+txids: transactions for which we want updated Anchors
 outpoints: transactions associated with these outpoints (residing, spending) that we
 want to included in the update
 
 The scan for each keychain stops after a gap of stop_gap script pubkeys with no associated
 transactions. batch_size specifies the max number of script pubkeys to request for in a
 single batch request.
-
Provided MethodsÂ§
sourcefn scan_without_keychain(
    &self,
    prev_tip: Option<CheckPoint>,
    misc_spks: impl IntoIterator<Item = ScriptBuf>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    batch_size: usize
) -> Result<ElectrumUpdate<(), A>, Error>
Convenience method to call scan without requiring a keychain.
-
Implementations on Foreign TypesÂ§
sourceÂ§impl ElectrumExt<ConfirmationHeightAnchor> for Client
sourceÂ§fn scan<K: Ord + Clone>(
    &self,
    prev_tip: Option<CheckPoint>,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    batch_size: usize
) -> Result<ElectrumUpdate<K, ConfirmationHeightAnchor>, Error>
ImplementorsÂ§

\ No newline at end of file
+
Provided MethodsÂ§
sourcefn scan_without_keychain(
    &self,
    prev_tip: Option<CheckPoint>,
    misc_spks: impl IntoIterator<Item = ScriptBuf>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    batch_size: usize
) -> Result<ElectrumUpdate<(), A>, Error>
Convenience method to call scan without requiring a keychain.
+
Implementations on Foreign TypesÂ§
sourceÂ§impl ElectrumExt<ConfirmationHeightAnchor> for Client
sourceÂ§fn scan<K: Ord + Clone>(
    &self,
    prev_tip: Option<CheckPoint>,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    batch_size: usize
) -> Result<ElectrumUpdate<K, ConfirmationHeightAnchor>, Error>
ImplementorsÂ§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
index ab1dd0fb13..4ae9e734f6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/index.html
@@ -1,5 +1,5 @@
 bdk_esplora - Rust
Crate bdk_esplora
Version 0.3.0
All Items
Re-exports
Traits
?
Crate bdk_esplora
source Â· 
Expand description
BDK Esplora
-BDK Esplora extends esplora_client to update [bdk_chain] structures
+
BDK Esplora extends esplora_client to update bdk_chain structures
 from an Esplora server.
 Usage
 There are two versions of the extension trait (blocking and async).
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
index 0218d90018..18af7682e2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraAsyncExt.html
@@ -1,27 +1,27 @@
 EsploraAsyncExt in bdk_esplora - Rust
EsploraAsyncExt
Required Methods
update_local_chain
update_tx_graph
Provided Methods
update_tx_graph_without_keychain
Implementations on Foreign Types
AsyncClient
Implementors
In bdk_esplora
?
Trait bdk_esplora::EsploraAsyncExt
source Â· 
pub trait EsploraAsyncExt {
-    fn update_local_chain<'life0, 'async_trait>(
        &'life0 self,
        local_tip: Option<CheckPoint>,
        request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
    ) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>
    where
        Self: 'async_trait,
        'life0: 'async_trait;
-    fn update_tx_graph<'life0, 'async_trait, K>(
        &'life0 self,
        keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
        txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
        outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
        stop_gap: usize,
        parallel_requests: usize
    ) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>
    where
        K: 'async_trait + Ord + Clone + Send,
        Self: 'async_trait,
        'life0: 'async_trait;
+    fn update_local_chain<'life0, 'async_trait>(
        &'life0 self,
        local_tip: Option<CheckPoint>,
        request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
    ) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>
    where
        Self: 'async_trait,
        'life0: 'async_trait;
+    fn update_tx_graph<'life0, 'async_trait, K>(
        &'life0 self,
        keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
        txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
        outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
        stop_gap: usize,
        parallel_requests: usize
    ) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>
    where
        K: 'async_trait + Ord + Clone + Send,
        Self: 'async_trait,
        'life0: 'async_trait;
 
-    fn update_tx_graph_without_keychain<'life0, 'async_trait>(
        &'life0 self,
        misc_spks: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = ScriptBuf> + Send> + Send,
        txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
        outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
        parallel_requests: usize
    ) -> Pin<Box<dyn Future<Output = Result<TxGraph<ConfirmationTimeAnchor>, Error>> + Send + 'async_trait>>
    where
        Self: Sync + 'async_trait,
        'life0: 'async_trait,
+    fn update_tx_graph_without_keychain<'life0, 'async_trait>(
        &'life0 self,
        misc_spks: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = ScriptBuf> + Send> + Send,
        txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
        outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
        parallel_requests: usize
    ) -> Pin<Box<dyn Future<Output = Result<TxGraph<ConfirmationTimeAnchor>, Error>> + Send + 'async_trait>>
    where
        Self: Sync + 'async_trait,
        'life0: 'async_trait,
     { ... }
 }
Expand description
Trait to extend the functionality of [esplora_client::AsyncClient].
 Refer to crate-level documentation for more.
-
Required MethodsÂ§
sourcefn update_local_chain<'life0, 'async_trait>(
    &'life0 self,
    local_tip: Option<CheckPoint>,
    request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>where
    Self: 'async_trait,
    'life0: 'async_trait,
Prepare an LocalChain update with blocks fetched from Esplora.
+
Required MethodsÂ§
sourcefn update_local_chain<'life0, 'async_trait>(
    &'life0 self,
    local_tip: Option<CheckPoint>,
    request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>where
    Self: 'async_trait,
    'life0: 'async_trait,
Prepare an LocalChain update with blocks fetched from Esplora.
 
-prev_tip is the previous tip of LocalChain::tip.
+prev_tip is the previous tip of LocalChain::tip.
 get_heights is the block heights that we are interested in fetching from Esplora.
 
-The result of this method can be applied to LocalChain::apply_update.
-
sourcefn update_tx_graph<'life0, 'async_trait, K>(
    &'life0 self,
    keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    stop_gap: usize,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>where
    K: 'async_trait + Ord + Clone + Send,
    Self: 'async_trait,
    'life0: 'async_trait,
Scan Esplora for the data specified and return a [TxGraph] and a map of last active
+
The result of this method can be applied to LocalChain::apply_update.
+
sourcefn update_tx_graph<'life0, 'async_trait, K>(
    &'life0 self,
    keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    stop_gap: usize,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>where
    K: 'async_trait + Ord + Clone + Send,
    Self: 'async_trait,
    'life0: 'async_trait,
Scan Esplora for the data specified and return a TxGraph and a map of last active
 indices.
 
 keychain_spks: keychains that we want to scan transactions for
-txids: transactions for which we want updated [ConfirmationTimeAnchor]s
+txids: transactions for which we want updated ConfirmationTimeAnchors
 outpoints: transactions associated with these outpoints (residing, spending) that we
 want to include in the update
 
 The scan for each keychain stops after a gap of stop_gap script pubkeys with no associated
 transactions. parallel_requests specifies the max number of HTTP requests to make in
 parallel.
-
Provided MethodsÂ§
sourcefn update_tx_graph_without_keychain<'life0, 'async_trait>(
    &'life0 self,
    misc_spks: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = ScriptBuf> + Send> + Send,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<TxGraph<ConfirmationTimeAnchor>, Error>> + Send + 'async_trait>>where
    Self: Sync + 'async_trait,
    'life0: 'async_trait,
Convenience method to call update_tx_graph without requiring a keychain.
-
Implementations on Foreign TypesÂ§
sourceÂ§impl EsploraAsyncExt for AsyncClient
sourceÂ§fn update_local_chain<'life0, 'async_trait>(
    &'life0 self,
    local_tip: Option<CheckPoint>,
    request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>where
    Self: 'async_trait,
    'life0: 'async_trait,
sourceÂ§fn update_tx_graph<'life0, 'async_trait, K>(
    &'life0 self,
    keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    stop_gap: usize,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>where
    K: 'async_trait + Ord + Clone + Send,
    Self: 'async_trait,
    'life0: 'async_trait,
ImplementorsÂ§

\ No newline at end of file
+
Provided MethodsÂ§
sourcefn update_tx_graph_without_keychain<'life0, 'async_trait>(
    &'life0 self,
    misc_spks: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = ScriptBuf> + Send> + Send,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<TxGraph<ConfirmationTimeAnchor>, Error>> + Send + 'async_trait>>where
    Self: Sync + 'async_trait,
    'life0: 'async_trait,
Convenience method to call update_tx_graph without requiring a keychain.
+
Implementations on Foreign TypesÂ§
sourceÂ§impl EsploraAsyncExt for AsyncClient
sourceÂ§fn update_local_chain<'life0, 'async_trait>(
    &'life0 self,
    local_tip: Option<CheckPoint>,
    request_heights: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = u32> + Send> + Send
) -> Pin<Box<dyn Future<Output = Result<Update, Error>> + Send + 'async_trait>>where
    Self: 'async_trait,
    'life0: 'async_trait,
sourceÂ§fn update_tx_graph<'life0, 'async_trait, K>(
    &'life0 self,
    keychain_spks: BTreeMap<K, impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = (u32, ScriptBuf)> + Send> + Send>,
    txids: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = Txid> + Send> + Send,
    outpoints: impl 'async_trait + IntoIterator<IntoIter = impl 'async_trait + Iterator<Item = OutPoint> + Send> + Send,
    stop_gap: usize,
    parallel_requests: usize
) -> Pin<Box<dyn Future<Output = Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>> + Send + 'async_trait>>where
    K: 'async_trait + Ord + Clone + Send,
    Self: 'async_trait,
    'life0: 'async_trait,
ImplementorsÂ§


\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
index 194be410cf..2205548e53 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_esplora/trait.EsploraExt.html
@@ -1,26 +1,26 @@
 EsploraExt in bdk_esplora - Rust
EsploraExt
Required Methods
update_local_chain
update_tx_graph
Provided Methods
update_tx_graph_without_keychain
Implementations on Foreign Types
BlockingClient
Implementors
In bdk_esplora
?
Trait bdk_esplora::EsploraExt
source Â· 
pub trait EsploraExt {
-    fn update_local_chain(
        &self,
        local_tip: Option<CheckPoint>,
        request_heights: impl IntoIterator<Item = u32>
    ) -> Result<Update, Error>;
-    fn update_tx_graph<K: Ord + Clone>(
        &self,
        keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        stop_gap: usize,
        parallel_requests: usize
    ) -> Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>;
+    fn update_local_chain(
        &self,
        local_tip: Option<CheckPoint>,
        request_heights: impl IntoIterator<Item = u32>
    ) -> Result<Update, Error>;
+    fn update_tx_graph<K: Ord + Clone>(
        &self,
        keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        stop_gap: usize,
        parallel_requests: usize
    ) -> Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>;
 
-    fn update_tx_graph_without_keychain(
        &self,
        misc_spks: impl IntoIterator<Item = ScriptBuf>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        parallel_requests: usize
    ) -> Result<TxGraph<ConfirmationTimeAnchor>, Error> { ... }
+    fn update_tx_graph_without_keychain(
        &self,
        misc_spks: impl IntoIterator<Item = ScriptBuf>,
        txids: impl IntoIterator<Item = Txid>,
        outpoints: impl IntoIterator<Item = OutPoint>,
        parallel_requests: usize
    ) -> Result<TxGraph<ConfirmationTimeAnchor>, Error> { ... }
 }
Expand description
Trait to extend the functionality of [esplora_client::BlockingClient].
 Refer to crate-level documentation for more.
-
Required MethodsÂ§
sourcefn update_local_chain(
    &self,
    local_tip: Option<CheckPoint>,
    request_heights: impl IntoIterator<Item = u32>
) -> Result<Update, Error>
Prepare an LocalChain update with blocks fetched from Esplora.
+
Required MethodsÂ§
sourcefn update_local_chain(
    &self,
    local_tip: Option<CheckPoint>,
    request_heights: impl IntoIterator<Item = u32>
) -> Result<Update, Error>
Prepare an LocalChain update with blocks fetched from Esplora.
 
-prev_tip is the previous tip of LocalChain::tip.
+prev_tip is the previous tip of LocalChain::tip.
 get_heights is the block heights that we are interested in fetching from Esplora.
 
-The result of this method can be applied to LocalChain::apply_update.
-
sourcefn update_tx_graph<K: Ord + Clone>(
    &self,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    parallel_requests: usize
) -> Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>
Scan Esplora for the data specified and return a [TxGraph] and a map of last active
+
The result of this method can be applied to LocalChain::apply_update.
+
sourcefn update_tx_graph<K: Ord + Clone>(
    &self,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    parallel_requests: usize
) -> Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>
Scan Esplora for the data specified and return a TxGraph and a map of last active
 indices.
 
 keychain_spks: keychains that we want to scan transactions for
-txids: transactions for which we want updated [ConfirmationTimeAnchor]s
+txids: transactions for which we want updated ConfirmationTimeAnchors
 outpoints: transactions associated with these outpoints (residing, spending) that we
 want to include in the update
 
 The scan for each keychain stops after a gap of stop_gap script pubkeys with no associated
 transactions. parallel_requests specifies the max number of HTTP requests to make in
 parallel.
-
Provided MethodsÂ§
sourcefn update_tx_graph_without_keychain(
    &self,
    misc_spks: impl IntoIterator<Item = ScriptBuf>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    parallel_requests: usize
) -> Result<TxGraph<ConfirmationTimeAnchor>, Error>
Convenience method to call update_tx_graph without requiring a keychain.
-
Implementations on Foreign TypesÂ§
sourceÂ§impl EsploraExt for BlockingClient
sourceÂ§fn update_local_chain(
    &self,
    local_tip: Option<CheckPoint>,
    request_heights: impl IntoIterator<Item = u32>
) -> Result<Update, Error>
sourceÂ§fn update_tx_graph<K: Ord + Clone>(
    &self,
    keychain_spks: BTreeMap<K, impl IntoIterator<Item = (u32, ScriptBuf)>>,
    txids: impl IntoIterator<Item = Txid>,
    outpoints: impl IntoIterator<Item = OutPoint>,
    stop_gap: usize,
    parallel_requests: usize
) -> Result<(TxGraph<ConfirmationTimeAnchor>, BTreeMap<K, u32>), Error>
ImplementorsÂ§

\ No newline at end of file
+

Trait ImplementationsÂ§

impl<Pk> Clone for Descriptor<Pk>where Pk: Clone + MiniscriptKey,

fn clone(&self) -> Descriptor<Pk>

fn clone_from(&mut self, source: &Self)

impl<Pk> Debug for Descriptor<Pk>where Pk: MiniscriptKey,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl DescriptorExt for Descriptor<DescriptorPublicKey>

fn dust_value(&self) -> u64

fn deserialize<D>( deserializer: D) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,

impl<Pk> Display for Descriptor<Pk>where Pk: MiniscriptKey,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl ExtractPolicy for Descriptor<DescriptorPublicKey>

fn extract_policy( &self, signers: &SignersContainer, build_sat: BuildSatisfaction<'_>, secp: &Secp256k1<All>) -> Result<Option<Policy>, Error>

impl<Pk> ForEachKey<Pk> for Descriptor<Pk>where Pk: MiniscriptKey,

fn for_each_key<'a, F>(&'a self, pred: F) -> boolwhere F: FnMut(&'a Pk) -> bool,

Trait ImplementationsÂ§

impl<Pk> Clone for Descriptor<Pk>where Pk: Clone + MiniscriptKey,

fn clone(&self) -> Descriptor<Pk>

fn clone_from(&mut self, source: &Self)

impl<Pk> Debug for Descriptor<Pk>where Pk: MiniscriptKey,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl DescriptorExt for Descriptor<DescriptorPublicKey>

fn dust_value(&self) -> u64

fn deserialize<D>( deserializer: D) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,

impl<Pk> Display for Descriptor<Pk>where Pk: MiniscriptKey,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

impl ExtractPolicy for Descriptor<DescriptorPublicKey>

fn extract_policy( &self, signers: &SignersContainer, build_sat: BuildSatisfaction<'_>, secp: &Secp256k1<All>) -> Result<Option<Policy>, Error>

impl<Pk> ForEachKey<Pk> for Descriptor<Pk>where Pk: MiniscriptKey,

fn for_each_key<'a, F>(&'a self, pred: F) -> boolwhere F: FnMut(&'a Pk) -> bool,

fn for_any_key<'a, F>(&'a self, pred: F) -> boolwhere F: FnMut(&'a Pk) -> bool, Pk: 'a,

impl<Pk> From<Bare<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Bare<Pk>) -> Descriptor<Pk>

impl<Pk> From<Pkh<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Pkh<Pk>) -> Descriptor<Pk>

impl<Pk> From<Sh<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Sh<Pk>) -> Descriptor<Pk>

impl<Pk> From<Tr<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Tr<Pk>) -> Descriptor<Pk>

impl<Pk> From<Wpkh<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Wpkh<Pk>) -> Descriptor<Pk>

impl<Pk> From<Wsh<Pk>> for Descriptor<Pk>where Pk: MiniscriptKey,

fn from(inner: Wsh<Pk>) -> Descriptor<Pk>

type Err = Error

fn from_str(s: &str) -> Result<Descriptor<Pk>, Error>

fn from_tree(top: &Tree<'_>) -> Result<Descriptor<Pk>, Error>

impl<Pk> Hash for Descriptor<Pk>where Pk: Hash + MiniscriptKey,

fn hash<__H>(&self, state: &mut __H)where __H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

impl<Pk> Liftable<Pk> for Descriptor<Pk>where Pk: MiniscriptKey,

fn lift(&self) -> Result<Policy<Pk>, Error>

impl<Pk> Ord for Descriptor<Pk>where Pk: Ord + MiniscriptKey,

fn cmp(&self, other: &Descriptor<Pk>) -> Ordering

fn max(self, other: Self) -> Selfwhere Self: Sized,

fn min(self, other: Self) -> Selfwhere Self: Sized,

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd<Self>,

impl<Pk> PartialEq<Descriptor<Pk>> for Descriptor<Pk>where Pk: PartialEq<Pk> + MiniscriptKey,

fn eq(&self, other: &Descriptor<Pk>) -> bool

FieldsÂ§

Trait ImplementationsÂ§

impl Clone for LocalUtxo

fn clone(&self) -> LocalUtxo

fn clone_from(&mut self, source: &Self)

impl Debug for LocalUtxo

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'de> Deserialize<'de> for LocalUtxo

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

impl Hash for LocalUtxo

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

impl PartialEq<LocalUtxo> for LocalUtxo

fn eq(&self, other: &LocalUtxo) -> bool

fn ne(&self, other: &Rhs) -> bool

impl Serialize for LocalUtxo

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where __S: Serializer,

impl Eq for LocalUtxo

impl StructuralEq for LocalUtxo

impl StructuralPartialEq for LocalUtxo

Auto Trait ImplementationsÂ§

impl RefUnwindSafe for LocalUtxo

impl<Pk> Clone for Descriptor<Pk>where
Pk: Clone + MiniscriptKey,

impl<Pk> Debug for Descriptor<Pk>where
Pk: MiniscriptKey,

fn deserialize<D>(
deserializer: D
) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,

impl<Pk> Display for Descriptor<Pk>where
Pk: MiniscriptKey,

fn extract_policy(
&self,
signers: &SignersContainer,
build_sat: BuildSatisfaction<'_>,
secp: &Secp256k1<All>
) -> Result<Option<Policy>, Error>

impl<Pk> ForEachKey<Pk> for Descriptor<Pk>where
Pk: MiniscriptKey,

fn for_each_key<'a, F>(&'a self, pred: F) -> boolwhere
F: FnMut(&'a Pk) -> bool,

impl<Pk> Clone for Descriptor<Pk>where
Pk: Clone + MiniscriptKey,

impl<Pk> Debug for Descriptor<Pk>where
Pk: MiniscriptKey,

fn deserialize<D>(
deserializer: D
) -> Result<Descriptor<Pk>, <D as Deserializer<'de>>::Error>where
D: Deserializer<'de>,

impl<Pk> Display for Descriptor<Pk>where
Pk: MiniscriptKey,

fn extract_policy(
&self,
signers: &SignersContainer,
build_sat: BuildSatisfaction<'_>,
secp: &Secp256k1<All>
) -> Result<Option<Policy>, Error>

impl<Pk> ForEachKey<Pk> for Descriptor<Pk>where
Pk: MiniscriptKey,

fn for_each_key<'a, F>(&'a self, pred: F) -> boolwhere
F: FnMut(&'a Pk) -> bool,

fn for_any_key<'a, F>(&'a self, pred: F) -> boolwhere
F: FnMut(&'a Pk) -> bool,
Pk: 'a,

impl<Pk> From<Bare<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> From<Pkh<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> From<Sh<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> From<Tr<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> From<Wpkh<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> From<Wsh<Pk>> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> Hash for Descriptor<Pk>where
Pk: Hash + MiniscriptKey,

fn hash<H>(&self, state: &mut H)where
__H: Hasher,

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,

impl<Pk> Liftable<Pk> for Descriptor<Pk>where
Pk: MiniscriptKey,

impl<Pk> Ord for Descriptor<Pk>where
Pk: Ord + MiniscriptKey,

fn max(self, other: Self) -> Selfwhere
Self: Sized,

fn min(self, other: Self) -> Selfwhere
Self: Sized,

fn clamp(self, min: Self, max: Self) -> Selfwhere
Self: Sized + PartialOrd<Self>,

impl<Pk> PartialEq<Descriptor<Pk>> for Descriptor<Pk>where
Pk: PartialEq<Pk> + MiniscriptKey,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>where
__D: Deserializer<'de>,

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>where
S: Serializer,

impl<T> Any for Twhere
T: 'static + ?Sized,

impl<T> Borrow<T> for Twhere
T: ?Sized,

impl<T> BorrowMut<T> for Twhere
T: ?Sized,

`Struct bdk::wallet::Balance`

fn deserialize<D>(
deserializer: D
) -> Result<Balance, <D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,