Module bdk_chain::tx_graph

Expand description

Module for structures that store and traverse transactions.

+bdk_chain::tx_graph - Rust

Module bdk_chain::tx_graph

Expand description

Module for structures that store and traverse transactions.

TxGraph contains transactions and indexes them so you can easily traverse the graph of those transactions. TxGraph is monotone in that you can always insert a transaction â it does not care whether that transaction is in the current best chain or whether it conflicts with diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html index 9ba51fbfd0..befb062a56 100644 --- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html +++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.ChangeSet.html @@ -1,4 +1,4 @@ -ChangeSet in bdk_chain::tx_graph - Rust

Struct bdk_chain::tx_graph::ChangeSet

source Â·

pub struct ChangeSet<A = ()> {
+ChangeSet in bdk_chain::tx_graph - Rust
bdk_chain0.21.0
ChangeSet
Fields
anchors
last_seen
txouts
txs
Associated Constants
ANCHORS_TABLE_NAME
SCHEMA_NAME
TXOUTS_TABLE_NAME
TXS_TABLE_NAME
Methods
anchor_heights
from_sqlite
init_sqlite_tables
map_anchors
persist_to_sqlite
schema_v0
schema_v1
txouts
Trait Implementations
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<A>>
Merge
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::tx_graph
Struct bdk_chain::tx_graph::ChangeSet
source Â· 
pub struct ChangeSet<A = ()> {
     pub txs: BTreeSet<Arc<Transaction>>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -11,12 +11,12 @@ not removed.
 
Â§txouts: BTreeMap<OutPoint, TxOut>Added txouts.
 
Â§anchors: BTreeSet<(A, Txid)>Added anchors.
 
Â§last_seen: BTreeMap<Txid, u64>Added last-seen unix timestamps of transactions.
-
ImplementationsÂ§
sourceÂ§impl<A> ChangeSet<A>
sourcepub fn txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterates over all outpoints contained within ChangeSet.
-
sourcepub fn anchor_heights(&self) -> impl Iterator<Item = u32> + '_where
+
ImplementationsÂ§
sourceÂ§impl<A> ChangeSet<A>
sourcepub fn txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterates over all outpoints contained within ChangeSet.
+
sourcepub fn anchor_heights(&self) -> impl Iterator<Item = u32> + '_where
     A: Anchor,
Iterates over the heights of that the new transaction anchors in this changeset.
 This is useful if you want to find which heights you need to fetch data about in order to
 confirm or exclude these anchors.
-
sourceÂ§impl<A: Ord> ChangeSet<A>
sourcepub fn map_anchors<A2: Ord, F>(self, f: F) -> ChangeSet<A2>where
+
sourceÂ§impl<A: Ord> ChangeSet<A>
sourcepub fn map_anchors<A2: Ord, F>(self, f: F) -> ChangeSet<A2>where
     F: FnMut(A) -> A2,
Transform the ChangeSet to have Anchors of another type.
 This takes in a closure of signature FnMut(A) -> A2 which is called for each Anchor to
 transform it.
@@ -31,13 +31,13 @@ transform it.
 Remember to call Self::init_sqlite_tables beforehand.
 
sourcepub fn persist_to_sqlite(&self, db_tx: &Transaction<'_>) -> Result<()>
Persist changeset to the sqlite database.
 Remember to call Self::init_sqlite_tables beforehand.
-
Trait ImplementationsÂ§
sourceÂ§impl<A: Clone> Clone for ChangeSet<A>
sourceÂ§fn clone(&self) -> ChangeSet<A>
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceÂ§impl<A: Debug> Debug for ChangeSet<A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<A> Default for ChangeSet<A>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<'de, A> Deserialize<'de> for ChangeSet<A>where
-    A: Ord + Deserialize<'de>,
sourceÂ§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
-    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>
sourceÂ§fn from(graph: ChangeSet<A>) -> Self
Converts to this type from the input type.
sourceÂ§impl<A: Ord> Merge for ChangeSet<A>
sourceÂ§fn merge(&mut self, other: Self)
Merge another object of the same type onto self.
sourceÂ§fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
Â§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<A: PartialEq> PartialEq for ChangeSet<A>
sourceÂ§fn eq(&self, other: &ChangeSet<A>) -> bool
This method tests for self and other values to be equal, and is used
+
Trait ImplementationsÂ§
sourceÂ§impl<A: Clone> Clone for ChangeSet<A>
sourceÂ§fn clone(&self) -> ChangeSet<A>
Returns a copy of the value. Read more
1.0.0 Â· sourceÂ§fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceÂ§impl<A: Debug> Debug for ChangeSet<A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<A> Default for ChangeSet<A>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<'de, A> Deserialize<'de> for ChangeSet<A>where
+    A: Ord + Deserialize<'de>,
sourceÂ§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
+    __D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
sourceÂ§impl<A, IA: Default> From<ChangeSet<A>> for ChangeSet<A, IA>
sourceÂ§fn from(graph: ChangeSet<A>) -> Self
Converts to this type from the input type.
sourceÂ§impl<A: Ord> Merge for ChangeSet<A>
sourceÂ§fn merge(&mut self, other: Self)
Merge another object of the same type onto self.
sourceÂ§fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
Â§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<A: PartialEq> PartialEq for ChangeSet<A>
sourceÂ§fn eq(&self, other: &ChangeSet<A>) -> bool
This method tests for self and other values to be equal, and is used
 by ==.
1.0.0 Â· sourceÂ§fn ne(&self, other: &Rhs) -> bool
This method tests for !=. The default implementation is almost always
-sufficient, and should not be overridden without very good reason.
sourceÂ§impl<A> Serialize for ChangeSet<A>where
-    A: Ord + Serialize,
sourceÂ§fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where
-    __S: Serializer,
Serialize this value into the given Serde serializer. Read more
sourceÂ§impl<A> StructuralPartialEq for ChangeSet<A>
Auto Trait ImplementationsÂ§
Â§impl<A> Freeze for ChangeSet<A>
Â§impl<A> RefUnwindSafe for ChangeSet<A>where
+sufficient, and should not be overridden without very good reason.
sourceÂ§impl<A> Serialize for ChangeSet<A>where
+    A: Ord + Serialize,
sourceÂ§fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>where
+    __S: Serializer,
Serialize this value into the given Serde serializer. Read more
sourceÂ§impl<A> StructuralPartialEq for ChangeSet<A>
Auto Trait ImplementationsÂ§
Â§impl<A> Freeze for ChangeSet<A>
Â§impl<A> RefUnwindSafe for ChangeSet<A>where
     A: RefUnwindSafe,
Â§impl<A> Send for ChangeSet<A>where
     A: Send,
Â§impl<A> Sync for ChangeSet<A>where
     A: Sync,
Â§impl<A> Unpin for ChangeSet<A>
Â§impl<A> UnwindSafe for ChangeSet<A>where
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html
index b0f67d73f9..51394ffa89 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxAncestors.html
@@ -1,11 +1,11 @@
-TxAncestors in bdk_chain::tx_graph - Rust
bdk_chain0.21.0
TxAncestors
Methods
run_until_finished
Trait Implementations
Iterator
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
ByteIterExt
CheckedSum<Amount>
CheckedSum<SignedAmount>
Fe32IterExt
From<T>
Into<U>
IntoIterator
IteratorExt
IteratorRandom
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxAncestors
source Â· 
pub struct TxAncestors<'g, A, F, O>where
+TxAncestors in bdk_chain::tx_graph - Rust
bdk_chain0.21.0
TxAncestors
Methods
run_until_finished
Trait Implementations
Iterator
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
ByteIterExt
CheckedSum<Amount>
CheckedSum<SignedAmount>
Fe32IterExt
From<T>
Into<U>
IntoIterator
IteratorExt
IteratorRandom
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxAncestors
source Â· 
pub struct TxAncestors<'g, A, F, O>where
     F: FnMut(usize, Arc<Transaction>) -> Option<O>,
{ /* private fields */ }
Expand description
An iterator that traverses ancestors of a given root transaction.
 The iterator excludes partial transactions.
 Returned by the walk_ancestors method of TxGraph.
-
ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> TxAncestors<'g, A, F, O>where
-    F: FnMut(usize, Arc<Transaction>) -> Option<O>,
sourcepub fn run_until_finished(self)
Traverse all ancestors that are not filtered out by the provided closure.
-
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxAncestors<'g, A, F, O>where
-    F: FnMut(usize, Arc<Transaction>) -> Option<O>,
Â§type Item = O
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn next_chunk<const N: usize>(
+
ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> TxAncestors<'g, A, F, O>where
+    F: FnMut(usize, Arc<Transaction>) -> Option<O>,
sourcepub fn run_until_finished(self)
Traverse all ancestors that are not filtered out by the provided closure.
+
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxAncestors<'g, A, F, O>where
+    F: FnMut(usize, Arc<Transaction>) -> Option<O>,
Â§type Item = O
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn next_chunk<const N: usize>(
     &mut self
 ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
     Self: Sized,
ð¬This is a nightly-only experimental API. (iter_next_chunk)Advances the iterator and returns an array containing the next N values. Read more
1.0.0 Â· sourceÂ§fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
1.0.0 Â· sourceÂ§fn count(self) -> usizewhere
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
index 3801f5af04..9ef93b2175 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
@@ -1,10 +1,10 @@
-TxDescendants in bdk_chain::tx_graph - Rust
bdk_chain0.21.0
TxDescendants
Methods
run_until_finished
Trait Implementations
Iterator
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
ByteIterExt
CheckedSum<Amount>
CheckedSum<SignedAmount>
Fe32IterExt
From<T>
Into<U>
IntoIterator
IteratorExt
IteratorRandom
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxDescendants
source Â· 
pub struct TxDescendants<'g, A, F, O>where
+TxDescendants in bdk_chain::tx_graph - Rust
bdk_chain0.21.0
TxDescendants
Methods
run_until_finished
Trait Implementations
Iterator
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
ByteIterExt
CheckedSum<Amount>
CheckedSum<SignedAmount>
Fe32IterExt
From<T>
Into<U>
IntoIterator
IteratorExt
IteratorRandom
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxDescendants
source Â· 
pub struct TxDescendants<'g, A, F, O>where
     F: FnMut(usize, Txid) -> Option<O>,
{ /* private fields */ }
Expand description
An iterator that traverses transaction descendants.
 Returned by the walk_descendants method of TxGraph.
-
ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> TxDescendants<'g, A, F, O>where
-    F: FnMut(usize, Txid) -> Option<O>,
sourcepub fn run_until_finished(self)
Traverse all descendants that are not filtered out by the provided closure.
-
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxDescendants<'g, A, F, O>where
-    F: FnMut(usize, Txid) -> Option<O>,
Â§type Item = O
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn next_chunk<const N: usize>(
+
ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> TxDescendants<'g, A, F, O>where
+    F: FnMut(usize, Txid) -> Option<O>,
sourcepub fn run_until_finished(self)
Traverse all descendants that are not filtered out by the provided closure.
+
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxDescendants<'g, A, F, O>where
+    F: FnMut(usize, Txid) -> Option<O>,
Â§type Item = O
The type of the elements being iterated over.
sourceÂ§fn next(&mut self) -> Option<Self::Item>
Advances the iterator and returns the next value. Read more
sourceÂ§fn next_chunk<const N: usize>(
     &mut self
 ) -> Result<[Self::Item; N], IntoIter<Self::Item, N>>where
     Self: Sized,
ð¬This is a nightly-only experimental API. (iter_next_chunk)Advances the iterator and returns an array containing the next N values. Read more
1.0.0 Â· sourceÂ§fn size_hint(&self) -> (usize, Option<usize>)
Returns the bounds on the remaining length of the iterator. Read more
1.0.0 Â· sourceÂ§fn count(self) -> usizewhere
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
index 4f97b5f2ce..5ce51bc48d 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
@@ -37,7 +37,7 @@ the returned set will never be in the same active-chain.
 vout is the provided txidâs outpoint that is being spent
 txid-set is the set of txids spending the vout.
 
-
sourceÂ§impl<A: Clone + Ord> TxGraph<A>
sourcepub fn walk_ancestors<'g, T, F, O>(
+
sourceÂ§impl<A: Clone + Ord> TxGraph<A>
sourcepub fn walk_ancestors<'g, T, F, O>(
     &'g self,
     tx: T,
     walk_map: F
@@ -54,11 +54,11 @@ the Transaction is spending an output of the ancestor_tx
 The supplied closure returns an Option<T>, allowing the caller to map each Transaction
 it visits and decide whether to visit ancestors.
-
sourcepub fn walk_descendants<'g, F, O>(
+
sourcepub fn walk_descendants<'g, F, O>(
     &'g self,
     txid: Txid,
     walk_map: F
-) -> TxDescendants<'_, A, F, O> âwhere
+) -> TxDescendants<'g, A, F, O> âwhere
     F: FnMut(usize, Txid) -> Option<O> + 'g,
Creates an iterator that filters and maps descendants from the starting txid.

 The supplied closure takes in two inputs (depth, descendant_txid):
 
@@ -68,18 +68,18 @@ descendant is spending an output of the starting txid then de
 

 The supplied closure returns an Option<T>, allowing the caller to map each node it visits
 and decide whether to visit descendants.
-

sourceÂ§impl<A> TxGraph<A>

sourcepub fn walk_conflicts<'g, F, O>(
+

sourceÂ§impl<A> TxGraph<A>

sourcepub fn walk_conflicts<'g, F, O>(
     &'g self,
     tx: &'g Transaction,
     walk_map: F
-) -> TxDescendants<'_, A, F, O> âwhere
+) -> TxDescendants<'g, A, F, O> âwhere
     F: FnMut(usize, Txid) -> Option<O> + 'g,

Creates an iterator that both filters and maps conflicting transactions (this includes descendants of directly-conflicting transactions, which are also considered conflicts).


 Refer to Self::walk_descendants for walk_map usage.
-

sourcepub fn direct_conflicts<'g>(
+

sourcepub fn direct_conflicts<'g>(
     &'g self,
     tx: &'g Transaction
-) -> impl Iterator<Item = (usize, Txid)> + '_

Given a transaction, return an iterator of txids that directly conflict with the given +) -> impl Iterator<Item = (usize, Txid)> + 'g

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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