From d95a18ce939d663881a6505927d7a25f4d2dad3d Mon Sep 17 00:00:00 2001 From: github-actions Date: Fri, 6 Dec 2024 04:12:10 +0000 Subject: [PATCH] Publish autogenerated nightly docs --- .../bdk_bitcoind_rpc/struct.BlockEvent.html | 12 ++-- .../bdk_bitcoind_rpc/struct.Emitter.html | 2 +- .../bdk_chain/bitcoin/base58/struct.Vec.html | 2 +- .../hashes/serde/de/trait.Deserialize.html | 2 +- .../hashes/serde/ser/trait.Serialize.html | 2 +- .../hashes/serde/trait.Deserialize.html | 2 +- .../bitcoin/hashes/serde/trait.Serialize.html | 2 +- .../bdk/nightly/latest/bdk_chain/index.html | 2 +- .../indexed_tx_graph/struct.ChangeSet.html | 2 +- .../keychain_txout/struct.ChangeSet.html | 2 +- .../local_chain/struct.ChangeSet.html | 2 +- .../local_chain/struct.CheckPoint.html | 32 ++++----- .../local_chain/struct.CheckPointIter.html | 4 +- .../bdk_chain/spk_client/enum.SyncItem.html | 30 ++++---- .../latest/bdk_chain/spk_client/index.html | 2 +- .../spk_client/struct.FullScanRequest.html | 16 ++--- .../struct.FullScanRequestBuilder.html | 14 ++-- .../spk_client/struct.FullScanResponse.html | 6 +- .../spk_client/struct.SyncProgress.html | 16 ++--- .../spk_client/struct.SyncRequest.html | 22 +++--- .../spk_client/struct.SyncRequestBuilder.html | 18 ++--- .../spk_client/struct.SyncResponse.html | 6 +- .../latest/bdk_chain/struct.BlockId.html | 16 ++--- .../latest/bdk_chain/struct.CheckPoint.html | 32 ++++----- .../bdk_chain/struct.CheckPointIter.html | 4 +- .../struct.ConfirmationBlockTime.html | 16 ++--- .../latest/bdk_chain/struct.TxUpdate.html | 14 ++-- .../nightly/latest/bdk_chain/trait.Merge.html | 36 +++++----- .../bdk_chain/tx_graph/struct.ChangeSet.html | 2 +- .../bdk_chain/tx_graph/struct.TxUpdate.html | 14 ++-- .../latest/bdk_chain/type.Indexed.html | 2 +- .../bdk_chain/type.KeychainIndexed.html | 2 +- .../bdk/nightly/latest/bdk_esplora/index.html | 16 +++-- .../bdk_esplora/trait.EsploraAsyncExt.html | 40 +++++------ .../latest/bdk_esplora/trait.EsploraExt.html | 26 +++---- .../latest/bdk_file_store/struct.Store.html | 2 +- .../bdk/nightly/latest/bdk_testenv/index.html | 2 +- .../latest/bdk_testenv/struct.TestEnv.html | 24 +++---- .../latest/bdk_wallet/struct.ChangeSet.html | 8 +-- .../latest/bdk_wallet/struct.LocalOutput.html | 4 +- .../bdk_wallet/struct.PersistedWallet.html | 20 +++--- .../latest/bdk_wallet/struct.Update.html | 10 +-- .../latest/bdk_wallet/struct.Wallet.html | 22 +++--- .../latest/bdk_wallet/type.WalletTx.html | 10 +-- .../constant.CHANNEL_BOUND.html | 2 +- .../enum.Emission.html | 4 +- .../example_bitcoind_rpc_polling/fn.main.html | 2 +- .../example_bitcoind_rpc_polling/index.html | 2 +- .../struct.RpcArgs.html | 2 +- .../example_cli/enum.CoinSelectionAlgo.html | 2 +- .../latest/example_cli/enum.Keychain.html | 4 +- .../latest/example_cli/fn.create_tx.html | 6 +- .../example_cli/fn.handle_commands.html | 6 +- .../latest/example_cli/fn.init_or_load.html | 2 +- .../latest/example_cli/fn.planned_utxos.html | 4 +- .../bdk/nightly/latest/example_cli/index.html | 2 +- .../latest/example_cli/struct.ChangeInfo.html | 4 +- .../latest/example_cli/struct.ChangeSet.html | 14 ++-- .../latest/example_cli/struct.Init.html | 4 +- .../example_cli/type.KeychainTxGraph.html | 6 +- .../latest/example_cli/type.PlanUtxo.html | 2 +- .../latest/example_electrum/fn.main.html | 2 +- .../example_electrum/struct.ElectrumArgs.html | 2 +- .../latest/example_esplora/fn.main.html | 2 +- .../example_esplora/struct.EsploraArgs.html | 2 +- .../example_wallet_electrum/fn.main.html | 2 +- .../example_wallet_esplora_async/fn.main.html | 2 +- .../fn.main.html | 2 +- .../example_wallet_rpc/enum.Emission.html | 4 +- .../latest/example_wallet_rpc/fn.main.html | 2 +- .../example_wallet_rpc/struct.Args.html | 2 +- .../docs-rs/bdk/nightly/latest/help.html | 2 +- .../docs-rs/bdk/nightly/latest/settings.html | 2 +- .../latest/src/bdk_esplora/async_ext.rs.html | 68 +++++++++++++------ .../trait.impl/bdk_core/merge/trait.Merge.js | 4 +- .../trait.impl/core/convert/trait.AsRef.js | 2 +- .../trait.impl/core/convert/trait.From.js | 2 +- .../type.impl/alloc/boxed/struct.Box.js | 2 +- .../collections/btree/map/struct.BTreeMap.js | 4 +- .../indexed_tx_graph/struct.IndexedTxGraph.js | 2 +- .../latest/type.impl/std/primitive.tuple.js | 2 +- 81 files changed, 368 insertions(+), 332 deletions(-) diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html index 6b159af6a1..37590be9c7 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html @@ -1,18 +1,18 @@ BlockEvent in bdk_bitcoind_rpc - Rust

Struct bdk_bitcoind_rpc::BlockEvent

source · 
pub struct BlockEvent<B> {
     pub block: B,
-    pub checkpoint: CheckPoint,
+    pub checkpoint: CheckPoint,
 }
Expand description

A newly emitted block from Emitter.

Fields§

§block: B

Either a full [Block] or [Header] of the new block.

-
§checkpoint: CheckPoint

The checkpoint of the new block.

-

A CheckPoint is a node of a linked list of BlockIds. This checkpoint is linked to -all BlockIds originally passed in Emitter::new as well as emitted blocks since then. +

§checkpoint: CheckPoint

The checkpoint of the new block.

+

A [CheckPoint] is a node of a linked list of [BlockId]s. This checkpoint is linked to +all [BlockId]s originally passed in Emitter::new as well as emitted blocks since then. These blocks are guaranteed to be of the same chain.

This is important as BDK structures require block-to-apply to be connected with another block in the original chain.

Implementations§

source§

impl<B> BlockEvent<B>

source

pub fn block_height(&self) -> u32

The block height of this new block.

source

pub fn block_hash(&self) -> BlockHash

The block hash of this new block.

-
source

pub fn connected_to(&self) -> BlockId

The BlockId of a previous block that this block connects to.

-

This either returns a BlockId of a previously emitted block or from the chain we started +

source

pub fn connected_to(&self) -> BlockId

The [BlockId] of a previous block that this block connects to.

+

This either returns a [BlockId] of a previously emitted block or from the chain we started with (passed in as last_cp in Emitter::new).

This value is derived from BlockEvent::checkpoint.

Trait Implementations§

source§

impl<B: Debug> Debug for BlockEvent<B>

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<B> Freeze for BlockEvent<B>
where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html index f43b12e86f..c96ee82c3c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html @@ -1,6 +1,6 @@ Emitter in bdk_bitcoind_rpc - Rust

Struct bdk_bitcoind_rpc::Emitter

source · 
pub struct Emitter<'c, C> { /* private fields */ }
Expand description

The Emitter is used to emit data sourced from [bitcoincore_rpc::Client].

Refer to module-level documentation for more.

-

Implementations§

source§

impl<'c, C: RpcApi> Emitter<'c, C>

source

pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self

Construct a new Emitter.

+

Implementations§

source§

impl<'c, C: RpcApi> Emitter<'c, C>

source

pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self

Construct a new Emitter.

last_cp informs the emitter of the chain we are starting off with. This way, the emitter can start emission from a block that connects to the original chain.

start_height starts emission from a given height (if there are no conflicts with the diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html index 6132a004c1..65af435613 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/base58/struct.Vec.html @@ -3991,7 +3991,7 @@ this.

assert_eq!(first_element, Some("a".to_string())); assert_eq!(v_iter.next(), Some("b".to_string())); assert_eq!(v_iter.next(), None);
-
§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
source§

impl<T> Merge for Vec<T>

source§

fn merge(&mut self, other: Vec<T>)

Merge another object of the same type onto self.
source§

fn is_empty(&self) -> bool

Returns whether the structure is considered empty.
source§

fn take(&mut self) -> Option<Self>

Take the value, replacing it with the default value.
1.0.0 · source§

impl<T, A> Ord for Vec<T, A>
where +

§

type Item = T

The type of the elements being iterated over.
§

type IntoIter = IntoIter<T, A>

Which kind of iterator are we turning this into?
§

impl<T> Merge for Vec<T>

§

fn merge(&mut self, other: Vec<T>)

Merge another object of the same type onto self.
§

fn is_empty(&self) -> bool

Returns whether the structure is considered empty.
§

fn take(&mut self) -> Option<Self>

Take the value, replacing it with the default value.
1.0.0 · source§

impl<T, A> Ord for Vec<T, A>
where T: Ord, A: Allocator,

Implements ordering of vectors, lexicographically.

source§

fn cmp(&self, other: &Vec<T, A>) -> Ordering

This method returns an Ordering between self and other. Read more
1.21.0 · source§

fn max(self, other: Self) -> Self
where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/de/trait.Deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/de/trait.Deserialize.html index 1621fa9414..0e832fcf4c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/de/trait.Deserialize.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/de/trait.Deserialize.html @@ -730,7 +730,7 @@ will end up with a strong count of 1.

D: Deserializer<'de>,

Implementors§

§

impl<'de> Deserialize<'de> for &'de Script

Can only deserialize borrowed bytes.

§

impl<'de> Deserialize<'de> for ChildNumber

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::LockTime

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::LockTime

§

impl<'de> Deserialize<'de> for EcdsaSighashType

§

impl<'de> Deserialize<'de> for Network

§

impl<'de> Deserialize<'de> for TapSighashType

§

impl<'de> Deserialize<'de> for Parity

The parity is deserialized as u8 - 0 for even, 1 for odd.

§

impl<'de> Deserialize<'de> for LeafVersion

Deserializes LeafVersion as a u8 using consensus encoding.

-
§

impl<'de> Deserialize<'de> for TapLeaf

source§

impl<'de> Deserialize<'de> for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl<'de> Deserialize<'de> for bdk_chain::local_chain::ChangeSet

source§

impl<'de> Deserialize<'de> for Balance

source§

impl<'de> Deserialize<'de> for BlockId

source§

impl<'de> Deserialize<'de> for ConfirmationBlockTime

source§

impl<'de> Deserialize<'de> for DescriptorId

source§

impl<'de> Deserialize<'de> for String

§

impl<'de> Deserialize<'de> for ChainCode

§

impl<'de> Deserialize<'de> for DerivationPath

§

impl<'de> Deserialize<'de> for Fingerprint

§

impl<'de> Deserialize<'de> for Xpriv

§

impl<'de> Deserialize<'de> for Xpub

§

impl<'de> Deserialize<'de> for ShortId

§

impl<'de> Deserialize<'de> for Header

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::block::Version

§

impl<'de> Deserialize<'de> for ChainHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::ecdsa::Signature

§

impl<'de> Deserialize<'de> for Keypair

§

impl<'de> Deserialize<'de> for TweakedKeypair

§

impl<'de> Deserialize<'de> for TweakedPublicKey

§

impl<'de> Deserialize<'de> for Key

§

impl<'de> Deserialize<'de> for Pair

§

impl<'de> Deserialize<'de> for Input

§

impl<'de> Deserialize<'de> for Output

§

impl<'de> Deserialize<'de> for PsbtSighashType

§

impl<'de> Deserialize<'de> for SharedSecret

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl<'de> Deserialize<'de> for SecretKey

§

impl<'de> Deserialize<'de> for Address<NetworkUnchecked>

§

impl<'de> Deserialize<'de> for Amount

§

impl<'de> Deserialize<'de> for Block

§

impl<'de> Deserialize<'de> for BlockHash

§

impl<'de> Deserialize<'de> for CompactTarget

§

impl<'de> Deserialize<'de> for CompressedPublicKey

§

impl<'de> Deserialize<'de> for FeeRate

§

impl<'de> Deserialize<'de> for FilterHash

§

impl<'de> Deserialize<'de> for FilterHeader

§

impl<'de> Deserialize<'de> for LegacySighash

§

impl<'de> Deserialize<'de> for OutPoint

§

impl<'de> Deserialize<'de> for PrivateKey

§

impl<'de> Deserialize<'de> for Psbt

§

impl<'de> Deserialize<'de> for PubkeyHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::PublicKey

§

impl<'de> Deserialize<'de> for ScriptBuf

§

impl<'de> Deserialize<'de> for ScriptHash

§

impl<'de> Deserialize<'de> for SegwitV0Sighash

§

impl<'de> Deserialize<'de> for Sequence

§

impl<'de> Deserialize<'de> for TapLeafHash

§

impl<'de> Deserialize<'de> for TapNodeHash

§

impl<'de> Deserialize<'de> for TapSighash

§

impl<'de> Deserialize<'de> for TapTweakHash

§

impl<'de> Deserialize<'de> for Target

§

impl<'de> Deserialize<'de> for Transaction

§

impl<'de> Deserialize<'de> for TxIn

§

impl<'de> Deserialize<'de> for TxMerkleNode

§

impl<'de> Deserialize<'de> for TxOut

§

impl<'de> Deserialize<'de> for Txid

§

impl<'de> Deserialize<'de> for WPubkeyHash

§

impl<'de> Deserialize<'de> for WScriptHash

§

impl<'de> Deserialize<'de> for Weight

§

impl<'de> Deserialize<'de> for Witness

§

impl<'de> Deserialize<'de> for WitnessCommitment

§

impl<'de> Deserialize<'de> for WitnessMerkleNode

§

impl<'de> Deserialize<'de> for Work

§

impl<'de> Deserialize<'de> for Wtxid

§

impl<'de> Deserialize<'de> for XKeyIdentifier

§

impl<'de> Deserialize<'de> for XOnlyPublicKey

§

impl<'de> Deserialize<'de> for ControlBlock

§

impl<'de> Deserialize<'de> for NodeInfo

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::taproot::Signature

§

impl<'de> Deserialize<'de> for TapTree

§

impl<'de> Deserialize<'de> for TaprootMerkleBranch

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl<'de> Deserialize<'de> for Midstate

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<'de> Deserialize<'de> for IgnoredAny

source§

impl<'de, A> Deserialize<'de> for ChainPosition<A>
where +
§

impl<'de> Deserialize<'de> for TapLeaf

source§

impl<'de> Deserialize<'de> for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl<'de> Deserialize<'de> for bdk_chain::local_chain::ChangeSet

source§

impl<'de> Deserialize<'de> for Balance

§

impl<'de> Deserialize<'de> for BlockId

§

impl<'de> Deserialize<'de> for ConfirmationBlockTime

source§

impl<'de> Deserialize<'de> for DescriptorId

source§

impl<'de> Deserialize<'de> for String

§

impl<'de> Deserialize<'de> for ChainCode

§

impl<'de> Deserialize<'de> for DerivationPath

§

impl<'de> Deserialize<'de> for Fingerprint

§

impl<'de> Deserialize<'de> for Xpriv

§

impl<'de> Deserialize<'de> for Xpub

§

impl<'de> Deserialize<'de> for ShortId

§

impl<'de> Deserialize<'de> for Header

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::block::Version

§

impl<'de> Deserialize<'de> for ChainHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::ecdsa::Signature

§

impl<'de> Deserialize<'de> for Keypair

§

impl<'de> Deserialize<'de> for TweakedKeypair

§

impl<'de> Deserialize<'de> for TweakedPublicKey

§

impl<'de> Deserialize<'de> for Key

§

impl<'de> Deserialize<'de> for Pair

§

impl<'de> Deserialize<'de> for Input

§

impl<'de> Deserialize<'de> for Output

§

impl<'de> Deserialize<'de> for PsbtSighashType

§

impl<'de> Deserialize<'de> for SharedSecret

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl<'de> Deserialize<'de> for SecretKey

§

impl<'de> Deserialize<'de> for Address<NetworkUnchecked>

§

impl<'de> Deserialize<'de> for Amount

§

impl<'de> Deserialize<'de> for Block

§

impl<'de> Deserialize<'de> for BlockHash

§

impl<'de> Deserialize<'de> for CompactTarget

§

impl<'de> Deserialize<'de> for CompressedPublicKey

§

impl<'de> Deserialize<'de> for FeeRate

§

impl<'de> Deserialize<'de> for FilterHash

§

impl<'de> Deserialize<'de> for FilterHeader

§

impl<'de> Deserialize<'de> for LegacySighash

§

impl<'de> Deserialize<'de> for OutPoint

§

impl<'de> Deserialize<'de> for PrivateKey

§

impl<'de> Deserialize<'de> for Psbt

§

impl<'de> Deserialize<'de> for PubkeyHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::PublicKey

§

impl<'de> Deserialize<'de> for ScriptBuf

§

impl<'de> Deserialize<'de> for ScriptHash

§

impl<'de> Deserialize<'de> for SegwitV0Sighash

§

impl<'de> Deserialize<'de> for Sequence

§

impl<'de> Deserialize<'de> for TapLeafHash

§

impl<'de> Deserialize<'de> for TapNodeHash

§

impl<'de> Deserialize<'de> for TapSighash

§

impl<'de> Deserialize<'de> for TapTweakHash

§

impl<'de> Deserialize<'de> for Target

§

impl<'de> Deserialize<'de> for Transaction

§

impl<'de> Deserialize<'de> for TxIn

§

impl<'de> Deserialize<'de> for TxMerkleNode

§

impl<'de> Deserialize<'de> for TxOut

§

impl<'de> Deserialize<'de> for Txid

§

impl<'de> Deserialize<'de> for WPubkeyHash

§

impl<'de> Deserialize<'de> for WScriptHash

§

impl<'de> Deserialize<'de> for Weight

§

impl<'de> Deserialize<'de> for Witness

§

impl<'de> Deserialize<'de> for WitnessCommitment

§

impl<'de> Deserialize<'de> for WitnessMerkleNode

§

impl<'de> Deserialize<'de> for Work

§

impl<'de> Deserialize<'de> for Wtxid

§

impl<'de> Deserialize<'de> for XKeyIdentifier

§

impl<'de> Deserialize<'de> for XOnlyPublicKey

§

impl<'de> Deserialize<'de> for ControlBlock

§

impl<'de> Deserialize<'de> for NodeInfo

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::taproot::Signature

§

impl<'de> Deserialize<'de> for TapTree

§

impl<'de> Deserialize<'de> for TaprootMerkleBranch

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl<'de> Deserialize<'de> for Midstate

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<'de> Deserialize<'de> for IgnoredAny

source§

impl<'de, A> Deserialize<'de> for ChainPosition<A>
where A: Ord + Deserialize<'de>,

source§

impl<'de, A> Deserialize<'de> for bdk_chain::tx_graph::ChangeSet<A>
where A: Ord + Deserialize<'de>,

source§

impl<'de, A, IA> Deserialize<'de> for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
where A: Ord + Deserialize<'de>, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/ser/trait.Serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/ser/trait.Serialize.html index 9f1b72272b..6f78285c09 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/ser/trait.Serialize.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/ser/trait.Serialize.html @@ -854,7 +854,7 @@ repeated data.

) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Implementors§

§

impl Serialize for ChildNumber

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::LockTime

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::LockTime

§

impl Serialize for EcdsaSighashType

§

impl Serialize for Network

§

impl Serialize for TapSighashType

§

impl Serialize for Parity

The parity is serialized as u8 - 0 for even, 1 for odd.

§

impl Serialize for LeafVersion

Serializes LeafVersion as a u8 using consensus encoding.

-
§

impl Serialize for TapLeaf

source§

impl Serialize for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl Serialize for bdk_chain::local_chain::ChangeSet

source§

impl Serialize for Balance

source§

impl Serialize for BlockId

source§

impl Serialize for ConfirmationBlockTime

source§

impl Serialize for DescriptorId

source§

impl Serialize for String

§

impl Serialize for ChainCode

§

impl Serialize for DerivationPath

§

impl Serialize for Fingerprint

§

impl Serialize for Xpriv

§

impl Serialize for Xpub

§

impl Serialize for ShortId

§

impl Serialize for Header

§

impl Serialize for bdk_chain::bitcoin::blockdata::block::Version

§

impl Serialize for ChainHash

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl Serialize for bdk_chain::bitcoin::ecdsa::Signature

§

impl Serialize for Keypair

§

impl Serialize for TweakedKeypair

§

impl Serialize for TweakedPublicKey

§

impl Serialize for Key

§

impl Serialize for Pair

§

impl Serialize for Input

§

impl Serialize for Output

§

impl Serialize for PsbtSighashType

§

impl Serialize for SharedSecret

§

impl Serialize for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl Serialize for SecretKey

§

impl Serialize for Amount

§

impl Serialize for Block

§

impl Serialize for BlockHash

§

impl Serialize for CompactTarget

§

impl Serialize for CompressedPublicKey

§

impl Serialize for FeeRate

§

impl Serialize for FilterHash

§

impl Serialize for FilterHeader

§

impl Serialize for LegacySighash

§

impl Serialize for Opcode

§

impl Serialize for OutPoint

§

impl Serialize for PrivateKey

§

impl Serialize for Psbt

§

impl Serialize for PubkeyHash

§

impl Serialize for bdk_chain::bitcoin::PublicKey

§

impl Serialize for Script

§

impl Serialize for ScriptBuf

§

impl Serialize for ScriptHash

§

impl Serialize for SegwitV0Sighash

§

impl Serialize for Sequence

§

impl Serialize for TapLeafHash

§

impl Serialize for TapNodeHash

§

impl Serialize for TapSighash

§

impl Serialize for TapTweakHash

§

impl Serialize for Target

§

impl Serialize for Transaction

§

impl Serialize for TxIn

§

impl Serialize for TxMerkleNode

§

impl Serialize for TxOut

§

impl Serialize for Txid

§

impl Serialize for WPubkeyHash

§

impl Serialize for WScriptHash

§

impl Serialize for Weight

§

impl Serialize for Witness

§

impl Serialize for WitnessCommitment

§

impl Serialize for WitnessMerkleNode

§

impl Serialize for Work

§

impl Serialize for Wtxid

§

impl Serialize for XKeyIdentifier

§

impl Serialize for XOnlyPublicKey

§

impl Serialize for ControlBlock

§

impl Serialize for NodeInfo

§

impl Serialize for bdk_chain::bitcoin::taproot::Signature

§

impl Serialize for TapTree

§

impl Serialize for TaprootMerkleBranch

§

impl Serialize for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl Serialize for Midstate

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<A> Serialize for ChainPosition<A>
where +
§

impl Serialize for TapLeaf

source§

impl Serialize for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl Serialize for bdk_chain::local_chain::ChangeSet

source§

impl Serialize for Balance

§

impl Serialize for BlockId

§

impl Serialize for ConfirmationBlockTime

source§

impl Serialize for DescriptorId

source§

impl Serialize for String

§

impl Serialize for ChainCode

§

impl Serialize for DerivationPath

§

impl Serialize for Fingerprint

§

impl Serialize for Xpriv

§

impl Serialize for Xpub

§

impl Serialize for ShortId

§

impl Serialize for Header

§

impl Serialize for bdk_chain::bitcoin::blockdata::block::Version

§

impl Serialize for ChainHash

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl Serialize for bdk_chain::bitcoin::ecdsa::Signature

§

impl Serialize for Keypair

§

impl Serialize for TweakedKeypair

§

impl Serialize for TweakedPublicKey

§

impl Serialize for Key

§

impl Serialize for Pair

§

impl Serialize for Input

§

impl Serialize for Output

§

impl Serialize for PsbtSighashType

§

impl Serialize for SharedSecret

§

impl Serialize for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl Serialize for SecretKey

§

impl Serialize for Amount

§

impl Serialize for Block

§

impl Serialize for BlockHash

§

impl Serialize for CompactTarget

§

impl Serialize for CompressedPublicKey

§

impl Serialize for FeeRate

§

impl Serialize for FilterHash

§

impl Serialize for FilterHeader

§

impl Serialize for LegacySighash

§

impl Serialize for Opcode

§

impl Serialize for OutPoint

§

impl Serialize for PrivateKey

§

impl Serialize for Psbt

§

impl Serialize for PubkeyHash

§

impl Serialize for bdk_chain::bitcoin::PublicKey

§

impl Serialize for Script

§

impl Serialize for ScriptBuf

§

impl Serialize for ScriptHash

§

impl Serialize for SegwitV0Sighash

§

impl Serialize for Sequence

§

impl Serialize for TapLeafHash

§

impl Serialize for TapNodeHash

§

impl Serialize for TapSighash

§

impl Serialize for TapTweakHash

§

impl Serialize for Target

§

impl Serialize for Transaction

§

impl Serialize for TxIn

§

impl Serialize for TxMerkleNode

§

impl Serialize for TxOut

§

impl Serialize for Txid

§

impl Serialize for WPubkeyHash

§

impl Serialize for WScriptHash

§

impl Serialize for Weight

§

impl Serialize for Witness

§

impl Serialize for WitnessCommitment

§

impl Serialize for WitnessMerkleNode

§

impl Serialize for Work

§

impl Serialize for Wtxid

§

impl Serialize for XKeyIdentifier

§

impl Serialize for XOnlyPublicKey

§

impl Serialize for ControlBlock

§

impl Serialize for NodeInfo

§

impl Serialize for bdk_chain::bitcoin::taproot::Signature

§

impl Serialize for TapTree

§

impl Serialize for TaprootMerkleBranch

§

impl Serialize for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl Serialize for Midstate

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<A> Serialize for ChainPosition<A>
where A: Ord + Serialize,

source§

impl<A> Serialize for bdk_chain::tx_graph::ChangeSet<A>
where A: Ord + Serialize,

source§

impl<A, IA> Serialize for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
where A: Ord + Serialize, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Deserialize.html index 56dd14ea28..05450b3809 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Deserialize.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Deserialize.html @@ -730,7 +730,7 @@ will end up with a strong count of 1.

D: Deserializer<'de>,

Implementors§

§

impl<'de> Deserialize<'de> for &'de Script

Can only deserialize borrowed bytes.

§

impl<'de> Deserialize<'de> for ChildNumber

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::LockTime

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::LockTime

§

impl<'de> Deserialize<'de> for EcdsaSighashType

§

impl<'de> Deserialize<'de> for Network

§

impl<'de> Deserialize<'de> for TapSighashType

§

impl<'de> Deserialize<'de> for Parity

The parity is deserialized as u8 - 0 for even, 1 for odd.

§

impl<'de> Deserialize<'de> for LeafVersion

Deserializes LeafVersion as a u8 using consensus encoding.

-
§

impl<'de> Deserialize<'de> for TapLeaf

source§

impl<'de> Deserialize<'de> for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl<'de> Deserialize<'de> for bdk_chain::local_chain::ChangeSet

source§

impl<'de> Deserialize<'de> for Balance

source§

impl<'de> Deserialize<'de> for BlockId

source§

impl<'de> Deserialize<'de> for ConfirmationBlockTime

source§

impl<'de> Deserialize<'de> for DescriptorId

source§

impl<'de> Deserialize<'de> for String

§

impl<'de> Deserialize<'de> for ChainCode

§

impl<'de> Deserialize<'de> for DerivationPath

§

impl<'de> Deserialize<'de> for Fingerprint

§

impl<'de> Deserialize<'de> for Xpriv

§

impl<'de> Deserialize<'de> for Xpub

§

impl<'de> Deserialize<'de> for ShortId

§

impl<'de> Deserialize<'de> for Header

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::block::Version

§

impl<'de> Deserialize<'de> for ChainHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::ecdsa::Signature

§

impl<'de> Deserialize<'de> for Keypair

§

impl<'de> Deserialize<'de> for TweakedKeypair

§

impl<'de> Deserialize<'de> for TweakedPublicKey

§

impl<'de> Deserialize<'de> for Key

§

impl<'de> Deserialize<'de> for Pair

§

impl<'de> Deserialize<'de> for Input

§

impl<'de> Deserialize<'de> for Output

§

impl<'de> Deserialize<'de> for PsbtSighashType

§

impl<'de> Deserialize<'de> for SharedSecret

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl<'de> Deserialize<'de> for SecretKey

§

impl<'de> Deserialize<'de> for Address<NetworkUnchecked>

§

impl<'de> Deserialize<'de> for Amount

§

impl<'de> Deserialize<'de> for Block

§

impl<'de> Deserialize<'de> for BlockHash

§

impl<'de> Deserialize<'de> for CompactTarget

§

impl<'de> Deserialize<'de> for CompressedPublicKey

§

impl<'de> Deserialize<'de> for FeeRate

§

impl<'de> Deserialize<'de> for FilterHash

§

impl<'de> Deserialize<'de> for FilterHeader

§

impl<'de> Deserialize<'de> for LegacySighash

§

impl<'de> Deserialize<'de> for OutPoint

§

impl<'de> Deserialize<'de> for PrivateKey

§

impl<'de> Deserialize<'de> for Psbt

§

impl<'de> Deserialize<'de> for PubkeyHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::PublicKey

§

impl<'de> Deserialize<'de> for ScriptBuf

§

impl<'de> Deserialize<'de> for ScriptHash

§

impl<'de> Deserialize<'de> for SegwitV0Sighash

§

impl<'de> Deserialize<'de> for Sequence

§

impl<'de> Deserialize<'de> for TapLeafHash

§

impl<'de> Deserialize<'de> for TapNodeHash

§

impl<'de> Deserialize<'de> for TapSighash

§

impl<'de> Deserialize<'de> for TapTweakHash

§

impl<'de> Deserialize<'de> for Target

§

impl<'de> Deserialize<'de> for Transaction

§

impl<'de> Deserialize<'de> for TxIn

§

impl<'de> Deserialize<'de> for TxMerkleNode

§

impl<'de> Deserialize<'de> for TxOut

§

impl<'de> Deserialize<'de> for Txid

§

impl<'de> Deserialize<'de> for WPubkeyHash

§

impl<'de> Deserialize<'de> for WScriptHash

§

impl<'de> Deserialize<'de> for Weight

§

impl<'de> Deserialize<'de> for Witness

§

impl<'de> Deserialize<'de> for WitnessCommitment

§

impl<'de> Deserialize<'de> for WitnessMerkleNode

§

impl<'de> Deserialize<'de> for Work

§

impl<'de> Deserialize<'de> for Wtxid

§

impl<'de> Deserialize<'de> for XKeyIdentifier

§

impl<'de> Deserialize<'de> for XOnlyPublicKey

§

impl<'de> Deserialize<'de> for ControlBlock

§

impl<'de> Deserialize<'de> for NodeInfo

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::taproot::Signature

§

impl<'de> Deserialize<'de> for TapTree

§

impl<'de> Deserialize<'de> for TaprootMerkleBranch

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl<'de> Deserialize<'de> for Midstate

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<'de> Deserialize<'de> for IgnoredAny

source§

impl<'de, A> Deserialize<'de> for ChainPosition<A>
where +
§

impl<'de> Deserialize<'de> for TapLeaf

source§

impl<'de> Deserialize<'de> for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl<'de> Deserialize<'de> for bdk_chain::local_chain::ChangeSet

source§

impl<'de> Deserialize<'de> for Balance

§

impl<'de> Deserialize<'de> for BlockId

§

impl<'de> Deserialize<'de> for ConfirmationBlockTime

source§

impl<'de> Deserialize<'de> for DescriptorId

source§

impl<'de> Deserialize<'de> for String

§

impl<'de> Deserialize<'de> for ChainCode

§

impl<'de> Deserialize<'de> for DerivationPath

§

impl<'de> Deserialize<'de> for Fingerprint

§

impl<'de> Deserialize<'de> for Xpriv

§

impl<'de> Deserialize<'de> for Xpub

§

impl<'de> Deserialize<'de> for ShortId

§

impl<'de> Deserialize<'de> for Header

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::block::Version

§

impl<'de> Deserialize<'de> for ChainHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::ecdsa::Signature

§

impl<'de> Deserialize<'de> for Keypair

§

impl<'de> Deserialize<'de> for TweakedKeypair

§

impl<'de> Deserialize<'de> for TweakedPublicKey

§

impl<'de> Deserialize<'de> for Key

§

impl<'de> Deserialize<'de> for Pair

§

impl<'de> Deserialize<'de> for Input

§

impl<'de> Deserialize<'de> for Output

§

impl<'de> Deserialize<'de> for PsbtSighashType

§

impl<'de> Deserialize<'de> for SharedSecret

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl<'de> Deserialize<'de> for SecretKey

§

impl<'de> Deserialize<'de> for Address<NetworkUnchecked>

§

impl<'de> Deserialize<'de> for Amount

§

impl<'de> Deserialize<'de> for Block

§

impl<'de> Deserialize<'de> for BlockHash

§

impl<'de> Deserialize<'de> for CompactTarget

§

impl<'de> Deserialize<'de> for CompressedPublicKey

§

impl<'de> Deserialize<'de> for FeeRate

§

impl<'de> Deserialize<'de> for FilterHash

§

impl<'de> Deserialize<'de> for FilterHeader

§

impl<'de> Deserialize<'de> for LegacySighash

§

impl<'de> Deserialize<'de> for OutPoint

§

impl<'de> Deserialize<'de> for PrivateKey

§

impl<'de> Deserialize<'de> for Psbt

§

impl<'de> Deserialize<'de> for PubkeyHash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::PublicKey

§

impl<'de> Deserialize<'de> for ScriptBuf

§

impl<'de> Deserialize<'de> for ScriptHash

§

impl<'de> Deserialize<'de> for SegwitV0Sighash

§

impl<'de> Deserialize<'de> for Sequence

§

impl<'de> Deserialize<'de> for TapLeafHash

§

impl<'de> Deserialize<'de> for TapNodeHash

§

impl<'de> Deserialize<'de> for TapSighash

§

impl<'de> Deserialize<'de> for TapTweakHash

§

impl<'de> Deserialize<'de> for Target

§

impl<'de> Deserialize<'de> for Transaction

§

impl<'de> Deserialize<'de> for TxIn

§

impl<'de> Deserialize<'de> for TxMerkleNode

§

impl<'de> Deserialize<'de> for TxOut

§

impl<'de> Deserialize<'de> for Txid

§

impl<'de> Deserialize<'de> for WPubkeyHash

§

impl<'de> Deserialize<'de> for WScriptHash

§

impl<'de> Deserialize<'de> for Weight

§

impl<'de> Deserialize<'de> for Witness

§

impl<'de> Deserialize<'de> for WitnessCommitment

§

impl<'de> Deserialize<'de> for WitnessMerkleNode

§

impl<'de> Deserialize<'de> for Work

§

impl<'de> Deserialize<'de> for Wtxid

§

impl<'de> Deserialize<'de> for XKeyIdentifier

§

impl<'de> Deserialize<'de> for XOnlyPublicKey

§

impl<'de> Deserialize<'de> for ControlBlock

§

impl<'de> Deserialize<'de> for NodeInfo

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::taproot::Signature

§

impl<'de> Deserialize<'de> for TapTree

§

impl<'de> Deserialize<'de> for TaprootMerkleBranch

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl<'de> Deserialize<'de> for Midstate

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl<'de> Deserialize<'de> for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<'de> Deserialize<'de> for IgnoredAny

source§

impl<'de, A> Deserialize<'de> for ChainPosition<A>
where A: Ord + Deserialize<'de>,

source§

impl<'de, A> Deserialize<'de> for bdk_chain::tx_graph::ChangeSet<A>
where A: Ord + Deserialize<'de>,

source§

impl<'de, A, IA> Deserialize<'de> for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
where A: Ord + Deserialize<'de>, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Serialize.html index d59e1eedc0..4719c56ee6 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Serialize.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/hashes/serde/trait.Serialize.html @@ -854,7 +854,7 @@ repeated data.

) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where S: Serializer,

Implementors§

§

impl Serialize for ChildNumber

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::LockTime

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::LockTime

§

impl Serialize for EcdsaSighashType

§

impl Serialize for Network

§

impl Serialize for TapSighashType

§

impl Serialize for Parity

The parity is serialized as u8 - 0 for even, 1 for odd.

§

impl Serialize for LeafVersion

Serializes LeafVersion as a u8 using consensus encoding.

-
§

impl Serialize for TapLeaf

source§

impl Serialize for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl Serialize for bdk_chain::local_chain::ChangeSet

source§

impl Serialize for Balance

source§

impl Serialize for BlockId

source§

impl Serialize for ConfirmationBlockTime

source§

impl Serialize for DescriptorId

source§

impl Serialize for String

§

impl Serialize for ChainCode

§

impl Serialize for DerivationPath

§

impl Serialize for Fingerprint

§

impl Serialize for Xpriv

§

impl Serialize for Xpub

§

impl Serialize for ShortId

§

impl Serialize for Header

§

impl Serialize for bdk_chain::bitcoin::blockdata::block::Version

§

impl Serialize for ChainHash

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl Serialize for bdk_chain::bitcoin::ecdsa::Signature

§

impl Serialize for Keypair

§

impl Serialize for TweakedKeypair

§

impl Serialize for TweakedPublicKey

§

impl Serialize for Key

§

impl Serialize for Pair

§

impl Serialize for Input

§

impl Serialize for Output

§

impl Serialize for PsbtSighashType

§

impl Serialize for SharedSecret

§

impl Serialize for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl Serialize for SecretKey

§

impl Serialize for Amount

§

impl Serialize for Block

§

impl Serialize for BlockHash

§

impl Serialize for CompactTarget

§

impl Serialize for CompressedPublicKey

§

impl Serialize for FeeRate

§

impl Serialize for FilterHash

§

impl Serialize for FilterHeader

§

impl Serialize for LegacySighash

§

impl Serialize for Opcode

§

impl Serialize for OutPoint

§

impl Serialize for PrivateKey

§

impl Serialize for Psbt

§

impl Serialize for PubkeyHash

§

impl Serialize for bdk_chain::bitcoin::PublicKey

§

impl Serialize for Script

§

impl Serialize for ScriptBuf

§

impl Serialize for ScriptHash

§

impl Serialize for SegwitV0Sighash

§

impl Serialize for Sequence

§

impl Serialize for TapLeafHash

§

impl Serialize for TapNodeHash

§

impl Serialize for TapSighash

§

impl Serialize for TapTweakHash

§

impl Serialize for Target

§

impl Serialize for Transaction

§

impl Serialize for TxIn

§

impl Serialize for TxMerkleNode

§

impl Serialize for TxOut

§

impl Serialize for Txid

§

impl Serialize for WPubkeyHash

§

impl Serialize for WScriptHash

§

impl Serialize for Weight

§

impl Serialize for Witness

§

impl Serialize for WitnessCommitment

§

impl Serialize for WitnessMerkleNode

§

impl Serialize for Work

§

impl Serialize for Wtxid

§

impl Serialize for XKeyIdentifier

§

impl Serialize for XOnlyPublicKey

§

impl Serialize for ControlBlock

§

impl Serialize for NodeInfo

§

impl Serialize for bdk_chain::bitcoin::taproot::Signature

§

impl Serialize for TapTree

§

impl Serialize for TaprootMerkleBranch

§

impl Serialize for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl Serialize for Midstate

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<A> Serialize for ChainPosition<A>
where +
§

impl Serialize for TapLeaf

source§

impl Serialize for bdk_chain::indexer::keychain_txout::ChangeSet

source§

impl Serialize for bdk_chain::local_chain::ChangeSet

source§

impl Serialize for Balance

§

impl Serialize for BlockId

§

impl Serialize for ConfirmationBlockTime

source§

impl Serialize for DescriptorId

source§

impl Serialize for String

§

impl Serialize for ChainCode

§

impl Serialize for DerivationPath

§

impl Serialize for Fingerprint

§

impl Serialize for Xpriv

§

impl Serialize for Xpub

§

impl Serialize for ShortId

§

impl Serialize for Header

§

impl Serialize for bdk_chain::bitcoin::blockdata::block::Version

§

impl Serialize for ChainHash

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::absolute::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Height

§

impl Serialize for bdk_chain::bitcoin::blockdata::locktime::relative::Time

§

impl Serialize for bdk_chain::bitcoin::blockdata::transaction::Version

§

impl Serialize for bdk_chain::bitcoin::ecdsa::Signature

§

impl Serialize for Keypair

§

impl Serialize for TweakedKeypair

§

impl Serialize for TweakedPublicKey

§

impl Serialize for Key

§

impl Serialize for Pair

§

impl Serialize for Input

§

impl Serialize for Output

§

impl Serialize for PsbtSighashType

§

impl Serialize for SharedSecret

§

impl Serialize for bdk_chain::bitcoin::secp256k1::ecdsa::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::schnorr::Signature

§

impl Serialize for bdk_chain::bitcoin::secp256k1::PublicKey

§

impl Serialize for SecretKey

§

impl Serialize for Amount

§

impl Serialize for Block

§

impl Serialize for BlockHash

§

impl Serialize for CompactTarget

§

impl Serialize for CompressedPublicKey

§

impl Serialize for FeeRate

§

impl Serialize for FilterHash

§

impl Serialize for FilterHeader

§

impl Serialize for LegacySighash

§

impl Serialize for Opcode

§

impl Serialize for OutPoint

§

impl Serialize for PrivateKey

§

impl Serialize for Psbt

§

impl Serialize for PubkeyHash

§

impl Serialize for bdk_chain::bitcoin::PublicKey

§

impl Serialize for Script

§

impl Serialize for ScriptBuf

§

impl Serialize for ScriptHash

§

impl Serialize for SegwitV0Sighash

§

impl Serialize for Sequence

§

impl Serialize for TapLeafHash

§

impl Serialize for TapNodeHash

§

impl Serialize for TapSighash

§

impl Serialize for TapTweakHash

§

impl Serialize for Target

§

impl Serialize for Transaction

§

impl Serialize for TxIn

§

impl Serialize for TxMerkleNode

§

impl Serialize for TxOut

§

impl Serialize for Txid

§

impl Serialize for WPubkeyHash

§

impl Serialize for WScriptHash

§

impl Serialize for Weight

§

impl Serialize for Witness

§

impl Serialize for WitnessCommitment

§

impl Serialize for WitnessMerkleNode

§

impl Serialize for Work

§

impl Serialize for Wtxid

§

impl Serialize for XKeyIdentifier

§

impl Serialize for XOnlyPublicKey

§

impl Serialize for ControlBlock

§

impl Serialize for NodeInfo

§

impl Serialize for bdk_chain::bitcoin::taproot::Signature

§

impl Serialize for TapTree

§

impl Serialize for TaprootMerkleBranch

§

impl Serialize for bdk_chain::bitcoin::hashes::hash160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::ripemd160::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha1::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256::Hash

§

impl Serialize for Midstate

§

impl Serialize for bdk_chain::bitcoin::hashes::sha256d::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha384::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::sha512_256::Hash

§

impl Serialize for bdk_chain::bitcoin::hashes::siphash24::Hash

source§

impl<A> Serialize for ChainPosition<A>
where A: Ord + Serialize,

source§

impl<A> Serialize for bdk_chain::tx_graph::ChangeSet<A>
where A: Ord + Serialize,

source§

impl<A, IA> Serialize for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
where A: Ord + Serialize, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html index acb33ecc1a..dceb649b38 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/index.html @@ -14,6 +14,6 @@ consistently.
  • Data persistence agnostic – bdk_chain does not care where you cache on-chain data, what you cache or how you retrieve it from persistent storage.
    • -

    Re-exports§

    Modules§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html index dad876e955..e43c7e9609 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexed_tx_graph/struct.ChangeSet.html @@ -7,7 +7,7 @@

    Trait Implementations§

    source§

    impl<A: Clone, IA: Clone> Clone for ChangeSet<A, IA>

    source§

    fn clone(&self) -> ChangeSet<A, IA>

    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<A: Debug, IA: Debug> Debug for ChangeSet<A, IA>

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<A, IA: Default> Default for ChangeSet<A, IA>

    source§

    fn default() -> Self

    Returns the “default value” for a type. Read more
    source§

    impl<'de, A, IA> Deserialize<'de> for ChangeSet<A, IA>
    where A: Ord + Deserialize<'de>, IA: Deserialize<'de>,

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>

    source§

    fn from(graph: ChangeSet<A>) -> Self

    Converts to this type from the input type.
    source§

    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>

    source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl<A: PartialEq, IA: PartialEq> PartialEq for ChangeSet<A, IA>

    source§

    fn eq(&self, other: &ChangeSet<A, IA>) -> bool

    This method tests for self and other values to be equal, and is used + __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>

    source§

    fn from(graph: ChangeSet<A>) -> Self

    Converts to this type from the input type.
    source§

    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>

    source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl<A: PartialEq, IA: PartialEq> PartialEq for ChangeSet<A, IA>

    source§

    fn eq(&self, other: &ChangeSet<A, IA>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl<A, IA> Serialize for ChangeSet<A, IA>
    where A: Ord + Serialize, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.ChangeSet.html index 2dc0fb462c..6c69fd8d74 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/indexer/keychain_txout/struct.ChangeSet.html @@ -19,7 +19,7 @@ and given parameters.

    Trait Implementations§

    source§

    impl Clone for ChangeSet

    source§

    fn clone(&self) -> ChangeSet

    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 ChangeSet

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for ChangeSet

    source§

    fn default() -> ChangeSet

    Returns the “default value” for a type. Read more
    source§

    impl<'de> Deserialize<'de> for ChangeSet

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>

    source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another ChangeSet into self.

    source§

    fn is_empty(&self) -> bool

    Returns whether the changeset are empty.

    -
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used +
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl Serialize for ChangeSet

    source§

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

    Serialize this value into the given Serde serializer. Read more
    source§

    impl StructuralPartialEq for ChangeSet

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html index b9002047ae..38898e08ae 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.ChangeSet.html @@ -12,7 +12,7 @@

    source

    pub fn persist_to_sqlite(&self, db_tx: &Transaction<'_>) -> Result<()>

    Persist changeset to the sqlite database.

    Remember to call Self::init_sqlite_tables beforehand.

    Trait Implementations§

    source§

    impl Clone for ChangeSet

    source§

    fn clone(&self) -> ChangeSet

    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 ChangeSet

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for ChangeSet

    source§

    fn default() -> ChangeSet

    Returns the “default value” for a type. Read more
    source§

    impl<'de> Deserialize<'de> for ChangeSet

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet

    source§

    fn from(blocks: B) -> Self

    Converts to this type from the input type.
    source§

    impl FromIterator<(u32, BlockHash)> for ChangeSet

    source§

    fn from_iter<T: IntoIterator<Item = (u32, BlockHash)>>(iter: T) -> Self

    Creates a value from an iterator. Read more
    source§

    impl FromIterator<(u32, Option<BlockHash>)> for ChangeSet

    source§

    fn from_iter<T: IntoIterator<Item = (u32, Option<BlockHash>)>>(iter: T) -> Self

    Creates a value from an iterator. Read more
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used + __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet

    source§

    fn from(blocks: B) -> Self

    Converts to this type from the input type.
    source§

    impl FromIterator<(u32, BlockHash)> for ChangeSet

    source§

    fn from_iter<T: IntoIterator<Item = (u32, BlockHash)>>(iter: T) -> Self

    Creates a value from an iterator. Read more
    source§

    impl FromIterator<(u32, Option<BlockHash>)> for ChangeSet

    source§

    fn from_iter<T: IntoIterator<Item = (u32, Option<BlockHash>)>>(iter: T) -> Self

    Creates a value from an iterator. Read more
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl Serialize for ChangeSet

    source§

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

    Serialize this value into the given Serde serializer. Read more
    source§

    impl StructuralPartialEq for ChangeSet

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html index 63860caece..64442e4c28 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPoint.html @@ -1,8 +1,8 @@ -CheckPoint in bdk_chain::local_chain - Rust

    Struct bdk_chain::local_chain::CheckPoint

    source · 
    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    +CheckPoint in bdk_chain::local_chain - Rust

    Struct bdk_chain::local_chain::CheckPoint

    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    Checkpoints are cheaply cloneable and are useful to find the agreement point between two sparse block chains.

    -

    Implementations§

    source§

    impl CheckPoint

    source

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    -
    source

    pub fn from_block_ids( +

    Implementations§

    §

    impl CheckPoint

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    +

    pub fn from_block_ids( block_ids: impl IntoIterator<Item = BlockId> ) -> Result<CheckPoint, Option<CheckPoint>>

    Construct a checkpoint from a list of BlockIds in ascending height order.

    §Errors
    @@ -13,30 +13,30 @@ block chains.

  • The blocks iterator contains multiple BlockIds of the same height.

    • The error type is the last successful checkpoint constructed (if any).

    -
    source

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    +

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    If header is of the genesis block, the checkpoint won’t have a prev node. Otherwise, we return a checkpoint linked with the previous block.

    -
    source

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    +

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    Returns an Err(self) if the block you are pushing on is not at a greater height that the one you are pushing on to.

    -
    source

    pub fn extend( +

    pub fn extend( self, blocks: impl IntoIterator<Item = BlockId> ) -> Result<CheckPoint, CheckPoint>

    Extends the checkpoint linked list by a iterator of block ids.

    Returns an Err(self) if there is block which does not have a greater height than the previous one.

    -
    source

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    -
    source

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    -
    source

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    -
    source

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    -
    source

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    -
    source

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    +

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    +

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    +

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    +

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    +

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    +

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    Returns None if checkpoint at height does not exist`.

    -
    source

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where +

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where R: RangeBounds<u32>,

    Iterate checkpoints over a height range.

    Note that we always iterate checkpoints in reverse height order (iteration starts at tip height).

    -
    source

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    +

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    The effect of insert depends on whether a height already exists. If it doesn’t the block_id we inserted and all pre-existing blocks higher than it will be re-inserted after it. If the height already existed and has a conflicting block hash then it will be purged @@ -44,8 +44,8 @@ along with all block following it. The returned chain will have a tip of the block_id was already present then this just returns self.

    §Panics

    This panics if called with a genesis block that differs from that of self.

    -
    source

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    -

    Trait Implementations§

    source§

    impl Clone for CheckPoint

    source§

    fn clone(&self) -> CheckPoint

    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 CheckPoint

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl IntoIterator for CheckPoint

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    type IntoIter = CheckPointIter

    Which kind of iterator are we turning this into?
    source§

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    source§

    impl PartialEq for CheckPoint

    source§

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

    This method tests for self and other values to be equal, and is used +

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    +

    Trait Implementations§

    §

    impl Clone for CheckPoint

    §

    fn clone(&self) -> CheckPoint

    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 CheckPoint

    §

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

    Formats the value using the given formatter. Read more
    §

    impl IntoIterator for CheckPoint

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    type IntoIter = CheckPointIter

    Which kind of iterator are we turning this into?
    §

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    §

    impl PartialEq for CheckPoint

    §

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

    This method tests for self and other values to be equal, and is used by ==.
    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.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

    impl<T> Borrow<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html index 2261c8a4ed..35f78b9462 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/local_chain/struct.CheckPointIter.html @@ -1,5 +1,5 @@ -CheckPointIter in bdk_chain::local_chain - Rust

    Struct bdk_chain::local_chain::CheckPointIter

    source · 
    pub struct CheckPointIter { /* private fields */ }
    Expand description

    Iterates over checkpoints backwards.

    -

    Trait Implementations§

    source§

    impl Iterator for CheckPointIter

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( +CheckPointIter in bdk_chain::local_chain - Rust

    Struct bdk_chain::local_chain::CheckPointIter

    pub struct CheckPointIter { /* private fields */ }
    Expand description

    Iterates over checkpoints backwards.

    +

    Trait Implementations§

    §

    impl Iterator for CheckPointIter

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>

    Advances the iterator and returns the next value. 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) -> usize
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html index d0701de1fa..332f8054e9 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/enum.SyncItem.html @@ -1,4 +1,4 @@ -SyncItem in bdk_chain::spk_client - Rust

    Enum bdk_chain::spk_client::SyncItem

    source · 
    pub enum SyncItem<'i, I> {
+SyncItem in bdk_chain::spk_client - Rust
    Enum bdk_chain::spk_client::SyncItem
    pub enum SyncItem<'i, I> {
     Spk(I, &'i Script),
     Txid(Txid),
     OutPoint(OutPoint),
@@ -6,26 +6,26 @@

    Variants§

    §

    Spk(I, &'i Script)

    Script pubkey sync item.

    §

    Txid(Txid)

    Txid sync item.

    §

    OutPoint(OutPoint)

    Outpoint sync item.

    -

    Trait Implementations§

    source§

    impl<'i, I> Clone for SyncItem<'i, I>
    where - I: Clone,

    source§

    fn clone(&self) -> SyncItem<'i, I>

    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<'i, I> Debug for SyncItem<'i, I>
    where - I: Debug,

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<'i, I> Display for SyncItem<'i, I>
    where - I: Debug + Any,

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<'i, I> Hash for SyncItem<'i, I>
    where - I: Hash,

    source§

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

    Trait Implementations§

    §

    impl<'i, I> Clone for SyncItem<'i, I>
    where + I: Clone,

    §

    fn clone(&self) -> SyncItem<'i, I>

    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<'i, I> Debug for SyncItem<'i, I>
    where + I: Debug,

    §

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

    Formats the value using the given formatter. Read more
    §

    impl<'i, I> Display for SyncItem<'i, I>
    where + I: Debug + Any,

    §

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

    Formats the value using the given formatter. Read more
    §

    impl<'i, I> Hash for SyncItem<'i, I>
    where + I: Hash,

    §

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

    Feeds this value into the given Hasher. Read more
    1.3.0 · source§

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

    Feeds a slice of this type into the given Hasher. Read more
    source§

    impl<'i, I> Ord for SyncItem<'i, I>
    where - I: Ord,

    source§

    fn cmp(&self, other: &SyncItem<'i, I>) -> Ordering

    This method returns an Ordering between self and other. Read more
    1.21.0 · source§

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

    Feeds a slice of this type into the given Hasher. Read more
    §

    impl<'i, I> Ord for SyncItem<'i, I>
    where + I: Ord,

    §

    fn cmp(&self, other: &SyncItem<'i, I>) -> Ordering

    This method returns an Ordering between self and other. Read more
    1.21.0 · source§

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

    Compares and returns the maximum of two values. Read more
    1.21.0 · source§

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

    Compares and returns the minimum of two values. Read more
    1.50.0 · source§

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

    Restrict a value to a certain interval. Read more
    source§

    impl<'i, I> PartialEq for SyncItem<'i, I>
    where - I: PartialEq,

    source§

    fn eq(&self, other: &SyncItem<'i, I>) -> bool

    This method tests for self and other values to be equal, and is used + Self: Sized + PartialOrd,

    Restrict a value to a certain interval. Read more
    §

    impl<'i, I> PartialEq for SyncItem<'i, I>
    where + I: PartialEq,

    §

    fn eq(&self, other: &SyncItem<'i, I>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl<'i, I> PartialOrd for SyncItem<'i, I>
    where - I: PartialOrd,

    source§

    fn partial_cmp(&self, other: &SyncItem<'i, I>) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= +sufficient, and should not be overridden without very good reason.
    §

    impl<'i, I> PartialOrd for SyncItem<'i, I>
    where + I: PartialOrd,

    §

    fn partial_cmp(&self, other: &SyncItem<'i, I>) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

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

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

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

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl<'i, I> Copy for SyncItem<'i, I>
    where - I: Copy,

    source§

    impl<'i, I> Eq for SyncItem<'i, I>
    where - I: Eq,

    source§

    impl<'i, I> StructuralPartialEq for SyncItem<'i, I>

    Auto Trait Implementations§

    §

    impl<'i, I> Freeze for SyncItem<'i, I>
    where +operator. Read more

    §

    impl<'i, I> Copy for SyncItem<'i, I>
    where + I: Copy,

    §

    impl<'i, I> Eq for SyncItem<'i, I>
    where + I: Eq,

    §

    impl<'i, I> StructuralPartialEq for SyncItem<'i, I>

    Auto Trait Implementations§

    §

    impl<'i, I> Freeze for SyncItem<'i, I>
    where I: Freeze,

    §

    impl<'i, I> RefUnwindSafe for SyncItem<'i, I>
    where I: RefUnwindSafe,

    §

    impl<'i, I> Send for SyncItem<'i, I>
    where I: Send,

    §

    impl<'i, I> Sync for SyncItem<'i, I>
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html index d1ff4a10e1..85ecdd5ced 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/index.html @@ -1,2 +1,2 @@ -bdk_chain::spk_client - Rust

    Module bdk_chain::spk_client

    source ·
    Expand description

    Helper types for spk-based blockchain clients.

    +bdk_chain::spk_client - Rust

    Module bdk_chain::spk_client

    Expand description

    Helper types for spk-based blockchain clients.

    Structs§

    Enums§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html index 7bce6e861a..32948802f3 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequest.html @@ -1,20 +1,20 @@ -FullScanRequest in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::FullScanRequest

    source · 
    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description

    Data required to perform a spk-based blockchain client full scan.

    +FullScanRequest in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::FullScanRequest

    pub struct FullScanRequest<K> { /* private fields */ }
    Expand description

    Data required to perform a spk-based blockchain client full scan.

    A client full scan iterates through all the scripts for the given keychains, fetching relevant data until some stop gap number of scripts is found that have no data. This operation is generally only used when importing or restoring previously used keychains in which the list of used scripts is not known. The full scan process also updates the chain from the given chain_tip (if provided).

    -

    Implementations§

    source§

    impl<K> FullScanRequest<K>
    where - K: Ord + Clone,

    source

    pub fn builder() -> FullScanRequestBuilder<K>

    Start building a FullScanRequest.

    -
    source

    pub fn chain_tip(&self) -> Option<CheckPoint>

    Get the chain tip CheckPoint of this request (if any).

    -
    source

    pub fn keychains(&self) -> Vec<K>

    List all keychains contained in this request.

    -
    source

    pub fn next_spk(&mut self, keychain: K) -> Option<(u32, ScriptBuf)>

    Advances the full scan request and returns the next indexed ScriptBuf of the given +

    Implementations§

    §

    impl<K> FullScanRequest<K>
    where + K: Ord + Clone,

    pub fn builder() -> FullScanRequestBuilder<K>

    Start building a FullScanRequest.

    +

    pub fn chain_tip(&self) -> Option<CheckPoint>

    Get the chain tip CheckPoint of this request (if any).

    +

    pub fn keychains(&self) -> Vec<K>

    List all keychains contained in this request.

    +

    pub fn next_spk(&mut self, keychain: K) -> Option<(u32, ScriptBuf)>

    Advances the full scan request and returns the next indexed ScriptBuf of the given keychain.

    -
    source

    pub fn iter_spks( +

    pub fn iter_spks( &mut self, keychain: K ) -> impl Iterator<Item = (u32, ScriptBuf)>

    Iterate over indexed ScriptBufs contained in this request of the given keychain.

    -

    Trait Implementations§

    source§

    impl<K> Default for FullScanRequest<K>

    source§

    fn default() -> FullScanRequest<K>

    Returns the “default value” for a type. Read more
    source§

    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>

    source§

    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>

    Converts to this type from the input type.

    Auto Trait Implementations§

    §

    impl<K> Freeze for FullScanRequest<K>

    §

    impl<K> !RefUnwindSafe for FullScanRequest<K>

    §

    impl<K> Send for FullScanRequest<K>
    where +

    Trait Implementations§

    §

    impl<K> Default for FullScanRequest<K>

    §

    fn default() -> FullScanRequest<K>

    Returns the “default value” for a type. Read more
    §

    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>

    §

    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>

    Converts to this type from the input type.

    Auto Trait Implementations§

    §

    impl<K> Freeze for FullScanRequest<K>

    §

    impl<K> !RefUnwindSafe for FullScanRequest<K>

    §

    impl<K> Send for FullScanRequest<K>
    where K: Send,

    §

    impl<K> !Sync for FullScanRequest<K>

    §

    impl<K> Unpin for FullScanRequest<K>

    §

    impl<K> !UnwindSafe for FullScanRequest<K>

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

    impl<T> BorrowMut<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html index f1f3e3cf85..63b8067f24 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanRequestBuilder.html @@ -1,16 +1,16 @@ -FullScanRequestBuilder in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::FullScanRequestBuilder

    source · 
    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description

    Builds a FullScanRequest.

    -

    Implementations§

    source§

    impl<K> FullScanRequestBuilder<K>
    where - K: Ord,

    source

    pub fn chain_tip(self, tip: CheckPoint) -> FullScanRequestBuilder<K>

    Set the initial chain tip for the full scan request.

    +FullScanRequestBuilder in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::FullScanRequestBuilder

    pub struct FullScanRequestBuilder<K> { /* private fields */ }
    Expand description

    Builds a FullScanRequest.

    +

    Implementations§

    §

    impl<K> FullScanRequestBuilder<K>
    where + K: Ord,

    pub fn chain_tip(self, tip: CheckPoint) -> FullScanRequestBuilder<K>

    Set the initial chain tip for the full scan request.

    This is used to update LocalChain.

    -
    source

    pub fn spks_for_keychain( +

    pub fn spks_for_keychain( self, keychain: K, spks: impl IntoIterator<IntoIter = impl Iterator<Item = (u32, ScriptBuf)> + Send + 'static> ) -> FullScanRequestBuilder<K>

    Set the spk iterator for a given keychain.

    -
    source

    pub fn inspect<F>(self, inspect: F) -> FullScanRequestBuilder<K>
    where +

    pub fn inspect<F>(self, inspect: F) -> FullScanRequestBuilder<K>
    where F: FnMut(K, u32, &Script) + Send + 'static,

    Set the closure that will inspect every sync item visited.

    -
    source

    pub fn build(self) -> FullScanRequest<K>

    Build the FullScanRequest.

    -

    Trait Implementations§

    source§

    impl<K> Default for FullScanRequestBuilder<K>

    source§

    fn default() -> FullScanRequestBuilder<K>

    Returns the “default value” for a type. Read more
    source§

    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>

    source§

    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>

    Converts to this type from the input type.
    source§

    impl<K: Clone + Ord + Debug> FullScanRequestBuilderExt<K> for FullScanRequestBuilder<K>

    source§

    fn spks_from_indexer(self, indexer: &KeychainTxOutIndex<K>) -> Self

    Add spk iterators for each keychain tracked in indexer.

    Auto Trait Implementations§

    pub fn build(self) -> FullScanRequest<K>

    Build the FullScanRequest.

    +

    Trait Implementations§

    §

    impl<K> Default for FullScanRequestBuilder<K>

    §

    fn default() -> FullScanRequestBuilder<K>

    Returns the “default value” for a type. Read more
    §

    impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>

    §

    fn from(builder: FullScanRequestBuilder<K>) -> FullScanRequest<K>

    Converts to this type from the input type.
    source§

    impl<K: Clone + Ord + Debug> FullScanRequestBuilderExt<K> for FullScanRequestBuilder<K>

    source§

    fn spks_from_indexer(self, indexer: &KeychainTxOutIndex<K>) -> Self

    Add spk iterators for each keychain tracked in indexer.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

    impl<T> BorrowMut<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html index 8b9476625f..5b21a976cb 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.FullScanResponse.html @@ -1,4 +1,4 @@ -FullScanResponse in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::FullScanResponse

    source · 
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
+FullScanResponse in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::FullScanResponse
    pub struct FullScanResponse<K, A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub last_active_indices: BTreeMap<K, u32>,
     pub chain_update: Option<CheckPoint>,
@@ -8,9 +8,9 @@
 
    §last_active_indices: BTreeMap<K, u32>
    Last active indices for the corresponding keychains (K). An index is active if it had a
 transaction associated with the script pubkey at that index.
    
 
    §chain_update: Option<CheckPoint>
    Changes to the chain discovered during the scan.
    
-
    Trait Implementations§
    source§
    impl<K, A> Debug for FullScanResponse<K, A>
    where
+
    Trait Implementations§
    §
    impl<K, A> Debug for FullScanResponse<K, A>
    where
     K: Debug,
-    A: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl<K, A> Default for FullScanResponse<K, A>
    source§
    fn default() -> FullScanResponse<K, A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<K, A> Freeze for FullScanResponse<K, A>
    §
    impl<K, A> RefUnwindSafe for FullScanResponse<K, A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<K, A> Default for FullScanResponse<K, A>
    §
    fn default() -> FullScanResponse<K, A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<K, A> Freeze for FullScanResponse<K, A>
    §
    impl<K, A> RefUnwindSafe for FullScanResponse<K, A>
    where
     K: RefUnwindSafe,
     A: RefUnwindSafe,
    §
    impl<K, A> Send for FullScanResponse<K, A>
    where
     K: Send,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
index b9609509a5..4aaa02ff37 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncProgress.html
@@ -1,4 +1,4 @@
-SyncProgress in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::SyncProgress
    source · 
    pub struct SyncProgress {
+SyncProgress in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::SyncProgress
    pub struct SyncProgress {
     pub spks_consumed: usize,
     pub spks_remaining: usize,
     pub txids_consumed: usize,
@@ -12,13 +12,13 @@
 
    §txids_remaining: usize
    Txids remaining in the request.
    
 
    §outpoints_consumed: usize
    Outpoints consumed by the request.
    
 
    §outpoints_remaining: usize
    Outpoints remaining in the request.
    
-
    Implementations§
    source§
    impl SyncProgress
    source
    pub fn total(&self) -> usize
    Total items, consumed and remaining, of the request.
    
-
    source
    pub fn total_spks(&self) -> usize
    Total script pubkeys, consumed and remaining, of the request.
    
-
    source
    pub fn total_txids(&self) -> usize
    Total txids, consumed and remaining, of the request.
    
-
    source
    pub fn total_outpoints(&self) -> usize
    Total outpoints, consumed and remaining, of the request.
    
-
    source
    pub fn consumed(&self) -> usize
    Total consumed items of the request.
    
-
    source
    pub fn remaining(&self) -> usize
    Total remaining items of the request.
    
-
    Trait Implementations§
    source§
    impl Clone for SyncProgress
    source§
    fn clone(&self) -> SyncProgress
    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 SyncProgress
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Auto Trait Implementations§
    Blanket Implementations§
    source§
    impl<T> Any for T
    where
+
    Implementations§
    §
    impl SyncProgress
    pub fn total(&self) -> usize
    Total items, consumed and remaining, of the request.
    
+
    pub fn total_spks(&self) -> usize
    Total script pubkeys, consumed and remaining, of the request.
    
+
    pub fn total_txids(&self) -> usize
    Total txids, consumed and remaining, of the request.
    
+
    pub fn total_outpoints(&self) -> usize
    Total outpoints, consumed and remaining, of the request.
    
+
    pub fn consumed(&self) -> usize
    Total consumed items of the request.
    
+
    pub fn remaining(&self) -> usize
    Total remaining items of the request.
    
+
    Trait Implementations§
    §
    impl Clone for SyncProgress
    §
    fn clone(&self) -> SyncProgress
    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 SyncProgress
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    Auto Trait Implementations§
    Blanket Implementations§
    source§
    impl<T> Any for T
    where
     T: 'static + ?Sized,
    source§
    fn type_id(&self) -> TypeId
    Gets the TypeId of self. Read more
    source§
    impl<T> Borrow<T> for T
    where
     T: ?Sized,
    source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    source§
    impl<T> BorrowMut<T> for T
    where
     T: ?Sized,
    source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    source§
    impl<T> From<T> for T
    source§
    fn from(t: T) -> T
    Returns the argument unchanged.
    
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
index 9608b4ef31..dccbc18d01 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequest.html
@@ -1,4 +1,4 @@
-SyncRequest in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::SyncRequest
    source · 
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
+SyncRequest in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::SyncRequest
    pub struct SyncRequest<I = ()> { /* private fields */ }
    Expand description
    Data required to perform a spk-based blockchain client sync.
    
 
    A client sync fetches relevant chain data for a known list of scripts, transaction ids and
 outpoints. The sync process also updates the chain from the given
 chain_tip (if provided).
    
@@ -13,19 +13,19 @@ outpoints. The sync process also updates the chain from the given
     .inspect(|item, progress| println!("{} (remaining: {})", item, progress.remaining()))
     // Finish constructing the sync request.
     .build();
    
-

    Implementations§

    source§

    impl<I> SyncRequest<I>

    source

    pub fn builder() -> SyncRequestBuilder<I>

    Start building a SyncRequest.

    -
    source

    pub fn progress(&self) -> SyncProgress

    Get the SyncProgress of this request.

    -
    source

    pub fn chain_tip(&self) -> Option<CheckPoint>

    Get the chain tip CheckPoint of this request (if any).

    -
    source

    pub fn next_spk(&mut self) -> Option<ScriptBuf>

    Advances the sync request and returns the next ScriptBuf.

    +

    Implementations§

    §

    impl<I> SyncRequest<I>

    pub fn builder() -> SyncRequestBuilder<I>

    Start building a SyncRequest.

    +

    pub fn progress(&self) -> SyncProgress

    Get the SyncProgress of this request.

    +

    pub fn chain_tip(&self) -> Option<CheckPoint>

    Get the chain tip CheckPoint of this request (if any).

    +

    pub fn next_spk(&mut self) -> Option<ScriptBuf>

    Advances the sync request and returns the next ScriptBuf.

    Returns None when there are no more scripts remaining in the request.

    -
    source

    pub fn next_txid(&mut self) -> Option<Txid>

    Advances the sync request and returns the next Txid.

    +

    pub fn next_txid(&mut self) -> Option<Txid>

    Advances the sync request and returns the next Txid.

    Returns None when there are no more txids remaining in the request.

    -
    source

    pub fn next_outpoint(&mut self) -> Option<OutPoint>

    Advances the sync request and returns the next OutPoint.

    +

    pub fn next_outpoint(&mut self) -> Option<OutPoint>

    Advances the sync request and returns the next OutPoint.

    Returns None when there are no more outpoints in the request.

    -
    source

    pub fn iter_spks(&mut self) -> impl ExactSizeIterator

    Iterate over ScriptBufs contained in this request.

    -
    source

    pub fn iter_txids(&mut self) -> impl ExactSizeIterator

    Iterate over Txids contained in this request.

    -
    source

    pub fn iter_outpoints(&mut self) -> impl ExactSizeIterator

    Iterate over OutPoints contained in this request.

    -

    Trait Implementations§

    source§

    impl<I> Default for SyncRequest<I>

    source§

    fn default() -> SyncRequest<I>

    Returns the “default value” for a type. Read more
    source§

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    source§

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.

    Auto Trait Implementations§

    §

    impl<I> Freeze for SyncRequest<I>

    §

    impl<I = ()> !RefUnwindSafe for SyncRequest<I>

    §

    impl<I> Send for SyncRequest<I>
    where +

    pub fn iter_spks(&mut self) -> impl ExactSizeIterator

    Iterate over ScriptBufs contained in this request.

    +

    pub fn iter_txids(&mut self) -> impl ExactSizeIterator

    Iterate over Txids contained in this request.

    +

    pub fn iter_outpoints(&mut self) -> impl ExactSizeIterator

    Iterate over OutPoints contained in this request.

    +

    Trait Implementations§

    §

    impl<I> Default for SyncRequest<I>

    §

    fn default() -> SyncRequest<I>

    Returns the “default value” for a type. Read more
    §

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    §

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.

    Auto Trait Implementations§

    §

    impl<I> Freeze for SyncRequest<I>

    §

    impl<I = ()> !RefUnwindSafe for SyncRequest<I>

    §

    impl<I> Send for SyncRequest<I>
    where I: Send,

    §

    impl<I = ()> !Sync for SyncRequest<I>

    §

    impl<I> Unpin for SyncRequest<I>
    where I: Unpin,

    §

    impl<I = ()> !UnwindSafe for SyncRequest<I>

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

    impl<T> Borrow<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html index 67af6261a9..360cee4860 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncRequestBuilder.html @@ -1,11 +1,11 @@ -SyncRequestBuilder in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::SyncRequestBuilder

    source · 
    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description

    Builds a SyncRequest.

    -

    Implementations§

    source§

    impl SyncRequestBuilder

    source

    pub fn spks( +SyncRequestBuilder in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::SyncRequestBuilder

    pub struct SyncRequestBuilder<I = ()> { /* private fields */ }
    Expand description

    Builds a SyncRequest.

    +

    Implementations§

    §

    impl SyncRequestBuilder

    pub fn spks( self, spks: impl IntoIterator<Item = ScriptBuf> ) -> SyncRequestBuilder

    Add Scripts that will be synced against.

    -
    source§

    impl<I> SyncRequestBuilder<I>

    source

    pub fn chain_tip(self, cp: CheckPoint) -> SyncRequestBuilder<I>

    Set the initial chain tip for the sync request.

    +
    §

    impl<I> SyncRequestBuilder<I>

    pub fn chain_tip(self, cp: CheckPoint) -> SyncRequestBuilder<I>

    Set the initial chain tip for the sync request.

    This is used to update LocalChain.

    -
    source

    pub fn spks_with_indexes( +

    pub fn spks_with_indexes( self, spks: impl IntoIterator<Item = (I, ScriptBuf)> ) -> SyncRequestBuilder<I>

    Add Scripts coupled with associated indexes that will be synced against.

    @@ -35,18 +35,18 @@ indexer.insert_descriptor("descriptor_b", descriptor let _request = SyncRequest::builder() .spks_with_indexes(all_revealed_spks) .build();
    -

    source

    pub fn txids( +

    pub fn txids( self, txids: impl IntoIterator<Item = Txid> ) -> SyncRequestBuilder<I>

    Add Txids that will be synced against.

    -
    source

    pub fn outpoints( +

    pub fn outpoints( self, outpoints: impl IntoIterator<Item = OutPoint> ) -> SyncRequestBuilder<I>

    Add OutPoints that will be synced against.

    -
    source

    pub fn inspect<F>(self, inspect: F) -> SyncRequestBuilder<I>
    where +

    pub fn inspect<F>(self, inspect: F) -> SyncRequestBuilder<I>
    where F: FnMut(SyncItem<'_, I>, SyncProgress) + Send + 'static,

    Set the closure that will inspect every sync item visited.

    -
    source

    pub fn build(self) -> SyncRequest<I>

    Build the SyncRequest.

    -

    Trait Implementations§

    source§

    impl<I> Default for SyncRequestBuilder<I>

    source§

    fn default() -> SyncRequestBuilder<I>

    Returns the “default value” for a type. Read more
    source§

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    source§

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.
    source§

    impl<K: Clone + Ord + Debug> SyncRequestBuilderExt<K> for SyncRequestBuilder<(K, u32)>

    source§

    fn revealed_spks_from_indexer<R>( +

    pub fn build(self) -> SyncRequest<I>

    Build the SyncRequest.

    +

    Trait Implementations§

    §

    impl<I> Default for SyncRequestBuilder<I>

    §

    fn default() -> SyncRequestBuilder<I>

    Returns the “default value” for a type. Read more
    §

    impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>

    §

    fn from(builder: SyncRequestBuilder<I>) -> SyncRequest<I>

    Converts to this type from the input type.
    source§

    impl<K: Clone + Ord + Debug> SyncRequestBuilderExt<K> for SyncRequestBuilder<(K, u32)>

    source§

    fn revealed_spks_from_indexer<R>( self, indexer: &KeychainTxOutIndex<K>, spk_range: R diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html index f746a84ead..3fa5119371 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/spk_client/struct.SyncResponse.html @@ -1,12 +1,12 @@ -SyncResponse in bdk_chain::spk_client - Rust

    Struct bdk_chain::spk_client::SyncResponse

    source · 
    pub struct SyncResponse<A = ConfirmationBlockTime> {
+SyncResponse in bdk_chain::spk_client - Rust
    Struct bdk_chain::spk_client::SyncResponse
    pub struct SyncResponse<A = ConfirmationBlockTime> {
     pub tx_update: TxUpdate<A>,
     pub chain_update: Option<CheckPoint>,
 }
    Expand description
    Data returned from a spk-based blockchain client sync.
    
 
    See also SyncRequest.
    
 
    Fields§
    §tx_update: TxUpdate<A>
    Relevant transaction data discovered during the scan.
    
 
    §chain_update: Option<CheckPoint>
    Changes to the chain discovered during the scan.
    
-
    Trait Implementations§
    source§
    impl<A> Debug for SyncResponse<A>
    where
-    A: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl<A> Default for SyncResponse<A>
    source§
    fn default() -> SyncResponse<A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<A> Freeze for SyncResponse<A>
    §
    impl<A> RefUnwindSafe for SyncResponse<A>
    where
+
    Trait Implementations§
    §
    impl<A> Debug for SyncResponse<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for SyncResponse<A>
    §
    fn default() -> SyncResponse<A>
    Returns the “default value” for a type. Read more
    Auto Trait Implementations§
    §
    impl<A> Freeze for SyncResponse<A>
    §
    impl<A> RefUnwindSafe for SyncResponse<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for SyncResponse<A>
    where
     A: Send,
    §
    impl<A> Sync for SyncResponse<A>
    where
     A: Sync,
    §
    impl<A> Unpin for SyncResponse<A>
    §
    impl<A> UnwindSafe for SyncResponse<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
index bdcaa96fdf..002f560efe 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.BlockId.html
@@ -1,27 +1,27 @@
-BlockId in bdk_chain - Rust
    Struct bdk_chain::BlockId
    source · 
    pub struct BlockId {
+BlockId in bdk_chain - Rust
    Struct bdk_chain::BlockId
    pub struct BlockId {
     pub height: u32,
     pub hash: BlockHash,
 }
    Expand description
    A reference to a block in the canonical chain.
    
 
    Fields§
    §height: u32
    The height of the block.
    
 
    §hash: BlockHash
    The hash of the block.
    
-
    Trait Implementations§
    source§
    impl Anchor for BlockId
    source§
    fn anchor_block(&self) -> Self
    Returns the BlockId that the associated blockchain data is “anchored” in.
    source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    source§
    impl Clone for BlockId
    source§
    fn clone(&self) -> BlockId
    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 BlockId
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl Default for BlockId
    source§
    fn default() -> BlockId
    Returns the “default value” for a type. Read more
    source§
    impl<'de> Deserialize<'de> for BlockId
    source§
    fn deserialize<__D>(
+
    Trait Implementations§
    source§
    impl Anchor for BlockId
    source§
    fn anchor_block(&self) -> Self
    Returns the BlockId that the associated blockchain data is “anchored” in.
    source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    §
    impl Clone for BlockId
    §
    fn clone(&self) -> BlockId
    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 BlockId
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl Default for BlockId
    §
    fn default() -> BlockId
    Returns the “default value” for a type. Read more
    §
    impl<'de> Deserialize<'de> for BlockId
    §
    fn deserialize<__D>(
     __deserializer: __D
 ) -> Result<BlockId, <__D as Deserializer<'de>>::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§
    impl From<(&u32, &BlockHash)> for BlockId
    source§
    fn from(_: (&u32, &BlockHash)) -> BlockId
    Converts to this type from the input type.
    source§
    impl From<(u32, BlockHash)> for BlockId
    source§
    fn from(_: (u32, BlockHash)) -> BlockId
    Converts to this type from the input type.
    source§
    impl From<BlockId> for (u32, BlockHash)
    source§
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    source§
    impl<'b> From<TxPosInBlock<'b>> for BlockId
    source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for BlockId
    source§
    fn hash<__H>(&self, state: &mut __H)
    where
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    §
    impl From<(&u32, &BlockHash)> for BlockId
    §
    fn from(_: (&u32, &BlockHash)) -> BlockId
    Converts to this type from the input type.
    §
    impl From<(u32, BlockHash)> for BlockId
    §
    fn from(_: (u32, BlockHash)) -> BlockId
    Converts to this type from the input type.
    §
    impl From<BlockId> for (u32, BlockHash)
    §
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    source§
    impl<'b> From<TxPosInBlock<'b>> for BlockId
    source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    §
    impl Hash for BlockId
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
-    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§
    impl Ord for BlockId
    source§
    fn cmp(&self, other: &BlockId) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where
+    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    §
    impl Ord for BlockId
    §
    fn cmp(&self, other: &BlockId) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where
     Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where
     Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where
-    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    source§
    impl PartialEq for BlockId
    source§
    fn eq(&self, other: &BlockId) -> bool
    This method tests for self and other values to be equal, and is used
+    Self: Sized + PartialOrd,

    Restrict a value to a certain interval. Read more
    §

    impl PartialEq for BlockId

    §

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl PartialOrd for BlockId

    source§

    fn partial_cmp(&self, other: &BlockId) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= +sufficient, and should not be overridden without very good reason.
    §

    impl PartialOrd for BlockId

    §

    fn partial_cmp(&self, other: &BlockId) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

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

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

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

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Serialize for BlockId

    source§

    fn serialize<__S>( +operator. Read more

    §

    impl Serialize for BlockId

    §

    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 Copy for BlockId

    source§

    impl Eq for BlockId

    source§

    impl StructuralPartialEq for BlockId

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where + __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    §

    impl Copy for BlockId

    §

    impl Eq for BlockId

    §

    impl StructuralPartialEq for BlockId

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    §

    impl<Q, K> Equivalent<K> for Q
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html index 4f18fa9253..fe4e4e4e25 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPoint.html @@ -1,8 +1,8 @@ -CheckPoint in bdk_chain - Rust

    Struct bdk_chain::CheckPoint

    source · 
    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    +CheckPoint in bdk_chain - Rust

    Struct bdk_chain::CheckPoint

    pub struct CheckPoint(/* private fields */);
    Expand description

    A checkpoint is a node of a reference-counted linked list of BlockIds.

    Checkpoints are cheaply cloneable and are useful to find the agreement point between two sparse block chains.

    -

    Implementations§

    source§

    impl CheckPoint

    source

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    -
    source

    pub fn from_block_ids( +

    Implementations§

    §

    impl CheckPoint

    pub fn new(block: BlockId) -> CheckPoint

    Construct a new base block at the front of a linked list.

    +

    pub fn from_block_ids( block_ids: impl IntoIterator<Item = BlockId> ) -> Result<CheckPoint, Option<CheckPoint>>

    Construct a checkpoint from a list of BlockIds in ascending height order.

    §Errors
    @@ -13,30 +13,30 @@ block chains.

  • The blocks iterator contains multiple BlockIds of the same height.

    • The error type is the last successful checkpoint constructed (if any).

    -
    source

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    +

    pub fn from_header(header: &Header, height: u32) -> CheckPoint

    Construct a checkpoint from the given header and block height.

    If header is of the genesis block, the checkpoint won’t have a prev node. Otherwise, we return a checkpoint linked with the previous block.

    -
    source

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    +

    pub fn push(self, block: BlockId) -> Result<CheckPoint, CheckPoint>

    Puts another checkpoint onto the linked list representing the blockchain.

    Returns an Err(self) if the block you are pushing on is not at a greater height that the one you are pushing on to.

    -
    source

    pub fn extend( +

    pub fn extend( self, blocks: impl IntoIterator<Item = BlockId> ) -> Result<CheckPoint, CheckPoint>

    Extends the checkpoint linked list by a iterator of block ids.

    Returns an Err(self) if there is block which does not have a greater height than the previous one.

    -
    source

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    -
    source

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    -
    source

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    -
    source

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    -
    source

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    -
    source

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    +

    pub fn block_id(&self) -> BlockId

    Get the BlockId of the checkpoint.

    +

    pub fn height(&self) -> u32

    Get the height of the checkpoint.

    +

    pub fn hash(&self) -> BlockHash

    Get the block hash of the checkpoint.

    +

    pub fn prev(&self) -> Option<CheckPoint>

    Get the previous checkpoint in the chain

    +

    pub fn iter(&self) -> CheckPointIter ⓘ

    Iterate from this checkpoint in descending height.

    +

    pub fn get(&self, height: u32) -> Option<CheckPoint>

    Get checkpoint at height.

    Returns None if checkpoint at height does not exist`.

    -
    source

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where +

    pub fn range<R>(&self, range: R) -> impl Iterator<Item = CheckPoint>
    where R: RangeBounds<u32>,

    Iterate checkpoints over a height range.

    Note that we always iterate checkpoints in reverse height order (iteration starts at tip height).

    -
    source

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    +

    pub fn insert(self, block_id: BlockId) -> CheckPoint

    Inserts block_id at its height within the chain.

    The effect of insert depends on whether a height already exists. If it doesn’t the block_id we inserted and all pre-existing blocks higher than it will be re-inserted after it. If the height already existed and has a conflicting block hash then it will be purged @@ -44,8 +44,8 @@ along with all block following it. The returned chain will have a tip of the block_id was already present then this just returns self.

    §Panics

    This panics if called with a genesis block that differs from that of self.

    -
    source

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    -

    Trait Implementations§

    source§

    impl Clone for CheckPoint

    source§

    fn clone(&self) -> CheckPoint

    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 CheckPoint

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl IntoIterator for CheckPoint

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    type IntoIter = CheckPointIter

    Which kind of iterator are we turning this into?
    source§

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    source§

    impl PartialEq for CheckPoint

    source§

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

    This method tests for self and other values to be equal, and is used +

    pub fn eq_ptr(&self, other: &CheckPoint) -> bool

    This method tests for self and other to have equal internal pointers.

    +

    Trait Implementations§

    §

    impl Clone for CheckPoint

    §

    fn clone(&self) -> CheckPoint

    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 CheckPoint

    §

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

    Formats the value using the given formatter. Read more
    §

    impl IntoIterator for CheckPoint

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    type IntoIter = CheckPointIter

    Which kind of iterator are we turning this into?
    §

    fn into_iter(self) -> <CheckPoint as IntoIterator>::IntoIter

    Creates an iterator from a value. Read more
    §

    impl PartialEq for CheckPoint

    §

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

    This method tests for self and other values to be equal, and is used by ==.
    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.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

    impl<T> Borrow<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html index 975dce0d69..345880e1fa 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.CheckPointIter.html @@ -1,5 +1,5 @@ -CheckPointIter in bdk_chain - Rust

    Struct bdk_chain::CheckPointIter

    source · 
    pub struct CheckPointIter { /* private fields */ }
    Expand description

    Iterates over checkpoints backwards.

    -

    Trait Implementations§

    source§

    impl Iterator for CheckPointIter

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    source§

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>

    Advances the iterator and returns the next value. Read more
    source§

    fn next_chunk<const N: usize>( +CheckPointIter in bdk_chain - Rust

    Struct bdk_chain::CheckPointIter

    pub struct CheckPointIter { /* private fields */ }
    Expand description

    Iterates over checkpoints backwards.

    +

    Trait Implementations§

    §

    impl Iterator for CheckPointIter

    §

    type Item = CheckPoint

    The type of the elements being iterated over.
    §

    fn next(&mut self) -> Option<<CheckPointIter as Iterator>::Item>

    Advances the iterator and returns the next value. 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) -> usize
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html index 861ea07d32..c79de73d90 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.ConfirmationBlockTime.html @@ -1,27 +1,27 @@ -ConfirmationBlockTime in bdk_chain - Rust

    Struct bdk_chain::ConfirmationBlockTime

    source · 
    pub struct ConfirmationBlockTime {
+ConfirmationBlockTime in bdk_chain - Rust
    Struct bdk_chain::ConfirmationBlockTime
    pub struct ConfirmationBlockTime {
     pub block_id: BlockId,
     pub confirmation_time: u64,
 }
    Expand description
    Represents the confirmation block and time of a transaction.
    
 
    Fields§
    §block_id: BlockId
    The anchor block.
    
 
    §confirmation_time: u64
    The confirmation time of the transaction being anchored.
    
-
    Trait Implementations§
    source§
    impl Anchor for ConfirmationBlockTime
    source§
    fn anchor_block(&self) -> BlockId
    Returns the BlockId that the associated blockchain data is “anchored” in.
    source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    source§
    impl Clone for ConfirmationBlockTime
    source§
    fn clone(&self) -> ConfirmationBlockTime
    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 ConfirmationBlockTime
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl Default for ConfirmationBlockTime
    source§
    fn default() -> ConfirmationBlockTime
    Returns the “default value” for a type. Read more
    source§
    impl<'de> Deserialize<'de> for ConfirmationBlockTime
    source§
    fn deserialize<__D>(
+
    Trait Implementations§
    source§
    impl Anchor for ConfirmationBlockTime
    source§
    fn anchor_block(&self) -> BlockId
    Returns the BlockId that the associated blockchain data is “anchored” in.
    source§
    fn confirmation_height_upper_bound(&self) -> u32
    Get the upper bound of the chain data’s confirmation height. Read more
    §
    impl Clone for ConfirmationBlockTime
    §
    fn clone(&self) -> ConfirmationBlockTime
    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 ConfirmationBlockTime
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl Default for ConfirmationBlockTime
    §
    fn default() -> ConfirmationBlockTime
    Returns the “default value” for a type. Read more
    §
    impl<'de> Deserialize<'de> for ConfirmationBlockTime
    §
    fn deserialize<__D>(
     __deserializer: __D
 ) -> Result<ConfirmationBlockTime, <__D as Deserializer<'de>>::Error>
    where
-    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§
    impl<'b> From<TxPosInBlock<'b>> for ConfirmationBlockTime
    source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    source§
    impl Hash for ConfirmationBlockTime
    source§
    fn hash<__H>(&self, state: &mut __H)
    where
+    __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§
    impl<'b> From<TxPosInBlock<'b>> for ConfirmationBlockTime
    source§
    fn from(pos: TxPosInBlock<'_>) -> Self
    Converts to this type from the input type.
    §
    impl Hash for ConfirmationBlockTime
    §
    fn hash<__H>(&self, state: &mut __H)
    where
     __H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where
     H: Hasher,
-    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    source§
    impl Ord for ConfirmationBlockTime
    source§
    fn cmp(&self, other: &ConfirmationBlockTime) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where
+    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    §
    impl Ord for ConfirmationBlockTime
    §
    fn cmp(&self, other: &ConfirmationBlockTime) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where
     Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where
     Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where
-    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    source§
    impl PartialEq for ConfirmationBlockTime
    source§
    fn eq(&self, other: &ConfirmationBlockTime) -> bool
    This method tests for self and other values to be equal, and is used
+    Self: Sized + PartialOrd,

    Restrict a value to a certain interval. Read more
    §

    impl PartialEq for ConfirmationBlockTime

    §

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl PartialOrd for ConfirmationBlockTime

    source§

    fn partial_cmp(&self, other: &ConfirmationBlockTime) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= +sufficient, and should not be overridden without very good reason.
    §

    impl PartialOrd for ConfirmationBlockTime

    §

    fn partial_cmp(&self, other: &ConfirmationBlockTime) -> Option<Ordering>

    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§

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

    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§

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

    This method tests less than or equal to (for self and other) and is used by the <= operator. Read more
    1.0.0 · source§

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

    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§

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

    This method tests greater than or equal to (for self and other) and is used by the >= -operator. Read more
    source§

    impl Serialize for ConfirmationBlockTime

    source§

    fn serialize<__S>( +operator. Read more

    §

    impl Serialize for ConfirmationBlockTime

    §

    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 Copy for ConfirmationBlockTime

    source§

    impl Eq for ConfirmationBlockTime

    source§

    impl StructuralPartialEq for ConfirmationBlockTime

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where + __S: Serializer,

    Serialize this value into the given Serde serializer. Read more
    §

    impl Copy for ConfirmationBlockTime

    §

    impl Eq for ConfirmationBlockTime

    §

    impl StructuralPartialEq for ConfirmationBlockTime

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    §

    impl<Q, K> Equivalent<K> for Q
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html index 14bd9d64aa..2eaf7a4230 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.TxUpdate.html @@ -1,4 +1,4 @@ -TxUpdate in bdk_chain - Rust

    Struct bdk_chain::TxUpdate

    source · 
    pub struct TxUpdate<A = ()> {
+TxUpdate in bdk_chain - Rust
    Struct bdk_chain::TxUpdate
    pub struct TxUpdate<A = ()> {
     pub txs: Vec<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -14,16 +14,16 @@ the fee of a wallet transaction.
    
 confirmed.
    
 
    §seen_ats: HashMap<Txid, u64>
    Seen at times for transactions. This records when a transaction was most recently seen in
 the user’s mempool for the sake of tie-breaking other conflicting transactions.
    
-
    Implementations§
    source§
    impl<A> TxUpdate<A>
    where
-    A: Ord,
    source
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
+
    Implementations§
    §
    impl<A> TxUpdate<A>
    where
+    A: Ord,
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
     A2: Ord,
     F: FnMut(A) -> A2,
    Transforms the TxUpdate to have anchors (A) of another type (A2).
    
 
    This takes in a closure with signature FnMut(A) -> A2 which is called for each anchor to
 transform it.
    
-
    source
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
-
    Trait Implementations§
    source§
    impl<A> Clone for TxUpdate<A>
    where
-    A: Clone,
    source§
    fn clone(&self) -> TxUpdate<A>
    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<A> Debug for TxUpdate<A>
    where
-    A: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl<A> Default for TxUpdate<A>
    source§
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    source§
    impl<A> From<TxGraph<A>> for TxUpdate<A>
    source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    source§
    impl<A: Ord + Clone> From<TxUpdate<A>> for TxGraph<A>
    source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
+
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
+
    Trait Implementations§
    §
    impl<A> Clone for TxUpdate<A>
    where
+    A: Clone,
    §
    fn clone(&self) -> TxUpdate<A>
    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<A> Debug for TxUpdate<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for TxUpdate<A>
    §
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    source§
    impl<A> From<TxGraph<A>> for TxUpdate<A>
    source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    source§
    impl<A: Ord + Clone> From<TxUpdate<A>> for TxGraph<A>
    source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for TxUpdate<A>
    where
     A: Send,
    §
    impl<A> Sync for TxUpdate<A>
    where
     A: Sync,
    §
    impl<A> Unpin for TxUpdate<A>
    §
    impl<A> UnwindSafe for TxUpdate<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
index d8b33f2c57..68f054acce 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Merge.html
@@ -1,4 +1,4 @@
-Merge in bdk_chain - Rust
    Trait bdk_chain::Merge
    source · 
    pub trait Merge: Default {
+Merge in bdk_chain - Rust
    Trait bdk_chain::Merge
    pub trait Merge: Default {
     // Required methods
     fn merge(&mut self, other: Self);
     fn is_empty(&self) -> bool;
@@ -6,39 +6,39 @@
     // Provided method
     fn take(&mut self) -> Option<Self> { ... }
 }
    Expand description
    Trait that makes an object mergeable.
    
-
    Required Methods§
    source
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    
-
    source
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    
-
    Provided Methods§
    source
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    
-
    Object Safety§
    This trait is not object safe.
    Implementations on Foreign Types§
    source§
    impl Merge for ()
    source§
    fn merge(&mut self, _other: ())
    source§
    fn is_empty(&self) -> bool
    source§
    impl<K, V> Merge for BTreeMap<K, V>
    where
-    K: Ord,
    source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0> Merge for (T0,)
    where
-    T0: Merge,
    source§
    fn merge(&mut self, _other: (T0,))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1> Merge for (T0, T1)
    where
+
    Required Methods§
    fn merge(&mut self, other: Self)
    Merge another object of the same type onto self.
    
+
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    
+
    Provided Methods§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    
+
    Object Safety§
    This trait is not object safe.
    Implementations on Foreign Types§
    §
    impl Merge for ()
    §
    fn merge(&mut self, _other: ())
    §
    fn is_empty(&self) -> bool
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where
+    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    §
    fn is_empty(&self) -> bool
    §
    impl<T0> Merge for (T0,)
    where
+    T0: Merge,
    §
    fn merge(&mut self, _other: (T0,))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1> Merge for (T0, T1)
    where
     T0: Merge,
-    T1: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2> Merge for (T0, T1, T2)
    where
+    T1: Merge,
    §
    fn merge(&mut self, _other: (T0, T1))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2> Merge for (T0, T1, T2)
    where
     T0: Merge,
     T1: Merge,
-    T2: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3> Merge for (T0, T1, T2, T3)
    where
+    T2: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3> Merge for (T0, T1, T2, T3)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
-    T3: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4> Merge for (T0, T1, T2, T3, T4)
    where
+    T3: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4> Merge for (T0, T1, T2, T3, T4)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
-    T4: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5> Merge for (T0, T1, T2, T3, T4, T5)
    where
+    T4: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5> Merge for (T0, T1, T2, T3, T4, T5)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
     T4: Merge,
-    T5: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5, T6> Merge for (T0, T1, T2, T3, T4, T5, T6)
    where
+    T5: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6> Merge for (T0, T1, T2, T3, T4, T5, T6)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
     T3: Merge,
     T4: Merge,
     T5: Merge,
-    T6: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7> Merge for (T0, T1, T2, T3, T4, T5, T6, T7)
    where
+    T6: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7> Merge for (T0, T1, T2, T3, T4, T5, T6, T7)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -46,7 +46,7 @@
     T4: Merge,
     T5: Merge,
     T6: Merge,
-    T7: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
    where
+    T7: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -55,7 +55,7 @@
     T5: Merge,
     T6: Merge,
     T7: Merge,
-    T8: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
    where
+    T8: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -65,7 +65,7 @@
     T6: Merge,
     T7: Merge,
     T8: Merge,
-    T9: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
    where
+    T9: Merge,
    §
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9))
    §
    fn is_empty(&self) -> bool
    §
    impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Merge for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)
    where
     T0: Merge,
     T1: Merge,
     T2: Merge,
@@ -76,5 +76,5 @@
     T7: Merge,
     T8: Merge,
     T9: Merge,
-    T10: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10))
    source§
    fn is_empty(&self) -> bool
    source§
    impl<T> Merge for BTreeSet<T>
    where
-    T: Ord,
    source§
    fn merge(&mut self, other: BTreeSet<T>)
    source§
    fn is_empty(&self) -> bool
    Implementors§
    source§
    impl Merge for bdk_chain::indexer::keychain_txout::ChangeSet
    source§
    impl Merge for bdk_chain::local_chain::ChangeSet
    source§
    impl<A: Ord> Merge for bdk_chain::tx_graph::ChangeSet<A>
    source§
    impl<A: Anchor, IA: Merge> Merge for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>
    source§
    impl<T> Merge for Vec<T>
    
\ No newline at end of file
+    T10: Merge,

    §

    fn merge(&mut self, _other: (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10))

    §

    fn is_empty(&self) -> bool

    §

    impl<T> Merge for BTreeSet<T>
    where + T: Ord,

    §

    fn merge(&mut self, other: BTreeSet<T>)

    §

    fn is_empty(&self) -> bool

    Implementors§

    source§

    impl Merge for bdk_chain::indexer::keychain_txout::ChangeSet

    source§

    impl Merge for bdk_chain::local_chain::ChangeSet

    source§

    impl<A: Ord> Merge for bdk_chain::tx_graph::ChangeSet<A>

    source§

    impl<A: Anchor, IA: Merge> Merge for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>

    §

    impl<T> Merge for Vec<T>

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html index 70ae462e12..7208586956 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html @@ -32,7 +32,7 @@ transform it.

    Remember to call Self::init_sqlite_tables beforehand.

    Trait Implementations§

    source§

    impl<A: Clone> Clone for ChangeSet<A>

    source§

    fn clone(&self) -> ChangeSet<A>

    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<A: Debug> Debug for ChangeSet<A>

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<A> Default for ChangeSet<A>

    source§

    fn default() -> Self

    Returns the “default value” for a type. Read more
    source§

    impl<'de, A> Deserialize<'de> for ChangeSet<A>
    where A: Ord + Deserialize<'de>,

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>

    source§

    fn from(graph: ChangeSet<A>) -> Self

    Converts to this type from the input type.
    source§

    impl<A: Ord> Merge for ChangeSet<A>

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl<A: PartialEq> PartialEq for ChangeSet<A>

    source§

    fn eq(&self, other: &ChangeSet<A>) -> bool

    This method tests for self and other values to be equal, and is used + __D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>

    source§

    fn from(graph: ChangeSet<A>) -> Self

    Converts to this type from the input type.
    source§

    impl<A: Ord> Merge for ChangeSet<A>

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl<A: PartialEq> PartialEq for ChangeSet<A>

    source§

    fn eq(&self, other: &ChangeSet<A>) -> bool

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl<A> Serialize for ChangeSet<A>
    where A: Ord + Serialize,

    source§

    fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html index ce3d4183f9..1076de73e8 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxUpdate.html @@ -1,4 +1,4 @@ -TxUpdate in bdk_chain::tx_graph - Rust

    Struct bdk_chain::tx_graph::TxUpdate

    source · 
    pub struct TxUpdate<A = ()> {
+TxUpdate in bdk_chain::tx_graph - Rust
    Struct bdk_chain::tx_graph::TxUpdate
    pub struct TxUpdate<A = ()> {
     pub txs: Vec<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -14,16 +14,16 @@ the fee of a wallet transaction.
    
 confirmed.
    
 
    §seen_ats: HashMap<Txid, u64>
    Seen at times for transactions. This records when a transaction was most recently seen in
 the user’s mempool for the sake of tie-breaking other conflicting transactions.
    
-
    Implementations§
    source§
    impl<A> TxUpdate<A>
    where
-    A: Ord,
    source
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
+
    Implementations§
    §
    impl<A> TxUpdate<A>
    where
+    A: Ord,
    pub fn map_anchors<A2, F>(self, map: F) -> TxUpdate<A2>
    where
     A2: Ord,
     F: FnMut(A) -> A2,
    Transforms the TxUpdate to have anchors (A) of another type (A2).
    
 
    This takes in a closure with signature FnMut(A) -> A2 which is called for each anchor to
 transform it.
    
-
    source
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
-
    Trait Implementations§
    source§
    impl<A> Clone for TxUpdate<A>
    where
-    A: Clone,
    source§
    fn clone(&self) -> TxUpdate<A>
    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<A> Debug for TxUpdate<A>
    where
-    A: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    source§
    impl<A> Default for TxUpdate<A>
    source§
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    source§
    impl<A> From<TxGraph<A>> for TxUpdate<A>
    source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    source§
    impl<A: Ord + Clone> From<TxUpdate<A>> for TxGraph<A>
    source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
+
    pub fn extend(&mut self, other: TxUpdate<A>)
    Extend this update with other.
    
+
    Trait Implementations§
    §
    impl<A> Clone for TxUpdate<A>
    where
+    A: Clone,
    §
    fn clone(&self) -> TxUpdate<A>
    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<A> Debug for TxUpdate<A>
    where
+    A: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    §
    impl<A> Default for TxUpdate<A>
    §
    fn default() -> TxUpdate<A>
    Returns the “default value” for a type. Read more
    source§
    impl<A> From<TxGraph<A>> for TxUpdate<A>
    source§
    fn from(graph: TxGraph<A>) -> Self
    Converts to this type from the input type.
    source§
    impl<A: Ord + Clone> From<TxUpdate<A>> for TxGraph<A>
    source§
    fn from(update: TxUpdate<A>) -> Self
    Converts to this type from the input type.
    Auto Trait Implementations§
    §
    impl<A> Freeze for TxUpdate<A>
    §
    impl<A> RefUnwindSafe for TxUpdate<A>
    where
     A: RefUnwindSafe,
    §
    impl<A> Send for TxUpdate<A>
    where
     A: Send,
    §
    impl<A> Sync for TxUpdate<A>
    where
     A: Sync,
    §
    impl<A> Unpin for TxUpdate<A>
    §
    impl<A> UnwindSafe for TxUpdate<A>
    where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
index 887786be48..85d8a74bc0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.Indexed.html
@@ -1,2 +1,2 @@
-Indexed in bdk_chain - Rust
    Type Alias bdk_chain::Indexed
    source · 
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
+Indexed in bdk_chain - Rust
    Type Alias bdk_chain::Indexed
    pub type Indexed<T> = (u32, T);
    Expand description
    A tuple of keychain index and T representing the indexed value.
    
 
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
index 31eedd4dda..b488422e44 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/type.KeychainIndexed.html
@@ -1,2 +1,2 @@
-KeychainIndexed in bdk_chain - Rust
    Type Alias bdk_chain::KeychainIndexed
    source · 
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
+KeychainIndexed in bdk_chain - Rust
    Type Alias bdk_chain::KeychainIndexed
    pub type KeychainIndexed<K, T> = ((K, u32), T);
    Expand description
    A tuple of keychain K, derivation index (u32) and a T associated with them.
    
 
    
\ 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 4e677d468e..9f384f5071 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,17 +1,21 @@
 bdk_esplora - Rust
    Crate bdk_esplora
    source · 
    Expand description
    §BDK Esplora
    
 
    BDK Esplora extends esplora-client (with extension traits: EsploraExt and
 EsploraAsyncExt) to update bdk_chain structures from an Esplora server.
    
-
    The extension traits are primarily intended to satisfy SyncRequests with sync and
-FullScanRequests with full_scan.
    
+
    The extension traits are primarily intended to satisfy SyncRequests with sync and
+FullScanRequests with full_scan.
    
 
    §Usage
    
 
    For blocking-only:
    
-
    bdk_esplora = { version = "0.3", features = ["blocking"] }
+
    bdk_esplora = { version = "0.19", features = ["blocking"] }
 
    
 
    For async-only:
    
-
    bdk_esplora = { version = "0.3", features = ["async"] }
+
    bdk_esplora = { version = "0.19", features = ["async"] }
 
    
 
    For async-only (with https):
    
-
    bdk_esplora = { version = "0.3", features = ["async-https"] }
+
    You can additionally specify to use either rustls or native-tls, e.g. async-https-native, and this applies to both async and blocking features.
    
+
    bdk_esplora = { version = "0.19", features = ["async-https"] }
+
    
+
    For async-only (with tokio):
    
+
    bdk_esplora = { version = "0.19", features = ["async", "tokio"] }
 
    
 
    To use the extension traits:
    
 
@@ -22,7 +26,7 @@
 // for async
 #[cfg(feature = "async")]
 use bdk_esplora::EsploraAsyncExt;
    
-
    For full examples, refer to example-crates/wallet_esplora_blocking and example-crates/wallet_esplora_async.
    
+
    For full examples, refer to example_wallet_esplora_blocking and example_wallet_esplora_async.
    
 
    §Stop Gap
    
 
    EsploraExt::full_scan takes in a stop_gap input which is defined as the maximum number of
 consecutive unused script pubkeys to scan transactions for before stopping.
    
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 087bf53313..6f89970f68 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,70 +1,72 @@
-EsploraAsyncExt in bdk_esplora - Rust
    Trait bdk_esplora::EsploraAsyncExt
    source · 
    pub trait EsploraAsyncExt {
+EsploraAsyncExt in bdk_esplora - Rust
    Trait bdk_esplora::EsploraAsyncExt
    source · 
    pub trait EsploraAsyncExt {
     // Required methods
     fn full_scan<'life0, 'async_trait, K, R>(
         &'life0 self,
         request: R,
         stop_gap: usize,
         parallel_requests: usize
-    ) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
+    ) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
        where K: 'async_trait + Ord + Clone + Send,
-             R: 'async_trait + Into<FullScanRequest<K>> + Send,
+             R: 'async_trait + Into<FullScanRequest<K>> + Send,
              Self: 'async_trait,
              'life0: 'async_trait;
     fn sync<'life0, 'async_trait, I, R>(
         &'life0 self,
         request: R,
         parallel_requests: usize
-    ) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
+    ) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
        where I: 'async_trait + Send,
-             R: 'async_trait + Into<SyncRequest<I>> + Send,
+             R: 'async_trait + Into<SyncRequest<I>> + Send,
              Self: '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§
    source
    fn full_scan<'life0, 'async_trait, K, R>(
+
    Required Methods§
    source
    fn full_scan<'life0, 'async_trait, K, R>(
     &'life0 self,
     request: R,
     stop_gap: usize,
     parallel_requests: usize
-) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
     K: 'async_trait + Ord + Clone + Send,
-    R: 'async_trait + Into<FullScanRequest<K>> + Send,
+    R: 'async_trait + Into<FullScanRequest<K>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Scan keychain scripts for transactions against Esplora, returning an update that can be
 applied to the receiving structures.
    
 
    request provides the data required to perform a script-pubkey-based full scan
-(see FullScanRequest). The full scan for each keychain (K) stops after a gap of
+(see [FullScanRequest]). The full scan for each keychain (K) stops after a gap of
 stop_gap script pubkeys with no associated transactions. parallel_requests specifies
 the maximum number of HTTP requests to make in parallel.
    
 
    Refer to crate-level docs for more.
    
-
    source
    fn sync<'life0, 'async_trait, I, R>(
+
    source
    fn sync<'life0, 'async_trait, I, R>(
     &'life0 self,
     request: R,
     parallel_requests: usize
-) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
     I: 'async_trait + Send,
-    R: 'async_trait + Into<SyncRequest<I>> + Send,
+    R: 'async_trait + Into<SyncRequest<I>> + Send,
     Self: 'async_trait,
     'life0: 'async_trait,
    Sync a set of scripts, txids, and/or outpoints against Esplora.
    
 
    request provides the data required to perform a script-pubkey-based sync (see
-SyncRequest). parallel_requests specifies the maximum number of HTTP requests to make
+[SyncRequest]). parallel_requests specifies the maximum number of HTTP requests to make
 in parallel.
    
 
    Refer to crate-level docs for more.
    
-
    Object Safety§
    This trait is not object safe.
    Implementations on Foreign Types§
    source§
    impl EsploraAsyncExt for AsyncClient
    source§
    fn full_scan<'life0, 'async_trait, K, R>(
+
    Object Safety§
    This trait is not object safe.
    Implementations on Foreign Types§
    source§
    impl<S> EsploraAsyncExt for AsyncClient<S>
    where
+    S: Sleeper + Clone + Send + Sync,
+    S::Sleep: Send,
    source§
    fn full_scan<'life0, 'async_trait, K, R>(
     &'life0 self,
     request: R,
     stop_gap: usize,
     parallel_requests: usize
-) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<FullScanResponse<K>, Box<Error>>> + Send + 'async_trait>>
    where
     K: 'async_trait + Ord + Clone + Send,
-    R: 'async_trait + Into<FullScanRequest<K>> + Send,
+    R: 'async_trait + Into<FullScanRequest<K>> + Send,
     Self: 'async_trait,
-    'life0: 'async_trait,
    source§
    fn sync<'life0, 'async_trait, I, R>(
+    'life0: 'async_trait,
    source§
    fn sync<'life0, 'async_trait, I, R>(
     &'life0 self,
     request: R,
     parallel_requests: usize
-) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
+) -> Pin<Box<dyn Future<Output = Result<SyncResponse, Box<Error>>> + Send + 'async_trait>>
    where
     I: 'async_trait + Send,
-    R: 'async_trait + Into<SyncRequest<I>> + Send,
+    R: 'async_trait + Into<SyncRequest<I>> + 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 a7dab56d33..bdf10157d7 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,46 +1,46 @@ EsploraExt in bdk_esplora - Rust

    Trait bdk_esplora::EsploraExt

    source · 
    pub trait EsploraExt {
     // Required methods
-    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
+    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>(
         &self,
         request: R,
         stop_gap: usize,
         parallel_requests: usize
-    ) -> Result<FullScanResponse<K>, Error>;
-    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
+    ) -> Result<FullScanResponse<K>, Error>;
+    fn sync<I: 'static, R: Into<SyncRequest<I>>>(
         &self,
         request: R,
         parallel_requests: usize
-    ) -> Result<SyncResponse, Error>;
+    ) -> Result<SyncResponse, Error>;
 }
    Expand description

    Trait to extend the functionality of [esplora_client::BlockingClient].

    Refer to crate-level documentation for more.

    -

    Required Methods§

    source

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( +

    Required Methods§

    source

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( &self, request: R, stop_gap: usize, parallel_requests: usize -) -> Result<FullScanResponse<K>, Error>

    Scan keychain scripts for transactions against Esplora, returning an update that can be +) -> Result<FullScanResponse<K>, Error>

    Scan keychain scripts for transactions against Esplora, returning an update that can be applied to the receiving structures.

    request provides the data required to perform a script-pubkey-based full scan -(see FullScanRequest). The full scan for each keychain (K) stops after a gap of +(see [FullScanRequest]). The full scan for each keychain (K) stops after a gap of stop_gap script pubkeys with no associated transactions. parallel_requests specifies the maximum number of HTTP requests to make in parallel.

    Refer to crate-level docs for more.

    -
    source

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( +

    source

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( &self, request: R, parallel_requests: usize -) -> Result<SyncResponse, Error>

    Sync a set of scripts, txids, and/or outpoints against Esplora.

    +) -> Result<SyncResponse, Error>

    Sync a set of scripts, txids, and/or outpoints against Esplora.

    request provides the data required to perform a script-pubkey-based sync (see -SyncRequest). parallel_requests specifies the maximum number of HTTP requests to make +[SyncRequest]). parallel_requests specifies the maximum number of HTTP requests to make in parallel.

    Refer to crate-level docs for more.

    -

    Object Safety§

    This trait is not object safe.

    Implementations on Foreign Types§

    source§

    impl EsploraExt for BlockingClient

    source§

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( +

    Object Safety§

    This trait is not object safe.

    Implementations on Foreign Types§

    source§

    impl EsploraExt for BlockingClient

    source§

    fn full_scan<K: Ord + Clone, R: Into<FullScanRequest<K>>>( &self, request: R, stop_gap: usize, parallel_requests: usize -) -> Result<FullScanResponse<K>, Error>

    source§

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( +) -> Result<FullScanResponse<K>, Error>

    source§

    fn sync<I: 'static, R: Into<SyncRequest<I>>>( &self, request: R, parallel_requests: usize -) -> Result<SyncResponse, Error>

    Implementors§

    \ No newline at end of file +) -> Result<SyncResponse, Error>

    Implementors§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html index a47fcf50ab..0311cc213e 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_file_store/struct.Store.html @@ -5,7 +5,7 @@ BDK version upgrades so should not be used in production.

    Implementations§

    source§

    impl<C> Store<C>
    where - C: Merge + Serialize + DeserializeOwned + Send + Sync,

    source

    pub fn create_new<P>(magic: &[u8], file_path: P) -> Result<Self, FileError>
    where + C: Merge + Serialize + DeserializeOwned + Send + Sync,

    source

    pub fn create_new<P>(magic: &[u8], file_path: P) -> Result<Self, FileError>
    where P: AsRef<Path>,

    Create a new Store file in write-only mode; error if the file exists.

    magic is the prefixed bytes to write to the new file. This will be checked when opening the Store in the future with open.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html index ab58cb1f45..c919235a60 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/index.html @@ -1,2 +1,2 @@ -bdk_testenv - Rust

    Crate bdk_testenv

    source ·

    Re-exports§

    • pub use electrsd;
    • pub use electrsd::bitcoind;
    • pub use electrsd::bitcoind::anyhow;
    • pub use electrsd::bitcoind::bitcoincore_rpc;
    • pub use electrsd::electrum_client;

    Modules§

    Macros§

    Structs§

    • Config
      Configuration parameters.
    • TestEnv
      Struct for running a regtest environment with a single bitcoind node with an electrs +bdk_testenv - Rust

      Crate bdk_testenv

      source ·

      Re-exports§

      • pub use electrsd;
      • pub use electrsd::bitcoind;
      • pub use electrsd::bitcoind::anyhow;
      • pub use electrsd::bitcoind::bitcoincore_rpc;
      • pub use electrsd::electrum_client;

      Modules§

      Macros§

      Structs§

      • Config
        Configuration parameters.
      • TestEnv
        Struct for running a regtest environment with a single bitcoind node with an electrs instance connected to it.
      \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/struct.TestEnv.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/struct.TestEnv.html index 0123309ef4..45ccbe9f76 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/struct.TestEnv.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_testenv/struct.TestEnv.html @@ -3,39 +3,39 @@ pub electrsd: ElectrsD, }
      Expand description

      Struct for running a regtest environment with a single bitcoind node with an electrs instance connected to it.

      -

      Fields§

      §bitcoind: BitcoinD§electrsd: ElectrsD

      Implementations§

      source§

      impl TestEnv

      source

      pub fn new() -> Result<Self>

      Construct a new TestEnv instance with the default configuration used by BDK.

      -
      source

      pub fn new_with_config(config: Config<'_>) -> Result<Self>

      Construct a new TestEnv instance with the provided Config.

      +

      Fields§

      §bitcoind: BitcoinD§electrsd: ElectrsD

      Implementations§

      source§

      impl TestEnv

      source

      pub fn new() -> Result<Self>

      Construct a new TestEnv instance with the default configuration used by BDK.

      +
      source

      pub fn new_with_config(config: Config<'_>) -> Result<Self>

      Construct a new TestEnv instance with the provided Config.

      source

      pub fn electrum_client(&self) -> &impl ElectrumApi

      Exposes the [ElectrumApi] calls from the Electrum client.

      source

      pub fn rpc_client(&self) -> &impl RpcApi

      Exposes the [RpcApi] calls from [bitcoincore_rpc].

      -
      source

      pub fn reset_electrsd(self) -> Result<Self>

      source

      pub fn mine_blocks( +

      source

      pub fn reset_electrsd(self) -> Result<Self>

      source

      pub fn mine_blocks( &self, count: usize, address: Option<Address> -) -> Result<Vec<BlockHash>>

      Mine a number of blocks of a given size count, which may be specified to a given coinbase +) -> Result<Vec<BlockHash>>

    Mine a number of blocks of a given size count, which may be specified to a given coinbase address.

    -
    source

    pub fn mine_empty_block(&self) -> Result<(usize, BlockHash)>

    Mine a block that is guaranteed to be empty even with transactions in the mempool.

    -
    source

    pub fn wait_until_electrum_sees_block(&self, timeout: Duration) -> Result<()>

    This method waits for the Electrum notification indicating that a new block has been mined. +

    source

    pub fn mine_empty_block(&self) -> Result<(usize, BlockHash)>

    Mine a block that is guaranteed to be empty even with transactions in the mempool.

    +
    source

    pub fn wait_until_electrum_sees_block(&self, timeout: Duration) -> Result<()>

    This method waits for the Electrum notification indicating that a new block has been mined. timeout is the maximum Duration we want to wait for a response from Electrsd.

    source

    pub fn wait_until_electrum_sees_txid( &self, txid: Txid, timeout: Duration -) -> Result<()>

    This method waits for Electrsd to see a transaction with given txid. timeout is the +) -> Result<()>

    This method waits for Electrsd to see a transaction with given txid. timeout is the maximum Duration we want to wait for a response from Electrsd.

    -
    source

    pub fn invalidate_blocks(&self, count: usize) -> Result<()>

    Invalidate a number of blocks of a given size count.

    -
    source

    pub fn reorg(&self, count: usize) -> Result<Vec<BlockHash>>

    Reorg a number of blocks of a given size count. +

    source

    pub fn invalidate_blocks(&self, count: usize) -> Result<()>

    Invalidate a number of blocks of a given size count.

    +
    source

    pub fn reorg(&self, count: usize) -> Result<Vec<BlockHash>>

    Reorg a number of blocks of a given size count. Refer to TestEnv::mine_empty_block for more information.

    source

    pub fn reorg_empty_blocks( &self, count: usize -) -> Result<Vec<(usize, BlockHash)>>

    Reorg with a number of empty blocks of a given size count.

    +) -> Result<Vec<(usize, BlockHash)>>

    Reorg with a number of empty blocks of a given size count.

    source

    pub fn send( &self, address: &Address<NetworkChecked>, amount: Amount -) -> Result<Txid>

    Send a tx of a given amount to a given address.

    +) -> Result<Txid>

    Send a tx of a given amount to a given address.

    source

    pub fn make_checkpoint_tip(&self) -> CheckPoint

    Create a checkpoint linked list of all the blocks in the chain.

    -
    source

    pub fn genesis_hash(&self) -> Result<BlockHash>

    Get the genesis hash of the blockchain.

    +
    source

    pub fn genesis_hash(&self) -> Result<BlockHash>

    Get the genesis hash of the blockchain.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

    impl<T> BorrowMut<T> for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.ChangeSet.html index 04e552dbd9..e866bc030d 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.ChangeSet.html @@ -3,14 +3,14 @@ pub change_descriptor: Option<Descriptor<DescriptorPublicKey>>, pub network: Option<Network>, pub local_chain: ChangeSet, - pub tx_graph: ChangeSet<ConfirmationBlockTime>, + pub tx_graph: ChangeSet<ConfirmationBlockTime>, pub indexer: ChangeSet, }
    Expand description

    A changeset for Wallet.

    Fields§

    §descriptor: Option<Descriptor<DescriptorPublicKey>>

    Descriptor for recipient addresses.

    §change_descriptor: Option<Descriptor<DescriptorPublicKey>>

    Descriptor for change addresses.

    §network: Option<Network>

    Stores the network type of the transaction data.

    §local_chain: ChangeSet

    Changes to the LocalChain.

    -
    §tx_graph: ChangeSet<ConfirmationBlockTime>

    Changes to TxGraph.

    +
    §tx_graph: ChangeSet<ConfirmationBlockTime>

    Changes to TxGraph.

    §indexer: ChangeSet

    Changes to KeychainTxOutIndex.

    Implementations§

    source§

    impl ChangeSet

    source

    pub const WALLET_SCHEMA_NAME: &'static str = "bdk_wallet"

    Schema name for wallet.

    source

    pub const WALLET_TABLE_NAME: &'static str = "bdk_wallet"

    Name of table to store wallet descriptors and network.

    @@ -18,8 +18,8 @@
    source

    pub fn from_sqlite(db_tx: &Transaction<'_>) -> Result<Self>

    Recover a ChangeSet from sqlite database.

    source

    pub fn persist_to_sqlite(&self, db_tx: &Transaction<'_>) -> Result<()>

    Persist ChangeSet to sqlite database.

    Trait Implementations§

    source§

    impl Clone for ChangeSet

    source§

    fn clone(&self) -> ChangeSet

    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 ChangeSet

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for ChangeSet

    source§

    fn default() -> ChangeSet

    Returns the “default value” for a type. Read more
    source§

    impl<'de> Deserialize<'de> for ChangeSet

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet

    source§

    fn from(tx_graph: ChangeSet<ConfirmationBlockTime>) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet

    source§

    fn from(indexed_tx_graph: ChangeSet<ConfirmationBlockTime, ChangeSet>) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet> for ChangeSet

    source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet> for ChangeSet

    source§

    fn from(chain: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another ChangeSet into itself.

    -
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used + __D: Deserializer<'de>,

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet

    source§

    fn from(tx_graph: ChangeSet<ConfirmationBlockTime>) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet

    source§

    fn from(indexed_tx_graph: ChangeSet<ConfirmationBlockTime, ChangeSet>) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet> for ChangeSet

    source§

    fn from(indexer: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl From<ChangeSet> for ChangeSet

    source§

    fn from(chain: ChangeSet) -> Self

    Converts to this type from the input type.
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another ChangeSet into itself.

    +
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl Serialize for ChangeSet

    source§

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

    Serialize this value into the given Serde serializer. Read more
    source§

    impl StructuralPartialEq for ChangeSet

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html index 35240c0187..e7312b6660 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.LocalOutput.html @@ -4,14 +4,14 @@ pub keychain: KeychainKind, pub is_spent: bool, pub derivation_index: u32, - pub chain_position: ChainPosition<ConfirmationBlockTime>, + pub chain_position: ChainPosition<ConfirmationBlockTime>, }
    Expand description

    An unspent output owned by a Wallet.

    Fields§

    §outpoint: OutPoint

    Reference to a transaction output

    §txout: TxOut

    Transaction output

    §keychain: KeychainKind

    Type of keychain

    §is_spent: bool

    Whether this UTXO is spent or not

    §derivation_index: u32

    The derivation index for the script pubkey in the wallet

    -
    §chain_position: ChainPosition<ConfirmationBlockTime>

    The position of the output in the blockchain.

    +
    §chain_position: ChainPosition<ConfirmationBlockTime>

    The position of the output in the blockchain.

    Trait Implementations§

    source§

    impl Clone for LocalOutput

    source§

    fn clone(&self) -> LocalOutput

    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 LocalOutput

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<'de> Deserialize<'de> for LocalOutput

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl Hash for LocalOutput

    source§

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

    Feeds this value into the given Hasher. Read more
    1.3.0 · source§

    fn hash_slice<H>(data: &[Self], state: &mut H)
    where H: Hasher, diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html index 2a16fd9f3f..958462a61a 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.PersistedWallet.html @@ -104,11 +104,11 @@ by using
    source

    pub fn list_unspent(&self) -> impl Iterator<Item = LocalOutput> + '_

    Return the list of unspent outputs of this wallet

    source

    pub fn list_output(&self) -> impl Iterator<Item = LocalOutput> + '_

    List all relevant outputs (includes both spent and unspent, confirmed and unconfirmed).

    To list only unspent outputs (UTXOs), use Wallet::list_unspent instead.

    -
    source

    pub fn checkpoints(&self) -> CheckPointIter

    Get all the checkpoints the wallet is currently storing indexed by height.

    -
    source

    pub fn latest_checkpoint(&self) -> CheckPoint

    Returns the latest checkpoint.

    +
    source

    pub fn checkpoints(&self) -> CheckPointIter

    Get all the checkpoints the wallet is currently storing indexed by height.

    +
    source

    pub fn latest_checkpoint(&self) -> CheckPoint

    Returns the latest checkpoint.

    source

    pub fn all_unbounded_spk_iters( &self -) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>

    Get unbounded script pubkey iterators for both Internal and External keychains.

    +) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>

    Get unbounded script pubkey iterators for both Internal and External keychains.

    This is intended 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. electrum server) which will go through each address until it reaches a stop gap.

    @@ -117,7 +117,7 @@ script pubkeys the wallet is storing internally).

    source

    pub fn unbounded_spk_iter( &self, keychain: KeychainKind -) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone

    Get an unbounded script pubkey iterator for the given keychain.

    +) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone

    Get an unbounded script pubkey iterator for the given keychain.

    See all_unbounded_spk_iters for more documentation

    source

    pub fn get_utxo(&self, op: OutPoint) -> Option<LocalOutput>

    Returns the utxo owned by this wallet corresponding to outpoint if it exists in the wallet’s database.

    @@ -362,7 +362,7 @@ the current time.

    source

    pub fn staged(&self) -> Option<&ChangeSet>

    Get a reference of the staged ChangeSet that is yet to be committed (if any).

    source

    pub fn staged_mut(&mut self) -> Option<&mut ChangeSet>

    Get a mutable reference of the staged ChangeSet that is yet to be committed (if any).

    source

    pub fn take_staged(&mut self) -> Option<ChangeSet>

    Take the staged ChangeSet to be persisted now (if any).

    -
    source

    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>

    Get a reference to the inner [TxGraph].

    +
    source

    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>

    Get a reference to the inner [TxGraph].

    source

    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>

    Get a reference to the inner [KeychainTxOutIndex].

    source

    pub fn local_chain(&self) -> &LocalChain

    Get a reference to the inner [LocalChain].

    source

    pub fn apply_block( @@ -377,7 +377,7 @@ with prev_blockhash and height-1 as the connecte &mut self, block: &Block, height: u32, - connected_to: BlockId + connected_to: BlockId ) -> Result<(), ApplyHeaderError>

    Applies relevant transactions from block of height to the wallet, and connects the block to the internal chain.

    The connected_to parameter informs the wallet how this block connects to the internal @@ -400,13 +400,13 @@ if you need the applied unconfirmed transactions to be reloaded after closing th See Wallet::reveal_next_address.

    source

    pub fn start_sync_with_revealed_spks( &self -) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial SyncRequest for this wallet for all revealed spks.

    +) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial [SyncRequest] for this wallet for all revealed spks.

    This is the first step when performing a spk-based wallet partial sync, the returned -SyncRequest collects all revealed script pubkeys from the wallet keychain needed to +[SyncRequest] collects all revealed script pubkeys from the wallet keychain needed to start a blockchain sync with a spk based blockchain client.

    -
    source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a `FullScanRequest for this wallet.

    +
    source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a [`FullScanRequest] for this wallet.

    This is the first step when performing a spk-based wallet full scan, the returned -`FullScanRequest collects iterators for the wallet’s keychain script pub keys needed to +[`FullScanRequest] collects iterators for the wallet’s keychain script pub keys needed to start a blockchain full scan with a spk based blockchain client.

    This operation is generally only used when importing or restoring a previously used wallet in which the list of used scripts is not known.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html index 7d17061bf7..9f5b6a3247 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.Update.html @@ -1,14 +1,14 @@ Update in bdk_wallet - Rust

    Struct bdk_wallet::Update

    source · 
    pub struct Update {
     pub last_active_indices: BTreeMap<KeychainKind, u32>,
-    pub tx_update: TxUpdate<ConfirmationBlockTime>,
-    pub chain: Option<CheckPoint>,
+    pub tx_update: TxUpdate<ConfirmationBlockTime>,
+    pub chain: Option<CheckPoint>,
 }
    Expand description

    An update to Wallet.

    It updates [KeychainTxOutIndex], [bdk_chain::TxGraph] and [LocalChain] atomically.

    Fields§

    §last_active_indices: BTreeMap<KeychainKind, u32>

    Contains the last active derivation indices per keychain (K), which is used to update the [KeychainTxOutIndex].

    -
    §tx_update: TxUpdate<ConfirmationBlockTime>

    Update for the wallet’s internal [TxGraph].

    -
    §chain: Option<CheckPoint>

    Update for the wallet’s internal [LocalChain].

    -

    Trait Implementations§

    source§

    impl Clone for Update

    source§

    fn clone(&self) -> Update

    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 Update

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for Update

    source§

    fn default() -> Update

    Returns the “default value” for a type. Read more
    source§

    impl From<FullScanResponse<KeychainKind>> for Update

    source§

    fn from(value: FullScanResponse<KeychainKind>) -> Self

    Converts to this type from the input type.
    source§

    impl From<SyncResponse> for Update

    source§

    fn from(value: SyncResponse) -> Self

    Converts to this type from the input type.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +
    §tx_update: TxUpdate<ConfirmationBlockTime>

    Update for the wallet’s internal [TxGraph].

    +
    §chain: Option<CheckPoint>

    Update for the wallet’s internal [LocalChain].

    +

    Trait Implementations§

    source§

    impl Clone for Update

    source§

    fn clone(&self) -> Update

    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 Update

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for Update

    source§

    fn default() -> Update

    Returns the “default value” for a type. Read more
    source§

    impl From<FullScanResponse<KeychainKind>> for Update

    source§

    fn from(value: FullScanResponse<KeychainKind>) -> Self

    Converts to this type from the input type.
    source§

    impl From<SyncResponse> for Update

    source§

    fn from(value: SyncResponse) -> Self

    Converts to this type from the input type.

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    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 479a01abcc..f9dff4e040 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 @@ -147,11 +147,11 @@ by using
    source

    pub fn list_unspent(&self) -> impl Iterator<Item = LocalOutput> + '_

    Return the list of unspent outputs of this wallet

    source

    pub fn list_output(&self) -> impl Iterator<Item = LocalOutput> + '_

    List all relevant outputs (includes both spent and unspent, confirmed and unconfirmed).

    To list only unspent outputs (UTXOs), use Wallet::list_unspent instead.

    -
    source

    pub fn checkpoints(&self) -> CheckPointIter

    Get all the checkpoints the wallet is currently storing indexed by height.

    -
    source

    pub fn latest_checkpoint(&self) -> CheckPoint

    Returns the latest checkpoint.

    +
    source

    pub fn checkpoints(&self) -> CheckPointIter

    Get all the checkpoints the wallet is currently storing indexed by height.

    +
    source

    pub fn latest_checkpoint(&self) -> CheckPoint

    Returns the latest checkpoint.

    source

    pub fn all_unbounded_spk_iters( &self -) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>

    Get unbounded script pubkey iterators for both Internal and External keychains.

    +) -> BTreeMap<KeychainKind, impl Iterator<Item = Indexed<ScriptBuf>> + Clone>

    Get unbounded script pubkey iterators for both Internal and External keychains.

    This is intended 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. electrum server) which will go through each address until it reaches a stop gap.

    @@ -160,7 +160,7 @@ script pubkeys the wallet is storing internally).

    source

    pub fn unbounded_spk_iter( &self, keychain: KeychainKind -) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone

    Get an unbounded script pubkey iterator for the given keychain.

    +) -> impl Iterator<Item = Indexed<ScriptBuf>> + Clone

    Get an unbounded script pubkey iterator for the given keychain.

    See all_unbounded_spk_iters for more documentation

    source

    pub fn get_utxo(&self, op: OutPoint) -> Option<LocalOutput>

    Returns the utxo owned by this wallet corresponding to outpoint if it exists in the wallet’s database.

    @@ -405,7 +405,7 @@ the current time.

    source

    pub fn staged(&self) -> Option<&ChangeSet>

    Get a reference of the staged ChangeSet that is yet to be committed (if any).

    source

    pub fn staged_mut(&mut self) -> Option<&mut ChangeSet>

    Get a mutable reference of the staged ChangeSet that is yet to be committed (if any).

    source

    pub fn take_staged(&mut self) -> Option<ChangeSet>

    Take the staged ChangeSet to be persisted now (if any).

    -
    source

    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>

    Get a reference to the inner [TxGraph].

    +
    source

    pub fn tx_graph(&self) -> &TxGraph<ConfirmationBlockTime>

    Get a reference to the inner [TxGraph].

    source

    pub fn spk_index(&self) -> &KeychainTxOutIndex<KeychainKind>

    Get a reference to the inner [KeychainTxOutIndex].

    source

    pub fn local_chain(&self) -> &LocalChain

    Get a reference to the inner [LocalChain].

    source

    pub fn apply_block( @@ -420,7 +420,7 @@ with prev_blockhash and height-1 as the connecte &mut self, block: &Block, height: u32, - connected_to: BlockId + connected_to: BlockId ) -> Result<(), ApplyHeaderError>

    Applies relevant transactions from block of height to the wallet, and connects the block to the internal chain.

    The connected_to parameter informs the wallet how this block connects to the internal @@ -444,17 +444,17 @@ See

    source§

    impl Wallet

    Methods to construct sync/full-scan requests for spk-based chain sources.

    source

    pub fn start_sync_with_revealed_spks( &self -) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial SyncRequest for this wallet for all revealed spks.

    +) -> SyncRequestBuilder<(KeychainKind, u32)>

    Create a partial [SyncRequest] for this wallet for all revealed spks.

    This is the first step when performing a spk-based wallet partial sync, the returned -SyncRequest collects all revealed script pubkeys from the wallet keychain needed to +[SyncRequest] collects all revealed script pubkeys from the wallet keychain needed to start a blockchain sync with a spk based blockchain client.

    -
    source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a `FullScanRequest for this wallet.

    +
    source

    pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>

    Create a [`FullScanRequest] for this wallet.

    This is the first step when performing a spk-based wallet full scan, the returned -`FullScanRequest collects iterators for the wallet’s keychain script pub keys needed to +[`FullScanRequest] collects iterators for the wallet’s keychain script pub keys needed to start a blockchain full scan with a spk based blockchain client.

    This operation is generally only used when importing or restoring a previously used wallet in which the list of used scripts is not known.

    -

    Trait Implementations§

    source§

    impl AsRef<TxGraph<ConfirmationBlockTime>> for Wallet

    source§

    fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>

    Converts this type into a shared reference of the (usually inferred) input type.
    source§

    impl Debug for Wallet

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl !Freeze for Wallet

    §

    impl !RefUnwindSafe for Wallet

    §

    impl Send for Wallet

    §

    impl Sync for Wallet

    §

    impl Unpin for Wallet

    §

    impl !UnwindSafe for Wallet

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +

    Trait Implementations§

    source§

    impl AsRef<TxGraph<ConfirmationBlockTime>> for Wallet

    source§

    fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>

    Converts this type into a shared reference of the (usually inferred) input type.
    source§

    impl Debug for Wallet

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    §

    impl !Freeze for Wallet

    §

    impl !RefUnwindSafe for Wallet

    §

    impl Send for Wallet

    §

    impl Sync for Wallet

    §

    impl Unpin for Wallet

    §

    impl !UnwindSafe for Wallet

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html index e80cc9b85a..c2cbc3f709 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html @@ -1,7 +1,7 @@ -WalletTx in bdk_wallet - Rust

    Type Alias bdk_wallet::WalletTx

    source · 
    pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
    Expand description

    A CanonicalTx managed by a Wallet.

    +WalletTx in bdk_wallet - Rust

    Type Alias bdk_wallet::WalletTx

    source · 
    pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
    Expand description

    A CanonicalTx managed by a Wallet.

    Aliased Type§

    struct WalletTx<'a> {
-    pub chain_position: ChainPosition<&'a ConfirmationBlockTime>,
-    pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>,
-}

    Fields§

    §chain_position: ChainPosition<&'a ConfirmationBlockTime>

    How the transaction is observed as (confirmed or unconfirmed).

    -
    §tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>

    The transaction node (as part of the graph).

    + pub chain_position: ChainPosition<&'a ConfirmationBlockTime>, + pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>, +}

    Fields§

    §chain_position: ChainPosition<&'a ConfirmationBlockTime>

    How the transaction is observed as (confirmed or unconfirmed).

    +
    §tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>

    The transaction node (as part of the graph).

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html index 70955b3189..65ef732aa4 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html @@ -1,2 +1,2 @@ -CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust

    Constant example_bitcoind_rpc_polling::CHANNEL_BOUND

    source · 
    pub(crate) const CHANNEL_BOUND: usize = 10;
    Expand description

    The mpsc channel bound for emissions from Emitter.

    +CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust

    Constant example_bitcoind_rpc_polling::CHANNEL_BOUND

    source · 
    pub(crate) const CHANNEL_BOUND: usize = 10;
    Expand description

    The mpsc channel bound for emissions from [Emitter].

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html index 6f474e84c7..49b57eb900 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html @@ -1,8 +1,8 @@ Emission in example_bitcoind_rpc_polling - Rust

    Enum example_bitcoind_rpc_polling::Emission

    source · 
    pub(crate) enum Emission {
-    Block(BlockEvent<Block>),
+    Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
     Tip(u32),
-}

    Variants§

    §

    Block(BlockEvent<Block>)

    §

    Mempool(Vec<(Transaction, u64)>)

    §

    Tip(u32)

    Trait Implementations§

    source§

    impl Debug for Emission

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +}

    Variants§

    §

    Block(BlockEvent<Block>)

    §

    Mempool(Vec<(Transaction, u64)>)

    §

    Tip(u32)

    Trait Implementations§

    source§

    impl Debug for Emission

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html index 8ee6177e97..dbec0c6421 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html @@ -1 +1 @@ -main in example_bitcoind_rpc_polling - Rust

    Function example_bitcoind_rpc_polling::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file +main in example_bitcoind_rpc_polling - Rust

    Function example_bitcoind_rpc_polling::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html index 3c7d8101c7..a9bfb2c0f0 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html @@ -1 +1 @@ -example_bitcoind_rpc_polling - Rust

    Crate example_bitcoind_rpc_polling

    source ·

    Structs§

    Enums§

    Constants§

    Functions§

    \ No newline at end of file +example_bitcoind_rpc_polling - Rust

    Crate example_bitcoind_rpc_polling

    source ·

    Structs§

    Enums§

    Constants§

    Functions§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html index 76506401e0..1413d5bf90 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html @@ -9,7 +9,7 @@
    §rpc_user: Option<String>

    RPC auth username

    §rpc_password: Option<String>

    RPC auth password

    §fallback_height: u32

    Starting block height to fallback to if no point of agreement if found

    -

    Implementations§

    source§

    impl RpcArgs

    source

    pub(crate) fn new_client(&self) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for RpcArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via +

    Implementations§

    source§

    impl RpcArgs

    source

    pub(crate) fn new_client(&self) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for RpcArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via [FromArgMatches::from_arg_matches_mut] Read more
    source§

    fn augment_args_for_update<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate self via [FromArgMatches::update_from_arg_matches_mut] Read more
    source§

    impl Clone for RpcArgs

    source§

    fn clone(&self) -> RpcArgs

    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 RpcArgs

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl From<RpcArgs> for Auth

    source§

    fn from(args: RpcArgs) -> Self

    Converts to this type from the input type.
    source§

    impl FromArgMatches for RpcArgs

    source§

    fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>

    Instantiate Self from [ArgMatches], parsing the arguments as needed. Read more
    source§

    fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html index c496a04158..e4f2379f88 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html @@ -4,7 +4,7 @@ OldestFirst, NewestFirst, BranchAndBound, -}

    Variants§

    §

    LargestFirst

    §

    SmallestFirst

    §

    OldestFirst

    §

    NewestFirst

    §

    BranchAndBound

    Trait Implementations§

    source§

    impl Clone for CoinSelectionAlgo

    source§

    fn clone(&self) -> CoinSelectionAlgo

    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 CoinSelectionAlgo

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for CoinSelectionAlgo

    source§

    fn default() -> CoinSelectionAlgo

    Returns the “default value” for a type. Read more
    source§

    impl Display for CoinSelectionAlgo

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl FromStr for CoinSelectionAlgo

    §

    type Err = Error

    The associated error which can be returned from parsing.
    source§

    fn from_str(s: &str) -> Result<Self, Self::Err>

    Parses a string s to return a value of this type. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +}

    Variants§

    §

    LargestFirst

    §

    SmallestFirst

    §

    OldestFirst

    §

    NewestFirst

    §

    BranchAndBound

    Trait Implementations§

    source§

    impl Clone for CoinSelectionAlgo

    source§

    fn clone(&self) -> CoinSelectionAlgo

    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 CoinSelectionAlgo

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for CoinSelectionAlgo

    source§

    fn default() -> CoinSelectionAlgo

    Returns the “default value” for a type. Read more
    source§

    impl Display for CoinSelectionAlgo

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl FromStr for CoinSelectionAlgo

    §

    type Err = Error

    The associated error which can be returned from parsing.
    source§

    fn from_str(s: &str) -> Result<Self, Self::Err>

    Parses a string s to return a value of this type. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html index 78fe400f95..1ac5600d93 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html @@ -1,8 +1,8 @@ Keychain in example_cli - Rust

    Enum example_cli::Keychain

    source · 
    pub enum Keychain {
     External,
     Internal,
-}

    Variants§

    §

    External

    §

    Internal

    Trait Implementations§

    source§

    impl Clone for Keychain

    source§

    fn clone(&self) -> Keychain

    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 Keychain

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<'de> Deserialize<'de> for Keychain

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl Display for Keychain

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Ord for Keychain

    source§

    fn cmp(&self, other: &Keychain) -> Ordering

    This method returns an Ordering between self and other. Read more
    1.21.0 · source§

    fn max(self, other: Self) -> Self
    where +}

    Variants§

    §

    External

    §

    Internal

    Trait Implementations§

    source§

    impl Clone for Keychain

    source§

    fn clone(&self) -> Keychain

    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 Keychain

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl<'de> Deserialize<'de> for Keychain

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl Display for Keychain

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Ord for Keychain

    source§

    fn cmp(&self, other: &Keychain) -> Ordering

    This method returns an Ordering between self and other. Read more
    1.21.0 · source§

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

    Compares and returns the maximum of two values. Read more
    1.21.0 · source§

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

    Compares and returns the minimum of two values. Read more
    1.50.0 · source§

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

    Restrict a value to a certain interval. Read more
    source§

    impl PartialEq for Keychain

    source§

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

    This method tests for self and other values to be equal, and is used diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html index dc2577b00d..3a68ee2ba9 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html @@ -1,9 +1,9 @@ -create_tx in example_cli - Rust

    Function example_cli::create_tx

    source · 
    pub fn create_tx<O: ChainOracle>(
+create_tx in example_cli - Rust
    Function example_cli::create_tx
    source · 
    pub fn create_tx<O: ChainOracle>(
     graph: &mut KeychainTxGraph,
     chain: &O,
     assets: &Assets,
     cs_algorithm: CoinSelectionAlgo,
     address: Address,
     value: u64
-) -> Result<(Psbt, Option<ChangeInfo>)>
    where
-    O::Error: Error + Send + Sync + 'static,
    
\ No newline at end of file
+) -> Result<(Psbt, Option<ChangeInfo>)>
    where
+    O::Error: Error + Send + Sync + 'static,
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html index 28534cc344..dcaaa74741 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html @@ -1,8 +1,8 @@ handle_commands in example_cli - Rust

    Function example_cli::handle_commands

    source · 
    pub fn handle_commands<CS: Subcommand, S: Args>(
     graph: &Mutex<KeychainTxGraph>,
-    chain: &Mutex<LocalChain>,
+    chain: &Mutex<LocalChain>,
     db: &Mutex<Store<ChangeSet>>,
     network: Network,
-    broadcast: impl FnOnce(S, &Transaction) -> Result<()>,
+    broadcast: impl FnOnce(S, &Transaction) -> Result<()>,
     cmd: Commands<CS, S>
-) -> Result<()>
    \ No newline at end of file +) -> Result<()>

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html index fc0d4ac090..fd4bae254b 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html @@ -1,5 +1,5 @@ init_or_load in example_cli - Rust

    Function example_cli::init_or_load

    source · 
    pub fn init_or_load<CS: Subcommand, S: Args>(
     db_magic: &[u8],
     db_path: &str
-) -> Result<Option<Init<CS, S>>>
    Expand description

    Loads from persistence or creates new

    +) -> Result<Option<Init<CS, S>>>
    Expand description

    Loads from persistence or creates new

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html index ec454f3afe..3888f211a4 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html @@ -1,5 +1,5 @@ -planned_utxos in example_cli - Rust

    Function example_cli::planned_utxos

    source · 
    pub fn planned_utxos<O: ChainOracle>(
+planned_utxos in example_cli - Rust
    Function example_cli::planned_utxos
    source · 
    pub fn planned_utxos<O: ChainOracle>(
     graph: &KeychainTxGraph,
     chain: &O,
     assets: &Assets
-) -> Result<Vec<PlanUtxo>, O::Error>
    
\ No newline at end of file
+) -> Result<Vec<PlanUtxo>, O::Error>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html index 7fb3c4aad5..24da56e9c7 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html @@ -1 +1 @@ -example_cli - Rust

    Crate example_cli

    source ·

    Re-exports§

    Structs§

    Enums§

    Functions§

    Type Aliases§

    \ No newline at end of file +example_cli - Rust

    Crate example_cli

    source ·

    Re-exports§

    Structs§

    Enums§

    Functions§

    Type Aliases§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html index 744aa9c031..cffca80e66 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html @@ -1,8 +1,8 @@ ChangeInfo in example_cli - Rust

    Struct example_cli::ChangeInfo

    source · 
    pub struct ChangeInfo {
     pub change_keychain: Keychain,
-    pub indexer: ChangeSet,
+    pub indexer: ChangeSet,
     pub index: u32,
-}

    Fields§

    §change_keychain: Keychain§indexer: ChangeSet§index: u32

    Trait Implementations§

    source§

    impl Debug for ChangeInfo

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +}

    Fields§

    §change_keychain: Keychain§indexer: ChangeSet§index: u32

    Trait Implementations§

    source§

    impl Debug for ChangeInfo

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html index b5f2a3b72d..980da78f56 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html @@ -2,18 +2,18 @@ pub descriptor: Option<Descriptor<DescriptorPublicKey>>, pub change_descriptor: Option<Descriptor<DescriptorPublicKey>>, pub network: Option<Network>, - pub local_chain: ChangeSet, - pub tx_graph: ChangeSet<ConfirmationBlockTime>, - pub indexer: ChangeSet, + pub local_chain: ChangeSet, + pub tx_graph: ChangeSet<ConfirmationBlockTime>, + pub indexer: ChangeSet, }
    Expand description

    ChangeSet

    Fields§

    §descriptor: Option<Descriptor<DescriptorPublicKey>>

    Descriptor for recipient addresses.

    §change_descriptor: Option<Descriptor<DescriptorPublicKey>>

    Descriptor for change addresses.

    §network: Option<Network>

    Stores the network type of the transaction data.

    -
    §local_chain: ChangeSet

    Changes to the LocalChain.

    -
    §tx_graph: ChangeSet<ConfirmationBlockTime>

    Changes to TxGraph.

    -
    §indexer: ChangeSet

    Changes to KeychainTxOutIndex.

    +
    §local_chain: ChangeSet

    Changes to the [LocalChain].

    +
    §tx_graph: ChangeSet<ConfirmationBlockTime>

    Changes to TxGraph.

    +
    §indexer: ChangeSet

    Changes to [KeychainTxOutIndex].

    Trait Implementations§

    source§

    impl Clone for ChangeSet

    source§

    fn clone(&self) -> ChangeSet

    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 ChangeSet

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl Default for ChangeSet

    source§

    fn default() -> ChangeSet

    Returns the “default value” for a type. Read more
    source§

    impl<'de> Deserialize<'de> for ChangeSet

    source§

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

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    source§

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used + __D: Deserializer<'de>,

    Deserialize this value from the given Serde deserializer. Read more
    source§

    impl Merge for ChangeSet

    source§

    fn merge(&mut self, other: Self)

    Merge another object of the same type onto self.
    source§

    fn is_empty(&self) -> bool

    Returns whether the structure is considered empty.
    §

    fn take(&mut self) -> Option<Self>

    Take the value, replacing it with the default value.
    source§

    impl PartialEq for ChangeSet

    source§

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

    This method tests for self and other values to be equal, and is used by ==.
    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.
    source§

    impl Serialize for ChangeSet

    source§

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

    Serialize this value into the given Serde serializer. Read more
    source§

    impl StructuralPartialEq for ChangeSet

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html index ba5d9d652e..340c8f980c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html @@ -1,13 +1,13 @@ Init in example_cli - Rust

    Struct example_cli::Init

    source · 
    pub struct Init<CS: Subcommand, S: Args> {
     pub args: Args<CS, S>,
     pub graph: Mutex<KeychainTxGraph>,
-    pub chain: Mutex<LocalChain>,
+    pub chain: Mutex<LocalChain>,
     pub db: Mutex<Store<ChangeSet>>,
     pub network: Network,
 }
    Expand description

    The initial state returned by init_or_load.

    Fields§

    §args: Args<CS, S>

    CLI args

    §graph: Mutex<KeychainTxGraph>

    Indexed graph

    -
    §chain: Mutex<LocalChain>

    Local chain

    +
    §chain: Mutex<LocalChain>

    Local chain

    §db: Mutex<Store<ChangeSet>>

    Database

    §network: Network

    Network

    Auto Trait Implementations§

    §

    impl<CS, S> !Freeze for Init<CS, S>

    §

    impl<CS, S> RefUnwindSafe for Init<CS, S>
    where diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html index 69421bcb1f..932716eefe 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html @@ -1,6 +1,6 @@ -KeychainTxGraph in example_cli - Rust

    Type Alias example_cli::KeychainTxGraph

    source · 
    pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
    Expand description

    Alias for a IndexedTxGraph with specific Anchor and Indexer.

    +KeychainTxGraph in example_cli - Rust

    Type Alias example_cli::KeychainTxGraph

    source · 
    pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
    Expand description

    Alias for a IndexedTxGraph with specific Anchor and Indexer.

    Aliased Type§

    struct KeychainTxGraph {
-    pub index: KeychainTxOutIndex<Keychain>,
+    pub index: KeychainTxOutIndex<Keychain>,
     /* private fields */
-}

    Fields§

    §index: KeychainTxOutIndex<Keychain>

    Transaction index.

    +}

    Fields§

    §index: KeychainTxOutIndex<Keychain>

    Transaction index.

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html index 575a1c700d..38d6760ed6 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html @@ -1 +1 @@ -PlanUtxo in example_cli - Rust

    Type Alias example_cli::PlanUtxo

    source · 
    pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);
    \ No newline at end of file +PlanUtxo in example_cli - Rust

    Type Alias example_cli::PlanUtxo

    source · 
    pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html index fd03972fe5..ad9aa9912e 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html @@ -1 +1 @@ -main in example_electrum - Rust

    Function example_electrum::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file +main in example_electrum - Rust

    Function example_electrum::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html index c01fd68bbb..db8472b9f5 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html @@ -2,7 +2,7 @@ pub(crate) electrum_url: Option<String>, }

    Fields§

    §electrum_url: Option<String>

    The electrum url to use to connect to. If not provided it will use a default electrum server for your chosen network.

    -

    Implementations§

    source§

    impl ElectrumArgs

    source

    pub fn client(&self, network: Network) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for ElectrumArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via +

    Implementations§

    source§

    impl ElectrumArgs

    source

    pub fn client(&self, network: Network) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for ElectrumArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via [FromArgMatches::from_arg_matches_mut] Read more
    source§

    fn augment_args_for_update<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate self via [FromArgMatches::update_from_arg_matches_mut] Read more
    source§

    impl Clone for ElectrumArgs

    source§

    fn clone(&self) -> ElectrumArgs

    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 ElectrumArgs

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl FromArgMatches for ElectrumArgs

    source§

    fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>

    Instantiate Self from [ArgMatches], parsing the arguments as needed. Read more
    source§

    fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html index 12ee3d0931..f298ec93c1 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html @@ -1 +1 @@ -main in example_esplora - Rust

    Function example_esplora::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file +main in example_esplora - Rust

    Function example_esplora::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html index a068515343..3f570b8f13 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html @@ -1,7 +1,7 @@ EsploraArgs in example_esplora - Rust

    Struct example_esplora::EsploraArgs

    source · 
    pub struct EsploraArgs {
     pub(crate) esplora_url: Option<String>,
 }

    Fields§

    §esplora_url: Option<String>

    The esplora url endpoint to connect to.

    -

    Implementations§

    source§

    impl EsploraArgs

    source

    pub fn client(&self, network: Network) -> Result<BlockingClient>

    Trait Implementations§

    source§

    impl Args for EsploraArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via +

    Implementations§

    source§

    impl EsploraArgs

    source

    pub fn client(&self, network: Network) -> Result<BlockingClient>

    Trait Implementations§

    source§

    impl Args for EsploraArgs

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via [FromArgMatches::from_arg_matches_mut] Read more
    source§

    fn augment_args_for_update<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate self via [FromArgMatches::update_from_arg_matches_mut] Read more
    source§

    impl Clone for EsploraArgs

    source§

    fn clone(&self) -> EsploraArgs

    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 EsploraArgs

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl FromArgMatches for EsploraArgs

    source§

    fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>

    Instantiate Self from [ArgMatches], parsing the arguments as needed. Read more
    source§

    fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html index 93e9c09170..416051d069 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html @@ -1 +1 @@ -main in example_wallet_electrum - Rust

    Function example_wallet_electrum::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file +main in example_wallet_electrum - Rust

    Function example_wallet_electrum::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html index d20c42ab95..6d95f58315 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html @@ -1 +1 @@ -main in example_wallet_esplora_async - Rust

    Function example_wallet_esplora_async::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file +main in example_wallet_esplora_async - Rust

    Function example_wallet_esplora_async::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html index e73ca3817e..8bde2f8853 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html @@ -1 +1 @@ -main in example_wallet_esplora_blocking - Rust

    Function example_wallet_esplora_blocking::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file +main in example_wallet_esplora_blocking - Rust

    Function example_wallet_esplora_blocking::main

    source · 
    pub(crate) fn main() -> Result<(), Error>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html index b84a18cd3e..c964ee5c8d 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html @@ -1,8 +1,8 @@ Emission in example_wallet_rpc - Rust

    Enum example_wallet_rpc::Emission

    source · 
    pub(crate) enum Emission {
     SigTerm,
-    Block(BlockEvent<Block>),
+    Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
-}

    Variants§

    §

    SigTerm

    §

    Block(BlockEvent<Block>)

    §

    Mempool(Vec<(Transaction, u64)>)

    Trait Implementations§

    source§

    impl Debug for Emission

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

    impl<T> Any for T
    where +}

    Variants§

    §

    SigTerm

    §

    Block(BlockEvent<Block>)

    §

    Mempool(Vec<(Transaction, u64)>)

    Trait Implementations§

    source§

    impl Debug for Emission

    source§

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

    Formats the value using the given formatter. Read more

    Auto Trait Implementations§

    Blanket Implementations§

    source§

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

    source§

    fn type_id(&self) -> TypeId

    Gets the TypeId of self. Read more
    source§

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

    source§

    fn borrow(&self) -> &T

    Immutably borrows from an owned value. Read more
    source§

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

    source§

    fn borrow_mut(&mut self) -> &mut T

    Mutably borrows from an owned value. Read more
    source§

    impl<T> From<T> for T

    source§

    fn from(t: T) -> T

    Returns the argument unchanged.

    diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html index 170de7b7a8..9875d43204 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html @@ -1 +1 @@ -main in example_wallet_rpc - Rust

    Function example_wallet_rpc::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file +main in example_wallet_rpc - Rust

    Function example_wallet_rpc::main

    source · 
    pub(crate) fn main() -> Result<()>
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html index 518d1d8104..4e313c0092 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html @@ -20,7 +20,7 @@ count.

    §rpc_cookie: Option<PathBuf>

    RPC auth cookie file

    §rpc_user: Option<String>

    RPC auth username

    §rpc_pass: Option<String>

    RPC auth password

    -

    Implementations§

    source§

    impl Args

    source

    pub(crate) fn client(&self) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for Args

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via +

    Implementations§

    source§

    impl Args

    source

    pub(crate) fn client(&self) -> Result<Client>

    Trait Implementations§

    source§

    impl Args for Args

    source§

    fn group_id() -> Option<Id>

    Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
    source§

    fn augment_args<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate Self via [FromArgMatches::from_arg_matches_mut] Read more
    source§

    fn augment_args_for_update<'b>(__clap_app: Command) -> Command

    Append to [Command] so it can instantiate self via [FromArgMatches::update_from_arg_matches_mut] Read more
    source§

    impl CommandFactory for Args

    source§

    fn command<'b>() -> Command

    Build a [Command] that can instantiate Self. Read more
    source§

    fn command_for_update<'b>() -> Command

    Build a [Command] that can update self. Read more
    source§

    impl Debug for Args

    source§

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

    Formats the value using the given formatter. Read more
    source§

    impl FromArgMatches for Args

    source§

    fn from_arg_matches(__clap_arg_matches: &ArgMatches) -> Result<Self, Error>

    Instantiate Self from [ArgMatches], parsing the arguments as needed. Read more
    source§

    fn from_arg_matches_mut( __clap_arg_matches: &mut ArgMatches diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html index f662b41ef8..ae03e9ecc6 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/help.html @@ -1 +1 @@ -Help

    Rustdoc help

    Back
    \ No newline at end of file +Help

    Rustdoc help

    Back
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html index b09211728f..8b93b7ff46 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html @@ -1 +1 @@ -Settings

    Rustdoc settings

    Back
    \ No newline at end of file +Settings

    Rustdoc settings

    Back
    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html index b730264455..8f18a38ef8 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html @@ -668,6 +668,21 @@ 668 669 670 +671 +672 +673 +674 +675 +676 +677 +678 +679 +680 +681 +682 +683 +684 +685 

    use async_trait::async_trait;
 use bdk_core::collections::{BTreeMap, BTreeSet, HashSet};
 use bdk_core::spk_client::{FullScanRequest, FullScanResponse, SyncRequest, SyncResponse};
@@ -675,6 +690,7 @@
     bitcoin::{BlockHash, OutPoint, ScriptBuf, Txid},
     BlockId, CheckPoint, ConfirmationBlockTime, Indexed, TxUpdate,
 };
+use esplora_client::Sleeper;
 use futures::{stream::FuturesOrdered, TryStreamExt};
 
 use crate::{insert_anchor_from_status, insert_prevouts};
@@ -720,7 +736,11 @@
 
 #[cfg_attr(target_arch = "wasm32", async_trait(?Send))]
 #[cfg_attr(not(target_arch = "wasm32"), async_trait)]
-impl EsploraAsyncExt for esplora_client::AsyncClient {
+impl<S> EsploraAsyncExt for esplora_client::AsyncClient<S>
+where
+    S: Sleeper + Clone + Send + Sync,
+    S::Sleep: Send,
+{
     async fn full_scan<K: Ord + Clone + Send, R: Into<FullScanRequest<K>> + Send>(
         &self,
         request: R,
@@ -835,8 +855,8 @@
 /// block-based chain-sources). Therefore it's better to be conservative when setting the tip (use
 /// an earlier tip rather than a later tip) otherwise the caller may accidentally skip blocks when
 /// alternating between chain-sources.
-async fn fetch_latest_blocks(
-    client: &esplora_client::AsyncClient,
+async fn fetch_latest_blocks<S: Sleeper>(
+    client: &esplora_client::AsyncClient<S>,
 ) -> Result<BTreeMap<u32, BlockHash>, Error> {
     Ok(client
         .get_blocks(None)
@@ -849,8 +869,8 @@
 /// Used instead of [`esplora_client::BlockingClient::get_block_hash`].
 ///
 /// This first checks the previously fetched `latest_blocks` before fetching from Esplora again.
-async fn fetch_block(
-    client: &esplora_client::AsyncClient,
+async fn fetch_block<S: Sleeper>(
+    client: &esplora_client::AsyncClient<S>,
     latest_blocks: &BTreeMap<u32, BlockHash>,
     height: u32,
 ) -> Result<Option<BlockHash>, Error> {
@@ -875,8 +895,8 @@
 ///
 /// We want to have a corresponding checkpoint per anchor height. However, checkpoints fetched
 /// should not surpass `latest_blocks`.
-async fn chain_update(
-    client: &esplora_client::AsyncClient,
+async fn chain_update<S: Sleeper>(
+    client: &esplora_client::AsyncClient<S>,
     latest_blocks: &BTreeMap<u32, BlockHash>,
     local_tip: &CheckPoint,
     anchors: &BTreeSet<(ConfirmationBlockTime, Txid)>,
@@ -941,13 +961,17 @@
 /// script pubkey that contains a non-empty transaction history.
 ///
 /// Refer to [crate-level docs](crate) for more.
-async fn fetch_txs_with_keychain_spks<I: Iterator<Item = Indexed<ScriptBuf>> + Send>(
-    client: &esplora_client::AsyncClient,
+async fn fetch_txs_with_keychain_spks<I, S>(
+    client: &esplora_client::AsyncClient<S>,
     inserted_txs: &mut HashSet<Txid>,
     mut keychain_spks: I,
     stop_gap: usize,
     parallel_requests: usize,
-) -> Result<(TxUpdate<ConfirmationBlockTime>, Option<u32>), Error> {
+) -> Result<(TxUpdate<ConfirmationBlockTime>, Option<u32>), Error>
+where
+    I: Iterator<Item = Indexed<ScriptBuf>> + Send,
+    S: Sleeper + Clone + Send + Sync,
+{
     type TxsOfSpkIndex = (u32, Vec<esplora_client::Tx>);
 
     let mut update = TxUpdate::<ConfirmationBlockTime>::default();
@@ -1016,14 +1040,16 @@
 /// HTTP requests to make in parallel.
 ///
 /// Refer to [crate-level docs](crate) for more.
-async fn fetch_txs_with_spks<I: IntoIterator<Item = ScriptBuf> + Send>(
-    client: &esplora_client::AsyncClient,
+async fn fetch_txs_with_spks<I, S>(
+    client: &esplora_client::AsyncClient<S>,
     inserted_txs: &mut HashSet<Txid>,
     spks: I,
     parallel_requests: usize,
 ) -> Result<TxUpdate<ConfirmationBlockTime>, Error>
 where
-    I::IntoIter: Send,
+    I: IntoIterator<Item = ScriptBuf> + Send,
+    I::IntoIter: Send,
+    S: Sleeper + Clone + Send + Sync,
 {
     fetch_txs_with_keychain_spks(
         client,
@@ -1042,14 +1068,16 @@
 /// `parallel_requests` specifies the maximum number of HTTP requests to make in parallel.
 ///
 /// Refer to [crate-level docs](crate) for more.
-async fn fetch_txs_with_txids<I: IntoIterator<Item = Txid> + Send>(
-    client: &esplora_client::AsyncClient,
+async fn fetch_txs_with_txids<I, S>(
+    client: &esplora_client::AsyncClient<S>,
     inserted_txs: &mut HashSet<Txid>,
     txids: I,
     parallel_requests: usize,
 ) -> Result<TxUpdate<ConfirmationBlockTime>, Error>
 where
-    I::IntoIter: Send,
+    I: IntoIterator<Item = Txid> + Send,
+    I::IntoIter: Send,
+    S: Sleeper + Clone + Send + Sync,
 {
     let mut update = TxUpdate::<ConfirmationBlockTime>::default();
     // Only fetch for non-inserted txs.
@@ -1091,14 +1119,16 @@
 /// `parallel_requests` specifies the maximum number of HTTP requests to make in parallel.
 ///
 /// Refer to [crate-level docs](crate) for more.
-async fn fetch_txs_with_outpoints<I: IntoIterator<Item = OutPoint> + Send>(
-    client: &esplora_client::AsyncClient,
+async fn fetch_txs_with_outpoints<I, S>(
+    client: &esplora_client::AsyncClient<S>,
     inserted_txs: &mut HashSet<Txid>,
     outpoints: I,
     parallel_requests: usize,
 ) -> Result<TxUpdate<ConfirmationBlockTime>, Error>
 where
-    I::IntoIter: Send,
+    I: IntoIterator<Item = OutPoint> + Send,
+    I::IntoIter: Send,
+    S: Sleeper + Clone + Send + Sync,
 {
     let outpoints = outpoints.into_iter().collect::<Vec<_>>();
     let mut update = TxUpdate::<ConfirmationBlockTime>::default();
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
index df9b9d716d..e127ff98c0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
@@ -1,6 +1,6 @@
 (function() {var implementors = {
 "bdk_chain":[["impl Merge for ChangeSet"],["impl Merge for ChangeSet"],["impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>"],["impl<A: Ord> Merge for ChangeSet<A>"]],
 "bdk_core":[],
-"bdk_wallet":[["impl Merge for ChangeSet"]],
-"example_cli":[["impl Merge for ChangeSet"]]
+"bdk_wallet":[["impl Merge for ChangeSet"]],
+"example_cli":[["impl Merge for ChangeSet"]]
 };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
index d4e6c798fa..a54eb9a2cf 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.AsRef.js
@@ -1,4 +1,4 @@
 (function() {var implementors = {
 "bdk_chain":[["impl AsRef<[u8; 32]> for DescriptorId"],["impl AsRef<[u8]> for DescriptorId"],["impl<A> AsRef<TxGraph<A>> for TxGraph<A>"],["impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>"]],
-"bdk_wallet":[["impl AsRef<TxGraph<ConfirmationBlockTime>> for Wallet"],["impl AsRef<[u8]> for KeychainKind"]]
+"bdk_wallet":[["impl AsRef<TxGraph<ConfirmationBlockTime>> for Wallet"],["impl AsRef<[u8]> for KeychainKind"]]
 };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
index 8c94502b00..77a9ce8e1a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
@@ -2,6 +2,6 @@
 "bdk_chain":[["impl From<Hash> for DescriptorId"],["impl From<DescriptorId> for Hash"],["impl<'b> From<TxPosInBlock<'b>> for BlockId"],["impl<'b> From<TxPosInBlock<'b>> for ConfirmationBlockTime"],["impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>"],["impl<A> From<TxGraph<A>> for TxUpdate<A>"],["impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>"],["impl<A: Ord + Clone> From<TxUpdate<A>> for TxGraph<A>"],["impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet"],["impl<T> From<T> for AnchorImpl<T>"],["impl<T> From<T> for Impl<T>"]],
 "bdk_core":[["impl From<(&u32, &BlockHash)> for BlockId"],["impl From<(u32, BlockHash)> for BlockId"],["impl From<BlockId> for (u32, BlockHash)"],["impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>"],["impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>"]],
 "bdk_file_store":[["impl From<Error> for FileError"],["impl From<Error> for IterError"]],
-"bdk_wallet":[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<SyncResponse> for Update"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]],
+"bdk_wallet":[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl From<SyncResponse> for Update"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]],
 "example_bitcoind_rpc_polling":[["impl From<RpcArgs> for Auth"]]
 };if (window.register_implementors) {window.register_implementors(implementors);} else {window.pending_implementors = implementors;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
index 0628be35a7..e123a3aecd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/boxed/struct.Box.js
@@ -1,3 +1,3 @@
 (function() {var type_impls = {
-"bdk_esplora":[["
    §
    impl<T> AnyProvider for Box<T>
    where\n    T: AnyProvider + ?Sized,
    §
    fn load_any(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<AnyResponse, DataError>
    Loads an [AnyPayload] according to the key and request.
    ","AnyProvider","bdk_esplora::blocking_ext::Error"],["
    1.64.0 · source§
    impl<T> AsFd for Box<T>
    where\n    T: AsFd + ?Sized,
    source§
    fn as_fd(&self) -> BorrowedFd<'_>
    Borrows the file descriptor. Read more
    ","AsFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · source§
    impl<T, A> AsMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn as_mut(&mut self) -> &mut T
    Converts this type into a mutable reference of the (usually inferred) input type.
    ","AsMut","bdk_esplora::blocking_ext::Error"],["
    1.63.0 · source§
    impl<T> AsRawFd for Box<T>
    where\n    T: AsRawFd,
    source§
    fn as_raw_fd(&self) -> i32
    Extracts the raw file descriptor. Read more
    ","AsRawFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · source§
    impl<T, A> AsRef<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn as_ref(&self) -> &T
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<&[u8], Error>>
    Attempt to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<&[u8], Error>>
    Attempts to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFn<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn async_call(\n    &self,\n    args: Args\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFn, returning a future which may borrow from the called closure.
    ","AsyncFn","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnMut<Args> + ?Sized,\n    A: Allocator,
    §
    type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a>\nwhere\n    Box<F, A>: 'a
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnMut::async_call_mut and AsyncFn::async_call.
    source§
    extern "rust-call" fn async_call_mut(\n    &mut self,\n    args: Args\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnMut, returning a future which may borrow from the called closure.
    ","AsyncFnMut","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnOnce<Args> + ?Sized,\n    A: Allocator,
    §
    type Output = <F as AsyncFnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Output type of the called closure’s future.
    §
    type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnOnce::async_call_once.
    source§
    extern "rust-call" fn async_call_once(\n    self,\n    args: Args\n) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnOnce, returning a future which may move out of the called closure.
    ","AsyncFnOnce","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<S> AsyncIterator for Box<S>
    where\n    S: AsyncIterator + Unpin + ?Sized,
    §
    type Item = <S as AsyncIterator>::Item
    🔬This is a nightly-only experimental API. (async_iterator)
    The type of items yielded by the async iterator.
    source§
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
    🔬This is a nightly-only experimental API. (async_iterator)
    Attempt to pull out the next value of this async iterator, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the async iterator is exhausted. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (async_iterator)
    Returns the bounds on the remaining length of the async iterator. Read more
    ","AsyncIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut ReadBuf<'_>\n) -> Poll<Result<(), Error>>
    Attempts to read from the AsyncRead into buf. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut [u8]\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into buf. Read more
    §
    fn poll_read_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &mut [IoSliceMut<'_>]\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into bufs using vectored\nIO operations. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn poll_seek(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    pos: SeekFrom\n) -> Poll<Result<u64, Error>>
    Attempt to seek to an offset, in bytes, in a stream. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn start_seek(self: Pin<&mut Box<T>>, pos: SeekFrom) -> Result<(), Error>
    Attempts to seek to an offset, in bytes, in a stream. Read more
    §
    fn poll_complete(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<u64, Error>>
    Waits for a seek operation to complete. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from bufs into the object using vectored\nIO operations. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempt to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempt to close the object. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>]\n) -> Poll<Result<usize, Error>>
    Like poll_write, except that it writes from a slice of buffers. Read more
    §
    fn is_write_vectored(&self) -> bool
    Determines if this writer has an efficient poll_write_vectored\nimplementation. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempts to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_shutdown(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Initiates or attempts to shut down this writer, returning success when\nthe I/O connection has completely shut down. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Body for Box<T>
    where\n    T: Body + Unpin + ?Sized,
    §
    type Data = <T as Body>::Data
    Values yielded by the Body.
    §
    type Error = <T as Body>::Error
    The error type this Body might generate.
    source§
    fn poll_data(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<Result<<Box<T> as Body>::Data, <Box<T> as Body>::Error>>>
    Attempt to pull out the next data buffer of this stream.
    source§
    fn poll_trailers(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<Option<HeaderMap>, <Box<T> as Body>::Error>>
    Poll for an optional single HeaderMap of trailers. Read more
    source§
    fn is_end_stream(&self) -> bool
    Returns true when the end of stream has been reached. Read more
    source§
    fn size_hint(&self) -> SizeHint
    Returns the bounds on the remaining length of the stream. Read more
    source§
    fn data(&mut self) -> Data<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to next data chunk, if any.
    source§
    fn trailers(&mut self) -> Trailers<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to trailers, if any.
    source§
    fn map_data<F, B>(self, f: F) -> MapData<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Data) -> B,\n    B: Buf,
    Maps this body’s data value to a different value.
    source§
    fn map_err<F, E>(self, f: F) -> MapErr<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Error) -> E,
    Maps this body’s error value to a different value.
    source§
    fn collect(self) -> Collect<Self>
    where\n    Self: Sized,
    Turn this body into Collected body which will collect all the DATA frames\nand trailers.
    ","Body","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · source§
    impl<T, A> Borrow<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    ","Borrow","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · source§
    impl<T, A> BorrowMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    ","BorrowMut","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> BoundDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: BoundDataProvider<M> + ?Sized,
    §
    fn load_bound(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    §
    fn bound_key(&self) -> DataKey
    Returns the [DataKey] that this provider uses for loading data.
    ","BoundDataProvider","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Box<T>
    1.0.0 · source
    pub fn new(x: T) -> Box<T>
    Allocates memory on the heap and then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    let five = Box::new(5);
    \n
    source
    pub fn new_uninit() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_uninit)
    Constructs a new box with uninitialized contents.
    \n
    §Examples
    \n
    #![feature(new_uninit)]\n\nlet mut five = Box::<u32>::new_uninit();\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    source
    pub fn new_zeroed() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_uninit)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(new_uninit)]\n\nlet zero = Box::<u32>::new_zeroed();\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    1.33.0 · source
    pub fn pin(x: T) -> Pin<Box<T>>
    Constructs a new Pin<Box<T>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin(x)\ndoes the same as Box::into_pin(Box::new(x)). Consider using\ninto_pin if you already have a Box<T>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new.
    \n
    source
    pub fn try_new(x: T) -> Result<Box<T>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory on the heap then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet five = Box::try_new(5)?;
    \n
    source
    pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents on the heap,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nlet mut five = Box::<u32>::try_new_uninit()?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    source
    pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes on the heap
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nlet zero = Box::<u32>::try_new_zeroed()?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Box<T>
    where\n    T: ?Sized,
    1.4.0 · source
    pub unsafe fn from_raw(raw: *mut T) -> Box<T>
    Constructs a box from a raw pointer.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw:
    \n\n
    let x = Box::new(5);\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    use std::alloc::{alloc, Layout};\n\nunsafe {\n    let ptr = alloc(Layout::new::<i32>()) as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw(ptr);\n}
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,
    source
    pub fn new_in(x: T, alloc: A) -> Box<T, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::new_in(5, System);
    \n
    source
    pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::try_new_in(5, System)?;
    \n
    source
    pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::new_uninit_in(System);\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    source
    pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::try_new_uninit_in(System)?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    source
    pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::new_zeroed_in(System);\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    source
    pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator,\nreturning an error if the allocation fails,
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::try_new_zeroed_in(System)?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    source
    pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>
    where\n    A: 'static + Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Pin<Box<T, A>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin_in(x, alloc)\ndoes the same as Box::into_pin(Box::new_in(x, alloc)). Consider using\ninto_pin if you already have a Box<T, A>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new_in.
    \n
    source
    pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
    🔬This is a nightly-only experimental API. (box_into_boxed_slice)
    Converts a Box<T> into a Box<[T]>
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    source
    pub fn into_inner(boxed: Box<T, A>) -> T
    🔬This is a nightly-only experimental API. (box_into_inner)
    Consumes the Box, returning the wrapped value.
    \n
    §Examples
    \n
    #![feature(box_into_inner)]\n\nlet c = Box::new(5);\n\nassert_eq!(Box::into_inner(c), 5);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    const: unstable · source
    pub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a raw pointer in the given allocator.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw_with_allocator:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let ptr = System.allocate(Layout::new::<i32>())?.as_mut_ptr() as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw_in(ptr, System);\n}
    \n
    1.4.0 · source
    pub fn into_raw(b: Box<T, A>) -> *mut T
    Consumes the Box, returning a wrapped raw pointer.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw(b) instead of b.into_raw(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw\nfor automatic cleanup:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    use std::alloc::{dealloc, Layout};\nuse std::ptr;\n\nlet x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    dealloc(ptr as *mut u8, Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    drop(Box::from_raw(ptr));\n}
    \n
    source
    pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped raw pointer and the allocator.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw_in function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw_with_allocator(b) instead of b.into_raw_with_allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw_in\nfor automatic cleanup:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::{Allocator, Layout, System};\nuse std::ptr::{self, NonNull};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    let non_null = NonNull::new_unchecked(ptr);\n    alloc.deallocate(non_null.cast(), Layout::new::<String>());\n}
    \n
    const: unstable · source
    pub fn allocator(b: &Box<T, A>) -> &A
    🔬This is a nightly-only experimental API. (allocator_api)
    Returns a reference to the underlying allocator.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::allocator(&b) instead of b.allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    1.26.0 · source
    pub fn leak<'a>(b: Box<T, A>) -> &'a mut T
    where\n    A: 'a,
    Consumes and leaks the Box, returning a mutable reference,\n&'a mut T. Note that the type T must outlive the chosen lifetime\n'a. If the type has only static references, or none at all, then this\nmay be chosen to be 'static.
    \n
    This function is mainly useful for data that lives for the remainder of\nthe program’s life. Dropping the returned reference will cause a memory\nleak. If this is not acceptable, the reference should first be wrapped\nwith the Box::from_raw function producing a Box. This Box can\nthen be dropped which will properly destroy T and release the\nallocated memory.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::leak(b) instead of b.leak(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Simple usage:
    \n\n
    let x = Box::new(41);\nlet static_ref: &'static mut usize = Box::leak(x);\n*static_ref += 1;\nassert_eq!(*static_ref, 42);
    \n
    Unsized data:
    \n\n
    let x = vec![1, 2, 3].into_boxed_slice();\nlet static_ref = Box::leak(x);\nstatic_ref[0] = 4;\nassert_eq!(*static_ref, [4, 2, 3]);
    \n
    1.63.0 (const: unstable) · source
    pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>
    where\n    A: 'static,
    Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then\n*boxed will be pinned in memory and unable to be moved.
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    This is also available via From.
    \n
    Constructing and pinning a Box with Box::into_pin(Box::new(x))\ncan also be written more concisely using Box::pin(x).\nThis into_pin method is useful if you already have a Box<T>, or you are\nconstructing a (pinned) Box in a different way than with Box::new.
    \n
    §Notes
    \n
    It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>,\nas it’ll introduce an ambiguity when calling Pin::from.\nA demonstration of such a poor impl is shown below.
    \n\n
    ⓘ
    struct Foo; // A type defined in this crate.\nimpl From<Box<()>> for Pin<Foo> {\n    fn from(_: Box<()>) -> Pin<Foo> {\n        Pin::new(Foo)\n    }\n}\n\nlet foo = Box::new(());\nlet bar = Pin::from(foo);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Buf for Box<T>
    where\n    T: Buf + ?Sized,
    §
    fn remaining(&self) -> usize
    Returns the number of bytes between the current position and the end of\nthe buffer. Read more
    §
    fn chunk(&self) -> &[u8] ⓘ
    Returns a slice starting at the current position and of length between 0\nand Buf::remaining(). Note that this can return a shorter slice (this\nallows non-continuous internal representation). Read more
    §
    fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
    Fills dst with potentially multiple slices starting at self’s\ncurrent position. Read more
    §
    fn advance(&mut self, cnt: usize)
    Advance the internal cursor of the Buf Read more
    §
    fn has_remaining(&self) -> bool
    Returns true if there are any more bytes to consume Read more
    §
    fn copy_to_slice(&mut self, dst: &mut [u8])
    Copies bytes from self into dst. Read more
    §
    fn get_u8(&mut self) -> u8
    Gets an unsigned 8 bit integer from self. Read more
    §
    fn get_i8(&mut self) -> i8
    Gets a signed 8 bit integer from self. Read more
    §
    fn get_u16(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_u16_le(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_u16_ne(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_i16(&mut self) -> i16
    Gets a signed 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_i16_le(&mut self) -> i16
    Gets a signed 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_i16_ne(&mut self) -> i16
    Gets a signed 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_u32(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the big-endian byte order. Read more
    §
    fn get_u32_le(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the little-endian byte order. Read more
    §
    fn get_u32_ne(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_i32(&mut self) -> i32
    Gets a signed 32 bit integer from self in big-endian byte order. Read more
    §
    fn get_i32_le(&mut self) -> i32
    Gets a signed 32 bit integer from self in little-endian byte order. Read more
    §
    fn get_i32_ne(&mut self) -> i32
    Gets a signed 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_u64(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_u64_le(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_u64_ne(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_i64(&mut self) -> i64
    Gets a signed 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_i64_le(&mut self) -> i64
    Gets a signed 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_i64_ne(&mut self) -> i64
    Gets a signed 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_uint(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in big-endian byte order. Read more
    §
    fn get_uint_le(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in little-endian byte order. Read more
    §
    fn get_uint_ne(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in native-endian byte order. Read more
    §
    fn get_int(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in big-endian byte order. Read more
    §
    fn get_int_le(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in little-endian byte order. Read more
    §
    fn get_int_ne(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in native-endian byte order. Read more
    §
    fn copy_to_bytes(&mut self, len: usize) -> Bytes
    Consumes len bytes inside self and returns new instance of Bytes\nwith this data. Read more
    §
    fn get_u128(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_u128_le(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_u128_ne(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_i128(&mut self) -> i128
    Gets a signed 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_i128_le(&mut self) -> i128
    Gets a signed 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_i128_ne(&mut self) -> i128
    Gets a signed 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_f32(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f32_le(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f32_ne(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn get_f64(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f64_le(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f64_ne(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn take(self, limit: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an adaptor which will read at most limit bytes from self. Read more
    §
    fn chain<U>(self, next: U) -> Chain<Self, U>
    where\n    U: Buf,\n    Self: Sized,
    Creates an adaptor which will chain this buffer with another. Read more
    §
    fn reader(self) -> Reader<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Read trait for self. Read more
    ","Buf","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufMut for Box<T>
    where\n    T: BufMut + ?Sized,
    §
    fn remaining_mut(&self) -> usize
    Returns the number of bytes that can be written from the current\nposition until the end of the buffer is reached. Read more
    §
    fn chunk_mut(&mut self) -> &mut UninitSlice
    Returns a mutable slice starting at the current BufMut position and of\nlength between 0 and BufMut::remaining_mut(). Note that this can be shorter than the\nwhole remainder of the buffer (this allows non-continuous implementation). Read more
    §
    unsafe fn advance_mut(&mut self, cnt: usize)
    Advance the internal cursor of the BufMut Read more
    §
    fn put_slice(&mut self, src: &[u8])
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_u8(&mut self, n: u8)
    Writes an unsigned 8 bit integer to self. Read more
    §
    fn put_i8(&mut self, n: i8)
    Writes a signed 8 bit integer to self. Read more
    §
    fn put_u16(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_u16_le(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_u16_ne(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_i16(&mut self, n: i16)
    Writes a signed 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_i16_le(&mut self, n: i16)
    Writes a signed 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_i16_ne(&mut self, n: i16)
    Writes a signed 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_u32(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_u32_le(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_u32_ne(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_i32(&mut self, n: i32)
    Writes a signed 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_i32_le(&mut self, n: i32)
    Writes a signed 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_i32_ne(&mut self, n: i32)
    Writes a signed 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_u64(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u64_le(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_u64_ne(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in native-endian byte order. Read more
    §
    fn put_i64(&mut self, n: i64)
    Writes a signed 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i64_le(&mut self, n: i64)
    Writes a signed 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_i64_ne(&mut self, n: i64)
    Writes a signed 64 bit integer to self in native-endian byte order. Read more
    §
    fn has_remaining_mut(&self) -> bool
    Returns true if there is space in self for more bytes. Read more
    §
    fn put<T>(&mut self, src: T)
    where\n    T: Buf,\n    Self: Sized,
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_bytes(&mut self, val: u8, cnt: usize)
    Put cnt bytes val into self. Read more
    §
    fn put_u128(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u128_le(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_u128_ne(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_i128(&mut self, n: i128)
    Writes a signed 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i128_le(&mut self, n: i128)
    Writes a signed 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_i128_ne(&mut self, n: i128)
    Writes a signed 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_uint(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in big-endian byte order. Read more
    §
    fn put_uint_le(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the little-endian byte order. Read more
    §
    fn put_uint_ne(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the native-endian byte order. Read more
    §
    fn put_int(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in big-endian byte order. Read more
    §
    fn put_int_le(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in little-endian byte order. Read more
    §
    fn put_int_ne(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in native-endian byte order. Read more
    §
    fn put_f32(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f32_le(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f32_ne(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn put_f64(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f64_le(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f64_ne(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn limit(self, limit: usize) -> Limit<Self>
    where\n    Self: Sized,
    Creates an adaptor which can write at most limit bytes to self. Read more
    §
    fn writer(self) -> Writer<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Write trait for self. Read more
    §
    fn chain_mut<U>(self, next: U) -> Chain<Self, U>
    where\n    U: BufMut,\n    Self: Sized,
    Creates an adapter which will chain this buffer with another. Read more
    ","BufMut","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<B> BufRead for Box<B>
    where\n    B: BufRead + ?Sized,
    source§
    fn fill_buf(&mut self) -> Result<&[u8], Error>
    Returns the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    source§
    fn consume(&mut self, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to read. Read more
    source§
    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>
    Read all bytes into buf until the delimiter byte or EOF is reached. Read more
    source§
    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
    Read all bytes until a newline (the 0xA byte) is reached, and append\nthem to the provided String buffer. Read more
    source§
    fn has_data_left(&mut self) -> Result<bool, Error>
    🔬This is a nightly-only experimental API. (buf_read_has_data_left)
    Check if the underlying Read has any data left to be read. Read more
    source§
    fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
    🔬This is a nightly-only experimental API. (bufread_skip_until)
    Skip all bytes until the delimiter byte or EOF is reached. Read more
    1.0.0 · source§
    fn split(self, byte: u8) -> Split<Self>
    where\n    Self: Sized,
    Returns an iterator over the contents of this reader split on the byte\nbyte. Read more
    1.0.0 · source§
    fn lines(self) -> Lines<Self>
    where\n    Self: Sized,
    Returns an iterator over the lines of this reader. Read more
    ","BufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufferProvider for Box<T>
    where\n    T: BufferProvider + ?Sized,
    §
    fn load_buffer(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<DataResponse<BufferMarker>, DataError>
    Loads a [DataPayload]<[BufferMarker]> according to the key and request.
    ","BufferProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Clone for Box<T, A>
    where\n    T: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> Box<T, A>
    Returns a new box with a clone() of this box’s contents.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet y = x.clone();\n\n// The value is the same\nassert_eq!(x, y);\n\n// But they are unique objects\nassert_ne!(&*x as *const i32, &*y as *const i32);
    \n
    source§
    fn clone_from(&mut self, source: &Box<T, A>)
    Copies source’s contents into self without creating a new allocation.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet mut y = Box::new(10);\nlet yp: *const i32 = &*y;\n\ny.clone_from(&x);\n\n// The value is the same\nassert_eq!(x, y);\n\n// And no allocation occurred\nassert_eq!(yp, &*y);
    \n
    ","Clone","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<G, R, A> Coroutine<R> for Box<G, A>
    where\n    G: Coroutine<R> + Unpin + ?Sized,\n    A: Allocator,
    §
    type Yield = <G as Coroutine<R>>::Yield
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine yields. Read more
    §
    type Return = <G as Coroutine<R>>::Return
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine returns. Read more
    source§
    fn resume(\n    self: Pin<&mut Box<G, A>>,\n    arg: R\n) -> CoroutineState<<Box<G, A> as Coroutine<R>>::Yield, <Box<G, A> as Coroutine<R>>::Return>
    🔬This is a nightly-only experimental API. (coroutine_trait)
    Resumes the execution of this coroutine. Read more
    ","Coroutine","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DataProvider<M> for Box<P>
    where\n    M: KeyedDataMarker,\n    P: DataProvider<M> + ?Sized,
    §
    fn load(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DataProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Debug for Box<T, A>
    where\n    T: Debug + ?Sized,\n    A: Allocator,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T> Default for Box<T>
    where\n    T: Default,
    source§
    fn default() -> Box<T>
    Creates a Box<T>, with the Default value for T.
    \n
    ","Default","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Deref for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    §
    type Target = T
    The resulting type after dereferencing.
    source§
    fn deref(&self) -> &T
    Dereferences the value.
    ","Deref","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> DerefMut for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn deref_mut(&mut self) -> &mut T
    Mutably dereferences the value.
    ","DerefMut","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<'de, T> Deserialize<'de> for Box<T>
    where\n    T: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<Box<T>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Display for Box<T, A>
    where\n    T: Display + ?Sized,\n    A: Allocator,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> DoubleEndedIterator for Box<I, A>
    where\n    I: DoubleEndedIterator + ?Sized,\n    A: Allocator,
    source§
    fn next_back(&mut self) -> Option<<I as Iterator>::Item>
    Removes and returns an element from the end of the iterator. Read more
    source§
    fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element from the end of the iterator. Read more
    source§
    fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
    🔬This is a nightly-only experimental API. (iter_advance_by)
    Advances the iterator from the back by n elements. Read more
    1.27.0 · source§
    fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    This is the reverse version of Iterator::try_fold(): it takes\nelements starting from the back of the iterator. Read more
    1.27.0 · source§
    fn rfold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    An iterator method that reduces the iterator’s elements to a single,\nfinal value, starting from the back. Read more
    1.27.0 · source§
    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    ","DoubleEndedIterator","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Drop for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DynamicDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: DynamicDataProvider<M> + ?Sized,
    §
    fn load_data(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DynamicDataProvider","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> EncodeAsVarULE<T> for Box<T>
    where\n    T: VarULE + ?Sized,
    §
    fn encode_var_ule_as_slices<R>(&self, cb: impl FnOnce(&[&[u8]]) -> R) -> R
    Calls cb with a piecewise list of byte slices that when concatenated\nproduce the memory pattern of the corresponding instance of T. Read more
    §
    fn encode_var_ule_len(&self) -> usize
    Return the length, in bytes, of the corresponding [VarULE] type
    §
    fn encode_var_ule_write(&self, dst: &mut [u8])
    Write the corresponding [VarULE] type to the dst buffer. dst should\nbe the size of [Self::encode_var_ule_len()]
    ","EncodeAsVarULE","bdk_esplora::blocking_ext::Error"],["
    1.8.0 · source§
    impl<T> Error for Box<T>
    where\n    T: Error,
    source§
    fn description(&self) -> &str
    👎Deprecated since 1.42.0: use the Display impl or to_string()
     Read more
    source§
    fn cause(&self) -> Option<&dyn Error>
    👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
    source§
    fn source(&self) -> Option<&(dyn Error + 'static)>
    The lower-level source of this error, if any. Read more
    source§
    fn provide<'b>(&'b self, request: &mut Request<'b>)
    🔬This is a nightly-only experimental API. (error_generic_member_access)
    Provides type based access to context intended for error reports. Read more
    ","Error","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> ExactSizeIterator for Box<I, A>
    where\n    I: ExactSizeIterator + ?Sized,\n    A: Allocator,
    source§
    fn len(&self) -> usize
    Returns the exact remaining length of the iterator. Read more
    source§
    fn is_empty(&self) -> bool
    🔬This is a nightly-only experimental API. (exact_size_is_empty)
    Returns true if the iterator is empty. Read more
    ","ExactSizeIterator","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> Fn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: Fn<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn call(\n    &self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","Fn","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> FnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnMut<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn call_mut(\n    &mut self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnMut","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> FnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnOnce<Args> + ?Sized,\n    A: Allocator,
    §
    type Output = <F as FnOnce<Args>>::Output
    The returned type after the call operator is used.
    source§
    extern "rust-call" fn call_once(\n    self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnOnce","bdk_esplora::blocking_ext::Error"],["
    1.6.0 · source§
    impl<T> From<T> for Box<T>
    source§
    fn from(t: T) -> Box<T>
    Converts a T into a Box<T>
    \n
    The conversion allocates on the heap and moves t\nfrom the stack into it.
    \n
    §Examples
    \n
    let x = 5;\nlet boxed = Box::new(5);\n\nassert_eq!(Box::from(x), boxed);
    \n
    ","From","bdk_esplora::blocking_ext::Error"],["
    §
    impl<F> FusedFuture for Box<F>
    where\n    F: FusedFuture + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the underlying future should no longer be polled.
    ","FusedFuture","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> FusedStream for Box<S>
    where\n    S: FusedStream + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the stream should no longer be polled.
    ","FusedStream","bdk_esplora::blocking_ext::Error"],["
    1.36.0 · source§
    impl<F, A> Future for Box<F, A>
    where\n    F: Future + Unpin + ?Sized,\n    A: Allocator,
    §
    type Output = <F as Future>::Output
    The type of value produced on completion.
    source§
    fn poll(\n    self: Pin<&mut Box<F, A>>,\n    cx: &mut Context<'_>\n) -> Poll<<Box<F, A> as Future>::Output>
    Attempt to resolve the future to a final value, registering\nthe current task for wakeup if the value is not yet available. Read more
    ","Future","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Hash for Box<T, A>
    where\n    T: Hash + ?Sized,\n    A: Allocator,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_esplora::blocking_ext::Error"],["
    1.22.0 · source§
    impl<T, A> Hasher for Box<T, A>
    where\n    T: Hasher + ?Sized,\n    A: Allocator,
    source§
    fn finish(&self) -> u64
    Returns the hash value for the values written so far. Read more
    source§
    fn write(&mut self, bytes: &[u8])
    Writes some data into this Hasher. Read more
    source§
    fn write_u8(&mut self, i: u8)
    Writes a single u8 into this hasher.
    source§
    fn write_u16(&mut self, i: u16)
    Writes a single u16 into this hasher.
    source§
    fn write_u32(&mut self, i: u32)
    Writes a single u32 into this hasher.
    source§
    fn write_u64(&mut self, i: u64)
    Writes a single u64 into this hasher.
    source§
    fn write_u128(&mut self, i: u128)
    Writes a single u128 into this hasher.
    source§
    fn write_usize(&mut self, i: usize)
    Writes a single usize into this hasher.
    source§
    fn write_i8(&mut self, i: i8)
    Writes a single i8 into this hasher.
    source§
    fn write_i16(&mut self, i: i16)
    Writes a single i16 into this hasher.
    source§
    fn write_i32(&mut self, i: i32)
    Writes a single i32 into this hasher.
    source§
    fn write_i64(&mut self, i: i64)
    Writes a single i64 into this hasher.
    source§
    fn write_i128(&mut self, i: i128)
    Writes a single i128 into this hasher.
    source§
    fn write_isize(&mut self, i: isize)
    Writes a single isize into this hasher.
    source§
    fn write_length_prefix(&mut self, len: usize)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a length prefix into this hasher, as part of being prefix-free. Read more
    source§
    fn write_str(&mut self, s: &str)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a single str into this hasher. Read more
    ","Hasher","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> Iterator for Box<I, A>
    where\n    I: Iterator + ?Sized,\n    A: Allocator,
    §
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<<I as Iterator>::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    source§
    fn nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element of the iterator. Read more
    source§
    fn last(self) -> Option<<I as Iterator>::Item>
    Consumes the iterator, returning the last element. Read more
    source§
    fn next_chunk<const N: usize>(\n    &mut self\n) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where\n    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 count(self) -> usize
    where\n    Self: Sized,
    Consumes the iterator, counting the number of iterations and returning it. Read more
    source§
    fn advance_by(&mut self, n: usize) -> Result<(), NonZero<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\n    Self: Sized,
    Creates an iterator starting at the same point, but stepping by\nthe given amount at each iteration. Read more
    1.0.0 · source§
    fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    G: FnMut() -> Self::Item,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places an item generated by separator\nbetween adjacent items of the original iterator. Read more
    1.0.0 · source§
    fn map<B, F>(self, f: F) -> Map<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> B,
    Takes a closure and creates an iterator which calls that closure on each\nelement. Read more
    1.21.0 · source§
    fn for_each<F>(self, f: F)
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator which uses a closure to determine if an element\nshould be yielded. Read more
    1.0.0 · source§
    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Creates an iterator that both filters and maps. Read more
    1.0.0 · source§
    fn enumerate(self) -> Enumerate<Self>
    where\n    Self: Sized,
    Creates an iterator which gives the current iteration count as well as\nthe next value. Read more
    1.0.0 · source§
    fn peekable(self) -> Peekable<Self>
    where\n    Self: Sized,
    Creates an iterator which can use the peek and peek_mut methods\nto look at the next element of the iterator without consuming it. See\ntheir documentation for more information. Read more
    1.0.0 · source§
    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator that skips elements based on a predicate. Read more
    1.0.0 · source§
    fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator that yields elements based on a predicate. Read more
    1.57.0 · source§
    fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> Option<B>,
    Creates an iterator that both yields elements based on a predicate and maps. Read more
    1.0.0 · source§
    fn skip(self, n: usize) -> Skip<Self>
    where\n    Self: Sized,
    Creates an iterator that skips the first n elements. Read more
    1.0.0 · source§
    fn take(self, n: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an iterator that yields the first n elements, or fewer\nif the underlying iterator ends sooner. Read more
    1.0.0 · source§
    fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
    where\n    Self: Sized,\n    F: FnMut(&mut St, Self::Item) -> Option<B>,
    An iterator adapter which, like fold, holds internal state, but\nunlike fold, produces a new iterator. Read more
    1.0.0 · source§
    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
    where\n    Self: Sized,\n    U: IntoIterator,\n    F: FnMut(Self::Item) -> U,
    Creates an iterator that works like map, but flattens nested structure. Read more
    source§
    fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
    where\n    Self: Sized,\n    F: FnMut(&[Self::Item; N]) -> R,
    🔬This is a nightly-only experimental API. (iter_map_windows)
    Calls the given function f for each contiguous window of size N over\nself and returns an iterator over the outputs of f. Like slice::windows(),\nthe windows during mapping overlap as well. Read more
    1.0.0 · source§
    fn fuse(self) -> Fuse<Self>
    where\n    Self: Sized,
    Creates an iterator which ends after the first None. Read more
    1.0.0 · source§
    fn inspect<F>(self, f: F) -> Inspect<Self, F>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item),
    Does something with each element of an iterator, passing the value on. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Borrows an iterator, rather than consuming it. Read more
    1.0.0 · source§
    fn collect<B>(self) -> B
    where\n    B: FromIterator<Self::Item>,\n    Self: Sized,
    Transforms an iterator into a collection. Read more
    source§
    fn collect_into<E>(self, collection: &mut E) -> &mut E
    where\n    E: Extend<Self::Item>,\n    Self: Sized,
    🔬This is a nightly-only experimental API. (iter_collect_into)
    Collects all the items from an iterator into a collection. Read more
    1.0.0 · source§
    fn partition<B, F>(self, f: F) -> (B, B)
    where\n    Self: Sized,\n    B: Default + Extend<Self::Item>,\n    F: FnMut(&Self::Item) -> bool,
    Consumes an iterator, creating two collections from it. Read more
    source§
    fn is_partitioned<P>(self, predicate: P) -> bool
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    🔬This is a nightly-only experimental API. (iter_is_partitioned)
    Checks if the elements of this iterator are partitioned according to the given predicate,\nsuch that all those that return true precede all those that return false. Read more
    1.27.0 · source§
    fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    An iterator method that applies a function as long as it returns\nsuccessfully, producing a single, final value. Read more
    1.27.0 · source§
    fn try_for_each<F, R>(&mut self, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> R,\n    R: Try<Output = ()>,
    An iterator method that applies a fallible function to each item in the\niterator, stopping at the first error and returning that error. Read more
    1.0.0 · source§
    fn fold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    Folds every element into an accumulator by applying an operation,\nreturning the final result. Read more
    1.51.0 · source§
    fn reduce<F>(self, f: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> Self::Item,
    Reduces the elements to a single one, by repeatedly applying a reducing\noperation. Read more
    source§
    fn try_reduce<F, R>(\n    &mut self,\n    f: F\n) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> R,\n    R: Try<Output = Self::Item>,\n    <R as Try>::Residual: Residual<Option<Self::Item>>,
    🔬This is a nightly-only experimental API. (iterator_try_reduce)
    Reduces the elements to a single one by repeatedly applying a reducing operation. If the\nclosure returns a failure, the failure is propagated back to the caller immediately. Read more
    1.0.0 · source§
    fn all<F>(&mut self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> bool,
    Tests if every element of the iterator matches a predicate. Read more
    1.0.0 · source§
    fn any<F>(&mut self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> bool,
    Tests if any element of the iterator matches a predicate. Read more
    1.0.0 · source§
    fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator that satisfies a predicate. Read more
    1.30.0 · source§
    fn find_map<B, F>(&mut self, f: F) -> Option<B>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Applies function to the elements of iterator and returns\nthe first non-none result. Read more
    source§
    fn try_find<F, R>(\n    &mut self,\n    f: F\n) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
    where\n    Self: Sized,\n    F: FnMut(&Self::Item) -> R,\n    R: Try<Output = bool>,\n    <R as Try>::Residual: Residual<Option<Self::Item>>,
    🔬This is a nightly-only experimental API. (try_find)
    Applies function to the elements of iterator and returns\nthe first true result or the first error. Read more
    1.0.0 · source§
    fn position<P>(&mut self, predicate: P) -> Option<usize>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    Searches for an element in an iterator, returning its index. Read more
    1.6.0 · source§
    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the maximum value from the\nspecified function. Read more
    1.15.0 · source§
    fn max_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the maximum value with respect to the\nspecified comparison function. Read more
    1.6.0 · source§
    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the minimum value from the\nspecified function. Read more
    1.15.0 · source§
    fn min_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the minimum value with respect to the\nspecified comparison function. Read more
    1.0.0 · source§
    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
    where\n    FromA: Default + Extend<A>,\n    FromB: Default + Extend<B>,\n    Self: Sized + Iterator<Item = (A, B)>,
    Converts an iterator of pairs into a pair of containers. Read more
    1.36.0 · source§
    fn copied<'a, T>(self) -> Copied<Self>
    where\n    T: 'a + Copy,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which copies all of its elements. Read more
    1.0.0 · source§
    fn cloned<'a, T>(self) -> Cloned<Self>
    where\n    T: 'a + Clone,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which clones all of its elements. Read more
    source§
    fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
    where\n    Self: Sized,
    🔬This is a nightly-only experimental API. (iter_array_chunks)
    Returns an iterator over N elements of the iterator at a time. Read more
    1.11.0 · source§
    fn sum<S>(self) -> S
    where\n    Self: Sized,\n    S: Sum<Self::Item>,
    Sums the elements of an iterator. Read more
    1.11.0 · source§
    fn product<P>(self) -> P
    where\n    Self: Sized,\n    P: Product<Self::Item>,
    Iterates over the entire iterator, multiplying all the elements Read more
    source§
    fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Lexicographically compares the elements of this Iterator with those\nof another with respect to the specified comparison function. Read more
    1.5.0 · source§
    fn partial_cmp<I>(self, other: I) -> Option<Ordering>
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Lexicographically compares the PartialOrd elements of\nthis Iterator with those of another. The comparison works like short-circuit\nevaluation, returning a result without comparing the remaining elements.\nAs soon as an order can be determined, the evaluation stops and a result is returned. Read more
    source§
    fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Lexicographically compares the elements of this Iterator with those\nof another with respect to the specified comparison function. Read more
    1.5.0 · source§
    fn eq<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are equal to those of\nanother. Read more
    source§
    fn eq_by<I, F>(self, other: I, eq: F) -> bool
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Determines if the elements of this Iterator are equal to those of\nanother with respect to the specified equality function. Read more
    1.5.0 · source§
    fn ne<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are not equal to those of\nanother. Read more
    1.5.0 · source§
    fn lt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless than those of another. Read more
    1.5.0 · source§
    fn le<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless or equal to those of another. Read more
    1.5.0 · source§
    fn gt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than those of another. Read more
    1.5.0 · source§
    fn ge<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than or equal to those of another. Read more
    source§
    fn is_sorted_by<F>(self, compare: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> bool,
    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given comparator function. Read more
    source§
    fn is_sorted_by_key<F, K>(self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> K,\n    K: PartialOrd,
    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given key extraction\nfunction. Read more
    ","Iterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> LocalSpawn for Box<Sp>
    where\n    Sp: LocalSpawn + ?Sized,
    §
    fn spawn_local_obj(\n    &self,\n    future: LocalFutureObj<'static, ()>\n) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status_local(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","LocalSpawn","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Ord for Box<T, A>
    where\n    T: Ord + ?Sized,\n    A: Allocator,
    source§
    fn cmp(&self, other: &Box<T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> PartialEq for Box<T, A>
    where\n    T: PartialEq + ?Sized,\n    A: Allocator,
    source§
    fn eq(&self, other: &Box<T, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    source§
    fn ne(&self, other: &Box<T, A>) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> PartialOrd for Box<T, A>
    where\n    T: PartialOrd + ?Sized,\n    A: Allocator,
    source§
    fn partial_cmp(&self, other: &Box<T, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    source§
    fn lt(&self, other: &Box<T, A>) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    source§
    fn le(&self, other: &Box<T, A>) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    source§
    fn ge(&self, other: &Box<T, A>) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    source§
    fn gt(&self, other: &Box<T, A>) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    ","PartialOrd","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Pointer for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Pointer","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<R> Read for Box<R>
    where\n    R: Read + ?Sized,
    source§
    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
    Pull some bytes from this source into the specified buffer, returning\nhow many bytes were read. Read more
    source§
    fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Pull some bytes from this source into the specified buffer. Read more
    source§
    fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
    Like read, except that it reads into a slice of buffers. Read more
    source§
    fn is_read_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Reader has an efficient read_vectored\nimplementation. Read more
    source§
    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
    Read all bytes until EOF in this source, placing them into buf. Read more
    source§
    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
    Read all bytes until EOF in this source, appending them to buf. Read more
    source§
    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
    Read the exact number of bytes required to fill buf. Read more
    source§
    fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Read the exact number of bytes required to fill cursor. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adaptor for this instance of Read. Read more
    1.0.0 · source§
    fn bytes(self) -> Bytes<Self>
    where\n    Self: Sized,
    Transforms this Read instance to an Iterator over its bytes. Read more
    1.0.0 · source§
    fn chain<R>(self, next: R) -> Chain<Self, R>
    where\n    R: Read,\n    Self: Sized,
    Creates an adapter which will chain this stream with another. Read more
    1.0.0 · source§
    fn take(self, limit: u64) -> Take<Self>
    where\n    Self: Sized,
    Creates an adapter which will read at most limit bytes from it. Read more
    ","Read","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<R> RngCore for Box<R>
    where\n    R: RngCore + ?Sized,
    source§
    fn next_u32(&mut self) -> u32
    Return the next random u32. Read more
    source§
    fn next_u64(&mut self) -> u64
    Return the next random u64. Read more
    source§
    fn fill_bytes(&mut self, dest: &mut [u8])
    Fill dest with random data. Read more
    source§
    fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
    Fill dest entirely with random data. Read more
    ","RngCore","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<S> Seek for Box<S>
    where\n    S: Seek + ?Sized,
    source§
    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
    Seek to an offset, in bytes, in a stream. Read more
    source§
    fn stream_position(&mut self) -> Result<u64, Error>
    Returns the current seek position from the start of the stream. Read more
    1.55.0 · source§
    fn rewind(&mut self) -> Result<(), Error>
    Rewind to the beginning of a stream. Read more
    source§
    fn stream_len(&mut self) -> Result<u64, Error>
    🔬This is a nightly-only experimental API. (seek_stream_len)
    Returns the length of this stream (in bytes). Read more
    source§
    fn seek_relative(&mut self, offset: i64) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (seek_seek_relative)
    Seeks relative to the current position. Read more
    ","Seek","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Serialize for Box<T>
    where\n    T: Serialize + ?Sized,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Request> Service<Request> for Box<S>
    where\n    S: Service<Request> + ?Sized,
    §
    type Response = <S as Service<Request>>::Response
    Responses given by the service.
    §
    type Error = <S as Service<Request>>::Error
    Errors produced by the service.
    §
    type Future = <S as Service<Request>>::Future
    The future response value.
    §
    fn poll_ready(\n    &mut self,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <S as Service<Request>>::Error>>
    Returns Poll::Ready(Ok(())) when the service is able to process requests. Read more
    §
    fn call(&mut self, request: Request) -> <S as Service<Request>>::Future
    Process the request and return the response asynchronously. Read more
    ","Service","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Item> Sink<Item> for Box<S>
    where\n    S: Sink<Item> + Unpin + ?Sized,
    §
    type Error = <S as Sink<Item>>::Error
    The type of value produced by the sink when an error occurs.
    §
    fn poll_ready(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Attempts to prepare the Sink to receive a value. Read more
    §
    fn start_send(\n    self: Pin<&mut Box<S>>,\n    item: Item\n) -> Result<(), <Box<S> as Sink<Item>>::Error>
    Begin the process of sending a value to the sink.\nEach call to this function must be preceded by a successful call to\npoll_ready which returned Poll::Ready(Ok(())). Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output from this sink. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output and close this sink, if necessary. Read more
    ","Sink","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Source for Box<T>
    where\n    T: Source + ?Sized,
    §
    fn register(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest\n) -> Result<(), Error>
    Register self with the given Registry instance. Read more
    §
    fn reregister(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest\n) -> Result<(), Error>
    Re-register self with the given Registry instance. Read more
    §
    fn deregister(&mut self, registry: &Registry) -> Result<(), Error>
    Deregister self from the given Registry instance. Read more
    ","Source","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> Spawn for Box<Sp>
    where\n    Sp: Spawn + ?Sized,
    §
    fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","Spawn","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Stream for Box<S>
    where\n    S: Stream + Unpin + ?Sized,
    §
    type Item = <S as Stream>::Item
    Values yielded by the stream.
    §
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<<Box<S> as Stream>::Item>>
    Attempt to pull out the next value of this stream, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the stream is exhausted. Read more
    §
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the stream. Read more
    ","Stream","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Subscriber for Box<S>
    where\n    S: Subscriber + ?Sized,
    §
    fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
    Registers a new callsite with this subscriber, returning whether or not\nthe subscriber is interested in being notified about the callsite. Read more
    §
    fn enabled(&self, metadata: &Metadata<'_>) -> bool
    Returns true if a span or event with the specified metadata would be\nrecorded. Read more
    §
    fn max_level_hint(&self) -> Option<LevelFilter>
    Returns the highest verbosity level that this Subscriber will\nenable, or None, if the subscriber does not implement level-based\nfiltering or chooses not to implement this method. Read more
    §
    fn new_span(&self, span: &Attributes<'_>) -> Id
    Visit the construction of a new span, returning a new span ID for the\nspan being constructed. Read more
    §
    fn record(&self, span: &Id, values: &Record<'_>)
    Record a set of values on a span. Read more
    §
    fn record_follows_from(&self, span: &Id, follows: &Id)
    Adds an indication that span follows from the span with the id\nfollows. Read more
    §
    fn event_enabled(&self, event: &Event<'_>) -> bool
    Determine if an [Event] should be recorded. Read more
    §
    fn event(&self, event: &Event<'_>)
    Records that an Event has occurred. Read more
    §
    fn enter(&self, span: &Id)
    Records that a span has been entered. Read more
    §
    fn exit(&self, span: &Id)
    Records that a span has been exited. Read more
    §
    fn clone_span(&self, id: &Id) -> Id
    Notifies the subscriber that a span ID has been cloned. Read more
    §
    fn try_close(&self, id: Id) -> bool
    Notifies the subscriber that a span ID has been dropped, and returns\ntrue if there are now 0 IDs that refer to that span. Read more
    §
    fn drop_span(&self, id: Id)
    👎Deprecated since 0.1.2: use Subscriber::try_close instead
    This method is deprecated. Read more
    §
    fn current_span(&self) -> Current
    Returns a type representing this subscriber’s view of the current span. Read more
    §
    unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
    If self is the same type as the provided TypeId, returns an untyped\n*const pointer to that type. Otherwise, returns None. Read more
    §
    fn on_register_dispatch(&self, subscriber: &Dispatch)
    Invoked when this subscriber becomes a [Dispatch]. Read more
    ","Subscriber","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>
    where\n    F: Future<Output = T> + 'a,
    §
    fn into_raw(self) -> *mut dyn Future<Output = T> + 'a
    Convert an owned instance into a (conceptually owned) fat pointer. Read more
    §
    unsafe fn drop(ptr: *mut dyn Future<Output = T> + 'a)
    Drops the future represented by the given fat pointer. Read more
    ","UnsafeFutureObj<'a, T>","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Value for Box<T>
    where\n    T: Value + ?Sized,
    §
    fn record(&self, key: &Field, visitor: &mut dyn Visit)
    Visits this value with the given Visitor.
    ","Value","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<W> Write for Box<W>
    where\n    W: Write + ?Sized,
    source§
    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
    Write a buffer into this writer, returning how many bytes were written. Read more
    source§
    fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>
    Like write, except that it writes from a slice of buffers. Read more
    source§
    fn is_write_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Writer has an efficient write_vectored\nimplementation. Read more
    source§
    fn flush(&mut self) -> Result<(), Error>
    Flush this output stream, ensuring that all intermediately buffered\ncontents reach their destination. Read more
    source§
    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
    Attempts to write an entire buffer into this writer. Read more
    source§
    fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
    Writes a formatted string into this writer, returning any error\nencountered. Read more
    source§
    fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (write_all_vectored)
    Attempts to write multiple buffers into this writer. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adapter for this instance of Write. Read more
    ","Write","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T> Writeable for Box<T>
    where\n    T: Writeable + ?Sized,
    §
    fn write_to<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: Write + ?Sized,
    Writes a string to the given sink. Errors from the sink are bubbled up.\nThe default implementation delegates to write_to_parts, and discards any\nPart annotations.
    §
    fn write_to_parts<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: PartsWrite + ?Sized,
    Write bytes and Part annotations to the given sink. Errors from the\nsink are bubbled up. The default implementation delegates to write_to,\nand doesn’t produce any Part annotations.
    §
    fn writeable_length_hint(&self) -> LengthHint
    Returns a hint for the number of UTF-8 bytes that will be written to the sink. Read more
    §
    fn write_to_string(&self) -> Cow<'_, str>
    Creates a new String with the data from this Writeable. Like ToString,\nbut smaller and faster. Read more
    §
    fn writeable_cmp_bytes(&self, other: &[u8]) -> Ordering
    Compares the contents of this Writeable to the given bytes\nwithout allocating a String to hold the Writeable contents. Read more
    ","Writeable","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> CartablePointerLike for Box<T>
    ","CartablePointerLike","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
    where\n    T: Unsize<U> + ?Sized,\n    A: Allocator,\n    U: ?Sized,
    ","CoerceUnsized>","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<R> CryptoRng for Box<R>
    where\n    R: CryptoRng + ?Sized,
    ","CryptoRng","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> DerefPure for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","DerefPure","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
    where\n    T: Unsize<U> + ?Sized,\n    U: ?Sized,
    ","DispatchFromDyn>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Eq for Box<T, A>
    where\n    T: Eq + ?Sized,\n    A: Allocator,
    ","Eq","bdk_esplora::blocking_ext::Error"],["
    1.26.0 · source§
    impl<I, A> FusedIterator for Box<I, A>
    where\n    I: FusedIterator + ?Sized,\n    A: Allocator,
    ","FusedIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> IoSafe for Box<T>
    where\n    T: IoSafe + ?Sized,
    ","IoSafe","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> StableDeref for Box<T>
    where\n    T: ?Sized,
    ","StableDeref","bdk_esplora::blocking_ext::Error"],["
    1.33.0 · source§
    impl<T, A> Unpin for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","Unpin","bdk_esplora::blocking_ext::Error"]]
+"bdk_esplora":[["
    §
    impl<T> AnyProvider for Box<T>
    where\n    T: AnyProvider + ?Sized,
    §
    fn load_any(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<AnyResponse, DataError>
    Loads an [AnyPayload] according to the key and request.
    ","AnyProvider","bdk_esplora::blocking_ext::Error"],["
    1.64.0 · source§
    impl<T> AsFd for Box<T>
    where\n    T: AsFd + ?Sized,
    source§
    fn as_fd(&self) -> BorrowedFd<'_>
    Borrows the file descriptor. Read more
    ","AsFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · source§
    impl<T, A> AsMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn as_mut(&mut self) -> &mut T
    Converts this type into a mutable reference of the (usually inferred) input type.
    ","AsMut","bdk_esplora::blocking_ext::Error"],["
    1.63.0 · source§
    impl<T> AsRawFd for Box<T>
    where\n    T: AsRawFd,
    source§
    fn as_raw_fd(&self) -> i32
    Extracts the raw file descriptor. Read more
    ","AsRawFd","bdk_esplora::blocking_ext::Error"],["
    1.5.0 · source§
    impl<T, A> AsRef<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn as_ref(&self) -> &T
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<&[u8], Error>>
    Attempt to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncBufRead for Box<T>
    where\n    T: AsyncBufRead + Unpin + ?Sized,
    §
    fn poll_fill_buf(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<&[u8], Error>>
    Attempts to return the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    §
    fn consume(self: Pin<&mut Box<T>>, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to poll_read. Read more
    ","AsyncBufRead","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFn<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn async_call(\n    &self,\n    args: Args\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFn, returning a future which may borrow from the called closure.
    ","AsyncFn","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnMut<Args> + ?Sized,\n    A: Allocator,
    §
    type CallRefFuture<'a> = <F as AsyncFnMut<Args>>::CallRefFuture<'a>\nwhere\n    Box<F, A>: 'a
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnMut::async_call_mut and AsyncFn::async_call.
    source§
    extern "rust-call" fn async_call_mut(\n    &mut self,\n    args: Args\n) -> <Box<F, A> as AsyncFnMut<Args>>::CallRefFuture<'_>
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnMut, returning a future which may borrow from the called closure.
    ","AsyncFnMut","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<Args, F, A> AsyncFnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: AsyncFnOnce<Args> + ?Sized,\n    A: Allocator,
    §
    type Output = <F as AsyncFnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Output type of the called closure’s future.
    §
    type CallOnceFuture = <F as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Future returned by AsyncFnOnce::async_call_once.
    source§
    extern "rust-call" fn async_call_once(\n    self,\n    args: Args\n) -> <Box<F, A> as AsyncFnOnce<Args>>::CallOnceFuture
    🔬This is a nightly-only experimental API. (async_fn_traits)
    Call the AsyncFnOnce, returning a future which may move out of the called closure.
    ","AsyncFnOnce","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<S> AsyncIterator for Box<S>
    where\n    S: AsyncIterator + Unpin + ?Sized,
    §
    type Item = <S as AsyncIterator>::Item
    🔬This is a nightly-only experimental API. (async_iterator)
    The type of items yielded by the async iterator.
    source§
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<<Box<S> as AsyncIterator>::Item>>
    🔬This is a nightly-only experimental API. (async_iterator)
    Attempt to pull out the next value of this async iterator, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the async iterator is exhausted. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    🔬This is a nightly-only experimental API. (async_iterator)
    Returns the bounds on the remaining length of the async iterator. Read more
    ","AsyncIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut ReadBuf<'_>\n) -> Poll<Result<(), Error>>
    Attempts to read from the AsyncRead into buf. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncRead for Box<T>
    where\n    T: AsyncRead + Unpin + ?Sized,
    §
    fn poll_read(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &mut [u8]\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into buf. Read more
    §
    fn poll_read_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &mut [IoSliceMut<'_>]\n) -> Poll<Result<usize, Error>>
    Attempt to read from the AsyncRead into bufs using vectored\nIO operations. Read more
    ","AsyncRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn poll_seek(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    pos: SeekFrom\n) -> Poll<Result<u64, Error>>
    Attempt to seek to an offset, in bytes, in a stream. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncSeek for Box<T>
    where\n    T: AsyncSeek + Unpin + ?Sized,
    §
    fn start_seek(self: Pin<&mut Box<T>>, pos: SeekFrom) -> Result<(), Error>
    Attempts to seek to an offset, in bytes, in a stream. Read more
    §
    fn poll_complete(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<u64, Error>>
    Waits for a seek operation to complete. Read more
    ","AsyncSeek","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from bufs into the object using vectored\nIO operations. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempt to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempt to close the object. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> AsyncWrite for Box<T>
    where\n    T: AsyncWrite + Unpin + ?Sized,
    §
    fn poll_write(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    buf: &[u8]\n) -> Poll<Result<usize, Error>>
    Attempt to write bytes from buf into the object. Read more
    §
    fn poll_write_vectored(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>,\n    bufs: &[IoSlice<'_>]\n) -> Poll<Result<usize, Error>>
    Like poll_write, except that it writes from a slice of buffers. Read more
    §
    fn is_write_vectored(&self) -> bool
    Determines if this writer has an efficient poll_write_vectored\nimplementation. Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Attempts to flush the object, ensuring that any buffered data reach\ntheir destination. Read more
    §
    fn poll_shutdown(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), Error>>
    Initiates or attempts to shut down this writer, returning success when\nthe I/O connection has completely shut down. Read more
    ","AsyncWrite","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Body for Box<T>
    where\n    T: Body + Unpin + ?Sized,
    §
    type Data = <T as Body>::Data
    Values yielded by the Body.
    §
    type Error = <T as Body>::Error
    The error type this Body might generate.
    source§
    fn poll_data(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<Result<<Box<T> as Body>::Data, <Box<T> as Body>::Error>>>
    Attempt to pull out the next data buffer of this stream.
    source§
    fn poll_trailers(\n    self: Pin<&mut Box<T>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<Option<HeaderMap>, <Box<T> as Body>::Error>>
    Poll for an optional single HeaderMap of trailers. Read more
    source§
    fn is_end_stream(&self) -> bool
    Returns true when the end of stream has been reached. Read more
    source§
    fn size_hint(&self) -> SizeHint
    Returns the bounds on the remaining length of the stream. Read more
    source§
    fn data(&mut self) -> Data<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to next data chunk, if any.
    source§
    fn trailers(&mut self) -> Trailers<'_, Self>
    where\n    Self: Sized + Unpin,
    Returns future that resolves to trailers, if any.
    source§
    fn map_data<F, B>(self, f: F) -> MapData<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Data) -> B,\n    B: Buf,
    Maps this body’s data value to a different value.
    source§
    fn map_err<F, E>(self, f: F) -> MapErr<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Error) -> E,
    Maps this body’s error value to a different value.
    source§
    fn collect(self) -> Collect<Self>
    where\n    Self: Sized,
    Turn this body into Collected body which will collect all the DATA frames\nand trailers.
    ","Body","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · source§
    impl<T, A> Borrow<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn borrow(&self) -> &T
    Immutably borrows from an owned value. Read more
    ","Borrow","bdk_esplora::blocking_ext::Error"],["
    1.1.0 · source§
    impl<T, A> BorrowMut<T> for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn borrow_mut(&mut self) -> &mut T
    Mutably borrows from an owned value. Read more
    ","BorrowMut","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> BoundDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: BoundDataProvider<M> + ?Sized,
    §
    fn load_bound(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    §
    fn bound_key(&self) -> DataKey
    Returns the [DataKey] that this provider uses for loading data.
    ","BoundDataProvider","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Box<T>
    1.0.0 · source
    pub fn new(x: T) -> Box<T>
    Allocates memory on the heap and then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    let five = Box::new(5);
    \n
    source
    pub fn new_uninit() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_uninit)
    Constructs a new box with uninitialized contents.
    \n
    §Examples
    \n
    #![feature(new_uninit)]\n\nlet mut five = Box::<u32>::new_uninit();\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    source
    pub fn new_zeroed() -> Box<MaybeUninit<T>>
    🔬This is a nightly-only experimental API. (new_uninit)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(new_uninit)]\n\nlet zero = Box::<u32>::new_zeroed();\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    1.33.0 · source
    pub fn pin(x: T) -> Pin<Box<T>>
    Constructs a new Pin<Box<T>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin(x)\ndoes the same as Box::into_pin(Box::new(x)). Consider using\ninto_pin if you already have a Box<T>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new.
    \n
    source
    pub fn try_new(x: T) -> Result<Box<T>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory on the heap then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nlet five = Box::try_new(5)?;
    \n
    source
    pub fn try_new_uninit() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents on the heap,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nlet mut five = Box::<u32>::try_new_uninit()?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    source
    pub fn try_new_zeroed() -> Result<Box<MaybeUninit<T>>, AllocError>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes on the heap
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nlet zero = Box::<u32>::try_new_zeroed()?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Box<T>
    where\n    T: ?Sized,
    1.4.0 · source
    pub unsafe fn from_raw(raw: *mut T) -> Box<T>
    Constructs a box from a raw pointer.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    The safety conditions are described in the memory layout section.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw:
    \n\n
    let x = Box::new(5);\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manually create a Box from scratch by using the global allocator:
    \n\n
    use std::alloc::{alloc, Layout};\n\nunsafe {\n    let ptr = alloc(Layout::new::<i32>()) as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw(ptr);\n}
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,
    source
    pub fn new_in(x: T, alloc: A) -> Box<T, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it.
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::new_in(5, System);
    \n
    source
    pub fn try_new_in(x: T, alloc: A) -> Result<Box<T, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Allocates memory in the given allocator then places x into it,\nreturning an error if the allocation fails
    \n
    This doesn’t actually allocate if T is zero-sized.
    \n
    §Examples
    \n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet five = Box::try_new_in(5, System)?;
    \n
    source
    pub fn new_uninit_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::new_uninit_in(System);\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5)
    \n
    source
    pub fn try_new_uninit_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new box with uninitialized contents in the provided allocator,\nreturning an error if the allocation fails
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet mut five = Box::<u32, _>::try_new_uninit_in(System)?;\n\nlet five = unsafe {\n    // Deferred initialization:\n    five.as_mut_ptr().write(5);\n\n    five.assume_init()\n};\n\nassert_eq!(*five, 5);
    \n
    source
    pub fn new_zeroed_in(alloc: A) -> Box<MaybeUninit<T>, A>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator.
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::new_zeroed_in(System);\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0)
    \n
    source
    pub fn try_new_zeroed_in(alloc: A) -> Result<Box<MaybeUninit<T>, A>, AllocError>
    where\n    A: Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Box with uninitialized contents, with the memory\nbeing filled with 0 bytes in the provided allocator,\nreturning an error if the allocation fails,
    \n
    See MaybeUninit::zeroed for examples of correct and incorrect usage\nof this method.
    \n
    §Examples
    \n
    #![feature(allocator_api, new_uninit)]\n\nuse std::alloc::System;\n\nlet zero = Box::<u32, _>::try_new_zeroed_in(System)?;\nlet zero = unsafe { zero.assume_init() };\n\nassert_eq!(*zero, 0);
    \n
    source
    pub fn pin_in(x: T, alloc: A) -> Pin<Box<T, A>>
    where\n    A: 'static + Allocator,
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a new Pin<Box<T, A>>. If T does not implement Unpin, then\nx will be pinned in memory and unable to be moved.
    \n
    Constructing and pinning of the Box can also be done in two steps: Box::pin_in(x, alloc)\ndoes the same as Box::into_pin(Box::new_in(x, alloc)). Consider using\ninto_pin if you already have a Box<T, A>, or if you want to\nconstruct a (pinned) Box in a different way than with Box::new_in.
    \n
    source
    pub fn into_boxed_slice(boxed: Box<T, A>) -> Box<[T], A>
    🔬This is a nightly-only experimental API. (box_into_boxed_slice)
    Converts a Box<T> into a Box<[T]>
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    source
    pub fn into_inner(boxed: Box<T, A>) -> T
    🔬This is a nightly-only experimental API. (box_into_inner)
    Consumes the Box, returning the wrapped value.
    \n
    §Examples
    \n
    #![feature(box_into_inner)]\n\nlet c = Box::new(5);\n\nassert_eq!(Box::into_inner(c), 5);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    const: unstable · source
    pub unsafe fn from_raw_in(raw: *mut T, alloc: A) -> Box<T, A>
    🔬This is a nightly-only experimental API. (allocator_api)
    Constructs a box from a raw pointer in the given allocator.
    \n
    After calling this function, the raw pointer is owned by the\nresulting Box. Specifically, the Box destructor will call\nthe destructor of T and free the allocated memory. For this\nto be safe, the memory must have been allocated in accordance\nwith the memory layout used by Box .
    \n
    §Safety
    \n
    This function is unsafe because improper use may lead to\nmemory problems. For example, a double-free may occur if the\nfunction is called twice on the same raw pointer.
    \n
    §Examples
    \n
    Recreate a Box which was previously converted to a raw pointer\nusing Box::into_raw_with_allocator:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(5, System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manually create a Box from scratch by using the system allocator:
    \n\n
    #![feature(allocator_api, slice_ptr_get)]\n\nuse std::alloc::{Allocator, Layout, System};\n\nunsafe {\n    let ptr = System.allocate(Layout::new::<i32>())?.as_mut_ptr() as *mut i32;\n    // In general .write is required to avoid attempting to destruct\n    // the (uninitialized) previous contents of `ptr`, though for this\n    // simple example `*ptr = 5` would have worked as well.\n    ptr.write(5);\n    let x = Box::from_raw_in(ptr, System);\n}
    \n
    1.4.0 · source
    pub fn into_raw(b: Box<T, A>) -> *mut T
    Consumes the Box, returning a wrapped raw pointer.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw(b) instead of b.into_raw(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw\nfor automatic cleanup:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nlet x = unsafe { Box::from_raw(ptr) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    use std::alloc::{dealloc, Layout};\nuse std::ptr;\n\nlet x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    dealloc(ptr as *mut u8, Layout::new::<String>());\n}
    \n
    Note: This is equivalent to the following:
    \n\n
    let x = Box::new(String::from(\"Hello\"));\nlet ptr = Box::into_raw(x);\nunsafe {\n    drop(Box::from_raw(ptr));\n}
    \n
    source
    pub fn into_raw_with_allocator(b: Box<T, A>) -> (*mut T, A)
    🔬This is a nightly-only experimental API. (allocator_api)
    Consumes the Box, returning a wrapped raw pointer and the allocator.
    \n
    The pointer will be properly aligned and non-null.
    \n
    After calling this function, the caller is responsible for the\nmemory previously managed by the Box. In particular, the\ncaller should properly destroy T and release the memory, taking\ninto account the memory layout used by Box. The easiest way to\ndo this is to convert the raw pointer back into a Box with the\nBox::from_raw_in function, allowing the Box destructor to perform\nthe cleanup.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::into_raw_with_allocator(b) instead of b.into_raw_with_allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Converting the raw pointer back into a Box with Box::from_raw_in\nfor automatic cleanup:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::System;\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nlet x = unsafe { Box::from_raw_in(ptr, alloc) };
    \n
    Manual cleanup by explicitly running the destructor and deallocating\nthe memory:
    \n\n
    #![feature(allocator_api)]\n\nuse std::alloc::{Allocator, Layout, System};\nuse std::ptr::{self, NonNull};\n\nlet x = Box::new_in(String::from(\"Hello\"), System);\nlet (ptr, alloc) = Box::into_raw_with_allocator(x);\nunsafe {\n    ptr::drop_in_place(ptr);\n    let non_null = NonNull::new_unchecked(ptr);\n    alloc.deallocate(non_null.cast(), Layout::new::<String>());\n}
    \n
    const: unstable · source
    pub fn allocator(b: &Box<T, A>) -> &A
    🔬This is a nightly-only experimental API. (allocator_api)
    Returns a reference to the underlying allocator.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::allocator(&b) instead of b.allocator(). This\nis so that there is no conflict with a method on the inner type.
    \n
    1.26.0 · source
    pub fn leak<'a>(b: Box<T, A>) -> &'a mut T
    where\n    A: 'a,
    Consumes and leaks the Box, returning a mutable reference,\n&'a mut T. Note that the type T must outlive the chosen lifetime\n'a. If the type has only static references, or none at all, then this\nmay be chosen to be 'static.
    \n
    This function is mainly useful for data that lives for the remainder of\nthe program’s life. Dropping the returned reference will cause a memory\nleak. If this is not acceptable, the reference should first be wrapped\nwith the Box::from_raw function producing a Box. This Box can\nthen be dropped which will properly destroy T and release the\nallocated memory.
    \n
    Note: this is an associated function, which means that you have\nto call it as Box::leak(b) instead of b.leak(). This\nis so that there is no conflict with a method on the inner type.
    \n
    §Examples
    \n
    Simple usage:
    \n\n
    let x = Box::new(41);\nlet static_ref: &'static mut usize = Box::leak(x);\n*static_ref += 1;\nassert_eq!(*static_ref, 42);
    \n
    Unsized data:
    \n\n
    let x = vec![1, 2, 3].into_boxed_slice();\nlet static_ref = Box::leak(x);\nstatic_ref[0] = 4;\nassert_eq!(*static_ref, [4, 2, 3]);
    \n
    1.63.0 (const: unstable) · source
    pub fn into_pin(boxed: Box<T, A>) -> Pin<Box<T, A>>
    where\n    A: 'static,
    Converts a Box<T> into a Pin<Box<T>>. If T does not implement Unpin, then\n*boxed will be pinned in memory and unable to be moved.
    \n
    This conversion does not allocate on the heap and happens in place.
    \n
    This is also available via From.
    \n
    Constructing and pinning a Box with Box::into_pin(Box::new(x))\ncan also be written more concisely using Box::pin(x).\nThis into_pin method is useful if you already have a Box<T>, or you are\nconstructing a (pinned) Box in a different way than with Box::new.
    \n
    §Notes
    \n
    It’s not recommended that crates add an impl like From<Box<T>> for Pin<T>,\nas it’ll introduce an ambiguity when calling Pin::from.\nA demonstration of such a poor impl is shown below.
    \n\n
    ⓘ
    struct Foo; // A type defined in this crate.\nimpl From<Box<()>> for Pin<Foo> {\n    fn from(_: Box<()>) -> Pin<Foo> {\n        Pin::new(Foo)\n    }\n}\n\nlet foo = Box::new(());\nlet bar = Pin::from(foo);
    \n
    ",0,"bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Buf for Box<T>
    where\n    T: Buf + ?Sized,
    §
    fn remaining(&self) -> usize
    Returns the number of bytes between the current position and the end of\nthe buffer. Read more
    §
    fn chunk(&self) -> &[u8] ⓘ
    Returns a slice starting at the current position and of length between 0\nand Buf::remaining(). Note that this can return a shorter slice (this\nallows non-continuous internal representation). Read more
    §
    fn chunks_vectored<'b>(&'b self, dst: &mut [IoSlice<'b>]) -> usize
    Fills dst with potentially multiple slices starting at self’s\ncurrent position. Read more
    §
    fn advance(&mut self, cnt: usize)
    Advance the internal cursor of the Buf Read more
    §
    fn has_remaining(&self) -> bool
    Returns true if there are any more bytes to consume Read more
    §
    fn copy_to_slice(&mut self, dst: &mut [u8])
    Copies bytes from self into dst. Read more
    §
    fn get_u8(&mut self) -> u8
    Gets an unsigned 8 bit integer from self. Read more
    §
    fn get_i8(&mut self) -> i8
    Gets a signed 8 bit integer from self. Read more
    §
    fn get_u16(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_u16_le(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_u16_ne(&mut self) -> u16
    Gets an unsigned 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_i16(&mut self) -> i16
    Gets a signed 16 bit integer from self in big-endian byte order. Read more
    §
    fn get_i16_le(&mut self) -> i16
    Gets a signed 16 bit integer from self in little-endian byte order. Read more
    §
    fn get_i16_ne(&mut self) -> i16
    Gets a signed 16 bit integer from self in native-endian byte order. Read more
    §
    fn get_u32(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the big-endian byte order. Read more
    §
    fn get_u32_le(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in the little-endian byte order. Read more
    §
    fn get_u32_ne(&mut self) -> u32
    Gets an unsigned 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_i32(&mut self) -> i32
    Gets a signed 32 bit integer from self in big-endian byte order. Read more
    §
    fn get_i32_le(&mut self) -> i32
    Gets a signed 32 bit integer from self in little-endian byte order. Read more
    §
    fn get_i32_ne(&mut self) -> i32
    Gets a signed 32 bit integer from self in native-endian byte order. Read more
    §
    fn get_u64(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_u64_le(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_u64_ne(&mut self) -> u64
    Gets an unsigned 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_i64(&mut self) -> i64
    Gets a signed 64 bit integer from self in big-endian byte order. Read more
    §
    fn get_i64_le(&mut self) -> i64
    Gets a signed 64 bit integer from self in little-endian byte order. Read more
    §
    fn get_i64_ne(&mut self) -> i64
    Gets a signed 64 bit integer from self in native-endian byte order. Read more
    §
    fn get_uint(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in big-endian byte order. Read more
    §
    fn get_uint_le(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in little-endian byte order. Read more
    §
    fn get_uint_ne(&mut self, nbytes: usize) -> u64
    Gets an unsigned n-byte integer from self in native-endian byte order. Read more
    §
    fn get_int(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in big-endian byte order. Read more
    §
    fn get_int_le(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in little-endian byte order. Read more
    §
    fn get_int_ne(&mut self, nbytes: usize) -> i64
    Gets a signed n-byte integer from self in native-endian byte order. Read more
    §
    fn copy_to_bytes(&mut self, len: usize) -> Bytes
    Consumes len bytes inside self and returns new instance of Bytes\nwith this data. Read more
    §
    fn get_u128(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_u128_le(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_u128_ne(&mut self) -> u128
    Gets an unsigned 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_i128(&mut self) -> i128
    Gets a signed 128 bit integer from self in big-endian byte order. Read more
    §
    fn get_i128_le(&mut self) -> i128
    Gets a signed 128 bit integer from self in little-endian byte order. Read more
    §
    fn get_i128_ne(&mut self) -> i128
    Gets a signed 128 bit integer from self in native-endian byte order. Read more
    §
    fn get_f32(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f32_le(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f32_ne(&mut self) -> f32
    Gets an IEEE754 single-precision (4 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn get_f64(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in big-endian byte order. Read more
    §
    fn get_f64_le(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in little-endian byte order. Read more
    §
    fn get_f64_ne(&mut self) -> f64
    Gets an IEEE754 double-precision (8 bytes) floating point number from\nself in native-endian byte order. Read more
    §
    fn take(self, limit: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an adaptor which will read at most limit bytes from self. Read more
    §
    fn chain<U>(self, next: U) -> Chain<Self, U>
    where\n    U: Buf,\n    Self: Sized,
    Creates an adaptor which will chain this buffer with another. Read more
    §
    fn reader(self) -> Reader<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Read trait for self. Read more
    ","Buf","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufMut for Box<T>
    where\n    T: BufMut + ?Sized,
    §
    fn remaining_mut(&self) -> usize
    Returns the number of bytes that can be written from the current\nposition until the end of the buffer is reached. Read more
    §
    fn chunk_mut(&mut self) -> &mut UninitSlice
    Returns a mutable slice starting at the current BufMut position and of\nlength between 0 and BufMut::remaining_mut(). Note that this can be shorter than the\nwhole remainder of the buffer (this allows non-continuous implementation). Read more
    §
    unsafe fn advance_mut(&mut self, cnt: usize)
    Advance the internal cursor of the BufMut Read more
    §
    fn put_slice(&mut self, src: &[u8])
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_u8(&mut self, n: u8)
    Writes an unsigned 8 bit integer to self. Read more
    §
    fn put_i8(&mut self, n: i8)
    Writes a signed 8 bit integer to self. Read more
    §
    fn put_u16(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_u16_le(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_u16_ne(&mut self, n: u16)
    Writes an unsigned 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_i16(&mut self, n: i16)
    Writes a signed 16 bit integer to self in big-endian byte order. Read more
    §
    fn put_i16_le(&mut self, n: i16)
    Writes a signed 16 bit integer to self in little-endian byte order. Read more
    §
    fn put_i16_ne(&mut self, n: i16)
    Writes a signed 16 bit integer to self in native-endian byte order. Read more
    §
    fn put_u32(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_u32_le(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_u32_ne(&mut self, n: u32)
    Writes an unsigned 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_i32(&mut self, n: i32)
    Writes a signed 32 bit integer to self in big-endian byte order. Read more
    §
    fn put_i32_le(&mut self, n: i32)
    Writes a signed 32 bit integer to self in little-endian byte order. Read more
    §
    fn put_i32_ne(&mut self, n: i32)
    Writes a signed 32 bit integer to self in native-endian byte order. Read more
    §
    fn put_u64(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u64_le(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_u64_ne(&mut self, n: u64)
    Writes an unsigned 64 bit integer to self in native-endian byte order. Read more
    §
    fn put_i64(&mut self, n: i64)
    Writes a signed 64 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i64_le(&mut self, n: i64)
    Writes a signed 64 bit integer to self in little-endian byte order. Read more
    §
    fn put_i64_ne(&mut self, n: i64)
    Writes a signed 64 bit integer to self in native-endian byte order. Read more
    §
    fn has_remaining_mut(&self) -> bool
    Returns true if there is space in self for more bytes. Read more
    §
    fn put<T>(&mut self, src: T)
    where\n    T: Buf,\n    Self: Sized,
    Transfer bytes into self from src and advance the cursor by the\nnumber of bytes written. Read more
    §
    fn put_bytes(&mut self, val: u8, cnt: usize)
    Put cnt bytes val into self. Read more
    §
    fn put_u128(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_u128_le(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_u128_ne(&mut self, n: u128)
    Writes an unsigned 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_i128(&mut self, n: i128)
    Writes a signed 128 bit integer to self in the big-endian byte order. Read more
    §
    fn put_i128_le(&mut self, n: i128)
    Writes a signed 128 bit integer to self in little-endian byte order. Read more
    §
    fn put_i128_ne(&mut self, n: i128)
    Writes a signed 128 bit integer to self in native-endian byte order. Read more
    §
    fn put_uint(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in big-endian byte order. Read more
    §
    fn put_uint_le(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the little-endian byte order. Read more
    §
    fn put_uint_ne(&mut self, n: u64, nbytes: usize)
    Writes an unsigned n-byte integer to self in the native-endian byte order. Read more
    §
    fn put_int(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in big-endian byte order. Read more
    §
    fn put_int_le(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in little-endian byte order. Read more
    §
    fn put_int_ne(&mut self, n: i64, nbytes: usize)
    Writes low nbytes of a signed integer to self in native-endian byte order. Read more
    §
    fn put_f32(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f32_le(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f32_ne(&mut self, n: f32)
    Writes an IEEE754 single-precision (4 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn put_f64(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in big-endian byte order. Read more
    §
    fn put_f64_le(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in little-endian byte order. Read more
    §
    fn put_f64_ne(&mut self, n: f64)
    Writes an IEEE754 double-precision (8 bytes) floating point number to\nself in native-endian byte order. Read more
    §
    fn limit(self, limit: usize) -> Limit<Self>
    where\n    Self: Sized,
    Creates an adaptor which can write at most limit bytes to self. Read more
    §
    fn writer(self) -> Writer<Self>
    where\n    Self: Sized,
    Creates an adaptor which implements the Write trait for self. Read more
    §
    fn chain_mut<U>(self, next: U) -> Chain<Self, U>
    where\n    U: BufMut,\n    Self: Sized,
    Creates an adapter which will chain this buffer with another. Read more
    ","BufMut","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<B> BufRead for Box<B>
    where\n    B: BufRead + ?Sized,
    source§
    fn fill_buf(&mut self) -> Result<&[u8], Error>
    Returns the contents of the internal buffer, filling it with more data\nfrom the inner reader if it is empty. Read more
    source§
    fn consume(&mut self, amt: usize)
    Tells this buffer that amt bytes have been consumed from the buffer,\nso they should no longer be returned in calls to read. Read more
    source§
    fn read_until(&mut self, byte: u8, buf: &mut Vec<u8>) -> Result<usize, Error>
    Read all bytes into buf until the delimiter byte or EOF is reached. Read more
    source§
    fn read_line(&mut self, buf: &mut String) -> Result<usize, Error>
    Read all bytes until a newline (the 0xA byte) is reached, and append\nthem to the provided String buffer. Read more
    source§
    fn has_data_left(&mut self) -> Result<bool, Error>
    🔬This is a nightly-only experimental API. (buf_read_has_data_left)
    Check if the underlying Read has any data left to be read. Read more
    source§
    fn skip_until(&mut self, byte: u8) -> Result<usize, Error>
    🔬This is a nightly-only experimental API. (bufread_skip_until)
    Skip all bytes until the delimiter byte or EOF is reached. Read more
    1.0.0 · source§
    fn split(self, byte: u8) -> Split<Self>
    where\n    Self: Sized,
    Returns an iterator over the contents of this reader split on the byte\nbyte. Read more
    1.0.0 · source§
    fn lines(self) -> Lines<Self>
    where\n    Self: Sized,
    Returns an iterator over the lines of this reader. Read more
    ","BufRead","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> BufferProvider for Box<T>
    where\n    T: BufferProvider + ?Sized,
    §
    fn load_buffer(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<DataResponse<BufferMarker>, DataError>
    Loads a [DataPayload]<[BufferMarker]> according to the key and request.
    ","BufferProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Clone for Box<T, A>
    where\n    T: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> Box<T, A>
    Returns a new box with a clone() of this box’s contents.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet y = x.clone();\n\n// The value is the same\nassert_eq!(x, y);\n\n// But they are unique objects\nassert_ne!(&*x as *const i32, &*y as *const i32);
    \n
    source§
    fn clone_from(&mut self, source: &Box<T, A>)
    Copies source’s contents into self without creating a new allocation.
    \n
    §Examples
    \n
    let x = Box::new(5);\nlet mut y = Box::new(10);\nlet yp: *const i32 = &*y;\n\ny.clone_from(&x);\n\n// The value is the same\nassert_eq!(x, y);\n\n// And no allocation occurred\nassert_eq!(yp, &*y);
    \n
    ","Clone","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<G, R, A> Coroutine<R> for Box<G, A>
    where\n    G: Coroutine<R> + Unpin + ?Sized,\n    A: Allocator,
    §
    type Yield = <G as Coroutine<R>>::Yield
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine yields. Read more
    §
    type Return = <G as Coroutine<R>>::Return
    🔬This is a nightly-only experimental API. (coroutine_trait)
    The type of value this coroutine returns. Read more
    source§
    fn resume(\n    self: Pin<&mut Box<G, A>>,\n    arg: R\n) -> CoroutineState<<Box<G, A> as Coroutine<R>>::Yield, <Box<G, A> as Coroutine<R>>::Return>
    🔬This is a nightly-only experimental API. (coroutine_trait)
    Resumes the execution of this coroutine. Read more
    ","Coroutine","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DataProvider<M> for Box<P>
    where\n    M: KeyedDataMarker,\n    P: DataProvider<M> + ?Sized,
    §
    fn load(&self, req: DataRequest<'_>) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DataProvider","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Debug for Box<T, A>
    where\n    T: Debug + ?Sized,\n    A: Allocator,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T> Default for Box<T>
    where\n    T: Default,
    source§
    fn default() -> Box<T>
    Creates a Box<T>, with the Default value for T.
    \n
    ","Default","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Deref for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    §
    type Target = T
    The resulting type after dereferencing.
    source§
    fn deref(&self) -> &T
    Dereferences the value.
    ","Deref","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> DerefMut for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn deref_mut(&mut self) -> &mut T
    Mutably dereferences the value.
    ","DerefMut","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<'de, T> Deserialize<'de> for Box<T>
    where\n    T: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<Box<T>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Display for Box<T, A>
    where\n    T: Display + ?Sized,\n    A: Allocator,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Display","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> DoubleEndedIterator for Box<I, A>
    where\n    I: DoubleEndedIterator + ?Sized,\n    A: Allocator,
    source§
    fn next_back(&mut self) -> Option<<I as Iterator>::Item>
    Removes and returns an element from the end of the iterator. Read more
    source§
    fn nth_back(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element from the end of the iterator. Read more
    source§
    fn advance_back_by(&mut self, n: usize) -> Result<(), NonZero<usize>>
    🔬This is a nightly-only experimental API. (iter_advance_by)
    Advances the iterator from the back by n elements. Read more
    1.27.0 · source§
    fn try_rfold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    This is the reverse version of Iterator::try_fold(): it takes\nelements starting from the back of the iterator. Read more
    1.27.0 · source§
    fn rfold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    An iterator method that reduces the iterator’s elements to a single,\nfinal value, starting from the back. Read more
    1.27.0 · source§
    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator from the back that satisfies a predicate. Read more
    ","DoubleEndedIterator","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Drop for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_esplora::blocking_ext::Error"],["
    §
    impl<M, P> DynamicDataProvider<M> for Box<P>
    where\n    M: DataMarker,\n    P: DynamicDataProvider<M> + ?Sized,
    §
    fn load_data(\n    &self,\n    key: DataKey,\n    req: DataRequest<'_>\n) -> Result<DataResponse<M>, DataError>
    Query the provider for data, returning the result. Read more
    ","DynamicDataProvider","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> EncodeAsVarULE<T> for Box<T>
    where\n    T: VarULE + ?Sized,
    §
    fn encode_var_ule_as_slices<R>(&self, cb: impl FnOnce(&[&[u8]]) -> R) -> R
    Calls cb with a piecewise list of byte slices that when concatenated\nproduce the memory pattern of the corresponding instance of T. Read more
    §
    fn encode_var_ule_len(&self) -> usize
    Return the length, in bytes, of the corresponding [VarULE] type
    §
    fn encode_var_ule_write(&self, dst: &mut [u8])
    Write the corresponding [VarULE] type to the dst buffer. dst should\nbe the size of [Self::encode_var_ule_len()]
    ","EncodeAsVarULE","bdk_esplora::blocking_ext::Error"],["
    1.8.0 · source§
    impl<T> Error for Box<T>
    where\n    T: Error,
    source§
    fn description(&self) -> &str
    👎Deprecated since 1.42.0: use the Display impl or to_string()
     Read more
    source§
    fn cause(&self) -> Option<&dyn Error>
    👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
    source§
    fn source(&self) -> Option<&(dyn Error + 'static)>
    The lower-level source of this error, if any. Read more
    source§
    fn provide<'b>(&'b self, request: &mut Request<'b>)
    🔬This is a nightly-only experimental API. (error_generic_member_access)
    Provides type based access to context intended for error reports. Read more
    ","Error","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> ExactSizeIterator for Box<I, A>
    where\n    I: ExactSizeIterator + ?Sized,\n    A: Allocator,
    source§
    fn len(&self) -> usize
    Returns the exact remaining length of the iterator. Read more
    source§
    fn is_empty(&self) -> bool
    🔬This is a nightly-only experimental API. (exact_size_is_empty)
    Returns true if the iterator is empty. Read more
    ","ExactSizeIterator","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> Fn<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: Fn<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn call(\n    &self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","Fn","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> FnMut<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnMut<Args> + ?Sized,\n    A: Allocator,
    source§
    extern "rust-call" fn call_mut(\n    &mut self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnMut","bdk_esplora::blocking_ext::Error"],["
    1.35.0 · source§
    impl<Args, F, A> FnOnce<Args> for Box<F, A>
    where\n    Args: Tuple,\n    F: FnOnce<Args> + ?Sized,\n    A: Allocator,
    §
    type Output = <F as FnOnce<Args>>::Output
    The returned type after the call operator is used.
    source§
    extern "rust-call" fn call_once(\n    self,\n    args: Args\n) -> <Box<F, A> as FnOnce<Args>>::Output
    🔬This is a nightly-only experimental API. (fn_traits)
    Performs the call operation.
    ","FnOnce","bdk_esplora::blocking_ext::Error"],["
    1.6.0 · source§
    impl<T> From<T> for Box<T>
    source§
    fn from(t: T) -> Box<T>
    Converts a T into a Box<T>
    \n
    The conversion allocates on the heap and moves t\nfrom the stack into it.
    \n
    §Examples
    \n
    let x = 5;\nlet boxed = Box::new(5);\n\nassert_eq!(Box::from(x), boxed);
    \n
    ","From","bdk_esplora::blocking_ext::Error"],["
    §
    impl<F> FusedFuture for Box<F>
    where\n    F: FusedFuture + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the underlying future should no longer be polled.
    ","FusedFuture","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> FusedStream for Box<S>
    where\n    S: FusedStream + Unpin + ?Sized,
    §
    fn is_terminated(&self) -> bool
    Returns true if the stream should no longer be polled.
    ","FusedStream","bdk_esplora::blocking_ext::Error"],["
    1.36.0 · source§
    impl<F, A> Future for Box<F, A>
    where\n    F: Future + Unpin + ?Sized,\n    A: Allocator,
    §
    type Output = <F as Future>::Output
    The type of value produced on completion.
    source§
    fn poll(\n    self: Pin<&mut Box<F, A>>,\n    cx: &mut Context<'_>\n) -> Poll<<Box<F, A> as Future>::Output>
    Attempt to resolve the future to a final value, registering\nthe current task for wakeup if the value is not yet available. Read more
    ","Future","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Hash for Box<T, A>
    where\n    T: Hash + ?Sized,\n    A: Allocator,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_esplora::blocking_ext::Error"],["
    1.22.0 · source§
    impl<T, A> Hasher for Box<T, A>
    where\n    T: Hasher + ?Sized,\n    A: Allocator,
    source§
    fn finish(&self) -> u64
    Returns the hash value for the values written so far. Read more
    source§
    fn write(&mut self, bytes: &[u8])
    Writes some data into this Hasher. Read more
    source§
    fn write_u8(&mut self, i: u8)
    Writes a single u8 into this hasher.
    source§
    fn write_u16(&mut self, i: u16)
    Writes a single u16 into this hasher.
    source§
    fn write_u32(&mut self, i: u32)
    Writes a single u32 into this hasher.
    source§
    fn write_u64(&mut self, i: u64)
    Writes a single u64 into this hasher.
    source§
    fn write_u128(&mut self, i: u128)
    Writes a single u128 into this hasher.
    source§
    fn write_usize(&mut self, i: usize)
    Writes a single usize into this hasher.
    source§
    fn write_i8(&mut self, i: i8)
    Writes a single i8 into this hasher.
    source§
    fn write_i16(&mut self, i: i16)
    Writes a single i16 into this hasher.
    source§
    fn write_i32(&mut self, i: i32)
    Writes a single i32 into this hasher.
    source§
    fn write_i64(&mut self, i: i64)
    Writes a single i64 into this hasher.
    source§
    fn write_i128(&mut self, i: i128)
    Writes a single i128 into this hasher.
    source§
    fn write_isize(&mut self, i: isize)
    Writes a single isize into this hasher.
    source§
    fn write_length_prefix(&mut self, len: usize)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a length prefix into this hasher, as part of being prefix-free. Read more
    source§
    fn write_str(&mut self, s: &str)
    🔬This is a nightly-only experimental API. (hasher_prefixfree_extras)
    Writes a single str into this hasher. Read more
    ","Hasher","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<I, A> Iterator for Box<I, A>
    where\n    I: Iterator + ?Sized,\n    A: Allocator,
    §
    type Item = <I as Iterator>::Item
    The type of the elements being iterated over.
    source§
    fn next(&mut self) -> Option<<I as Iterator>::Item>
    Advances the iterator and returns the next value. Read more
    source§
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the iterator. Read more
    source§
    fn nth(&mut self, n: usize) -> Option<<I as Iterator>::Item>
    Returns the nth element of the iterator. Read more
    source§
    fn last(self) -> Option<<I as Iterator>::Item>
    Consumes the iterator, returning the last element. Read more
    source§
    fn next_chunk<const N: usize>(\n    &mut self\n) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>
    where\n    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 count(self) -> usize
    where\n    Self: Sized,
    Consumes the iterator, counting the number of iterations and returning it. Read more
    source§
    fn advance_by(&mut self, n: usize) -> Result<(), NonZero<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\n    Self: Sized,
    Creates an iterator starting at the same point, but stepping by\nthe given amount at each iteration. Read more
    1.0.0 · source§
    fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    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\n    Self: Sized,\n    G: FnMut() -> Self::Item,
    🔬This is a nightly-only experimental API. (iter_intersperse)
    Creates a new iterator which places an item generated by separator\nbetween adjacent items of the original iterator. Read more
    1.0.0 · source§
    fn map<B, F>(self, f: F) -> Map<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> B,
    Takes a closure and creates an iterator which calls that closure on each\nelement. Read more
    1.21.0 · source§
    fn for_each<F>(self, f: F)
    where\n    Self: Sized,\n    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\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator which uses a closure to determine if an element\nshould be yielded. Read more
    1.0.0 · source§
    fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Creates an iterator that both filters and maps. Read more
    1.0.0 · source§
    fn enumerate(self) -> Enumerate<Self>
    where\n    Self: Sized,
    Creates an iterator which gives the current iteration count as well as\nthe next value. Read more
    1.0.0 · source§
    fn peekable(self) -> Peekable<Self>
    where\n    Self: Sized,
    Creates an iterator which can use the peek and peek_mut methods\nto look at the next element of the iterator without consuming it. See\ntheir documentation for more information. Read more
    1.0.0 · source§
    fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator that skips elements based on a predicate. Read more
    1.0.0 · source§
    fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Creates an iterator that yields elements based on a predicate. Read more
    1.57.0 · source§
    fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> Option<B>,
    Creates an iterator that both yields elements based on a predicate and maps. Read more
    1.0.0 · source§
    fn skip(self, n: usize) -> Skip<Self>
    where\n    Self: Sized,
    Creates an iterator that skips the first n elements. Read more
    1.0.0 · source§
    fn take(self, n: usize) -> Take<Self>
    where\n    Self: Sized,
    Creates an iterator that yields the first n elements, or fewer\nif the underlying iterator ends sooner. Read more
    1.0.0 · source§
    fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>
    where\n    Self: Sized,\n    F: FnMut(&mut St, Self::Item) -> Option<B>,
    An iterator adapter which, like fold, holds internal state, but\nunlike fold, produces a new iterator. Read more
    1.0.0 · source§
    fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>
    where\n    Self: Sized,\n    U: IntoIterator,\n    F: FnMut(Self::Item) -> U,
    Creates an iterator that works like map, but flattens nested structure. Read more
    source§
    fn map_windows<F, R, const N: usize>(self, f: F) -> MapWindows<Self, F, N>
    where\n    Self: Sized,\n    F: FnMut(&[Self::Item; N]) -> R,
    🔬This is a nightly-only experimental API. (iter_map_windows)
    Calls the given function f for each contiguous window of size N over\nself and returns an iterator over the outputs of f. Like slice::windows(),\nthe windows during mapping overlap as well. Read more
    1.0.0 · source§
    fn fuse(self) -> Fuse<Self>
    where\n    Self: Sized,
    Creates an iterator which ends after the first None. Read more
    1.0.0 · source§
    fn inspect<F>(self, f: F) -> Inspect<Self, F>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item),
    Does something with each element of an iterator, passing the value on. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Borrows an iterator, rather than consuming it. Read more
    1.0.0 · source§
    fn collect<B>(self) -> B
    where\n    B: FromIterator<Self::Item>,\n    Self: Sized,
    Transforms an iterator into a collection. Read more
    source§
    fn collect_into<E>(self, collection: &mut E) -> &mut E
    where\n    E: Extend<Self::Item>,\n    Self: Sized,
    🔬This is a nightly-only experimental API. (iter_collect_into)
    Collects all the items from an iterator into a collection. Read more
    1.0.0 · source§
    fn partition<B, F>(self, f: F) -> (B, B)
    where\n    Self: Sized,\n    B: Default + Extend<Self::Item>,\n    F: FnMut(&Self::Item) -> bool,
    Consumes an iterator, creating two collections from it. Read more
    source§
    fn is_partitioned<P>(self, predicate: P) -> bool
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    🔬This is a nightly-only experimental API. (iter_is_partitioned)
    Checks if the elements of this iterator are partitioned according to the given predicate,\nsuch that all those that return true precede all those that return false. Read more
    1.27.0 · source§
    fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> R,\n    R: Try<Output = B>,
    An iterator method that applies a function as long as it returns\nsuccessfully, producing a single, final value. Read more
    1.27.0 · source§
    fn try_for_each<F, R>(&mut self, f: F) -> R
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> R,\n    R: Try<Output = ()>,
    An iterator method that applies a fallible function to each item in the\niterator, stopping at the first error and returning that error. Read more
    1.0.0 · source§
    fn fold<B, F>(self, init: B, f: F) -> B
    where\n    Self: Sized,\n    F: FnMut(B, Self::Item) -> B,
    Folds every element into an accumulator by applying an operation,\nreturning the final result. Read more
    1.51.0 · source§
    fn reduce<F>(self, f: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> Self::Item,
    Reduces the elements to a single one, by repeatedly applying a reducing\noperation. Read more
    source§
    fn try_reduce<F, R>(\n    &mut self,\n    f: F\n) -> <<R as Try>::Residual as Residual<Option<<R as Try>::Output>>>::TryType
    where\n    Self: Sized,\n    F: FnMut(Self::Item, Self::Item) -> R,\n    R: Try<Output = Self::Item>,\n    <R as Try>::Residual: Residual<Option<Self::Item>>,
    🔬This is a nightly-only experimental API. (iterator_try_reduce)
    Reduces the elements to a single one by repeatedly applying a reducing operation. If the\nclosure returns a failure, the failure is propagated back to the caller immediately. Read more
    1.0.0 · source§
    fn all<F>(&mut self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> bool,
    Tests if every element of the iterator matches a predicate. Read more
    1.0.0 · source§
    fn any<F>(&mut self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> bool,
    Tests if any element of the iterator matches a predicate. Read more
    1.0.0 · source§
    fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
    where\n    Self: Sized,\n    P: FnMut(&Self::Item) -> bool,
    Searches for an element of an iterator that satisfies a predicate. Read more
    1.30.0 · source§
    fn find_map<B, F>(&mut self, f: F) -> Option<B>
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> Option<B>,
    Applies function to the elements of iterator and returns\nthe first non-none result. Read more
    source§
    fn try_find<F, R>(\n    &mut self,\n    f: F\n) -> <<R as Try>::Residual as Residual<Option<Self::Item>>>::TryType
    where\n    Self: Sized,\n    F: FnMut(&Self::Item) -> R,\n    R: Try<Output = bool>,\n    <R as Try>::Residual: Residual<Option<Self::Item>>,
    🔬This is a nightly-only experimental API. (try_find)
    Applies function to the elements of iterator and returns\nthe first true result or the first error. Read more
    1.0.0 · source§
    fn position<P>(&mut self, predicate: P) -> Option<usize>
    where\n    Self: Sized,\n    P: FnMut(Self::Item) -> bool,
    Searches for an element in an iterator, returning its index. Read more
    1.6.0 · source§
    fn max_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the maximum value from the\nspecified function. Read more
    1.15.0 · source§
    fn max_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the maximum value with respect to the\nspecified comparison function. Read more
    1.6.0 · source§
    fn min_by_key<B, F>(self, f: F) -> Option<Self::Item>
    where\n    B: Ord,\n    Self: Sized,\n    F: FnMut(&Self::Item) -> B,
    Returns the element that gives the minimum value from the\nspecified function. Read more
    1.15.0 · source§
    fn min_by<F>(self, compare: F) -> Option<Self::Item>
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> Ordering,
    Returns the element that gives the minimum value with respect to the\nspecified comparison function. Read more
    1.0.0 · source§
    fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB)
    where\n    FromA: Default + Extend<A>,\n    FromB: Default + Extend<B>,\n    Self: Sized + Iterator<Item = (A, B)>,
    Converts an iterator of pairs into a pair of containers. Read more
    1.36.0 · source§
    fn copied<'a, T>(self) -> Copied<Self>
    where\n    T: 'a + Copy,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which copies all of its elements. Read more
    1.0.0 · source§
    fn cloned<'a, T>(self) -> Cloned<Self>
    where\n    T: 'a + Clone,\n    Self: Sized + Iterator<Item = &'a T>,
    Creates an iterator which clones all of its elements. Read more
    source§
    fn array_chunks<const N: usize>(self) -> ArrayChunks<Self, N>
    where\n    Self: Sized,
    🔬This is a nightly-only experimental API. (iter_array_chunks)
    Returns an iterator over N elements of the iterator at a time. Read more
    1.11.0 · source§
    fn sum<S>(self) -> S
    where\n    Self: Sized,\n    S: Sum<Self::Item>,
    Sums the elements of an iterator. Read more
    1.11.0 · source§
    fn product<P>(self) -> P
    where\n    Self: Sized,\n    P: Product<Self::Item>,
    Iterates over the entire iterator, multiplying all the elements Read more
    source§
    fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Lexicographically compares the elements of this Iterator with those\nof another with respect to the specified comparison function. Read more
    1.5.0 · source§
    fn partial_cmp<I>(self, other: I) -> Option<Ordering>
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Lexicographically compares the PartialOrd elements of\nthis Iterator with those of another. The comparison works like short-circuit\nevaluation, returning a result without comparing the remaining elements.\nAs soon as an order can be determined, the evaluation stops and a result is returned. Read more
    source§
    fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering>
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Lexicographically compares the elements of this Iterator with those\nof another with respect to the specified comparison function. Read more
    1.5.0 · source§
    fn eq<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are equal to those of\nanother. Read more
    source§
    fn eq_by<I, F>(self, other: I, eq: F) -> bool
    where\n    Self: Sized,\n    I: IntoIterator,\n    F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
    🔬This is a nightly-only experimental API. (iter_order_by)
    Determines if the elements of this Iterator are equal to those of\nanother with respect to the specified equality function. Read more
    1.5.0 · source§
    fn ne<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialEq<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are not equal to those of\nanother. Read more
    1.5.0 · source§
    fn lt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless than those of another. Read more
    1.5.0 · source§
    fn le<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\nless or equal to those of another. Read more
    1.5.0 · source§
    fn gt<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than those of another. Read more
    1.5.0 · source§
    fn ge<I>(self, other: I) -> bool
    where\n    I: IntoIterator,\n    Self::Item: PartialOrd<<I as IntoIterator>::Item>,\n    Self: Sized,
    Determines if the elements of this Iterator are lexicographically\ngreater than or equal to those of another. Read more
    source§
    fn is_sorted_by<F>(self, compare: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(&Self::Item, &Self::Item) -> bool,
    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given comparator function. Read more
    source§
    fn is_sorted_by_key<F, K>(self, f: F) -> bool
    where\n    Self: Sized,\n    F: FnMut(Self::Item) -> K,\n    K: PartialOrd,
    🔬This is a nightly-only experimental API. (is_sorted)
    Checks if the elements of this iterator are sorted using the given key extraction\nfunction. Read more
    ","Iterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> LocalSpawn for Box<Sp>
    where\n    Sp: LocalSpawn + ?Sized,
    §
    fn spawn_local_obj(\n    &self,\n    future: LocalFutureObj<'static, ()>\n) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status_local(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","LocalSpawn","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Ord for Box<T, A>
    where\n    T: Ord + ?Sized,\n    A: Allocator,
    source§
    fn cmp(&self, other: &Box<T, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> PartialEq for Box<T, A>
    where\n    T: PartialEq + ?Sized,\n    A: Allocator,
    source§
    fn eq(&self, other: &Box<T, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    source§
    fn ne(&self, other: &Box<T, A>) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> PartialOrd for Box<T, A>
    where\n    T: PartialOrd + ?Sized,\n    A: Allocator,
    source§
    fn partial_cmp(&self, other: &Box<T, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    source§
    fn lt(&self, other: &Box<T, A>) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    source§
    fn le(&self, other: &Box<T, A>) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    source§
    fn ge(&self, other: &Box<T, A>) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    source§
    fn gt(&self, other: &Box<T, A>) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    ","PartialOrd","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Pointer for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Pointer","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<R> Read for Box<R>
    where\n    R: Read + ?Sized,
    source§
    fn read(&mut self, buf: &mut [u8]) -> Result<usize, Error>
    Pull some bytes from this source into the specified buffer, returning\nhow many bytes were read. Read more
    source§
    fn read_buf(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Pull some bytes from this source into the specified buffer. Read more
    source§
    fn read_vectored(&mut self, bufs: &mut [IoSliceMut<'_>]) -> Result<usize, Error>
    Like read, except that it reads into a slice of buffers. Read more
    source§
    fn is_read_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Reader has an efficient read_vectored\nimplementation. Read more
    source§
    fn read_to_end(&mut self, buf: &mut Vec<u8>) -> Result<usize, Error>
    Read all bytes until EOF in this source, placing them into buf. Read more
    source§
    fn read_to_string(&mut self, buf: &mut String) -> Result<usize, Error>
    Read all bytes until EOF in this source, appending them to buf. Read more
    source§
    fn read_exact(&mut self, buf: &mut [u8]) -> Result<(), Error>
    Read the exact number of bytes required to fill buf. Read more
    source§
    fn read_buf_exact(&mut self, cursor: BorrowedCursor<'_>) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (read_buf)
    Read the exact number of bytes required to fill cursor. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adaptor for this instance of Read. Read more
    1.0.0 · source§
    fn bytes(self) -> Bytes<Self>
    where\n    Self: Sized,
    Transforms this Read instance to an Iterator over its bytes. Read more
    1.0.0 · source§
    fn chain<R>(self, next: R) -> Chain<Self, R>
    where\n    R: Read,\n    Self: Sized,
    Creates an adapter which will chain this stream with another. Read more
    1.0.0 · source§
    fn take(self, limit: u64) -> Take<Self>
    where\n    Self: Sized,
    Creates an adapter which will read at most limit bytes from it. Read more
    ","Read","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<R> RngCore for Box<R>
    where\n    R: RngCore + ?Sized,
    source§
    fn next_u32(&mut self) -> u32
    Return the next random u32. Read more
    source§
    fn next_u64(&mut self) -> u64
    Return the next random u64. Read more
    source§
    fn fill_bytes(&mut self, dest: &mut [u8])
    Fill dest with random data. Read more
    source§
    fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
    Fill dest entirely with random data. Read more
    ","RngCore","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<S> Seek for Box<S>
    where\n    S: Seek + ?Sized,
    source§
    fn seek(&mut self, pos: SeekFrom) -> Result<u64, Error>
    Seek to an offset, in bytes, in a stream. Read more
    source§
    fn stream_position(&mut self) -> Result<u64, Error>
    Returns the current seek position from the start of the stream. Read more
    1.55.0 · source§
    fn rewind(&mut self) -> Result<(), Error>
    Rewind to the beginning of a stream. Read more
    source§
    fn stream_len(&mut self) -> Result<u64, Error>
    🔬This is a nightly-only experimental API. (seek_stream_len)
    Returns the length of this stream (in bytes). Read more
    source§
    fn seek_relative(&mut self, offset: i64) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (seek_seek_relative)
    Seeks relative to the current position. Read more
    ","Seek","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T> Serialize for Box<T>
    where\n    T: Serialize + ?Sized,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Request> Service<Request> for Box<S>
    where\n    S: Service<Request> + ?Sized,
    §
    type Response = <S as Service<Request>>::Response
    Responses given by the service.
    §
    type Error = <S as Service<Request>>::Error
    Errors produced by the service.
    §
    type Future = <S as Service<Request>>::Future
    The future response value.
    §
    fn poll_ready(\n    &mut self,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <S as Service<Request>>::Error>>
    Returns Poll::Ready(Ok(())) when the service is able to process requests. Read more
    §
    fn call(&mut self, request: Request) -> <S as Service<Request>>::Future
    Process the request and return the response asynchronously. Read more
    ","Service","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S, Item> Sink<Item> for Box<S>
    where\n    S: Sink<Item> + Unpin + ?Sized,
    §
    type Error = <S as Sink<Item>>::Error
    The type of value produced by the sink when an error occurs.
    §
    fn poll_ready(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Attempts to prepare the Sink to receive a value. Read more
    §
    fn start_send(\n    self: Pin<&mut Box<S>>,\n    item: Item\n) -> Result<(), <Box<S> as Sink<Item>>::Error>
    Begin the process of sending a value to the sink.\nEach call to this function must be preceded by a successful call to\npoll_ready which returned Poll::Ready(Ok(())). Read more
    §
    fn poll_flush(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output from this sink. Read more
    §
    fn poll_close(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Result<(), <Box<S> as Sink<Item>>::Error>>
    Flush any remaining output and close this sink, if necessary. Read more
    ","Sink","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Source for Box<T>
    where\n    T: Source + ?Sized,
    §
    fn register(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest\n) -> Result<(), Error>
    Register self with the given Registry instance. Read more
    §
    fn reregister(\n    &mut self,\n    registry: &Registry,\n    token: Token,\n    interests: Interest\n) -> Result<(), Error>
    Re-register self with the given Registry instance. Read more
    §
    fn deregister(&mut self, registry: &Registry) -> Result<(), Error>
    Deregister self from the given Registry instance. Read more
    ","Source","bdk_esplora::blocking_ext::Error"],["
    §
    impl<Sp> Spawn for Box<Sp>
    where\n    Sp: Spawn + ?Sized,
    §
    fn spawn_obj(&self, future: FutureObj<'static, ()>) -> Result<(), SpawnError>
    Spawns a future that will be run to completion. Read more
    §
    fn status(&self) -> Result<(), SpawnError>
    Determines whether the executor is able to spawn new tasks. Read more
    ","Spawn","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Stream for Box<S>
    where\n    S: Stream + Unpin + ?Sized,
    §
    type Item = <S as Stream>::Item
    Values yielded by the stream.
    §
    fn poll_next(\n    self: Pin<&mut Box<S>>,\n    cx: &mut Context<'_>\n) -> Poll<Option<<Box<S> as Stream>::Item>>
    Attempt to pull out the next value of this stream, registering the\ncurrent task for wakeup if the value is not yet available, and returning\nNone if the stream is exhausted. Read more
    §
    fn size_hint(&self) -> (usize, Option<usize>)
    Returns the bounds on the remaining length of the stream. Read more
    ","Stream","bdk_esplora::blocking_ext::Error"],["
    §
    impl<S> Subscriber for Box<S>
    where\n    S: Subscriber + ?Sized,
    §
    fn register_callsite(&self, metadata: &'static Metadata<'static>) -> Interest
    Registers a new callsite with this subscriber, returning whether or not\nthe subscriber is interested in being notified about the callsite. Read more
    §
    fn enabled(&self, metadata: &Metadata<'_>) -> bool
    Returns true if a span or event with the specified metadata would be\nrecorded. Read more
    §
    fn max_level_hint(&self) -> Option<LevelFilter>
    Returns the highest verbosity level that this Subscriber will\nenable, or None, if the subscriber does not implement level-based\nfiltering or chooses not to implement this method. Read more
    §
    fn new_span(&self, span: &Attributes<'_>) -> Id
    Visit the construction of a new span, returning a new span ID for the\nspan being constructed. Read more
    §
    fn record(&self, span: &Id, values: &Record<'_>)
    Record a set of values on a span. Read more
    §
    fn record_follows_from(&self, span: &Id, follows: &Id)
    Adds an indication that span follows from the span with the id\nfollows. Read more
    §
    fn event_enabled(&self, event: &Event<'_>) -> bool
    Determine if an [Event] should be recorded. Read more
    §
    fn event(&self, event: &Event<'_>)
    Records that an Event has occurred. Read more
    §
    fn enter(&self, span: &Id)
    Records that a span has been entered. Read more
    §
    fn exit(&self, span: &Id)
    Records that a span has been exited. Read more
    §
    fn clone_span(&self, id: &Id) -> Id
    Notifies the subscriber that a span ID has been cloned. Read more
    §
    fn try_close(&self, id: Id) -> bool
    Notifies the subscriber that a span ID has been dropped, and returns\ntrue if there are now 0 IDs that refer to that span. Read more
    §
    fn drop_span(&self, id: Id)
    👎Deprecated since 0.1.2: use Subscriber::try_close instead
    This method is deprecated. Read more
    §
    fn current_span(&self) -> Current
    Returns a type representing this subscriber’s view of the current span. Read more
    §
    unsafe fn downcast_raw(&self, id: TypeId) -> Option<*const ()>
    If self is the same type as the provided TypeId, returns an untyped\n*const pointer to that type. Otherwise, returns None. Read more
    §
    fn on_register_dispatch(&self, subscriber: &Dispatch)
    Invoked when this subscriber becomes a [Dispatch]. Read more
    ","Subscriber","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T, F> UnsafeFutureObj<'a, T> for Box<F>
    where\n    F: Future<Output = T> + 'a,
    §
    fn into_raw(self) -> *mut dyn Future<Output = T> + 'a
    Convert an owned instance into a (conceptually owned) fat pointer. Read more
    §
    unsafe fn drop(ptr: *mut dyn Future<Output = T> + 'a)
    Drops the future represented by the given fat pointer. Read more
    ","UnsafeFutureObj<'a, T>","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> Value for Box<T>
    where\n    T: Value + ?Sized,
    §
    fn record(&self, key: &Field, visitor: &mut dyn Visit)
    Visits this value with the given Visitor.
    ","Value","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<W> Write for Box<W>
    where\n    W: Write + ?Sized,
    source§
    fn write(&mut self, buf: &[u8]) -> Result<usize, Error>
    Write a buffer into this writer, returning how many bytes were written. Read more
    source§
    fn write_vectored(&mut self, bufs: &[IoSlice<'_>]) -> Result<usize, Error>
    Like write, except that it writes from a slice of buffers. Read more
    source§
    fn is_write_vectored(&self) -> bool
    🔬This is a nightly-only experimental API. (can_vector)
    Determines if this Writer has an efficient write_vectored\nimplementation. Read more
    source§
    fn flush(&mut self) -> Result<(), Error>
    Flush this output stream, ensuring that all intermediately buffered\ncontents reach their destination. Read more
    source§
    fn write_all(&mut self, buf: &[u8]) -> Result<(), Error>
    Attempts to write an entire buffer into this writer. Read more
    source§
    fn write_fmt(&mut self, fmt: Arguments<'_>) -> Result<(), Error>
    Writes a formatted string into this writer, returning any error\nencountered. Read more
    source§
    fn write_all_vectored(&mut self, bufs: &mut [IoSlice<'_>]) -> Result<(), Error>
    🔬This is a nightly-only experimental API. (write_all_vectored)
    Attempts to write multiple buffers into this writer. Read more
    1.0.0 · source§
    fn by_ref(&mut self) -> &mut Self
    where\n    Self: Sized,
    Creates a “by reference” adapter for this instance of Write. Read more
    ","Write","bdk_esplora::blocking_ext::Error"],["
    §
    impl<'a, T> Writeable for Box<T>
    where\n    T: Writeable + ?Sized,
    §
    fn write_to<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: Write + ?Sized,
    Writes a string to the given sink. Errors from the sink are bubbled up.\nThe default implementation delegates to write_to_parts, and discards any\nPart annotations.
    §
    fn write_to_parts<W>(&self, sink: &mut W) -> Result<(), Error>
    where\n    W: PartsWrite + ?Sized,
    Write bytes and Part annotations to the given sink. Errors from the\nsink are bubbled up. The default implementation delegates to write_to,\nand doesn’t produce any Part annotations.
    §
    fn writeable_length_hint(&self) -> LengthHint
    Returns a hint for the number of UTF-8 bytes that will be written to the sink. Read more
    §
    fn write_to_string(&self) -> Cow<'_, str>
    Creates a new String with the data from this Writeable. Like ToString,\nbut smaller and faster. Read more
    §
    fn writeable_cmp_bytes(&self, other: &[u8]) -> Ordering
    Compares the contents of this Writeable to the given bytes\nwithout allocating a String to hold the Writeable contents. Read more
    ","Writeable","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> CartablePointerLike for Box<T>
    ","CartablePointerLike","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, U, A> CoerceUnsized<Box<U, A>> for Box<T, A>
    where\n    T: Unsize<U> + ?Sized,\n    A: Allocator,\n    U: ?Sized,
    ","CoerceUnsized>","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<R> CryptoRng for Box<R>
    where\n    R: CryptoRng + ?Sized,
    ","CryptoRng","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, A> DerefPure for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","DerefPure","bdk_esplora::blocking_ext::Error"],["
    source§
    impl<T, U> DispatchFromDyn<Box<U>> for Box<T>
    where\n    T: Unsize<U> + ?Sized,\n    U: ?Sized,
    ","DispatchFromDyn>","bdk_esplora::blocking_ext::Error"],["
    1.0.0 · source§
    impl<T, A> Eq for Box<T, A>
    where\n    T: Eq + ?Sized,\n    A: Allocator,
    ","Eq","bdk_esplora::blocking_ext::Error"],["
    1.26.0 · source§
    impl<I, A> FusedIterator for Box<I, A>
    where\n    I: FusedIterator + ?Sized,\n    A: Allocator,
    ","FusedIterator","bdk_esplora::blocking_ext::Error"],["
    §
    impl<T> StableDeref for Box<T>
    where\n    T: ?Sized,
    ","StableDeref","bdk_esplora::blocking_ext::Error"],["
    1.33.0 · source§
    impl<T, A> Unpin for Box<T, A>
    where\n    A: Allocator,\n    T: ?Sized,
    ","Unpin","bdk_esplora::blocking_ext::Error"]]
 };if (window.register_type_impls) {window.register_type_impls(type_impls);} else {window.pending_type_impls = type_impls;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
index 967b019872..2e65daa4ef 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/alloc/collections/btree/map/struct.BTreeMap.js
@@ -1,4 +1,4 @@
 (function() {var type_impls = {
-"bdk_chain":[["
    source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn iter(&self) -> Iter<'_, K, V> ⓘ
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · source
    pub fn keys(&self) -> Keys<'_, K, V> ⓘ
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · source
    pub fn values(&self) -> Values<'_, K, V> ⓘ
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key.
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get_key_value(&1), Some((&1, &\"a\")));\nassert_eq!(map.get_key_value(&2), None);
    \n
    1.66.0 · source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A> ⓘ
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · source
    pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · source
    pub fn into_values(self) -> IntoValues<K, V, A> ⓘ
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> BTreeMap<K, V, A>
    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
    ","Clone","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V> Default for BTreeMap<K, V>
    source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.7.0 · source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.2.0 · source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.56.0 · source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<(K, V)>.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    §
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    §
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    source§
    fn into_deserializer(\n    self\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn into_iter(self) -> IntoIter<K, V, A> ⓘ
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    §
    type Item = (K, V)
    The type of the elements being iterated over.
    §
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    1.0.0 · source§
    fn ne(&self, other: &Rhs) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§
    fn lt(&self, other: &Rhs) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§
    fn le(&self, other: &Rhs) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    1.0.0 · source§
    fn gt(&self, other: &Rhs) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§
    fn ge(&self, other: &Rhs) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.64.0 · source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"]],
-"bdk_wallet":[["
    source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn iter(&self) -> Iter<'_, K, V>
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V>
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · source
    pub fn keys(&self) -> Keys<'_, K, V>
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · source
    pub fn values(&self) -> Values<'_, K, V>
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key.
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get_key_value(&1), Some((&1, &\"a\")));\nassert_eq!(map.get_key_value(&2), None);
    \n
    1.66.0 · source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A>
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · source
    pub fn into_keys(self) -> IntoKeys<K, V, A>
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · source
    pub fn into_values(self) -> IntoValues<K, V, A>
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> BTreeMap<K, V, A>
    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
    ","Clone","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V> Default for BTreeMap<K, V>
    source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.7.0 · source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.2.0 · source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.56.0 · source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<(K, V)>.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    §
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl IntoAssets for BTreeMap<DescriptorPublicKey, DescriptorSecretKey>
    §
    fn into_assets(self) -> Assets
    Convert self into a Assets struct
    ","IntoAssets","bdk_wallet::keys::KeyMap"],["
    source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    §
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    source§
    fn into_deserializer(\n    self\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn into_iter(self) -> IntoIter<K, V, A>
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    §
    type Item = (K, V)
    The type of the elements being iterated over.
    §
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    1.0.0 · source§
    fn ne(&self, other: &Rhs) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§
    fn lt(&self, other: &Rhs) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§
    fn le(&self, other: &Rhs) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    1.0.0 · source§
    fn gt(&self, other: &Rhs) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§
    fn ge(&self, other: &Rhs) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    ","PartialOrd","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.64.0 · source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"]]
+"bdk_chain":[["
    source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn iter(&self) -> Iter<'_, K, V> ⓘ
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · source
    pub fn keys(&self) -> Keys<'_, K, V> ⓘ
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · source
    pub fn values(&self) -> Values<'_, K, V> ⓘ
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key.
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get_key_value(&1), Some((&1, &\"a\")));\nassert_eq!(map.get_key_value(&2), None);
    \n
    1.66.0 · source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V> ⓘ
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A> ⓘ
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · source
    pub fn into_keys(self) -> IntoKeys<K, V, A> ⓘ
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · source
    pub fn into_values(self) -> IntoValues<K, V, A> ⓘ
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> BTreeMap<K, V, A>
    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
    ","Clone","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V> Default for BTreeMap<K, V>
    source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.7.0 · source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.2.0 · source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.56.0 · source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<(K, V)>.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(K, V)>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    §
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    §
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    source§
    fn into_deserializer(\n    self\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn into_iter(self) -> IntoIter<K, V, A> ⓘ
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    §
    type Item = (K, V)
    The type of the elements being iterated over.
    §
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    1.0.0 · source§
    fn ne(&self, other: &Rhs) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§
    fn lt(&self, other: &Rhs) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§
    fn le(&self, other: &Rhs) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    1.0.0 · source§
    fn gt(&self, other: &Rhs) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§
    fn ge(&self, other: &Rhs) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    ","PartialOrd","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.0.0 · source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"],["
    1.64.0 · source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_chain::bitcoin::psbt::SigningKeysMap","bdk_chain::bitcoin::psbt::SigningErrors"]],
+"bdk_wallet":[["
    source§
    impl<K, V> BTreeMap<K, V>
    1.0.0 (const: 1.66.0) · source
    pub const fn new() -> BTreeMap<K, V>
    Makes a new, empty BTreeMap.
    \n
    Does not allocate anything on its own.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn iter(&self) -> Iter<'_, K, V>
    Gets an iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"c\");\nmap.insert(2, \"b\");\nmap.insert(1, \"a\");\n\nfor (key, value) in map.iter() {\n    println!(\"{key}: {value}\");\n}\n\nlet (first_key, first_value) = map.iter().next().unwrap();\nassert_eq!((*first_key, *first_value), (1, \"a\"));
    \n
    1.0.0 · source
    pub fn iter_mut(&mut self) -> IterMut<'_, K, V>
    Gets a mutable iterator over the entries of the map, sorted by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::from([\n   (\"a\", 1),\n   (\"b\", 2),\n   (\"c\", 3),\n]);\n\n// add 10 to the value if the key isn't \"a\"\nfor (key, value) in map.iter_mut() {\n    if key != &\"a\" {\n        *value += 10;\n    }\n}
    \n
    1.0.0 · source
    pub fn keys(&self) -> Keys<'_, K, V>
    Gets an iterator over the keys of the map, in sorted order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<_> = a.keys().cloned().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.0.0 · source
    pub fn values(&self) -> Values<'_, K, V>
    Gets an iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.values().cloned().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    1.10.0 · source
    pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>
    Gets a mutable iterator over the values of the map, in order by key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, String::from(\"hello\"));\na.insert(2, String::from(\"goodbye\"));\n\nfor value in a.values_mut() {\n    value.push_str(\"!\");\n}\n\nlet values: Vec<String> = a.values().cloned().collect();\nassert_eq!(values, [String::from(\"hello!\"),\n                    String::from(\"goodbye!\")]);
    \n
    1.0.0 (const: unstable) · source
    pub fn len(&self) -> usize
    Returns the number of elements in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert_eq!(a.len(), 0);\na.insert(1, \"a\");\nassert_eq!(a.len(), 1);
    \n
    1.0.0 (const: unstable) · source
    pub fn is_empty(&self) -> bool
    Returns true if the map contains no elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\nassert!(a.is_empty());\na.insert(1, \"a\");\nassert!(!a.is_empty());
    \n
    source
    pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.lower_bound(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &\"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &\"b\")));\n\nlet cursor = map.lower_bound(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.lower_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &\"a\")));
    \n
    source
    pub fn lower_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap before the smallest key\ngreater than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap before the smallest key greater than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap before the smallest key greater than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap before the smallest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.lower_bound_mut(Bound::Included(&2));\nassert_eq!(cursor.peek_prev(), Some((&1, &mut \"a\")));\nassert_eq!(cursor.peek_next(), Some((&2, &mut \"b\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Excluded(&2));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.lower_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), None);\nassert_eq!(cursor.peek_next(), Some((&1, &mut \"a\")));
    \n
    source
    pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a Cursor pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet cursor = map.upper_bound(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &\"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &\"d\")));\n\nlet cursor = map.upper_bound(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &\"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &\"c\")));\n\nlet cursor = map.upper_bound(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &\"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    source
    pub fn upper_bound_mut<Q>(&mut self, bound: Bound<&Q>) -> CursorMut<'_, K, V, A>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    🔬This is a nightly-only experimental API. (btree_cursors)
    Returns a CursorMut pointing at the gap after the greatest key\nsmaller than the given bound.
    \n
    Passing Bound::Included(x) will return a cursor pointing to the\ngap after the greatest key smaller than or equal to x.
    \n
    Passing Bound::Excluded(x) will return a cursor pointing to the\ngap after the greatest key smaller than x.
    \n
    Passing Bound::Unbounded will return a cursor pointing to the\ngap after the greatest key in the map.
    \n
    §Examples
    \n
    #![feature(btree_cursors)]\n\nuse std::collections::BTreeMap;\nuse std::ops::Bound;\n\nlet mut map = BTreeMap::from([\n    (1, \"a\"),\n    (2, \"b\"),\n    (3, \"c\"),\n    (4, \"d\"),\n]);\n\nlet mut cursor = map.upper_bound_mut(Bound::Included(&3));\nassert_eq!(cursor.peek_prev(), Some((&3, &mut \"c\")));\nassert_eq!(cursor.peek_next(), Some((&4, &mut \"d\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Excluded(&3));\nassert_eq!(cursor.peek_prev(), Some((&2, &mut \"b\")));\nassert_eq!(cursor.peek_next(), Some((&3, &mut \"c\")));\n\nlet mut cursor = map.upper_bound_mut(Bound::Unbounded);\nassert_eq!(cursor.peek_prev(), Some((&4, &mut \"d\")));\nassert_eq!(cursor.peek_next(), None);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn clear(&mut self)
    Clears the map, removing all elements.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.clear();\nassert!(a.is_empty());
    \n
    source
    pub const fn new_in(alloc: A) -> BTreeMap<K, V, A>
    🔬This is a nightly-only experimental API. (btreemap_alloc)
    Makes a new empty BTreeMap with a reasonable choice for B.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::alloc::Global;\n\nlet mut map = BTreeMap::new_in(Global);\n\n// entries can now be inserted into the empty map\nmap.insert(1, \"a\");
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V, A> BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    1.0.0 · source
    pub fn get<Q>(&self, key: &Q) -> Option<&V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get(&1), Some(&\"a\"));\nassert_eq!(map.get(&2), None);
    \n
    1.40.0 · source
    pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns the key-value pair corresponding to the supplied key.
    \n
    The supplied key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.get_key_value(&1), Some((&1, &\"a\")));\nassert_eq!(map.get_key_value(&2), None);
    \n
    1.66.0 · source
    pub fn first_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the first key-value pair in the map.\nThe key in this pair is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.first_key_value(), None);\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.first_key_value(), Some((&1, &\"b\")));
    \n
    1.66.0 · source
    pub fn first_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the first entry in the map for in-place manipulation.\nThe key of this entry is the minimum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.first_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"first\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"first\");\nassert_eq!(*map.get(&2).unwrap(), \"b\");
    \n
    1.66.0 · source
    pub fn pop_first(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the first element in the map.\nThe key of this element is the minimum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in ascending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_first() {\n    assert!(map.iter().all(|(k, _v)| *k > key));\n}\nassert!(map.is_empty());
    \n
    1.66.0 · source
    pub fn last_key_value(&self) -> Option<(&K, &V)>
    where\n    K: Ord,
    Returns the last key-value pair in the map.\nThe key in this pair is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"b\");\nmap.insert(2, \"a\");\nassert_eq!(map.last_key_value(), Some((&2, &\"a\")));
    \n
    1.66.0 · source
    pub fn last_entry(&mut self) -> Option<OccupiedEntry<'_, K, V, A>>
    where\n    K: Ord,
    Returns the last entry in the map for in-place manipulation.\nThe key of this entry is the maximum key in the map.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nif let Some(mut entry) = map.last_entry() {\n    if *entry.key() > 0 {\n        entry.insert(\"last\");\n    }\n}\nassert_eq!(*map.get(&1).unwrap(), \"a\");\nassert_eq!(*map.get(&2).unwrap(), \"last\");
    \n
    1.66.0 · source
    pub fn pop_last(&mut self) -> Option<(K, V)>
    where\n    K: Ord,
    Removes and returns the last element in the map.\nThe key of this element is the maximum key that was in the map.
    \n
    §Examples
    \n
    Draining elements in descending order, while keeping a usable map each iteration.
    \n\n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nmap.insert(2, \"b\");\nwhile let Some((key, _val)) = map.pop_last() {\n    assert!(map.iter().all(|(k, _v)| *k < key));\n}\nassert!(map.is_empty());
    \n
    1.0.0 · source
    pub fn contains_key<Q>(&self, key: &Q) -> bool
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns true if the map contains a value for the specified key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.contains_key(&1), true);\nassert_eq!(map.contains_key(&2), false);
    \n
    1.0.0 · source
    pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Returns a mutable reference to the value corresponding to the key.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nif let Some(x) = map.get_mut(&1) {\n    *x = \"b\";\n}\nassert_eq!(map[&1], \"b\");
    \n
    1.0.0 · source
    pub fn insert(&mut self, key: K, value: V) -> Option<V>
    where\n    K: Ord,
    Inserts a key-value pair into the map.
    \n
    If the map did not have this key present, None is returned.
    \n
    If the map did have this key present, the value is updated, and the old\nvalue is returned. The key is not updated, though; this matters for\ntypes that can be == without being identical. See the module-level\ndocumentation for more.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.insert(37, \"a\"), None);\nassert_eq!(map.is_empty(), false);\n\nmap.insert(37, \"b\");\nassert_eq!(map.insert(37, \"c\"), Some(\"b\"));\nassert_eq!(map[&37], \"c\");
    \n
    source
    pub fn try_insert(\n    &mut self,\n    key: K,\n    value: V\n) -> Result<&mut V, OccupiedError<'_, K, V, A>>
    where\n    K: Ord,
    🔬This is a nightly-only experimental API. (map_try_insert)
    Tries to insert a key-value pair into the map, and returns\na mutable reference to the value in the entry.
    \n
    If the map already had this key present, nothing is updated, and\nan error containing the occupied entry and the value is returned.
    \n
    §Examples
    \n
    #![feature(map_try_insert)]\n\nuse std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nassert_eq!(map.try_insert(37, \"a\").unwrap(), &\"a\");\n\nlet err = map.try_insert(37, \"b\").unwrap_err();\nassert_eq!(err.entry.key(), &37);\nassert_eq!(err.entry.get(), &\"a\");\nassert_eq!(err.value, \"b\");
    \n
    1.0.0 · source
    pub fn remove<Q>(&mut self, key: &Q) -> Option<V>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the value at the key if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove(&1), Some(\"a\"));\nassert_eq!(map.remove(&1), None);
    \n
    1.45.0 · source
    pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>
    where\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    Removes a key from the map, returning the stored key and value if the key\nwas previously in the map.
    \n
    The key may be any borrowed form of the map’s key type, but the ordering\non the borrowed form must match the ordering on the key type.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map = BTreeMap::new();\nmap.insert(1, \"a\");\nassert_eq!(map.remove_entry(&1), Some((1, \"a\")));\nassert_eq!(map.remove_entry(&1), None);
    \n
    1.53.0 · source
    pub fn retain<F>(&mut self, f: F)
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    Retains only the elements specified by the predicate.
    \n
    In other words, remove all pairs (k, v) for which f(&k, &mut v) returns false.\nThe elements are visited in ascending key order.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();\n// Keep only the elements with even-numbered keys.\nmap.retain(|&k, _| k % 2 == 0);\nassert!(map.into_iter().eq(vec![(0, 0), (2, 20), (4, 40), (6, 60)]));
    \n
    1.11.0 · source
    pub fn append(&mut self, other: &mut BTreeMap<K, V, A>)
    where\n    K: Ord,\n    A: Clone,
    Moves all elements from other into self, leaving other empty.
    \n
    If a key from other is already present in self, the respective\nvalue from self will be overwritten with the respective value from other.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\"); // Note: Key (3) also present in b.\n\nlet mut b = BTreeMap::new();\nb.insert(3, \"d\"); // Note: Key (3) also present in a.\nb.insert(4, \"e\");\nb.insert(5, \"f\");\n\na.append(&mut b);\n\nassert_eq!(a.len(), 5);\nassert_eq!(b.len(), 0);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\nassert_eq!(a[&3], \"d\"); // Note: \"c\" has been overwritten.\nassert_eq!(a[&4], \"e\");\nassert_eq!(a[&5], \"f\");
    \n
    1.17.0 · source
    pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\nuse std::ops::Bound::Included;\n\nlet mut map = BTreeMap::new();\nmap.insert(3, \"a\");\nmap.insert(5, \"b\");\nmap.insert(8, \"c\");\nfor (&key, &value) in map.range((Included(&4), Included(&8))) {\n    println!(\"{key}: {value}\");\n}\nassert_eq!(Some((&5, &\"b\")), map.range(4..).next());
    \n
    1.17.0 · source
    pub fn range_mut<T, R>(&mut self, range: R) -> RangeMut<'_, K, V>
    where\n    T: Ord + ?Sized,\n    K: Borrow<T> + Ord,\n    R: RangeBounds<T>,
    Constructs a mutable double-ended iterator over a sub-range of elements in the map.\nThe simplest way is to use the range syntax min..max, thus range(min..max) will\nyield elements from min (inclusive) to max (exclusive).\nThe range may also be entered as (Bound<T>, Bound<T>), so for example\nrange((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive\nrange from 4 to 10.
    \n
    §Panics
    \n
    Panics if range start > end.\nPanics if range start == end and both bounds are Excluded.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut map: BTreeMap<&str, i32> =\n    [(\"Alice\", 0), (\"Bob\", 0), (\"Carol\", 0), (\"Cheryl\", 0)].into();\nfor (_, balance) in map.range_mut(\"B\"..\"Cheryl\") {\n    *balance += 100;\n}\nfor (name, balance) in &map {\n    println!(\"{name} => {balance}\");\n}
    \n
    1.0.0 · source
    pub fn entry(&mut self, key: K) -> Entry<'_, K, V, A>
    where\n    K: Ord,
    Gets the given key’s corresponding entry in the map for in-place manipulation.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut count: BTreeMap<&str, usize> = BTreeMap::new();\n\n// count the number of occurrences of letters in the vec\nfor x in [\"a\", \"b\", \"a\", \"c\", \"a\", \"b\"] {\n    count.entry(x).and_modify(|curr| *curr += 1).or_insert(1);\n}\n\nassert_eq!(count[\"a\"], 3);\nassert_eq!(count[\"b\"], 2);\nassert_eq!(count[\"c\"], 1);
    \n
    1.11.0 · source
    pub fn split_off<Q>(&mut self, key: &Q) -> BTreeMap<K, V, A>
    where\n    Q: Ord + ?Sized,\n    K: Borrow<Q> + Ord,\n    A: Clone,
    Splits the collection into two at the given key. Returns everything after the given key,\nincluding the key.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"a\");\na.insert(2, \"b\");\na.insert(3, \"c\");\na.insert(17, \"d\");\na.insert(41, \"e\");\n\nlet b = a.split_off(&3);\n\nassert_eq!(a.len(), 2);\nassert_eq!(b.len(), 3);\n\nassert_eq!(a[&1], \"a\");\nassert_eq!(a[&2], \"b\");\n\nassert_eq!(b[&3], \"c\");\nassert_eq!(b[&17], \"d\");\nassert_eq!(b[&41], \"e\");
    \n
    source
    pub fn extract_if<F>(&mut self, pred: F) -> ExtractIf<'_, K, V, F, A>
    where\n    K: Ord,\n    F: FnMut(&K, &mut V) -> bool,
    🔬This is a nightly-only experimental API. (btree_extract_if)
    Creates an iterator that visits all elements (key-value pairs) in\nascending key order and uses a closure to determine if an element should\nbe removed. If the closure returns true, the element is removed from\nthe map and yielded. If the closure returns false, or panics, the\nelement remains in the map and will not be yielded.
    \n
    The iterator also lets you mutate the value of each element in the\nclosure, regardless of whether you choose to keep or remove it.
    \n
    If the returned ExtractIf is not exhausted, e.g. because it is dropped without iterating\nor the iteration short-circuits, then the remaining elements will be retained.\nUse retain with a negated predicate if you do not need the returned iterator.
    \n
    §Examples
    \n
    Splitting a map into even and odd keys, reusing the original map:
    \n\n
    #![feature(btree_extract_if)]\nuse std::collections::BTreeMap;\n\nlet mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();\nlet evens: BTreeMap<_, _> = map.extract_if(|k, _v| k % 2 == 0).collect();\nlet odds = map;\nassert_eq!(evens.keys().copied().collect::<Vec<_>>(), [0, 2, 4, 6]);\nassert_eq!(odds.keys().copied().collect::<Vec<_>>(), [1, 3, 5, 7]);
    \n
    1.54.0 · source
    pub fn into_keys(self) -> IntoKeys<K, V, A>
    Creates a consuming iterator visiting all the keys, in sorted order.\nThe map cannot be used after calling this.\nThe iterator element type is K.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(2, \"b\");\na.insert(1, \"a\");\n\nlet keys: Vec<i32> = a.into_keys().collect();\nassert_eq!(keys, [1, 2]);
    \n
    1.54.0 · source
    pub fn into_values(self) -> IntoValues<K, V, A>
    Creates a consuming iterator visiting all the values, in order by key.\nThe map cannot be used after calling this.\nThe iterator element type is V.
    \n
    §Examples
    \n
    use std::collections::BTreeMap;\n\nlet mut a = BTreeMap::new();\na.insert(1, \"hello\");\na.insert(2, \"goodbye\");\n\nlet values: Vec<&str> = a.into_values().collect();\nassert_eq!(values, [\"hello\", \"goodbye\"]);
    \n
    ",0,"bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Clone for BTreeMap<K, V, A>
    where\n    K: Clone,\n    V: Clone,\n    A: Allocator + Clone,
    source§
    fn clone(&self) -> BTreeMap<K, V, A>
    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
    ","Clone","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Debug for BTreeMap<K, V, A>
    where\n    K: Debug,\n    V: Debug,\n    A: Allocator + Clone,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V> Default for BTreeMap<K, V>
    source§
    fn default() -> BTreeMap<K, V>
    Creates an empty BTreeMap.
    \n
    ","Default","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<'de, K, V> Deserialize<'de> for BTreeMap<K, V>
    where\n    K: Deserialize<'de> + Ord,\n    V: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<BTreeMap<K, V>, <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.7.0 · source§
    impl<K, V, A> Drop for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn drop(&mut self)
    Executes the destructor for this type. Read more
    ","Drop","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.2.0 · source§
    impl<'a, K, V, A> Extend<(&'a K, &'a V)> for BTreeMap<K, V, A>
    where\n    K: Ord + Copy,\n    V: Copy,\n    A: Allocator + Clone,
    source§
    fn extend<I>(&mut self, iter: I)
    where\n    I: IntoIterator<Item = (&'a K, &'a V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (&'a K, &'a V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(&'a K, &'a V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Extend<(K, V)> for BTreeMap<K, V, A>
    where\n    K: Ord,\n    A: Allocator + Clone,
    source§
    fn extend<T>(&mut self, iter: T)
    where\n    T: IntoIterator<Item = (K, V)>,
    Extends a collection with the contents of an iterator. Read more
    source§
    fn extend_one(&mut self, _: (K, V))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.56.0 · source§
    impl<K, V, const N: usize> From<[(K, V); N]> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from(arr: [(K, V); N]) -> BTreeMap<K, V>
    Converts a [(K, V); N] into a BTreeMap<(K, V)>.
    \n\n
    use std::collections::BTreeMap;\n\nlet map1 = BTreeMap::from([(1, 2), (3, 4)]);\nlet map2: BTreeMap<_, _> = [(1, 2), (3, 4)].into();\nassert_eq!(map1, map2);
    \n
    ","From<[(K, V); N]>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V> FromIterator<(K, V)> for BTreeMap<K, V>
    where\n    K: Ord,
    source§
    fn from_iter<T>(iter: T) -> BTreeMap<K, V>
    where\n    T: IntoIterator<Item = (K, V)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(K, V)>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Hash for BTreeMap<K, V, A>
    where\n    K: Hash,\n    V: Hash,\n    A: Allocator + Clone,
    source§
    fn hash<H>(&self, state: &mut H)
    where\n    H: Hasher,
    Feeds this value into the given Hasher. Read more
    1.3.0 · source§
    fn hash_slice<H>(data: &[Self], state: &mut H)
    where\n    H: Hasher,\n    Self: Sized,
    Feeds a slice of this type into the given Hasher. Read more
    ","Hash","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, Q, V, A> Index<&Q> for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,\n    K: Borrow<Q> + Ord,\n    Q: Ord + ?Sized,
    source§
    fn index(&self, key: &Q) -> &V
    Returns a reference to the value corresponding to the supplied key.
    \n
    §Panics
    \n
    Panics if the key is not present in the BTreeMap.
    \n
    §
    type Output = V
    The returned type after indexing.
    ","Index<&Q>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl IntoAssets for BTreeMap<DescriptorPublicKey, DescriptorSecretKey>
    §
    fn into_assets(self) -> Assets
    Convert self into a Assets struct
    ","IntoAssets","bdk_wallet::keys::KeyMap"],["
    source§
    impl<'de, K, V, E> IntoDeserializer<'de, E> for BTreeMap<K, V>
    where\n    K: IntoDeserializer<'de, E> + Eq + Ord,\n    V: IntoDeserializer<'de, E>,\n    E: Error,
    §
    type Deserializer = MapDeserializer<'de, <BTreeMap<K, V> as IntoIterator>::IntoIter, E>
    The type of the deserializer being converted into.
    source§
    fn into_deserializer(\n    self\n) -> <BTreeMap<K, V> as IntoDeserializer<'de, E>>::Deserializer
    Convert this value into a deserializer.
    ","IntoDeserializer<'de, E>","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> IntoIterator for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone,
    source§
    fn into_iter(self) -> IntoIter<K, V, A>
    Gets an owning iterator over the entries of the map, sorted by key.
    \n
    §
    type Item = (K, V)
    The type of the elements being iterated over.
    §
    type IntoIter = IntoIter<K, V, A>
    Which kind of iterator are we turning this into?
    ","IntoIterator","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    §
    impl<K, V> Merge for BTreeMap<K, V>
    where\n    K: Ord,
    §
    fn merge(&mut self, other: BTreeMap<K, V>)
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Ord for BTreeMap<K, V, A>
    where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
    source§
    fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
    This method returns an Ordering between self and other. Read more
    1.21.0 · source§
    fn max(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the maximum of two values. Read more
    1.21.0 · source§
    fn min(self, other: Self) -> Self
    where\n    Self: Sized,
    Compares and returns the minimum of two values. Read more
    1.50.0 · source§
    fn clamp(self, min: Self, max: Self) -> Self
    where\n    Self: Sized + PartialOrd,
    Restrict a value to a certain interval. Read more
    ","Ord","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> PartialEq for BTreeMap<K, V, A>
    where\n    K: PartialEq,\n    V: PartialEq,\n    A: Allocator + Clone,
    source§
    fn eq(&self, other: &BTreeMap<K, V, A>) -> bool
    This method tests for self and other values to be equal, and is used\nby ==.
    1.0.0 · source§
    fn ne(&self, other: &Rhs) -> bool
    This method tests for !=. The default implementation is almost always\nsufficient, and should not be overridden without very good reason.
    ","PartialEq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> PartialOrd for BTreeMap<K, V, A>
    where\n    K: PartialOrd,\n    V: PartialOrd,\n    A: Allocator + Clone,
    source§
    fn partial_cmp(&self, other: &BTreeMap<K, V, A>) -> Option<Ordering>
    This method returns an ordering between self and other values if one exists. Read more
    1.0.0 · source§
    fn lt(&self, other: &Rhs) -> bool
    This method tests less than (for self and other) and is used by the < operator. Read more
    1.0.0 · source§
    fn le(&self, other: &Rhs) -> bool
    This method tests less than or equal to (for self and other) and is used by the <=\noperator. Read more
    1.0.0 · source§
    fn gt(&self, other: &Rhs) -> bool
    This method tests greater than (for self and other) and is used by the > operator. Read more
    1.0.0 · source§
    fn ge(&self, other: &Rhs) -> bool
    This method tests greater than or equal to (for self and other) and is used by the >=\noperator. Read more
    ","PartialOrd","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    source§
    impl<K, V> Serialize for BTreeMap<K, V>
    where\n    K: Serialize,\n    V: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.0.0 · source§
    impl<K, V, A> Eq for BTreeMap<K, V, A>
    where\n    K: Eq,\n    V: Eq,\n    A: Allocator + Clone,
    ","Eq","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
    1.64.0 · source§
    impl<K, V, A> UnwindSafe for BTreeMap<K, V, A>
    where\n    A: Allocator + Clone + UnwindSafe,\n    K: RefUnwindSafe,\n    V: RefUnwindSafe,
    ","UnwindSafe","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"]]
 };if (window.register_type_impls) {window.register_type_impls(type_impls);} else {window.pending_type_impls = type_impls;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
index 78182e9876..cb7ae2fca6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
@@ -1,3 +1,3 @@
 (function() {var type_impls = {
-"example_cli":[["
    source§
    impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
    source§
    fn as_ref(&self) -> &TxGraph<A>
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef>","example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> Debug for IndexedTxGraph<A, I>
    where\n    A: Debug,\n    I: Debug,
    source§
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> Default for IndexedTxGraph<A, I>
    where\n    I: Default,
    source§
    fn default() -> IndexedTxGraph<A, I>
    Returns the “default value” for a type. Read more
    ","Default","example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
    Methods are available if the anchor (A) can be created from TxPosInBlock.
    \n
    source
    pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
    \n
    Each inserted transaction’s anchor will be constructed using TxPosInBlock.
    \n
    Relevancy is determined by the internal Indexer::is_tx_relevant implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    source
    pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height.
    \n
    Each inserted transaction’s anchor will be constructed using TxPosInBlock.
    \n
    To only insert relevant transactions, use apply_block_relevant instead.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> IndexedTxGraph<A, I>
    source
    pub fn new(index: I) -> IndexedTxGraph<A, I>
    Construct a new IndexedTxGraph with a given index.
    \n
    source
    pub fn graph(&self) -> &TxGraph<A>
    Get a reference of the internal transaction graph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,
    source
    pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>\n)
    Applies the ChangeSet to the IndexedTxGraph.
    \n
    source
    pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Determines the ChangeSet between self and an empty IndexedTxGraph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    source§
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
    source
    pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply an update directly.
    \n
    update is a tx_graph::TxUpdate<A> and the resultant changes is returned as ChangeSet.
    \n
    source
    pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply the given update with an optional seen_at timestamp.
    \n
    seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
    \n
    Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
    \n
    Use apply_update to have the seen_at value automatically\nset to the current time.
    \n
    source
    pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a floating txout of given outpoint.
    \n
    source
    pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Insert and index a transaction into the graph.
    \n
    source
    pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert an anchor for a given transaction.
    \n
    source
    pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a unix timestamp of when a transaction is seen in the mempool.
    \n
    This is used for transaction conflict resolution in TxGraph where the transaction with\nthe later last-seen is prioritized.
    \n
    source
    pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the Indexer::is_tx_relevant implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
    \n
    source
    pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the internal Indexer::is_tx_relevant implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in TxGraph (refer to TxGraph::insert_seen_at for details).
    \n
    source
    pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in TxGraph (refer to TxGraph::insert_seen_at for details).
    \n
    To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
    \n
    ",0,"example_cli::KeychainTxGraph"]]
+"example_cli":[["
    §
    impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
    §
    fn as_ref(&self) -> &TxGraph<A>
    Converts this type into a shared reference of the (usually inferred) input type.
    ","AsRef>","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> Debug for IndexedTxGraph<A, I>
    where\n    A: Debug,\n    I: Debug,
    §
    fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
    Formats the value using the given formatter. Read more
    ","Debug","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> Default for IndexedTxGraph<A, I>
    where\n    I: Default,
    §
    fn default() -> IndexedTxGraph<A, I>
    Returns the “default value” for a type. Read more
    ","Default","example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    pub fn new(index: I) -> IndexedTxGraph<A, I>
    Construct a new [IndexedTxGraph] with a given index.
    \n
    pub fn graph(&self) -> &TxGraph<A>
    Get a reference of the internal transaction graph.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
    Methods are available if the anchor (A) can be created from [TxPosInBlock].
    \n
    pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
    \n
    Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
    \n
    Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Batch insert all transactions of the given block of height.
    \n
    Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
    \n
    To only insert relevant transactions, use apply_block_relevant instead.
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,
    pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>\n)
    Applies the [ChangeSet] to the [IndexedTxGraph].
    \n
    pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Determines the [ChangeSet] between self and an empty [IndexedTxGraph].
    \n
    ",0,"example_cli::KeychainTxGraph"],["
    §
    impl<A, I> IndexedTxGraph<A, I>
    where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
    pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply an update directly.
    \n
    update is a [tx_graph::TxUpdate<A>] and the resultant changes is returned as [ChangeSet].
    \n
    pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Apply the given update with an optional seen_at timestamp.
    \n
    seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
    \n
    Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
    \n
    Use apply_update to have the seen_at value automatically\nset to the current time.
    \n
    pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a floating txout of given outpoint.
    \n
    pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Insert and index a transaction into the graph.
    \n
    pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert an anchor for a given transaction.
    \n
    pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    Insert a unix timestamp of when a transaction is seen in the mempool.
    \n
    This is used for transaction conflict resolution in [TxGraph] where the transaction with\nthe later last-seen is prioritized.
    \n
    pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the [Indexer::is_tx_relevant] implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
    \n
    pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions, filtering out those that are irrelevant.
    \n
    Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
    \n
    pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
    where\n    T: Into<Arc<Transaction>>,
    Batch insert unconfirmed transactions.
    \n
    Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
    \n
    To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
    \n
    ",0,"example_cli::KeychainTxGraph"]]
 };if (window.register_type_impls) {window.register_type_impls(type_impls);} else {window.pending_type_impls = type_impls;}})()
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
index 6a4ae7e443..9b5545853f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/std/primitive.tuple.js
@@ -1,5 +1,5 @@
 (function() {var type_impls = {
-"bdk_chain":[["
    §
    impl<T0, T1> Decodable for (T0, T1)
    where\n    T0: Decodable,\n    T1: Decodable,
    §
    fn consensus_decode<R>(r: &mut R) -> Result<(T0, T1), Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
    where\n    T0: Deserialize<'de>,\n    T1: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<(T0, T1), <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<T0, T1> Encodable for (T0, T1)
    where\n    T0: Encodable,\n    T1: Encodable,
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    1.56.0 · source§
    impl<A, B, ExtendA, ExtendB> Extend<(A, B)> for (ExtendA, ExtendB)
    where\n    ExtendA: Extend<A>,\n    ExtendB: Extend<B>,
    source§
    fn extend<T>(&mut self, into_iter: T)
    where\n    T: IntoIterator<Item = (A, B)>,
    Allows to extend a tuple of collections that also implement Extend.
    \n
    See also: Iterator::unzip
    \n
    §Examples
    \n
    let mut tuple = (vec![0], vec![1]);\ntuple.extend([(2, 3), (4, 5), (6, 7)]);\nassert_eq!(tuple.0, [0, 2, 4, 6]);\nassert_eq!(tuple.1, [1, 3, 5, 7]);\n\n// also allows for arbitrarily nested tuples as elements\nlet mut nested_tuple = (vec![1], (vec![2], vec![3]));\nnested_tuple.extend([(4, (5, 6)), (7, (8, 9))]);\n\nlet (a, (b, c)) = nested_tuple;\nassert_eq!(a, [1, 4, 7]);\nassert_eq!(b, [2, 5, 8]);\nassert_eq!(c, [3, 6, 9]);
    \n
    source§
    fn extend_one(&mut self, item: (A, B))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(A, B)>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    1.71.0 · source§
    impl<T> From<[T; 2]> for (T, T)
    source§
    fn from(array: [T; 2]) -> (T, T)
    Converts to this type from the input type.
    ","From<[T; 2]>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl From<BlockId> for (u32, BlockHash)
    source§
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    ","From","bdk_chain::Indexed"],["
    1.79.0 · source§
    impl<A, B, AE, BE> FromIterator<(AE, BE)> for (A, B)
    where\n    A: Default + Extend<AE>,\n    B: Default + Extend<BE>,
    This implementation turns an iterator of tuples into a tuple of types which implement\nDefault and Extend.
    \n
    This is similar to Iterator::unzip, but is also composable with other FromIterator\nimplementations:
    \n\n
    let string = \"1,2,123,4\";\n\nlet (numbers, lengths): (Vec<_>, Vec<_>) = string\n    .split(',')\n    .map(|s| s.parse().map(|n: u32| (n, s.len())))\n    .collect::<Result<_, _>>()?;\n\nassert_eq!(numbers, [1, 2, 123, 4]);\nassert_eq!(lengths, [1, 1, 3, 1]);
    \n
    source§
    fn from_iter<I>(iter: I) -> (A, B)
    where\n    I: IntoIterator<Item = (AE, BE)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(AE, BE)>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    source§
    fn merge(&mut self, _other: (T0, T1))
    Merge another object of the same type onto self.
    source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl<T0, T1> Serialize for (T0, T1)
    where\n    T0: Serialize,\n    T1: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<'a, O, P> TryFrom<&'a Row<'a>> for (O, P)
    where\n    O: FromSql,\n    P: FromSql,
    §
    type Error = Error
    The type returned in the event of a conversion error.
    §
    fn try_from(row: &'a Row<'a>) -> Result<(O, P), Error>
    Performs the conversion.
    ","TryFrom<&'a Row<'a>>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"]],
+"bdk_chain":[["
    §
    impl<T0, T1> Decodable for (T0, T1)
    where\n    T0: Decodable,\n    T1: Decodable,
    §
    fn consensus_decode<R>(r: &mut R) -> Result<(T0, T1), Error>
    where\n    R: Read + ?Sized,
    Decode an object with a well-defined format. Read more
    §
    fn consensus_decode_from_finite_reader<R>(reader: &mut R) -> Result<Self, Error>
    where\n    R: Read + ?Sized,
    Decode Self from a size-limited reader. Read more
    ","Decodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl<'de, T0, T1> Deserialize<'de> for (T0, T1)
    where\n    T0: Deserialize<'de>,\n    T1: Deserialize<'de>,
    source§
    fn deserialize<D>(\n    deserializer: D\n) -> Result<(T0, T1), <D as Deserializer<'de>>::Error>
    where\n    D: Deserializer<'de>,
    Deserialize this value from the given Serde deserializer. Read more
    ","Deserialize<'de>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<T0, T1> Encodable for (T0, T1)
    where\n    T0: Encodable,\n    T1: Encodable,
    §
    fn consensus_encode<W>(&self, w: &mut W) -> Result<usize, Error>
    where\n    W: Write + ?Sized,
    Encodes an object with a well-defined format. Read more
    ","Encodable","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    1.56.0 · source§
    impl<A, B, ExtendA, ExtendB> Extend<(A, B)> for (ExtendA, ExtendB)
    where\n    ExtendA: Extend<A>,\n    ExtendB: Extend<B>,
    source§
    fn extend<T>(&mut self, into_iter: T)
    where\n    T: IntoIterator<Item = (A, B)>,
    Allows to extend a tuple of collections that also implement Extend.
    \n
    See also: Iterator::unzip
    \n
    §Examples
    \n
    let mut tuple = (vec![0], vec![1]);\ntuple.extend([(2, 3), (4, 5), (6, 7)]);\nassert_eq!(tuple.0, [0, 2, 4, 6]);\nassert_eq!(tuple.1, [1, 3, 5, 7]);\n\n// also allows for arbitrarily nested tuples as elements\nlet mut nested_tuple = (vec![1], (vec![2], vec![3]));\nnested_tuple.extend([(4, (5, 6)), (7, (8, 9))]);\n\nlet (a, (b, c)) = nested_tuple;\nassert_eq!(a, [1, 4, 7]);\nassert_eq!(b, [2, 5, 8]);\nassert_eq!(c, [3, 6, 9]);
    \n
    source§
    fn extend_one(&mut self, item: (A, B))
    🔬This is a nightly-only experimental API. (extend_one)
    Extends a collection with exactly one element.
    source§
    fn extend_reserve(&mut self, additional: usize)
    🔬This is a nightly-only experimental API. (extend_one)
    Reserves capacity in a collection for the given number of additional elements. Read more
    ","Extend<(A, B)>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    1.71.0 · source§
    impl<T> From<[T; 2]> for (T, T)
    source§
    fn from(array: [T; 2]) -> (T, T)
    Converts to this type from the input type.
    ","From<[T; 2]>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl From<BlockId> for (u32, BlockHash)
    §
    fn from(block_id: BlockId) -> (u32, BlockHash)
    Converts to this type from the input type.
    ","From","bdk_chain::Indexed"],["
    1.79.0 · source§
    impl<A, B, AE, BE> FromIterator<(AE, BE)> for (A, B)
    where\n    A: Default + Extend<AE>,\n    B: Default + Extend<BE>,
    This implementation turns an iterator of tuples into a tuple of types which implement\nDefault and Extend.
    \n
    This is similar to Iterator::unzip, but is also composable with other FromIterator\nimplementations:
    \n\n
    let string = \"1,2,123,4\";\n\nlet (numbers, lengths): (Vec<_>, Vec<_>) = string\n    .split(',')\n    .map(|s| s.parse().map(|n: u32| (n, s.len())))\n    .collect::<Result<_, _>>()?;\n\nassert_eq!(numbers, [1, 2, 123, 4]);\nassert_eq!(lengths, [1, 1, 3, 1]);
    \n
    source§
    fn from_iter<I>(iter: I) -> (A, B)
    where\n    I: IntoIterator<Item = (AE, BE)>,
    Creates a value from an iterator. Read more
    ","FromIterator<(AE, BE)>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    §
    fn merge(&mut self, _other: (T0, T1))
    Merge another object of the same type onto self.
    §
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    §
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    source§
    impl<T0, T1> Serialize for (T0, T1)
    where\n    T0: Serialize,\n    T1: Serialize,
    source§
    fn serialize<S>(\n    &self,\n    serializer: S\n) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
    where\n    S: Serializer,
    Serialize this value into the given Serde serializer. Read more
    ","Serialize","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"],["
    §
    impl<'a, O, P> TryFrom<&'a Row<'a>> for (O, P)
    where\n    O: FromSql,\n    P: FromSql,
    §
    type Error = Error
    The type returned in the event of a conversion error.
    §
    fn try_from(row: &'a Row<'a>) -> Result<(O, P), Error>
    Performs the conversion.
    ","TryFrom<&'a Row<'a>>","bdk_chain::Indexed","bdk_chain::KeychainIndexed","bdk_chain::bitcoin::bip32::KeySource"]],
 "bdk_core":[["
    source§
    impl From<BlockId> for (u32, BlockHash)
    source§
    fn from(block_id: BlockId) -> Self
    Converts to this type from the input type.
    ","From","bdk_core::Indexed"],["
    source§
    impl<T0, T1> Merge for (T0, T1)
    where\n    T0: Merge,\n    T1: Merge,
    source§
    fn merge(&mut self, _other: Self)
    Merge another object of the same type onto self.
    source§
    fn is_empty(&self) -> bool
    Returns whether the structure is considered empty.
    source§
    fn take(&mut self) -> Option<Self>
    Take the value, replacing it with the default value.
    ","Merge","bdk_core::Indexed","bdk_core::KeychainIndexed"]],
 "bdk_wallet":[],
 "example_cli":[]
-- 
2.49.0