Function tree_to_string_impl

lsp/src/parser.rs:1376–1414

(
        node: &SyntaxNode,
        depth: usize,
        index: &CompressedIndex,
        result: &mut Vec<String>,
    )

    }

    fn tree_to_string_impl(
        node: &SyntaxNode,
        depth: usize,
        index: &CompressedIndex,
        result: &mut Vec<String>,
    ) {
        let indent = "  ".repeat(depth);
        if let Some((s, e)) = index.node_range(node) {
            result.push(format!("{}{:?}@{}..{}", indent, node.kind(), s, e));
        } else {
            // empty node
            result.push(format!("{}{:?}@0..0", indent, node.kind()));
        }

        for child in node.children_with_tokens() {
            match child {
                rowan::NodeOrToken::Node(child_node) => {
                    tree_to_string_impl(&child_node, depth + 1, index, result);
                }
                rowan::NodeOrToken::Token(token) => {
                    use crate::lexer::SyntaxKind as K;
                    if matches!(token.kind(), K::Whitespace | K::LineComment) {
                        continue;
                    }
                    let token_indent = "  ".repeat(depth + 1);
                    if let Some((s, e)) = index.token_range(&token) {
                        result.push(format!(
                            "{}{:?}@{}..{} {:?}",
                            token_indent,
                            token.kind(),
                            s,
                            e,
                            token.text()
                        ));
                    }
                }
            }
        }
    }

    fn expect_tree(input: &str, lines: &[&str]) {
        let node = parse(input).syntax();