From 6eacca960678fdf992f2dd8886bbae14a2be37cd Mon Sep 17 00:00:00 2001 From: Marshall Roch Date: Thu, 12 Oct 2023 09:30:32 -0400 Subject: [PATCH] fix documentation typos --- lib/binding_rust/lib.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/lib/binding_rust/lib.rs b/lib/binding_rust/lib.rs index 29561926..2333a8fe 100644 --- a/lib/binding_rust/lib.rs +++ b/lib/binding_rust/lib.rs @@ -1004,8 +1004,8 @@ impl<'tree> Node<'tree> { /// Get the node's child at the given index, where zero represents the first /// child. /// - /// This method is fairly fast, but its cost is technically log(i), so you - /// if you might be iterating over a long list of children, you should use + /// This method is fairly fast, but its cost is technically log(i), so if + /// you might be iterating over a long list of children, you should use /// [`Node::children`] instead. #[doc(alias = "ts_node_child")] pub fn child(&self, i: usize) -> Option { @@ -1021,8 +1021,8 @@ impl<'tree> Node<'tree> { /// Get this node's *named* child at the given index. /// /// See also [`Node::is_named`]. - /// This method is fairly fast, but its cost is technically log(i), so you - /// if you might be iterating over a long list of children, you should use + /// This method is fairly fast, but its cost is technically log(i), so if + /// you might be iterating over a long list of children, you should use /// [`Node::named_children`] instead. #[doc(alias = "ts_node_named_child")] pub fn named_child(&self, i: usize) -> Option {