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 is a monotone structure that inserts transactions and indexes the spends. The ChangeSet structure reports changes of TxGraph but can also be applied to a TxGraph as well. Lastly, TxDescendants is an Iterator that traverses descendants of 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 4434938606..973d9b2544 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
ChangeSet
Fields
anchors
last_seen
txouts
txs
Methods
anchor_heights
is_empty
missing_heights_from
txouts
Trait Implementations
Append
Clone
Debug
Default
Deserialize<'de>
From<ChangeSet<A>>
PartialEq<ChangeSet<A>>
Serialize
StructuralPartialEq
Auto Trait Implementations
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<Transaction>,
     pub txouts: BTreeMap<OutPoint, TxOut>,
     pub anchors: BTreeSet<(A, Txid)>,
@@ -11,19 +11,19 @@ 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 is_empty(&self) -> bool
Returns true if the ChangeSet is empty (no transactions or txouts).
-
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.
+
ImplementationsÂ§
sourceÂ§impl<A> ChangeSet<A>
sourcepub fn is_empty(&self) -> bool
Returns true if the ChangeSet is empty (no transactions or txouts).
+
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.
 See also: TxGraph::missing_heights
-
sourcepub fn missing_heights_from<'a>(
    &'a self,
    local_chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'awhere
    A: Anchor,
Returns an iterator for the anchor_heights in this changeset that are not included in
+
sourcepub fn missing_heights_from<'a>(
    &'a self,
    local_chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'awhere
    A: Anchor,
Returns an iterator for the anchor_heights in this changeset that are not included in
 local_chain. This tells you which heights you need to include in local_chain in order
 for it to conclusively act as a ChainOracle for the transaction anchors this changeset
 will add.
-
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Â§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<ChangeSet<A>> 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Â§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<ChangeSet<A>> 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 ==. Read more
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. Read more
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> 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
    A: RefUnwindSafe,
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,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
+sufficient, and should not be overridden without very good reason. Read more
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> 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
    A: RefUnwindSafe,
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,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
 
sourceÂ§impl<T, U> Into<U> for Twhere
    U: From<T>,
const: unstable Â· sourceÂ§fn into(self) -> U
Calls U::from(self).
 That is, this conversion is whatever the implementation of
 From<T> for U chooses to do.
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 0dfcd138a1..7aba9598fc 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,7 +1,7 @@
-TxAncestors in bdk_chain::tx_graph - Rust
TxAncestors
Trait Implementations
Iterator
Auto Trait Implementations
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
CheckedSum<Amount>
CheckedSum<SignedAmount>
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
TxAncestors
Trait Implementations
Iterator
Auto Trait Implementations
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
CheckedSum<Amount>
CheckedSum<SignedAmount>
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.
 This struct is created 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, &'g 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
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.0.0 Â· sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
+
Trait ImplementationsÂ§
sourceÂ§impl<'g, A, F, O> Iterator for TxAncestors<'g, A, F>where
    F: FnMut(usize, &'g 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
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.0.0 Â· sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
 the given amount at each iteration. Read more
1.0.0 Â· sourceÂ§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 Â· sourceÂ§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator,
âZips upâ two iterators into a single iterator of pairs. Read more
sourceÂ§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
    Self: Sized,
    G: FnMut() -> Self::Item,
ð¬This is a nightly-only experimental API. (iter_intersperse)Creates a new iterator which places an item generated by separator
 between adjacent items of the original iterator. Read more
1.0.0 Â· sourceÂ§fn map<B, F>(self, f: F) -> Map<Self, F>where
    Self: Sized,
    F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each
 element. Read more
1.21.0 Â· sourceÂ§fn for_each<F>(self, f: F)where
    Self: Sized,
    F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
1.0.0 Â· sourceÂ§fn filter<P>(self, predicate: P) -> Filter<Self, P>where
    Self: Sized,
    P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element
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 e520deba64..e8c0f32ac7 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,6 +1,6 @@
-TxDescendants in bdk_chain::tx_graph - Rust
TxDescendants
Trait Implementations
Iterator
Auto Trait Implementations
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
CheckedSum<Amount>
CheckedSum<SignedAmount>
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
TxDescendants
Trait Implementations
Iterator
Auto Trait Implementations
RefUnwindSafe
Send
Sync
Unpin
UnwindSafe
Blanket Implementations
Any
Borrow<T>
BorrowMut<T>
CheckedSum<Amount>
CheckedSum<SignedAmount>
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.
 This struct is created 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>(
    &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
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.0.0 Â· sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
+
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
    Self: Sized,
Consumes the iterator, counting the number of iterations and returning it. Read more
1.0.0 Â· sourceÂ§fn last(self) -> Option<Self::Item>where
    Self: Sized,
Consumes the iterator, returning the last element. Read more
sourceÂ§fn advance_by(&mut self, n: usize) -> Result<(), usize>
ð¬This is a nightly-only experimental API. (iter_advance_by)Advances the iterator by n elements. Read more
1.0.0 Â· sourceÂ§fn nth(&mut self, n: usize) -> Option<Self::Item>
Returns the nth element of the iterator. Read more
1.28.0 Â· sourceÂ§fn step_by(self, step: usize) -> StepBy<Self>where
    Self: Sized,
Creates an iterator starting at the same point, but stepping by
 the given amount at each iteration. Read more
1.0.0 Â· sourceÂ§fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator<Item = Self::Item>,
Takes two iterators and creates a new iterator over both in sequence. Read more
1.0.0 Â· sourceÂ§fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>where
    Self: Sized,
    U: IntoIterator,
âZips upâ two iterators into a single iterator of pairs. Read more
sourceÂ§fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>where
    Self: Sized,
    G: FnMut() -> Self::Item,
ð¬This is a nightly-only experimental API. (iter_intersperse)Creates a new iterator which places an item generated by separator
 between adjacent items of the original iterator. Read more
1.0.0 Â· sourceÂ§fn map<B, F>(self, f: F) -> Map<Self, F>where
    Self: Sized,
    F: FnMut(Self::Item) -> B,
Takes a closure and creates an iterator which calls that closure on each
 element. Read more
1.21.0 Â· sourceÂ§fn for_each<F>(self, f: F)where
    Self: Sized,
    F: FnMut(Self::Item),
Calls a closure on each element of an iterator. Read more
1.0.0 Â· sourceÂ§fn filter<P>(self, predicate: P) -> Filter<Self, P>where
    Self: Sized,
    P: FnMut(&Self::Item) -> bool,
Creates an iterator which uses a closure to determine if an element
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 b3256c4c4d..8ef66db451 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
@@ -84,36 +84,36 @@ transactions.
 exist in update but not in self).
 
sourcepub fn initial_changeset(&self) -> ChangeSet<A>
Determines the ChangeSet between self and an empty TxGraph.
 
sourcepub fn apply_changeset(&mut self, changeset: ChangeSet<A>)
Applies ChangeSet to TxGraph.
-
sourceÂ§impl<A: Anchor> TxGraph<A>
sourcepub fn missing_heights<'a>(
    &'a self,
    chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'a
Find missing block heights of chain.
+
sourceÂ§impl<A: Anchor> TxGraph<A>
sourcepub fn missing_heights<'a>(
    &'a self,
    chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'a
Find missing block heights of chain.
 This works by scanning through anchors, and seeing whether the anchor block of the anchor
 exists in the LocalChain. The returned iterator does not output duplicate heights.
-
sourcepub fn try_get_chain_position<C: ChainOracle>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    txid: Txid
) -> Result<Option<ChainPosition<&A>>, C::Error>
Get the position of the transaction in chain with tip chain_tip.
+
sourcepub fn try_get_chain_position<C: ChainOracle>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    txid: Txid
) -> Result<Option<ChainPosition<&A>>, C::Error>
Get the position of the transaction in chain with tip chain_tip.
 If the given transaction of txid does not exist in the chain of chain_tip, None is
 returned.
 Error
 An error will occur if the ChainOracle implementation (chain) fails. If the
 ChainOracle is infallible, get_chain_position can be used instead.
-
sourcepub fn get_chain_position<C: ChainOracle<Error = Infallible>>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    txid: Txid
) -> Option<ChainPosition<&A>>
Get the position of the transaction in chain with tip chain_tip.
+
sourcepub fn get_chain_position<C: ChainOracle<Error = Infallible>>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    txid: Txid
) -> Option<ChainPosition<&A>>
Get the position of the transaction in chain with tip chain_tip.
 This is the infallible version of try_get_chain_position.
-
sourcepub fn try_get_chain_spend<C: ChainOracle>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoint: OutPoint
) -> Result<Option<(ChainPosition<&A>, Txid)>, C::Error>
Get the txid of the spending transaction and where the spending transaction is observed in
+
sourcepub fn try_get_chain_spend<C: ChainOracle>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoint: OutPoint
) -> Result<Option<(ChainPosition<&A>, Txid)>, C::Error>
Get the txid of the spending transaction and where the spending transaction is observed in
 the chain of chain_tip.
 If no in-chain transaction spends outpoint, None will be returned.
 Error
 An error will occur only if the ChainOracle implementation (chain) fails.
 If the ChainOracle is infallible, get_chain_spend can be used instead.
-
sourcepub fn get_chain_spend<C: ChainOracle<Error = Infallible>>(
    &self,
    chain: &C,
    static_block: BlockId,
    outpoint: OutPoint
) -> Option<(ChainPosition<&A>, Txid)>
Get the txid of the spending transaction and where the spending transaction is observed in
+
sourcepub fn get_chain_spend<C: ChainOracle<Error = Infallible>>(
    &self,
    chain: &C,
    static_block: BlockId,
    outpoint: OutPoint
) -> Option<(ChainPosition<&A>, Txid)>
Get the txid of the spending transaction and where the spending transaction is observed in
 the chain of chain_tip.
 This is the infallible version of try_get_chain_spend
-
sourcepub fn try_list_chain_txs<'a, C: ChainOracle + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId
) -> impl Iterator<Item = Result<CanonicalTx<'a, Transaction, A>, C::Error>>
List graph transactions that are in chain with chain_tip.
+
sourcepub fn try_list_chain_txs<'a, C: ChainOracle + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId
) -> impl Iterator<Item = Result<CanonicalTx<'a, Transaction, A>, C::Error>>
List graph transactions that are in chain with chain_tip.
 Each transaction is represented as a CanonicalTx that contains where the transaction is
 observed in-chain, and the TxNode.
 Error
 If the ChainOracle implementation (chain) fails, an error will be returned with the
 returned item.
 If the ChainOracle is infallible, list_chain_txs can be used instead.
-
sourcepub fn list_chain_txs<'a, C: ChainOracle + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId
) -> impl Iterator<Item = CanonicalTx<'a, Transaction, A>>
List graph transactions that are in chain with chain_tip.
+
sourcepub fn list_chain_txs<'a, C: ChainOracle + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId
) -> impl Iterator<Item = CanonicalTx<'a, Transaction, A>>
List graph transactions that are in chain with chain_tip.
 This is the infallible version of try_list_chain_txs.
-
sourcepub fn try_filter_chain_txouts<'a, C: ChainOracle + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = Result<(OI, FullTxOut<A>), C::Error>> + 'a
Get a filtered list of outputs from the given outpoints that are in chain with
+
sourcepub fn try_filter_chain_txouts<'a, C: ChainOracle + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = Result<(OI, FullTxOut<A>), C::Error>> + 'a
Get a filtered list of outputs from the given outpoints that are in chain with
 chain_tip.
 outpoints is a list of outpoints we are interested in, coupled with an outpoint identifier
 (OI) for convenience. If OI is not necessary, the caller can use (), or
@@ -124,10 +124,10 @@ returned item.
 fails.
 If the ChainOracle implementation is infallible, filter_chain_txouts can be used
 instead.
-
sourcepub fn filter_chain_txouts<'a, C: ChainOracle<Error = Infallible> + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = (OI, FullTxOut<A>)> + 'a
Get a filtered list of outputs from the given outpoints that are in chain with
+
sourcepub fn filter_chain_txouts<'a, C: ChainOracle<Error = Infallible> + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = (OI, FullTxOut<A>)> + 'a
Get a filtered list of outputs from the given outpoints that are in chain with
 chain_tip.
 This is the infallible version of try_filter_chain_txouts.
-
sourcepub fn try_filter_chain_unspents<'a, C: ChainOracle + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = Result<(OI, FullTxOut<A>), C::Error>> + 'a
Get a filtered list of unspent outputs (UTXOs) from the given outpoints that are in
+
sourcepub fn try_filter_chain_unspents<'a, C: ChainOracle + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = Result<(OI, FullTxOut<A>), C::Error>> + 'a
Get a filtered list of unspent outputs (UTXOs) from the given outpoints that are in
 chain with chain_tip.
 outpoints is a list of outpoints we are interested in, coupled with an outpoint identifier
 (OI) for convenience. If OI is not necessary, the caller can use (), or
@@ -138,19 +138,19 @@ instead.
 fails.
 If the ChainOracle implementation is infallible, filter_chain_unspents can be used
 instead.
-
sourcepub fn filter_chain_unspents<'a, C: ChainOracle<Error = Infallible> + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    txouts: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = (OI, FullTxOut<A>)> + 'a
Get a filtered list of unspent outputs (UTXOs) from the given outpoints that are in
+
sourcepub fn filter_chain_unspents<'a, C: ChainOracle<Error = Infallible> + 'a, OI: Clone + 'a>(
    &'a self,
    chain: &'a C,
    chain_tip: BlockId,
    txouts: impl IntoIterator<Item = (OI, OutPoint)> + 'a
) -> impl Iterator<Item = (OI, FullTxOut<A>)> + 'a
Get a filtered list of unspent outputs (UTXOs) from the given outpoints that are in
 chain with chain_tip.
 This is the infallible version of try_filter_chain_unspents.
-
sourcepub fn try_balance<C: ChainOracle, OI: Clone>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)>,
    trust_predicate: impl FnMut(&OI, &Script) -> bool
) -> Result<Balance, C::Error>
Get the total balance of outpoints that are in chain of chain_tip.
+
sourcepub fn try_balance<C: ChainOracle, OI: Clone>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)>,
    trust_predicate: impl FnMut(&OI, &Script) -> bool
) -> Result<Balance, C::Error>
Get the total balance of outpoints that are in chain of chain_tip.
 The output of trust_predicate should return true for scripts that we trust.
 outpoints is a list of outpoints we are interested in, coupled with an outpoint identifier
 (OI) for convenience. If OI is not necessary, the caller can use (), or
 Iterator::enumerate over a list of [OutPoint]s.
 If the provided ChainOracle implementation (chain) is infallible, balance can be
 used instead.
-
sourcepub fn balance<C: ChainOracle<Error = Infallible>, OI: Clone>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)>,
    trust_predicate: impl FnMut(&OI, &Script) -> bool
) -> Balance
Get the total balance of outpoints that are in chain of chain_tip.
+
sourcepub fn balance<C: ChainOracle<Error = Infallible>, OI: Clone>(
    &self,
    chain: &C,
    chain_tip: BlockId,
    outpoints: impl IntoIterator<Item = (OI, OutPoint)>,
    trust_predicate: impl FnMut(&OI, &Script) -> bool
) -> Balance
Get the total balance of outpoints that are in chain of chain_tip.
 This is the infallible version of try_balance.
-
Trait ImplementationsÂ§
sourceÂ§impl<A> AsRef<TxGraph<A>> for TxGraph<A>
sourceÂ§fn as_ref(&self) -> &TxGraph<A>
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl<A: Clone> Clone for TxGraph<A>
sourceÂ§fn clone(&self) -> TxGraph<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 TxGraph<A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<A> Default for TxGraph<A>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<A: PartialEq> PartialEq<TxGraph<A>> for TxGraph<A>
sourceÂ§fn eq(&self, other: &TxGraph<A>) -> bool
This method tests for self and other values to be equal, and is used
+
Trait ImplementationsÂ§
sourceÂ§impl<A> AsRef<TxGraph<A>> for TxGraph<A>
sourceÂ§fn as_ref(&self) -> &TxGraph<A>
Converts this type into a shared reference of the (usually inferred) input type.
sourceÂ§impl<A: Clone> Clone for TxGraph<A>
sourceÂ§fn clone(&self) -> TxGraph<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 TxGraph<A>
sourceÂ§fn fmt(&self, f: &mut Formatter<'_>) -> Result
Formats the value using the given formatter. Read more
sourceÂ§impl<A> Default for TxGraph<A>
sourceÂ§fn default() -> Self
Returns the âdefault valueâ for a type. Read more
sourceÂ§impl<A: PartialEq> PartialEq<TxGraph<A>> for TxGraph<A>
sourceÂ§fn eq(&self, other: &TxGraph<A>) -> bool
This method tests for self and other values to be equal, and is used
 by ==. Read more
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. Read more
sourceÂ§impl<A> StructuralPartialEq for TxGraph<A>
Auto Trait ImplementationsÂ§
Â§impl<A> RefUnwindSafe for TxGraph<A>where
    A: RefUnwindSafe,
Â§impl<A> Send for TxGraph<A>where
    A: Send,
Â§impl<A> Sync for TxGraph<A>where
    A: Sync,
Â§impl<A> Unpin for TxGraph<A>
Â§impl<A> UnwindSafe for TxGraph<A>where
    A: RefUnwindSafe,
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,
const: unstable Â· sourceÂ§fn borrow(&self) -> &T
Immutably borrows from an owned value. Read more
sourceÂ§impl<T> BorrowMut<T> for Twhere
    T: ?Sized,
const: unstable Â· sourceÂ§fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceÂ§impl<T> From<T> for T
const: unstable Â· sourceÂ§fn from(t: T) -> T
Returns the argument unchanged.
 
sourceÂ§impl<T, U> Into<U> for Twhere
    U: From<T>,
const: unstable Â· sourceÂ§fn into(self) -> U
Calls U::from(self).
diff --git a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
index d71de4327e..ff635ca273 100644
--- a/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
+++ b/docs/.vuepress/public/docs-rs/bdk/nightly/latest/src/bdk_chain/tx_graph.rs.html
@@ -1477,6 +1477,13 @@
 1477
 1478
 1479
+1480
+1481
+1482
+1483
+1484
+1485
+1486

//! Module for structures that store and traverse transactions.
 //!
 //! [`TxGraph`] is a monotone structure that inserts transactions and indexes the spends. The
@@ -2197,7 +2204,14 @@
         // might be in mempool, or it might have been dropped already.
         // Let's check conflicts to find out!
         let tx = match tx_node {
-            TxNodeInternal::Whole(tx) => tx,
+            TxNodeInternal::Whole(tx) => {
+                // A coinbase tx that is not anchored in the best chain cannot be unconfirmed and
+                // should always be filtered out.
+                if tx.is_coin_base() {
+                    return Ok(None);
+                }
+                tx
+            }
             TxNodeInternal::Partial(_) => {
                 // Partial transactions (outputs only) cannot have conflicts.
                 return Ok(None);

Required MethodsÂ§

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

Implementations on Foreign TypesÂ§

impl<K: Ord, V> Append for BTreeMap<K, V>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T: Ord> Append for BTreeSet<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T> Append for Vec<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl Append for ()

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0> Append for (T0,)where T0: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1> Append for (T0, T1)where T0: Append, T1: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2> Append for (T0, T1, T2)where T0: Append, T1: Append, T2: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3> Append for (T0, T1, T2, T3)where T0: Append, T1: Append, T2: Append, T3: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4> Append for (T0, T1, T2, T3, T4)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5> Append for (T0, T1, T2, T3, T4, T5)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6> Append for (T0, T1, T2, T3, T4, T5, T6)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append, T6: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7> Append for (T0, T1, T2, T3, T4, T5, T6, T7)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append, T6: Append, T7: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append, T6: Append, T7: Append, T8: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append, T6: Append, T7: Append, T8: Append, T9: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append, T5: Append, T6: Append, T7: Append, T8: Append, T9: Append, T10: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

ImplementorsÂ§

impl<A: Ord> Append for bdk_chain::tx_graph::ChangeSet<A>

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

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

Implementations on Foreign TypesÂ§

impl<K: Ord, V> Append for BTreeMap<K, V>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T: Ord> Append for BTreeSet<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl<T> Append for Vec<T>

fn append(&mut self, other: Self)

fn is_empty(&self) -> bool

impl Append for ()

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0> Append for (T0,)where T0: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1> Append for (T0, T1)where T0: Append, T1: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2> Append for (T0, T1, T2)where T0: Append, T1: Append, T2: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3> Append for (T0, T1, T2, T3)where T0: Append, T1: Append, T2: Append, T3: Append,

fn append(&mut self, _other: Self)

fn is_empty(&self) -> bool

impl<T0, T1, T2, T3, T4> Append for (T0, T1, T2, T3, T4)where T0: Append, T1: Append, T2: Append, T3: Append, T4: Append,

fn append(&mut self, _other: Self)

impl<T0> Append for (T0,)where
T0: Append,

impl<T0, T1> Append for (T0, T1)where
T0: Append,
T1: Append,

impl<T0, T1, T2> Append for (T0, T1, T2)where
T0: Append,
T1: Append,
T2: Append,

impl<T0, T1, T2, T3> Append for (T0, T1, T2, T3)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,

impl<T0, T1, T2, T3, T4> Append for (T0, T1, T2, T3, T4)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,

impl<T0, T1, T2, T3, T4, T5> Append for (T0, T1, T2, T3, T4, T5)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,

impl<T0, T1, T2, T3, T4, T5, T6> Append for (T0, T1, T2, T3, T4, T5, T6)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7> Append for (T0, T1, T2, T3, T4, T5, T6, T7)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,
T9: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,
T9: Append,
T10: Append,

impl<T0> Append for (T0,)where
T0: Append,

impl<T0, T1> Append for (T0, T1)where
T0: Append,
T1: Append,

impl<T0, T1, T2> Append for (T0, T1, T2)where
T0: Append,
T1: Append,
T2: Append,

impl<T0, T1, T2, T3> Append for (T0, T1, T2, T3)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,

impl<T0, T1, T2, T3, T4> Append for (T0, T1, T2, T3, T4)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,

impl<T0, T1, T2, T3, T4, T5> Append for (T0, T1, T2, T3, T4, T5)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,

impl<T0, T1, T2, T3, T4, T5, T6> Append for (T0, T1, T2, T3, T4, T5, T6)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7> Append for (T0, T1, T2, T3, T4, T5, T6, T7)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,
T9: Append,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> Append for (T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10)where
T0: Append,
T1: Append,
T2: Append,
T3: Append,
T4: Append,
T5: Append,
T6: Append,
T7: Append,
T8: Append,
T9: Append,
T10: Append,

pub fn anchor_heights(&self) -> impl Iterator<Item = u32> + '_where
A: Anchor,

pub fn anchor_heights(&self) -> impl Iterator<Item = u32> + '_where
A: Anchor,

pub fn missing_heights_from<'a>(
&'a self,
local_chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'awhere
A: Anchor,

pub fn missing_heights_from<'a>(
&'a self,
local_chain: &'a LocalChain
) -> impl Iterator<Item = u32> + 'awhere
A: Anchor,