From: github-actions Date: Mon, 25 Nov 2024 05:18:29 +0000 (+0000) Subject: Publish autogenerated nightly docs X-Git-Url: http://internal-gitweb-vhost/script/%22https:/database/scripts/static/enum.ExtendedKey.html?a=commitdiff_plain;h=21cb533c46c721b789c71e9c7531225fce4f0c26;p=bitcoindevkit.org Publish autogenerated nightly docs --- 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 63de41062e..21249304c5 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 93691dc1ac..492c187ba6 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 65543554b6..b995592890 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 e447048197..f5eb3aba2f 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 7eded3c01a..ef176048a2 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 b8fbf5d05a..a3a2ab39ba 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 711eeead42..9e030aacc8 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§

    §

    impl Freeze for ChangeSet

    §

    impl RefUnwindSafe for ChangeSet

    §

    impl Send for ChangeSet

    §

    impl Sync for ChangeSet

    §

    impl Unpin for ChangeSet

    §

    impl UnwindSafe for ChangeSet

    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 48afd20be5..a612085633 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§

    §

    impl Freeze for ChangeSet

    §

    impl RefUnwindSafe for ChangeSet

    §

    impl Send for ChangeSet

    §

    impl Sync for ChangeSet

    §

    impl Unpin for ChangeSet

    §

    impl UnwindSafe for ChangeSet

    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 5a171804d1..43b4ce60ea 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§

    §

    impl Freeze for BlockId

    §

    impl RefUnwindSafe for BlockId

    §

    impl Send for BlockId

    §

    impl Sync for BlockId

    §

    impl Unpin for BlockId

    §

    impl UnwindSafe for BlockId

    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§

    §

    impl Freeze for BlockId

    §

    impl RefUnwindSafe for BlockId

    §

    impl Send for BlockId

    §

    impl Sync for BlockId

    §

    impl Unpin for BlockId

    §

    impl UnwindSafe for BlockId

    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 1b0215f849..b56db4b3a1 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 d2646e65a7..57e853d11c 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 18025f6e5b..f43c063289 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 213113be78..2849027ef9 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_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
index cfaf52a430..f533150f1c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/index.html
@@ -1,6 +1,6 @@
 bdk_electrum - Rust
    Crate bdk_electrum
    source · 
    Expand description
    This crate is used for returning updates from Electrum servers.
    
-
    Updates are returned as either a SyncResponse (if BdkElectrumClient::sync() is called),
-or a FullScanResponse (if BdkElectrumClient::full_scan() is called).
    
+
    Updates are returned as either a SyncResponse (if BdkElectrumClient::sync() is called),
+or a FullScanResponse (if BdkElectrumClient::full_scan() is called).
    
 
    In most cases BdkElectrumClient::sync() is used to sync the transaction histories of scripts
 that the application cares about, for example the scripts for all the receive addresses of a
 Wallet’s keychain that it has shown a user.
    
@@ -8,5 +8,5 @@ Wallet’s keychain that it has shown a user.
    
 where the range of possibly used scripts is not known. In this case it is necessary to scan all
 keychain scripts until a number (the “stop gap”) of unused scripts is discovered.
    
 
    Refer to example_electrum for a complete example.
    
-
    Re-exports§
    • pub use bdk_core;
    • pub use electrum_client;
    Structs§
    • BdkElectrumClient
      Wrapper around an [electrum_client::ElectrumApi] which includes an internal in-memory
+
    Re-exports§
    • pub use bdk_core;
    • pub use electrum_client;
    Structs§
    • BdkElectrumClient
      Wrapper around an [electrum_client::ElectrumApi] which includes an internal in-memory
 transaction cache to avoid re-fetching already downloaded transactions.
    
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
index 73eeb2ed0e..1cf67cfc8c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_electrum/struct.BdkElectrumClient.html
@@ -16,15 +16,15 @@ transactions.
    
 
    This is a re-export of [ElectrumApi::transaction_broadcast].
    
 
    source
    pub fn full_scan<K: Ord + Clone>(
     &self,
-    request: impl Into<FullScanRequest<K>>,
+    request: impl Into<FullScanRequest<K>>,
     stop_gap: usize,
     batch_size: usize,
     fetch_prev_txouts: bool
-) -> Result<FullScanResponse<K>, Error>
    Full scan the keychain scripts specified with the blockchain (via an Electrum client) and
+) -> Result<FullScanResponse<K>, Error>

    Full scan the keychain scripts specified with the blockchain (via an Electrum client) and returns updates for bdk_chain data structures.

    • request: struct with data required to perform a spk-based blockchain client full scan, -see [FullScanRequest].
      • +see FullScanRequest.
    • stop_gap: the full scan for each keychain stops after a gap of script pubkeys with no associated transactions.
    • batch_size: specifies the max number of script pubkeys to request for in a single batch @@ -39,14 +39,14 @@ present in the transaction graph.
    source

    pub fn sync<I: 'static>( &self, - request: impl Into<SyncRequest<I>>, + request: impl Into<SyncRequest<I>>, batch_size: usize, fetch_prev_txouts: bool -) -> Result<SyncResponse, Error>

    Sync a set of scripts with the blockchain (via an Electrum client) for the data specified +) -> Result<SyncResponse, Error>

    Sync a set of scripts with the blockchain (via an Electrum client) for the data specified and returns updates for bdk_chain data structures.

    • request: struct with data required to perform a spk-based blockchain client sync, -see [SyncRequest]
      • +see SyncRequest
    • batch_size: specifies the max number of script pubkeys to request for in a single batch request
    • fetch_prev_txouts: specifies whether we want previous TxOuts for fee calculation. 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 9b88f8f493..0123309ef4 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 @@ -34,7 +34,7 @@ Refer to 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 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.

    Auto Trait Implementations§

    §

    impl !Freeze for TestEnv

    §

    impl !RefUnwindSafe for TestEnv

    §

    impl Send for TestEnv

    §

    impl Sync for TestEnv

    §

    impl Unpin for TestEnv

    §

    impl !UnwindSafe for TestEnv

    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_wallet/enum.FileStoreError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/enum.FileStoreError.html index 7d088a8b6b..3f40545cb3 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/enum.FileStoreError.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/enum.FileStoreError.html @@ -1,8 +1,8 @@ FileStoreError in bdk_wallet - Rust

    Enum bdk_wallet::FileStoreError

    source · 
    pub enum FileStoreError {
-    Load(AggregateChangesetsError<ChangeSet>),
+    Load(AggregateChangesetsError<ChangeSet>),
     Write(Error),
-}
    Expand description

    Error for bdk_file_store’s implementation of WalletPersister.

    -

    Variants§

    §

    Load(AggregateChangesetsError<ChangeSet>)

    Error when loading from the store.

    +}
    Expand description

    Error for [bdk_file_store]’s implementation of WalletPersister.

    +

    Variants§

    §

    Load(AggregateChangesetsError<ChangeSet>)

    Error when loading from the store.

    §

    Write(Error)

    Error when writing to the store.

    Trait Implementations§

    source§

    impl Debug for FileStoreError

    source§

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

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

    impl Display for FileStoreError

    source§

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

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

    impl Error for FileStoreError

    1.30.0 · source§

    fn source(&self) -> Option<&(dyn Error + 'static)>

    The lower-level source of this error, if any. Read more
    1.0.0 · source§

    fn description(&self) -> &str

    👎Deprecated since 1.42.0: use the Display impl or to_string()
    Read more
    1.0.0 · source§

    fn cause(&self) -> Option<&dyn Error>

    👎Deprecated since 1.33.0: replaced by Error::source, which can support downcasting
    source§

    fn provide<'a>(&'a self, request: &mut Request<'a>)

    🔬This is a nightly-only experimental API. (error_generic_member_access)
    Provides type based access to context intended for error reports. 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 diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/index.html index 9917cc58c9..037a5fa16c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/index.html @@ -183,7 +183,7 @@ that the Wallet can use to update its view of the chain.

    submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

    -

    Re-exports§

    • pub extern crate bitcoin;
    • pub extern crate bdk_chain as chain;
    • pub extern crate bdk_file_store as file_store;
    • pub extern crate miniscript;
    • pub extern crate serde;
    • pub extern crate serde_json;
    • pub use descriptor::template;
    • pub use descriptor::HdKeyPaths;
    • pub use signer;
    • pub use bdk_chain::rusqlite;

    Modules§

    Macros§

    • descriptor
      Macro to write full descriptors with code
    • fragment
      Macro to write descriptor fragments with code

    Structs§

    Enums§

    Traits§

    Re-exports§

    Modules§

    Macros§

    Structs§

    Enums§

    Traits§

    Functions§

    Type Aliases§

    \ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html index c005b74775..487cb8826b 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.WalletPersister.html @@ -30,10 +30,10 @@ persister implementations may NOT require initialization at all (and not error). changeset: &ChangeSet ) -> Result<(), Self::Error>

    Persist the given changeset to the persister.

    This method can fail if the persister is not initialized.

    -

    Object Safety§

    This trait is not object safe.

    Implementations on Foreign Types§

    source§

    impl WalletPersister for Store<ChangeSet>

    §

    type Error = FileStoreError

    source§

    fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>

    source§

    fn persist( +

    Object Safety§

    This trait is not object safe.

    Implementations on Foreign Types§

    source§

    impl WalletPersister for Connection

    §

    type Error = Error

    source§

    fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>

    source§

    fn persist( persister: &mut Self, changeset: &ChangeSet -) -> Result<(), Self::Error>

    source§

    impl WalletPersister for Connection

    §

    type Error = Error

    source§

    fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>

    source§

    fn persist( +) -> Result<(), Self::Error>

    source§

    impl WalletPersister for Store<ChangeSet>

    §

    type Error = FileStoreError

    source§

    fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>

    source§

    fn persist( persister: &mut Self, changeset: &ChangeSet ) -> Result<(), Self::Error>

    source§

    impl<'c> WalletPersister for Transaction<'c>

    §

    type Error = Error

    source§

    fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>

    source§

    fn persist( 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 d83666a4d3..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 8c8e2d03a2..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/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 3a42a23f2a..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_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/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":[]