@panpanzhao/component-ui 0.0.5 → 0.0.6

package/lib/components/formula.js

@@ -94,38 +94,378 @@ module.exports = require("@vue/babel-helper-vue-jsx-merge-props");
 
 /***/ }),
 
-/***/ 21:
-/***/ (function(module, exports) {
+/***/ 19:
+/***/ (function(module, __webpack_exports__, __webpack_require__) {
+
+"use strict";
+
+// EXPORTS
+__webpack_require__.d(__webpack_exports__, "d", function() { return /* reexport */ uuid; });
+__webpack_require__.d(__webpack_exports__, "a", function() { return /* reexport */ findTree; });
+__webpack_require__.d(__webpack_exports__, "b", function() { return /* reexport */ findTreeIndex; });
+__webpack_require__.d(__webpack_exports__, "c", function() { return /* reexport */ spliceTreeSelf; });
+
+// UNUSED EXPORTS: mapTree, eachTree, getTree, filterTree, everyTree, someTree, spliceTree, getTreeDepth, getTreeAncestors, getTreeParent
+
+// CONCATENATED MODULE: ./src/utils/helper.js
+// 参考 https://github.com/streamich/v4-uuid
+var str = function str() {
+  return ('00000000000000000' + (Math.random() * 0xffffffffffffffff).toString(16)).slice(-16);
+};
+var uuid = function uuid() {
+  var a = str();
+  var b = str();
+  return a.slice(0, 8) + '-' + a.slice(8, 12) + '-4' + a.slice(13) + '-a' + b.slice(1, 4) + '-' + b.slice(4);
+};
+// CONCATENATED MODULE: ./src/utils/tree.js
+function _extends() { _extends = Object.assign ? Object.assign.bind() : function (target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i]; for (var key in source) { if (Object.prototype.hasOwnProperty.call(source, key)) { target[key] = source[key]; } } } return target; }; return _extends.apply(this, arguments); }
+/**
+ * 类似于 arr.map 方法，此方法主要针对类似下面示例的树形结构。
+ * [
+ *     {
+ *         children: []
+ *     },
+ *     // 其他成员
+ * ]
+ *
+ * @param {Tree} tree 树形数据
+ * @param {Function} iterator 处理函数，返回的数据会被替换成新的。
+ * @return {Tree} 返回处理过的 tree
+ */
+function mapTree(tree, iterator, level, depthFirst, paths) {
+  if (level === void 0) {
+    level = 1;
+  }
+  if (depthFirst === void 0) {
+    depthFirst = false;
+  }
+  if (paths === void 0) {
+    paths = [];
+  }
+  return tree.map(function (item, index) {
+    if (depthFirst) {
+      var children = item.children ? mapTree(item.children, iterator, level + 1, depthFirst, paths.concat(item)) : undefined;
+      children && (item = _extends({}, item, {
+        children: children
+      }));
+      item = iterator(item, index, level, paths) || _extends({}, item);
+      return item;
+    }
+    item = iterator(item, index, level, paths) || _extends({}, item);
+    if (item.children && item.children.splice) {
+      item.children = mapTree(item.children, iterator, level + 1, depthFirst, paths.concat(item));
+    }
+    return item;
+  });
+}
+
+/**
+ * 遍历树
+ * @param tree
+ * @param iterator
+ */
+function eachTree(tree, iterator, level, paths) {
+  if (level === void 0) {
+    level = 1;
+  }
+  if (paths === void 0) {
+    paths = [];
+  }
+  tree.map(function (item, index) {
+    var currentPath = paths.concat(item);
+    iterator(item, index, level, currentPath);
+    if (item.children && item.children.splice) {
+      eachTree(item.children, iterator, level + 1, currentPath);
+    }
+  });
+}
+/**
+ * 在树中查找节点。
+ * @param tree
+ * @param iterator
+ */
+function findTree(tree, iterator) {
+  var result = null;
+  everyTree(tree, function (item, key, level, paths) {
+    if (iterator(item, key, level, paths)) {
+      result = item;
+      return false;
+    }
+    return true;
+  });
+  return result;
+}
+
+/**
+ * 在树中查找节点, 返回下标数组。
+ * @param tree
+ * @param iterator
+ */
+function findTreeIndex(tree, iterator) {
+  var idx = [];
+  findTree(tree, function (item, index, level, paths) {
+    if (iterator(item, index, level, paths)) {
+      idx = [index];
+      paths = paths.concat();
+      paths.unshift({
+        children: tree
+      });
+      for (var i = paths.length - 1; i > 0; i--) {
+        var prev = paths[i - 1];
+        var current = paths[i];
+        idx.unshift(prev.children && prev.children.indexOf(current));
+      }
+      return true;
+    }
+    return false;
+  });
+  return idx.length ? idx : undefined;
+}
+function getTree(tree, idx) {
+  var indexes = Array.isArray(idx) ? idx.concat() : [idx];
+  var lastIndex = indexes.pop();
+  var list = tree;
+  for (var i = 0, len = indexes.length; i < len; i++) {
+    var index = indexes[i];
+    if (!list || !list[index]) {
+      list = null;
+      break;
+    }
+    list = list[index].children;
+  }
+  return list ? list[lastIndex] : undefined;
+}
+/**
+ * 过滤树节点
+ *
+ * @param tree
+ * @param iterator
+ */
+function filterTree(tree, iterator, level, depthFirst) {
+  if (level === void 0) {
+    level = 1;
+  }
+  if (depthFirst === void 0) {
+    depthFirst = false;
+  }
+  if (depthFirst) {
+    return tree.map(function (item) {
+      var children = item.children ? filterTree(item.children, iterator, level + 1, depthFirst) : undefined;
+      if (Array.isArray(children) && Array.isArray(item.children)) {
+        item = _extends({}, item, {
+          children: children
+        });
+      }
+      return item;
+    }).filter(function (item, index) {
+      return iterator(item, index, level);
+    });
+  }
+  return tree.filter(function (item, index) {
+    return iterator(item, index, level);
+  }).map(function (item) {
+    if (item.children && item.children.splice) {
+      var children = filterTree(item.children, iterator, level + 1, depthFirst);
+      if (Array.isArray(children) && Array.isArray(item.children)) {
+        item = _extends({}, item, {
+          children: children
+        });
+      }
+    }
+    return item;
+  });
+}
+
+/**
+ * 判断树中每个节点是否满足某个条件。
+ * @param tree
+ * @param iterator
+ */
+function everyTree(tree, iterator, level, paths, indexes) {
+  if (level === void 0) {
+    level = 1;
+  }
+  if (paths === void 0) {
+    paths = [];
+  }
+  if (indexes === void 0) {
+    indexes = [];
+  }
+  if (!Array.isArray(tree)) {
+    return false;
+  }
+  return tree.every(function (item, index) {
+    var value = iterator(item, index, level, paths, indexes);
+    if (value && item.children && item.children.splice) {
+      return everyTree(item.children, iterator, level + 1, paths.concat(item), indexes.concat(index));
+    }
+    return value;
+  });
+}
+
+/**
+ * 判断树中是否有某些节点满足某个条件。
+ * @param tree
+ * @param iterator
+ */
+function someTree(tree, iterator) {
+  var result = false;
+  everyTree(tree, function (item, key, level, paths) {
+    if (iterator(item, key, level, paths)) {
+      result = true;
+      return false;
+    }
+    return true;
+  });
+  return result;
+}
+
+/**
+ * 操作树，遵循 imutable, 每次返回一个新的树。
+ * 类似数组的 splice 不同的地方这个方法不修改原始数据，
+ * 同时第二个参数不是下标，而是下标数组，分别代表每一层的下标。
+ *
+ * 至于如何获取下标数组，请查看 findTreeIndex
+ *
+ * @param tree
+ * @param idx
+ * @param deleteCount
+ * @param ...items
+ */
+function spliceTree(tree, idx, deleteCount) {
+  if (deleteCount === void 0) {
+    deleteCount = 0;
+  }
+  var list = tree.concat();
+  for (var _len = arguments.length, items = new Array(_len > 3 ? _len - 3 : 0), _key = 3; _key < _len; _key++) {
+    items[_key - 3] = arguments[_key];
+  }
+  if (typeof idx === 'number') {
+    list.splice.apply(list, [idx, deleteCount].concat(items));
+  } else if (Array.isArray(idx) && idx.length) {
+    idx = idx.concat();
+    var lastIdx = idx.pop();
+    var host = idx.reduce(function (list, idx) {
+      var child = _extends({}, list[idx], {
+        children: list[idx].children ? list[idx].children.concat() : []
+      });
+      list[idx] = child;
+      return child.children;
+    }, list);
+    host.splice.apply(host, [lastIdx, deleteCount].concat(items));
+  }
+  return list;
+}
+
+/**
+ * 计算树的深度
+ * @param tree
+ */
+function getTreeDepth(tree) {
+  return Math.max.apply(Math, tree.map(function (item) {
+    if (Array.isArray(item.children)) {
+      return 1 + getTreeDepth(item.children);
+    }
+    return 1;
+  }));
+}
+
+/**
+ * 从树中获取某个值的所有祖先
+ * @param tree
+ * @param value
+ */
+function getTreeAncestors(tree, value, includeSelf) {
+  if (includeSelf === void 0) {
+    includeSelf = false;
+  }
+  var ancestors = null;
+  findTree(tree, function (item, index, level, paths) {
+    if (item === value) {
+      ancestors = paths;
+      if (includeSelf) {
+        ancestors.push(item);
+      }
+      return true;
+    }
+    return false;
+  });
+  return ancestors;
+}
+
+/**
+ * 从树中获取某个值的上级
+ * @param tree
+ * @param value
+ */
+function getTreeParent(tree, value) {
+  var ancestors = getTreeAncestors(tree, value);
+  return ancestors && ancestors.length ? ancestors[ancestors.length - 1] : null;
+}
+
+/**
+ * 操作树,修车原来的树, 返回修改后的树。
+ * 类似数组的 splice 修改原始数据，
+ * 同时第二个参数不是下标，而是下标数组，分别代表每一层的下标。
+ *
+ * 至于如何获取下标数组，请查看 findTreeIndex
+ *
+ * @param tree
+ * @param idx
+ * @param deleteCount
+ * @param ...items
+ */
+function spliceTreeSelf(tree, idx, deleteCount) {
+  if (deleteCount === void 0) {
+    deleteCount = 0;
+  }
+  var list = tree;
+  for (var _len2 = arguments.length, items = new Array(_len2 > 3 ? _len2 - 3 : 0), _key2 = 3; _key2 < _len2; _key2++) {
+    items[_key2 - 3] = arguments[_key2];
+  }
+  if (typeof idx === 'number') {
+    list.splice.apply(list, [idx, deleteCount].concat(items));
+  } else if (Array.isArray(idx) && idx.length) {
+    idx = idx.concat();
+    var lastIdx = idx.pop();
+    var host = idx.reduce(function (list, idx) {
+      return list[idx] && list[idx].children || [];
+    }, list);
+    host.splice.apply(host, [lastIdx, deleteCount].concat(items));
+  }
+  return list;
+}
+// CONCATENATED MODULE: ./src/utils/index.js
+
 
-module.exports = require("element-ui/lib/input");
 
 /***/ }),
 
-/***/ 28:
+/***/ 20:
 /***/ (function(module, exports) {
 
-module.exports = require("codemirror");
+module.exports = require("element-ui/lib/input");
 
 /***/ }),
 
-/***/ 5:
+/***/ 29:
 /***/ (function(module, exports) {
 
-module.exports = require("element-ui/lib/tabs");
+module.exports = require("codemirror");
 
 /***/ }),
 
-/***/ 58:
+/***/ 5:
 /***/ (function(module, exports) {
 
-module.exports = require("element-ui/lib/tree");
+module.exports = require("element-ui/lib/tabs");
 
 /***/ }),
 
 /***/ 59:
 /***/ (function(module, exports) {
 
-module.exports = require("element-ui/lib/badge");
+module.exports = require("element-ui/lib/tree");
 
 /***/ }),
 
@@ -139,7 +479,7 @@ module.exports = require("element-ui/lib/tab-pane");
 /***/ 60:
 /***/ (function(module, exports) {
 
-module.exports = require("@panpanzhao/component-ui/lib/utils/helper");
+module.exports = require("element-ui/lib/badge");
 
 /***/ }),
 
@@ -197,7 +537,7 @@ var babel_helper_vue_jsx_merge_props_ = __webpack_require__(0);
 var babel_helper_vue_jsx_merge_props_default = /*#__PURE__*/__webpack_require__.n(babel_helper_vue_jsx_merge_props_);
 
 // EXTERNAL MODULE: external "codemirror"
-var external_codemirror_ = __webpack_require__(28);
+var external_codemirror_ = __webpack_require__(29);
 var external_codemirror_default = /*#__PURE__*/__webpack_require__.n(external_codemirror_);
 
 // EXTERNAL MODULE: external "codemirror/mode/javascript/javascript"
@@ -311,7 +651,7 @@ function _asyncToGenerator(fn) { return function () { var self = this, args = ar
   }
 });
 // EXTERNAL MODULE: external "element-ui/lib/input"
-var input_ = __webpack_require__(21);
+var input_ = __webpack_require__(20);
 var input_default = /*#__PURE__*/__webpack_require__.n(input_);
 
 // EXTERNAL MODULE: external "element-ui/lib/collapse"
@@ -449,15 +789,15 @@ var tab_pane_ = __webpack_require__(6);
 var tab_pane_default = /*#__PURE__*/__webpack_require__.n(tab_pane_);
 
 // EXTERNAL MODULE: external "element-ui/lib/tree"
-var tree_ = __webpack_require__(58);
+var tree_ = __webpack_require__(59);
 var tree_default = /*#__PURE__*/__webpack_require__.n(tree_);
 
 // EXTERNAL MODULE: external "element-ui/lib/badge"
-var badge_ = __webpack_require__(59);
+var badge_ = __webpack_require__(60);
 var badge_default = /*#__PURE__*/__webpack_require__.n(badge_);
 
-// EXTERNAL MODULE: external "@panpanzhao/component-ui/lib/utils/helper"
-var helper_ = __webpack_require__(60);
+// EXTERNAL MODULE: ./src/utils/index.js + 2 modules
+var utils = __webpack_require__(19);
 
 // CONCATENATED MODULE: ./src/components/formula/src/variableList.js
 
@@ -502,7 +842,7 @@ var helper_ = __webpack_require__(60);
   methods: {
     handleSearch: function handleSearch(val) {
       this.searchVal = val;
-      var filtered = Object(helper_["findTree"])(this.data, function (i) {
+      var filtered = Object(utils["a" /* findTree */])(this.data, function (i) {
         return ~i.label.indexOf(val);
       });
       this.filterVars = !val ? this.data : filtered ? [filtered] : [];