初始提交

WXL

5 天以前 871522ed7e06fd9c62a87c178d7f5c88d7853a20

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
/*
    MIT License http://www.opensource.org/licenses/mit-license.php
    Author Tobias Koppers @sokra
*/
 
"use strict";
 
/** @typedef {import("../javascript/JavascriptParser").DestructuringAssignmentProperties} DestructuringAssignmentProperties */
/** @typedef {import("../javascript/JavascriptParser").DestructuringAssignmentProperty} DestructuringAssignmentProperty */
 
/**
 * Deep first traverse the properties of a destructuring assignment.
 * @param {DestructuringAssignmentProperties} properties destructuring assignment properties
 * @param {((stack: DestructuringAssignmentProperty[]) => void) | undefined=} onLeftNode on left node callback
 * @param {((stack: DestructuringAssignmentProperty[]) => void) | undefined=} enterNode enter node callback
 * @param {((stack: DestructuringAssignmentProperty[]) => void) | undefined=} exitNode exit node callback
 * @param {DestructuringAssignmentProperty[] | undefined=} stack stack of the walking nodes
 */
function traverseDestructuringAssignmentProperties(
    properties,
    onLeftNode,
    enterNode,
    exitNode,
    stack = []
) {
    for (const property of properties) {
        stack.push(property);
        if (enterNode) enterNode(stack);
        if (property.pattern) {
            traverseDestructuringAssignmentProperties(
                property.pattern,
                onLeftNode,
                enterNode,
                exitNode,
                stack
            );
        } else if (onLeftNode) {
            onLeftNode(stack);
        }
        if (exitNode) exitNode(stack);
        stack.pop();
    }
}
 
module.exports = traverseDestructuringAssignmentProperties;