babel-schmooze-sprockets 0.1.2 → 0.1.3

data/node_modules/babel-core/node_modules/babel-traverse/lib/path/lib/hoister.js

@@ -0,0 +1,166 @@
+"use strict";
+
+exports.__esModule = true;
+
+var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
+
+var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
+
+var _getIterator2 = require("babel-runtime/core-js/get-iterator");
+
+var _getIterator3 = _interopRequireDefault(_getIterator2);
+
+var _babelTypes = require("babel-types");
+
+var t = _interopRequireWildcard(_babelTypes);
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+var referenceVisitor = {
+  ReferencedIdentifier: function ReferencedIdentifier(path, state) {
+    if (path.isJSXIdentifier() && _babelTypes.react.isCompatTag(path.node.name)) {
+      return;
+    }
+
+    // direct references that we need to track to hoist this to the highest scope we can
+    var binding = path.scope.getBinding(path.node.name);
+    if (!binding) return;
+
+    // this binding isn't accessible from the parent scope so we can safely ignore it
+    // eg. it's in a closure etc
+    if (binding !== state.scope.getBinding(path.node.name)) return;
+
+    if (binding.constant) {
+      state.bindings[path.node.name] = binding;
+    } else {
+      for (var _iterator = binding.constantViolations, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : (0, _getIterator3.default)(_iterator);;) {
+        var _ref;
+
+        if (_isArray) {
+          if (_i >= _iterator.length) break;
+          _ref = _iterator[_i++];
+        } else {
+          _i = _iterator.next();
+          if (_i.done) break;
+          _ref = _i.value;
+        }
+
+        var violationPath = _ref;
+
+        state.breakOnScopePaths = state.breakOnScopePaths.concat(violationPath.getAncestry());
+      }
+    }
+  }
+};
+
+var PathHoister = function () {
+  function PathHoister(path, scope) {
+    (0, _classCallCheck3.default)(this, PathHoister);
+
+    this.breakOnScopePaths = [];
+    this.bindings = {};
+    this.scopes = [];
+    this.scope = scope;
+    this.path = path;
+  }
+
+  PathHoister.prototype.isCompatibleScope = function isCompatibleScope(scope) {
+    for (var key in this.bindings) {
+      var binding = this.bindings[key];
+      if (!scope.bindingIdentifierEquals(key, binding.identifier)) {
+        return false;
+      }
+    }
+
+    return true;
+  };
+
+  PathHoister.prototype.getCompatibleScopes = function getCompatibleScopes() {
+    var scope = this.path.scope;
+    do {
+      if (this.isCompatibleScope(scope)) {
+        this.scopes.push(scope);
+      } else {
+        break;
+      }
+
+      if (this.breakOnScopePaths.indexOf(scope.path) >= 0) {
+        break;
+      }
+    } while (scope = scope.parent);
+  };
+
+  PathHoister.prototype.getAttachmentPath = function getAttachmentPath() {
+    var scopes = this.scopes;
+
+    var scope = scopes.pop();
+    if (!scope) return;
+
+    if (scope.path.isFunction()) {
+      if (this.hasOwnParamBindings(scope)) {
+        // should ignore this scope since it's ourselves
+        if (this.scope === scope) return;
+
+        // needs to be attached to the body
+        return scope.path.get("body").get("body")[0];
+      } else {
+        // doesn't need to be be attached to this scope
+        return this.getNextScopeStatementParent();
+      }
+    } else if (scope.path.isProgram()) {
+      return this.getNextScopeStatementParent();
+    }
+  };
+
+  PathHoister.prototype.getNextScopeStatementParent = function getNextScopeStatementParent() {
+    var scope = this.scopes.pop();
+    if (scope) return scope.path.getStatementParent();
+  };
+
+  PathHoister.prototype.hasOwnParamBindings = function hasOwnParamBindings(scope) {
+    for (var name in this.bindings) {
+      if (!scope.hasOwnBinding(name)) continue;
+
+      var binding = this.bindings[name];
+      if (binding.kind === "param") return true;
+    }
+    return false;
+  };
+
+  PathHoister.prototype.run = function run() {
+    var node = this.path.node;
+    if (node._hoisted) return;
+    node._hoisted = true;
+
+    this.path.traverse(referenceVisitor, this);
+
+    this.getCompatibleScopes();
+
+    var attachTo = this.getAttachmentPath();
+    if (!attachTo) return;
+
+    // don't bother hoisting to the same function as this will cause multiple branches to be evaluated more than once leading to a bad optimisation
+    if (attachTo.getFunctionParent() === this.path.getFunctionParent()) return;
+
+    var uid = attachTo.scope.generateUidIdentifier("ref");
+
+    attachTo.insertBefore([t.variableDeclaration("var", [t.variableDeclarator(uid, this.path.node)])]);
+
+    var parent = this.path.parentPath;
+
+    if (parent.isJSXElement() && this.path.container === parent.node.children) {
+      // turning the `span` in `<div><span /></div>` to an expression so we need to wrap it with
+      // an expression container
+      uid = t.JSXExpressionContainer(uid);
+    }
+
+    this.path.replaceWith(uid);
+  };
+
+  return PathHoister;
+}();
+
+exports.default = PathHoister;
+module.exports = exports["default"];

data/node_modules/babel-core/node_modules/babel-traverse/lib/path/lib/removal-hooks.js

@@ -0,0 +1,64 @@
+"use strict";
+
+exports.__esModule = true;
+// this file contains hooks that handle ancestry cleanup of parent nodes when removing children
+
+/**
+ * Pre hooks should be used for either rejecting removal or delegating removal
+ */
+
+var hooks = exports.hooks = [function (self, parent) {
+  if (self.key === "body" && parent.isArrowFunctionExpression()) {
+    self.replaceWith(self.scope.buildUndefinedNode());
+    return true;
+  }
+}, function (self, parent) {
+  var removeParent = false;
+
+  // while (NODE);
+  // removing the test of a while/switch, we can either just remove it entirely *or* turn the `test` into `true`
+  // unlikely that the latter will ever be what's wanted so we just remove the loop to avoid infinite recursion
+  removeParent = removeParent || self.key === "test" && (parent.isWhile() || parent.isSwitchCase());
+
+  // export NODE;
+  // just remove a declaration for an export as this is no longer valid
+  removeParent = removeParent || self.key === "declaration" && parent.isExportDeclaration();
+
+  // label: NODE
+  // stray labeled statement with no body
+  removeParent = removeParent || self.key === "body" && parent.isLabeledStatement();
+
+  // let NODE;
+  // remove an entire declaration if there are no declarators left
+  removeParent = removeParent || self.listKey === "declarations" && parent.isVariableDeclaration() && parent.node.declarations.length === 1;
+
+  // NODE;
+  // remove the entire expression statement if there's no expression
+  removeParent = removeParent || self.key === "expression" && parent.isExpressionStatement();
+
+  if (removeParent) {
+    parent.remove();
+    return true;
+  }
+}, function (self, parent) {
+  if (parent.isSequenceExpression() && parent.node.expressions.length === 1) {
+    // (node, NODE);
+    // we've just removed the second element of a sequence expression so let's turn that sequence
+    // expression into a regular expression
+    parent.replaceWith(parent.node.expressions[0]);
+    return true;
+  }
+}, function (self, parent) {
+  if (parent.isBinary()) {
+    // left + NODE;
+    // NODE + right;
+    // we're in a binary expression, better remove it and replace it with the last expression
+    if (self.key === "left") {
+      parent.replaceWith(parent.node.right);
+    } else {
+      // key === "right"
+      parent.replaceWith(parent.node.left);
+    }
+    return true;
+  }
+}];

data/node_modules/babel-core/node_modules/babel-traverse/lib/path/lib/virtual-types.js

@@ -0,0 +1,141 @@
+"use strict";
+
+exports.__esModule = true;
+exports.Flow = exports.Pure = exports.Generated = exports.User = exports.Var = exports.BlockScoped = exports.Referenced = exports.Scope = exports.Expression = exports.Statement = exports.BindingIdentifier = exports.ReferencedMemberExpression = exports.ReferencedIdentifier = undefined;
+
+var _babelTypes = require("babel-types");
+
+var t = _interopRequireWildcard(_babelTypes);
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+
+var ReferencedIdentifier = exports.ReferencedIdentifier = {
+  types: ["Identifier", "JSXIdentifier"],
+  checkPath: function checkPath(_ref, opts) {
+    var node = _ref.node;
+    var parent = _ref.parent;
+
+    if (!t.isIdentifier(node, opts)) {
+      if (t.isJSXIdentifier(node, opts)) {
+        if (_babelTypes.react.isCompatTag(node.name)) return false;
+      } else {
+        // not a JSXIdentifier or an Identifier
+        return false;
+      }
+    }
+
+    // check if node is referenced
+    return t.isReferenced(node, parent);
+  }
+};
+
+var ReferencedMemberExpression = exports.ReferencedMemberExpression = {
+  types: ["MemberExpression"],
+  checkPath: function checkPath(_ref2) {
+    var node = _ref2.node;
+    var parent = _ref2.parent;
+
+    return t.isMemberExpression(node) && t.isReferenced(node, parent);
+  }
+};
+
+var BindingIdentifier = exports.BindingIdentifier = {
+  types: ["Identifier"],
+  checkPath: function checkPath(_ref3) {
+    var node = _ref3.node;
+    var parent = _ref3.parent;
+
+    return t.isIdentifier(node) && t.isBinding(node, parent);
+  }
+};
+
+var Statement = exports.Statement = {
+  types: ["Statement"],
+  checkPath: function checkPath(_ref4) {
+    var node = _ref4.node;
+    var parent = _ref4.parent;
+
+    if (t.isStatement(node)) {
+      if (t.isVariableDeclaration(node)) {
+        if (t.isForXStatement(parent, { left: node })) return false;
+        if (t.isForStatement(parent, { init: node })) return false;
+      }
+
+      return true;
+    } else {
+      return false;
+    }
+  }
+};
+
+var Expression = exports.Expression = {
+  types: ["Expression"],
+  checkPath: function checkPath(path) {
+    if (path.isIdentifier()) {
+      return path.isReferencedIdentifier();
+    } else {
+      return t.isExpression(path.node);
+    }
+  }
+};
+
+var Scope = exports.Scope = {
+  types: ["Scopable"],
+  checkPath: function checkPath(path) {
+    return t.isScope(path.node, path.parent);
+  }
+};
+
+var Referenced = exports.Referenced = {
+  checkPath: function checkPath(path) {
+    return t.isReferenced(path.node, path.parent);
+  }
+};
+
+var BlockScoped = exports.BlockScoped = {
+  checkPath: function checkPath(path) {
+    return t.isBlockScoped(path.node);
+  }
+};
+
+var Var = exports.Var = {
+  types: ["VariableDeclaration"],
+  checkPath: function checkPath(path) {
+    return t.isVar(path.node);
+  }
+};
+
+var User = exports.User = {
+  checkPath: function checkPath(path) {
+    return path.node && !!path.node.loc;
+  }
+};
+
+var Generated = exports.Generated = {
+  checkPath: function checkPath(path) {
+    return !path.isUser();
+  }
+};
+
+var Pure = exports.Pure = {
+  checkPath: function checkPath(path, opts) {
+    return path.scope.isPure(path.node, opts);
+  }
+};
+
+var Flow = exports.Flow = {
+  types: ["Flow", "ImportDeclaration", "ExportDeclaration"],
+  checkPath: function checkPath(_ref5) {
+    var node = _ref5.node;
+
+    if (t.isFlow(node)) {
+      return true;
+    } else if (t.isImportDeclaration(node)) {
+      return node.importKind === "type" || node.importKind === "typeof";
+    } else if (t.isExportDeclaration(node)) {
+      return node.exportKind === "type";
+    } else {
+      return false;
+    }
+  }
+};

data/node_modules/babel-core/node_modules/babel-traverse/lib/path/modification.js

@@ -0,0 +1,293 @@
+"use strict";
+
+exports.__esModule = true;
+
+var _typeof2 = require("babel-runtime/helpers/typeof");
+
+var _typeof3 = _interopRequireDefault(_typeof2);
+
+var _getIterator2 = require("babel-runtime/core-js/get-iterator");
+
+var _getIterator3 = _interopRequireDefault(_getIterator2);
+
+exports.insertBefore = insertBefore;
+exports._containerInsert = _containerInsert;
+exports._containerInsertBefore = _containerInsertBefore;
+exports._containerInsertAfter = _containerInsertAfter;
+exports._maybePopFromStatements = _maybePopFromStatements;
+exports.insertAfter = insertAfter;
+exports.updateSiblingKeys = updateSiblingKeys;
+exports._verifyNodeList = _verifyNodeList;
+exports.unshiftContainer = unshiftContainer;
+exports.pushContainer = pushContainer;
+exports.hoist = hoist;
+
+var _cache = require("../cache");
+
+var _hoister = require("./lib/hoister");
+
+var _hoister2 = _interopRequireDefault(_hoister);
+
+var _index = require("./index");
+
+var _index2 = _interopRequireDefault(_index);
+
+var _babelTypes = require("babel-types");
+
+var t = _interopRequireWildcard(_babelTypes);
+
+function _interopRequireWildcard(obj) { if (obj && obj.__esModule) { return obj; } else { var newObj = {}; if (obj != null) { for (var key in obj) { if (Object.prototype.hasOwnProperty.call(obj, key)) newObj[key] = obj[key]; } } newObj.default = obj; return newObj; } }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+ * Insert the provided nodes before the current one.
+ */
+
+/* eslint max-len: 0 */
+// This file contains methods that modify the path/node in some ways.
+
+function insertBefore(nodes) {
+  this._assertUnremoved();
+
+  nodes = this._verifyNodeList(nodes);
+
+  if (this.parentPath.isExpressionStatement() || this.parentPath.isLabeledStatement()) {
+    return this.parentPath.insertBefore(nodes);
+  } else if (this.isNodeType("Expression") || this.parentPath.isForStatement() && this.key === "init") {
+    if (this.node) nodes.push(this.node);
+    this.replaceExpressionWithStatements(nodes);
+  } else {
+    this._maybePopFromStatements(nodes);
+    if (Array.isArray(this.container)) {
+      return this._containerInsertBefore(nodes);
+    } else if (this.isStatementOrBlock()) {
+      if (this.node) nodes.push(this.node);
+      this._replaceWith(t.blockStatement(nodes));
+    } else {
+      throw new Error("We don't know what to do with this node type. We were previously a Statement but we can't fit in here?");
+    }
+  }
+
+  return [this];
+}
+
+function _containerInsert(from, nodes) {
+  this.updateSiblingKeys(from, nodes.length);
+
+  var paths = [];
+
+  for (var i = 0; i < nodes.length; i++) {
+    var to = from + i;
+    var node = nodes[i];
+    this.container.splice(to, 0, node);
+
+    if (this.context) {
+      var path = this.context.create(this.parent, this.container, to, this.listKey);
+
+      // While this path may have a context, there is currently no guarantee that the context
+      // will be the active context, because `popContext` may leave a final context in place.
+      // We should remove this `if` and always push once T7171 has been resolved.
+      if (this.context.queue) path.pushContext(this.context);
+      paths.push(path);
+    } else {
+      paths.push(_index2.default.get({
+        parentPath: this.parentPath,
+        parent: this.parent,
+        container: this.container,
+        listKey: this.listKey,
+        key: to
+      }));
+    }
+  }
+
+  var contexts = this._getQueueContexts();
+
+  for (var _iterator = paths, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : (0, _getIterator3.default)(_iterator);;) {
+    var _ref;
+
+    if (_isArray) {
+      if (_i >= _iterator.length) break;
+      _ref = _iterator[_i++];
+    } else {
+      _i = _iterator.next();
+      if (_i.done) break;
+      _ref = _i.value;
+    }
+
+    var _path = _ref;
+
+    _path.setScope();
+    _path.debug(function () {
+      return "Inserted.";
+    });
+
+    for (var _iterator2 = contexts, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : (0, _getIterator3.default)(_iterator2);;) {
+      var _ref2;
+
+      if (_isArray2) {
+        if (_i2 >= _iterator2.length) break;
+        _ref2 = _iterator2[_i2++];
+      } else {
+        _i2 = _iterator2.next();
+        if (_i2.done) break;
+        _ref2 = _i2.value;
+      }
+
+      var context = _ref2;
+
+      context.maybeQueue(_path, true);
+    }
+  }
+
+  return paths;
+}
+
+function _containerInsertBefore(nodes) {
+  return this._containerInsert(this.key, nodes);
+}
+
+function _containerInsertAfter(nodes) {
+  return this._containerInsert(this.key + 1, nodes);
+}
+
+function _maybePopFromStatements(nodes) {
+  var last = nodes[nodes.length - 1];
+  var isIdentifier = t.isIdentifier(last) || t.isExpressionStatement(last) && t.isIdentifier(last.expression);
+
+  if (isIdentifier && !this.isCompletionRecord()) {
+    nodes.pop();
+  }
+}
+
+/**
+ * Insert the provided nodes after the current one. When inserting nodes after an
+ * expression, ensure that the completion record is correct by pushing the current node.
+ */
+
+function insertAfter(nodes) {
+  this._assertUnremoved();
+
+  nodes = this._verifyNodeList(nodes);
+
+  if (this.parentPath.isExpressionStatement() || this.parentPath.isLabeledStatement()) {
+    return this.parentPath.insertAfter(nodes);
+  } else if (this.isNodeType("Expression") || this.parentPath.isForStatement() && this.key === "init") {
+    if (this.node) {
+      var temp = this.scope.generateDeclaredUidIdentifier();
+      nodes.unshift(t.expressionStatement(t.assignmentExpression("=", temp, this.node)));
+      nodes.push(t.expressionStatement(temp));
+    }
+    this.replaceExpressionWithStatements(nodes);
+  } else {
+    this._maybePopFromStatements(nodes);
+    if (Array.isArray(this.container)) {
+      return this._containerInsertAfter(nodes);
+    } else if (this.isStatementOrBlock()) {
+      if (this.node) nodes.unshift(this.node);
+      this._replaceWith(t.blockStatement(nodes));
+    } else {
+      throw new Error("We don't know what to do with this node type. We were previously a Statement but we can't fit in here?");
+    }
+  }
+
+  return [this];
+}
+
+/**
+ * Update all sibling node paths after `fromIndex` by `incrementBy`.
+ */
+
+function updateSiblingKeys(fromIndex, incrementBy) {
+  if (!this.parent) return;
+
+  var paths = _cache.path.get(this.parent);
+  for (var i = 0; i < paths.length; i++) {
+    var path = paths[i];
+    if (path.key >= fromIndex) {
+      path.key += incrementBy;
+    }
+  }
+}
+
+function _verifyNodeList(nodes) {
+  if (!nodes) {
+    return [];
+  }
+
+  if (nodes.constructor !== Array) {
+    nodes = [nodes];
+  }
+
+  for (var i = 0; i < nodes.length; i++) {
+    var node = nodes[i];
+    var msg = void 0;
+
+    if (!node) {
+      msg = "has falsy node";
+    } else if ((typeof node === "undefined" ? "undefined" : (0, _typeof3.default)(node)) !== "object") {
+      msg = "contains a non-object node";
+    } else if (!node.type) {
+      msg = "without a type";
+    } else if (node instanceof _index2.default) {
+      msg = "has a NodePath when it expected a raw object";
+    }
+
+    if (msg) {
+      var type = Array.isArray(node) ? "array" : typeof node === "undefined" ? "undefined" : (0, _typeof3.default)(node);
+      throw new Error("Node list " + msg + " with the index of " + i + " and type of " + type);
+    }
+  }
+
+  return nodes;
+}
+
+function unshiftContainer(listKey, nodes) {
+  this._assertUnremoved();
+
+  nodes = this._verifyNodeList(nodes);
+
+  // get the first path and insert our nodes before it, if it doesn't exist then it
+  // doesn't matter, our nodes will be inserted anyway
+  var path = _index2.default.get({
+    parentPath: this,
+    parent: this.node,
+    container: this.node[listKey],
+    listKey: listKey,
+    key: 0
+  });
+
+  return path.insertBefore(nodes);
+}
+
+function pushContainer(listKey, nodes) {
+  this._assertUnremoved();
+
+  nodes = this._verifyNodeList(nodes);
+
+  // get an invisible path that represents the last node + 1 and replace it with our
+  // nodes, effectively inlining it
+
+  var container = this.node[listKey];
+  var path = _index2.default.get({
+    parentPath: this,
+    parent: this.node,
+    container: container,
+    listKey: listKey,
+    key: container.length
+  });
+
+  return path.replaceWithMultiple(nodes);
+}
+
+/**
+ * Hoist the current node to the highest scope possible and return a UID
+ * referencing it.
+ */
+
+function hoist() {
+  var scope = arguments.length <= 0 || arguments[0] === undefined ? this.scope : arguments[0];
+
+  var hoister = new _hoister2.default(this, scope);
+  return hoister.run();
+}