You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
57 lines
1.6 KiB
57 lines
1.6 KiB
var assert = require('assert')
|
|
|
|
module.exports = dashAst
|
|
|
|
/**
|
|
* Call `cb` on each node in `ast`. If `cb` is an object, `cb.enter` is called before processing a Node's children,
|
|
* and `cb.leave` is called after processing a Node's children.
|
|
*/
|
|
function dashAst (ast, cb) {
|
|
assert(ast && typeof ast === 'object' && typeof ast.type === 'string',
|
|
'dash-ast: ast must be an AST node')
|
|
|
|
if (typeof cb === 'object') {
|
|
assert(typeof cb.enter === 'function' || typeof cb.leave === 'function',
|
|
'dash-ast: visitor must be an object with enter/leave functions')
|
|
|
|
walk(ast, null, cb.enter || undefined, cb.leave || undefined)
|
|
} else {
|
|
assert(cb && typeof cb === 'function',
|
|
'dash-ast: callback must be a function')
|
|
|
|
walk(ast, null, cb, undefined)
|
|
}
|
|
}
|
|
|
|
function walk (node, parent, enter, leave) {
|
|
var cont = enter !== undefined ? enter(node, parent) : undefined
|
|
if (cont === false) return
|
|
|
|
for (var k in node) {
|
|
if (has(node, k)) {
|
|
if (k === 'parent') continue
|
|
var v = node[k]
|
|
if (isNode(v)) {
|
|
walk(v, node, enter, leave)
|
|
} else if (Array.isArray(v)) {
|
|
walkArray(v, node, enter, leave)
|
|
}
|
|
}
|
|
}
|
|
|
|
if (leave !== undefined) leave(node, parent)
|
|
}
|
|
|
|
function walkArray (nodes, parent, enter, leave) {
|
|
for (var i = 0; i < nodes.length; i++) {
|
|
if (isNode(nodes[i])) walk(nodes[i], parent, enter, leave)
|
|
}
|
|
}
|
|
|
|
function isNode (node) {
|
|
return typeof node === 'object' && node && typeof node.type === 'string'
|
|
}
|
|
|
|
function has (obj, prop) {
|
|
return Object.prototype.hasOwnProperty.call(obj, prop)
|
|
}
|