mirror of https://github.com/lukechilds/node.git
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.
302 lines
9.5 KiB
302 lines
9.5 KiB
/**
|
|
* @fileoverview Abstraction of JavaScript source code.
|
|
* @author Nicholas C. Zakas
|
|
* @copyright 2015 Nicholas C. Zakas. All rights reserved.
|
|
* See LICENSE file in root directory for full license.
|
|
*/
|
|
"use strict";
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Requirements
|
|
//------------------------------------------------------------------------------
|
|
|
|
var lodash = require("lodash"),
|
|
createTokenStore = require("../token-store.js"),
|
|
estraverse = require("./estraverse");
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Private
|
|
//------------------------------------------------------------------------------
|
|
|
|
/**
|
|
* Validates that the given AST has the required information.
|
|
* @param {ASTNode} ast The Program node of the AST to check.
|
|
* @throws {Error} If the AST doesn't contain the correct information.
|
|
* @returns {void}
|
|
* @private
|
|
*/
|
|
function validate(ast) {
|
|
|
|
if (!ast.tokens) {
|
|
throw new Error("AST is missing the tokens array.");
|
|
}
|
|
|
|
if (!ast.comments) {
|
|
throw new Error("AST is missing the comments array.");
|
|
}
|
|
|
|
if (!ast.loc) {
|
|
throw new Error("AST is missing location information.");
|
|
}
|
|
|
|
if (!ast.range) {
|
|
throw new Error("AST is missing range information");
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Finds a JSDoc comment node in an array of comment nodes.
|
|
* @param {ASTNode[]} comments The array of comment nodes to search.
|
|
* @param {int} line Line number to look around
|
|
* @returns {ASTNode} The node if found, null if not.
|
|
* @private
|
|
*/
|
|
function findJSDocComment(comments, line) {
|
|
|
|
if (comments) {
|
|
for (var i = comments.length - 1; i >= 0; i--) {
|
|
if (comments[i].type === "Block" && comments[i].value.charAt(0) === "*") {
|
|
|
|
if (line - comments[i].loc.end.line <= 1) {
|
|
return comments[i];
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return null;
|
|
}
|
|
|
|
/**
|
|
* Check to see if its a ES6 export declaration
|
|
* @param {ASTNode} astNode - any node
|
|
* @returns {boolean} whether the given node represents a export declaration
|
|
* @private
|
|
*/
|
|
function looksLikeExport(astNode) {
|
|
return astNode.type === "ExportDefaultDeclaration" || astNode.type === "ExportNamedDeclaration" ||
|
|
astNode.type === "ExportAllDeclaration" || astNode.type === "ExportSpecifier";
|
|
}
|
|
|
|
|
|
//------------------------------------------------------------------------------
|
|
// Public Interface
|
|
//------------------------------------------------------------------------------
|
|
|
|
/**
|
|
* Represents parsed source code.
|
|
* @param {string} text - The source code text.
|
|
* @param {ASTNode} ast - The Program node of the AST representing the code. This AST should be created from the text that BOM was stripped.
|
|
* @constructor
|
|
*/
|
|
function SourceCode(text, ast) {
|
|
validate(ast);
|
|
|
|
/**
|
|
* The flag to indicate that the source code has Unicode BOM.
|
|
* @type boolean
|
|
*/
|
|
this.hasBOM = (text.charCodeAt(0) === 0xFEFF);
|
|
|
|
/**
|
|
* The original text source code.
|
|
* BOM was stripped from this text.
|
|
* @type string
|
|
*/
|
|
this.text = (this.hasBOM ? text.slice(1) : text);
|
|
|
|
/**
|
|
* The parsed AST for the source code.
|
|
* @type ASTNode
|
|
*/
|
|
this.ast = ast;
|
|
|
|
/**
|
|
* The source code split into lines according to ECMA-262 specification.
|
|
* This is done to avoid each rule needing to do so separately.
|
|
* @type string[]
|
|
*/
|
|
this.lines = SourceCode.splitLines(this.text);
|
|
|
|
this.tokensAndComments = ast.tokens.concat(ast.comments).sort(function(left, right) {
|
|
return left.range[0] - right.range[0];
|
|
});
|
|
|
|
// create token store methods
|
|
var tokenStore = createTokenStore(ast.tokens);
|
|
Object.keys(tokenStore).forEach(function(methodName) {
|
|
this[methodName] = tokenStore[methodName];
|
|
}, this);
|
|
|
|
var tokensAndCommentsStore = createTokenStore(this.tokensAndComments);
|
|
this.getTokenOrCommentBefore = tokensAndCommentsStore.getTokenBefore;
|
|
this.getTokenOrCommentAfter = tokensAndCommentsStore.getTokenAfter;
|
|
|
|
// don't allow modification of this object
|
|
Object.freeze(this);
|
|
Object.freeze(this.lines);
|
|
}
|
|
|
|
/**
|
|
* Split the source code into multiple lines based on the line delimiters
|
|
* @param {string} text Source code as a string
|
|
* @returns {string[]} Array of source code lines
|
|
* @public
|
|
*/
|
|
SourceCode.splitLines = function(text) {
|
|
return text.split(/\r\n|\r|\n|\u2028|\u2029/g);
|
|
};
|
|
|
|
SourceCode.prototype = {
|
|
constructor: SourceCode,
|
|
|
|
/**
|
|
* Gets the source code for the given node.
|
|
* @param {ASTNode=} node The AST node to get the text for.
|
|
* @param {int=} beforeCount The number of characters before the node to retrieve.
|
|
* @param {int=} afterCount The number of characters after the node to retrieve.
|
|
* @returns {string} The text representing the AST node.
|
|
*/
|
|
getText: function(node, beforeCount, afterCount) {
|
|
if (node) {
|
|
return this.text.slice(Math.max(node.range[0] - (beforeCount || 0), 0),
|
|
node.range[1] + (afterCount || 0));
|
|
} else {
|
|
return this.text;
|
|
}
|
|
|
|
},
|
|
|
|
/**
|
|
* Gets the entire source text split into an array of lines.
|
|
* @returns {Array} The source text as an array of lines.
|
|
*/
|
|
getLines: function() {
|
|
return this.lines;
|
|
},
|
|
|
|
/**
|
|
* Retrieves an array containing all comments in the source code.
|
|
* @returns {ASTNode[]} An array of comment nodes.
|
|
*/
|
|
getAllComments: function() {
|
|
return this.ast.comments;
|
|
},
|
|
|
|
/**
|
|
* Gets all comments for the given node.
|
|
* @param {ASTNode} node The AST node to get the comments for.
|
|
* @returns {Object} The list of comments indexed by their position.
|
|
* @public
|
|
*/
|
|
getComments: function(node) {
|
|
|
|
var leadingComments = node.leadingComments || [],
|
|
trailingComments = node.trailingComments || [];
|
|
|
|
/*
|
|
* espree adds a "comments" array on Program nodes rather than
|
|
* leadingComments/trailingComments. Comments are only left in the
|
|
* Program node comments array if there is no executable code.
|
|
*/
|
|
if (node.type === "Program") {
|
|
if (node.body.length === 0) {
|
|
leadingComments = node.comments;
|
|
}
|
|
}
|
|
|
|
return {
|
|
leading: leadingComments,
|
|
trailing: trailingComments
|
|
};
|
|
},
|
|
|
|
/**
|
|
* Retrieves the JSDoc comment for a given node.
|
|
* @param {ASTNode} node The AST node to get the comment for.
|
|
* @returns {ASTNode} The BlockComment node containing the JSDoc for the
|
|
* given node or null if not found.
|
|
* @public
|
|
*/
|
|
getJSDocComment: function(node) {
|
|
|
|
var parent = node.parent;
|
|
|
|
switch (node.type) {
|
|
case "ClassDeclaration":
|
|
case "FunctionDeclaration":
|
|
if (looksLikeExport(parent)) {
|
|
return findJSDocComment(parent.leadingComments, parent.loc.start.line);
|
|
}
|
|
return findJSDocComment(node.leadingComments, node.loc.start.line);
|
|
|
|
case "ClassExpression":
|
|
return findJSDocComment(parent.parent.leadingComments, parent.parent.loc.start.line);
|
|
|
|
case "ArrowFunctionExpression":
|
|
case "FunctionExpression":
|
|
|
|
if (parent.type !== "CallExpression" && parent.type !== "NewExpression") {
|
|
while (parent && !parent.leadingComments && !/Function/.test(parent.type) && parent.type !== "MethodDefinition" && parent.type !== "Property") {
|
|
parent = parent.parent;
|
|
}
|
|
|
|
return parent && (parent.type !== "FunctionDeclaration") ? findJSDocComment(parent.leadingComments, parent.loc.start.line) : null;
|
|
} else if (node.leadingComments) {
|
|
return findJSDocComment(node.leadingComments, node.loc.start.line);
|
|
}
|
|
|
|
// falls through
|
|
|
|
default:
|
|
return null;
|
|
}
|
|
},
|
|
|
|
/**
|
|
* Gets the deepest node containing a range index.
|
|
* @param {int} index Range index of the desired node.
|
|
* @returns {ASTNode} The node if found or null if not found.
|
|
*/
|
|
getNodeByRangeIndex: function(index) {
|
|
var result = null;
|
|
var resultParent = null;
|
|
|
|
estraverse.traverse(this.ast, {
|
|
enter: function(node, parent) {
|
|
if (node.range[0] <= index && index < node.range[1]) {
|
|
result = node;
|
|
resultParent = parent;
|
|
} else {
|
|
this.skip();
|
|
}
|
|
},
|
|
leave: function(node) {
|
|
if (node === result) {
|
|
this.break();
|
|
}
|
|
}
|
|
});
|
|
|
|
return result ? lodash.assign({parent: resultParent}, result) : null;
|
|
},
|
|
|
|
/**
|
|
* Determines if two tokens have at least one whitespace character
|
|
* between them. This completely disregards comments in making the
|
|
* determination, so comments count as zero-length substrings.
|
|
* @param {Token} first The token to check after.
|
|
* @param {Token} second The token to check before.
|
|
* @returns {boolean} True if there is only space between tokens, false
|
|
* if there is anything other than whitespace between tokens.
|
|
*/
|
|
isSpaceBetweenTokens: function(first, second) {
|
|
var text = this.text.slice(first.range[1], second.range[0]);
|
|
return /\s/.test(text.replace(/\/\*.*?\*\//g, ""));
|
|
}
|
|
};
|
|
|
|
|
|
module.exports = SourceCode;
|
|
|