You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
71 lines
2.7 KiB
Markdown
71 lines
2.7 KiB
Markdown
### Estraverse [![Build Status](https://secure.travis-ci.org/Constellation/estraverse.png)](http://travis-ci.org/Constellation/estraverse)
|
|
|
|
Estraverse ([estraverse](http://github.com/Constellation/estraverse)) is
|
|
[ECMAScript](http://www.ecma-international.org/publications/standards/Ecma-262.htm)
|
|
traversal functions from [esmangle project](http://github.com/Constellation/esmangle).
|
|
|
|
### Example Usage
|
|
|
|
The following code will output all variables declared at the root of a file.
|
|
|
|
```javascript
|
|
estraverse.traverse(ast, {
|
|
enter: function (node, parent) {
|
|
if (node.type == 'FunctionExpression' || node.type == 'FunctionDeclaration')
|
|
return estraverse.VisitorOption.Skip;
|
|
},
|
|
leave: function (node, parent) {
|
|
if (node.type == 'VariableDeclarator')
|
|
console.log(node.id.name);
|
|
}
|
|
});
|
|
```
|
|
|
|
We can use `this.skip` and `this.break` functions instead of using Skip and Break.
|
|
|
|
```javascript
|
|
estraverse.traverse(ast, {
|
|
enter: function (node) {
|
|
this.break();
|
|
}
|
|
});
|
|
```
|
|
|
|
And estraverse provides `estraverse.replace` function. When returning node from `enter`/`leave`, current node is replaced with it.
|
|
|
|
```javascript
|
|
result = estraverse.replace(tree, {
|
|
enter: function (node) {
|
|
// Replace it with replaced.
|
|
if (node.type === 'Literal')
|
|
return replaced;
|
|
}
|
|
});
|
|
```
|
|
|
|
### License
|
|
|
|
Copyright (C) 2012-2013 [Yusuke Suzuki](http://github.com/Constellation)
|
|
(twitter: [@Constellation](http://twitter.com/Constellation)) and other contributors.
|
|
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are met:
|
|
|
|
* Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
|
|
* Redistributions in binary form must reproduce the above copyright
|
|
notice, this list of conditions and the following disclaimer in the
|
|
documentation and/or other materials provided with the distribution.
|
|
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
ARE DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
|
|
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
|
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|