@panpanzhao/component-ui 0.0.5 → 0.0.6

package/lib/styles/table-editable.css

@@ -1 +1 @@
-.popover-error{color:#f56c6c;font-size:14px;line-height:22px;padding:12px;white-space:normal}.popover-error .popper__arrow{left:15px!important}.column-form-item.is-error .el-input__inner,.column-form-item.is-error .el-input__inner:focus,.column-form-item.is-error .el-textarea__inner,.column-form-item.is-error .el-textarea__inner:focus{border-color:#f56c6c}
+.popover-error{color:#f56c6c;font-size:14px;line-height:22px;padding:12px;white-space:normal}.popover-error .popper__arrow{left:15px!important}.column-form-item.is-error .el-input__inner,.column-form-item.is-error .el-input__inner:focus,.column-form-item.is-error .el-textarea__inner,.column-form-item.is-error .el-textarea__inner:focus{border-color:#f56c6c}.table-editable .el-table__row .cell{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-align:center;-ms-flex-align:center;align-items:center}.table-editable .el-table__row .cell .column-form-item,.table-editable .el-table__row .cell .column-form-item .el-select{width:100%}

package/lib/styles/table.css

@@ -1 +1 @@
-.el-table__fixed{height:100%!important}.el-radio .el-radio__label{padding-left:0}.tool .el-button+.el-button,.tool .el-button+.el-dropdown,.tool .el-link+.el-dropdown,.tool .el-link+.el-link{margin-left:10px}.table-page_tools{text-align:center}
+.el-table__fixed{height:100%!important}.el-radio .el-radio__label{padding-left:0}.tool{white-space:nowrap}.tool .el-button+.el-button,.tool .el-button+.el-dropdown,.tool .el-link+.el-dropdown,.tool .el-link+.el-link{margin-left:10px}.table-page_tools{text-align:center}

package/lib/utils/helper.js

@@ -1,48 +1,14 @@
 "use strict";
 
 exports.__esModule = true;
-exports.everyTree = everyTree;
-exports.findTree = findTree;
-/**
- * 在树中查找节点。
- * @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 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;
-  });
-}
+exports.uuid = void 0;
+// 参考 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);
+};
+exports.uuid = uuid;

package/lib/utils/index.js

@@ -0,0 +1,15 @@
+"use strict";
+
+exports.__esModule = true;
+var _helper = require("./helper");
+Object.keys(_helper).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _helper[key]) return;
+  exports[key] = _helper[key];
+});
+var _tree = require("./tree");
+Object.keys(_tree).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (key in exports && exports[key] === _tree[key]) return;
+  exports[key] = _tree[key];
+});

package/lib/utils/tree.js

@@ -0,0 +1,333 @@
+"use strict";
+
+exports.__esModule = true;
+exports.eachTree = eachTree;
+exports.everyTree = everyTree;
+exports.filterTree = filterTree;
+exports.findTree = findTree;
+exports.findTreeIndex = findTreeIndex;
+exports.getTree = getTree;
+exports.getTreeAncestors = getTreeAncestors;
+exports.getTreeDepth = getTreeDepth;
+exports.getTreeParent = getTreeParent;
+exports.mapTree = mapTree;
+exports.someTree = someTree;
+exports.spliceTree = spliceTree;
+exports.spliceTreeSelf = spliceTreeSelf;
+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;
+}

package/package.json

@@ -1,8 +1,8 @@
 {
   "name": "@panpanzhao/component-ui",
-  "version": "0.0.5",
+  "version": "0.0.6",
   "description": "A Component Library for Vue.js.",
-  "main": "lib/component-ui.common.js",
+  "main": "src/index.js",
   "unpkg": "lib/index.js",
   "style": "lib/styles/component-ui.css",
   "files": [

package/src/index.js

@@ -0,0 +1,67 @@
+import Form from "./components/form/index.js"
+import FormInput from "./components/form-input/index.js"
+import FormItem from "./components/form-item/index.js"
+import FormGroup from "./components/form-group/index.js"
+import FormDialog from "./components/form-dialog/index.js"
+import FormView from "./components/form-view/index.js"
+import FormViewGroup from "./components/form-view-group/index.js"
+import FormViewDialog from "./components/form-view-dialog/index.js"
+import Table from "./components/table/index.js"
+import TableColumn from "./components/table-column/index.js"
+import TableSearch from "./components/table-search/index.js"
+import TableEditable from "./components/table-editable/index.js"
+import Crud from "./components/crud/index.js"
+import Formula from "./components/formula/index.js"
+import Dialog from "./components/dialog/index.js"
+const components = [
+  Form,
+  FormInput,
+  FormItem,
+  FormGroup,
+  FormDialog,
+  FormView,
+  FormViewGroup,
+  FormViewDialog,
+	Table,
+  TableColumn,
+  TableSearch,
+  TableEditable,
+  Crud,
+  Formula,
+  Dialog
+];
+
+const install = function(Vue, opts = {}) {
+  components.forEach(component => {
+    Vue.component(component.name, component);
+  });
+  Vue.prototype.$COMPONENT = opts
+  Vue.prototype.$ELEMENT = {
+    size: opts.size || 'small',
+    zIndex: opts.zIndex || 2000
+  };
+};
+
+/* istanbul ignore if */
+if (typeof window !== 'undefined' && window.Vue) {
+  install(window.Vue);
+}
+export default {
+	version: '0.0.1',
+	install,
+  Form,
+  FormInput,
+  FormItem,
+  FormGroup,
+  FormDialog,
+  FormView,
+  FormViewGroup,
+  FormViewDialog,
+	Table,
+  TableColumn,
+  TableSearch,
+  TableEditable,
+  Crud,
+  Formula,
+  Dialog
+};