diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html index 9f7bb5793c..a44e61f8f2 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/all.html @@ -1 +1 @@ -List of all items in this crate

List of all items

Structs

Traits

\ No newline at end of file +List of all items in this crate

List of all items

Structs

Traits

\ No newline at end of file diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html index d6ad6903e2..8ea865da3c 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/index.html @@ -1,4 +1,4 @@ -bdk_bitcoind_rpc - Rust

Crate bdk_bitcoind_rpc

Source
Expand description

This crate is used for emitting blockchain data from the bitcoind RPC interface. It does not +bdk_bitcoind_rpc - Rust

Crate bdk_bitcoind_rpc

Source
Expand description

This crate is used for emitting blockchain data from the bitcoind RPC interface. It does not use the wallet RPC API, so this crate can be used with wallet-disabled Bitcoin Core nodes.

Emitter is the main structure which sources blockchain data from [bitcoincore_rpc::Client].

To only get block updates (exclude mempool transactions), the caller can use diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html index 1a9f8408c3..c8570a9876 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.BlockEvent.html @@ -1,18 +1,18 @@ -BlockEvent in bdk_bitcoind_rpc - Rust

bdk_bitcoind_rpc

Struct BlockEvent

Source 
pub struct BlockEvent<B> {
+BlockEvent in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct BlockEvent
Source 
pub struct BlockEvent<B> {
     pub block: B,
-    pub checkpoint: CheckPoint,
+    pub checkpoint: CheckPoint,
 }
Expand description
A newly emitted block from Emitter.

 
Fields§
§block: B
Either a full [Block] or [Header] of the new block.

-
§checkpoint: CheckPoint
The checkpoint of the new block.

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

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

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

 
Implementations§
Source§
impl<B> BlockEvent<B>
Source
pub fn block_height(&self) -> u32
The block height of this new block.

 
Source
pub fn block_hash(&self) -> BlockHash
The block hash of this new block.

-
Source
pub fn connected_to(&self) -> BlockId
The BlockId of a previous block that this block connects to.

-
This either returns a BlockId of a previously emitted block or from the chain we started
+
Source
pub fn connected_to(&self) -> BlockId
The [BlockId] of a previous block that this block connects to.

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

 
This value is derived from BlockEvent::checkpoint.

 
Trait Implementations§
Source§
impl<B: Debug> Debug for BlockEvent<B>
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait Implementations§
§
impl<B> Freeze for BlockEvent<B>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
index c7e269b3da..1093b51e9d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/struct.Emitter.html
@@ -1,6 +1,6 @@
-Emitter in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct Emitter
Source 
pub struct Emitter<'c, C> { /* private fields */ }
Expand description
The Emitter is used to emit data sourced from [bitcoincore_rpc::Client].

+Emitter in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Struct Emitter
Source 
pub struct Emitter<'c, C> { /* private fields */ }
Expand description
The Emitter is used to emit data sourced from [bitcoincore_rpc::Client].

 
Refer to module-level documentation for more.

-
Implementations§
Source§
impl<'c, C: RpcApi> Emitter<'c, C>
Source
pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self
Construct a new Emitter.

+
Implementations§
Source§
impl<'c, C: RpcApi> Emitter<'c, C>
Source
pub fn new(client: &'c C, last_cp: CheckPoint, start_height: u32) -> Self
Construct a new Emitter.

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

 
start_height starts emission from a given height (if there are no conflicts with the
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
index fa5a6e40b4..df073bba64 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_bitcoind_rpc/trait.BitcoindRpcErrorExt.html
@@ -1,4 +1,4 @@
-BitcoindRpcErrorExt in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Trait BitcoindRpcErrorExt
Source 
pub trait BitcoindRpcErrorExt {
+BitcoindRpcErrorExt in bdk_bitcoind_rpc - Rust
bdk_bitcoind_rpc
Trait BitcoindRpcErrorExt
Source 
pub trait BitcoindRpcErrorExt {
     // Required method
     fn is_not_found_error(&self) -> bool;
 }
Expand description
Extends [bitcoincore_rpc::Error].

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
index 2226db6e6d..9ce98ac3f3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Traits
Macros
Derive Macros
Functions
Type Aliases
Statics
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Traits
Macros
Derive Macros
Functions
Type Aliases
Statics
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
index 1f07151fc6..10b3782620 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressData.html
@@ -1,4 +1,4 @@
-AddressData in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressData
#[non_exhaustive]
pub enum AddressData {
+AddressData in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressData
#[non_exhaustive]
pub enum AddressData {
     P2pkh {
         pubkey_hash: PubkeyHash,
     },
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
index 965f406cc9..da2cd82a20 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.AddressType.html
@@ -1,4 +1,4 @@
-AddressType in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressType
#[non_exhaustive]
pub enum AddressType {
+AddressType in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum AddressType
#[non_exhaustive]
pub enum AddressType {
     P2pkh,
     P2sh,
     P2wpkh,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
index 8b49879372..45834b3f7c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.FromScriptError.html
@@ -1,4 +1,4 @@
-FromScriptError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
+FromScriptError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
     UnrecognizedScript,
     WitnessProgram(Error),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
index 706f9786a6..a45c810fff 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.KnownHrp.html
@@ -1,4 +1,4 @@
-KnownHrp in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum KnownHrp
#[non_exhaustive]
pub enum KnownHrp {
+KnownHrp in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum KnownHrp
#[non_exhaustive]
pub enum KnownHrp {
     Mainnet,
     Testnets,
     Regtest,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
index a95e0fe47f..df32b9c897 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkChecked.html
@@ -1,4 +1,4 @@
-NetworkChecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkChecked
pub enum NetworkChecked {}
Expand description
Marker that address’s network has been successfully validated. See section Parsing addresses
+NetworkChecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkChecked
pub enum NetworkChecked {}
Expand description
Marker that address’s network has been successfully validated. See section Parsing addresses
 on Address for details.

 
Trait Implementations§
§
impl Clone for NetworkChecked
§
fn clone(&self) -> NetworkChecked
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 NetworkChecked
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Hash for NetworkChecked
§
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
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
index be22d43d1f..fe921b3aad 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.NetworkUnchecked.html
@@ -1,4 +1,4 @@
-NetworkUnchecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkUnchecked
pub enum NetworkUnchecked {}
Expand description
Marker that address’s network has not yet been validated. See section Parsing addresses
+NetworkUnchecked in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum NetworkUnchecked
pub enum NetworkUnchecked {}
Expand description
Marker that address’s network has not yet been validated. See section Parsing addresses
 on Address for details.

 
Trait Implementations§
§
impl Clone for NetworkUnchecked
§
fn clone(&self) -> NetworkUnchecked
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 NetworkUnchecked
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Hash for NetworkUnchecked
§
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
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
index d90bc4b57b..408ce4c017 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.P2shError.html
@@ -1,4 +1,4 @@
-P2shError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
+P2shError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
     ExcessiveScriptSize,
 }
Expand description
Error while generating address from a p2sh script.

 
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§
ExcessiveScriptSize
Address size more than 520 bytes is not allowed.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
index 38dfb48f9a..3dfee12a6e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/enum.ParseError.html
@@ -1,4 +1,4 @@
-ParseError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
+ParseError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
     Base58(Error),
     Bech32(DecodeError),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
index 1e1dfa028a..8a9da23dbd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.FromScriptError.html
@@ -1,4 +1,4 @@
-FromScriptError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
+FromScriptError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum FromScriptError
#[non_exhaustive]
pub enum FromScriptError {
     UnrecognizedScript,
     WitnessProgram(Error),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
index 91b4fcd805..2dad0c4ce7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.P2shError.html
@@ -1,4 +1,4 @@
-P2shError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
+P2shError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum P2shError
#[non_exhaustive]
pub enum P2shError {
     ExcessiveScriptSize,
 }
Expand description
Error while generating address from a p2sh script.

 
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
§
ExcessiveScriptSize
Address size more than 520 bytes is not allowed.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
index 7cc433d637..a0ac49fcc9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/enum.ParseError.html
@@ -1,4 +1,4 @@
-ParseError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
+ParseError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Enum ParseError
#[non_exhaustive]
pub enum ParseError {
     Base58(Error),
     Bech32(DecodeError),
     WitnessVersion(TryFromError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
index c4eff56500..61f344c0be 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/index.html
@@ -1,2 +1,2 @@
-bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address
Module error
Expand description
Error code for the address module.

+bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address
Module error
Expand description
Error code for the address module.

 
Structs§
InvalidBase58PayloadLengthError
Decoded base58 data was an invalid length.
InvalidLegacyPrefixError
Invalid legacy address prefix in decoded base58 data.
LegacyAddressTooLongError
Legacy base58 address was too long, max 50 characters.
NetworkValidationError
Address’s network differs from required one.
UnknownAddressTypeError
Address type is either invalid or not supported in rust-bitcoin.
UnknownHrpError
Unknown HRP error.
Enums§
FromScriptError
Error while generating address from script.
P2shError
Error while generating address from a p2sh script.
ParseError
Address parsing error.

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
index 7dc4c97f7a..54d8b39d64 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidBase58PayloadLengthError.html
@@ -1,4 +1,4 @@
-InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

+InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

 
Implementations§
§
impl InvalidBase58PayloadLengthError
pub fn invalid_base58_payload_length(&self) -> usize
Returns the invalid payload length.

 
Trait Implementations§
§
impl Clone for InvalidBase58PayloadLengthError
§
fn clone(&self) -> InvalidBase58PayloadLengthError
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 InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidBase58PayloadLengthError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidBase58PayloadLengthError> for ParseError
§
fn from(e: InvalidBase58PayloadLengthError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidBase58PayloadLengthError
§
fn eq(&self, other: &InvalidBase58PayloadLengthError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidBase58PayloadLengthError
§
impl StructuralPartialEq for InvalidBase58PayloadLengthError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
index 9f2e4dcbce..e0b858a913 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.InvalidLegacyPrefixError.html
@@ -1,4 +1,4 @@
-InvalidLegacyPrefixError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

+InvalidLegacyPrefixError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

 
Implementations§
§
impl InvalidLegacyPrefixError
pub fn invalid_legacy_address_prefix(&self) -> u8
Returns the invalid prefix.

 
Trait Implementations§
§
impl Clone for InvalidLegacyPrefixError
§
fn clone(&self) -> InvalidLegacyPrefixError
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 InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidLegacyPrefixError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidLegacyPrefixError> for ParseError
§
fn from(e: InvalidLegacyPrefixError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidLegacyPrefixError
§
fn eq(&self, other: &InvalidLegacyPrefixError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidLegacyPrefixError
§
impl StructuralPartialEq for InvalidLegacyPrefixError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
index 345c310b85..06a9b4818f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.LegacyAddressTooLongError.html
@@ -1,4 +1,4 @@
-LegacyAddressTooLongError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

+LegacyAddressTooLongError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

 
Implementations§
§
impl LegacyAddressTooLongError
pub fn invalid_legcay_address_length(&self) -> usize
Returns the invalid legacy address length.

 
Trait Implementations§
§
impl Clone for LegacyAddressTooLongError
§
fn clone(&self) -> LegacyAddressTooLongError
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 LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for LegacyAddressTooLongError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<LegacyAddressTooLongError> for ParseError
§
fn from(e: LegacyAddressTooLongError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for LegacyAddressTooLongError
§
fn eq(&self, other: &LegacyAddressTooLongError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for LegacyAddressTooLongError
§
impl StructuralPartialEq for LegacyAddressTooLongError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
index d3fd71f1f0..01021db13a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.NetworkValidationError.html
@@ -1,4 +1,4 @@
-NetworkValidationError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

+NetworkValidationError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

 
Trait Implementations§
§
impl Clone for NetworkValidationError
§
fn clone(&self) -> NetworkValidationError
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 NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for NetworkValidationError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<NetworkValidationError> for ParseError
§
fn from(e: NetworkValidationError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for NetworkValidationError
§
fn eq(&self, other: &NetworkValidationError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for NetworkValidationError
§
impl StructuralPartialEq for NetworkValidationError
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/bitcoin/address/error/struct.UnknownAddressTypeError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
index a19816c75c..3c2c06e572 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownAddressTypeError.html
@@ -1,4 +1,4 @@
-UnknownAddressTypeError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

+UnknownAddressTypeError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownAddressTypeError
§
fn clone(&self) -> UnknownAddressTypeError
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 UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownAddressTypeError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl PartialEq for UnknownAddressTypeError
§
fn eq(&self, other: &UnknownAddressTypeError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownAddressTypeError
§
impl StructuralPartialEq for UnknownAddressTypeError
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/bitcoin/address/error/struct.UnknownHrpError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
index f89b575556..a50dde6c63 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/error/struct.UnknownHrpError.html
@@ -1,4 +1,4 @@
-UnknownHrpError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

+UnknownHrpError in bdk_chain::bitcoin::address::error - Rust
bdk_chain::bitcoin::address::error
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownHrpError
§
fn clone(&self) -> UnknownHrpError
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 UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownHrpError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<UnknownHrpError> for ParseError
§
fn from(e: UnknownHrpError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for UnknownHrpError
§
fn eq(&self, other: &UnknownHrpError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownHrpError
§
impl StructuralPartialEq for UnknownHrpError
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/bitcoin/address/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
index b2086b7429..66aba1d483 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin
Module address
Expand description
Bitcoin addresses.

+bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin
Module address
Expand description
Bitcoin addresses.

 
Support for ordinary base58 Bitcoin addresses and private keys.

 
§Example: creating a new address from a randomly-generated key pair

 
use bitcoin::{Address, PublicKey, Network};
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
index 0355c8fd02..1d38ad47f8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.Address.html
@@ -1,4 +1,4 @@
-Address in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct Address
pub struct Address<V = NetworkChecked>(/* private fields */)
+Address in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct Address
pub struct Address<V = NetworkChecked>(/* private fields */)
 where
     V: NetworkValidation;
Expand description
A Bitcoin address.

 
§Parsing addresses

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
index 5e51b194b2..23c88f3675 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidBase58PayloadLengthError.html
@@ -1,4 +1,4 @@
-InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

+InvalidBase58PayloadLengthError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidBase58PayloadLengthError
pub struct InvalidBase58PayloadLengthError { /* private fields */ }
Expand description
Decoded base58 data was an invalid length.

 
Implementations§
§
impl InvalidBase58PayloadLengthError
pub fn invalid_base58_payload_length(&self) -> usize
Returns the invalid payload length.

 
Trait Implementations§
§
impl Clone for InvalidBase58PayloadLengthError
§
fn clone(&self) -> InvalidBase58PayloadLengthError
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 InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidBase58PayloadLengthError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidBase58PayloadLengthError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidBase58PayloadLengthError> for ParseError
§
fn from(e: InvalidBase58PayloadLengthError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidBase58PayloadLengthError
§
fn eq(&self, other: &InvalidBase58PayloadLengthError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidBase58PayloadLengthError
§
impl StructuralPartialEq for InvalidBase58PayloadLengthError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
index 07df7f43c3..6c6e782876 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.InvalidLegacyPrefixError.html
@@ -1,4 +1,4 @@
-InvalidLegacyPrefixError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

+InvalidLegacyPrefixError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct InvalidLegacyPrefixError
pub struct InvalidLegacyPrefixError { /* private fields */ }
Expand description
Invalid legacy address prefix in decoded base58 data.

 
Implementations§
§
impl InvalidLegacyPrefixError
pub fn invalid_legacy_address_prefix(&self) -> u8
Returns the invalid prefix.

 
Trait Implementations§
§
impl Clone for InvalidLegacyPrefixError
§
fn clone(&self) -> InvalidLegacyPrefixError
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 InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for InvalidLegacyPrefixError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for InvalidLegacyPrefixError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<InvalidLegacyPrefixError> for ParseError
§
fn from(e: InvalidLegacyPrefixError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for InvalidLegacyPrefixError
§
fn eq(&self, other: &InvalidLegacyPrefixError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for InvalidLegacyPrefixError
§
impl StructuralPartialEq for InvalidLegacyPrefixError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
index cf420f55ba..a892f99ced 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.LegacyAddressTooLongError.html
@@ -1,4 +1,4 @@
-LegacyAddressTooLongError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

+LegacyAddressTooLongError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct LegacyAddressTooLongError
pub struct LegacyAddressTooLongError { /* private fields */ }
Expand description
Legacy base58 address was too long, max 50 characters.

 
Implementations§
§
impl LegacyAddressTooLongError
pub fn invalid_legcay_address_length(&self) -> usize
Returns the invalid legacy address length.

 
Trait Implementations§
§
impl Clone for LegacyAddressTooLongError
§
fn clone(&self) -> LegacyAddressTooLongError
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 LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for LegacyAddressTooLongError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for LegacyAddressTooLongError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<LegacyAddressTooLongError> for ParseError
§
fn from(e: LegacyAddressTooLongError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for LegacyAddressTooLongError
§
fn eq(&self, other: &LegacyAddressTooLongError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for LegacyAddressTooLongError
§
impl StructuralPartialEq for LegacyAddressTooLongError
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
index c62706ac9f..739c3c5f72 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.NetworkValidationError.html
@@ -1,4 +1,4 @@
-NetworkValidationError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

+NetworkValidationError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct NetworkValidationError
pub struct NetworkValidationError { /* private fields */ }
Expand description
Address’s network differs from required one.

 
Trait Implementations§
§
impl Clone for NetworkValidationError
§
fn clone(&self) -> NetworkValidationError
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 NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for NetworkValidationError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for NetworkValidationError
1.30.0 · Source§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<NetworkValidationError> for ParseError
§
fn from(e: NetworkValidationError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for NetworkValidationError
§
fn eq(&self, other: &NetworkValidationError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for NetworkValidationError
§
impl StructuralPartialEq for NetworkValidationError
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/bitcoin/address/struct.UnknownAddressTypeError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
index 2207ba10cc..cfee711ceb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownAddressTypeError.html
@@ -1,4 +1,4 @@
-UnknownAddressTypeError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

+UnknownAddressTypeError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownAddressTypeError
#[non_exhaustive]
pub struct UnknownAddressTypeError(pub String);
Expand description
Address type is either invalid or not supported in rust-bitcoin.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownAddressTypeError
§
fn clone(&self) -> UnknownAddressTypeError
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 UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownAddressTypeError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownAddressTypeError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl PartialEq for UnknownAddressTypeError
§
fn eq(&self, other: &UnknownAddressTypeError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownAddressTypeError
§
impl StructuralPartialEq for UnknownAddressTypeError
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/bitcoin/address/struct.UnknownHrpError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
index 0a606ad0a1..9a82d97269 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/struct.UnknownHrpError.html
@@ -1,4 +1,4 @@
-UnknownHrpError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

+UnknownHrpError in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Struct UnknownHrpError
#[non_exhaustive]
pub struct UnknownHrpError(pub String);
Expand description
Unknown HRP error.

 
Tuple Fields (Non-exhaustive)§
This struct is marked as non-exhaustive
Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.
§0: String
Trait Implementations§
§
impl Clone for UnknownHrpError
§
fn clone(&self) -> UnknownHrpError
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 UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Display for UnknownHrpError
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
§
impl Error for UnknownHrpError
§
fn source(&self) -> Option<&(dyn Error + 'static)>
Returns 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
§
impl From<UnknownHrpError> for ParseError
§
fn from(e: UnknownHrpError) -> ParseError
Converts to this type from the input type.
§
impl PartialEq for UnknownHrpError
§
fn eq(&self, other: &UnknownHrpError) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
§
impl Eq for UnknownHrpError
§
impl StructuralPartialEq for UnknownHrpError
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/bitcoin/address/trait.NetworkValidation.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
index 13442afb14..ae40aef88f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/address/trait.NetworkValidation.html
@@ -1,4 +1,4 @@
-NetworkValidation in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Trait NetworkValidation
pub trait NetworkValidation:
+NetworkValidation in bdk_chain::bitcoin::address - Rust
bdk_chain::bitcoin::address
Trait NetworkValidation
pub trait NetworkValidation:
     Sized
     + NetworkValidation
     + Sync
@@ -8,4 +8,4 @@
 }
Expand description
Marker of status of address’s network validation. See section Parsing addresses
 on Address for details.

 
Required Associated Constants§
const IS_CHECKED: bool
Indicates whether this NetworkValidation is NetworkChecked or not.

-
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
+
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
index 09e0fb4064..1f485d754d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.Denomination.html
@@ -1,4 +1,4 @@
-Denomination in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum Denomination
#[non_exhaustive]
pub enum Denomination {
+Denomination in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum Denomination
#[non_exhaustive]
pub enum Denomination {
     Bitcoin,
     CentiBitcoin,
     MilliBitcoin,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
index 0f9eaeef18..7de9a3b718 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/enum.ParseAmountError.html
@@ -1,4 +1,4 @@
-ParseAmountError in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum ParseAmountError
#[non_exhaustive]
pub enum ParseAmountError {
+ParseAmountError in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Enum ParseAmountError
#[non_exhaustive]
pub enum ParseAmountError {
     OutOfRange(OutOfRangeError),
     TooPrecise(TooPreciseError),
     MissingDigits(MissingDigitsError),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
index 5d8cb44f1d..d703470933 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin
Module amount
Expand description
Bitcoin amounts.

+bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin
Module amount
Expand description
Bitcoin amounts.

 
This module mainly introduces the Amount and SignedAmount types.
 We refer to the documentation on the types for more information.

 
Modules§
serde
This module adds serde serialization and deserialization support for Amounts.
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.deserialize.html
index bb01180c64..8f9c73ea14 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.deserialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.deserialize.html
@@ -1,3 +1,3 @@
-deserialize in bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Function deserialize
pub fn deserialize<'d, A, D>(d: D) -> Result<A, <D as Deserializer<'d>>::Error>
where
+deserialize in bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Function deserialize
pub fn deserialize<'d, A, D>(d: D) -> Result<A, <D as Deserializer<'d>>::Error>
where
     A: SerdeAmount,
     D: Deserializer<'d>,

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.serialize.html
index 205c5f6bfd..8ff103a931 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.serialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/fn.serialize.html
@@ -1,4 +1,4 @@
-serialize in bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Function serialize
pub fn serialize<A, S>(
+serialize in bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Function serialize
pub fn serialize<A, S>(
     a: &A,
     s: S,
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/index.html
index 34d726a8b1..384fc450a6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde
Module as_btc
Expand description
Serialize and deserialize Amount as JSON numbers denominated in BTC.
+bdk_chain::bitcoin::amount::serde::as_btc - Rust
bdk_chain::bitcoin::amount::serde
Module as_btc
Expand description
Serialize and deserialize Amount as JSON numbers denominated in BTC.
 Use with #[serde(with = "amount::serde::as_btc")].

 
Modules§
opt
Serialize and deserialize Option<Amount> as JSON numbers denominated in BTC.
 Use with #[serde(default, with = "amount::serde::as_btc::opt")].
Functions§
deserialize
serialize

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.deserialize.html
index 7687ede6d8..b8d4a5ce57 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.deserialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.deserialize.html
@@ -1,4 +1,4 @@
-deserialize in bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc::opt
Function deserialize
pub fn deserialize<'d, A, D>(
+deserialize in bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc::opt
Function deserialize
pub fn deserialize<'d, A, D>(
     d: D,
 ) -> Result<Option<A>, <D as Deserializer<'d>>::Error>
where
     A: SerdeAmountForOpt,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.serialize.html
index 320adeb435..13236567e3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.serialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/fn.serialize.html
@@ -1,4 +1,4 @@
-serialize in bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc::opt
Function serialize
pub fn serialize<A, S>(
+serialize in bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc::opt
Function serialize
pub fn serialize<A, S>(
     a: &Option<A>,
     s: S,
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/index.html
index 3451b0a573..bc916172bc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_btc/opt/index.html
@@ -1,3 +1,3 @@
-bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Module opt
Expand description
Serialize and deserialize Option<Amount> as JSON numbers denominated in BTC.
+bdk_chain::bitcoin::amount::serde::as_btc::opt - Rust
bdk_chain::bitcoin::amount::serde::as_btc
Module opt
Expand description
Serialize and deserialize Option<Amount> as JSON numbers denominated in BTC.
 Use with #[serde(default, with = "amount::serde::as_btc::opt")].

 
Functions§
deserialize
serialize

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.deserialize.html
index d1f353a3bb..fb1db82d55 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.deserialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.deserialize.html
@@ -1,3 +1,3 @@
-deserialize in bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Function deserialize
pub fn deserialize<'d, A, D>(d: D) -> Result<A, <D as Deserializer<'d>>::Error>
where
+deserialize in bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Function deserialize
pub fn deserialize<'d, A, D>(d: D) -> Result<A, <D as Deserializer<'d>>::Error>
where
     A: SerdeAmount,
     D: Deserializer<'d>,

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.serialize.html
index f76564399f..425ee4a2ca 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.serialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/fn.serialize.html
@@ -1,4 +1,4 @@
-serialize in bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Function serialize
pub fn serialize<A, S>(
+serialize in bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Function serialize
pub fn serialize<A, S>(
     a: &A,
     s: S,
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/index.html
index 384153cd44..3e5ecb0d0d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde
Module as_sat
Expand description
Serialize and deserialize Amount as real numbers denominated in satoshi.
+bdk_chain::bitcoin::amount::serde::as_sat - Rust
bdk_chain::bitcoin::amount::serde
Module as_sat
Expand description
Serialize and deserialize Amount as real numbers denominated in satoshi.
 Use with #[serde(with = "amount::serde::as_sat")].

 
Modules§
opt
Serialize and deserialize Option<Amount> as real numbers denominated in satoshi.
 Use with #[serde(default, with = "amount::serde::as_sat::opt")].
Functions§
deserialize
serialize

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.deserialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.deserialize.html
index 0d0345ec49..6e685a11bc 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.deserialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.deserialize.html
@@ -1,4 +1,4 @@
-deserialize in bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat::opt
Function deserialize
pub fn deserialize<'d, A, D>(
+deserialize in bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat::opt
Function deserialize
pub fn deserialize<'d, A, D>(
     d: D,
 ) -> Result<Option<A>, <D as Deserializer<'d>>::Error>
where
     A: SerdeAmountForOpt,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.serialize.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.serialize.html
index 2d19ab92b5..3133f15ca7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.serialize.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/fn.serialize.html
@@ -1,4 +1,4 @@
-serialize in bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat::opt
Function serialize
pub fn serialize<A, S>(
+serialize in bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat::opt
Function serialize
pub fn serialize<A, S>(
     a: &Option<A>,
     s: S,
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/index.html
index 4f9077867e..4bae5e3339 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/as_sat/opt/index.html
@@ -1,3 +1,3 @@
-bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Module opt
Expand description
Serialize and deserialize Option<Amount> as real numbers denominated in satoshi.
+bdk_chain::bitcoin::amount::serde::as_sat::opt - Rust
bdk_chain::bitcoin::amount::serde::as_sat
Module opt
Expand description
Serialize and deserialize Option<Amount> as real numbers denominated in satoshi.
 Use with #[serde(default, with = "amount::serde::as_sat::opt")].

 
Functions§
deserialize
serialize

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/index.html
index 9e2e1db28b..cf24d939c7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/index.html
@@ -1,4 +1,4 @@
-bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount
Module serde
Expand description
This module adds serde serialization and deserialization support for Amounts.
+bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount
Module serde
Expand description
This module adds serde serialization and deserialization support for Amounts.
 Since there is not a default way to serialize and deserialize Amounts, multiple
 ways are supported and it’s up to the user to decide which serialiation to use.
 The provided modules can be used as follows:

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmount.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmount.html
index 3ba5f6fc51..dd7cebbea2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmount.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmount.html
@@ -1,4 +1,4 @@
-SerdeAmount in bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount::serde
Trait SerdeAmount
pub trait SerdeAmount: Sized + Copy {
+SerdeAmount in bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount::serde
Trait SerdeAmount
pub trait SerdeAmount: Sized + Copy {
     // Required methods
     fn ser_sat<S>(
         self,
@@ -42,4 +42,4 @@
     d: D,
     _: Token,
 ) -> Result<Self, <D as Deserializer<'d>>::Error>
where
-    D: Deserializer<'d>,
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
+    D: Deserializer<'d>,
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmountForOpt.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmountForOpt.html
index d5df167878..ad61506a64 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmountForOpt.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/serde/trait.SerdeAmountForOpt.html
@@ -1,4 +1,4 @@
-SerdeAmountForOpt in bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount::serde
Trait SerdeAmountForOpt
pub trait SerdeAmountForOpt:
+SerdeAmountForOpt in bdk_chain::bitcoin::amount::serde - Rust
bdk_chain::bitcoin::amount::serde
Trait SerdeAmountForOpt
pub trait SerdeAmountForOpt:
     Sized
     + Copy
     + SerdeAmount {
@@ -27,4 +27,4 @@
     s: S,
     _: Token,
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>
where
-    S: Serializer,
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
+    S: Serializer,
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Amount.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Amount.html
index 3f1476f461..8590712886 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Amount.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Amount.html
@@ -1,4 +1,4 @@
-Amount in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Struct Amount
pub struct Amount(/* private fields */);
Expand description
Amount

+Amount in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Struct Amount
pub struct Amount(/* private fields */);
Expand description
Amount

 
The Amount type can be used to express Bitcoin amounts that support
 arithmetic and conversion to various denominations.

 
Warning!

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Display.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Display.html
index 8f3df1382d..38bca1417b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Display.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/bitcoin/amount/struct.Display.html
@@ -1,4 +1,4 @@
-Display in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Struct Display
pub struct Display { /* private fields */ }
Expand description
A helper/builder that displays amount with specified settings.

+Display in bdk_chain::bitcoin::amount - Rust
bdk_chain::bitcoin::amount
Struct Display
pub struct Display { /* private fields */ }
Expand description
A helper/builder that displays amount with specified settings.

 
This provides richer interface than fmt::Formatter:

 
Create a partial [SyncRequest] for this wallet for all revealed spks.

 
This is the first step when performing a spk-based wallet partial sync, the returned
-SyncRequest collects all revealed script pubkeys from the wallet keychain needed to
+[SyncRequest] collects all revealed script pubkeys from the wallet keychain needed to
 start a blockchain sync with a spk based blockchain client.

-
Source
pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>
Create a `FullScanRequest for this wallet.

+
Source
pub fn start_full_scan(&self) -> FullScanRequestBuilder<KeychainKind>
Create a [`FullScanRequest] for this wallet.

 
This is the first step when performing a spk-based wallet full scan, the returned
-`FullScanRequest collects iterators for the wallet’s keychain script pub keys needed to
+[`FullScanRequest] collects iterators for the wallet’s keychain script pub keys needed to
 start a blockchain full scan with a spk based blockchain client.

 
This operation is generally only used when importing or restoring a previously used wallet
 in which the list of used scripts is not known.

-
Trait Implementations§
Source§
impl AsRef<TxGraph> for Wallet
Source§
fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>
Converts this type into a shared reference of the (usually inferred) input type.
Source§
impl Debug for Wallet
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait Implementations§
§
impl !Freeze for Wallet
§
impl !RefUnwindSafe for Wallet
§
impl Send for Wallet
§
impl Sync for Wallet
§
impl Unpin for Wallet
§
impl !UnwindSafe for Wallet
Blanket Implementations§
Source§
impl<T> Any for T
where
+
Trait Implementations§
Source§
impl AsRef<TxGraph> for Wallet
Source§
fn as_ref(&self) -> &TxGraph<ConfirmationBlockTime>
Converts this type into a shared reference of the (usually inferred) input type.
Source§
impl Debug for Wallet
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Auto Trait Implementations§
§
impl !Freeze for Wallet
§
impl !RefUnwindSafe for Wallet
§
impl Send for Wallet
§
impl Sync for Wallet
§
impl Unpin for Wallet
§
impl !UnwindSafe for Wallet
Blanket Implementations§
Source§
impl<T> Any for T
where
     T: 'static + ?Sized,
Source§
fn type_id(&self) -> TypeId
Gets the TypeId of self. Read more
Source§
impl<T> Borrow<T> for T
where
     T: ?Sized,
Source§
fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
Source§
impl<T> BorrowMut<T> for T
where
     T: ?Sized,
Source§
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§
impl<T> From<T> for T
Source§
fn from(t: T) -> T
Returns the argument unchanged.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html
index e175c8f920..64a25f84f8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/struct.WeightedUtxo.html
@@ -1,4 +1,4 @@
-WeightedUtxo in bdk_wallet - Rust
bdk_wallet
Struct WeightedUtxo
Source 
pub struct WeightedUtxo {
+WeightedUtxo in bdk_wallet - Rust
bdk_wallet
Struct WeightedUtxo
Source 
pub struct WeightedUtxo {
     pub satisfaction_weight: Weight,
     pub utxo: Utxo,
 }
Expand description
A Utxo with its satisfaction_weight.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
index 3d7173c277..d23dcb2f76 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.AsyncWalletPersister.html
@@ -1,4 +1,4 @@
-AsyncWalletPersister in bdk_wallet - Rust
bdk_wallet
Trait AsyncWalletPersister
Source 
pub trait AsyncWalletPersister {
+AsyncWalletPersister in bdk_wallet - Rust
bdk_wallet
Trait AsyncWalletPersister
Source 
pub trait AsyncWalletPersister {
     type Error;
 
     // Required methods
@@ -38,4 +38,4 @@ 
Pin<Box<dyn Future<Output = Result<(), Self::Error>> + Send + 'a>>
where
     Self: 'a,
Persist the given changeset to the persister.

 
This method can fail if the persister is not initialized.

-
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
+
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementors§

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
index 96769712fe..cb98e39377 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/trait.IsDust.html
@@ -1,4 +1,4 @@
-IsDust in bdk_wallet - Rust
bdk_wallet
Trait IsDust
Source 
pub trait IsDust {
+IsDust in bdk_wallet - Rust
bdk_wallet
Trait IsDust
Source 
pub trait IsDust {
     // Required method
     fn is_dust(&self, script: &Script) -> bool;
 }
Expand description
Trait to check if a value is below the dust limit.
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 c017d440de..3be9e2a5d5 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
@@ -1,4 +1,4 @@
-WalletPersister in bdk_wallet - Rust
bdk_wallet
Trait WalletPersister
Source 
pub trait WalletPersister {
+WalletPersister in bdk_wallet - Rust
bdk_wallet
Trait WalletPersister
Source 
pub trait WalletPersister {
     type Error;
 
     // Required methods
@@ -30,7 +30,7 @@ 
ChangeSet,
 ) -> Result<(), Self::Error>
Persist the given changeset to the persister.

 
This method can fail if the persister is not initialized.

-
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementations on Foreign Types§
Source§
impl WalletPersister for Connection
Source§
type Error = Error
Source§
fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>
Source§
fn persist(
+
Dyn Compatibility§
This trait is not dyn compatible.
In older versions of Rust, dyn compatibility was called "object safety", so this trait is not object safe.
Implementations on Foreign Types§
Source§
impl WalletPersister for Connection
Source§
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 Store<ChangeSet>
Source§
type Error = FileStoreError
Source§
fn initialize(persister: &mut Self) -> Result<ChangeSet, Self::Error>
Source§
fn persist(
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
index 21095777a6..64ceb6bfd3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddForeignUtxoError.html
@@ -1,4 +1,4 @@
-AddForeignUtxoError in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum AddForeignUtxoError
Source 
pub enum AddForeignUtxoError {
+AddForeignUtxoError in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum AddForeignUtxoError
Source 
pub enum AddForeignUtxoError {
     InvalidTxid {
         input_txid: Txid,
         foreign_utxo: OutPoint,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
index f71cd72745..58b3869546 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.AddUtxoError.html
@@ -1,4 +1,4 @@
-AddUtxoError in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum AddUtxoError
Source 
pub enum AddUtxoError {
+AddUtxoError in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum AddUtxoError
Source 
pub enum AddUtxoError {
     UnknownUtxo(OutPoint),
 }
Expand description
Error returned from TxBuilder::add_utxo and TxBuilder::add_utxos

 
Variants§
§
UnknownUtxo(OutPoint)
Happens when trying to spend an UTXO that is not in the internal database

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
index 2bc7b70aaa..f91ee5d30a 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.ChangeSpendPolicy.html
@@ -1,4 +1,4 @@
-ChangeSpendPolicy in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum ChangeSpendPolicy
Source 
pub enum ChangeSpendPolicy {
+ChangeSpendPolicy in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum ChangeSpendPolicy
Source 
pub enum ChangeSpendPolicy {
     ChangeAllowed,
     OnlyChange,
     ChangeForbidden,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
index e49698d72a..33920ff3d5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/enum.TxOrdering.html
@@ -1,4 +1,4 @@
-TxOrdering in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum TxOrdering
Source 
pub enum TxOrdering {
+TxOrdering in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Enum TxOrdering
Source 
pub enum TxOrdering {
     Shuffle,
     Untouched,
     Custom {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
index bedf2fdf72..53ebce9457 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/index.html
@@ -1,4 +1,4 @@
-bdk_wallet::tx_builder - Rust
bdk_wallet
Module tx_builder
Source 
Expand description
Transaction builder

+bdk_wallet::tx_builder - Rust
bdk_wallet
Module tx_builder
Source 
Expand description
Transaction builder

 
§Example

 
// create a TxBuilder from a wallet
 let mut tx_builder = wallet.build_tx();
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
index 778eab65ed..6caf9abfd5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/tx_builder/struct.TxBuilder.html
@@ -1,4 +1,4 @@
-TxBuilder in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Struct TxBuilder
Source 
pub struct TxBuilder<'a, Cs> { /* private fields */ }
Expand description
A transaction builder

+TxBuilder in bdk_wallet::tx_builder - Rust
bdk_wallet::tx_builder
Struct TxBuilder
Source 
pub struct TxBuilder<'a, Cs> { /* private fields */ }
Expand description
A transaction builder

 
A TxBuilder is created by calling build_tx or build_fee_bump on a wallet. After
 assigning it, you set options on it until finally calling finish to consume the builder and
 generate the transaction.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
index fb1820f8c9..85f5bb30db 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_wallet/type.WalletTx.html
@@ -1,7 +1,7 @@
-WalletTx in bdk_wallet - Rust
bdk_wallet
Type Alias WalletTx
Source 
pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
Expand description
A CanonicalTx managed by a Wallet.

+WalletTx in bdk_wallet - Rust
bdk_wallet
Type Alias WalletTx
Source 
pub type WalletTx<'a> = CanonicalTx<'a, Arc<Transaction>, ConfirmationBlockTime>;
Expand description
A CanonicalTx managed by a Wallet.

 
Aliased Type§
struct WalletTx<'a> {
-    pub chain_position: ChainPosition<ConfirmationBlockTime>,
-    pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>,
-}
Fields§
§chain_position: ChainPosition<ConfirmationBlockTime>
How the transaction is observed in the canonical chain (confirmed or unconfirmed).

-
§tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>
The transaction node (as part of the graph).

+    pub chain_position: ChainPosition<ConfirmationBlockTime>,
+    pub tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>,
+}
Fields§
§chain_position: ChainPosition<ConfirmationBlockTime>
How the transaction is observed in the canonical chain (confirmed or unconfirmed).

+
§tx_node: TxNode<'a, Arc<Transaction>, ConfirmationBlockTime>
The transaction node (as part of the graph).

 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
index c4b66f88d1..248333d59d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
index 88593435d7..7da1cdb160 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.CHANNEL_BOUND.html
@@ -1,2 +1,2 @@
-CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant CHANNEL_BOUND
Source 
pub(crate) const CHANNEL_BOUND: usize = 10;
Expand description
The mpsc channel bound for emissions from [Emitter].

+CHANNEL_BOUND in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant CHANNEL_BOUND
Source 
pub(crate) const CHANNEL_BOUND: usize = 10;
Expand description
The mpsc channel bound for emissions from [Emitter].

 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
index 134af45206..f68109447e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_COMMIT_DELAY.html
@@ -1,2 +1,2 @@
-DB_COMMIT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_COMMIT_DELAY
Source 
pub(crate) const DB_COMMIT_DELAY: Duration;
Expand description
Delay for committing to persistence.

+DB_COMMIT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_COMMIT_DELAY
Source 
pub(crate) const DB_COMMIT_DELAY: Duration;
Expand description
Delay for committing to persistence.

 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
index 656fc69087..8c62e2c988 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_rpc";

\ No newline at end of file
+DB_MAGIC in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_rpc";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
index 5d9a37051e..c14fee082c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_rpc.db";

\ No newline at end of file
+DB_PATH in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_rpc.db";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
index 3950e30d0a..dcbdb4308d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.MEMPOOL_EMIT_DELAY.html
@@ -1,2 +1,2 @@
-MEMPOOL_EMIT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant MEMPOOL_EMIT_DELAY
Source 
pub(crate) const MEMPOOL_EMIT_DELAY: Duration;
Expand description
Delay between mempool emissions.

+MEMPOOL_EMIT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant MEMPOOL_EMIT_DELAY
Source 
pub(crate) const MEMPOOL_EMIT_DELAY: Duration;
Expand description
Delay between mempool emissions.

 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
index baa10e3bf4..2245b1bfa7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/constant.STDOUT_PRINT_DELAY.html
@@ -1,2 +1,2 @@
-STDOUT_PRINT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant STDOUT_PRINT_DELAY
Source 
pub(crate) const STDOUT_PRINT_DELAY: Duration;
Expand description
Delay for printing status to stdout.

+STDOUT_PRINT_DELAY in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Constant STDOUT_PRINT_DELAY
Source 
pub(crate) const STDOUT_PRINT_DELAY: Duration;
Expand description
Delay for printing status to stdout.

 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
index 510fe34db9..4b849fdd33 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.Emission.html
@@ -1,4 +1,4 @@
-Emission in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Enum Emission
Source 
pub(crate) enum Emission {
+Emission in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Enum Emission
Source 
pub(crate) enum Emission {
     Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
     Tip(u32),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
index b3bd1eed84..ec26316968 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/enum.RpcCommands.html
@@ -1,4 +1,4 @@
-RpcCommands in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Enum RpcCommands
Source 
pub(crate) enum RpcCommands {
+RpcCommands in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Enum RpcCommands
Source 
pub(crate) enum RpcCommands {
     Sync {
         rpc_args: RpcArgs,
     },
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
index 19c9aca192..2c8698ff94 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.await_flag.html
@@ -1 +1 @@
-await_flag in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function await_flag
Source 
pub(crate) fn await_flag(flag: &AtomicBool, duration: Duration) -> bool

\ No newline at end of file
+await_flag in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function await_flag
Source 
pub(crate) fn await_flag(flag: &AtomicBool, duration: Duration) -> bool

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
index 36a2a54c05..64a72c73c5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.main.html
@@ -1 +1 @@
-main in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
+main in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
index d2080d68ad..8dc3a52431 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/fn.start_ctrlc_handler.html
@@ -1 +1 @@
-start_ctrlc_handler in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function start_ctrlc_handler
Source 
pub(crate) fn start_ctrlc_handler() -> Arc<AtomicBool>

\ No newline at end of file
+start_ctrlc_handler in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Function start_ctrlc_handler
Source 
pub(crate) fn start_ctrlc_handler() -> Arc<AtomicBool>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
index a92bd678b0..d0c39b3dcd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/index.html
@@ -1 +1 @@
-example_bitcoind_rpc_polling - Rust
Crate example_bitcoind_rpc_polling
Source 
Structs§
RpcArgs 🔒 
Enums§
Emission 🔒 
RpcCommands 🔒 
Constants§
CHANNEL_BOUND 🔒 
The mpsc channel bound for emissions from [Emitter].
DB_COMMIT_DELAY 🔒 
Delay for committing to persistence.
DB_MAGIC 🔒 
DB_PATH 🔒 
MEMPOOL_EMIT_DELAY 🔒 
Delay between mempool emissions.
STDOUT_PRINT_DELAY 🔒 
Delay for printing status to stdout.
Functions§
await_flag 🔒 
main 🔒 
start_ctrlc_handler 🔒 

\ No newline at end of file
+example_bitcoind_rpc_polling - Rust
Crate example_bitcoind_rpc_polling
Source 
Structs§
RpcArgs 🔒 
Enums§
Emission 🔒 
RpcCommands 🔒 
Constants§
CHANNEL_BOUND 🔒 
The mpsc channel bound for emissions from [Emitter].
DB_COMMIT_DELAY 🔒 
Delay for committing to persistence.
DB_MAGIC 🔒 
DB_PATH 🔒 
MEMPOOL_EMIT_DELAY 🔒 
Delay between mempool emissions.
STDOUT_PRINT_DELAY 🔒 
Delay for printing status to stdout.
Functions§
await_flag 🔒 
main 🔒 
start_ctrlc_handler 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
index 4ff1248048..f849b3ea59 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_bitcoind_rpc_polling/struct.RpcArgs.html
@@ -1,4 +1,4 @@
-RpcArgs in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Struct RpcArgs
Source 
pub(crate) struct RpcArgs {
+RpcArgs in example_bitcoind_rpc_polling - Rust
example_bitcoind_rpc_polling
Struct RpcArgs
Source 
pub(crate) struct RpcArgs {
     pub(crate) url: String,
     pub(crate) rpc_cookie: Option<PathBuf>,
     pub(crate) rpc_user: Option<String>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
index 3990219c45..f7e9de6959 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Functions
Type Aliases

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Functions
Type Aliases

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
index c503eab3eb..3c40dcf332 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.AddressCmd.html
@@ -1,4 +1,4 @@
-AddressCmd in example_cli - Rust
example_cli
Enum AddressCmd
Source 
pub enum AddressCmd {
+AddressCmd in example_cli - Rust
example_cli
Enum AddressCmd
Source 
pub enum AddressCmd {
     Next,
     New,
     List {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
index c40fbae03f..4bf8930b6c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.CoinSelectionAlgo.html
@@ -1,4 +1,4 @@
-CoinSelectionAlgo in example_cli - Rust
example_cli
Enum CoinSelectionAlgo
Source 
pub enum CoinSelectionAlgo {
+CoinSelectionAlgo in example_cli - Rust
example_cli
Enum CoinSelectionAlgo
Source 
pub enum CoinSelectionAlgo {
     LargestFirst,
     SmallestFirst,
     OldestFirst,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
index a3d953d375..716c3d0664 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Commands.html
@@ -1,4 +1,4 @@
-Commands in example_cli - Rust
example_cli
Enum Commands
Source 
pub enum Commands<CS: Subcommand, S: Args> {
+Commands in example_cli - Rust
example_cli
Enum Commands
Source 
pub enum Commands<CS: Subcommand, S: Args> {
     Init {
         network: Network,
         descriptor: String,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
index 9e99e0d6aa..550f856a24 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.Keychain.html
@@ -1,4 +1,4 @@
-Keychain in example_cli - Rust
example_cli
Enum Keychain
Source 
pub enum Keychain {
+Keychain in example_cli - Rust
example_cli
Enum Keychain
Source 
pub enum Keychain {
     External,
     Internal,
 }
Variants§
§
External
§
Internal
Trait Implementations§
Source§
impl Clone for Keychain
Source§
fn clone(&self) -> Keychain
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
Source§
impl Debug for Keychain
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Source§
impl<'de> Deserialize<'de> for Keychain
Source§
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
index ac2a8c845d..e1050bb743 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.PsbtCmd.html
@@ -1,4 +1,4 @@
-PsbtCmd in example_cli - Rust
example_cli
Enum PsbtCmd
Source 
pub enum PsbtCmd<S: Args> {
+PsbtCmd in example_cli - Rust
example_cli
Enum PsbtCmd
Source 
pub enum PsbtCmd<S: Args> {
     New {
         value: u64,
         address: Address<NetworkUnchecked>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
index 5aec2fadb6..615192fe71 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/enum.TxOutCmd.html
@@ -1,4 +1,4 @@
-TxOutCmd in example_cli - Rust
example_cli
Enum TxOutCmd
Source 
pub enum TxOutCmd {
+TxOutCmd in example_cli - Rust
example_cli
Enum TxOutCmd
Source 
pub enum TxOutCmd {
     List {
         spent: bool,
         unspent: bool,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
index bab35373c1..5f7aad7388 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.create_tx.html
@@ -1,4 +1,4 @@
-create_tx in example_cli - Rust
example_cli
Function create_tx
Source 
pub fn create_tx<O: ChainOracle>(
+create_tx in example_cli - Rust
example_cli
Function create_tx
Source 
pub fn create_tx<O: ChainOracle>(
     graph: &mut KeychainTxGraph,
     chain: &O,
     assets: &Assets,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
index 50eee1eb5a..a67957ea45 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.handle_commands.html
@@ -1,4 +1,4 @@
-handle_commands in example_cli - Rust
example_cli
Function handle_commands
Source 
pub fn handle_commands<CS: Subcommand, S: Args>(
+handle_commands in example_cli - Rust
example_cli
Function handle_commands
Source 
pub fn handle_commands<CS: Subcommand, S: Args>(
     graph: &Mutex<KeychainTxGraph>,
     chain: &Mutex<LocalChain>,
     db: &Mutex<Store<ChangeSet>>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
index 01be03f191..c88b9fb240 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.init_or_load.html
@@ -1,4 +1,4 @@
-init_or_load in example_cli - Rust
example_cli
Function init_or_load
Source 
pub fn init_or_load<CS: Subcommand, S: Args>(
+init_or_load in example_cli - Rust
example_cli
Function init_or_load
Source 
pub fn init_or_load<CS: Subcommand, S: Args>(
     db_magic: &[u8],
     db_path: &str,
 ) -> Result<Option<Init<CS, S>>>
Expand description
Loads from persistence or creates new

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
index 29e2766b25..1347ef8851 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/fn.planned_utxos.html
@@ -1,4 +1,4 @@
-planned_utxos in example_cli - Rust
example_cli
Function planned_utxos
Source 
pub fn planned_utxos<O: ChainOracle>(
+planned_utxos in example_cli - Rust
example_cli
Function planned_utxos
Source 
pub fn planned_utxos<O: ChainOracle>(
     graph: &KeychainTxGraph,
     chain: &O,
     assets: &Assets,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
index a197838d72..95af94fdd7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/index.html
@@ -1 +1 @@
-example_cli - Rust
Crate example_cli
Source 
Re-exports§
pub use anyhow;
pub use clap;
Structs§
Args
ChangeInfo
ChangeSet
ChangeSet
Init
The initial state returned by init_or_load.
Enums§
AddressCmd
CoinSelectionAlgo
Commands
Keychain
PsbtCmd
TxOutCmd
Functions§
create_tx
handle_commands
init_or_load
Loads from persistence or creates new
planned_utxos
Type Aliases§
KeychainTxGraph
Alias for a IndexedTxGraph with specific Anchor and Indexer.
PlanUtxo

\ No newline at end of file
+example_cli - Rust
Crate example_cli
Source 
Re-exports§
pub use anyhow;
pub use clap;
Structs§
Args
ChangeInfo
ChangeSet
ChangeSet
Init
The initial state returned by init_or_load.
Enums§
AddressCmd
CoinSelectionAlgo
Commands
Keychain
PsbtCmd
TxOutCmd
Functions§
create_tx
handle_commands
init_or_load
Loads from persistence or creates new
planned_utxos
Type Aliases§
KeychainTxGraph
Alias for a IndexedTxGraph with specific Anchor and Indexer.
PlanUtxo

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
index 0760bc8149..a6bd753af8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Args.html
@@ -1,4 +1,4 @@
-Args in example_cli - Rust
example_cli
Struct Args
Source 
pub struct Args<CS: Subcommand, S: Args> {
+Args in example_cli - Rust
example_cli
Struct Args
Source 
pub struct Args<CS: Subcommand, S: Args> {
     pub command: Commands<CS, S>,
 }
Fields§
§command: Commands<CS, S>
Trait Implementations§
Source§
impl<CS: Subcommand, S: Args> Args for Args<CS, S>
Source§
fn group_id() -> Option<Id>
Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
Source§
fn augment_args<'b>(__clap_app: Command) -> Command
Append to [Command] so it can instantiate Self via
 [FromArgMatches::from_arg_matches_mut] Read more
Source§
fn augment_args_for_update<'b>(__clap_app: Command) -> Command
Append to [Command] so it can instantiate self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
index 00422d13d9..277909b446 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeInfo.html
@@ -1,4 +1,4 @@
-ChangeInfo in example_cli - Rust
example_cli
Struct ChangeInfo
Source 
pub struct ChangeInfo {
+ChangeInfo in example_cli - Rust
example_cli
Struct ChangeInfo
Source 
pub struct ChangeInfo {
     pub change_keychain: Keychain,
     pub indexer: ChangeSet,
     pub index: u32,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
index e19f3e9bfc..b957d3b74f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.ChangeSet.html
@@ -1,19 +1,19 @@
-ChangeSet in example_cli - Rust
example_cli
Struct ChangeSet
Source 
pub struct ChangeSet {
+ChangeSet in example_cli - Rust
example_cli
Struct ChangeSet
Source 
pub struct ChangeSet {
     pub descriptor: Option<Descriptor<DescriptorPublicKey>>,
     pub change_descriptor: Option<Descriptor<DescriptorPublicKey>>,
     pub network: Option<Network>,
     pub local_chain: ChangeSet,
-    pub tx_graph: ChangeSet<ConfirmationBlockTime>,
+    pub tx_graph: ChangeSet<ConfirmationBlockTime>,
     pub indexer: ChangeSet,
 }
Expand description
ChangeSet

 
Fields§
§descriptor: Option<Descriptor<DescriptorPublicKey>>
Descriptor for recipient addresses.

 
§change_descriptor: Option<Descriptor<DescriptorPublicKey>>
Descriptor for change addresses.

 
§network: Option<Network>
Stores the network type of the transaction data.

 
§local_chain: ChangeSet
Changes to the [LocalChain].

-
§tx_graph: ChangeSet<ConfirmationBlockTime>
Changes to TxGraph.

+
§tx_graph: ChangeSet<ConfirmationBlockTime>
Changes to TxGraph.

 
§indexer: ChangeSet
Changes to [KeychainTxOutIndex].

 
Trait Implementations§
Source§
impl Clone for ChangeSet
Source§
fn clone(&self) -> ChangeSet
Returns a copy of the value. Read more
1.0.0 · Source§
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
Source§
impl Debug for ChangeSet
Source§
fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
Source§
impl Default for ChangeSet
Source§
fn default() -> ChangeSet
Returns the “default value” for a type. Read more
Source§
impl<'de> Deserialize<'de> for ChangeSet
Source§
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where
-    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§
impl Merge for ChangeSet
Source§
fn merge(&mut self, other: Self)
Merge another object of the same type onto self.
Source§
fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
Source§
fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
Source§
impl PartialEq for ChangeSet
Source§
fn eq(&self, other: &ChangeSet) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
+    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§
impl Merge for ChangeSet
Source§
fn merge(&mut self, other: Self)
Merge another object of the same type onto self.
Source§
fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
§
fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
Source§
impl PartialEq for ChangeSet
Source§
fn eq(&self, other: &ChangeSet) -> bool
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,
 and should not be overridden without very good reason.
Source§
impl Serialize for ChangeSet
Source§
fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where
     __S: Serializer,
Serialize this value into the given Serde serializer. Read more
Source§
impl StructuralPartialEq for ChangeSet
Auto Trait Implementations§
Blanket Implementations§
Source§
impl<T> Any for T
where
     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/example_cli/struct.Init.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
index 086bc2c30e..39b694ec37 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/struct.Init.html
@@ -1,4 +1,4 @@
-Init in example_cli - Rust
example_cli
Struct Init
Source 
pub struct Init<CS: Subcommand, S: Args> {
+Init in example_cli - Rust
example_cli
Struct Init
Source 
pub struct Init<CS: Subcommand, S: Args> {
     pub args: Args<CS, S>,
     pub graph: Mutex<KeychainTxGraph>,
     pub chain: Mutex<LocalChain>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
index 9edabf8c86..a6ff5e12ff 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.KeychainTxGraph.html
@@ -1,4 +1,4 @@
-KeychainTxGraph in example_cli - Rust
example_cli
Type Alias KeychainTxGraph
Source 
pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
Expand description
Alias for a IndexedTxGraph with specific Anchor and Indexer.

+KeychainTxGraph in example_cli - Rust
example_cli
Type Alias KeychainTxGraph
Source 
pub type KeychainTxGraph = IndexedTxGraph<ConfirmationBlockTime, KeychainTxOutIndex<Keychain>>;
Expand description
Alias for a IndexedTxGraph with specific Anchor and Indexer.

 
Aliased Type§
struct KeychainTxGraph {
     pub index: KeychainTxOutIndex<Keychain>,
     /* private fields */
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
index b35395040f..1f2ece0f03 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_cli/type.PlanUtxo.html
@@ -1 +1 @@
-PlanUtxo in example_cli - Rust
example_cli
Type Alias PlanUtxo
Source 
pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);

\ No newline at end of file
+PlanUtxo in example_cli - Rust
example_cli
Type Alias PlanUtxo
Source 
pub type PlanUtxo = (Plan, FullTxOut<ConfirmationBlockTime>);

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
index 2bfed72316..43d0d7c72d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
index 23f07e2315..a713aabcf0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_electrum - Rust
example_electrum
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_electrum";

\ No newline at end of file
+DB_MAGIC in example_electrum - Rust
example_electrum
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_electrum";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
index 2d28870a3e..e58414d5c8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_electrum - Rust
example_electrum
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_electrum.db";

\ No newline at end of file
+DB_PATH in example_electrum - Rust
example_electrum
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_electrum.db";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
index c1a4fbae51..0645d185ec 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/enum.ElectrumCommands.html
@@ -1,4 +1,4 @@
-ElectrumCommands in example_electrum - Rust
example_electrum
Enum ElectrumCommands
Source 
pub(crate) enum ElectrumCommands {
+ElectrumCommands in example_electrum - Rust
example_electrum
Enum ElectrumCommands
Source 
pub(crate) enum ElectrumCommands {
     Scan {
         stop_gap: usize,
         scan_options: ScanOptions,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
index 0588e44e4a..83ef0ae389 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/fn.main.html
@@ -1 +1 @@
-main in example_electrum - Rust
example_electrum
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
+main in example_electrum - Rust
example_electrum
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
index f4931dfbfa..f92b84332f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/index.html
@@ -1 +1 @@
-example_electrum - Rust
Crate example_electrum
Source 
Structs§
ElectrumArgs
ScanOptions
Enums§
ElectrumCommands 🔒 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_electrum - Rust
Crate example_electrum
Source 
Structs§
ElectrumArgs
ScanOptions
Enums§
ElectrumCommands 🔒 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
index 54222f61db..c7da920843 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ElectrumArgs.html
@@ -1,4 +1,4 @@
-ElectrumArgs in example_electrum - Rust
example_electrum
Struct ElectrumArgs
Source 
pub struct ElectrumArgs {
+ElectrumArgs in example_electrum - Rust
example_electrum
Struct ElectrumArgs
Source 
pub struct ElectrumArgs {
     pub(crate) electrum_url: Option<String>,
 }
Fields§
§electrum_url: Option<String>
The electrum url to use to connect to. If not provided it will use a default electrum server
 for your chosen network.

diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
index 7d3b08d2df..c8488d0a17 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_electrum/struct.ScanOptions.html
@@ -1,4 +1,4 @@
-ScanOptions in example_electrum - Rust
example_electrum
Struct ScanOptions
Source 
pub struct ScanOptions {
+ScanOptions in example_electrum - Rust
example_electrum
Struct ScanOptions
Source 
pub struct ScanOptions {
     pub batch_size: usize,
 }
Fields§
§batch_size: usize
Set batch size for each script_history call to electrum client.

 
Trait Implementations§
Source§
impl Args for ScanOptions
Source§
fn group_id() -> Option<Id>
Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
Source§
fn augment_args<'b>(__clap_app: Command) -> Command
Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
index 6f8d2cf4f2..be186a8e23 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
index f830e684f2..0475654b30 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_esplora - Rust
example_esplora
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_esplora";

\ No newline at end of file
+DB_MAGIC in example_esplora - Rust
example_esplora
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &[u8] = b"bdk_example_esplora";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
index 3e1fd7e882..40b7e86541 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_esplora - Rust
example_esplora
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_esplora.db";

\ No newline at end of file
+DB_PATH in example_esplora - Rust
example_esplora
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = ".bdk_example_esplora.db";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
index f5124b819c..7369470a20 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/enum.EsploraCommands.html
@@ -1,4 +1,4 @@
-EsploraCommands in example_esplora - Rust
example_esplora
Enum EsploraCommands
Source 
pub(crate) enum EsploraCommands {
+EsploraCommands in example_esplora - Rust
example_esplora
Enum EsploraCommands
Source 
pub(crate) enum EsploraCommands {
     Scan {
         stop_gap: usize,
         scan_options: ScanOptions,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
index b76fb31147..9cbdac0465 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/fn.main.html
@@ -1 +1 @@
-main in example_esplora - Rust
example_esplora
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
+main in example_esplora - Rust
example_esplora
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
index 1ede19e5fb..99c51d9c1e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/index.html
@@ -1 +1 @@
-example_esplora - Rust
Crate example_esplora
Source 
Structs§
EsploraArgs
ScanOptions
Enums§
EsploraCommands 🔒 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_esplora - Rust
Crate example_esplora
Source 
Structs§
EsploraArgs
ScanOptions
Enums§
EsploraCommands 🔒 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
index a933bd6d7c..d12155fdb2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.EsploraArgs.html
@@ -1,4 +1,4 @@
-EsploraArgs in example_esplora - Rust
example_esplora
Struct EsploraArgs
Source 
pub struct EsploraArgs {
+EsploraArgs in example_esplora - Rust
example_esplora
Struct EsploraArgs
Source 
pub struct EsploraArgs {
     pub(crate) esplora_url: Option<String>,
 }
Fields§
§esplora_url: Option<String>
The esplora url endpoint to connect to.

 
Implementations§
Source§
impl EsploraArgs
Source
pub fn client(&self, network: Network) -> Result<BlockingClient>
Trait Implementations§
Source§
impl Args for EsploraArgs
Source§
fn group_id() -> Option<Id>
Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
Source§
fn augment_args<'b>(__clap_app: Command) -> Command
Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
index d9593f8551..9dc6c2ef00 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_esplora/struct.ScanOptions.html
@@ -1,4 +1,4 @@
-ScanOptions in example_esplora - Rust
example_esplora
Struct ScanOptions
Source 
pub struct ScanOptions {
+ScanOptions in example_esplora - Rust
example_esplora
Struct ScanOptions
Source 
pub struct ScanOptions {
     pub parallel_requests: usize,
 }
Fields§
§parallel_requests: usize
Max number of concurrent esplora server requests.

 
Trait Implementations§
Source§
impl Args for ScanOptions
Source§
fn group_id() -> Option<Id>
Report the [ArgGroup::id][crate::ArgGroup::id] for this set of arguments
Source§
fn augment_args<'b>(__clap_app: Command) -> Command
Append to [Command] so it can instantiate Self via
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
index 9186d01a91..0c220e7235 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
index 2acc0e54d2..a89cccbc1e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.BATCH_SIZE.html
@@ -1 +1 @@
-BATCH_SIZE in example_wallet_electrum - Rust
example_wallet_electrum
Constant BATCH_SIZE
Source 
pub(crate) const BATCH_SIZE: usize = 5;

\ No newline at end of file
+BATCH_SIZE in example_wallet_electrum - Rust
example_wallet_electrum
Constant BATCH_SIZE
Source 
pub(crate) const BATCH_SIZE: usize = 5;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
index d84c587d8f..c21f941910 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_electrum - Rust
example_wallet_electrum
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk_wallet_electrum_example";

\ No newline at end of file
+DB_MAGIC in example_wallet_electrum - Rust
example_wallet_electrum
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk_wallet_electrum_example";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
index d99c95a8d5..c0b6afe1b1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.ELECTRUM_URL.html
@@ -1 +1 @@
-ELECTRUM_URL in example_wallet_electrum - Rust
example_wallet_electrum
Constant ELECTRUM_URL
Source 
pub(crate) const ELECTRUM_URL: &str = "ssl://electrum.blockstream.info:60002";

\ No newline at end of file
+ELECTRUM_URL in example_wallet_electrum - Rust
example_wallet_electrum
Constant ELECTRUM_URL
Source 
pub(crate) const ELECTRUM_URL: &str = "ssl://electrum.blockstream.info:60002";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
index 0257821b32..a58230cca5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_electrum - Rust
example_wallet_electrum
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
+EXTERNAL_DESC in example_wallet_electrum - Rust
example_wallet_electrum
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
index 120d578822..ebd6b88838 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_electrum - Rust
example_wallet_electrum
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
+INTERNAL_DESC in example_wallet_electrum - Rust
example_wallet_electrum
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
index 8b488b6269..60004d55f0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_electrum - Rust
example_wallet_electrum
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
+NETWORK in example_wallet_electrum - Rust
example_wallet_electrum
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
index c8cdf61a0b..35266b719e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_electrum - Rust
example_wallet_electrum
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
+SEND_AMOUNT in example_wallet_electrum - Rust
example_wallet_electrum
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
index 2ec49e6f73..ad942052d6 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_electrum - Rust
example_wallet_electrum
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 50;

\ No newline at end of file
+STOP_GAP in example_wallet_electrum - Rust
example_wallet_electrum
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 50;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
index 88b4ecf280..58cd9c7793 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/fn.main.html
@@ -1 +1 @@
-main in example_wallet_electrum - Rust
example_wallet_electrum
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
+main in example_wallet_electrum - Rust
example_wallet_electrum
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
index 01de29e0bd..c87528a570 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_electrum/index.html
@@ -1 +1 @@
-example_wallet_electrum - Rust
Crate example_wallet_electrum
Source 
Constants§
BATCH_SIZE 🔒 
DB_MAGIC 🔒 
ELECTRUM_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_wallet_electrum - Rust
Crate example_wallet_electrum
Source 
Constants§
BATCH_SIZE 🔒 
DB_MAGIC 🔒 
ELECTRUM_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
index 9f2d20e4cb..d193ca6c3f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
index 5f4d892c40..5e7885a5d5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = "bdk-example-esplora-async.sqlite";

\ No newline at end of file
+DB_PATH in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = "bdk-example-esplora-async.sqlite";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
index 213c238c01..0b2ea732b3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.ESPLORA_URL.html
@@ -1 +1 @@
-ESPLORA_URL in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant ESPLORA_URL
Source 
pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";

\ No newline at end of file
+ESPLORA_URL in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant ESPLORA_URL
Source 
pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
index bb6132082f..49adad6b1b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
+EXTERNAL_DESC in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
index bcb18457c4..1bb481d80e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
+INTERNAL_DESC in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
index 91a5fdbbf5..528477747c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
+NETWORK in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
index 31b473d807..bb011ebcc8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.PARALLEL_REQUESTS.html
@@ -1 +1 @@
-PARALLEL_REQUESTS in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant PARALLEL_REQUESTS
Source 
pub(crate) const PARALLEL_REQUESTS: usize = 5;

\ No newline at end of file
+PARALLEL_REQUESTS in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant PARALLEL_REQUESTS
Source 
pub(crate) const PARALLEL_REQUESTS: usize = 5;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
index b3c6f85b1f..783cec7b9b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
+SEND_AMOUNT in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
index 603e462dc7..19839e4ed1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 5;

\ No newline at end of file
+STOP_GAP in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 5;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
index 433adf36df..3d086e78ba 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/fn.main.html
@@ -1 +1 @@
-main in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
+main in example_wallet_esplora_async - Rust
example_wallet_esplora_async
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
index c3c8f68e2d..942963d065 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_async/index.html
@@ -1 +1 @@
-example_wallet_esplora_async - Rust
Crate example_wallet_esplora_async
Source 
Constants§
DB_PATH 🔒 
ESPLORA_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
PARALLEL_REQUESTS 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_wallet_esplora_async - Rust
Crate example_wallet_esplora_async
Source 
Constants§
DB_PATH 🔒 
ESPLORA_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
PARALLEL_REQUESTS 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
index 7f2755a17d..597ddbcba4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
index 0a6d6a8c4d..e5650ec654 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk_wallet_esplora_example";

\ No newline at end of file
+DB_MAGIC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk_wallet_esplora_example";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
index ddc97c6509..d923f828cb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.DB_PATH.html
@@ -1 +1 @@
-DB_PATH in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = "bdk-example-esplora-blocking.db";

\ No newline at end of file
+DB_PATH in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant DB_PATH
Source 
pub(crate) const DB_PATH: &str = "bdk-example-esplora-blocking.db";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
index 45b7644645..3c6b4998c0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.ESPLORA_URL.html
@@ -1 +1 @@
-ESPLORA_URL in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant ESPLORA_URL
Source 
pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";

\ No newline at end of file
+ESPLORA_URL in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant ESPLORA_URL
Source 
pub(crate) const ESPLORA_URL: &str = "http://signet.bitcoindevkit.net";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
index d86c795739..8ec7f5ddb9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.EXTERNAL_DESC.html
@@ -1 +1 @@
-EXTERNAL_DESC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
+EXTERNAL_DESC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant EXTERNAL_DESC
Source 
pub(crate) const EXTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/0/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
index 97d66a50ea..ae468fad11 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.INTERNAL_DESC.html
@@ -1 +1 @@
-INTERNAL_DESC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
+INTERNAL_DESC in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant INTERNAL_DESC
Source 
pub(crate) const INTERNAL_DESC: &str = "wpkh(tprv8ZgxMBicQKsPdy6LMhUtFHAgpocR8GC6QmwMSFpZs7h6Eziw3SpThFfczTDh5rW2krkqffa11UpX3XkeTTB2FvzZKWXqPY54Y6Rq4AQ5R8L/84'/1'/0'/1/*)";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
index f7c7a914e9..bc381c5b28 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.NETWORK.html
@@ -1 +1 @@
-NETWORK in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
+NETWORK in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant NETWORK
Source 
pub(crate) const NETWORK: Network;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
index 6a1d9b7e13..00ff92c792 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.PARALLEL_REQUESTS.html
@@ -1 +1 @@
-PARALLEL_REQUESTS in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant PARALLEL_REQUESTS
Source 
pub(crate) const PARALLEL_REQUESTS: usize = 5;

\ No newline at end of file
+PARALLEL_REQUESTS in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant PARALLEL_REQUESTS
Source 
pub(crate) const PARALLEL_REQUESTS: usize = 5;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
index 888e33b767..ea31801458 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.SEND_AMOUNT.html
@@ -1 +1 @@
-SEND_AMOUNT in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
+SEND_AMOUNT in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant SEND_AMOUNT
Source 
pub(crate) const SEND_AMOUNT: Amount;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
index 69072bc110..501d2e79d1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/constant.STOP_GAP.html
@@ -1 +1 @@
-STOP_GAP in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 5;

\ No newline at end of file
+STOP_GAP in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Constant STOP_GAP
Source 
pub(crate) const STOP_GAP: usize = 5;

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
index 90a383852b..4f6dde56c8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/fn.main.html
@@ -1 +1 @@
-main in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
+main in example_wallet_esplora_blocking - Rust
example_wallet_esplora_blocking
Function main
Source 
pub(crate) fn main() -> Result<(), Error>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
index ee9741a5e4..c1df869b29 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_esplora_blocking/index.html
@@ -1 +1 @@
-example_wallet_esplora_blocking - Rust
Crate example_wallet_esplora_blocking
Source 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
ESPLORA_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
PARALLEL_REQUESTS 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_wallet_esplora_blocking - Rust
Crate example_wallet_esplora_blocking
Source 
Constants§
DB_MAGIC 🔒 
DB_PATH 🔒 
ESPLORA_URL 🔒 
EXTERNAL_DESC 🔒 
INTERNAL_DESC 🔒 
NETWORK 🔒 
PARALLEL_REQUESTS 🔒 
SEND_AMOUNT 🔒 
STOP_GAP 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
index b76dcac71b..9d9420ce36 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/all.html
@@ -1 +1 @@
-List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
+List of all items in this crate
List of all items
Structs
Enums
Functions
Constants

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
index 3dfb452e2e..50d268cc9f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/constant.DB_MAGIC.html
@@ -1 +1 @@
-DB_MAGIC in example_wallet_rpc - Rust
example_wallet_rpc
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk-rpc-wallet-example";

\ No newline at end of file
+DB_MAGIC in example_wallet_rpc - Rust
example_wallet_rpc
Constant DB_MAGIC
Source 
pub(crate) const DB_MAGIC: &str = "bdk-rpc-wallet-example";

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
index 24cbd53901..3a79df1e5c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/enum.Emission.html
@@ -1,4 +1,4 @@
-Emission in example_wallet_rpc - Rust
example_wallet_rpc
Enum Emission
Source 
pub(crate) enum Emission {
+Emission in example_wallet_rpc - Rust
example_wallet_rpc
Enum Emission
Source 
pub(crate) enum Emission {
     SigTerm,
     Block(BlockEvent<Block>),
     Mempool(Vec<(Transaction, u64)>),
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
index e458ad1133..65c6c73d12 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/fn.main.html
@@ -1 +1 @@
-main in example_wallet_rpc - Rust
example_wallet_rpc
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
+main in example_wallet_rpc - Rust
example_wallet_rpc
Function main
Source 
pub(crate) fn main() -> Result<()>

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
index de0ee20bf3..b4c59c87de 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/index.html
@@ -1 +1 @@
-example_wallet_rpc - Rust
Crate example_wallet_rpc
Source 
Structs§
Args
Bitcoind RPC example using bdk_wallet::Wallet.
Enums§
Emission 🔒 
Constants§
DB_MAGIC 🔒 
Functions§
main 🔒 

\ No newline at end of file
+example_wallet_rpc - Rust
Crate example_wallet_rpc
Source 
Structs§
Args
Bitcoind RPC example using bdk_wallet::Wallet.
Enums§
Emission 🔒 
Constants§
DB_MAGIC 🔒 
Functions§
main 🔒 

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
index d45704c019..0d54bdaf43 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/example_wallet_rpc/struct.Args.html
@@ -1,4 +1,4 @@
-Args in example_wallet_rpc - Rust
example_wallet_rpc
Struct Args
Source 
pub struct Args {
+Args in example_wallet_rpc - Rust
example_wallet_rpc
Struct Args
Source 
pub struct Args {
     pub descriptor: String,
     pub change_descriptor: String,
     pub start_height: u32,
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 1c04e563a4..40f04253e7 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/search.desc/bdk_wallet/bdk_wallet-desc-0-.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_wallet/bdk_wallet-desc-0-.js
index 136ea210f0..c28c9cfdd7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_wallet/bdk_wallet-desc-0-.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_wallet/bdk_wallet-desc-0-.js
@@ -1 +1 @@
-searchState.loadedDescShard("bdk_wallet", 0, "        BDK Wallet\nError returned from TxBuilder::add_foreign_utxo.\nError returned from TxBuilder::add_utxo and …\nA derived address and the index it was found at. For …\nAn error that may occur when applying a block to Wallet.\nAsync trait that persists PersistedWallet.\nBalance, differentiated into various categories.\nOccurs when the update chain cannot connect with original …\nUse both change and non-change outputs (default)\nOnly use non-change outputs (see …\nA changeset for Wallet.\nPolicy regarding the use of change outputs when creating a …\nParameters for Wallet::create or PersistedWallet::create.\nError type for PersistedWallet::create.\nProvide custom comparison functions for sorting\nPersister already has wallet data.\nOccurs when the loaded changeset cannot construct Wallet.\nThere was a problem with the passed-in descriptor(s).\nDescriptor’s DescriptorId does not match.\nError type of the persister.\nError type of the persister.\nExternal keychain, used for deriving recipient addresses.\nError for bdk_file_store’s implementation of …\nA UTXO owned by another wallet.\nGenesis hash does not match.\nInternal keychain, used for deriving change addresses.\nOccurs when the loaded changeset cannot construct Wallet.\nRequested outpoint doesn’t exist in the tx (vout greater …\nForeign utxo outpoint txid does not match PSBT input txid\nTrait to check if a value is below the dust limit. We are …\nTypes of keychains\nError when loading from the store.\nThe error type when loading a Wallet from a ChangeSet.\nRepresents a mismatch with what is loaded and what is …\nParameters for Wallet::load or PersistedWallet::load.\nError type for PersistedWallet::load.\nA UTXO owned by the local wallet.\nAn unspent output owned by a Wallet.\nData loaded is unexpected.\nData loaded from persistence is missing descriptor.\nData loaded from persistence is missing genesis hash.\nData loaded from persistence is missing network type.\nForeign utxo missing witness_utxo or non_witness_utxo\nNetwork does not match.\nOnly use change outputs (see TxBuilder::only_spend_change)\nError from persistence.\nError from persistence.\nRepresents a persisted wallet which persists into type P.\nRandomized (default)\nOptions for a software signer\nA transaction builder\nOrdering of the transaction’s inputs and outputs\nOccurs when the connected_to hash does not match the hash …\nHappens when trying to spend an UTXO that is not in the …\nUnchanged\nAn update to Wallet.\nAn unspent transaction output (UTXO).\nSchema name for wallet.\nName of table to store wallet descriptors and network.\nA Bitcoin wallet\nTrait that persists PersistedWallet.\nA CanonicalTx managed by a Wallet.\nA Utxo with its satisfaction_weight.\nError when writing to the store.\nAdd data as an output, using OP_RETURN\nAdd a foreign UTXO i.e. a UTXO not owned by this wallet.\nSame as add_foreign_utxo but allows to set the nSequence …\nFill-in the PSBT_GLOBAL_XPUB field with the extended keys …\nAdd a recipient to the internal list\nAdd an external signer\nAdd a utxo to the internal list of unspendable utxos\nAdd a utxo to the internal list of utxos that must be spent\nAdd the list of outpoints to the internal list of UTXOs …\nAddress\nGet unbounded script pubkey iterators for both Internal …\nWhether the signer should use the sighash_type set in the …\nSet whether or not the dust limit is checked.\nWhether we should grind ECDSA signature to ensure signing …\nIntroduces a block of height to the wallet, and tries to …\nApplies relevant transactions from block of height to the …\nApply relevant unconfirmed transactions to the wallet.\nApplies an update to the wallet and stages the changes …\nApplies an update alongside a seen_at timestamp and stages …\nReturn KeychainKind as a byte\nWhether the wallet should assume a specific height has …\nReturn the balance, separated into available, …\nBump the fee of a transaction previously created with this …\nStart building a transaction.\nCalculates the fee of a given transaction. Returns …\nCalculate the FeeRate for a given transaction.\nInforms the wallet that you no longer intend to broadcast …\nUpdate for the wallet’s internal LocalChain.\nHow the transaction is observed in the canonical chain …\nThe position of the output in the blockchain.\nDescriptor for change addresses.\nSet a specific ChangeSpendPolicy. See …\nChecks that the given genesis_hash matches the one loaded …\nChecks that the given network matches the one loaded from …\nGet all the checkpoints the wallet is currently storing …\nCoin selection\nChoose the coin selection algorithm\nConfirmed and immediately spendable balance\nCreate a new PersistedWallet with the given persister and …\nBuild a new Wallet.\nCreate a new PersistedWallet with the given async persister…\nBuild a new single descriptor Wallet.\nCreate PersistedWallet with the given WalletPersister.\nCreate PersistedWallet with the given AsyncWalletPersister.\nCreate Wallet without persistence.\nCreate a new Wallet with given params.\nSet the current blockchain height.\nThe derivation index of this wallet. It will return None …\nThe derivation index for the script pubkey in the wallet\nFinds how the wallet derived the script pubkey spk.\nDescriptors\nChecks the expected_descriptor matches exactly what is …\nDescriptor for recipient addresses.\nMacro to write full descriptors with code\nReturn the checksum of the public descriptor associated to …\nDo not spend change outputs\nSets the address to drain excess coins to.\nSpend all the available inputs. This respects filters like …\nErrors that can be thrown by the Wallet\nWallet export\nWhether to try extracting private keys from the provided …\nSet an absolute fee The fee_absolute method refers to the …\nSet a custom fee rate.\nFinalize a PSBT, i.e., for each input determine if …\nFinish building the transaction.\nFinish building the transaction.\nMacro to write descriptor fragments with code\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nRecover a ChangeSet from sqlite database.\nUse a custom genesis_hash.\nget the corresponding PSBT Input for a LocalUtxo\nGet the signers\nGet a single transaction from the wallet as a WalletTx (if …\nReturns the utxo owned by this wallet corresponding to …\nAll coinbase outputs not yet matured\nFill-in the psbt::Output::redeem_script and …\nChild index of this address\nChanges to KeychainTxOutIndex.\nInitialize sqlite tables for wallet tables.\nInitialize the persister and load all data.\nInitialize the persister and load all data.\nInserts a TxOut at OutPoint into the wallet’s …\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCheck whether or not a value is below dust limit\nReturn whether or not a script is part of this wallet …\nWhether this UTXO is spent or not\nType of keychain\nType of keychain\nIterator over all keychains in this wallet\nExtend the given keychain’s keymap.\nExtend the given keychain’s keymap.\nKey formats\nContains the last active derivation indices per keychain (K…\nReturns the latest checkpoint.\nList all relevant outputs (includes both spent and …\nReturn the list of unspent outputs of this wallet\nList addresses that are revealed but unused.\nLoad a previously PersistedWallet from the given persister …\nBuild Wallet by loading from persistence or ChangeSet.\nLoad a previously PersistedWallet from the given async …\nLoad PersistedWallet with the given WalletPersister.\nLoad PersistedWallet with the given AsyncWalletPersister.\nLoad Wallet without persistence.\nLoad Wallet from the given previously persisted ChangeSet …\nGet a reference to the inner LocalChain.\nChanges to the LocalChain.\nUse a custom lookahead value.\nUse a custom lookahead value.\nOnly spend utxos added by add_utxo.\nMarks an address used of the given keychain at index.\nMerge another ChangeSet into itself.\nSet network.\nGet the Bitcoin network the wallet is using.\nStores the network type of the transaction data.\nConstruct parameters with provided descriptor and …\nConstruct parameters with default values.\nConstruct parameters with provided descriptor.\nThe index of the next address that you would get if you …\nGet the next unused address for the given keychain, i.e. …\nUse a specific nLockTime while creating the transaction\nOnly spend change outputs\nOnly Fill-in the psbt::Input::witness_utxo field when …\nChoose the ordering for inputs and outputs of the …\nGet the location of the UTXO\nReference to a transaction output\nPeek an address of the given keychain at index without …\nPersist the given changeset to the persister.\nPersist the given changeset to the persister.\nPersist staged changes of wallet into persister.\nPersist staged changes of wallet into an async persister.\nPersist ChangeSet to sqlite database.\nReturn the spending policies for the wallet’s descriptor\nSet the policy path to use while creating the transaction …\nAdditional functions on the rust-bitcoin Psbt structure.\nReturns the descriptor used to create addresses for a …\nReveal addresses up to and including the target index and …\nAttempt to reveal the next address of the given keychain.\nSupport for persisting bdk_chain structures to SQLite …\nThe weight of the witness data and scriptSig expressed in …\nGet v0 sqlite ChangeSet schema\nReturn the secp256k1 context used for all signing …\nCompute the tx’s sent and received Amounts.\nGet the sequence number if an explicit sequence number has …\nSet an exact nSequence value\nSet the keymap for a given keychain.\nSet the keymap for each keychain.\nReplace the recipients already added with a new list\nSign with a specific sig hash\nSign a transaction with all the wallet’s signers, in the …\nWhether we should try to sign a taproot transaction with …\nGeneralized signers\nSort transaction inputs and outputs by TxOrdering variant.\nSort transaction inputs and outputs by TxOrdering variant.\nGet a reference to the inner KeychainTxOutIndex.\nGet a reference of the staged ChangeSet that is yet to be …\nGet a mutable reference of the staged ChangeSet that is …\nCreate a `FullScanRequest for this wallet.\nCreate a partial SyncRequest for this wallet for all …\nTake the staged ChangeSet to be persisted now (if any).\nSpecifies which Taproot script-spend leaves we should sign …\nGet the whole balance visible to the wallet.\nIterate over relevant and canonical transactions in the …\nArray of relevant and canonical transactions in the wallet …\nWhether the signer should trust the witness_utxo, if the …\nUnconfirmed UTXOs generated by a wallet tx\nGet sum of trusted_pending and confirmed coins.\nWhether to try finalizing the PSBT after the inputs are …\nTransaction builder\nGet a reference to the inner TxGraph.\nChanges to TxGraph.\nThe transaction node (as part of the graph).\nUpdate for the wallet’s internal TxGraph.\nGet the TxOut of the UTXO\nTransaction output\nGet an unbounded script pubkey iterator for the given …\nUndoes the effect of mark_used and returns whether the …\nReplace the internal list of unspendable utxos with a new …\nUnconfirmed UTXOs received from an external wallet\nThe UTXO\nGet the version of bdk_wallet at runtime.\nBuild a transaction with a specific version\nDeterministically generate a unique name given the …\nForeign UTXO outpoint\nPSBT input txid\nBlock hash of connected_to.\nExpected block hash of connected_to, as derived from block.\nThe expected network.\nThe expected genesis hash.\nThe expected descriptor.\nKeychain identifying the descriptor.\nThe network that is loaded.\nThe genesis hash that is loaded.\nThe loaded descriptor.\nTransaction inputs sort function\nTransaction outputs sort function\nThe location of the output.\nThe information about the input we require to add it to a …\nThe nSequence value to set for this input.\nBranch and bound coin selection\nIt’s possible to create spendable output from excess …\nTrait for generalized coin selection algorithms\nResult of a successful coin selection\nDefault coin selection algorithm used by TxBuilder if not …\nRemaining amount after performing coin selection\nWallet’s UTXO set is not enough to cover recipient’s …\nSimple and dumb coin selection\nIt’s not possible to create spendable output from excess …\nOldestFirstCoinSelection always picks the utxo with the …\nPull UTXOs at random until we have enough to meet the …\nAmount available for spending\nPerform the coin selection\nDecide if change can be created\nRemaining amount after deducing fees and outgoing outputs\nTotal fee amount for the selected utxos\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nThe total value of the inputs selected from the local …\nAmount needed for the transaction\nCreate new instance with a target size_of_change and …\nList of outputs selected for use as inputs\nThe total value of the inputs selected.\nEffective amount available to create change after …\nThe calculated fee for the drain TxOut with the selected …\nThreshold to consider amount as dust for this particular …\nThe deducted change output fee\nExceeding amount of current selection over outgoing value …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nAlias for a Descriptor that contains extended derived keys\nScript descriptor\nThe descriptor pubkey, either a single pubkey or an xpub.\nAlias for a Descriptor that can contain extended keys …\nTrait implemented on Descriptors to add a method to …\nThe 0 combinator.\nAlias for the type of maps that represent derivation paths …\nTrait for types which can be converted into an …\nThe consensus key associated with the type. Must be a …\nLegacy ScriptContext To be used as P2SH scripts For …\nThe top-level miniscript abstract syntax tree (AST).\nMultiple extended public keys.\nPay-to-PubKey-Hash\nPay-to-PubKey-Hash\nPay-to-PubKey-Hash\nThe ScriptContext for Miniscript. Additional type …\nSegwitv0 ScriptContext\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nSingle public key.\nThe 1 combinator.\nAlias for the type of maps that represent taproot key …\nPay-to-Taproot\nPay-to-Taproot\nPay-to-Taproot\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-ScriptHash with Segwitv0 context\nPay-to-Witness-ScriptHash with Segwitv0 context\nPay-to-Witness-ScriptHash with Segwitv0 context\nExtended public key (xpub).\nComputes the Bitcoin address of the descriptor, if one …\nGet a reference to the inner AstElem representing the root …\nReplaces any wildcard (i.e. /*) in the key with a …\nReplaces all wildcards (i.e. /*) in the descriptor with a …\nEnumerates all child nodes of the current AST node (self) …\nAttempt to produce a non-malleable witness template given …\nAttempt to produce a malleable witness template given the …\nDepending on script Context, some of the Terminals might …\nDepending on script Context, some of the Terminals might …\nDepending on script Context, some of the script resource …\nDepending on script Context, some of the script resource …\nCheck the consensus + policy(if not disabled) rules that …\nCheck the consensus + policy(if not disabled) rules that …\nConsensus rules at the Miniscript satisfaction time. It is …\nConsensus rules at the Miniscript satisfaction time. It is …\nPolicy rules at the Miniscript satisfaction time. It is …\nPolicy rules at the Miniscript satisfaction time. It is …\nCheck the consensus + policy(if not disabled) rules …\nCheck the consensus + policy(if not disabled) rules …\nEach context has slightly different rules on what Pks are …\nDepending on ScriptContext, fragments can be malleable. …\nCheck whether the given satisfaction is valid under the …\nCheck whether the given satisfaction is valid under the …\nDescriptor checksum\nWhether the given miniscript contains a raw pkh fragment\nDeprecated name for Self::at_derivation_index.\nDeprecated name for Self::at_derivation_index.\nConvert all the public keys in the descriptor to …\nConvert all the public keys in the descriptor to …\nGet the DescriptorType of Descriptor\nEncode as a Bitcoin script\nDescriptor errors\nComputes the the underlying script before any hashing is …\nAdditional information helpful for extra analysis.\nCheck whether the miniscript follows the given Extra …\nExtract the spending policy\nUtility method for deriving the descriptor at each index …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nAdd type information(Type and Extdata) to Miniscript based …\nCreate a new Miniscript from a Terminal node and a Type …\nParse a Miniscript from string and perform sanity checks …\nAttempt to parse an Miniscripts that don’t follow the …\nAttempt to parse an insane(scripts don’t clear sanity …\nParse an expression tree into a descriptor.\nParse an expression tree into a Miniscript. As a general …\nFull path, from the master key\nReturns a vector containing the full derivation paths from …\nReturns child node with given index, if any\nReturns Option::Some with cloned n’th public key from …\nReturns satisfying non-malleable witness and scriptSig to …\nReturns a possilbly mallable satisfying non-malleable …\nWhether the miniscript contains a combination of timelocks\nWhether the miniscript has repeated Pk or Pkh\nWhether or not the key has a wildcard\nWhether or not the descriptor has any wildcards i.e. /*.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nExtracts the AstElem representing the root of the …\nGet as many descriptors as different paths in this …\nGet as many keys as derivation paths in this key.\nConvert to wallet descriptor\nWhether or not the key has a wildcard\nWhether or not the descriptor has any wildcards\nWhether or not this key has multiple derivation paths.\nWhether this descriptor contains a key that has multiple …\nWhether the miniscript is malleable\nCreates a new Iter iterator that will iterate over all …\nCreates a new PkIter iterator that will iterate over all …\nLifting corresponds to conversion of a miniscript into a …\nThe fingerprint of the master key associated with this …\nDepending on script context, the size of a satifaction …\nMaximum size, in bytes, of a satisfying witness. For …\nComputes an upper bound on the weight of a satisfying …\nMaximum number of witness elements used to satisfy the …\nComputes an upper bound on the difference between a …\nLocal helper function to display error messages with …\nCreate a new bare descriptor from witness script Errors …\nCreate a new pk descriptor\nCreate a new PkH descriptor\nCreate a new sh for a given redeem script Errors when …\nCreate a new sh sortedmulti descriptor with threshold k …\nCreate a new sh wrapper for the given wpkh descriptor\nCreate a new sh wrapper for the given wsh descriptor\nCreate a new sh wrapped wpkh from Pk. Errors when …\nCreate a new sh wrapped wsh descriptor with witness script …\nCreate a new sh wrapped wsh sortedmulti descriptor from …\nCreate new tr descriptor Errors when miniscript exceeds …\nCreate a new Wpkh descriptor Will return Err if …\nCreate a new wsh descriptor from witness script Errors …\nCreate a new wsh sorted multi descriptor Errors when …\nA node in the AST.\nOther top level checks that are context specific\nOther top level checks that are context specific\nAttempt to parse a Script into Miniscript representation.\nParse a descriptor that may contain secret keys\nAttempt to parse an insane(scripts don’t clear sanity …\nAttempt to parse an miniscript with extra features that …\nGet the len of public key when serialized based on context …\nReturns a plan if the provided assets are sufficient to …\nReturns a plan if the provided assets are sufficient to …\nDescriptor policy\nWhether all spend paths of miniscript require a signature\nChecks whether the descriptor is safe.\nCheck whether the underlying Miniscript is safe under the …\nAttempts to produce a non-malleable satisfying witness and …\nAttempt to produce non-malleable satisfying witness for the\nAttempt to produce a malleable satisfying witness for the …\nComputes the scriptCode of a transaction output.\nComputes the scriptpubkey of the descriptor.\nSize, in bytes of the script-pubkey. If this Miniscript is …\nThe type of signature required for satisfaction\nSubstitutes raw public keys hashes with the public keys as …\nDescriptor templates\nSerialize a descriptor to string with its secret keys\nCheck top level consensus rules.\nCheck top level consensus rules.\nCheck whether the top-level is type B\nCheck whether the top-level is type B\nConverts a descriptor using abstract keys to one using …\nTranslates a struct from one generic to another where the …\nThe correctness and malleability type information for the …\nComputes the scriptSig that will be in place for an …\nWhether the miniscript can exceed the resource …\nCompute the checksum of a descriptor, excludes any …\nError during base58 decoding\nBIP32 error\nErrors related to the parsing and usage of descriptors\nThe provided wallet descriptors are identical\nThe descriptor contains hardened derivation steps on …\nHex decoding error\nInvalid byte found in the descriptor checksum\nThe provided descriptor doesn’t match its checksum\nInvalid HD Key path, such as having a wildcard but a …\nError thrown while working with keys\nMiniscript error\nThe descriptor contains multipath keys\nKey-related error\nError while extracting and manipulating policies\nReturns the argument unchanged.\nCalls U::from(self).\nAbsolute timeclock timestamp\nCan not add to an item that is Satisfaction::None or …\nCan not add to an item that is …\nOptions to build the satisfaction field in the policy\nCan satisfy the policy item\nAn extra condition that must be satisfied but that is out …\nType for a map of sets of Condition items keyed by each set…\nECDSA Signature for a raw public key\nAn extended key fingerprint\nType for a map of folded sets of Condition items keyed by …\nSHA256 then RIPEMD160 preimage hash\nDouble SHA256 preimage hash\nIncompatible conditions (not currently used)\nIndex out of range for an item to satisfy a …\nCan not merge CSV or timelock values unless both are less …\nMulti-signature public keys with threshold count\nCannot satisfy or contribute to the policy item\nDon’t generate satisfaction field\nNot enough items are selected to satisfy a …\nOnly a partial satisfaction of some kind of threshold …\nCan reach the threshold of some kind of threshold policy\nA unique identifier for a key\nDescriptor spending policy\nErrors that can happen while extracting and manipulating …\nAnalyze the given PSBT to check for existing signatures\nLike Psbt variant and also check for expired timelocks\nA legacy public key\nRelative timelock locktime\nRIPEMD160 preimage hash\nRepresent if and how much a policy item is satisfied by …\nAn item that needs to be satisfied\nSchnorr Signature for a raw public key\nSHA256 preimage hash\nThreshold items with threshold count\nA x-only public key\nHow the wallet’s descriptor can satisfy this policy node\nOptional CheckSequenceVerify condition\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturn the conditions that are set by the spending policy …\nReturns a unique id for the SatisfiableItem\nIdentifier for this policy node\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nReturns whether the SatisfiableItem is a leaf item\nReturns whether the Satisfaction is a leaf item\nReturns true if there are no extra conditions to verify\nType of this policy node\nReturn whether or not a specific path in the policy tree …\nHow much a given PSBT already satisfies this policy node …\nOptional timelock condition\nCurrent blockchain height\nThe highest confirmation height between the inputs CSV …\nGiven PSBT\nExtra conditions that also need to be satisfied\nExtra conditions that also need to be satisfied\nExtra conditions that also need to be satisfied\nThe items that can be satisfied by the descriptor or are …\nThe items that can be satisfied by the descriptor\nThreshold\nThreshold\nTotal number of items\nTotal number of items\nWhether the items are sorted in lexicographic order (used …\nWhether the items are sorted in lexicographic order (used …\nThe digest value\nThe digest value\nThe digest value\nThe digest value\nThe policy items\nThe raw public key or extended key fingerprint\nThe required threshold count\nThe required threshold count\nThe timelock value\nThe timelock value\nBIP44 template. Expands to pkh(key/44'/{0,1}'/0'/{0,1}/*)\nBIP44 public template. Expands to pkh(key/{0,1}/*)\nBIP49 template. Expands to …\nBIP49 public template. Expands to sh(wpkh(key/{0,1}/*))\nBIP84 template. Expands to wpkh(key/84'/{0,1}'/0'/{0,1}/*)\nBIP84 public template. Expands to wpkh(key/{0,1}/*)\nBIP86 template. Expands to tr(key/86'/{0,1}'/0'/{0,1}/*)\nBIP86 public template. Expands to tr(key/{0,1}/*)\nTrait for descriptor templates that can be built into a …\nType alias for the return type of DescriptorTemplate, …\nP2PKH template. Expands to a descriptor pkh(key)\nP2TR template. Expands to a descriptor tr(key)\nP2WPKH template. Expands to a descriptor wpkh(key)\nP2WPKH-P2SH template. Expands to a descriptor sh(wpkh(key))\nBuild the complete descriptor\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nError returned from Wallet::build_fee_bump\nThere was an error with coin selection\nDescriptor key conversion error\nError returned from TxBuilder::finish\nThere was a problem with the descriptors passed in\nWhen bumping a tx the fee rate requested is lower than …\nNode doesn’t have data to estimate a fee rate\nWhen bumping a tx the absolute fee requested is lower than …\nTrying to replace a tx that has a sequence >= 0xFFFFFFFE\nRequested LockTime is less than is required to spend from …\nMiniscript PSBT error\nErrors returned by miniscript when updating inconsistent …\nIn order to use the TxBuilder::add_global_xpubs option …\nMissing non_witness_utxo on foreign utxo for given OutPoint\nCannot build a tx without recipients\nmanually_selected_only option is selected but no utxo has …\nOutput created is under the dust limit, 546 satoshis\nReturn error type for …\nThere was a problem while extracting and manipulating …\nPartially signed bitcoin transaction error\nCannot enable RBF with Sequence given a required OP_CSV\nSpending policy is not compatible with this KeychainKind\nHappens when trying to bump a transaction that is already …\nThrown when a tx is not found in the internal database\nHappens when trying to spend an UTXO that is not in the …\nHappens when trying to spend an UTXO that is not in the …\nReturn error type for PsbtExt::update_input_with_descriptor\nRequested invalid transaction version ‘0’\nRequested transaction version 1, but at least 2 is needed …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nRequired OP_CSV Sequence\nRequested LockTime\nRequired LockTime\nRequired fee absolute value Amount\nRequired fee rate\nGiven RBF Sequence\nStructure that contains the export of a wallet\nAlias for FullyNodedExport\nEarliest block to rescan when looking for the wallet’s …\nEarliest block to rescan when looking for the wallet’s …\nReturn the internal descriptor, if present\nReturn the external descriptor\nExport a wallet\nReturns the argument unchanged.\nCalls U::from(self).\nArbitrary label for the wallet\nArbitrary label for the wallet\nBIP32 error\nTrait for keys that can be derived.\nContainer for public or secret keys\nThe descriptor pubkey, either a single pubkey or an xpub.\nThe descriptor secret key, either a single private key or …\nType specifying the amount of entropy required e.g. [u8;32]\nReturned error in case of failure\nTrait that adds extra useful methods to ScriptContexts\nEnum for extended keys that can be either xprv or xpub\nA bitcoin public key (compressed or uncompressed).\nTrait that allows generating a key with the default options\nTrait for keys that can be generated\nOutput of a GeneratableKey key generation\nTrait for objects that can be turned into a public or …\nThe key has an invalid checksum\nThe key is not valid for the given network\nThe key cannot exist in the given script context\nThe consensus key associated with the type. Must be a …\nErrors thrown while working with keys\nAlias type for a map of public key to secret key\nLegacy scripts\nCustom error message\nMiniscript error\nMultiple extended private keys.\nMultiple extended public keys.\nExtra options required by the generate_with_entropy\nA private extended key, aka an xprv\nOptions for generating a PrivateKey\nA public extended key, aka an xpub\nThe ScriptContext for Miniscript. Additional type …\nEnum representation of the known valid ScriptContexts\nSegwitv0 scripts\nSingle public key.\nSingle private key.\nA descriptor bitcoin::PrivateKey with optional origin …\nA descriptor SinglePubKey with optional origin information.\nSingle public key without any origin or range information.\nContents of a “sortedmulti” descriptor\nTaproot scripts\nSet of valid networks for a key\nAn xonly public key.\nExtended private key (xpriv).\nExtended public key (xpub).\nCreate a set containing mainnet, testnet, signet, and …\nReturns the ScriptContext as a ScriptContextEnum\nAttempt to produce a witness template given the assets …\nEach context has slightly different rules on what Pks are …\nDepending on ScriptContext, fragments can be malleable. …\nWhether the generated key should be “compressed” or not\nEncode as a Bitcoin script\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCreate an instance given a public key and a set of valid …\nCreate an instance given a secret key and a set of valid …\nParse an expression tree into a SortedMultiVec\nGenerate a key given the options with random entropy.\nGenerate a key with the default options and a random …\nGenerate a key with the default options and a random …\nGenerate a key given the options with random entropy.\nGenerate a key given the extra options and the entropy\nGenerate a key with the default options and a given entropy\nReturn whether or not the key contains the private data\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nTurn the key into a DescriptorKey within the requested …\nConsume self and turn it into a DescriptorKey by adding …\nConsume self and turn it into an ExtendedKey\nConsumes self and returns the key\nGet as many keys as derivation paths in this key.\nTransform the ExtendedKey into an Xpriv for the given …\nTransform the ExtendedKey into an Xpub for the given …\nReturns whether the script context is Legacy\nReturns whether the script context is …\nWhether or not this key has multiple derivation paths.\nReturns whether the script context is Segwitv0\nReturns whether the script context is …\nReturns whether the script context is Tap, aka Taproot or …\nReturns whether the script context is …\nThe threshold value for the multisig.\nThe public key.\nThe private key.\nCreate a set only containing mainnet\nDepending on script context, the size of a satifaction …\nMaximum size, in bytes, of a satisfying witness. In …\nMaximum number of witness elements used to satisfy the …\nCompute the intersection of two sets\nThe number of keys in the multisig.\nLocal helper function to display error messages with …\nCreate a new instance of SortedMultiVec given a list of …\nOrigin information (fingerprint and derivation path).\nOrigin information (fingerprint and derivation path).\nOverride the computed set of valid networks\nGet the len of public key when serialized based on context …\nAccessor for the public keys in the multisig.\nutility function to sanity a sorted multi vec\nAttempt to produce a satisfying witness for the witness …\nSize, in bytes of the script-pubkey. If this Miniscript is …\nThe type of signature required for satisfaction\nCreate Terminal::Multi containing sorted pubkeys\nCreate a set containing testnet and regtest\nReturns the public version of this key.\nThis will panic if fpk returns an uncompressed key when …\nTrait to add functions to extract utxos and calculate fees.\nThe total transaction fee amount, sum of input amounts …\nThe transaction’s fee rate. This value will only be …\nGet the TxOut for the specified input index, if it doesn’…\nTable name for schemas.\nRuns logic that initializes/migrates the table schemas.\nThe signer will sign all the leaves it has a key for.\nDummy identifier\nThe signer won’t sign the specified leaves.\nTo be used only by external libraries implementing …\nThe fingerprint of a BIP32 extended key\nThe signer won’t sign leaves other than the ones …\nInput index is out of range\nPSBT Input signer\nThe private key in use has the right fingerprint but …\nThe non_witness_utxo specified is invalid\nInvalid SIGHASH for the signing context in use\nLegacy context\nMiniscript PSBT error\nThe fingerprint and derivation path are missing from the …\nThe private key is missing for the required public key\nThe non_witness_utxo field of the transaction is required …\nThe witness_script field of the transaction is required to …\nThe witness_utxo field of the transaction is required to …\nThe psbt contains a non-SIGHASH_ALL sighash in one of its …\nThe signer won’t sign any leaf.\nBitcoin HASH160 (RIPEMD160 after SHA256) hash of an ECDSA …\nPSBT sign error.\nSegwit v0 context (BIP 143)\nError while computing the hash to sign a Taproot input.\nOptions for a software signer\nCommon signer methods\nSigning context\nSigning error\nIdentifier of a signer in the SignersContainers. Used as a …\nDefines the order in which signers are called\nWrapper to pair a signer with its context\nContainer for multiple signers\nTaproot context (BIP 340)\nCustomize which taproot script-path leaves the signer …\nPSBT signer\nThe user canceled the operation\nAdds an external signer to the container for the specified …\nWhether the signer should use the sighash_type set in the …\nWhether we should grind ECDSA signature to ensure signing …\nCreate a map of public keys to secret keys\nWhether the wallet should assume a specific height has …\nBuild a new signer container from a KeyMap\nReturn the secret key for the signer\nReturn the secret key for the signer\nFinds the signer with lowest ordering for a given id in …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturn the SignerId for this signer\nReturns the list of identifiers of all the signers in the …\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCreate a wrapped signer from a signer and a context\nDefault constructor\nRemoves a signer from the container and returns it\nSign a single psbt input\nSign all the inputs of the psbt\nWhether we should try to sign a taproot transaction with …\nReturns the list of signers in the container, sorted by …\nSpecifies which Taproot script-spend leaves we should sign …\nWhether the signer should trust the witness_utxo, if the …\nWhether to try finalizing the PSBT after the inputs are …\nWhether the signer can sign for the internal key or not\nError returned from TxBuilder::add_foreign_utxo.\nError returned from TxBuilder::add_utxo and …\nUse both change and non-change outputs (default)\nOnly use non-change outputs (see …\nPolicy regarding the use of change outputs when creating a …\nProvide custom comparison functions for sorting\nRequested outpoint doesn’t exist in the tx (vout greater …\nForeign utxo outpoint txid does not match PSBT input txid\nForeign utxo missing witness_utxo or non_witness_utxo\nOnly use change outputs (see TxBuilder::only_spend_change)\nRandomized (default)\nA transaction builder\nOrdering of the transaction’s inputs and outputs\nHappens when trying to spend an UTXO that is not in the …\nUnchanged\nForeign UTXO outpoint\nPSBT input txid\nTransaction inputs sort function\nTransaction outputs sort function")
\ No newline at end of file
+searchState.loadedDescShard("bdk_wallet", 0, "        BDK Wallet\nError returned from TxBuilder::add_foreign_utxo.\nError returned from TxBuilder::add_utxo and …\nA derived address and the index it was found at. For …\nAn error that may occur when applying a block to Wallet.\nAsync trait that persists PersistedWallet.\nBalance, differentiated into various categories.\nOccurs when the update chain cannot connect with original …\nUse both change and non-change outputs (default)\nOnly use non-change outputs (see …\nA changeset for Wallet.\nPolicy regarding the use of change outputs when creating a …\nParameters for Wallet::create or PersistedWallet::create.\nError type for PersistedWallet::create.\nProvide custom comparison functions for sorting\nPersister already has wallet data.\nOccurs when the loaded changeset cannot construct Wallet.\nThere was a problem with the passed-in descriptor(s).\nDescriptor’s DescriptorId does not match.\nError type of the persister.\nError type of the persister.\nExternal keychain, used for deriving recipient addresses.\nError for bdk_file_store’s implementation of …\nA UTXO owned by another wallet.\nGenesis hash does not match.\nInternal keychain, used for deriving change addresses.\nOccurs when the loaded changeset cannot construct Wallet.\nRequested outpoint doesn’t exist in the tx (vout greater …\nForeign utxo outpoint txid does not match PSBT input txid\nTrait to check if a value is below the dust limit. We are …\nTypes of keychains\nError when loading from the store.\nThe error type when loading a Wallet from a ChangeSet.\nRepresents a mismatch with what is loaded and what is …\nParameters for Wallet::load or PersistedWallet::load.\nError type for PersistedWallet::load.\nA UTXO owned by the local wallet.\nAn unspent output owned by a Wallet.\nData loaded is unexpected.\nData loaded from persistence is missing descriptor.\nData loaded from persistence is missing genesis hash.\nData loaded from persistence is missing network type.\nForeign utxo missing witness_utxo or non_witness_utxo\nNetwork does not match.\nOnly use change outputs (see TxBuilder::only_spend_change)\nError from persistence.\nError from persistence.\nRepresents a persisted wallet which persists into type P.\nRandomized (default)\nOptions for a software signer\nA transaction builder\nOrdering of the transaction’s inputs and outputs\nOccurs when the connected_to hash does not match the hash …\nHappens when trying to spend an UTXO that is not in the …\nUnchanged\nAn update to Wallet.\nAn unspent transaction output (UTXO).\nSchema name for wallet.\nName of table to store wallet descriptors and network.\nA Bitcoin wallet\nTrait that persists PersistedWallet.\nA CanonicalTx managed by a Wallet.\nA Utxo with its satisfaction_weight.\nError when writing to the store.\nAdd data as an output, using OP_RETURN\nAdd a foreign UTXO i.e. a UTXO not owned by this wallet.\nSame as add_foreign_utxo but allows to set the nSequence …\nFill-in the PSBT_GLOBAL_XPUB field with the extended keys …\nAdd a recipient to the internal list\nAdd an external signer\nAdd a utxo to the internal list of unspendable utxos\nAdd a utxo to the internal list of utxos that must be spent\nAdd the list of outpoints to the internal list of UTXOs …\nAddress\nGet unbounded script pubkey iterators for both Internal …\nWhether the signer should use the sighash_type set in the …\nSet whether or not the dust limit is checked.\nWhether we should grind ECDSA signature to ensure signing …\nIntroduces a block of height to the wallet, and tries to …\nApplies relevant transactions from block of height to the …\nApply relevant unconfirmed transactions to the wallet.\nApplies an update to the wallet and stages the changes …\nApplies an update alongside a seen_at timestamp and stages …\nReturn KeychainKind as a byte\nWhether the wallet should assume a specific height has …\nReturn the balance, separated into available, …\nBump the fee of a transaction previously created with this …\nStart building a transaction.\nCalculates the fee of a given transaction. Returns …\nCalculate the FeeRate for a given transaction.\nInforms the wallet that you no longer intend to broadcast …\nUpdate for the wallet’s internal LocalChain.\nHow the transaction is observed in the canonical chain …\nThe position of the output in the blockchain.\nDescriptor for change addresses.\nSet a specific ChangeSpendPolicy. See …\nChecks that the given genesis_hash matches the one loaded …\nChecks that the given network matches the one loaded from …\nGet all the checkpoints the wallet is currently storing …\nCoin selection\nChoose the coin selection algorithm\nConfirmed and immediately spendable balance\nCreate a new PersistedWallet with the given persister and …\nBuild a new Wallet.\nCreate a new PersistedWallet with the given async persister…\nBuild a new single descriptor Wallet.\nCreate PersistedWallet with the given WalletPersister.\nCreate PersistedWallet with the given AsyncWalletPersister.\nCreate Wallet without persistence.\nCreate a new Wallet with given params.\nSet the current blockchain height.\nThe derivation index of this wallet. It will return None …\nThe derivation index for the script pubkey in the wallet\nFinds how the wallet derived the script pubkey spk.\nDescriptors\nChecks the expected_descriptor matches exactly what is …\nDescriptor for recipient addresses.\nMacro to write full descriptors with code\nReturn the checksum of the public descriptor associated to …\nDo not spend change outputs\nSets the address to drain excess coins to.\nSpend all the available inputs. This respects filters like …\nErrors that can be thrown by the Wallet\nWallet export\nWhether to try extracting private keys from the provided …\nSet an absolute fee The fee_absolute method refers to the …\nSet a custom fee rate.\nFinalize a PSBT, i.e., for each input determine if …\nFinish building the transaction.\nFinish building the transaction.\nMacro to write descriptor fragments with code\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nRecover a ChangeSet from sqlite database.\nUse a custom genesis_hash.\nget the corresponding PSBT Input for a LocalUtxo\nGet the signers\nGet a single transaction from the wallet as a WalletTx (if …\nReturns the utxo owned by this wallet corresponding to …\nAll coinbase outputs not yet matured\nFill-in the psbt::Output::redeem_script and …\nChild index of this address\nChanges to KeychainTxOutIndex.\nInitialize sqlite tables for wallet tables.\nInitialize the persister and load all data.\nInitialize the persister and load all data.\nInserts a TxOut at OutPoint into the wallet’s …\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCheck whether or not a value is below dust limit\nReturn whether or not a script is part of this wallet …\nWhether this UTXO is spent or not\nType of keychain\nType of keychain\nIterator over all keychains in this wallet\nExtend the given keychain’s keymap.\nExtend the given keychain’s keymap.\nKey formats\nContains the last active derivation indices per keychain (K…\nReturns the latest checkpoint.\nList all relevant outputs (includes both spent and …\nReturn the list of unspent outputs of this wallet\nList addresses that are revealed but unused.\nLoad a previously PersistedWallet from the given persister …\nBuild Wallet by loading from persistence or ChangeSet.\nLoad a previously PersistedWallet from the given async …\nLoad PersistedWallet with the given WalletPersister.\nLoad PersistedWallet with the given AsyncWalletPersister.\nLoad Wallet without persistence.\nLoad Wallet from the given previously persisted ChangeSet …\nGet a reference to the inner LocalChain.\nChanges to the LocalChain.\nUse a custom lookahead value.\nUse a custom lookahead value.\nOnly spend utxos added by add_utxo.\nMarks an address used of the given keychain at index.\nMerge another ChangeSet into itself.\nSet network.\nGet the Bitcoin network the wallet is using.\nStores the network type of the transaction data.\nConstruct parameters with provided descriptor and …\nConstruct parameters with default values.\nConstruct parameters with provided descriptor.\nThe index of the next address that you would get if you …\nGet the next unused address for the given keychain, i.e. …\nUse a specific nLockTime while creating the transaction\nOnly spend change outputs\nOnly Fill-in the psbt::Input::witness_utxo field when …\nChoose the ordering for inputs and outputs of the …\nGet the location of the UTXO\nReference to a transaction output\nPeek an address of the given keychain at index without …\nPersist the given changeset to the persister.\nPersist the given changeset to the persister.\nPersist staged changes of wallet into persister.\nPersist staged changes of wallet into an async persister.\nPersist ChangeSet to sqlite database.\nReturn the spending policies for the wallet’s descriptor\nSet the policy path to use while creating the transaction …\nAdditional functions on the rust-bitcoin Psbt structure.\nReturns the descriptor used to create addresses for a …\nReveal addresses up to and including the target index and …\nAttempt to reveal the next address of the given keychain.\nSupport for persisting bdk_chain structures to SQLite …\nThe weight of the witness data and scriptSig expressed in …\nGet v0 sqlite ChangeSet schema\nReturn the secp256k1 context used for all signing …\nCompute the tx’s sent and received Amounts.\nGet the sequence number if an explicit sequence number has …\nSet an exact nSequence value\nSet the keymap for a given keychain.\nSet the keymap for each keychain.\nReplace the recipients already added with a new list\nSign with a specific sig hash\nSign a transaction with all the wallet’s signers, in the …\nWhether we should try to sign a taproot transaction with …\nGeneralized signers\nSort transaction inputs and outputs by TxOrdering variant.\nSort transaction inputs and outputs by TxOrdering variant.\nGet a reference to the inner KeychainTxOutIndex.\nGet a reference of the staged ChangeSet that is yet to be …\nGet a mutable reference of the staged ChangeSet that is …\nCreate a `FullScanRequest for this wallet.\nCreate a partial SyncRequest for this wallet for all …\nTake the staged ChangeSet to be persisted now (if any).\nSpecifies which Taproot script-spend leaves we should sign …\nGet the whole balance visible to the wallet.\nIterate over relevant and canonical transactions in the …\nArray of relevant and canonical transactions in the wallet …\nWhether the signer should trust the witness_utxo, if the …\nUnconfirmed UTXOs generated by a wallet tx\nGet sum of trusted_pending and confirmed coins.\nWhether to try finalizing the PSBT after the inputs are …\nTransaction builder\nGet a reference to the inner TxGraph.\nChanges to TxGraph.\nThe transaction node (as part of the graph).\nUpdate for the wallet’s internal TxGraph.\nGet the TxOut of the UTXO\nTransaction output\nGet an unbounded script pubkey iterator for the given …\nUndoes the effect of mark_used and returns whether the …\nReplace the internal list of unspendable utxos with a new …\nUnconfirmed UTXOs received from an external wallet\nThe UTXO\nGet the version of bdk_wallet at runtime.\nBuild a transaction with a specific version\nDeterministically generate a unique name given the …\nForeign UTXO outpoint\nPSBT input txid\nBlock hash of connected_to.\nExpected block hash of connected_to, as derived from block.\nThe expected network.\nThe expected genesis hash.\nThe expected descriptor.\nKeychain identifying the descriptor.\nThe network that is loaded.\nThe genesis hash that is loaded.\nThe loaded descriptor.\nTransaction inputs sort function\nTransaction outputs sort function\nThe location of the output.\nThe information about the input we require to add it to a …\nThe nSequence value to set for this input.\nBranch and bound coin selection\nIt’s possible to create spendable output from excess …\nTrait for generalized coin selection algorithms\nResult of a successful coin selection\nDefault coin selection algorithm used by TxBuilder if not …\nRemaining amount after performing coin selection\nWallet’s UTXO set is not enough to cover recipient’s …\nSimple and dumb coin selection\nIt’s not possible to create spendable output from excess …\nOldestFirstCoinSelection always picks the utxo with the …\nPull UTXOs at random until we have enough to meet the …\nAmount available for spending\nPerform the coin selection\nDecide if change can be created\nRemaining amount after deducing fees and outgoing outputs\nTotal fee amount for the selected utxos\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nThe total value of the inputs selected from the local …\nAmount needed for the transaction\nCreate new instance with a target size_of_change and …\nList of outputs selected for use as inputs\nThe total value of the inputs selected.\nEffective amount available to create change after …\nThe calculated fee for the drain TxOut with the selected …\nThreshold to consider amount as dust for this particular …\nThe deducted change output fee\nExceeding amount of current selection over outgoing value …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nA raw scriptpubkey (including pay-to-pubkey) under Legacy …\nAlias for a Descriptor that contains extended derived keys\nScript descriptor\nThe descriptor pubkey, either a single pubkey or an xpub.\nAlias for a Descriptor that can contain extended keys …\nTrait implemented on Descriptors to add a method to …\nThe 0 combinator.\nAlias for the type of maps that represent derivation paths …\nTrait for types which can be converted into an …\nThe consensus key associated with the type. Must be a …\nLegacy ScriptContext To be used as P2SH scripts For …\nThe top-level miniscript abstract syntax tree (AST).\nMultiple extended public keys.\nPay-to-PubKey-Hash\nPay-to-PubKey-Hash\nPay-to-PubKey-Hash\nThe ScriptContext for Miniscript. Additional type …\nSegwitv0 ScriptContext\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nPay-to-ScriptHash(includes nested wsh/wpkh/sorted multi)\nSingle public key.\nThe 1 combinator.\nAlias for the type of maps that represent taproot key …\nPay-to-Taproot\nPay-to-Taproot\nPay-to-Taproot\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-PubKey-Hash\nPay-to-Witness-ScriptHash with Segwitv0 context\nPay-to-Witness-ScriptHash with Segwitv0 context\nPay-to-Witness-ScriptHash with Segwitv0 context\nExtended public key (xpub).\nComputes the Bitcoin address of the descriptor, if one …\nGet a reference to the inner AstElem representing the root …\nReplaces any wildcard (i.e. /*) in the key with a …\nReplaces all wildcards (i.e. /*) in the descriptor with a …\nEnumerates all child nodes of the current AST node (self) …\nAttempt to produce a non-malleable witness template given …\nAttempt to produce a malleable witness template given the …\nDepending on script Context, some of the Terminals might …\nDepending on script Context, some of the Terminals might …\nDepending on script Context, some of the script resource …\nDepending on script Context, some of the script resource …\nCheck the consensus + policy(if not disabled) rules that …\nCheck the consensus + policy(if not disabled) rules that …\nConsensus rules at the Miniscript satisfaction time. It is …\nConsensus rules at the Miniscript satisfaction time. It is …\nPolicy rules at the Miniscript satisfaction time. It is …\nPolicy rules at the Miniscript satisfaction time. It is …\nCheck the consensus + policy(if not disabled) rules …\nCheck the consensus + policy(if not disabled) rules …\nEach context has slightly different rules on what Pks are …\nDepending on ScriptContext, fragments can be malleable. …\nCheck whether the given satisfaction is valid under the …\nCheck whether the given satisfaction is valid under the …\nDescriptor checksum\nWhether the given miniscript contains a raw pkh fragment\nDeprecated name for Self::at_derivation_index.\nDeprecated name for Self::at_derivation_index.\nConvert all the public keys in the descriptor to …\nConvert all the public keys in the descriptor to …\nGet the DescriptorType of Descriptor\nEncode as a Bitcoin script\nDescriptor errors\nComputes the the underlying script before any hashing is …\nAdditional information helpful for extra analysis.\nCheck whether the miniscript follows the given Extra …\nExtract the spending policy\nUtility method for deriving the descriptor at each index …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nAdd type information(Type and Extdata) to Miniscript based …\nCreate a new Miniscript from a Terminal node and a Type …\nParse a Miniscript from string and perform sanity checks …\nAttempt to parse an Miniscripts that don’t follow the …\nAttempt to parse an insane(scripts don’t clear sanity …\nParse an expression tree into a descriptor.\nParse an expression tree into a Miniscript. As a general …\nFull path, from the master key\nReturns a vector containing the full derivation paths from …\nReturns child node with given index, if any\nReturns Option::Some with cloned n’th public key from …\nReturns satisfying non-malleable witness and scriptSig to …\nReturns a possilbly mallable satisfying non-malleable …\nWhether the miniscript contains a combination of timelocks\nWhether the miniscript has repeated Pk or Pkh\nWhether or not the key has a wildcard\nWhether or not the descriptor has any wildcards i.e. /*.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nExtracts the AstElem representing the root of the …\nGet as many descriptors as different paths in this …\nGet as many keys as derivation paths in this key.\nConvert to wallet descriptor\nWhether or not the key has a wildcard\nWhether or not the descriptor has any wildcards\nWhether or not this key has multiple derivation paths.\nWhether this descriptor contains a key that has multiple …\nWhether the miniscript is malleable\nCreates a new Iter iterator that will iterate over all …\nCreates a new PkIter iterator that will iterate over all …\nLifting corresponds to conversion of a miniscript into a …\nThe fingerprint of the master key associated with this …\nDepending on script context, the size of a satifaction …\nMaximum size, in bytes, of a satisfying witness. For …\nComputes an upper bound on the weight of a satisfying …\nMaximum number of witness elements used to satisfy the …\nComputes an upper bound on the difference between a …\nLocal helper function to display error messages with …\nCreate a new bare descriptor from witness script Errors …\nCreate a new pk descriptor\nCreate a new PkH descriptor\nCreate a new sh for a given redeem script Errors when …\nCreate a new sh sortedmulti descriptor with threshold k …\nCreate a new sh wrapper for the given wpkh descriptor\nCreate a new sh wrapper for the given wsh descriptor\nCreate a new sh wrapped wpkh from Pk. Errors when …\nCreate a new sh wrapped wsh descriptor with witness script …\nCreate a new sh wrapped wsh sortedmulti descriptor from …\nCreate new tr descriptor Errors when miniscript exceeds …\nCreate a new Wpkh descriptor Will return Err if …\nCreate a new wsh descriptor from witness script Errors …\nCreate a new wsh sorted multi descriptor Errors when …\nA node in the AST.\nOther top level checks that are context specific\nOther top level checks that are context specific\nAttempt to parse a Script into Miniscript representation.\nParse a descriptor that may contain secret keys\nAttempt to parse an insane(scripts don’t clear sanity …\nAttempt to parse an miniscript with extra features that …\nGet the len of public key when serialized based on context …\nReturns a plan if the provided assets are sufficient to …\nReturns a plan if the provided assets are sufficient to …\nDescriptor policy\nWhether all spend paths of miniscript require a signature\nChecks whether the descriptor is safe.\nCheck whether the underlying Miniscript is safe under the …\nAttempts to produce a non-malleable satisfying witness and …\nAttempt to produce non-malleable satisfying witness for the\nAttempt to produce a malleable satisfying witness for the …\nComputes the scriptCode of a transaction output.\nComputes the scriptpubkey of the descriptor.\nSize, in bytes of the script-pubkey. If this Miniscript is …\nThe type of signature required for satisfaction\nSubstitutes raw public keys hashes with the public keys as …\nDescriptor templates\nSerialize a descriptor to string with its secret keys\nCheck top level consensus rules.\nCheck top level consensus rules.\nCheck whether the top-level is type B\nCheck whether the top-level is type B\nConverts a descriptor using abstract keys to one using …\nTranslates a struct from one generic to another where the …\nThe correctness and malleability type information for the …\nComputes the scriptSig that will be in place for an …\nWhether the miniscript can exceed the resource …\nCompute the checksum of a descriptor, excludes any …\nError during base58 decoding\nBIP32 error\nErrors related to the parsing and usage of descriptors\nThe provided wallet descriptors are identical\nThe descriptor contains hardened derivation steps on …\nHex decoding error\nInvalid byte found in the descriptor checksum\nThe provided descriptor doesn’t match its checksum\nInvalid HD Key path, such as having a wildcard but a …\nError thrown while working with keys\nMiniscript error\nThe descriptor contains multipath keys\nKey-related error\nError while extracting and manipulating policies\nReturns the argument unchanged.\nCalls U::from(self).\nAbsolute timeclock timestamp\nCan not add to an item that is Satisfaction::None or …\nCan not add to an item that is …\nOptions to build the satisfaction field in the policy\nCan satisfy the policy item\nAn extra condition that must be satisfied but that is out …\nType for a map of sets of Condition items keyed by each set…\nECDSA Signature for a raw public key\nAn extended key fingerprint\nType for a map of folded sets of Condition items keyed by …\nSHA256 then RIPEMD160 preimage hash\nDouble SHA256 preimage hash\nIncompatible conditions (not currently used)\nIndex out of range for an item to satisfy a …\nCan not merge CSV or timelock values unless both are less …\nMulti-signature public keys with threshold count\nCannot satisfy or contribute to the policy item\nDon’t generate satisfaction field\nNot enough items are selected to satisfy a …\nOnly a partial satisfaction of some kind of threshold …\nCan reach the threshold of some kind of threshold policy\nA unique identifier for a key\nDescriptor spending policy\nErrors that can happen while extracting and manipulating …\nAnalyze the given PSBT to check for existing signatures\nLike Psbt variant and also check for expired timelocks\nA legacy public key\nRelative timelock locktime\nRIPEMD160 preimage hash\nRepresent if and how much a policy item is satisfied by …\nAn item that needs to be satisfied\nSchnorr Signature for a raw public key\nSHA256 preimage hash\nThreshold items with threshold count\nA x-only public key\nHow the wallet’s descriptor can satisfy this policy node\nOptional CheckSequenceVerify condition\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturn the conditions that are set by the spending policy …\nReturns a unique id for the SatisfiableItem\nIdentifier for this policy node\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nReturns whether the SatisfiableItem is a leaf item\nReturns whether the Satisfaction is a leaf item\nReturns true if there are no extra conditions to verify\nType of this policy node\nReturn whether or not a specific path in the policy tree …\nHow much a given PSBT already satisfies this policy node …\nOptional timelock condition\nCurrent blockchain height\nThe highest confirmation height between the inputs CSV …\nGiven PSBT\nExtra conditions that also need to be satisfied\nExtra conditions that also need to be satisfied\nExtra conditions that also need to be satisfied\nThe items that can be satisfied by the descriptor or are …\nThe items that can be satisfied by the descriptor\nThreshold\nThreshold\nTotal number of items\nTotal number of items\nWhether the items are sorted in lexicographic order (used …\nWhether the items are sorted in lexicographic order (used …\nThe digest value\nThe digest value\nThe digest value\nThe digest value\nThe policy items\nThe raw public key or extended key fingerprint\nThe required threshold count\nThe required threshold count\nThe timelock value\nThe timelock value\nBIP44 template. Expands to pkh(key/44'/{0,1}'/0'/{0,1}/*)\nBIP44 public template. Expands to pkh(key/{0,1}/*)\nBIP49 template. Expands to …\nBIP49 public template. Expands to sh(wpkh(key/{0,1}/*))\nBIP84 template. Expands to wpkh(key/84'/{0,1}'/0'/{0,1}/*)\nBIP84 public template. Expands to wpkh(key/{0,1}/*)\nBIP86 template. Expands to tr(key/86'/{0,1}'/0'/{0,1}/*)\nBIP86 public template. Expands to tr(key/{0,1}/*)\nTrait for descriptor templates that can be built into a …\nType alias for the return type of DescriptorTemplate, …\nP2PKH template. Expands to a descriptor pkh(key)\nP2TR template. Expands to a descriptor tr(key)\nP2WPKH template. Expands to a descriptor wpkh(key)\nP2WPKH-P2SH template. Expands to a descriptor sh(wpkh(key))\nBuild the complete descriptor\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nError returned from Wallet::build_fee_bump\nThere was an error with coin selection\nDescriptor key conversion error\nError returned from TxBuilder::finish\nThere was a problem with the descriptors passed in\nWhen bumping a tx the fee rate requested is lower than …\nNode doesn’t have data to estimate a fee rate\nWhen bumping a tx the absolute fee requested is lower than …\nTrying to replace a tx that has a sequence >= 0xFFFFFFFE\nRequested LockTime is less than is required to spend from …\nMiniscript PSBT error\nErrors returned by miniscript when updating inconsistent …\nIn order to use the TxBuilder::add_global_xpubs option …\nMissing non_witness_utxo on foreign utxo for given OutPoint\nCannot build a tx without recipients\nmanually_selected_only option is selected but no utxo has …\nOutput created is under the dust limit, 546 satoshis\nReturn error type for …\nThere was a problem while extracting and manipulating …\nPartially signed bitcoin transaction error\nCannot enable RBF with Sequence given a required OP_CSV\nSpending policy is not compatible with this KeychainKind\nHappens when trying to bump a transaction that is already …\nThrown when a tx is not found in the internal database\nHappens when trying to spend an UTXO that is not in the …\nHappens when trying to spend an UTXO that is not in the …\nReturn error type for PsbtExt::update_input_with_descriptor\nRequested invalid transaction version ‘0’\nRequested transaction version 1, but at least 2 is needed …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nRequired OP_CSV Sequence\nRequested LockTime\nRequired LockTime\nRequired fee absolute value Amount\nRequired fee rate\nGiven RBF Sequence\nStructure that contains the export of a wallet\nAlias for FullyNodedExport\nEarliest block to rescan when looking for the wallet’s …\nEarliest block to rescan when looking for the wallet’s …\nReturn the internal descriptor, if present\nReturn the external descriptor\nExport a wallet\nReturns the argument unchanged.\nCalls U::from(self).\nArbitrary label for the wallet\nArbitrary label for the wallet\nBIP32 error\nTrait for keys that can be derived.\nContainer for public or secret keys\nThe descriptor pubkey, either a single pubkey or an xpub.\nThe descriptor secret key, either a single private key or …\nType specifying the amount of entropy required e.g. [u8;32]\nReturned error in case of failure\nTrait that adds extra useful methods to ScriptContexts\nEnum for extended keys that can be either xprv or xpub\nA bitcoin public key (compressed or uncompressed).\nTrait that allows generating a key with the default options\nTrait for keys that can be generated\nOutput of a GeneratableKey key generation\nTrait for objects that can be turned into a public or …\nThe key has an invalid checksum\nThe key is not valid for the given network\nThe key cannot exist in the given script context\nThe consensus key associated with the type. Must be a …\nErrors thrown while working with keys\nAlias type for a map of public key to secret key\nLegacy scripts\nCustom error message\nMiniscript error\nMultiple extended private keys.\nMultiple extended public keys.\nExtra options required by the generate_with_entropy\nA private extended key, aka an xprv\nOptions for generating a PrivateKey\nA public extended key, aka an xpub\nThe ScriptContext for Miniscript. Additional type …\nEnum representation of the known valid ScriptContexts\nSegwitv0 scripts\nSingle public key.\nSingle private key.\nA descriptor bitcoin::PrivateKey with optional origin …\nA descriptor SinglePubKey with optional origin information.\nSingle public key without any origin or range information.\nContents of a “sortedmulti” descriptor\nTaproot scripts\nSet of valid networks for a key\nAn xonly public key.\nExtended private key (xpriv).\nExtended public key (xpub).\nCreate a set containing mainnet, testnet, testnet4, …\nReturns the ScriptContext as a ScriptContextEnum\nAttempt to produce a witness template given the assets …\nEach context has slightly different rules on what Pks are …\nDepending on ScriptContext, fragments can be malleable. …\nWhether the generated key should be “compressed” or not\nEncode as a Bitcoin script\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCreate an instance given a public key and a set of valid …\nCreate an instance given a secret key and a set of valid …\nParse an expression tree into a SortedMultiVec\nGenerate a key given the options with random entropy.\nGenerate a key with the default options and a random …\nGenerate a key with the default options and a random …\nGenerate a key given the options with random entropy.\nGenerate a key given the extra options and the entropy\nGenerate a key with the default options and a given entropy\nReturn whether or not the key contains the private data\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nTurn the key into a DescriptorKey within the requested …\nConsume self and turn it into a DescriptorKey by adding …\nConsume self and turn it into an ExtendedKey\nConsumes self and returns the key\nGet as many keys as derivation paths in this key.\nTransform the ExtendedKey into an Xpriv for the given …\nTransform the ExtendedKey into an Xpub for the given …\nReturns whether the script context is Legacy\nReturns whether the script context is …\nWhether or not this key has multiple derivation paths.\nReturns whether the script context is Segwitv0\nReturns whether the script context is …\nReturns whether the script context is Tap, aka Taproot or …\nReturns whether the script context is …\nThe threshold value for the multisig.\nThe public key.\nThe private key.\nCreate a set only containing mainnet\nDepending on script context, the size of a satifaction …\nMaximum size, in bytes, of a satisfying witness. In …\nMaximum number of witness elements used to satisfy the …\nCompute the intersection of two sets\nThe number of keys in the multisig.\nLocal helper function to display error messages with …\nCreate a new instance of SortedMultiVec given a list of …\nOrigin information (fingerprint and derivation path).\nOrigin information (fingerprint and derivation path).\nOverride the computed set of valid networks\nGet the len of public key when serialized based on context …\nAccessor for the public keys in the multisig.\nutility function to sanity a sorted multi vec\nAttempt to produce a satisfying witness for the witness …\nSize, in bytes of the script-pubkey. If this Miniscript is …\nThe type of signature required for satisfaction\nCreate Terminal::Multi containing sorted pubkeys\nCreate a set containing test networks\nReturns the public version of this key.\nThis will panic if fpk returns an uncompressed key when …\nTrait to add functions to extract utxos and calculate fees.\nThe total transaction fee amount, sum of input amounts …\nThe transaction’s fee rate. This value will only be …\nGet the TxOut for the specified input index, if it doesn’…\nTable name for schemas.\nRuns logic that initializes/migrates the table schemas.\nThe signer will sign all the leaves it has a key for.\nDummy identifier\nThe signer won’t sign the specified leaves.\nTo be used only by external libraries implementing …\nThe fingerprint of a BIP32 extended key\nThe signer won’t sign leaves other than the ones …\nInput index is out of range\nPSBT Input signer\nThe private key in use has the right fingerprint but …\nThe non_witness_utxo specified is invalid\nInvalid SIGHASH for the signing context in use\nLegacy context\nMiniscript PSBT error\nThe fingerprint and derivation path are missing from the …\nThe private key is missing for the required public key\nThe non_witness_utxo field of the transaction is required …\nThe witness_script field of the transaction is required to …\nThe witness_utxo field of the transaction is required to …\nThe psbt contains a non-SIGHASH_ALL sighash in one of its …\nThe signer won’t sign any leaf.\nBitcoin HASH160 (RIPEMD160 after SHA256) hash of an ECDSA …\nPSBT sign error.\nSegwit v0 context (BIP 143)\nError while computing the hash to sign a Taproot input.\nOptions for a software signer\nCommon signer methods\nSigning context\nSigning error\nIdentifier of a signer in the SignersContainers. Used as a …\nDefines the order in which signers are called\nWrapper to pair a signer with its context\nContainer for multiple signers\nTaproot context (BIP 340)\nCustomize which taproot script-path leaves the signer …\nPSBT signer\nThe user canceled the operation\nAdds an external signer to the container for the specified …\nWhether the signer should use the sighash_type set in the …\nWhether we should grind ECDSA signature to ensure signing …\nCreate a map of public keys to secret keys\nWhether the wallet should assume a specific height has …\nBuild a new signer container from a KeyMap\nReturn the secret key for the signer\nReturn the secret key for the signer\nFinds the signer with lowest ordering for a given id in …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturn the SignerId for this signer\nReturns the list of identifiers of all the signers in the …\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCreate a wrapped signer from a signer and a context\nDefault constructor\nRemoves a signer from the container and returns it\nSign a single psbt input\nSign all the inputs of the psbt\nWhether we should try to sign a taproot transaction with …\nReturns the list of signers in the container, sorted by …\nSpecifies which Taproot script-spend leaves we should sign …\nWhether the signer should trust the witness_utxo, if the …\nWhether to try finalizing the PSBT after the inputs are …\nWhether the signer can sign for the internal key or not\nError returned from TxBuilder::add_foreign_utxo.\nError returned from TxBuilder::add_utxo and …\nUse both change and non-change outputs (default)\nOnly use non-change outputs (see …\nPolicy regarding the use of change outputs when creating a …\nProvide custom comparison functions for sorting\nRequested outpoint doesn’t exist in the tx (vout greater …\nForeign utxo outpoint txid does not match PSBT input txid\nForeign utxo missing witness_utxo or non_witness_utxo\nOnly use change outputs (see TxBuilder::only_spend_change)\nRandomized (default)\nA transaction builder\nOrdering of the transaction’s inputs and outputs\nHappens when trying to spend an UTXO that is not in the …\nUnchanged\nForeign UTXO outpoint\nPSBT input txid\nTransaction inputs sort function\nTransaction outputs sort function")
\ 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 51ed47c8e8..a577bb874c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/settings.html
@@ -1 +1 @@
-Settings
Rustdoc settings
Back

\ No newline at end of file
+Settings
Rustdoc settings
Back

\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
index c5bc3efb9b..6f31f95943 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_bitcoind_rpc/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_bitcoind_rpc/
lib.rs
+lib.rs - source
bdk_bitcoind_rpc/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
index 461a649796..1ebac357c2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/balance.rs.html
@@ -1,4 +1,4 @@
-balance.rs - source
bdk_chain/
balance.rs
+balance.rs - source
bdk_chain/
balance.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
index 4578d43fdb..ada288b7bb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/canonical_iter.rs.html
@@ -1,4 +1,4 @@
-canonical_iter.rs - source
bdk_chain/
canonical_iter.rs
+canonical_iter.rs - source
bdk_chain/
canonical_iter.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
index e0894ee968..2fc014a591 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_data.rs.html
@@ -1,4 +1,4 @@
-chain_data.rs - source
bdk_chain/
chain_data.rs
+chain_data.rs - source
bdk_chain/
chain_data.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
index 803b450bcd..2b0613e28f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/chain_oracle.rs.html
@@ -1,4 +1,4 @@
-chain_oracle.rs - source
bdk_chain/
chain_oracle.rs
+chain_oracle.rs - source
bdk_chain/
chain_oracle.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
index ae1d57bb23..b5dbfd42f5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/descriptor_ext.rs.html
@@ -1,4 +1,4 @@
-descriptor_ext.rs - source
bdk_chain/
descriptor_ext.rs
+descriptor_ext.rs - source
bdk_chain/
descriptor_ext.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
index cd54ef65a4..71f86291d2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/example_utils.rs.html
@@ -1,4 +1,4 @@
-example_utils.rs - source
bdk_chain/
example_utils.rs
+example_utils.rs - source
bdk_chain/
example_utils.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
index 24ea664a4e..e4164081ca 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexed_tx_graph.rs.html
@@ -1,4 +1,4 @@
-indexed_tx_graph.rs - source
bdk_chain/
indexed_tx_graph.rs
+indexed_tx_graph.rs - source
bdk_chain/
indexed_tx_graph.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
index f5e8c43524..fb33474b98 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer.rs.html
@@ -1,4 +1,4 @@
-indexer.rs - source
bdk_chain/
indexer.rs
+indexer.rs - source
bdk_chain/
indexer.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
index 10b661a8bd..7dca88637d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/keychain_txout.rs.html
@@ -1,4 +1,4 @@
-keychain_txout.rs - source
bdk_chain/indexer/
keychain_txout.rs
+keychain_txout.rs - source
bdk_chain/indexer/
keychain_txout.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
index e66086a856..cd81e73a2f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/indexer/spk_txout.rs.html
@@ -1,4 +1,4 @@
-spk_txout.rs - source
bdk_chain/indexer/
spk_txout.rs
+spk_txout.rs - source
bdk_chain/indexer/
spk_txout.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
index 06c2b02a4c..087ae1dec0 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_chain/
lib.rs
+lib.rs - source
bdk_chain/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
index 8170baee9b..5ce24b3f54 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/local_chain.rs.html
@@ -1,4 +1,4 @@
-local_chain.rs - source
bdk_chain/
local_chain.rs
+local_chain.rs - source
bdk_chain/
local_chain.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
index ab404e4f79..574267acda 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/rusqlite_impl.rs.html
@@ -1,4 +1,4 @@
-rusqlite_impl.rs - source
bdk_chain/
rusqlite_impl.rs
+rusqlite_impl.rs - source
bdk_chain/
rusqlite_impl.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
index 0d286df703..7414f71661 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/spk_iter.rs.html
@@ -1,4 +1,4 @@
-spk_iter.rs - source
bdk_chain/
spk_iter.rs
+spk_iter.rs - source
bdk_chain/
spk_iter.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
index 7f77a7c8c8..93e77f8b22 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_data_traits.rs.html
@@ -1,4 +1,4 @@
-tx_data_traits.rs - source
bdk_chain/
tx_data_traits.rs
+tx_data_traits.rs - source
bdk_chain/
tx_data_traits.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
index 6151e0f2c8..20443a2bc2 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
@@ -1,4 +1,4 @@
-tx_graph.rs - source
bdk_chain/
tx_graph.rs
+tx_graph.rs - source
bdk_chain/
tx_graph.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
index f81de6bf85..575fb31acb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/block_id.rs.html
@@ -1,4 +1,4 @@
-block_id.rs - source
bdk_core/
block_id.rs
+block_id.rs - source
bdk_core/
block_id.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
index 1d2d149526..b793f1b1c1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/checkpoint.rs.html
@@ -1,4 +1,4 @@
-checkpoint.rs - source
bdk_core/
checkpoint.rs
+checkpoint.rs - source
bdk_core/
checkpoint.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
index 56cbb01e8d..9b840af93e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_core/
lib.rs
+lib.rs - source
bdk_core/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
index 012529a2da..f28dea7b45 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/merge.rs.html
@@ -1,4 +1,4 @@
-merge.rs - source
bdk_core/
merge.rs
+merge.rs - source
bdk_core/
merge.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
index 7ff5614738..82b516b704 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/spk_client.rs.html
@@ -1,4 +1,4 @@
-spk_client.rs - source
bdk_core/
spk_client.rs
+spk_client.rs - source
bdk_core/
spk_client.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
index 1fecdef7c1..784346cc7f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_core/tx_update.rs.html
@@ -1,4 +1,4 @@
-tx_update.rs - source
bdk_core/
tx_update.rs
+tx_update.rs - source
bdk_core/
tx_update.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
index 4647bb9e43..f7c14df864 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/bdk_electrum_client.rs.html
@@ -1,4 +1,4 @@
-bdk_electrum_client.rs - source
bdk_electrum/
bdk_electrum_client.rs
+bdk_electrum_client.rs - source
bdk_electrum/
bdk_electrum_client.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
index 0cd3f747ed..70df31c539 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_electrum/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_electrum/
lib.rs
+lib.rs - source
bdk_electrum/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
index b58cd16c44..1d509b9c69 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/async_ext.rs.html
@@ -1,4 +1,4 @@
-async_ext.rs - source
bdk_esplora/
async_ext.rs
+async_ext.rs - source
bdk_esplora/
async_ext.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
index 69b0495d1c..cad2a882e9 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/blocking_ext.rs.html
@@ -1,4 +1,4 @@
-blocking_ext.rs - source
bdk_esplora/
blocking_ext.rs
+blocking_ext.rs - source
bdk_esplora/
blocking_ext.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
index 76c84c42c0..f261bdbc01 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_esplora/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_esplora/
lib.rs
+lib.rs - source
bdk_esplora/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
index bb87fed951..bf2c8505b3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/entry_iter.rs.html
@@ -1,4 +1,4 @@
-entry_iter.rs - source
bdk_file_store/
entry_iter.rs
+entry_iter.rs - source
bdk_file_store/
entry_iter.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
index fe687adc2f..1121ba4804 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_file_store/
lib.rs
+lib.rs - source
bdk_file_store/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
index ecc9d238b2..4136c0991c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_file_store/store.rs.html
@@ -1,4 +1,4 @@
-store.rs - source
bdk_file_store/
store.rs
+store.rs - source
bdk_file_store/
store.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
index b715923e41..f7d48ed3ac 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_testenv/
lib.rs
+lib.rs - source
bdk_testenv/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
index dc4c41e5d0..5290eba69e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_testenv/utils.rs.html
@@ -1,4 +1,4 @@
-utils.rs - source
bdk_testenv/
utils.rs
+utils.rs - source
bdk_testenv/
utils.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
index 0e096236d0..95e3d09158 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/checksum.rs.html
@@ -1,4 +1,4 @@
-checksum.rs - source
bdk_wallet/descriptor/
checksum.rs
+checksum.rs - source
bdk_wallet/descriptor/
checksum.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
index ded67c2c27..a863b5c06f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/dsl.rs.html
@@ -1,4 +1,4 @@
-dsl.rs - source
bdk_wallet/descriptor/
dsl.rs
+dsl.rs - source
bdk_wallet/descriptor/
dsl.rs
 1
 2
 3
@@ -1226,7 +1226,10 @@
 1225
 1226
 1227
-1228
// Bitcoin Dev Kit
+1228
+1229
+1230
+1231
// Bitcoin Dev Kit
 // Written in 2020 by Alekos Filini <alekos.filini@gmail.com>
 //
 // Copyright (c) 2020-2021 Bitcoin Dev Kit Developers
@@ -2045,7 +2048,7 @@
     use crate::descriptor::{DescriptorError, DescriptorMeta};
     use crate::keys::{DescriptorKey, IntoDescriptorKey, ValidNetworks};
     use bitcoin::bip32;
-    use bitcoin::Network::{Bitcoin, Regtest, Signet, Testnet};
+    use bitcoin::Network::{Bitcoin, Regtest, Signet, Testnet, Testnet4};
     use bitcoin::PrivateKey;
 
     // test the descriptor!() macro
@@ -2343,7 +2346,10 @@
         let (_desc, _key_map, valid_networks) = descriptor!(pkh(desc_key)).unwrap();
         assert_eq!(
             valid_networks,
-            [Testnet, Regtest, Signet].iter().cloned().collect()
+            [Testnet, Testnet4, Regtest, Signet]
+                .iter()
+                .cloned()
+                .collect()
         );
 
         let xprv = bip32::Xpriv::from_str("xprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi").unwrap();
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
index f047a2dcb8..f3955c664c 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
bdk_wallet/descriptor/
error.rs
+error.rs - source
bdk_wallet/descriptor/
error.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
index 58990590bc..b58c840a19 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
bdk_wallet/descriptor/
mod.rs
+mod.rs - source
bdk_wallet/descriptor/
mod.rs
 1
 2
 3
@@ -911,7 +911,11 @@
 910
 911
 912
-913
// Bitcoin Dev Kit
+913
+914
+915
+916
+917
// Bitcoin Dev Kit
 // Written in 2020 by Alekos Filini <alekos.filini@gmail.com>
 //
 // Copyright (c) 2020-2021 Bitcoin Dev Kit Developers
@@ -1716,6 +1720,10 @@
             .into_wallet_descriptor(&secp, Network::Testnet);
         assert!(desc.is_ok());
 
+        let desc = "wpkh(tprv8ZgxMBicQKsPdpkqS7Eair4YxjcuuvDPNYmKX3sCniCf16tHEVrjjiSXEkFRnUH77yXc6ZcwHHcLNfjdi5qUvw3VDfgYiH5mNsj5izuiu2N/1/2/*)"
+            .into_wallet_descriptor(&secp, Network::Testnet4);
+        assert!(desc.is_ok());
+
         let desc = "wpkh(tprv8ZgxMBicQKsPdpkqS7Eair4YxjcuuvDPNYmKX3sCniCf16tHEVrjjiSXEkFRnUH77yXc6ZcwHHcLNfjdi5qUvw3VDfgYiH5mNsj5izuiu2N/1/2/*)"
             .into_wallet_descriptor(&secp, Network::Regtest);
         assert!(desc.is_ok());
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
index 4576a1e8ac..0760be89f4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/policy.rs.html
@@ -1,4 +1,4 @@
-policy.rs - source
bdk_wallet/descriptor/
policy.rs
+policy.rs - source
bdk_wallet/descriptor/
policy.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
index cdc2e2cb58..8b8dc53c7d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/descriptor/template.rs.html
@@ -1,4 +1,4 @@
-template.rs - source
bdk_wallet/descriptor/
template.rs
+template.rs - source
bdk_wallet/descriptor/
template.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
index 5d9c05769e..ee83835092 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/keys/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
bdk_wallet/keys/
mod.rs
+mod.rs - source
bdk_wallet/keys/
mod.rs
 1
 2
 3
@@ -1025,7 +1025,13 @@
 1024
 1025
 1026
-1027
// Bitcoin Dev Kit
+1027
+1028
+1029
+1030
+1031
+1032
+1033
// Bitcoin Dev Kit
 // Written in 2020 by Alekos Filini <alekos.filini@gmail.com>
 //
 // Copyright (c) 2020-2021 Bitcoin Dev Kit Developers
@@ -1072,11 +1078,12 @@
 /// Set of valid networks for a key
 pub type ValidNetworks = HashSet<Network>;
 
-/// Create a set containing mainnet, testnet, signet, and regtest
+/// Create a set containing mainnet, testnet, testnet4, signet, and regtest
 pub fn any_network() -> ValidNetworks {
     vec![
         Network::Bitcoin,
         Network::Testnet,
+        Network::Testnet4,
         Network::Regtest,
         Network::Signet,
     ]
@@ -1087,11 +1094,16 @@
 pub fn mainnet_network() -> ValidNetworks {
     vec![Network::Bitcoin].into_iter().collect()
 }
-/// Create a set containing testnet and regtest
+/// Create a set containing test networks
 pub fn test_networks() -> ValidNetworks {
-    vec![Network::Testnet, Network::Regtest, Network::Signet]
-        .into_iter()
-        .collect()
+    vec![
+        Network::Testnet,
+        Network::Testnet4,
+        Network::Regtest,
+        Network::Signet,
+    ]
+    .into_iter()
+    .collect()
 }
 /// Compute the intersection of two sets
 pub fn merge_networks(a: &ValidNetworks, b: &ValidNetworks) -> ValidNetworks {
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
index b137a66733..8e4268d94d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
bdk_wallet/
lib.rs
+lib.rs - source
bdk_wallet/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
index 6c7c46fbb3..a6539e0051 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/psbt/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
bdk_wallet/psbt/
mod.rs
+mod.rs - source
bdk_wallet/psbt/
mod.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
index ce9f8999c4..23ead0a1dd 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/types.rs.html
@@ -1,4 +1,4 @@
-types.rs - source
bdk_wallet/
types.rs
+types.rs - source
bdk_wallet/
types.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
index 1b9257ac70..02aa8cf837 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/changeset.rs.html
@@ -1,4 +1,4 @@
-changeset.rs - source
bdk_wallet/wallet/
changeset.rs
+changeset.rs - source
bdk_wallet/wallet/
changeset.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
index 324458fdb5..3a513d9d81 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/coin_selection.rs.html
@@ -1,4 +1,4 @@
-coin_selection.rs - source
bdk_wallet/wallet/
coin_selection.rs
+coin_selection.rs - source
bdk_wallet/wallet/
coin_selection.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
index 2350b0cb7f..b2a320e1d7 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/error.rs.html
@@ -1,4 +1,4 @@
-error.rs - source
bdk_wallet/wallet/
error.rs
+error.rs - source
bdk_wallet/wallet/
error.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
index 1eea24e63a..9cbdad6f5e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/export.rs.html
@@ -1,4 +1,4 @@
-export.rs - source
bdk_wallet/wallet/
export.rs
+export.rs - source
bdk_wallet/wallet/
export.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
index 11a46bc796..41c1bdaeb1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/mod.rs.html
@@ -1,4 +1,4 @@
-mod.rs - source
bdk_wallet/wallet/
mod.rs
+mod.rs - source
bdk_wallet/wallet/
mod.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
index 1ae72e1699..4547bf24ab 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/params.rs.html
@@ -1,4 +1,4 @@
-params.rs - source
bdk_wallet/wallet/
params.rs
+params.rs - source
bdk_wallet/wallet/
params.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
index 96cf6a9580..f5c19643d4 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/persisted.rs.html
@@ -1,4 +1,4 @@
-persisted.rs - source
bdk_wallet/wallet/
persisted.rs
+persisted.rs - source
bdk_wallet/wallet/
persisted.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
index b6aa879867..c9cb5d49b8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/signer.rs.html
@@ -1,4 +1,4 @@
-signer.rs - source
bdk_wallet/wallet/
signer.rs
+signer.rs - source
bdk_wallet/wallet/
signer.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
index e7a77c4e22..1d0ac401db 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/tx_builder.rs.html
@@ -1,4 +1,4 @@
-tx_builder.rs - source
bdk_wallet/wallet/
tx_builder.rs
+tx_builder.rs - source
bdk_wallet/wallet/
tx_builder.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
index 92760be3aa..3681a705f3 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_wallet/wallet/utils.rs.html
@@ -1,4 +1,4 @@
-utils.rs - source
bdk_wallet/wallet/
utils.rs
+utils.rs - source
bdk_wallet/wallet/
utils.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
index 6bd615e88f..c0b3a10a82 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_bitcoind_rpc_polling/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_bitcoind_rpc_polling/
main.rs
+main.rs - source
example_bitcoind_rpc_polling/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
index 8bbd65d82c..846894ecaa 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_cli/lib.rs.html
@@ -1,4 +1,4 @@
-lib.rs - source
example_cli/
lib.rs
+lib.rs - source
example_cli/
lib.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
index fdd15f6400..390ea4fe9d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_electrum/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_electrum/
main.rs
+main.rs - source
example_electrum/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
index 77587b85a8..059a748d29 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_esplora/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_esplora/
main.rs
+main.rs - source
example_esplora/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
index 2b477e7510..578486824b 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_electrum/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_wallet_electrum/
main.rs
+main.rs - source
example_wallet_electrum/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
index 1a592f5907..b357e99016 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_async/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_wallet_esplora_async/
main.rs
+main.rs - source
example_wallet_esplora_async/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
index ec94450403..ff6a80708d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_esplora_blocking/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_wallet_esplora_blocking/
main.rs
+main.rs - source
example_wallet_esplora_blocking/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
index 1a824bdd29..e5a508ae52 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/example_wallet_rpc/main.rs.html
@@ -1,4 +1,4 @@
-main.rs - source
example_wallet_rpc/
main.rs
+main.rs - source
example_wallet_rpc/
main.rs
 1
 2
 3
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
index 26880133bb..eb829b46d5 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/bdk_core/merge/trait.Merge.js
@@ -1,9 +1,9 @@
 (function() {
-    var implementors = Object.fromEntries([["bdk_chain",[["impl Merge for ChangeSet"],["impl Merge for ChangeSet"],["impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>"],["impl<A: Ord> Merge for ChangeSet<A>"]]],["bdk_core",[]],["bdk_wallet",[["impl Merge for ChangeSet"]]],["example_cli",[["impl Merge for ChangeSet"]]]]);
+    var implementors = Object.fromEntries([["bdk_chain",[["impl Merge for ChangeSet"],["impl Merge for ChangeSet"],["impl<A: Anchor, IA: Merge> Merge for ChangeSet<A, IA>"],["impl<A: Ord> Merge for ChangeSet<A>"]]],["bdk_core",[]],["bdk_wallet",[["impl Merge for ChangeSet"]]],["example_cli",[["impl Merge for ChangeSet"]]]]);
     if (window.register_implementors) {
         window.register_implementors(implementors);
     } else {
         window.pending_implementors = implementors;
     }
 })()
-//{"start":57,"fragment_lengths":[1409,16,254,257]}
\ No newline at end of file
+//{"start":57,"fragment_lengths":[1409,16,151,154]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
index 19d62acdf5..d1a0f25774 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/trait.impl/core/convert/trait.From.js
@@ -1,9 +1,9 @@
 (function() {
-    var implementors = Object.fromEntries([["bdk_chain",[["impl From<Hash> for DescriptorId"],["impl From<DescriptorId> for Hash"],["impl From<TxPosInBlock<'_>> for BlockId"],["impl From<TxPosInBlock<'_>> for ConfirmationBlockTime"],["impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>"],["impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>"],["impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>"],["impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>"],["impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet"],["impl<T> From<T> for Impl<T>"]]],["bdk_core",[["impl From<(&u32, &BlockHash)> for BlockId"],["impl From<(u32, BlockHash)> for BlockId"],["impl From<BlockId> for (u32, BlockHash)"],["impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>"],["impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>"]]],["bdk_file_store",[["impl From<Error> for FileError"],["impl From<Error> for IterError"]]],["bdk_wallet",[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<SyncResponse> for Update"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]]],["example_bitcoind_rpc_polling",[["impl From<RpcArgs> for Auth"]]]]);
+    var implementors = Object.fromEntries([["bdk_chain",[["impl From<Hash> for DescriptorId"],["impl From<DescriptorId> for Hash"],["impl From<TxPosInBlock<'_>> for BlockId"],["impl From<TxPosInBlock<'_>> for ConfirmationBlockTime"],["impl<A> From<ChangeSet> for ChangeSet<A, ChangeSet>"],["impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>"],["impl<A: Anchor> From<TxUpdate<A>> for TxGraph<A>"],["impl<A: Ord> From<TxGraph<A>> for TxUpdate<A>"],["impl<B: IntoIterator<Item = (u32, Option<BlockHash>)>> From<B> for ChangeSet"],["impl<T> From<T> for Impl<T>"]]],["bdk_core",[["impl From<(&u32, &BlockHash)> for BlockId"],["impl From<(u32, BlockHash)> for BlockId"],["impl From<BlockId> for (u32, BlockHash)"],["impl<I> From<SyncRequestBuilder<I>> for SyncRequest<I>"],["impl<K> From<FullScanRequestBuilder<K>> for FullScanRequest<K>"]]],["bdk_file_store",[["impl From<Error> for FileError"],["impl From<Error> for IterError"]]],["bdk_wallet",[["impl From<Error> for CreateTxError"],["impl From<PolicyError> for Error"],["impl From<PolicyError> for CreateTxError"],["impl From<SatisfiableItem> for Policy"],["impl From<LoadMismatch> for LoadError"],["impl From<MiniscriptPsbtError> for CreateTxError"],["impl From<KeyError> for Error"],["impl From<bool> for Satisfaction"],["impl From<InsufficientFunds> for CreateTxError"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime>> for ChangeSet"],["impl From<ChangeSet<ConfirmationBlockTime, ChangeSet>> for ChangeSet"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for Error"],["impl From<Error> for CreateTxError"],["impl From<Error> for KeyError"],["impl From<Error> for KeyError"],["impl From<Fingerprint> for SignerId"],["impl From<FullScanResponse<KeychainKind>> for Update"],["impl From<Hash> for SignerId"],["impl From<HexToBytesError> for Error"],["impl From<ParsePublicKeyError> for Error"],["impl From<SyncResponse> for Update"],["impl<Ctx: ScriptContext> From<Xpriv> for ExtendedKey<Ctx>"],["impl<Ctx: ScriptContext> From<Xpub> for ExtendedKey<Ctx>"],["impl<E> From<LoadMismatch> for LoadWithPersistError<E>"]]],["example_bitcoind_rpc_polling",[["impl From<RpcArgs> for Auth"]]]]);
     if (window.register_implementors) {
         window.register_implementors(implementors);
     } else {
         window.pending_implementors = implementors;
     }
 })()
-//{"start":57,"fragment_lengths":[5175,2130,853,10593,341]}
\ No newline at end of file
+//{"start":57,"fragment_lengths":[5175,2130,853,10037,341]}
\ 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 f8be26f624..907f8307b8 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,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["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. This is\npotentially useful:
\n
    \n
  • for key types where non-identical keys can be considered equal;
    • \n
  • for getting the &K stored key value from a borrowed &Q lookup key; or
    • \n
  • for getting a reference to a key with the same lifetime as the collection.
    • \n
\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::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), 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
If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
\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)>,
Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
\n
If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
\n
","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
Source§
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,
Source§
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
Source§
type Item = (K, V)
The type of the elements being iterated over.
Source§
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,
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
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,\nand 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
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
Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
1.0.0 · Source§
fn gt(&self, other: &Rhs) -> bool
Tests greater than (for self and other) and is used by the >\noperator. Read more
1.0.0 · Source§
fn ge(&self, other: &Rhs) -> bool
Tests greater than or equal to (for self and other) and is used by\nthe >= operator. 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. This is\npotentially useful:
\n
    \n
  • for key types where non-identical keys can be considered equal;
    • \n
  • for getting the &K stored key value from a borrowed &Q lookup key; or
    • \n
  • for getting a reference to a key with the same lifetime as the collection.
    • \n
\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::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), 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
If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
\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)>,
Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
\n
If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
\n
","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
Source§
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,
Source§
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
Source§
type Item = (K, V)
The type of the elements being iterated over.
Source§
type IntoIter = IntoIter<K, V, A>
Which kind of iterator are we turning this into?
","IntoIterator","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
Source§
impl<K, V> Merge for BTreeMap<K, V>
where\n    K: Ord,
Source§
fn merge(&mut self, other: BTreeMap<K, V>)
Merge another object of the same type onto self.
Source§
fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
Source§
fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
","Merge","bdk_wallet::descriptor::policy::ConditionMap","bdk_wallet::descriptor::policy::FoldedConditionMap","bdk_wallet::descriptor::HdKeyPaths","bdk_wallet::descriptor::TapKeyOrigins","bdk_wallet::keys::KeyMap"],["
1.0.0 · Source§
impl<K, V, A> Ord for BTreeMap<K, V, A>
where\n    K: Ord,\n    V: Ord,\n    A: Allocator + Clone,
Source§
fn cmp(&self, other: &BTreeMap<K, V, A>) -> Ordering
This method returns an Ordering between self and other. Read more
1.21.0 · Source§
fn max(self, other: Self) -> Self
where\n    Self: Sized,
Compares and returns the maximum of two values. Read more
1.21.0 · Source§
fn min(self, other: Self) -> Self
where\n    Self: Sized,
Compares and returns the minimum of two values. Read more
1.50.0 · Source§
fn clamp(self, min: Self, max: Self) -> Self
where\n    Self: Sized,
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
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,\nand 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
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
Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
1.0.0 · Source§
fn gt(&self, other: &Rhs) -> bool
Tests greater than (for self and other) and is used by the >\noperator. Read more
1.0.0 · Source§
fn ge(&self, other: &Rhs) -> bool
Tests greater than or equal to (for self and other) and is used by\nthe >= operator. 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"]]]]);
+    var type_impls = Object.fromEntries([["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. This is\npotentially useful:
\n
    \n
  • for key types where non-identical keys can be considered equal;
    • \n
  • for getting the &K stored key value from a borrowed &Q lookup key; or
    • \n
  • for getting a reference to a key with the same lifetime as the collection.
    • \n
\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::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), 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
If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
\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)>,
Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
\n
If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
\n
","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
Source§
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,
Source§
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
Source§
type Item = (K, V)
The type of the elements being iterated over.
Source§
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,
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
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,\nand 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
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
Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
1.0.0 · Source§
fn gt(&self, other: &Rhs) -> bool
Tests greater than (for self and other) and is used by the >\noperator. Read more
1.0.0 · Source§
fn ge(&self, other: &Rhs) -> bool
Tests greater than or equal to (for self and other) and is used by\nthe >= operator. 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. This is\npotentially useful:
\n
    \n
  • for key types where non-identical keys can be considered equal;
    • \n
  • for getting the &K stored key value from a borrowed &Q lookup key; or
    • \n
  • for getting a reference to a key with the same lifetime as the collection.
    • \n
\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::cmp::Ordering;\nuse std::collections::BTreeMap;\n\n#[derive(Clone, Copy, Debug)]\nstruct S {\n    id: u32,\n    name: &'static str, // ignored by equality and ordering operations\n}\n\nimpl PartialEq for S {\n    fn eq(&self, other: &S) -> bool {\n        self.id == other.id\n    }\n}\n\nimpl Eq for S {}\n\nimpl PartialOrd for S {\n    fn partial_cmp(&self, other: &S) -> Option<Ordering> {\n        self.id.partial_cmp(&other.id)\n    }\n}\n\nimpl Ord for S {\n    fn cmp(&self, other: &S) -> Ordering {\n        self.id.cmp(&other.id)\n    }\n}\n\nlet j_a = S { id: 1, name: \"Jessica\" };\nlet j_b = S { id: 1, name: \"Jess\" };\nlet p = S { id: 2, name: \"Paul\" };\nassert_eq!(j_a, j_b);\n\nlet mut map = BTreeMap::new();\nmap.insert(j_a, \"Paris\");\nassert_eq!(map.get_key_value(&j_a), Some((&j_a, &\"Paris\")));\nassert_eq!(map.get_key_value(&j_b), Some((&j_a, &\"Paris\"))); // the notable case\nassert_eq!(map.get_key_value(&p), 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
If any entries in the array have equal keys,\nall but one of the corresponding values will be dropped.
\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)>,
Constructs a BTreeMap<K, V> from an iterator of key-value pairs.
\n
If the iterator produces any pairs with equal keys,\nall but one of the corresponding values will be dropped.
\n
","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
Source§
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,
Source§
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
Source§
type Item = (K, V)
The type of the elements being iterated over.
Source§
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,
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
Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§
fn ne(&self, other: &Rhs) -> bool
Tests for !=. The default implementation is almost always sufficient,\nand 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
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
Tests less than or equal to (for self and other) and is used by the\n<= operator. Read more
1.0.0 · Source§
fn gt(&self, other: &Rhs) -> bool
Tests greater than (for self and other) and is used by the >\noperator. Read more
1.0.0 · Source§
fn ge(&self, other: &Rhs) -> bool
Tests greater than or equal to (for self and other) and is used by\nthe >= operator. 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;
     }
 })()
-//{"start":55,"fragment_lengths":[170944,173853]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[170640,173278]}
\ No newline at end of file
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
index f8cb2a64c7..6b60a40577 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/type.impl/bdk_chain/indexed_tx_graph/struct.IndexedTxGraph.js
@@ -1,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["example_cli",[["
§
impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
§
fn as_ref(&self) -> &TxGraph<A>
Converts this type into a shared reference of the (usually inferred) input type.
","AsRef>","example_cli::KeychainTxGraph"],["
§
impl<A, I> Clone for IndexedTxGraph<A, I>
where\n    A: Clone,\n    I: Clone,
§
fn clone(&self) -> IndexedTxGraph<A, 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
","Clone","example_cli::KeychainTxGraph"],["
§
impl<A, I> Debug for IndexedTxGraph<A, I>
where\n    A: Debug,\n    I: Debug,
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
","Debug","example_cli::KeychainTxGraph"],["
§
impl<A, I> Default for IndexedTxGraph<A, I>
where\n    I: Default,
§
fn default() -> IndexedTxGraph<A, I>
Returns the “default value” for a type. Read more
","Default","example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
pub fn new(index: I) -> IndexedTxGraph<A, I>
Construct a new [IndexedTxGraph] with a given index.
\n
pub fn graph(&self) -> &TxGraph<A>
Get a reference of the internal transaction graph.
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
Methods are available if the anchor (A) can be created from [TxPosInBlock].
\n
pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
\n
Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
\n
Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
\n
pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Batch insert all transactions of the given block of height.
\n
Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
\n
To only insert relevant transactions, use apply_block_relevant instead.
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    A: Anchor,\n    I: Indexer,
pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>,\n)
Applies the [ChangeSet] to the [IndexedTxGraph].
\n
pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Determines the [ChangeSet] between self and an empty [IndexedTxGraph].
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Apply an update directly.
\n
update is a tx_graph::TxUpdate<A> and the resultant changes is returned as [ChangeSet].
\n
pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Apply the given update with an optional seen_at timestamp.
\n
seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
\n
Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
\n
Use apply_update to have the seen_at value automatically\nset to the current time.
\n
pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert a floating txout of given outpoint.
\n
pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Insert and index a transaction into the graph.
\n
pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert an anchor for a given transaction.
\n
pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert a unix timestamp of when a transaction is seen in the mempool.
\n
This is used for transaction conflict resolution in [TxGraph] where the transaction with\nthe later last-seen is prioritized.
\n
pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert transactions, filtering out those that are irrelevant.
\n
Relevancy is determined by the [Indexer::is_tx_relevant] implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
\n
pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert unconfirmed transactions, filtering out those that are irrelevant.
\n
Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
\n
Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
\n
pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert unconfirmed transactions.
\n
Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
\n
To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
\n
",0,"example_cli::KeychainTxGraph"]]]]);
+    var type_impls = Object.fromEntries([["example_cli",[["
§
impl<A, I> AsRef<TxGraph<A>> for IndexedTxGraph<A, I>
§
fn as_ref(&self) -> &TxGraph<A>
Converts this type into a shared reference of the (usually inferred) input type.
","AsRef>","example_cli::KeychainTxGraph"],["
§
impl<A, I> Clone for IndexedTxGraph<A, I>
where\n    A: Clone,\n    I: Clone,
§
fn clone(&self) -> IndexedTxGraph<A, 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
","Clone","example_cli::KeychainTxGraph"],["
§
impl<A, I> Debug for IndexedTxGraph<A, I>
where\n    A: Debug,\n    I: Debug,
§
fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>
Formats the value using the given formatter. Read more
","Debug","example_cli::KeychainTxGraph"],["
§
impl<A, I> Default for IndexedTxGraph<A, I>
where\n    I: Default,
§
fn default() -> IndexedTxGraph<A, I>
Returns the “default value” for a type. Read more
","Default","example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
pub fn new(index: I) -> IndexedTxGraph<A, I>
Construct a new [IndexedTxGraph] with a given index.
\n
pub fn graph(&self) -> &TxGraph<A>
Get a reference of the internal transaction graph.
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    <I as Indexer>::ChangeSet: Default + Merge,\n    A: for<'b> Anchor + for<'b> From<TxPosInBlock<'b>>,\n    I: Indexer,
Methods are available if the anchor (A) can be created from [TxPosInBlock].
\n
pub fn apply_block_relevant(\n    &mut self,\n    block: &Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Batch insert all transactions of the given block of height, filtering out those that are\nirrelevant.
\n
Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
\n
Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
\n
pub fn apply_block(\n    &mut self,\n    block: Block,\n    height: u32,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Batch insert all transactions of the given block of height.
\n
Each inserted transaction’s anchor will be constructed using [TxPosInBlock].
\n
To only insert relevant transactions, use apply_block_relevant instead.
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    A: Anchor,\n    I: Indexer,
pub fn apply_changeset(\n    &mut self,\n    changeset: ChangeSet<A, <I as Indexer>::ChangeSet>,\n)
Applies the [ChangeSet] to the [IndexedTxGraph].
\n
pub fn initial_changeset(&self) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Determines the [ChangeSet] between self and an empty [IndexedTxGraph].
\n
",0,"example_cli::KeychainTxGraph"],["
§
impl<A, I> IndexedTxGraph<A, I>
where\n    A: Anchor,\n    I: Indexer,\n    <I as Indexer>::ChangeSet: Default + Merge,
pub fn apply_update(\n    &mut self,\n    update: TxUpdate<A>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Apply an update directly.
\n
update is a [tx_graph::TxUpdate<A>] and the resultant changes is returned as [ChangeSet].
\n
pub fn apply_update_at(\n    &mut self,\n    update: TxUpdate<A>,\n    seen_at: Option<u64>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Apply the given update with an optional seen_at timestamp.
\n
seen_at represents when the update is seen (in unix seconds). It is used to determine the\nlast_seens for all transactions in the update which have no corresponding anchor(s). The\nlast_seen value is used internally to determine precedence of conflicting unconfirmed\ntransactions (where the transaction with the lower last_seen value is omitted from the\ncanonical history).
\n
Not setting a seen_at value means unconfirmed transactions introduced by this update will\nnot be part of the canonical history of transactions.
\n
Use apply_update to have the seen_at value automatically\nset to the current time.
\n
pub fn insert_txout(\n    &mut self,\n    outpoint: OutPoint,\n    txout: TxOut,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert a floating txout of given outpoint.
\n
pub fn insert_tx<T>(&mut self, tx: T) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Insert and index a transaction into the graph.
\n
pub fn insert_anchor(\n    &mut self,\n    txid: Txid,\n    anchor: A,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert an anchor for a given transaction.
\n
pub fn insert_seen_at(\n    &mut self,\n    txid: Txid,\n    seen_at: u64,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
Insert a unix timestamp of when a transaction is seen in the mempool.
\n
This is used for transaction conflict resolution in [TxGraph] where the transaction with\nthe later last-seen is prioritized.
\n
pub fn batch_insert_relevant<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, impl IntoIterator<Item = A>)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert transactions, filtering out those that are irrelevant.
\n
Relevancy is determined by the [Indexer::is_tx_relevant] implementation of I. Irrelevant\ntransactions in txs will be ignored. txs do not need to be in topological order.
\n
pub fn batch_insert_relevant_unconfirmed<T>(\n    &mut self,\n    unconfirmed_txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert unconfirmed transactions, filtering out those that are irrelevant.
\n
Relevancy is determined by the internal [Indexer::is_tx_relevant] implementation of I.\nIrrelevant transactions in txs will be ignored.
\n
Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
\n
pub fn batch_insert_unconfirmed<T>(\n    &mut self,\n    txs: impl IntoIterator<Item = (T, u64)>,\n) -> ChangeSet<A, <I as Indexer>::ChangeSet>
where\n    T: Into<Arc<Transaction>>,
Batch insert unconfirmed transactions.
\n
Items of txs are tuples containing the transaction and a last seen timestamp. The\nlast seen communicates when the transaction is last seen in the mempool which is used for\nconflict-resolution in [TxGraph] (refer to [TxGraph::insert_seen_at] for details).
\n
To filter out irrelevant transactions, use batch_insert_relevant_unconfirmed instead.
\n
",0,"example_cli::KeychainTxGraph"]]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[21409]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[20862]}
\ 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 22453aeb62..f1027ec7b4 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,9 +1,9 @@
 (function() {
-    var type_impls = Object.fromEntries([["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"],["
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"],["
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_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",[]]]);
+    var type_impls = Object.fromEntries([["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"],["
§
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"],["
§
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",[]]]);
     if (window.register_type_impls) {
         window.register_type_impls(type_impls);
     } else {
         window.pending_type_impls = type_impls;
     }
 })()
-//{"start":55,"fragment_lengths":[18153,3990,18,19]}
\ No newline at end of file
+//{"start":55,"fragment_lengths":[17691,3990,18,19]}
\ No newline at end of file