$
This commit is contained in:
999
node_modules/regenerator-transform/lib/emit.js
generated
vendored
Normal file
999
node_modules/regenerator-transform/lib/emit.js
generated
vendored
Normal file
File diff suppressed because it is too large
Load Diff
138
node_modules/regenerator-transform/lib/hoist.js
generated
vendored
Normal file
138
node_modules/regenerator-transform/lib/hoist.js
generated
vendored
Normal file
@@ -0,0 +1,138 @@
|
||||
"use strict";
|
||||
|
||||
var util = _interopRequireWildcard(require("./util"));
|
||||
|
||||
function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
|
||||
|
||||
function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { "default": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj["default"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
var hasOwn = Object.prototype.hasOwnProperty; // The hoist function takes a FunctionExpression or FunctionDeclaration
|
||||
// and replaces any Declaration nodes in its body with assignments, then
|
||||
// returns a VariableDeclaration containing just the names of the removed
|
||||
// declarations.
|
||||
|
||||
exports.hoist = function (funPath) {
|
||||
var t = util.getTypes();
|
||||
t.assertFunction(funPath.node);
|
||||
var vars = {};
|
||||
|
||||
function varDeclToExpr(_ref, includeIdentifiers) {
|
||||
var vdec = _ref.node,
|
||||
scope = _ref.scope;
|
||||
t.assertVariableDeclaration(vdec); // TODO assert.equal(vdec.kind, "var");
|
||||
|
||||
var exprs = [];
|
||||
vdec.declarations.forEach(function (dec) {
|
||||
// Note: We duplicate 'dec.id' here to ensure that the variable declaration IDs don't
|
||||
// have the same 'loc' value, since that can make sourcemaps and retainLines behave poorly.
|
||||
vars[dec.id.name] = t.identifier(dec.id.name); // Remove the binding, to avoid "duplicate declaration" errors when it will
|
||||
// be injected again.
|
||||
|
||||
scope.removeBinding(dec.id.name);
|
||||
|
||||
if (dec.init) {
|
||||
exprs.push(t.assignmentExpression("=", dec.id, dec.init));
|
||||
} else if (includeIdentifiers) {
|
||||
exprs.push(dec.id);
|
||||
}
|
||||
});
|
||||
if (exprs.length === 0) return null;
|
||||
if (exprs.length === 1) return exprs[0];
|
||||
return t.sequenceExpression(exprs);
|
||||
}
|
||||
|
||||
funPath.get("body").traverse({
|
||||
VariableDeclaration: {
|
||||
exit: function exit(path) {
|
||||
var expr = varDeclToExpr(path, false);
|
||||
|
||||
if (expr === null) {
|
||||
path.remove();
|
||||
} else {
|
||||
// We don't need to traverse this expression any further because
|
||||
// there can't be any new declarations inside an expression.
|
||||
util.replaceWithOrRemove(path, t.expressionStatement(expr));
|
||||
} // Since the original node has been either removed or replaced,
|
||||
// avoid traversing it any further.
|
||||
|
||||
|
||||
path.skip();
|
||||
}
|
||||
},
|
||||
ForStatement: function ForStatement(path) {
|
||||
var init = path.get("init");
|
||||
|
||||
if (init.isVariableDeclaration()) {
|
||||
util.replaceWithOrRemove(init, varDeclToExpr(init, false));
|
||||
}
|
||||
},
|
||||
ForXStatement: function ForXStatement(path) {
|
||||
var left = path.get("left");
|
||||
|
||||
if (left.isVariableDeclaration()) {
|
||||
util.replaceWithOrRemove(left, varDeclToExpr(left, true));
|
||||
}
|
||||
},
|
||||
FunctionDeclaration: function FunctionDeclaration(path) {
|
||||
var node = path.node;
|
||||
vars[node.id.name] = node.id;
|
||||
var assignment = t.expressionStatement(t.assignmentExpression("=", t.clone(node.id), t.functionExpression(path.scope.generateUidIdentifierBasedOnNode(node), node.params, node.body, node.generator, node.expression)));
|
||||
|
||||
if (path.parentPath.isBlockStatement()) {
|
||||
// Insert the assignment form before the first statement in the
|
||||
// enclosing block.
|
||||
path.parentPath.unshiftContainer("body", assignment); // Remove the function declaration now that we've inserted the
|
||||
// equivalent assignment form at the beginning of the block.
|
||||
|
||||
path.remove();
|
||||
} else {
|
||||
// If the parent node is not a block statement, then we can just
|
||||
// replace the declaration with the equivalent assignment form
|
||||
// without worrying about hoisting it.
|
||||
util.replaceWithOrRemove(path, assignment);
|
||||
} // Remove the binding, to avoid "duplicate declaration" errors when it will
|
||||
// be injected again.
|
||||
|
||||
|
||||
path.scope.removeBinding(node.id.name); // Don't hoist variables out of inner functions.
|
||||
|
||||
path.skip();
|
||||
},
|
||||
FunctionExpression: function FunctionExpression(path) {
|
||||
// Don't descend into nested function expressions.
|
||||
path.skip();
|
||||
},
|
||||
ArrowFunctionExpression: function ArrowFunctionExpression(path) {
|
||||
// Don't descend into nested function expressions.
|
||||
path.skip();
|
||||
}
|
||||
});
|
||||
var paramNames = {};
|
||||
funPath.get("params").forEach(function (paramPath) {
|
||||
var param = paramPath.node;
|
||||
|
||||
if (t.isIdentifier(param)) {
|
||||
paramNames[param.name] = param;
|
||||
} else {// Variables declared by destructuring parameter patterns will be
|
||||
// harmlessly re-declared.
|
||||
}
|
||||
});
|
||||
var declarations = [];
|
||||
Object.keys(vars).forEach(function (name) {
|
||||
if (!hasOwn.call(paramNames, name)) {
|
||||
declarations.push(t.variableDeclarator(vars[name], null));
|
||||
}
|
||||
});
|
||||
|
||||
if (declarations.length === 0) {
|
||||
return null; // Be sure to handle this case!
|
||||
}
|
||||
|
||||
return t.variableDeclaration("var", declarations);
|
||||
};
|
29
node_modules/regenerator-transform/lib/index.js
generated
vendored
Normal file
29
node_modules/regenerator-transform/lib/index.js
generated
vendored
Normal file
@@ -0,0 +1,29 @@
|
||||
"use strict";
|
||||
|
||||
exports.__esModule = true;
|
||||
exports["default"] = _default;
|
||||
|
||||
var _visit = require("./visit");
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
function _default(context) {
|
||||
var plugin = {
|
||||
visitor: (0, _visit.getVisitor)(context)
|
||||
}; // Some presets manually call child presets, but fail to pass along the
|
||||
// context object. Out of an abundance of caution, we verify that it
|
||||
// exists first to avoid causing unnecessary breaking changes.
|
||||
|
||||
var version = context && context.version; // The "name" property is not allowed in older versions of Babel (6.x)
|
||||
// and will cause the plugin validator to throw an exception.
|
||||
|
||||
if (version && parseInt(version, 10) >= 7) {
|
||||
plugin.name = "regenerator-transform";
|
||||
}
|
||||
|
||||
return plugin;
|
||||
}
|
178
node_modules/regenerator-transform/lib/leap.js
generated
vendored
Normal file
178
node_modules/regenerator-transform/lib/leap.js
generated
vendored
Normal file
@@ -0,0 +1,178 @@
|
||||
"use strict";
|
||||
|
||||
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
||||
|
||||
var _assert = _interopRequireDefault(require("assert"));
|
||||
|
||||
var _emit = require("./emit");
|
||||
|
||||
var _util = require("util");
|
||||
|
||||
var _util2 = require("./util");
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
function Entry() {
|
||||
_assert["default"].ok(this instanceof Entry);
|
||||
}
|
||||
|
||||
function FunctionEntry(returnLoc) {
|
||||
Entry.call(this);
|
||||
(0, _util2.getTypes)().assertLiteral(returnLoc);
|
||||
this.returnLoc = returnLoc;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(FunctionEntry, Entry);
|
||||
exports.FunctionEntry = FunctionEntry;
|
||||
|
||||
function LoopEntry(breakLoc, continueLoc, label) {
|
||||
Entry.call(this);
|
||||
var t = (0, _util2.getTypes)();
|
||||
t.assertLiteral(breakLoc);
|
||||
t.assertLiteral(continueLoc);
|
||||
|
||||
if (label) {
|
||||
t.assertIdentifier(label);
|
||||
} else {
|
||||
label = null;
|
||||
}
|
||||
|
||||
this.breakLoc = breakLoc;
|
||||
this.continueLoc = continueLoc;
|
||||
this.label = label;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(LoopEntry, Entry);
|
||||
exports.LoopEntry = LoopEntry;
|
||||
|
||||
function SwitchEntry(breakLoc) {
|
||||
Entry.call(this);
|
||||
(0, _util2.getTypes)().assertLiteral(breakLoc);
|
||||
this.breakLoc = breakLoc;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(SwitchEntry, Entry);
|
||||
exports.SwitchEntry = SwitchEntry;
|
||||
|
||||
function TryEntry(firstLoc, catchEntry, finallyEntry) {
|
||||
Entry.call(this);
|
||||
var t = (0, _util2.getTypes)();
|
||||
t.assertLiteral(firstLoc);
|
||||
|
||||
if (catchEntry) {
|
||||
_assert["default"].ok(catchEntry instanceof CatchEntry);
|
||||
} else {
|
||||
catchEntry = null;
|
||||
}
|
||||
|
||||
if (finallyEntry) {
|
||||
_assert["default"].ok(finallyEntry instanceof FinallyEntry);
|
||||
} else {
|
||||
finallyEntry = null;
|
||||
} // Have to have one or the other (or both).
|
||||
|
||||
|
||||
_assert["default"].ok(catchEntry || finallyEntry);
|
||||
|
||||
this.firstLoc = firstLoc;
|
||||
this.catchEntry = catchEntry;
|
||||
this.finallyEntry = finallyEntry;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(TryEntry, Entry);
|
||||
exports.TryEntry = TryEntry;
|
||||
|
||||
function CatchEntry(firstLoc, paramId) {
|
||||
Entry.call(this);
|
||||
var t = (0, _util2.getTypes)();
|
||||
t.assertLiteral(firstLoc);
|
||||
t.assertIdentifier(paramId);
|
||||
this.firstLoc = firstLoc;
|
||||
this.paramId = paramId;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(CatchEntry, Entry);
|
||||
exports.CatchEntry = CatchEntry;
|
||||
|
||||
function FinallyEntry(firstLoc, afterLoc) {
|
||||
Entry.call(this);
|
||||
var t = (0, _util2.getTypes)();
|
||||
t.assertLiteral(firstLoc);
|
||||
t.assertLiteral(afterLoc);
|
||||
this.firstLoc = firstLoc;
|
||||
this.afterLoc = afterLoc;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(FinallyEntry, Entry);
|
||||
exports.FinallyEntry = FinallyEntry;
|
||||
|
||||
function LabeledEntry(breakLoc, label) {
|
||||
Entry.call(this);
|
||||
var t = (0, _util2.getTypes)();
|
||||
t.assertLiteral(breakLoc);
|
||||
t.assertIdentifier(label);
|
||||
this.breakLoc = breakLoc;
|
||||
this.label = label;
|
||||
}
|
||||
|
||||
(0, _util.inherits)(LabeledEntry, Entry);
|
||||
exports.LabeledEntry = LabeledEntry;
|
||||
|
||||
function LeapManager(emitter) {
|
||||
_assert["default"].ok(this instanceof LeapManager);
|
||||
|
||||
_assert["default"].ok(emitter instanceof _emit.Emitter);
|
||||
|
||||
this.emitter = emitter;
|
||||
this.entryStack = [new FunctionEntry(emitter.finalLoc)];
|
||||
}
|
||||
|
||||
var LMp = LeapManager.prototype;
|
||||
exports.LeapManager = LeapManager;
|
||||
|
||||
LMp.withEntry = function (entry, callback) {
|
||||
_assert["default"].ok(entry instanceof Entry);
|
||||
|
||||
this.entryStack.push(entry);
|
||||
|
||||
try {
|
||||
callback.call(this.emitter);
|
||||
} finally {
|
||||
var popped = this.entryStack.pop();
|
||||
|
||||
_assert["default"].strictEqual(popped, entry);
|
||||
}
|
||||
};
|
||||
|
||||
LMp._findLeapLocation = function (property, label) {
|
||||
for (var i = this.entryStack.length - 1; i >= 0; --i) {
|
||||
var entry = this.entryStack[i];
|
||||
var loc = entry[property];
|
||||
|
||||
if (loc) {
|
||||
if (label) {
|
||||
if (entry.label && entry.label.name === label.name) {
|
||||
return loc;
|
||||
}
|
||||
} else if (entry instanceof LabeledEntry) {// Ignore LabeledEntry entries unless we are actually breaking to
|
||||
// a label.
|
||||
} else {
|
||||
return loc;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return null;
|
||||
};
|
||||
|
||||
LMp.getBreakLoc = function (label) {
|
||||
return this._findLeapLocation("breakLoc", label);
|
||||
};
|
||||
|
||||
LMp.getContinueLoc = function (label) {
|
||||
return this._findLeapLocation("continueLoc", label);
|
||||
};
|
113
node_modules/regenerator-transform/lib/meta.js
generated
vendored
Normal file
113
node_modules/regenerator-transform/lib/meta.js
generated
vendored
Normal file
@@ -0,0 +1,113 @@
|
||||
"use strict";
|
||||
|
||||
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
||||
|
||||
var _assert = _interopRequireDefault(require("assert"));
|
||||
|
||||
var _util = require("./util.js");
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
var mMap = new WeakMap();
|
||||
|
||||
function m(node) {
|
||||
if (!mMap.has(node)) {
|
||||
mMap.set(node, {});
|
||||
}
|
||||
|
||||
return mMap.get(node);
|
||||
}
|
||||
|
||||
var hasOwn = Object.prototype.hasOwnProperty;
|
||||
|
||||
function makePredicate(propertyName, knownTypes) {
|
||||
function onlyChildren(node) {
|
||||
var t = (0, _util.getTypes)();
|
||||
t.assertNode(node); // Assume no side effects until we find out otherwise.
|
||||
|
||||
var result = false;
|
||||
|
||||
function check(child) {
|
||||
if (result) {// Do nothing.
|
||||
} else if (Array.isArray(child)) {
|
||||
child.some(check);
|
||||
} else if (t.isNode(child)) {
|
||||
_assert["default"].strictEqual(result, false);
|
||||
|
||||
result = predicate(child);
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
var keys = t.VISITOR_KEYS[node.type];
|
||||
|
||||
if (keys) {
|
||||
for (var i = 0; i < keys.length; i++) {
|
||||
var key = keys[i];
|
||||
var child = node[key];
|
||||
check(child);
|
||||
}
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
function predicate(node) {
|
||||
(0, _util.getTypes)().assertNode(node);
|
||||
var meta = m(node);
|
||||
if (hasOwn.call(meta, propertyName)) return meta[propertyName]; // Certain types are "opaque," which means they have no side
|
||||
// effects or leaps and we don't care about their subexpressions.
|
||||
|
||||
if (hasOwn.call(opaqueTypes, node.type)) return meta[propertyName] = false;
|
||||
if (hasOwn.call(knownTypes, node.type)) return meta[propertyName] = true;
|
||||
return meta[propertyName] = onlyChildren(node);
|
||||
}
|
||||
|
||||
predicate.onlyChildren = onlyChildren;
|
||||
return predicate;
|
||||
}
|
||||
|
||||
var opaqueTypes = {
|
||||
FunctionExpression: true,
|
||||
ArrowFunctionExpression: true
|
||||
}; // These types potentially have side effects regardless of what side
|
||||
// effects their subexpressions have.
|
||||
|
||||
var sideEffectTypes = {
|
||||
CallExpression: true,
|
||||
// Anything could happen!
|
||||
ForInStatement: true,
|
||||
// Modifies the key variable.
|
||||
UnaryExpression: true,
|
||||
// Think delete.
|
||||
BinaryExpression: true,
|
||||
// Might invoke .toString() or .valueOf().
|
||||
AssignmentExpression: true,
|
||||
// Side-effecting by definition.
|
||||
UpdateExpression: true,
|
||||
// Updates are essentially assignments.
|
||||
NewExpression: true // Similar to CallExpression.
|
||||
|
||||
}; // These types are the direct cause of all leaps in control flow.
|
||||
|
||||
var leapTypes = {
|
||||
YieldExpression: true,
|
||||
BreakStatement: true,
|
||||
ContinueStatement: true,
|
||||
ReturnStatement: true,
|
||||
ThrowStatement: true
|
||||
}; // All leap types are also side effect types.
|
||||
|
||||
for (var type in leapTypes) {
|
||||
if (hasOwn.call(leapTypes, type)) {
|
||||
sideEffectTypes[type] = leapTypes[type];
|
||||
}
|
||||
}
|
||||
|
||||
exports.hasSideEffects = makePredicate("hasSideEffects", sideEffectTypes);
|
||||
exports.containsLeap = makePredicate("containsLeap", leapTypes);
|
81
node_modules/regenerator-transform/lib/replaceShorthandObjectMethod.js
generated
vendored
Normal file
81
node_modules/regenerator-transform/lib/replaceShorthandObjectMethod.js
generated
vendored
Normal file
@@ -0,0 +1,81 @@
|
||||
"use strict";
|
||||
|
||||
exports.__esModule = true;
|
||||
exports["default"] = replaceShorthandObjectMethod;
|
||||
|
||||
var util = _interopRequireWildcard(require("./util"));
|
||||
|
||||
function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
|
||||
|
||||
function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { "default": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj["default"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
// this function converts a shorthand object generator method into a normal
|
||||
// (non-shorthand) object property which is a generator function expression. for
|
||||
// example, this:
|
||||
//
|
||||
// var foo = {
|
||||
// *bar(baz) { return 5; }
|
||||
// }
|
||||
//
|
||||
// should be replaced with:
|
||||
//
|
||||
// var foo = {
|
||||
// bar: function*(baz) { return 5; }
|
||||
// }
|
||||
//
|
||||
// to do this, it clones the parameter array and the body of the object generator
|
||||
// method into a new FunctionExpression.
|
||||
//
|
||||
// this method can be passed any Function AST node path, and it will return
|
||||
// either:
|
||||
// a) the path that was passed in (iff the path did not need to be replaced) or
|
||||
// b) the path of the new FunctionExpression that was created as a replacement
|
||||
// (iff the path did need to be replaced)
|
||||
//
|
||||
// In either case, though, the caller can count on the fact that the return value
|
||||
// is a Function AST node path.
|
||||
//
|
||||
// If this function is called with an AST node path that is not a Function (or with an
|
||||
// argument that isn't an AST node path), it will throw an error.
|
||||
function replaceShorthandObjectMethod(path) {
|
||||
var t = util.getTypes();
|
||||
|
||||
if (!path.node || !t.isFunction(path.node)) {
|
||||
throw new Error("replaceShorthandObjectMethod can only be called on Function AST node paths.");
|
||||
} // this function only replaces shorthand object methods (called ObjectMethod
|
||||
// in Babel-speak).
|
||||
|
||||
|
||||
if (!t.isObjectMethod(path.node)) {
|
||||
return path;
|
||||
} // this function only replaces generators.
|
||||
|
||||
|
||||
if (!path.node.generator) {
|
||||
return path;
|
||||
}
|
||||
|
||||
var parameters = path.node.params.map(function (param) {
|
||||
return t.cloneDeep(param);
|
||||
});
|
||||
var functionExpression = t.functionExpression(null, // id
|
||||
parameters, // params
|
||||
t.cloneDeep(path.node.body), // body
|
||||
path.node.generator, path.node.async);
|
||||
util.replaceWithOrRemove(path, t.objectProperty(t.cloneDeep(path.node.key), // key
|
||||
functionExpression, //value
|
||||
path.node.computed, // computed
|
||||
false // shorthand
|
||||
)); // path now refers to the ObjectProperty AST node path, but we want to return a
|
||||
// Function AST node path for the function expression we created. we know that
|
||||
// the FunctionExpression we just created is the value of the ObjectProperty,
|
||||
// so return the "value" path off of this path.
|
||||
|
||||
return path.get("value");
|
||||
}
|
56
node_modules/regenerator-transform/lib/util.js
generated
vendored
Normal file
56
node_modules/regenerator-transform/lib/util.js
generated
vendored
Normal file
@@ -0,0 +1,56 @@
|
||||
"use strict";
|
||||
|
||||
exports.__esModule = true;
|
||||
exports.wrapWithTypes = wrapWithTypes;
|
||||
exports.getTypes = getTypes;
|
||||
exports.runtimeProperty = runtimeProperty;
|
||||
exports.isReference = isReference;
|
||||
exports.replaceWithOrRemove = replaceWithOrRemove;
|
||||
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
var currentTypes = null;
|
||||
|
||||
function wrapWithTypes(types, fn) {
|
||||
return function () {
|
||||
var oldTypes = currentTypes;
|
||||
currentTypes = types;
|
||||
|
||||
try {
|
||||
for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {
|
||||
args[_key] = arguments[_key];
|
||||
}
|
||||
|
||||
return fn.apply(this, args);
|
||||
} finally {
|
||||
currentTypes = oldTypes;
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
function getTypes() {
|
||||
return currentTypes;
|
||||
}
|
||||
|
||||
function runtimeProperty(name) {
|
||||
var t = getTypes();
|
||||
return t.memberExpression(t.identifier("regeneratorRuntime"), t.identifier(name), false);
|
||||
}
|
||||
|
||||
function isReference(path) {
|
||||
return path.isReferenced() || path.parentPath.isAssignmentExpression({
|
||||
left: path.node
|
||||
});
|
||||
}
|
||||
|
||||
function replaceWithOrRemove(path, replacement) {
|
||||
if (replacement) {
|
||||
path.replaceWith(replacement);
|
||||
} else {
|
||||
path.remove();
|
||||
}
|
||||
}
|
328
node_modules/regenerator-transform/lib/visit.js
generated
vendored
Normal file
328
node_modules/regenerator-transform/lib/visit.js
generated
vendored
Normal file
@@ -0,0 +1,328 @@
|
||||
/**
|
||||
* Copyright (c) 2014-present, Facebook, Inc.
|
||||
*
|
||||
* This source code is licensed under the MIT license found in the
|
||||
* LICENSE file in the root directory of this source tree.
|
||||
*/
|
||||
"use strict";
|
||||
|
||||
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
||||
|
||||
var _assert = _interopRequireDefault(require("assert"));
|
||||
|
||||
var _hoist = require("./hoist");
|
||||
|
||||
var _emit = require("./emit");
|
||||
|
||||
var _replaceShorthandObjectMethod = _interopRequireDefault(require("./replaceShorthandObjectMethod"));
|
||||
|
||||
var util = _interopRequireWildcard(require("./util"));
|
||||
|
||||
function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function _getRequireWildcardCache(nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
|
||||
|
||||
function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { "default": obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj["default"] = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
|
||||
|
||||
exports.getVisitor = function (_ref) {
|
||||
var t = _ref.types;
|
||||
return {
|
||||
Method: function Method(path, state) {
|
||||
var node = path.node;
|
||||
if (!shouldRegenerate(node, state)) return;
|
||||
var container = t.functionExpression(null, [], t.cloneNode(node.body, false), node.generator, node.async);
|
||||
path.get("body").set("body", [t.returnStatement(t.callExpression(container, []))]); // Regardless of whether or not the wrapped function is a an async method
|
||||
// or generator the outer function should not be
|
||||
|
||||
node.async = false;
|
||||
node.generator = false; // Unwrap the wrapper IIFE's environment so super and this and such still work.
|
||||
|
||||
path.get("body.body.0.argument.callee").unwrapFunctionEnvironment();
|
||||
},
|
||||
Function: {
|
||||
exit: util.wrapWithTypes(t, function (path, state) {
|
||||
var node = path.node;
|
||||
if (!shouldRegenerate(node, state)) return; // if this is an ObjectMethod, we need to convert it to an ObjectProperty
|
||||
|
||||
path = (0, _replaceShorthandObjectMethod["default"])(path);
|
||||
node = path.node;
|
||||
var contextId = path.scope.generateUidIdentifier("context");
|
||||
var argsId = path.scope.generateUidIdentifier("args");
|
||||
path.ensureBlock();
|
||||
var bodyBlockPath = path.get("body");
|
||||
|
||||
if (node.async) {
|
||||
bodyBlockPath.traverse(awaitVisitor);
|
||||
}
|
||||
|
||||
bodyBlockPath.traverse(functionSentVisitor, {
|
||||
context: contextId
|
||||
});
|
||||
var outerBody = [];
|
||||
var innerBody = [];
|
||||
bodyBlockPath.get("body").forEach(function (childPath) {
|
||||
var node = childPath.node;
|
||||
|
||||
if (t.isExpressionStatement(node) && t.isStringLiteral(node.expression)) {
|
||||
// Babylon represents directives like "use strict" as elements
|
||||
// of a bodyBlockPath.node.directives array, but they could just
|
||||
// as easily be represented (by other parsers) as traditional
|
||||
// string-literal-valued expression statements, so we need to
|
||||
// handle that here. (#248)
|
||||
outerBody.push(node);
|
||||
} else if (node && node._blockHoist != null) {
|
||||
outerBody.push(node);
|
||||
} else {
|
||||
innerBody.push(node);
|
||||
}
|
||||
});
|
||||
|
||||
if (outerBody.length > 0) {
|
||||
// Only replace the inner body if we actually hoisted any statements
|
||||
// to the outer body.
|
||||
bodyBlockPath.node.body = innerBody;
|
||||
}
|
||||
|
||||
var outerFnExpr = getOuterFnExpr(path); // Note that getOuterFnExpr has the side-effect of ensuring that the
|
||||
// function has a name (so node.id will always be an Identifier), even
|
||||
// if a temporary name has to be synthesized.
|
||||
|
||||
t.assertIdentifier(node.id);
|
||||
var innerFnId = t.identifier(node.id.name + "$"); // Turn all declarations into vars, and replace the original
|
||||
// declarations with equivalent assignment expressions.
|
||||
|
||||
var vars = (0, _hoist.hoist)(path);
|
||||
var context = {
|
||||
usesThis: false,
|
||||
usesArguments: false,
|
||||
getArgsId: function getArgsId() {
|
||||
return t.clone(argsId);
|
||||
}
|
||||
};
|
||||
path.traverse(argumentsThisVisitor, context);
|
||||
|
||||
if (context.usesArguments) {
|
||||
vars = vars || t.variableDeclaration("var", []);
|
||||
vars.declarations.push(t.variableDeclarator(t.clone(argsId), t.identifier("arguments")));
|
||||
}
|
||||
|
||||
var emitter = new _emit.Emitter(contextId);
|
||||
emitter.explode(path.get("body"));
|
||||
|
||||
if (vars && vars.declarations.length > 0) {
|
||||
outerBody.push(vars);
|
||||
}
|
||||
|
||||
var wrapArgs = [emitter.getContextFunction(innerFnId)];
|
||||
var tryLocsList = emitter.getTryLocsList();
|
||||
|
||||
if (node.generator) {
|
||||
wrapArgs.push(outerFnExpr);
|
||||
} else if (context.usesThis || tryLocsList || node.async) {
|
||||
// Async functions that are not generators don't care about the
|
||||
// outer function because they don't need it to be marked and don't
|
||||
// inherit from its .prototype.
|
||||
wrapArgs.push(t.nullLiteral());
|
||||
}
|
||||
|
||||
if (context.usesThis) {
|
||||
wrapArgs.push(t.thisExpression());
|
||||
} else if (tryLocsList || node.async) {
|
||||
wrapArgs.push(t.nullLiteral());
|
||||
}
|
||||
|
||||
if (tryLocsList) {
|
||||
wrapArgs.push(tryLocsList);
|
||||
} else if (node.async) {
|
||||
wrapArgs.push(t.nullLiteral());
|
||||
}
|
||||
|
||||
if (node.async) {
|
||||
// Rename any locally declared "Promise" variable,
|
||||
// to use the global one.
|
||||
var currentScope = path.scope;
|
||||
|
||||
do {
|
||||
if (currentScope.hasOwnBinding("Promise")) currentScope.rename("Promise");
|
||||
} while (currentScope = currentScope.parent);
|
||||
|
||||
wrapArgs.push(t.identifier("Promise"));
|
||||
}
|
||||
|
||||
var wrapCall = t.callExpression(util.runtimeProperty(node.async ? "async" : "wrap"), wrapArgs);
|
||||
outerBody.push(t.returnStatement(wrapCall));
|
||||
node.body = t.blockStatement(outerBody); // We injected a few new variable declarations (for every hoisted var),
|
||||
// so we need to add them to the scope.
|
||||
|
||||
path.get("body.body").forEach(function (p) {
|
||||
return p.scope.registerDeclaration(p);
|
||||
});
|
||||
var oldDirectives = bodyBlockPath.node.directives;
|
||||
|
||||
if (oldDirectives) {
|
||||
// Babylon represents directives like "use strict" as elements of
|
||||
// a bodyBlockPath.node.directives array. (#248)
|
||||
node.body.directives = oldDirectives;
|
||||
}
|
||||
|
||||
var wasGeneratorFunction = node.generator;
|
||||
|
||||
if (wasGeneratorFunction) {
|
||||
node.generator = false;
|
||||
}
|
||||
|
||||
if (node.async) {
|
||||
node.async = false;
|
||||
}
|
||||
|
||||
if (wasGeneratorFunction && t.isExpression(node)) {
|
||||
util.replaceWithOrRemove(path, t.callExpression(util.runtimeProperty("mark"), [node]));
|
||||
path.addComment("leading", "#__PURE__");
|
||||
}
|
||||
|
||||
var insertedLocs = emitter.getInsertedLocs();
|
||||
path.traverse({
|
||||
NumericLiteral: function NumericLiteral(path) {
|
||||
if (!insertedLocs.has(path.node)) {
|
||||
return;
|
||||
}
|
||||
|
||||
path.replaceWith(t.numericLiteral(path.node.value));
|
||||
}
|
||||
}); // Generators are processed in 'exit' handlers so that regenerator only has to run on
|
||||
// an ES5 AST, but that means traversal will not pick up newly inserted references
|
||||
// to things like 'regeneratorRuntime'. To avoid this, we explicitly requeue.
|
||||
|
||||
path.requeue();
|
||||
})
|
||||
}
|
||||
};
|
||||
}; // Check if a node should be transformed by regenerator
|
||||
|
||||
|
||||
function shouldRegenerate(node, state) {
|
||||
if (node.generator) {
|
||||
if (node.async) {
|
||||
// Async generator
|
||||
return state.opts.asyncGenerators !== false;
|
||||
} else {
|
||||
// Plain generator
|
||||
return state.opts.generators !== false;
|
||||
}
|
||||
} else if (node.async) {
|
||||
// Async function
|
||||
return state.opts.async !== false;
|
||||
} else {
|
||||
// Not a generator or async function.
|
||||
return false;
|
||||
}
|
||||
} // Given a NodePath for a Function, return an Expression node that can be
|
||||
// used to refer reliably to the function object from inside the function.
|
||||
// This expression is essentially a replacement for arguments.callee, with
|
||||
// the key advantage that it works in strict mode.
|
||||
|
||||
|
||||
function getOuterFnExpr(funPath) {
|
||||
var t = util.getTypes();
|
||||
var node = funPath.node;
|
||||
t.assertFunction(node);
|
||||
|
||||
if (!node.id) {
|
||||
// Default-exported function declarations, and function expressions may not
|
||||
// have a name to reference, so we explicitly add one.
|
||||
node.id = funPath.scope.parent.generateUidIdentifier("callee");
|
||||
}
|
||||
|
||||
if (node.generator && // Non-generator functions don't need to be marked.
|
||||
t.isFunctionDeclaration(node)) {
|
||||
// Return the identifier returned by runtime.mark(<node.id>).
|
||||
return getMarkedFunctionId(funPath);
|
||||
}
|
||||
|
||||
return t.clone(node.id);
|
||||
}
|
||||
|
||||
var markInfo = new WeakMap();
|
||||
|
||||
function getMarkInfo(node) {
|
||||
if (!markInfo.has(node)) {
|
||||
markInfo.set(node, {});
|
||||
}
|
||||
|
||||
return markInfo.get(node);
|
||||
}
|
||||
|
||||
function getMarkedFunctionId(funPath) {
|
||||
var t = util.getTypes();
|
||||
var node = funPath.node;
|
||||
t.assertIdentifier(node.id);
|
||||
var blockPath = funPath.findParent(function (path) {
|
||||
return path.isProgram() || path.isBlockStatement();
|
||||
});
|
||||
|
||||
if (!blockPath) {
|
||||
return node.id;
|
||||
}
|
||||
|
||||
var block = blockPath.node;
|
||||
|
||||
_assert["default"].ok(Array.isArray(block.body));
|
||||
|
||||
var info = getMarkInfo(block);
|
||||
|
||||
if (!info.decl) {
|
||||
info.decl = t.variableDeclaration("var", []);
|
||||
blockPath.unshiftContainer("body", info.decl);
|
||||
info.declPath = blockPath.get("body.0");
|
||||
}
|
||||
|
||||
_assert["default"].strictEqual(info.declPath.node, info.decl); // Get a new unique identifier for our marked variable.
|
||||
|
||||
|
||||
var markedId = blockPath.scope.generateUidIdentifier("marked");
|
||||
var markCallExp = t.callExpression(util.runtimeProperty("mark"), [t.clone(node.id)]);
|
||||
var index = info.decl.declarations.push(t.variableDeclarator(markedId, markCallExp)) - 1;
|
||||
var markCallExpPath = info.declPath.get("declarations." + index + ".init");
|
||||
|
||||
_assert["default"].strictEqual(markCallExpPath.node, markCallExp);
|
||||
|
||||
markCallExpPath.addComment("leading", "#__PURE__");
|
||||
return t.clone(markedId);
|
||||
}
|
||||
|
||||
var argumentsThisVisitor = {
|
||||
"FunctionExpression|FunctionDeclaration|Method": function FunctionExpressionFunctionDeclarationMethod(path) {
|
||||
path.skip();
|
||||
},
|
||||
Identifier: function Identifier(path, state) {
|
||||
if (path.node.name === "arguments" && util.isReference(path)) {
|
||||
util.replaceWithOrRemove(path, state.getArgsId());
|
||||
state.usesArguments = true;
|
||||
}
|
||||
},
|
||||
ThisExpression: function ThisExpression(path, state) {
|
||||
state.usesThis = true;
|
||||
}
|
||||
};
|
||||
var functionSentVisitor = {
|
||||
MetaProperty: function MetaProperty(path) {
|
||||
var node = path.node;
|
||||
|
||||
if (node.meta.name === "function" && node.property.name === "sent") {
|
||||
var t = util.getTypes();
|
||||
util.replaceWithOrRemove(path, t.memberExpression(t.clone(this.context), t.identifier("_sent")));
|
||||
}
|
||||
}
|
||||
};
|
||||
var awaitVisitor = {
|
||||
Function: function Function(path) {
|
||||
path.skip(); // Don't descend into nested function scopes.
|
||||
},
|
||||
AwaitExpression: function AwaitExpression(path) {
|
||||
var t = util.getTypes(); // Convert await expressions to yield expressions.
|
||||
|
||||
var argument = path.node.argument; // Transforming `await x` to `yield regeneratorRuntime.awrap(x)`
|
||||
// causes the argument to be wrapped in such a way that the runtime
|
||||
// can distinguish between awaited and merely yielded values.
|
||||
|
||||
util.replaceWithOrRemove(path, t.yieldExpression(t.callExpression(util.runtimeProperty("awrap"), [argument]), false));
|
||||
}
|
||||
};
|
Reference in New Issue
Block a user