Enum bdk_chain::keychain::InsertDescriptorError

source Â·

pub enum InsertDescriptorError<K> {
+InsertDescriptorError in bdk_chain::keychain - Rust
bdk_chain0.16.0
InsertDescriptorError
Variants
DescriptorAlreadyAssigned
KeychainAlreadyAssigned
Trait Implementations
Clone
Debug
Display
Error
PartialEq
StructuralPartialEq
Auto Trait Implementations
!Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::keychain
Enum bdk_chain::keychain::InsertDescriptorError
source Â· 
pub enum InsertDescriptorError<K> {
     DescriptorAlreadyAssigned {
         descriptor: Descriptor<DescriptorPublicKey>,
         existing_assignment: K,
@@ -14,9 +14,9 @@

Â§KeychainAlreadyAssigned

The keychain is already assigned to a descriptor so you canât reassign it

`Fields`

Â§keychain: KThe keychain that you have attempted to reassign

Â§existing_assignment: Descriptor<DescriptorPublicKey>The descriptor that the keychain is already assigned to
-

`Trait ImplementationsÂ§`

sourceÂ§impl<K: Clone> Clone for InsertDescriptorError<K>

sourceÂ§fn clone(&self) -> InsertDescriptorError<K>

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<K: Debug> Debug for InsertDescriptorError<K>

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

Formats the value using the given formatter. Read more

sourceÂ§impl<K: Debug> Display for InsertDescriptorError<K>

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

Formats the value using the given formatter. Read more

sourceÂ§impl<K: Debug> Error for InsertDescriptorError<K>

1.30.0 Â· sourceÂ§fn source(&self) -> Option<&(dyn Error + 'static)>

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

1.0.0 Â· sourceÂ§fn description(&self) -> &str

ðDeprecated since 1.42.0: use the Display impl or to_string() Read more

1.0.0 Â· sourceÂ§fn cause(&self) -> Option<&dyn Error>

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

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

ð¬This is a nightly-only experimental API. (error_generic_member_access)Provides type based access to context intended for error reports. Read more

sourceÂ§impl<K: PartialEq> PartialEq for InsertDescriptorError<K>

sourceÂ§fn eq(&self, other: &InsertDescriptorError<K>) -> bool

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

`Trait ImplementationsÂ§`

sourceÂ§impl<K: Clone> Clone for InsertDescriptorError<K>

sourceÂ§fn clone(&self) -> InsertDescriptorError<K>

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<K: Debug> Debug for InsertDescriptorError<K>

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

Formats the value using the given formatter. Read more

sourceÂ§impl<K: Debug> Display for InsertDescriptorError<K>

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

Formats the value using the given formatter. Read more

sourceÂ§impl<K: Debug> Error for InsertDescriptorError<K>

1.30.0 Â· sourceÂ§fn source(&self) -> Option<&(dyn Error + 'static)>

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

1.0.0 Â· sourceÂ§fn description(&self) -> &str

ðDeprecated since 1.42.0: use the Display impl or to_string() Read more

1.0.0 Â· sourceÂ§fn cause(&self) -> Option<&dyn Error>

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

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

ð¬This is a nightly-only experimental API. (error_generic_member_access)Provides type based access to context intended for error reports. Read more

sourceÂ§impl<K: PartialEq> PartialEq for InsertDescriptorError<K>

sourceÂ§fn eq(&self, other: &InsertDescriptorError<K>) -> bool

This method tests for self and other values to be equal, and is used
 by ==.

1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.

sourceÂ§impl<K> StructuralPartialEq for InsertDescriptorError<K>

`Auto Trait ImplementationsÂ§`

Â§impl<K> !Freeze for InsertDescriptorError<K>

Â§impl<K> RefUnwindSafe for InsertDescriptorError<K>where
+sufficient, and should not be overridden without very good reason.

sourceÂ§impl<K> StructuralPartialEq for InsertDescriptorError<K>

`Auto Trait ImplementationsÂ§`

Â§impl<K> !Freeze for InsertDescriptorError<K>

Â§impl<K> RefUnwindSafe for InsertDescriptorError<K>where
     K: RefUnwindSafe,

Â§impl<K> Send for InsertDescriptorError<K>where
     K: Send,

Â§impl<K> Sync for InsertDescriptorError<K>where
     K: Sync,

Â§impl<K> Unpin for InsertDescriptorError<K>where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.ChangeSet.html
index 8e54a0c4f4..234d66e376 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.ChangeSet.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.ChangeSet.html
@@ -1,4 +1,4 @@
-ChangeSet in bdk_chain::keychain - Rust
bdk_chain0.16.0
ChangeSet
Fields
keychains_added
last_revealed
Trait Implementations
Append
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<K>>
From<ChangeSet<K>>
PartialEq
Serialize
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
DeserializeOwned
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::keychain
Struct bdk_chain::keychain::ChangeSet
source Â· 
pub struct ChangeSet<K> {
+ChangeSet in bdk_chain::keychain - Rust
bdk_chain0.16.0
ChangeSet
Fields
keychains_added
last_revealed
Trait Implementations
Append
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<K>>
From<ChangeSet<K>>
PartialEq
Serialize
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
DeserializeOwned
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::keychain
Struct bdk_chain::keychain::ChangeSet
source Â· 
pub struct ChangeSet<K> {
     pub keychains_added: BTreeMap<K, Descriptor<DescriptorPublicKey>>,
     pub last_revealed: BTreeMap<DescriptorId, u32>,
 }
Expand description
Represents updates to the derivation index of a KeychainTxOutIndex.
@@ -9,17 +9,17 @@ It maps each keychain K to a descriptor and its last revealed index
 same one-to-one keychain <-> descriptor mapping invariant as KeychainTxOutIndex itself.
 
FieldsÂ§
Â§keychains_added: BTreeMap<K, Descriptor<DescriptorPublicKey>>Contains the keychains that have been added and their respective descriptor
 
Â§last_revealed: BTreeMap<DescriptorId, u32>Contains for each descriptor_id the last revealed index of derivation
-
Trait ImplementationsÂ§
sourceÂ§impl<K: Ord> Append for ChangeSet<K>
sourceÂ§fn append(&mut self, other: Self)
Merge another ChangeSet<K> into self.
+
Trait ImplementationsÂ§
sourceÂ§impl<K: Ord> Append for ChangeSet<K>
sourceÂ§fn append(&mut self, other: Self)
Merge another ChangeSet<K> into self.
 For the keychains_added field this method respects the invariants of
 insert_descriptor. last_revealed always becomes the larger of the two.
-
sourceÂ§fn is_empty(&self) -> bool
Returns whether the changeset are empty.
-
sourceÂ§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<K: Clone> Clone for ChangeSet<K>
sourceÂ§fn clone(&self) -> ChangeSet<K>
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<K: Debug> Debug for ChangeSet<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K> Default for ChangeSet<K>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<'de, K> Deserialize<'de> for ChangeSet<K>where
-    K: Ord + Deserialize<'de>,
sourceÂ§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
-    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl<A, K> From<ChangeSet<K>> for ChangeSet<A, ChangeSet<K>>
sourceÂ§fn from(indexer: ChangeSet<K>) -> Self
Converts to this type from the input type.
sourceÂ§impl<K, A> From<ChangeSet<K>> for CombinedChangeSet<K, A>
sourceÂ§fn from(indexer: ChangeSet<K>) -> Self
Converts to this type from the input type.
sourceÂ§impl<K: PartialEq> PartialEq for ChangeSet<K>
sourceÂ§fn eq(&self, other: &ChangeSet<K>) -> bool
This method tests for self and other values to be equal, and is used
+
sourceÂ§fn is_empty(&self) -> bool
Returns whether the changeset are empty.
+
sourceÂ§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<K: Clone> Clone for ChangeSet<K>
sourceÂ§fn clone(&self) -> ChangeSet<K>
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<K: Debug> Debug for ChangeSet<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K> Default for ChangeSet<K>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<'de, K> Deserialize<'de> for ChangeSet<K>where
+    K: Ord + Deserialize<'de>,
sourceÂ§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl<A, K> From<ChangeSet<K>> for ChangeSet<A, ChangeSet<K>>
sourceÂ§fn from(indexer: ChangeSet<K>) -> Self
Converts to this type from the input type.
sourceÂ§impl<K, A> From<ChangeSet<K>> for CombinedChangeSet<K, A>
sourceÂ§fn from(indexer: ChangeSet<K>) -> Self
Converts to this type from the input type.
sourceÂ§impl<K: PartialEq> PartialEq for ChangeSet<K>
sourceÂ§fn eq(&self, other: &ChangeSet<K>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
sourceÂ§impl<K> Serialize for ChangeSet<K>where
-    K: Ord + Serialize,
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<K> StructuralPartialEq for ChangeSet<K>
Auto Trait ImplementationsÂ§
Â§impl<K> Freeze for ChangeSet<K>
Â§impl<K> RefUnwindSafe for ChangeSet<K>where
+sufficient, and should not be overridden without very good reason.
sourceÂ§impl<K> Serialize for ChangeSet<K>where
+    K: Ord + Serialize,
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<K> StructuralPartialEq for ChangeSet<K>
Auto Trait ImplementationsÂ§
Â§impl<K> Freeze for ChangeSet<K>
Â§impl<K> RefUnwindSafe for ChangeSet<K>where
     K: RefUnwindSafe,
Â§impl<K> Send for ChangeSet<K>where
     K: Send,
Â§impl<K> Sync for ChangeSet<K>where
     K: Sync,
Â§impl<K> Unpin for ChangeSet<K>
Â§impl<K> UnwindSafe for ChangeSet<K>where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.KeychainTxOutIndex.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.KeychainTxOutIndex.html
index 3b2e214632..4d98d6f5b1 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.KeychainTxOutIndex.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.KeychainTxOutIndex.html
@@ -120,10 +120,10 @@ spent must have already been scanned by the index. Calculating received just use
 takes from the transaction outputs in the index. Shorthand for calling
 sent_and_received and subtracting sent from received.
 This calls SpkTxOutIndex::net_value internally.
-
sourceÂ§impl<K: Clone + Ord + Debug> KeychainTxOutIndex<K>
sourcepub fn keychains(
+
sourceÂ§impl<K: Clone + Ord + Debug> KeychainTxOutIndex<K>
sourcepub fn keychains(
     &self
 ) -> impl DoubleEndedIterator<Item = (&K, &Descriptor<DescriptorPublicKey>)> + ExactSizeIterator + '_
Return all keychains and their corresponding descriptors.
-
sourcepub fn insert_descriptor(
+
sourcepub fn insert_descriptor(
     &mut self,
     keychain: K,
     descriptor: Descriptor<DescriptorPublicKey>
@@ -133,42 +133,48 @@ txout index will discover transaction outputs with those script pubkeys (once th
 derived and added to the index).
 keychain <-> descriptor is a one-to-one mapping that cannot be changed. Attempting to do so
 will return a InsertDescriptorError<K>.
-
sourcepub fn get_descriptor(
+[KeychainTxOutIndex] will prevent you from inserting two descriptors which derive the same
+script pubkey at index 0, but itâs up to you to ensure that descriptors donât collide at
+other indices. If they do nothing catastrophic happens at the KeychainTxOutIndex level
+(one keychain just becomes the defacto owner of that spk arbitrarily) but this may have
+subtle implications up the application stack like one UTXO being missing from one keychain
+because it has been assigned to another which produces the same script pubkey.
+
sourcepub fn get_descriptor(
     &self,
     keychain: &K
 ) -> Option<&Descriptor<DescriptorPublicKey>>
Gets the descriptor associated with the keychain. Returns None if the keychain doesnât
 have a descriptor associated with it.

-
sourcepub fn lookahead(&self) -> u32
Get the lookahead setting.

+
sourcepub fn lookahead(&self) -> u32
Get the lookahead setting.

 Refer to new for more information on the lookahead.
-
sourcepub fn lookahead_to_target(&mut self, keychain: &K, target_index: u32)
Store lookahead scripts until target_index (inclusive).

+
sourcepub fn lookahead_to_target(&mut self, keychain: &K, target_index: u32)
Store lookahead scripts until target_index (inclusive).

 This does not change the global lookahead setting.
-
sourcepub fn unbounded_spk_iter(
+

sourcepub fn unbounded_spk_iter(
     &self,
     keychain: &K
 ) -> Option<SpkIterator<Descriptor<DescriptorPublicKey>>>

Get an unbounded spk iterator over a given keychain. Returns None if the provided keychain doesnât exist

sourcepub fn all_unbounded_spk_iters(
+

sourcepub fn all_unbounded_spk_iters(
     &self
 ) -> BTreeMap<K, SpkIterator<Descriptor<DescriptorPublicKey>>>

Get unbounded spk iterators for all keychains.

sourcepub fn revealed_spks(
+

sourcepub fn revealed_spks(
     &self,
     range: impl RangeBounds<K>
 ) -> impl Iterator<Item = KeychainIndexed<K, &Script>>

Iterate over revealed spks of keychains in range

sourcepub fn revealed_keychain_spks<'a>(
+

sourcepub fn revealed_keychain_spks<'a>(
     &'a self,
     keychain: &'a K
 ) -> impl DoubleEndedIterator<Item = Indexed<&Script>> + 'a

Iterate over revealed spks of the given keychain with ascending indices.


 This is a double ended iterator so you can easily reverse it to get an iterator where
 the script pubkeys that were most recently revealed are first.
-

sourcepub fn unused_spks(
+

sourcepub fn unused_spks(
     &self
 ) -> impl DoubleEndedIterator<Item = KeychainIndexed<K, &Script>> + Clone

Iterate over revealed, but unused, spks of all keychains.

sourcepub fn unused_keychain_spks(
+

sourcepub fn unused_keychain_spks(
     &self,
     keychain: &K
 ) -> impl DoubleEndedIterator<Item = Indexed<&Script>> + Clone

Iterate over revealed, but unused, spks of the given keychain. Returns an empty iterator if the provided keychain doesnât exist.

sourcepub fn next_index(&self, keychain: &K) -> Option<(u32, bool)>

Get the next derivation index for keychain. The next index is the index after the last revealed +

sourcepub fn next_index(&self, keychain: &K) -> Option<(u32, bool)>

Get the next derivation index for keychain. The next index is the index after the last revealed derivation index.


 The second field in the returned tuple represents whether the next derivation index is new.
 There are two scenarios where the next derivation index is reused (not new):
@@ -178,15 +184,15 @@ There are two scenarios where the next derivation index is reused (not new):
 
 Not checking the second field of the tuple may result in address reuse.
 Returns None if the provided keychain doesnât exist.
-

sourcepub fn last_revealed_indices(&self) -> BTreeMap<K, u32>

Get the last derivation index that is revealed for each keychain.

sourcepub fn last_revealed_indices(&self) -> BTreeMap<K, u32>

Get the last derivation index that is revealed for each keychain.


 Keychains with no revealed indices will not be included in the returned BTreeMap.
-

sourcepub fn last_revealed_index(&self, keychain: &K) -> Option<u32>

Get the last derivation index revealed for keychain. Returns None if the keychain doesnât +

sourcepub fn last_revealed_index(&self, keychain: &K) -> Option<u32>

Get the last derivation index revealed for keychain. Returns None if the keychain doesnât exist, or if the keychain doesnât have any revealed scripts.

sourcepub fn reveal_to_target_multi(
+

sourcepub fn reveal_to_target_multi(
     &mut self,
     keychains: &BTreeMap<K, u32>
 ) -> ChangeSet<K>

Convenience method to call Self::reveal_to_target on multiple keychains.

sourcepub fn reveal_to_target(
+

sourcepub fn reveal_to_target(
     &mut self,
     keychain: &K,
     target_index: u32
@@ -199,7 +205,7 @@ reveal up to the last possible index.
 ChangeSet, which reports updates to the latest revealed index. If no new script
 pubkeys are revealed, then both of these will be empty.
 Returns None if the provided keychain doesnât exist.
-

sourcepub fn reveal_next_spk(
+

sourcepub fn reveal_next_spk(
     &mut self,
     keychain: &K
 ) -> Option<(Indexed<ScriptBuf>, ChangeSet<K>)>

Attempts to reveal the next script pubkey for keychain.


@@ -213,7 +219,7 @@ Returns None if the provided keychain doesnât exist.
 The descriptor has already revealed scripts up to the numeric bound.
 There is no descriptor associated with the given keychain.
 
-

sourcepub fn next_unused_spk(
+

sourcepub fn next_unused_spk(
     &mut self,
     keychain: &K
 ) -> Option<(Indexed<ScriptBuf>, ChangeSet<K>)>

Gets the next unused script pubkey in the keychain. I.e., the script pubkey with the lowest @@ -224,20 +230,20 @@ has used all scripts up to the derivation bounds, then the last derived script p returned.


 Returns None if there are no script pubkeys that have been used and no new script pubkey
 could be revealed (see reveal_next_spk for when this happens).
-

sourcepub fn keychain_outpoints<'a>(
+

sourcepub fn keychain_outpoints<'a>(
     &'a self,
     keychain: &'a K
 ) -> impl DoubleEndedIterator<Item = Indexed<OutPoint>> + 'a

Iterate over all [OutPoint]s that have TxOuts with script pubkeys derived from keychain.

sourcepub fn keychain_outpoints_in_range<'a>(
+

sourcepub fn keychain_outpoints_in_range<'a>(
     &'a self,
     range: impl RangeBounds<K> + 'a
 ) -> impl DoubleEndedIterator<Item = KeychainIndexed<K, OutPoint>> + 'a

Iterate over [OutPoint]s that have script pubkeys derived from keychains in range.

sourcepub fn last_used_index(&self, keychain: &K) -> Option<u32>

Returns the highest derivation index of the keychain where KeychainTxOutIndex has +

sourcepub fn last_used_index(&self, keychain: &K) -> Option<u32>

Returns the highest derivation index of the keychain where KeychainTxOutIndex has found a [TxOut] with itâs script pubkey.

sourcepub fn last_used_indices(&self) -> BTreeMap<K, u32>

Returns the highest derivation index of each keychain that KeychainTxOutIndex has found +

sourcepub fn last_used_indices(&self) -> BTreeMap<K, u32>

Returns the highest derivation index of each keychain that KeychainTxOutIndex has found a [TxOut] with itâs script pubkey.

sourcepub fn apply_changeset(&mut self, changeset: ChangeSet<K>)

Applies the ChangeSet<K> to the KeychainTxOutIndex<K>

sourcepub fn apply_changeset(&mut self, changeset: ChangeSet<K>)

Applies the ChangeSet<K> to the KeychainTxOutIndex<K>


 Keychains added by the keychains_added field of ChangeSet<K> respect the one-to-one
 keychain <-> descriptor invariant by silently ignoring attempts to violate it (but will
 panic if debug_assertions are enabled).
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.NoSuchKeychain.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.NoSuchKeychain.html
index 4e7fbadb55..26ff821763 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.NoSuchKeychain.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/keychain/struct.NoSuchKeychain.html
@@ -1,7 +1,7 @@
-NoSuchKeychain in bdk_chain::keychain - Rust
bdk_chain0.16.0
NoSuchKeychain
Trait Implementations
Clone
Debug
Display
Eq
PartialEq
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::keychain
Struct bdk_chain::keychain::NoSuchKeychain
source Â· 
pub struct NoSuchKeychain<K>(/* private fields */);
Expand description
The keychain doesnât exist. Most likley hasnât been inserted with KeychainTxOutIndex::insert_descriptor.
-
Trait ImplementationsÂ§
sourceÂ§impl<K: Clone> Clone for NoSuchKeychain<K>
sourceÂ§fn clone(&self) -> NoSuchKeychain<K>
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<K: Debug> Debug for NoSuchKeychain<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K: Debug> Display for NoSuchKeychain<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K: PartialEq> PartialEq for NoSuchKeychain<K>
sourceÂ§fn eq(&self, other: &NoSuchKeychain<K>) -> bool
This method tests for self and other values to be equal, and is used
+NoSuchKeychain in bdk_chain::keychain - Rust
bdk_chain0.16.0
NoSuchKeychain
Trait Implementations
Clone
Debug
Display
Eq
PartialEq
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::keychain
Struct bdk_chain::keychain::NoSuchKeychain
source Â· 
pub struct NoSuchKeychain<K>(/* private fields */);
Expand description
The keychain doesnât exist. Most likley hasnât been inserted with KeychainTxOutIndex::insert_descriptor.
+
Trait ImplementationsÂ§
sourceÂ§impl<K: Clone> Clone for NoSuchKeychain<K>
sourceÂ§fn clone(&self) -> NoSuchKeychain<K>
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<K: Debug> Debug for NoSuchKeychain<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K: Debug> Display for NoSuchKeychain<K>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<K: PartialEq> PartialEq for NoSuchKeychain<K>
sourceÂ§fn eq(&self, other: &NoSuchKeychain<K>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
sourceÂ§impl<K: Eq> Eq for NoSuchKeychain<K>
sourceÂ§impl<K> StructuralPartialEq for NoSuchKeychain<K>
Auto Trait ImplementationsÂ§
Â§impl<K> Freeze for NoSuchKeychain<K>where
+sufficient, and should not be overridden without very good reason.
sourceÂ§impl<K: Eq> Eq for NoSuchKeychain<K>
sourceÂ§impl<K> StructuralPartialEq for NoSuchKeychain<K>
Auto Trait ImplementationsÂ§
Â§impl<K> Freeze for NoSuchKeychain<K>where
     K: Freeze,
Â§impl<K> RefUnwindSafe for NoSuchKeychain<K>where
     K: RefUnwindSafe,
Â§impl<K> Send for NoSuchKeychain<K>where
     K: Send,
Â§impl<K> Sync for NoSuchKeychain<K>where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html
index 3ef50c0ac1..0a9d7a6ac8 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/struct.DescriptorId.html
@@ -1,32 +1,31 @@
-DescriptorId in bdk_chain - Rust
bdk_chain0.16.0
DescriptorId
Tuple Fields
0
Methods
as_raw_hash
from_raw_hash
to_raw_hash
Trait Implementations
AsRef<[u8; 32]>
AsRef<[u8]>
Borrow<[u8]>
Clone
Copy
Debug
Deserialize<'de>
Display
Eq
From<DescriptorId>
From<Hash>
FromStr
Hash
Hash
Index<I>
LowerHex
Ord
PartialEq
PartialOrd
SerdeHash
Serialize
StructuralPartialEq
UpperHex
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
DeserializeOwned
From<T>
Into<U>
ToOwned
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In crate bdk_chain
Struct bdk_chain::DescriptorId
source Â· 
pub struct DescriptorId(pub Hash);
Expand description
Represents the ID of a descriptor, defined as the sha256 hash of
-the descriptor string, checksum excluded.
+DescriptorId in bdk_chain - Rust
bdk_chain0.16.0
DescriptorId
Tuple Fields
0
Methods
as_raw_hash
from_raw_hash
to_raw_hash
Trait Implementations
AsRef<[u8; 32]>
AsRef<[u8]>
Borrow<[u8]>
Clone
Copy
Debug
Deserialize<'de>
Display
Eq
From<DescriptorId>
From<Hash>
FromStr
Hash
Hash
Index<I>
LowerHex
Ord
PartialEq
PartialOrd
SerdeHash
Serialize
StructuralPartialEq
UpperHex
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
DeserializeOwned
From<T>
Into<U>
ToOwned
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In crate bdk_chain
Struct bdk_chain::DescriptorId
source Â· 
pub struct DescriptorId(pub Hash);
Expand description
Represents the unique ID of a descriptor.
 This is useful for having a fixed-length unique representation of a descriptor,
 in particular, we use it to persist application state changes related to the
 descriptor without having to re-write the whole descriptor each time.
-
Tuple FieldsÂ§
Â§0: HashImplementationsÂ§
sourceÂ§impl DescriptorId
sourcepub fn from_raw_hash(inner: Hash) -> DescriptorId
Creates this wrapper type from the inner hash type.
-
sourcepub fn to_raw_hash(self) -> Hash
Returns the inner hash (sha256, sh256d etc.).
-
sourcepub fn as_raw_hash(&self) -> &Hash
Returns a reference to the inner hash (sha256, sh256d etc.).
-
Trait ImplementationsÂ§
sourceÂ§impl AsRef<[u8]> for DescriptorId
sourceÂ§fn as_ref(&self) -> &[u8] â
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl AsRef<[u8; 32]> for DescriptorId
sourceÂ§fn as_ref(&self) -> &[u8; 32]
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl Borrow<[u8]> for DescriptorId
sourceÂ§fn borrow(&self) -> &[u8] â
Immutably borrows from an owned value. Read more
sourceÂ§impl Clone for DescriptorId
sourceÂ§fn clone(&self) -> DescriptorId
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 DescriptorId
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<'de> Deserialize<'de> for DescriptorId
sourceÂ§fn deserialize<D: Deserializer<'de>>(d: D) -> Result<DescriptorId, D::Error>
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl Display for DescriptorId
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl From<DescriptorId> for Hash
sourceÂ§fn from(hashtype: DescriptorId) -> Hash
Converts to this type from the input type.
sourceÂ§impl From<Hash> for DescriptorId
sourceÂ§fn from(inner: Hash) -> DescriptorId
Converts to this type from the input type.
sourceÂ§impl FromStr for DescriptorId
Â§type Err = HexToArrayError
The associated error which can be returned from parsing.
sourceÂ§fn from_str(s: &str) -> Result<DescriptorId, Self::Err>
Parses a string s to return a value of this type. Read more
sourceÂ§impl Hash for DescriptorId
sourceÂ§fn hash<__H: Hasher>(&self, state: &mut __H)
Feeds this value into the given Hasher. Read more
1.3.0 Â· sourceÂ§fn hash_slice<H>(data: &[Self], state: &mut H)where
+
Tuple FieldsÂ§
Â§0: HashImplementationsÂ§
sourceÂ§impl DescriptorId
sourcepub fn from_raw_hash(inner: Hash) -> DescriptorId
Creates this wrapper type from the inner hash type.
+
sourcepub fn to_raw_hash(self) -> Hash
Returns the inner hash (sha256, sh256d etc.).
+
sourcepub fn as_raw_hash(&self) -> &Hash
Returns a reference to the inner hash (sha256, sh256d etc.).
+
Trait ImplementationsÂ§
sourceÂ§impl AsRef<[u8]> for DescriptorId
sourceÂ§fn as_ref(&self) -> &[u8] â
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl AsRef<[u8; 32]> for DescriptorId
sourceÂ§fn as_ref(&self) -> &[u8; 32]
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl Borrow<[u8]> for DescriptorId
sourceÂ§fn borrow(&self) -> &[u8] â
Immutably borrows from an owned value. Read more
sourceÂ§impl Clone for DescriptorId
sourceÂ§fn clone(&self) -> DescriptorId
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 DescriptorId
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<'de> Deserialize<'de> for DescriptorId
sourceÂ§fn deserialize<D: Deserializer<'de>>(d: D) -> Result<DescriptorId, D::Error>
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl Display for DescriptorId
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl From<DescriptorId> for Hash
sourceÂ§fn from(hashtype: DescriptorId) -> Hash
Converts to this type from the input type.
sourceÂ§impl From<Hash> for DescriptorId
sourceÂ§fn from(inner: Hash) -> DescriptorId
Converts to this type from the input type.
sourceÂ§impl FromStr for DescriptorId
Â§type Err = HexToArrayError
The associated error which can be returned from parsing.
sourceÂ§fn from_str(s: &str) -> Result<DescriptorId, Self::Err>
Parses a string s to return a value of this type. Read more
sourceÂ§impl Hash for DescriptorId
sourceÂ§fn hash<__H: Hasher>(&self, state: &mut __H)
Feeds this value into the given Hasher. Read more
1.3.0 Â· sourceÂ§fn hash_slice<H>(data: &[Self], state: &mut H)where
     H: Hasher,
-    Self: Sized,
Feeds a slice of this type into the given Hasher. Read more
sourceÂ§impl Hash for DescriptorId
Â§type Engine = <Hash as Hash>::Engine
A hashing engine which bytes can be serialized into. It is expected
+    Self: Sized,
Feeds a slice of this type into the given Hasher. Read more

sourceÂ§impl Hash for DescriptorId

Â§type Engine = <Hash as Hash>::Engine

A hashing engine which bytes can be serialized into. It is expected
 to implement the io::Write trait, and to never return errors under
-any conditions.

Â§type Bytes = <Hash as Hash>::Bytes

The byte array that represents the hash internally.

sourceÂ§const LEN: usize = 32usize

Length of the hash, in bytes.

sourceÂ§const DISPLAY_BACKWARD: bool = false

Flag indicating whether user-visible serializations of this hash
+any conditions.

Â§type Bytes = <Hash as Hash>::Bytes

The byte array that represents the hash internally.

sourceÂ§const LEN: usize = 32usize

Length of the hash, in bytes.

sourceÂ§const DISPLAY_BACKWARD: bool = false

Flag indicating whether user-visible serializations of this hash
 should be backward. For some reason Satoshi decided this should be
-true for Sha256dHash, so here we are.

sourceÂ§fn engine() -> Self::Engine

Constructs a new engine.

sourceÂ§fn from_engine(e: Self::Engine) -> Self

Produces a hash from the current state of a given engine.

sourceÂ§fn from_slice(sl: &[u8]) -> Result<DescriptorId, FromSliceError>

Copies a byte slice into a hash object.

sourceÂ§fn from_byte_array(bytes: Self::Bytes) -> Self

Constructs a hash from the underlying byte array.

sourceÂ§fn to_byte_array(self) -> Self::Bytes

Returns the underlying byte array.

sourceÂ§fn as_byte_array(&self) -> &Self::Bytes

Returns a reference to the underlying byte array.

sourceÂ§fn all_zeros() -> Self

Returns an all zero hash. Read more

Â§fn hash(data: &[u8]) -> Self

Hashes some bytes.

Â§fn hash_byte_chunks<B, I>(byte_slices: I) -> Selfwhere
+true for Sha256dHash, so here we are.

sourceÂ§fn engine() -> Self::Engine

Constructs a new engine.

sourceÂ§fn from_engine(e: Self::Engine) -> Self

Produces a hash from the current state of a given engine.

sourceÂ§fn from_slice(sl: &[u8]) -> Result<DescriptorId, FromSliceError>

Copies a byte slice into a hash object.

sourceÂ§fn from_byte_array(bytes: Self::Bytes) -> Self

Constructs a hash from the underlying byte array.

sourceÂ§fn to_byte_array(self) -> Self::Bytes

Returns the underlying byte array.

sourceÂ§fn as_byte_array(&self) -> &Self::Bytes

Returns a reference to the underlying byte array.

sourceÂ§fn all_zeros() -> Self

Returns an all zero hash. Read more

Â§fn hash(data: &[u8]) -> Self

Hashes some bytes.

Â§fn hash_byte_chunks<B, I>(byte_slices: I) -> Selfwhere
     B: AsRef<[u8]>,
-    I: IntoIterator<Item = B>,

Hashes all the byte slices retrieved from the iterator together.

sourceÂ§impl<I: SliceIndex<[u8]>> Index<I> for DescriptorId

Â§type Output = <I as SliceIndex<[u8]>>::Output

The returned type after indexing.

sourceÂ§fn index(&self, index: I) -> &Self::Output

Performs the indexing (container[index]) operation. Read more

sourceÂ§impl LowerHex for DescriptorId

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

Formats the value using the given formatter. Read more

sourceÂ§impl Ord for DescriptorId

sourceÂ§fn cmp(&self, other: &DescriptorId) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 Â· sourceÂ§fn max(self, other: Self) -> Selfwhere
+    I: IntoIterator<Item = B>,

Hashes all the byte slices retrieved from the iterator together.

sourceÂ§impl<I: SliceIndex<[u8]>> Index<I> for DescriptorId

Â§type Output = <I as SliceIndex<[u8]>>::Output

The returned type after indexing.

sourceÂ§fn index(&self, index: I) -> &Self::Output

Performs the indexing (container[index]) operation. Read more

sourceÂ§impl LowerHex for DescriptorId

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

Formats the value using the given formatter. Read more

sourceÂ§impl Ord for DescriptorId

sourceÂ§fn cmp(&self, other: &DescriptorId) -> Ordering

This method returns an Ordering between self and other. Read more

1.21.0 Â· sourceÂ§fn max(self, other: Self) -> Selfwhere
     Self: Sized,

Compares and returns the maximum of two values. Read more

1.21.0 Â· sourceÂ§fn min(self, other: Self) -> Selfwhere
     Self: Sized,

Compares and returns the minimum of two values. Read more

1.50.0 Â· sourceÂ§fn clamp(self, min: Self, max: Self) -> Selfwhere
-    Self: Sized + PartialOrd,

Restrict a value to a certain interval. Read more

sourceÂ§impl PartialEq for DescriptorId

sourceÂ§fn eq(&self, other: &DescriptorId) -> bool

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

Restrict a value to a certain interval. Read more

sourceÂ§impl PartialEq for DescriptorId

sourceÂ§fn eq(&self, other: &DescriptorId) -> bool

This method tests for self and other values to be equal, and is used
 by ==.

1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.

sourceÂ§impl PartialOrd for DescriptorId

sourceÂ§fn partial_cmp(&self, other: &DescriptorId) -> Option<Ordering>

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

1.0.0 Â· sourceÂ§fn lt(&self, other: &Rhs) -> bool

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

1.0.0 Â· sourceÂ§fn le(&self, other: &Rhs) -> bool

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

sourceÂ§impl PartialOrd for DescriptorId

sourceÂ§fn partial_cmp(&self, other: &DescriptorId) -> Option<Ordering>

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

1.0.0 Â· sourceÂ§fn lt(&self, other: &Rhs) -> bool

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

1.0.0 Â· sourceÂ§fn le(&self, other: &Rhs) -> bool

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

1.0.0 Â· sourceÂ§fn gt(&self, other: &Rhs) -> bool

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

1.0.0 Â· sourceÂ§fn ge(&self, other: &Rhs) -> bool

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

sourceÂ§impl SerdeHash for DescriptorId

sourceÂ§const N: usize = 32usize

Size, in bits, of the hash.

sourceÂ§fn from_slice_delegated(sl: &[u8]) -> Result<Self, FromSliceError>

Helper function to turn a deserialized slice into the correct hash type.

Â§fn serialize<S>(
+operator. Read more

sourceÂ§impl SerdeHash for DescriptorId

sourceÂ§const N: usize = 32usize

Size, in bits, of the hash.

sourceÂ§fn from_slice_delegated(sl: &[u8]) -> Result<Self, FromSliceError>

Helper function to turn a deserialized slice into the correct hash type.

Â§fn serialize<S>(
     &self,
     s: S
 ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where
     S: Serializer,

Do serde serialization.

Â§fn deserialize<'de, D>(d: D) -> Result<Self, <D as Deserializer<'de>>::Error>where
-    D: Deserializer<'de>,

Do serde deserialization.

sourceÂ§impl Serialize for DescriptorId

sourceÂ§fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer. Read more

sourceÂ§impl UpperHex for DescriptorId

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

Formats the value using the given formatter. Read more

sourceÂ§impl Copy for DescriptorId

sourceÂ§impl Eq for DescriptorId

sourceÂ§impl StructuralPartialEq for DescriptorId

`Auto Trait ImplementationsÂ§`

Â§impl Freeze for DescriptorId

Â§impl RefUnwindSafe for DescriptorId

Â§impl Send for DescriptorId

Â§impl Sync for DescriptorId

Â§impl Unpin for DescriptorId

Â§impl UnwindSafe for DescriptorId

`Blanket ImplementationsÂ§`

sourceÂ§impl<T> Any for Twhere
+    D: Deserializer<'de>,

Do serde deserialization.

sourceÂ§impl Serialize for DescriptorId

sourceÂ§fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer. Read more

sourceÂ§impl UpperHex for DescriptorId

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

Formats the value using the given formatter. Read more

sourceÂ§impl Copy for DescriptorId

sourceÂ§impl Eq for DescriptorId

sourceÂ§impl StructuralPartialEq for DescriptorId

`Auto Trait ImplementationsÂ§`

Â§impl Freeze for DescriptorId

Â§impl RefUnwindSafe for DescriptorId

Â§impl Send for DescriptorId

Â§impl Sync for DescriptorId

Â§impl Unpin for DescriptorId

Â§impl UnwindSafe for DescriptorId

`Blanket ImplementationsÂ§`

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

sourceÂ§fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

sourceÂ§impl<T> Borrow<T> for Twhere
     T: ?Sized,

sourceÂ§fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

sourceÂ§impl<T> BorrowMut<T> for Twhere
     T: ?Sized,

sourceÂ§fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

sourceÂ§impl<T> From<T> for T

sourceÂ§fn from(t: T) -> T

Returns the argument unchanged.


diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Append.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Append.html
index b5144ce3ce..026ab45beb 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Append.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/trait.Append.html
@@ -75,4 +75,4 @@
     T7: Append,
     T8: Append,
     T9: Append,
-    T10: Append,

sourceÂ§fn append(&mut self, _other: Self)

sourceÂ§fn is_empty(&self) -> bool

sourceÂ§impl<T> Append for Vec<T>

sourceÂ§fn append(&mut self, other: Self)

sourceÂ§fn is_empty(&self) -> bool

sourceÂ§impl<T: Ord> Append for BTreeSet<T>

sourceÂ§fn append(&mut self, other: Self)

sourceÂ§fn is_empty(&self) -> bool

`ImplementorsÂ§`

sourceÂ§impl<A: Ord> Append for bdk_chain::tx_graph::ChangeSet<A>

sourceÂ§impl<A: Anchor, IA: Append> Append for bdk_chain::indexed_tx_graph::ChangeSet<A, IA>

sourceÂ§impl<K: Ord> Append for bdk_chain::keychain::ChangeSet<K>

sourceÂ§impl<K: Ord, A: Anchor> Append for CombinedChangeSet<K, A>

Type Alias bdk_wallet::wallet::ChangeSet

source Â·

pub type ChangeSet = CombinedChangeSet<KeychainKind, ConfirmationTimeHeightAnchor>;

Expand description

The changes made to a wallet by applying an Update.

+ChangeSet in bdk_wallet::wallet - Rust

Type Alias bdk_wallet::wallet::ChangeSet

source Â·

pub type ChangeSet = CombinedChangeSet<KeychainKind, ConfirmationTimeHeightAnchor>;

Expand description

The changes made to a wallet by applying an Update.

Aliased TypeÂ§

struct ChangeSet {
     pub chain: BTreeMap<u32, Option<BlockHash>>,
     pub indexed_tx_graph: ChangeSet<ConfirmationTimeHeightAnchor, ChangeSet<KeychainKind>>,
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_chain/bdk_chain-desc-0-.js b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_chain/bdk_chain-desc-0-.js
index d2770e14a8..b2b38deb4e 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_chain/bdk_chain-desc-0-.js
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/search.desc/bdk_chain/bdk_chain-desc-0-.js
@@ -1 +1 @@
-searchState.loadedDescShard("bdk_chain", 0, "This crate is a collection of core structures for Bitcoin â¦\nTrait that âanchorsâ blockchain data to a specific â¦\nAn Anchor that can be constructed from a given block, â¦\nTrait that makes an object appendable.\nMaximum BIP32 derivation index.\nA reference to a block in the canonical chain.\nHow many confirmations are needed f or a coinbase output â¦\nRepresents a service that tracks the blockchain.\nRepresents the observed position of some chain data.\nA changeset containing crate structures typically â¦\nAn Anchor implementation that also records the exact â¦\nBlock height and timestamp at which a transaction is â¦\nAn Anchor implementation that also records the exact â¦\nThe chain data is seen as confirmed, and in anchored by A.\nThe transaction is confirmed\nA trait to extend the functionality of a miniscript â¦\nRepresents the ID of a descriptor, defined as the sha256 â¦\nError type.\nA TxOut with as much data as we can retrieve about it\nAn iterator for derived script pubkeys.\nAn index storing TxOuts that have a script pubkey that â¦\nThe chain data is not confirmed and last seen in the â¦\nThe transaction is unconfirmed\nThe script pubkeys that are being tracked by the index.\nReturns the BlockId that the associated blockchain data is â¦\nThe anchor block.\nThe anchor block.\nAppend another object of the same type onto self.\nReturns a reference to the inner hash (sha256, sh256d â¦\nChanges to the LocalChain.\nThe position of the transaction in outpoint in the overall â¦\nMaps a ChainPosition<&A> into a ChainPosition<A> by â¦\nThe exact confirmation height of the transaction.\nThe confirmation height of the transaction being anchored.\nGet the upper bound of the chain dataâs confirmation â¦\nGet the upper bound of the chain dataâs confirmation â¦\nDetermines the upper bound of the confirmation height.\nThe confirmation time of the transaction being anchored.\nGet a reference to the internal descriptor.\nReturns the descriptor id, calculated as the sha256 of the â¦\nReturns the minimum value (in satoshis) at which an output â¦\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.\nConstruct the anchor from a given block, block height and â¦\nCreates this wrapper type from the inner hash type.\nGet the best chainâs chain tip.\nThe hash of the block.\nThe height of the block.\nReturns the index associated with the script pubkey.\nContains the IndexedTxGraph and associated types. Refer to â¦\nChanges to IndexedTxGraph.\nAdds a script pubkey to scan for. Returns false and does â¦\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).\nDetermines whether block of BlockId exists as an ancestor â¦\nReturns whether ChainPosition is confirmed or not.\nReturns whether ConfirmationTime is the confirmed variant.\nWhether the utxo is/was/will be spendable with chain tip.\nReturns whether the structure is considered empty.\nWhether the txout is considered mature.\nWhether this output is on a coinbase transaction.\nWhether any of the inputs of this transaction spend a â¦\nReturns whether the script pubkey at index has been used â¦\nModule for keychain related structures.\nThe LocalChain is a local implementation of ChainOracle.\nMarks the script pubkey at index as used even though it â¦\nComputes the net value transfer effect of tx on the script â¦\nStores the network type of the transaction data.\nCreate a new script pubkey iterator from descriptor.\nCreate a new script pubkey iterator from descriptor and a â¦\nThe location of the TxOut.\nGet a reference to the set of indexed outpoints.\nIterates over all the outputs with script pubkeys in an â¦\nScans a transactionâs outputs for matching script â¦\nScan a single TxOut for a matching script pubkey and â¦\nComputes the total value transfer effect tx has on the â¦\nThe txid and chain position of the transaction (if any) â¦\nReturns the script that has been inserted at the index.\nHelper types for spk-based blockchain clients.\nTake the value, replacing it with the default value.\nTake the value, replacing it with the default value.\nReturns the inner hash (sha256, sh256d etc.).\nModule for structures that store and traverse transactions.\nReturns the txout and script pubkey index of the TxOut at â¦\nThe TxOut.\nIterate over all known txouts that spend to tracked script â¦\nFinds all txouts on a transaction that has previously been â¦\nConstruct an unconfirmed variant using the given last_seen â¦\nUndoes the effect of mark_used. Returns whether the index â¦\nIterates over all unused script pubkeys in an index range.\nConfirmation height.\nThe last-seen timestamp in unix seconds.\nConfirmation time in unix seconds.\nRepresents changes to an IndexedTxGraph.\nThe resultant âchangesetâ when new transaction data is â¦\nThe IndexedTxGraph combines a TxGraph and an Indexer â¦\nUtilities for indexing transaction data.\nBatch insert all transactions of the given block of height.\nBatch insert all transactions of the given block of heightâ¦\nApply changeset to itself.\nApplies the ChangeSet to the IndexedTxGraph.\nApply an update directly.\nBatch insert transactions, filtering out those that are â¦\nBatch insert unconfirmed transactions, filtering out those â¦\nBatch insert unconfirmed transactions.\nReturns the argument unchanged.\nReturns the argument unchanged.\nGet a reference of the internal transaction graph.\nTxGraph changeset.\nTransaction index.\nScans a transaction for relevant outpoints, which are â¦\nScan and index the given outpoint and txout.\nIndexer changeset.\nDetermines the ChangeSet between self and an empty Indexer.\nDetermines the ChangeSet between self and an empty â¦\nInsert an anchor for a given transaction.\nInsert a unix timestamp of when a transaction is seen in â¦\nInsert and index a transaction into the graph.\nInsert a floating txout of given outpoint.\nCalls U::from(self).\nCalls U::from(self).\nDetermines whether the transaction should be included in â¦\nConstruct a new IndexedTxGraph with a given index.\nBalance, differentiated into various categories.\nRepresents updates to the derivation index of a â¦\nThe default lookahead for a KeychainTxOutIndex\nThe descriptor has already been assigned to a keychain so â¦\nA tuple of keychain index and T representing the indexed â¦\nError returned from KeychainTxOutIndex::insert_descriptor\nThe keychain is already assigned to a descriptor so you canâ¦\nA tuple of keychain K, derivation index (u32) and a T â¦\nKeychainTxOutIndex controls how script pubkeys are â¦\nThe keychain doesnât exist. Most likley hasnât been â¦\nGet unbounded spk iterators for all keychains.\nMerge another ChangeSet<K> into self.\nApplies the ChangeSet<K> to the KeychainTxOutIndex<K>\nConfirmed and immediately spendable balance\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nGets the descriptor associated with the keychain. Returns â¦\nAll coinbase outputs not yet matured\nReturns the keychain and keychain index associated with â¦\nReturn a reference to the internal SpkTxOutIndex.\nInsert a descriptor with a keychain associated to it.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nReturns whether the changeset are empty.\nReturns whether the spk under the keychainâs index has â¦\nIterate over all OutPoints that have TxOuts with script â¦\nIterate over OutPoints that have script pubkeys derived â¦\nReturn all keychains and their corresponding descriptors.\nContains the keychains that have been added and their â¦\nContains for each descriptor_id the last revealed index of â¦\nGet the last derivation index revealed for keychain. â¦\nGet the last derivation index that is revealed for each â¦\nReturns the highest derivation index of the keychain where â¦\nReturns the highest derivation index of each keychain that â¦\nGet the lookahead setting.\nStore lookahead scripts until target_index (inclusive).\nMarks the script pubkey at index as used even though the â¦\nComputes the net value that this transaction gives to the â¦\nConstruct a KeychainTxOutIndex with the given lookahead.\nGet the next derivation index for keychain. The next index â¦\nGets the next unused script pubkey in the keychain. I.e., â¦\nGet the set of indexed outpoints, corresponding to tracked â¦\nAttempts to reveal the next script pubkey for keychain.\nReveals script pubkeys of the keychainâs descriptor up â¦\nConvenience method to call Self::reveal_to_target on â¦\nIterate over revealed spks of the given keychain with â¦\nIterate over revealed spks of keychains in range\nComputes the total value transfer effect tx has on the â¦\nReturn the script that exists under the given keychainâs â¦\nGet the whole balance visible to the wallet.\nUnconfirmed UTXOs generated by a wallet tx\nGet sum of trusted_pending and confirmed coins.\nReturn the TxOut of outpoint if it has been indexed, and â¦\nIterate over known txouts that spend to tracked script â¦\nFinds all txouts on a transaction that has previously been â¦\nGet an unbounded spk iterator over a given keychain. â¦\nUndoes the effect of mark_used. Returns whether the index â¦\nUnconfirmed UTXOs received from an external wallet\nIterate over revealed, but unused, spks of the given â¦\nIterate over revealed, but unused, spks of all keychains.\nThe descriptor you have attempted to reassign\nThe keychain that the descriptor is already assigned to\nThe descriptor that the keychain is already assigned to\nThe keychain that you have attempted to reassign\nRepresents a failure when trying to insert/remove a â¦\nThe error type for LocalChain::apply_header_connected_to.\nOccurs when the update cannot connect with the original â¦\nOccurs when an update does not have a common checkpoint â¦\nThe ChangeSet represents changes to LocalChain.\nA LocalChain checkpoint is used to find the agreement â¦\nIterates over checkpoints backwards.\nOccurs when connected_to block conflicts with either the â¦\nThis is a local implementation of ChainOracle.\nAn error which occurs when a LocalChain is constructed â¦\nApply the given changeset.\nUpdate the chain with a given Header connecting it with â¦\nUpdate the chain with a given Header at height which you â¦\nApplies the given update to the chain.\nGet the BlockId of the checkpoint.\nRemoves blocks from (and inclusive of) the given block_id.\nExtends the checkpoint linked list by a iterator of block â¦\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.\nConstruct a checkpoint from a list of BlockIds in â¦\nConstructs a LocalChain from a BTreeMap of height to â¦\nConstruct a LocalChain from an initial changeset.\nConstruct LocalChain from genesis hash.\nConstruct a checkpoint from the given header and block â¦\nConstruct a LocalChain from a given checkpoint tip.\nGet the genesis hash.\nGet checkpoint at height.\nGet checkpoint at given height (if it exists).\nGet the block hash of the checkpoint.\nGet the height of the checkpoint.\nThe checkpointâs height.\nDerives an initial ChangeSet, meaning that it can be â¦\nInserts block_id at its height within the chain.\nInsert a BlockId.\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).\nIterate from this checkpoint in descending height.\nIterate over checkpoints in descending height order.\nConstruct a new base block at the front of a linked list.\nThe original checkpointâs block hash which cannot be â¦\nGet the previous checkpoint in the chain\nPuts another checkpoint onto the linked list representing â¦\nIterate checkpoints over a height range.\nIterate checkpoints over a height range.\nGet the highest checkpoint.\nThe suggested checkpoint to include to connect the two â¦\nThe attempted update to the original_block hash.\nData required to perform a spk-based blockchain client â¦\nData returned from a spk-based blockchain client full scan.\nData required to perform a spk-based blockchain client â¦\nData returned from a spk-based blockchain client sync.\nChain on additional OutPoints that will be synced against.\nChain on additional Scripts that will be synced against.\nChain on additional Scripts that will be synced against.\nA checkpoint for the current chain LocalChain::tip. The â¦\nA checkpoint for the current LocalChain::tip. The full â¦\nChain on additional Txids that will be synced against.\nThe update to apply to the receiving LocalChain.\nThe update to apply to the receiving TxGraph.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nConstruct a new SyncRequest from a given cp tip.\nConstruct a new FullScanRequest from a given chain_tip.\nConstruct a new FullScanRequest from a given chain_tip and â¦\nThe update to apply to the receiving TxGraph.\nThe update to apply to the receiving LocalChain.\nAdd a closure that will be called for OutPoints previously â¦\nAdd a closure that will be called for Scripts previously â¦\nAdd a closure that will be called for every Script â¦\nAdd a closure that will be called for every Script â¦\nAdd a closure that will be called for Txids previously â¦\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nLast active indices for the corresponding keychains (K).\nTransactions with these outpoints or spent from these â¦\nPopulate the request with revealed script pubkeys from â¦\nSet the OutPoints that will be synced against.\nSet the Scripts that will be synced against.\nSet the Scripts for a given keychain.\nSet the Txids that will be synced against.\nTransactions that spend from or to these indexed script â¦\nIterators of script pubkeys indexed by the keychain index.\nTransactions with these txids.\nErrors returned by TxGraph::calculate_fee.\nA transaction that is included in the chain, or is still â¦\nThe ChangeSet represents changes to a TxGraph.\nMissing TxOut for one or more of the inputs of the tx\nWhen the transaction is invalid according to the graph it â¦\nAn iterator that traverses ancestors of a given root â¦\nAn iterator that traverses transaction descendants.\nA graph of transactions and spends.\nA transaction node in the TxGraph.\nGet all transaction anchors known by TxGraph.\nIterate over all tx outputs known by TxGraph.\nIterates over the heights of that the new transaction â¦\nThe blocks that the transaction is âanchoredâ in.\nAdded anchors.\nApplies ChangeSet to TxGraph.\nExtends this graph with another so that self becomes the â¦\nGet the total balance of outpoints that are in chain of â¦\nBatch insert unconfirmed transactions.\nCalculates the fee of a given transaction. Returns â¦\nHow the transaction is observed as (confirmed or â¦\nGiven a transaction, return an iterator of txids that â¦\nGet a filtered list of outputs from the given outpoints â¦\nGet a filtered list of unspent outputs (UTXOs) from the â¦\nIterate over floating txouts known by TxGraph.\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.\nIterate over all full transactions in the graph.\nGet the position of the transaction in chain with tip â¦\nGet the txid of the spending transaction and where the â¦\nGet a transaction by txid. This only returns Some for full â¦\nGet a transaction node by txid. This only returns Some for â¦\nObtains a single tx output (if any) at the specified â¦\nDetermines the ChangeSet between self and an empty TxGraph.\nInserts the given anchor into TxGraph.\nInserts the given seen_at for txid into TxGraph.\nInserts the given transaction into TxGraph.\nInserts the given TxOut at OutPoint.\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).\nWhether the graph has any transactions or outputs in it.\nAdded last-seen unix timestamps of transactions.\nThe last-seen unix timestamp of the transaction as â¦\nList graph transactions that are in chain with chain_tip.\nTransform the TxGraph to have Anchors of another type.\nTransform the ChangeSet to have Anchors of another type.\nConstruct a new TxGraph from a list of transactions.\nThe transactions spending from this output.\nGet the total balance of outpoints that are in chain of â¦\nGet a filtered list of outputs from the given outpoints â¦\nGet a filtered list of unspent outputs (UTXOs) from the â¦\nGet the position of the transaction in chain with tip â¦\nGet the txid of the spending transaction and where the â¦\nList graph transactions that are in chain with chain_tip.\nA partial or full representation of the transaction.\nThe transaction node (as part of the graph).\nReturns known outputs of a given txid.\nIterates over the transactions spending from txid.\nTxid of the transaction.\nIterates over all outpoints contained within ChangeSet.\nAdded txouts.\nAdded transactions.\nUpdate the last seen time for all unconfirmed transactions.\nCreates an iterator that filters and maps ancestor â¦\nCreates an iterator that both filters and maps conflicting â¦\nCreates an iterator that filters and maps descendants from â¦")
\ No newline at end of file
+searchState.loadedDescShard("bdk_chain", 0, "This crate is a collection of core structures for Bitcoin â¦\nTrait that âanchorsâ blockchain data to a specific â¦\nAn Anchor that can be constructed from a given block, â¦\nTrait that makes an object appendable.\nMaximum BIP32 derivation index.\nA reference to a block in the canonical chain.\nHow many confirmations are needed f or a coinbase output â¦\nRepresents a service that tracks the blockchain.\nRepresents the observed position of some chain data.\nA changeset containing crate structures typically â¦\nAn Anchor implementation that also records the exact â¦\nBlock height and timestamp at which a transaction is â¦\nAn Anchor implementation that also records the exact â¦\nThe chain data is seen as confirmed, and in anchored by A.\nThe transaction is confirmed\nA trait to extend the functionality of a miniscript â¦\nRepresents the unique ID of a descriptor.\nError type.\nA TxOut with as much data as we can retrieve about it\nAn iterator for derived script pubkeys.\nAn index storing TxOuts that have a script pubkey that â¦\nThe chain data is not confirmed and last seen in the â¦\nThe transaction is unconfirmed\nThe script pubkeys that are being tracked by the index.\nReturns the BlockId that the associated blockchain data is â¦\nThe anchor block.\nThe anchor block.\nAppend another object of the same type onto self.\nReturns a reference to the inner hash (sha256, sh256d â¦\nChanges to the LocalChain.\nThe position of the transaction in outpoint in the overall â¦\nMaps a ChainPosition<&A> into a ChainPosition<A> by â¦\nThe exact confirmation height of the transaction.\nThe confirmation height of the transaction being anchored.\nGet the upper bound of the chain dataâs confirmation â¦\nGet the upper bound of the chain dataâs confirmation â¦\nDetermines the upper bound of the confirmation height.\nThe confirmation time of the transaction being anchored.\nGet a reference to the internal descriptor.\nReturns the descriptor ID, calculated as the sha256 hash â¦\nReturns the minimum value (in satoshis) at which an output â¦\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.\nConstruct the anchor from a given block, block height and â¦\nCreates this wrapper type from the inner hash type.\nGet the best chainâs chain tip.\nThe hash of the block.\nThe height of the block.\nReturns the index associated with the script pubkey.\nContains the IndexedTxGraph and associated types. Refer to â¦\nChanges to IndexedTxGraph.\nAdds a script pubkey to scan for. Returns false and does â¦\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).\nDetermines whether block of BlockId exists as an ancestor â¦\nReturns whether ChainPosition is confirmed or not.\nReturns whether ConfirmationTime is the confirmed variant.\nWhether the utxo is/was/will be spendable with chain tip.\nReturns whether the structure is considered empty.\nWhether the txout is considered mature.\nWhether this output is on a coinbase transaction.\nWhether any of the inputs of this transaction spend a â¦\nReturns whether the script pubkey at index has been used â¦\nModule for keychain related structures.\nThe LocalChain is a local implementation of ChainOracle.\nMarks the script pubkey at index as used even though it â¦\nComputes the net value transfer effect of tx on the script â¦\nStores the network type of the transaction data.\nCreate a new script pubkey iterator from descriptor.\nCreate a new script pubkey iterator from descriptor and a â¦\nThe location of the TxOut.\nGet a reference to the set of indexed outpoints.\nIterates over all the outputs with script pubkeys in an â¦\nScans a transactionâs outputs for matching script â¦\nScan a single TxOut for a matching script pubkey and â¦\nComputes the total value transfer effect tx has on the â¦\nThe txid and chain position of the transaction (if any) â¦\nReturns the script that has been inserted at the index.\nHelper types for spk-based blockchain clients.\nTake the value, replacing it with the default value.\nTake the value, replacing it with the default value.\nReturns the inner hash (sha256, sh256d etc.).\nModule for structures that store and traverse transactions.\nReturns the txout and script pubkey index of the TxOut at â¦\nThe TxOut.\nIterate over all known txouts that spend to tracked script â¦\nFinds all txouts on a transaction that has previously been â¦\nConstruct an unconfirmed variant using the given last_seen â¦\nUndoes the effect of mark_used. Returns whether the index â¦\nIterates over all unused script pubkeys in an index range.\nConfirmation height.\nThe last-seen timestamp in unix seconds.\nConfirmation time in unix seconds.\nRepresents changes to an IndexedTxGraph.\nThe resultant âchangesetâ when new transaction data is â¦\nThe IndexedTxGraph combines a TxGraph and an Indexer â¦\nUtilities for indexing transaction data.\nBatch insert all transactions of the given block of height.\nBatch insert all transactions of the given block of heightâ¦\nApply changeset to itself.\nApplies the ChangeSet to the IndexedTxGraph.\nApply an update directly.\nBatch insert transactions, filtering out those that are â¦\nBatch insert unconfirmed transactions, filtering out those â¦\nBatch insert unconfirmed transactions.\nReturns the argument unchanged.\nReturns the argument unchanged.\nGet a reference of the internal transaction graph.\nTxGraph changeset.\nTransaction index.\nScans a transaction for relevant outpoints, which are â¦\nScan and index the given outpoint and txout.\nIndexer changeset.\nDetermines the ChangeSet between self and an empty Indexer.\nDetermines the ChangeSet between self and an empty â¦\nInsert an anchor for a given transaction.\nInsert a unix timestamp of when a transaction is seen in â¦\nInsert and index a transaction into the graph.\nInsert a floating txout of given outpoint.\nCalls U::from(self).\nCalls U::from(self).\nDetermines whether the transaction should be included in â¦\nConstruct a new IndexedTxGraph with a given index.\nBalance, differentiated into various categories.\nRepresents updates to the derivation index of a â¦\nThe default lookahead for a KeychainTxOutIndex\nThe descriptor has already been assigned to a keychain so â¦\nA tuple of keychain index and T representing the indexed â¦\nError returned from KeychainTxOutIndex::insert_descriptor\nThe keychain is already assigned to a descriptor so you canâ¦\nA tuple of keychain K, derivation index (u32) and a T â¦\nKeychainTxOutIndex controls how script pubkeys are â¦\nThe keychain doesnât exist. Most likley hasnât been â¦\nGet unbounded spk iterators for all keychains.\nMerge another ChangeSet<K> into self.\nApplies the ChangeSet<K> to the KeychainTxOutIndex<K>\nConfirmed and immediately spendable balance\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nGets the descriptor associated with the keychain. Returns â¦\nAll coinbase outputs not yet matured\nReturns the keychain and keychain index associated with â¦\nReturn a reference to the internal SpkTxOutIndex.\nInsert a descriptor with a keychain associated to it.\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nReturns whether the changeset are empty.\nReturns whether the spk under the keychainâs index has â¦\nIterate over all OutPoints that have TxOuts with script â¦\nIterate over OutPoints that have script pubkeys derived â¦\nReturn all keychains and their corresponding descriptors.\nContains the keychains that have been added and their â¦\nContains for each descriptor_id the last revealed index of â¦\nGet the last derivation index revealed for keychain. â¦\nGet the last derivation index that is revealed for each â¦\nReturns the highest derivation index of the keychain where â¦\nReturns the highest derivation index of each keychain that â¦\nGet the lookahead setting.\nStore lookahead scripts until target_index (inclusive).\nMarks the script pubkey at index as used even though the â¦\nComputes the net value that this transaction gives to the â¦\nConstruct a KeychainTxOutIndex with the given lookahead.\nGet the next derivation index for keychain. The next index â¦\nGets the next unused script pubkey in the keychain. I.e., â¦\nGet the set of indexed outpoints, corresponding to tracked â¦\nAttempts to reveal the next script pubkey for keychain.\nReveals script pubkeys of the keychainâs descriptor up â¦\nConvenience method to call Self::reveal_to_target on â¦\nIterate over revealed spks of the given keychain with â¦\nIterate over revealed spks of keychains in range\nComputes the total value transfer effect tx has on the â¦\nReturn the script that exists under the given keychainâs â¦\nGet the whole balance visible to the wallet.\nUnconfirmed UTXOs generated by a wallet tx\nGet sum of trusted_pending and confirmed coins.\nReturn the TxOut of outpoint if it has been indexed, and â¦\nIterate over known txouts that spend to tracked script â¦\nFinds all txouts on a transaction that has previously been â¦\nGet an unbounded spk iterator over a given keychain. â¦\nUndoes the effect of mark_used. Returns whether the index â¦\nUnconfirmed UTXOs received from an external wallet\nIterate over revealed, but unused, spks of the given â¦\nIterate over revealed, but unused, spks of all keychains.\nThe descriptor you have attempted to reassign\nThe keychain that the descriptor is already assigned to\nThe descriptor that the keychain is already assigned to\nThe keychain that you have attempted to reassign\nRepresents a failure when trying to insert/remove a â¦\nThe error type for LocalChain::apply_header_connected_to.\nOccurs when the update cannot connect with the original â¦\nOccurs when an update does not have a common checkpoint â¦\nThe ChangeSet represents changes to LocalChain.\nA LocalChain checkpoint is used to find the agreement â¦\nIterates over checkpoints backwards.\nOccurs when connected_to block conflicts with either the â¦\nThis is a local implementation of ChainOracle.\nAn error which occurs when a LocalChain is constructed â¦\nApply the given changeset.\nUpdate the chain with a given Header connecting it with â¦\nUpdate the chain with a given Header at height which you â¦\nApplies the given update to the chain.\nGet the BlockId of the checkpoint.\nRemoves blocks from (and inclusive of) the given block_id.\nExtends the checkpoint linked list by a iterator of block â¦\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.\nConstruct a checkpoint from a list of BlockIds in â¦\nConstructs a LocalChain from a BTreeMap of height to â¦\nConstruct a LocalChain from an initial changeset.\nConstruct LocalChain from genesis hash.\nConstruct a checkpoint from the given header and block â¦\nConstruct a LocalChain from a given checkpoint tip.\nGet the genesis hash.\nGet checkpoint at height.\nGet checkpoint at given height (if it exists).\nGet the block hash of the checkpoint.\nGet the height of the checkpoint.\nThe checkpointâs height.\nDerives an initial ChangeSet, meaning that it can be â¦\nInserts block_id at its height within the chain.\nInsert a BlockId.\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).\nIterate from this checkpoint in descending height.\nIterate over checkpoints in descending height order.\nConstruct a new base block at the front of a linked list.\nThe original checkpointâs block hash which cannot be â¦\nGet the previous checkpoint in the chain\nPuts another checkpoint onto the linked list representing â¦\nIterate checkpoints over a height range.\nIterate checkpoints over a height range.\nGet the highest checkpoint.\nThe suggested checkpoint to include to connect the two â¦\nThe attempted update to the original_block hash.\nData required to perform a spk-based blockchain client â¦\nData returned from a spk-based blockchain client full scan.\nData required to perform a spk-based blockchain client â¦\nData returned from a spk-based blockchain client sync.\nChain on additional OutPoints that will be synced against.\nChain on additional Scripts that will be synced against.\nChain on additional Scripts that will be synced against.\nA checkpoint for the current chain LocalChain::tip. The â¦\nA checkpoint for the current LocalChain::tip. The full â¦\nChain on additional Txids that will be synced against.\nThe update to apply to the receiving LocalChain.\nThe update to apply to the receiving TxGraph.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nConstruct a new SyncRequest from a given cp tip.\nConstruct a new FullScanRequest from a given chain_tip.\nConstruct a new FullScanRequest from a given chain_tip and â¦\nThe update to apply to the receiving TxGraph.\nThe update to apply to the receiving LocalChain.\nAdd a closure that will be called for OutPoints previously â¦\nAdd a closure that will be called for Scripts previously â¦\nAdd a closure that will be called for every Script â¦\nAdd a closure that will be called for every Script â¦\nAdd a closure that will be called for Txids previously â¦\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nCalls U::from(self).\nLast active indices for the corresponding keychains (K).\nTransactions with these outpoints or spent from these â¦\nPopulate the request with revealed script pubkeys from â¦\nSet the OutPoints that will be synced against.\nSet the Scripts that will be synced against.\nSet the Scripts for a given keychain.\nSet the Txids that will be synced against.\nTransactions that spend from or to these indexed script â¦\nIterators of script pubkeys indexed by the keychain index.\nTransactions with these txids.\nErrors returned by TxGraph::calculate_fee.\nA transaction that is included in the chain, or is still â¦\nThe ChangeSet represents changes to a TxGraph.\nMissing TxOut for one or more of the inputs of the tx\nWhen the transaction is invalid according to the graph it â¦\nAn iterator that traverses ancestors of a given root â¦\nAn iterator that traverses transaction descendants.\nA graph of transactions and spends.\nA transaction node in the TxGraph.\nGet all transaction anchors known by TxGraph.\nIterate over all tx outputs known by TxGraph.\nIterates over the heights of that the new transaction â¦\nThe blocks that the transaction is âanchoredâ in.\nAdded anchors.\nApplies ChangeSet to TxGraph.\nExtends this graph with another so that self becomes the â¦\nGet the total balance of outpoints that are in chain of â¦\nBatch insert unconfirmed transactions.\nCalculates the fee of a given transaction. Returns â¦\nHow the transaction is observed as (confirmed or â¦\nGiven a transaction, return an iterator of txids that â¦\nGet a filtered list of outputs from the given outpoints â¦\nGet a filtered list of unspent outputs (UTXOs) from the â¦\nIterate over floating txouts known by TxGraph.\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.\nIterate over all full transactions in the graph.\nGet the position of the transaction in chain with tip â¦\nGet the txid of the spending transaction and where the â¦\nGet a transaction by txid. This only returns Some for full â¦\nGet a transaction node by txid. This only returns Some for â¦\nObtains a single tx output (if any) at the specified â¦\nDetermines the ChangeSet between self and an empty TxGraph.\nInserts the given anchor into TxGraph.\nInserts the given seen_at for txid into TxGraph.\nInserts the given transaction into TxGraph.\nInserts the given TxOut at OutPoint.\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).\nWhether the graph has any transactions or outputs in it.\nAdded last-seen unix timestamps of transactions.\nThe last-seen unix timestamp of the transaction as â¦\nList graph transactions that are in chain with chain_tip.\nTransform the TxGraph to have Anchors of another type.\nTransform the ChangeSet to have Anchors of another type.\nConstruct a new TxGraph from a list of transactions.\nThe transactions spending from this output.\nGet the total balance of outpoints that are in chain of â¦\nGet a filtered list of outputs from the given outpoints â¦\nGet a filtered list of unspent outputs (UTXOs) from the â¦\nGet the position of the transaction in chain with tip â¦\nGet the txid of the spending transaction and where the â¦\nList graph transactions that are in chain with chain_tip.\nA partial or full representation of the transaction.\nThe transaction node (as part of the graph).\nReturns known outputs of a given txid.\nIterates over the transactions spending from txid.\nTxid of the transaction.\nIterates over all outpoints contained within ChangeSet.\nAdded txouts.\nAdded transactions.\nUpdate the last seen time for all unconfirmed transactions.\nCreates an iterator that filters and maps ancestor â¦\nCreates an iterator that both filters and maps conflicting â¦\nCreates an iterator that filters and maps descendants from â¦")
\ No newline at end of file
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 5c5c89737e..06e3db5eda 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
@@ -36,21 +36,11 @@
 36
 37
 38
-39
-40
-41
-42
-43
-44
-

use crate::{
-    alloc::{string::ToString, vec::Vec},
-    miniscript::{Descriptor, DescriptorPublicKey},
-};
+

use crate::miniscript::{Descriptor, DescriptorPublicKey};
 use bitcoin::hashes::{hash_newtype, sha256, Hash};
 
 hash_newtype! {
-    /// Represents the ID of a descriptor, defined as the sha256 hash of
-    /// the descriptor string, checksum excluded.
+    /// Represents the unique ID of a descriptor.
     ///
     /// This is useful for having a fixed-length unique representation of a descriptor,
     /// in particular, we use it to persist application state changes related to the
@@ -65,8 +55,8 @@
     /// Panics if the descriptor wildcard is hardened.
     fn dust_value(&self) -> u64;
 
-    /// Returns the descriptor id, calculated as the sha256 of the descriptor, checksum not
-    /// included.
+    /// Returns the descriptor ID, calculated as the sha256 hash of the spk derived from the
+    /// descriptor at index 0.
     fn descriptor_id(&self) -> DescriptorId;
 }
 
@@ -80,10 +70,8 @@
     }
 
     fn descriptor_id(&self) -> DescriptorId {
-        let desc = self.to_string();
-        let desc_without_checksum = desc.split('#').next().expect("Must be here");
-        let descriptor_bytes = <Vec<u8>>::from(desc_without_checksum.as_bytes());
-        DescriptorId(sha256::Hash::hash(&descriptor_bytes))
+        let spk = self.at_derivation_index(0).unwrap().script_pubkey();
+        DescriptorId(sha256::Hash::hash(spk.as_bytes()))
     }
 }

Re-exportsÂ§

ModulesÂ§

StructsÂ§

EnumsÂ§

ConstantsÂ§

TraitsÂ§

EnumsÂ§

ConstantsÂ§

TraitsÂ§

Enum bdk_chain::keychain::InsertDescriptorErrorCopy item path

Enum bdk_chain::keychain::InsertDescriptorErrorCopy item path

KeychainAlreadyAssigned

Fields

Trait ImplementationsÂ§

impl<K: Clone> Clone for InsertDescriptorError<K>

fn clone(&self) -> InsertDescriptorError<K>

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

impl<K: Debug> Debug for InsertDescriptorError<K>

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

impl<K: Debug> Display for InsertDescriptorError<K>

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

impl<K: Debug> Error for InsertDescriptorError<K>

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

fn description(&self) -> &str

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

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

impl<K: PartialEq> PartialEq for InsertDescriptorError<K>

fn eq(&self, other: &InsertDescriptorError<K>) -> bool

Trait ImplementationsÂ§

impl<K: Clone> Clone for InsertDescriptorError<K>

fn clone(&self) -> InsertDescriptorError<K>

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

impl<K: Debug> Debug for InsertDescriptorError<K>

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

impl<K: Debug> Display for InsertDescriptorError<K>

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

impl<K: Debug> Error for InsertDescriptorError<K>

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

fn description(&self) -> &str

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

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

impl<K: PartialEq> PartialEq for InsertDescriptorError<K>

fn eq(&self, other: &InsertDescriptorError<K>) -> bool

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

impl<K> StructuralPartialEq for InsertDescriptorError<K>

Auto Trait ImplementationsÂ§

impl<K> !Freeze for InsertDescriptorError<K>

impl<K> RefUnwindSafe for InsertDescriptorError<K>where +sufficient, and should not be overridden without very good reason.

impl<K> StructuralPartialEq for InsertDescriptorError<K>

Auto Trait ImplementationsÂ§

impl<K> !Freeze for InsertDescriptorError<K>

impl<K> RefUnwindSafe for InsertDescriptorError<K>where K: RefUnwindSafe,

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

impl<K> Sync for InsertDescriptorError<K>where K: Sync,

Struct bdk_chain::keychain::ChangeSetCopy item path

Struct bdk_chain::keychain::ChangeSetCopy item path

FieldsÂ§

Trait ImplementationsÂ§

impl<K: Ord> Append for ChangeSet<K>

fn append(&mut self, other: Self)

Trait ImplementationsÂ§

impl<K: Ord> Append for ChangeSet<K>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

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

impl<K: Clone> Clone for ChangeSet<K>

fn clone(&self) -> ChangeSet<K>

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

impl<K: Debug> Debug for ChangeSet<K>

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

impl<K> Default for ChangeSet<K>

fn default() -> Self

impl<'de, K> Deserialize<'de> for ChangeSet<K>where - K: Ord + Deserialize<'de>,

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

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

fn from(indexer: ChangeSet<K>) -> Self

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

fn from(indexer: ChangeSet<K>) -> Self

impl<K: PartialEq> PartialEq for ChangeSet<K>

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

Enum bdk_chain::keychain::InsertDescriptorError

Enum bdk_chain::keychain::InsertDescriptorError

`Fields`

`Trait ImplementationsÂ§`

`Trait ImplementationsÂ§`

`Auto Trait ImplementationsÂ§`

impl<K> RefUnwindSafe for InsertDescriptorError<K>
where +sufficient, and should not be overridden without very good reason.

`Auto Trait ImplementationsÂ§`

impl<K> RefUnwindSafe for InsertDescriptorError<K>
where K: RefUnwindSafe,

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

impl<K> Sync for InsertDescriptorError<K>
where K: Sync,

Struct bdk_chain::keychain::ChangeSet

Struct bdk_chain::keychain::ChangeSet

impl<'de, K> Deserialize<'de> for ChangeSet<K>
where - K: Ord + Deserialize<'de>,

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

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

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

impl<K> Serialize for ChangeSet<K>
where - K: Ord + Serialize,

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

impl<K> RefUnwindSafe for ChangeSet<K>
where +sufficient, and should not be overridden without very good reason.

impl<K> Serialize for ChangeSet<K>
where + K: Ord + Serialize,

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

impl<K> RefUnwindSafe for ChangeSet<K>
where K: RefUnwindSafe,

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

impl<K> Sync for ChangeSet<K>
where K: Sync,