Gecko [ gandhischool.edu.np ]

Name	Size	Permission
control-flow.d.ts	1.23 KB	-rw-rw-rw-
control-flow.js	13.42 KB	-rw-rw-rw-
control-flow.js.map	10.63 KB	-rw-rw-rw-
convert-ast.d.ts	1.32 KB	-rw-rw-rw-
convert-ast.js	2.85 KB	-rw-rw-rw-
convert-ast.js.map	2.06 KB	-rw-rw-rw-
index.d.ts	141 B	-rw-rw-rw-
index.js	418 B	-rw-rw-rw-
index.js.map	161 B	-rw-rw-rw-
type.d.ts	3.45 KB	-rw-rw-rw-
type.js	16.11 KB	-rw-rw-rw-
type.js.map	12.2 KB	-rw-rw-rw-
usage.d.ts	877 B	-rw-rw-rw-
usage.js	27.63 KB	-rw-rw-rw-
usage.js.map	23.42 KB	-rw-rw-rw-
util.d.ts	16.15 KB	-rw-rw-rw-
util.js	77.22 KB	-rw-rw-rw-
util.js.map	54.97 KB	-rw-rw-rw-

Code Editor : convert-ast.js

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.convertAst = void 0;
const ts = require("typescript");
const util_1 = require("./util");
/**
 * Takes a `ts.SourceFile` and creates data structures that are easier (or more performant) to traverse.
 * Note that there is only a performance gain if you can reuse these structures. It's not recommended for one-time AST walks.
 */
function convertAst(sourceFile) {
    const wrapped = {
        node: sourceFile,
        parent: undefined,
        kind: ts.SyntaxKind.SourceFile,
        children: [],
        next: undefined,
        skip: undefined,
    };
    const flat = [];
    let current = wrapped;
    function collectChildren(node) {
        current.children.push({
            node,
            parent: current,
            kind: node.kind,
            children: [],
            next: undefined,
            skip: undefined,
        });
    }
    const stack = [];
    while (true) {
        if (current.children.length === 0) {
            ts.forEachChild(current.node, collectChildren);
            if (current.children.length === 0) {
                current = current.parent; // nothing to do here, go back to parent
            }
            else {
                // recurse into first child
                const firstChild = current.children[0];
                current.next = firstChild;
                flat.push(firstChild.node);
                if (util_1.isNodeKind(firstChild.kind))
                    current = firstChild;
                stack.push(1); // set index in stack so we know where to continue processing children
            }
        }
        else {
            const index = stack[stack.length - 1];
            if (index < current.children.length) { // handles 2nd child to the last
                const currentChild = current.children[index];
                flat.push(currentChild.node);
                let previous = current.children[index - 1];
                while (previous.children.length !== 0) {
                    previous.skip = currentChild;
                    previous = previous.children[previous.children.length - 1];
                }
                previous.skip = previous.next = currentChild;
                ++stack[stack.length - 1];
                if (util_1.isNodeKind(currentChild.kind))
                    current = currentChild; // recurse into child
            }
            else {
                // done on this node
                if (stack.length === 1)
                    break;
                // remove index from stack and go back to parent
                stack.pop();
                current = current.parent;
            }
        }
    }
    return {
        wrapped,
        flat,
    };
}
exports.convertAst = convertAst;
//# sourceMappingURL=convert-ast.js.map

${this.title}

Code Editor : convert-ast.js