From 486e0e143741a8c1312e7cb5258b3d43256dc9ec Mon Sep 17 00:00:00 2001 From: Daniela Brozzoni Date: Fri, 29 Sep 2023 15:48:42 +0200 Subject: [PATCH] doc(chain): Fix typos Co-authored-by: Wei Chen --- crates/chain/src/tx_graph.rs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/crates/chain/src/tx_graph.rs b/crates/chain/src/tx_graph.rs index cfd2de9d..95797f28 100644 --- a/crates/chain/src/tx_graph.rs +++ b/crates/chain/src/tx_graph.rs @@ -324,10 +324,10 @@ impl TxGraph { /// The supplied closure takes in two inputs `(depth, descendant_txid)`: /// /// * `depth` is the distance between the starting `txid` and the `descendant_txid`. I.e., if the - /// descendant is spending an output of the starting `txid`; the `depth` will be 1. + /// descendant is spending an output of the starting `txid` then `depth` will be 1. /// * `descendant_txid` is the descendant's txid which we are considering to walk. /// - /// The supplied closure returns an `Option`, allowing the caller to map each node it vists + /// The supplied closure returns an `Option`, allowing the caller to map each node it visits /// and decide whether to visit descendants. pub fn walk_descendants<'g, F, O>(&'g self, txid: Txid, walk_map: F) -> TxDescendants where @@ -1173,7 +1173,7 @@ impl<'g, A, F> TxDescendants<'g, A, F> { descendants } - /// Creates a `TxDescendants` from multiple starting transactions that include the starting + /// Creates a `TxDescendants` from multiple starting transactions that includes the starting /// `txid`s when iterating. pub(crate) fn from_multiple_include_root( graph: &'g TxGraph,