UNPKG

d2-ui

Version:
299 lines (233 loc) 9.39 kB
/*istanbul ignore next*/"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; /*istanbul ignore next*/exports._containerInsert = _containerInsert; /*istanbul ignore next*/exports._containerInsertBefore = _containerInsertBefore; /*istanbul ignore next*/exports._containerInsertAfter = _containerInsertAfter; /*istanbul ignore next*/exports._maybePopFromStatements = _maybePopFromStatements; /*istanbul ignore next*/exports.insertAfter = insertAfter; /*istanbul ignore next*/exports.updateSiblingKeys = updateSiblingKeys; /*istanbul ignore next*/exports._verifyNodeList = _verifyNodeList; /*istanbul ignore next*/exports.unshiftContainer = unshiftContainer; /*istanbul ignore next*/exports.pushContainer = pushContainer; /*istanbul ignore next*/exports.hoist = hoist; var /*istanbul ignore next*/_cache = require("../cache"); var /*istanbul ignore next*/_hoister = require("./lib/hoister"); /*istanbul ignore next*/ var _hoister2 = _interopRequireDefault(_hoister); var /*istanbul ignore next*/_index = require("./index"); /*istanbul ignore next*/ var _index2 = _interopRequireDefault(_index); var /*istanbul ignore next*/_babelTypes = require("babel-types"); /*istanbul ignore next*/ var t = _interopRequireWildcard(_babelTypes); /*istanbul ignore next*/ 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( /*istanbul ignore next*/_index2.default.get({ parentPath: this.parentPath, parent: this.parent, container: this.container, listKey: this.listKey, key: to })); } } var contexts = this._getQueueContexts(); for ( /*istanbul ignore next*/var _iterator = paths, _isArray = Array.isArray(_iterator), _i = 0, _iterator = _isArray ? _iterator : (0, _getIterator3.default)(_iterator);;) { /*istanbul ignore next*/ 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 () /*istanbul ignore next*/{ return "Inserted."; }); for ( /*istanbul ignore next*/var _iterator2 = contexts, _isArray2 = Array.isArray(_iterator2), _i2 = 0, _iterator2 = _isArray2 ? _iterator2 : (0, _getIterator3.default)(_iterator2);;) { /*istanbul ignore next*/ 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 = /*istanbul ignore next*/_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 = /*istanbul ignore next*/void 0; if (!node) { msg = "has falsy node"; } else if ( /*istanbul ignore next*/(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 /*istanbul ignore next*/_index2.default) { msg = "has a NodePath when it expected a raw object"; } if (msg) { var type = Array.isArray(node) ? "array" : /*istanbul ignore next*/typeof node === "undefined" ? "undefined" : (0, _typeof3.default)(node); throw new Error( /*istanbul ignore next*/"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 = /*istanbul ignore next*/_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 = /*istanbul ignore next*/_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() { /*istanbul ignore next*/var scope = arguments.length <= 0 || arguments[0] === undefined ? this.scope : arguments[0]; var hoister = new /*istanbul ignore next*/_hoister2.default(this, scope); return hoister.run(); }