aboutsummaryrefslogtreecommitdiff
path: root/docs/dev
diff options
context:
space:
mode:
authorJakob Hellermann <[email protected]>2020-11-17 14:16:52 +0000
committerGitHub <[email protected]>2020-11-17 14:16:52 +0000
commit7c6c812a74534173fc7070e3534e612a6219034a (patch)
tree41fd68bd942f236e8be208748d87de0a88da59b4 /docs/dev
parent66bcdcbb3615b0d1d47ca7c4abf2c3dd5ab0b73d (diff)
fix typos in syntax.md
Diffstat (limited to 'docs/dev')
-rw-r--r--docs/dev/syntax.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/docs/dev/syntax.md b/docs/dev/syntax.md
index 2eb08b7ca..1edafab68 100644
--- a/docs/dev/syntax.md
+++ b/docs/dev/syntax.md
@@ -195,7 +195,7 @@ Modeling this with immutable trees is possible, but annoying.
195A function green tree is not super-convenient to use. 195A function green tree is not super-convenient to use.
196The biggest problem is accessing parents (there are no parent pointers!). 196The biggest problem is accessing parents (there are no parent pointers!).
197But there are also "identify" issues. 197But there are also "identify" issues.
198Let's say you want to write a code which builds a list of expressions in a file: `fn collect_exrepssions(file: GreenNode) -> HashSet<GreenNode>`. 198Let's say you want to write a code which builds a list of expressions in a file: `fn collect_expressions(file: GreenNode) -> HashSet<GreenNode>`.
199For the input like 199For the input like
200 200
201```rust 201```rust
@@ -236,7 +236,7 @@ impl SyntaxNode {
236 self.parent.clone() 236 self.parent.clone()
237 } 237 }
238 fn children(&self) -> impl Iterator<Item = SyntaxNode> { 238 fn children(&self) -> impl Iterator<Item = SyntaxNode> {
239 let mut offset = self.offset 239 let mut offset = self.offset;
240 self.green.children().map(|green_child| { 240 self.green.children().map(|green_child| {
241 let child_offset = offset; 241 let child_offset = offset;
242 offset += green_child.text_len; 242 offset += green_child.text_len;