We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents eadc8b4 + c23b445 commit 61464cfCopy full SHA for 61464cf
piecrust/src/call_tree.rs
@@ -76,7 +76,7 @@ impl CallTree {
76
})
77
}
78
79
- /// Give the current node the amount spent and recusively update amount
+ /// Give the current node the amount spent and recursively update amount
80
/// spent to accurately reflect what each node spent during each call.
81
pub(crate) fn update_spent(&mut self, spent: u64) {
82
if let Some(inner) = self.0 {
@@ -192,7 +192,7 @@ impl CallTreeNode {
192
193
/// An iterator over a [`CallTree`].
194
///
195
-/// It starts at the righmost node and proceeds leftward towards its siblings,
+/// It starts at the rightmost node and proceeds leftward towards its siblings,
196
/// up toward the root.
197
struct CallTreeIter<'a> {
198
tree: Option<Subtree>,
0 commit comments