Enum bdk_chain::tx_graph::CalculateFeeError

source Â·

pub enum CalculateFeeError {
+CalculateFeeError in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
CalculateFeeError
Variants
MissingTxOut
NegativeFee
Trait Implementations
Debug
Display
Eq
Error
PartialEq
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToString
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Enum bdk_chain::tx_graph::CalculateFeeError
source Â· 
pub enum CalculateFeeError {
     MissingTxOut(Vec<OutPoint>),
     NegativeFee(SignedAmount),
 }
Expand description
Errors returned by TxGraph::calculate_fee.
 
VariantsÂ§
Â§MissingTxOut(Vec<OutPoint>)
Missing TxOut for one or more of the inputs of the tx
 
Â§NegativeFee(SignedAmount)
When the transaction is invalid according to the graph it has a negative fee
-
Trait ImplementationsÂ§
sourceÂ§impl Debug for CalculateFeeError
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl Display for CalculateFeeError
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl Error for CalculateFeeError
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 PartialEq for CalculateFeeError
sourceÂ§fn eq(&self, other: &CalculateFeeError) -> bool
This method tests for self and other values to be equal, and is used
+
Trait ImplementationsÂ§
sourceÂ§impl Debug for CalculateFeeError
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl Display for CalculateFeeError
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl Error for CalculateFeeError
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 PartialEq for CalculateFeeError
sourceÂ§fn eq(&self, other: &CalculateFeeError) -> 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 Eq for CalculateFeeError
sourceÂ§impl StructuralPartialEq for CalculateFeeError
Auto Trait ImplementationsÂ§
Â§impl Freeze for CalculateFeeError
Â§impl RefUnwindSafe for CalculateFeeError
Â§impl Send for CalculateFeeError
Â§impl Sync for CalculateFeeError
Â§impl Unpin for CalculateFeeError
Â§impl UnwindSafe for CalculateFeeError
Blanket ImplementationsÂ§
sourceÂ§impl<T> Any for Twhere
+sufficient, and should not be overridden without very good reason.
sourceÂ§impl Eq for CalculateFeeError
sourceÂ§impl StructuralPartialEq for CalculateFeeError
Auto Trait ImplementationsÂ§
Â§impl Freeze for CalculateFeeError
Â§impl RefUnwindSafe for CalculateFeeError
Â§impl Send for CalculateFeeError
Â§impl Sync for CalculateFeeError
Â§impl Unpin for CalculateFeeError
Â§impl UnwindSafe for CalculateFeeError
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/tx_graph/index.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
index 7cd445f470..80e1907608 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/index.html
@@ -1,4 +1,4 @@
-bdk_chain::tx_graph - Rust
bdk_chain0.16.0
Module tx_graph
Structs
Enums
In crate bdk_chain
Module bdk_chain::tx_graph
source Â· 
Expand description
Module for structures that store and traverse transactions.
+bdk_chain::tx_graph - Rust
bdk_chain0.16.0
Module tx_graph
Structs
Enums
In crate bdk_chain
Module bdk_chain::tx_graph
source Â· 
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.CanonicalTx.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
index bf0532c65d..c54240842f 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.CanonicalTx.html
@@ -1,17 +1,17 @@
-CanonicalTx in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
CanonicalTx
Fields
chain_position
tx_node
Trait Implementations
Clone
Debug
Eq
Ord
PartialEq
PartialOrd
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::CanonicalTx
source Â· 
pub struct CanonicalTx<'a, T, A> {
+CanonicalTx in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
CanonicalTx
Fields
chain_position
tx_node
Trait Implementations
Clone
Debug
Eq
Ord
PartialEq
PartialOrd
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::CanonicalTx
source Â· 
pub struct CanonicalTx<'a, T, A> {
     pub chain_position: ChainPosition<&'a A>,
     pub tx_node: TxNode<'a, T, A>,
 }
Expand description
A transaction that is included in the chain, or is still in mempool.
 
FieldsÂ§
Â§chain_position: ChainPosition<&'a A>How the transaction is observed as (confirmed or unconfirmed).
 
Â§tx_node: TxNode<'a, T, A>The transaction node (as part of the graph).
-
Trait ImplementationsÂ§
sourceÂ§impl<'a, T: Clone, A: Clone> Clone for CanonicalTx<'a, T, A>
sourceÂ§fn clone(&self) -> CanonicalTx<'a, T, 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, T: Debug, A: Debug> Debug for CanonicalTx<'a, T, A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<'a, T: Ord, A: Ord> Ord for CanonicalTx<'a, T, A>
sourceÂ§fn cmp(&self, other: &CanonicalTx<'a, T, A>) -> Ordering
This method returns an Ordering between self and other. Read more
1.21.0 Â· sourceÂ§fn max(self, other: Self) -> Selfwhere
+
Trait ImplementationsÂ§
sourceÂ§impl<'a, T: Clone, A: Clone> Clone for CanonicalTx<'a, T, A>
sourceÂ§fn clone(&self) -> CanonicalTx<'a, T, 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, T: Debug, A: Debug> Debug for CanonicalTx<'a, T, A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<'a, T: Ord, A: Ord> Ord for CanonicalTx<'a, T, A>
sourceÂ§fn cmp(&self, other: &CanonicalTx<'a, T, A>) -> 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<'a, T: PartialEq, A: PartialEq> PartialEq for CanonicalTx<'a, T, A>
sourceÂ§fn eq(&self, other: &CanonicalTx<'a, T, A>) -> 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<'a, T: PartialEq, A: PartialEq> PartialEq for CanonicalTx<'a, T, A>
sourceÂ§fn eq(&self, other: &CanonicalTx<'a, T, 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, T: PartialOrd, A: PartialOrd> PartialOrd for CanonicalTx<'a, T, A>
sourceÂ§fn partial_cmp(&self, other: &CanonicalTx<'a, T, A>) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 Â· sourceÂ§fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 Â· sourceÂ§fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
+sufficient, and should not be overridden without very good reason.
sourceÂ§impl<'a, T: PartialOrd, A: PartialOrd> PartialOrd for CanonicalTx<'a, T, A>
sourceÂ§fn partial_cmp(&self, other: &CanonicalTx<'a, T, A>) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 Â· sourceÂ§fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 Â· sourceÂ§fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
 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<'a, T: Eq, A: Eq> Eq for CanonicalTx<'a, T, A>
sourceÂ§impl<'a, T, A> StructuralPartialEq for CanonicalTx<'a, T, A>
Auto Trait ImplementationsÂ§
Â§impl<'a, T, A> Freeze for CanonicalTx<'a, T, A>where
+operator. Read more
sourceÂ§impl<'a, T: Eq, A: Eq> Eq for CanonicalTx<'a, T, A>
sourceÂ§impl<'a, T, A> StructuralPartialEq for CanonicalTx<'a, T, A>
Auto Trait ImplementationsÂ§
Â§impl<'a, T, A> Freeze for CanonicalTx<'a, T, A>where
     T: Freeze,
Â§impl<'a, T, A> RefUnwindSafe for CanonicalTx<'a, T, A>where
     T: RefUnwindSafe,
     A: RefUnwindSafe,
Â§impl<'a, T, A> Send for CanonicalTx<'a, T, A>where
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 f92f58f07a..377d9dea3d 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
bdk_chain0.16.0
ChangeSet
Fields
anchors
last_seen
txouts
txs
Methods
anchor_heights
map_anchors
txouts
Trait Implementations
Append
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<A>>
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 = ()> {
+ChangeSet in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
ChangeSet
Fields
anchors
last_seen
txouts
txs
Methods
anchor_heights
map_anchors
txouts
Trait Implementations
Append
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<A>>
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,22 +11,22 @@ 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.
-
Trait ImplementationsÂ§
sourceÂ§impl<A: Ord> Append for ChangeSet<A>
sourceÂ§fn append(&mut self, other: Self)
Append another object of the same type onto self.
sourceÂ§fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
sourceÂ§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<A: 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: 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: Ord> Append for ChangeSet<A>
sourceÂ§fn append(&mut self, other: Self)
Append another object of the same type onto self.
sourceÂ§fn is_empty(&self) -> bool
Returns whether the structure is considered empty.
sourceÂ§fn take(&mut self) -> Option<Self>
Take the value, replacing it with the default value.
sourceÂ§impl<A: 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: 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 a0f45e81f7..f580a680ac 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,8 +1,8 @@
-TxAncestors in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxAncestors
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
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> { /* private fields */ }
Expand description
An iterator that traverses ancestors of a given root transaction.
+TxAncestors in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxAncestors
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
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> { /* 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.
-
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxAncestors<'g, A, F>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>(
+
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxAncestors<'g, A, F>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
@@ -194,9 +194,9 @@ function. 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
Â§impl<I> ByteIterExt for Iwhere
     I: Iterator<Item = u8>,
Â§fn bytes_to_fes(self) -> BytesToFes<Self>
Adapts the byte iterator to output GF32 field elements instead. Read more
Â§impl<T> CheckedSum<Amount> for Twhere
-    T: Iterator<Item = Amount>,
Â§fn checked_sum(self) -> Option<Amount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
+    T: Iterator<Item = Amount>,
Â§fn checked_sum(self) -> Option<Amount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
 happen it returns None.
Â§impl<T> CheckedSum<SignedAmount> for Twhere
-    T: Iterator<Item = SignedAmount>,
Â§fn checked_sum(self) -> Option<SignedAmount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
+    T: Iterator<Item = SignedAmount>,
Â§fn checked_sum(self) -> Option<SignedAmount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
 happen it returns None.
Â§impl<I> Fe32IterExt for Iwhere
     I: Iterator<Item = Fe32>,
Â§fn fes_to_bytes(self) -> FesToBytes<Self>
Adapts the Fe32 iterator to output bytes instead. Read more
Â§fn with_checksum<Ck>(self, hrp: &Hrp) -> Encoder<'_, Self, Ck>where
     Ck: Checksum,
Adapts the Fe32 iterator to encode the field elements into a bech32 address.
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/tx_graph/struct.TxDescendants.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxDescendants.html
index 897d52e845..0cad2538dc 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,7 +1,7 @@
-TxDescendants in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxDescendants
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
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> { /* private fields */ }
Expand description
An iterator that traverses transaction descendants.
+TxDescendants in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxDescendants
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
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> { /* private fields */ }
Expand description
An iterator that traverses transaction descendants.
 Returned by the walk_descendants method of TxGraph.
-
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxDescendants<'g, A, F>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>(
+
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxDescendants<'g, A, F>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
@@ -193,9 +193,9 @@ function. 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
Â§impl<I> ByteIterExt for Iwhere
     I: Iterator<Item = u8>,
Â§fn bytes_to_fes(self) -> BytesToFes<Self>
Adapts the byte iterator to output GF32 field elements instead. Read more
Â§impl<T> CheckedSum<Amount> for Twhere
-    T: Iterator<Item = Amount>,
Â§fn checked_sum(self) -> Option<Amount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
+    T: Iterator<Item = Amount>,
Â§fn checked_sum(self) -> Option<Amount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
 happen it returns None.
Â§impl<T> CheckedSum<SignedAmount> for Twhere
-    T: Iterator<Item = SignedAmount>,
Â§fn checked_sum(self) -> Option<SignedAmount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
+    T: Iterator<Item = SignedAmount>,
Â§fn checked_sum(self) -> Option<SignedAmount>
Calculate the sum over the iterator using checked arithmetic. If an over or underflow would
 happen it returns None.
Â§impl<I> Fe32IterExt for Iwhere
     I: Iterator<Item = Fe32>,
Â§fn fes_to_bytes(self) -> FesToBytes<Self>
Adapts the Fe32 iterator to output bytes instead. Read more
Â§fn with_checksum<Ck>(self, hrp: &Hrp) -> Encoder<'_, Self, Ck>where
     Ck: Checksum,
Adapts the Fe32 iterator to encode the field elements into a bech32 address.
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/tx_graph/struct.TxGraph.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/bdk_chain/tx_graph/struct.TxGraph.html
index 24beb02cc6..718742f2d1 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
@@ -1,18 +1,21 @@
-TxGraph in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxGraph
Methods
all_anchors
all_txouts
apply_changeset
apply_update
balance
batch_insert_unconfirmed
calculate_fee
direct_conflicts
filter_chain_txouts
filter_chain_unspents
floating_txouts
full_txs
get_chain_position
get_chain_spend
get_tx
get_tx_node
get_txout
initial_changeset
insert_anchor
insert_seen_at
insert_tx
insert_txout
is_empty
list_chain_txs
map_anchors
new
outspends
try_balance
try_filter_chain_txouts
try_filter_chain_unspents
try_get_chain_position
try_get_chain_spend
try_list_chain_txs
tx_outputs
tx_spends
update_last_seen_unconfirmed
walk_ancestors
walk_conflicts
walk_descendants
Trait Implementations
AsRef<TxGraph<A>>
AsRef<TxGraph<A>>
Clone
Debug
Default
PartialEq
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxGraph
source Â· 
pub struct TxGraph<A = ()> { /* private fields */ }
Expand description
A graph of transactions and spends.
+TxGraph in bdk_chain::tx_graph - Rust
bdk_chain0.16.0
TxGraph
Methods
all_anchors
all_txouts
apply_changeset
apply_update
balance
batch_insert_unconfirmed
calculate_fee
direct_conflicts
filter_chain_txouts
filter_chain_unspents
floating_txouts
full_txs
get_chain_position
get_chain_spend
get_tx
get_tx_node
get_txout
initial_changeset
insert_anchor
insert_seen_at
insert_tx
insert_txout
is_empty
list_canonical_txs
map_anchors
new
outspends
try_balance
try_filter_chain_txouts
try_filter_chain_unspents
try_get_chain_position
try_get_chain_spend
try_list_canonical_txs
tx_outputs
tx_spends
txs_with_no_anchor_or_last_seen
update_last_seen_unconfirmed
walk_ancestors
walk_conflicts
walk_descendants
Trait Implementations
AsRef<TxGraph<A>>
AsRef<TxGraph<A>>
Clone
Debug
Default
PartialEq
StructuralPartialEq
Auto Trait Implementations
Freeze
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
From<T>
Into<U>
ToOwned
TryFrom<U>
TryInto<U>
VZip<V>
In bdk_chain::tx_graph
Struct bdk_chain::tx_graph::TxGraph
source Â· 
pub struct TxGraph<A = ()> { /* private fields */ }
Expand description
A graph of transactions and spends.
 See the module-level documentation for more.
-
ImplementationsÂ§
sourceÂ§impl<A> TxGraph<A>
sourcepub fn all_txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterate over all tx outputs known by TxGraph.
+
ImplementationsÂ§
sourceÂ§impl<A> TxGraph<A>
sourcepub fn all_txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterate over all tx outputs known by TxGraph.
 This includes txouts of both full transactions as well as floating transactions.
-
sourcepub fn floating_txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterate over floating txouts known by TxGraph.
+
sourcepub fn floating_txouts(&self) -> impl Iterator<Item = (OutPoint, &TxOut)>
Iterate over floating txouts known by TxGraph.
 Floating txouts are txouts that do not have the residing full transaction contained in the
 graph.
-
sourcepub fn full_txs(&self) -> impl Iterator<Item = TxNode<'_, Arc<Transaction>, A>>
Iterate over all full transactions in the graph.
-
sourcepub fn get_tx(&self, txid: Txid) -> Option<Arc<Transaction>>
Get a transaction by txid. This only returns Some for full transactions.
+
sourcepub fn full_txs(&self) -> impl Iterator<Item = TxNode<'_, Arc<Transaction>, A>>
Iterate over all full transactions in the graph.
+
sourcepub fn txs_with_no_anchor_or_last_seen(
+    &self
+) -> impl Iterator<Item = TxNode<'_, Arc<Transaction>, A>>
Iterate over graph transactions with no anchors or last-seen.
+
sourcepub fn get_tx(&self, txid: Txid) -> Option<Arc<Transaction>>
Get a transaction by txid. This only returns Some for full transactions.
 Refer to get_txout for getting a specific [TxOut].
-
sourcepub fn get_tx_node(&self, txid: Txid) -> Option<TxNode<'_, Arc<Transaction>, A>>
Get a transaction node by txid. This only returns Some for full transactions.
-
sourcepub fn get_txout(&self, outpoint: OutPoint) -> Option<&TxOut>
Obtains a single tx output (if any) at the specified outpoint.
-
sourcepub fn tx_outputs(&self, txid: Txid) -> Option<BTreeMap<u32, &TxOut>>
Returns known outputs of a given txid.
+
sourcepub fn get_tx_node(&self, txid: Txid) -> Option<TxNode<'_, Arc<Transaction>, A>>
Get a transaction node by txid. This only returns Some for full transactions.
+
sourcepub fn get_txout(&self, outpoint: OutPoint) -> Option<&TxOut>
Obtains a single tx output (if any) at the specified outpoint.
+
sourcepub fn tx_outputs(&self, txid: Txid) -> Option<BTreeMap<u32, &TxOut>>
Returns known outputs of a given txid.
 Returns a BTreeMap of vout to output of the provided txid.
-
sourcepub fn calculate_fee(
+
sourcepub fn calculate_fee(
     &self,
     tx: &Transaction
 ) -> Result<Amount, CalculateFeeError>
Calculates the fee of a given transaction. Returns [Amount::ZERO] if tx is a coinbase transaction.
@@ -22,10 +25,10 @@ the full transactions or individual txouts).
 first manually insert the foreign TxOuts into the tx graph using the insert_txout function.
 Only insert TxOuts you trust the values for!
 Note tx does not have to be in the graph for this to work.
-
sourcepub fn outspends(&self, outpoint: OutPoint) -> &HashSet<Txid>
The transactions spending from this output.
+
sourcepub fn outspends(&self, outpoint: OutPoint) -> &HashSet<Txid>
The transactions spending from this output.
 TxGraph allows conflicting transactions within the graph. Obviously the transactions in
 the returned set will never be in the same active-chain.
-
sourcepub fn tx_spends(
+
sourcepub fn tx_spends(
     &self,
     txid: Txid
 ) -> impl DoubleEndedIterator<Item = (u32, &HashSet<Txid>)> + '_
Iterates over the transactions spending from txid.
@@ -34,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
@@ -51,7 +54,7 @@ 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
@@ -65,7 +68,7 @@ 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>(
+

Trait ImplementationsÂ§

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

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

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

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

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

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

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

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

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

fn default() -> Self

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

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

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

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

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

fn from(indexed_tx_graph: ChangeSet<A, ChangeSet<K>>) -> Self

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

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

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

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

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

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

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

fn from(indexed_tx_graph: ChangeSet<A, ChangeSet<K>>) -> Self

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

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

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

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

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

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

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

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

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

FieldsÂ§

Trait ImplementationsÂ§

impl Clone for CannotConnectError

fn clone(&self) -> CannotConnectError

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

impl Debug for CannotConnectError

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

impl Display for CannotConnectError

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

impl Error for CannotConnectError

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 PartialEq for CannotConnectError

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

Trait ImplementationsÂ§

impl Clone for CannotConnectError

fn clone(&self) -> CannotConnectError

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

impl Debug for CannotConnectError

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

impl Display for CannotConnectError

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

impl<'de, A, IA> Deserialize<'de> for ChangeSet<A, IA>
where A: Ord + Deserialize<'de>, IA: 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,

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

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

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

fn hash_slice<H>(data: &[Self], state: &mut H)
where + __D: Deserializer<'de>,

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

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

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

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

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