amos-tool 1.4.7 → 1.4.10

package/lib/tableFilter.js

@@ -1,213 +1,222 @@
 "use strict";
-var _utils = require("./utils"),
-  _trim = require("./_trim"),
-  _deepCopy = require("./_deepCopy");
+
+var _utils = require("./utils"), _trim = require("./_trim"), _deepCopy = require("./_deepCopy");
 
 function getChildrenlength(e) {
   var t = 1;
-  return t = _utils.isArray(e) ? e.length : t
+  return _utils.isArray(e) && (t = e.length), t;
 }
 
 function flatToHierarchy(e) {
   if (!e.length) return e;
-  var l = [],
-    c = {};
-  e.forEach(function(e) {
-    var t;
-    e.pos && (t = e.pos.split("-").length, c[t] || (c[t] = []), c[t].push(e))
-  });
-  e = Object.keys(c).sort(function(e, t) {
-    return t - e
-  });
-  return _utils.reduce(e, function(e, r) {
-    return r && r !== e && c[e].forEach(function(t) {
-      var n = !1;
-      c[r].forEach(function(e) {
-        isInclude(e.pos.split("-"), t.pos.split("-")) && (n = !0, e.children || (e.children = []), e.children.push(t))
-      }), n || l.push(t)
-    }), r
-  }), c[e[e.length - 1]].concat(l)
+  var t = [], n = {};
+  e.forEach((function(e) {
+    if (e.pos) {
+      var t = e.pos.split("-").length;
+      n[t] || (n[t] = []), n[t].push(e);
+    }
+  }));
+  var r = Object.keys(n).sort((function(e, t) {
+    return t - e;
+  }));
+  return _utils.reduce(r, (function(e, r) {
+    return r && r !== e && n[e].forEach((function(e) {
+      var l = !1;
+      n[r].forEach((function(t) {
+        isInclude(t.pos.split("-"), e.pos.split("-")) && (l = !0, t.children || (t.children = []), 
+        t.children.push(e));
+      })), l || t.push(e);
+    })), r;
+  })), n[r[r.length - 1]].concat(t);
 }
 
 function filterParentPosition(e) {
-  var l = {};
-  e.forEach(function(e) {
-    var t = e.split("-").length;
-    l[t] || (l[t] = []), l[t].push(e)
-  });
-  for (var c = Object.keys(l).sort(), t = 0; t < c.length; t++) c[t + 1] && l[c[t]].forEach(function(n) {
-    for (var r = t + 1; r < c.length; r++) l[c[r]].forEach(function(e, t) {
-      isInclude(n.split("-"), e.split("-")) && (l[c[r]][t] = null)
-    }), l[c[r]] = l[c[r]].filter(function(e) {
-      return e
-    })
-  });
-  var n = [];
-  return c.forEach(function(e) {
-    n = n.concat(l[e])
-  }), n
+  var t = {};
+  e.forEach((function(e) {
+    var n = e.split("-").length;
+    t[n] || (t[n] = []), t[n].push(e);
+  }));
+  for (var n = Object.keys(t).sort(), r = 0; r < n.length; r++) n[r + 1] && t[n[r]].forEach((function(e) {
+    for (var l = r + 1; l < n.length; l++) t[n[l]].forEach((function(r, c) {
+      isInclude(e.split("-"), r.split("-")) && (t[n[l]][c] = null);
+    })), t[n[l]] = t[n[l]].filter((function(e) {
+      return e;
+    }));
+  }));
+  var l = [];
+  return n.forEach((function(e) {
+    l = l.concat(t[e]);
+  })), l;
 }
 
-function isInclude(e, n) {
-  return _utils.every(e, function(e, t) {
-    return e === n[t]
-  })
+function isInclude(e, t) {
+  return _utils.every(e, (function(e, n) {
+    return e === t[n];
+  }));
 }
 
-function filterAllCheckedData(l, e) {
-  if (!l.length) return l;
-  var e = recursiveGen(e),
-    c = [];
-  return function r(e) {
-      e.forEach(function(e) {
-        var t, n;
-        e.__checked || (t = l.indexOf(e.value), n = e.children, -1 < t ? (e.__checked = !0, c.push({
-          node: e,
-          pos: e._pos
-        }), l.splice(t, 1), n && recursive(n, function(e) {
-          e.__checked = !0, c.push({
+function filterAllCheckedData(e, t) {
+  if (!e.length) return e;
+  var n = recursiveGen(t), r = [];
+  return function t(n) {
+    n.forEach((function(n) {
+      if (!n.__checked) {
+        var l = e.indexOf(n.value), c = n.children;
+        l > -1 ? (n.__checked = !0, r.push({
+          node: n,
+          pos: n._pos
+        }), e.splice(l, 1), c && recursive(c, (function(e) {
+          e.__checked = !0, r.push({
             node: e,
             pos: e._pos
-          })
-        })) : n && r(n))
-      })
-    }(e),
-    function n(e, t) {
-      t = t || {
-        root: !0
-      };
-      var r = 0;
-      e.forEach(function(e) {
-        var t = e.children;
-        !t || e.__checked || e.__halfChecked ? e.__checked ? r++ : e.__halfChecked && (r += .5) : (e = n(t, e)).__checked ? r++ : e.__halfChecked && (r += .5)
-      });
-      var l = e.length;
-      return r === l ? (t.__checked = !0, c.push({
-        node: t,
-        pos: t._pos
-      })) : r < l && 0 < r && (t.__halfChecked = !0), t.root ? e : t
-    }(e), c.forEach(function(e, t) {
-      delete c[t].node.__checked, delete c[t].node._pos, c[t].node.props = {
-        title: c[t].node.title,
-        label: c[t].node.label || c[t].node.title,
-        value: c[t].node.value
-      }, c[t].node.children && (c[t].node.props.children = c[t].node.children), delete c[t].node.title, delete c[t].node.label, delete c[t].node.value, delete c[t].node.children
-    }), c
+          });
+        }))) : c && t(c);
+      }
+    }));
+  }(n), function e(t, n) {
+    n || (n = {
+      root: !0
+    });
+    var l = 0;
+    t.forEach((function(t) {
+      var n = t.children;
+      if (!n || t.__checked || t.__halfChecked) t.__checked ? l++ : t.__halfChecked && (l += .5); else {
+        var r = e(n, t);
+        r.__checked ? l++ : r.__halfChecked && (l += .5);
+      }
+    }));
+    var c = t.length;
+    return l === c ? (n.__checked = !0, r.push({
+      node: n,
+      pos: n._pos
+    })) : l < c && l > 0 && (n.__halfChecked = !0), n.root ? t : n;
+  }(n), r.forEach((function(e, t) {
+    delete r[t].node.__checked, delete r[t].node._pos, r[t].node.props = {
+      title: r[t].node.title,
+      label: r[t].node.label || r[t].node.title,
+      value: r[t].node.value
+    }, r[t].node.children && (r[t].node.props.children = r[t].node.children), delete r[t].node.title, 
+    delete r[t].node.label, delete r[t].node.value, delete r[t].node.children;
+  })), r;
 }
 
-function recursiveGen(e, r) {
-  return r = r || 0, e.map(function(e, t) {
-    var n = r + "-" + t,
-      t = {
-        title: e.title,
-        label: e.label || e.title,
-        value: e.value,
-        key: e.key,
-        _pos: n
-      };
-    return e.children && (t.children = recursiveGen(e.children, n)), t
-  })
+function recursiveGen(e, t) {
+  return t || (t = 0), e.map((function(e, n) {
+    var r = t + "-" + n, l = {
+      title: e.title,
+      label: e.label || e.title,
+      value: e.value,
+      key: e.key,
+      _pos: r
+    };
+    return e.children && (l.children = recursiveGen(e.children, r)), l;
+  }));
 }
 
 function recursive(e, t) {
-  e.forEach(function(e) {
-    t(e), e.children && recursive(e.children, t)
-  })
+  e.forEach((function(e) {
+    t(e), e.children && recursive(e.children, t);
+  }));
 }
 
-function flatCustomArr(n, e) {
-  if (n = _trim(n), _utils.isEmpty(n)) return e;
-  if (!e.length) return e;
-  var l = [],
-    c = {};
-  ! function t(e) {
-    e.forEach(function(e) {
-      e.code && (0 != e.level && "0" != e.level && !e.level || (e.children && 0 < e.children.length ? (c[e.level] || (c[e.level] = []), c[e.level].push(e), t(e.children), e.children = []) : (c[e.level] || (c[e.level] = []), -1 < e.label.indexOf(n) && c[e.level].push(e))))
-    })
-  }(e);
-  e = Object.keys(c).sort(function(e, t) {
-    return t - e
-  });
-  return _utils.reduce(e, function(e, r) {
-    return r && r !== e && c[e].forEach(function(t, e) {
-      var n = !1;
-      c[r].forEach(function(e) {
-        isInclude(e.pos.split("-"), t.pos.split("-")) && (n = !0, e.children || (e.children = []), e.children.push(t))
-      }), n || l.push(t)
-    }), r
-  }), c[e[e.length - 1]].concat(l)
+function flatCustomArr(e, t) {
+  if (e = _trim(e), _utils.isEmpty(e)) return t;
+  if (!t.length) return t;
+  var n = [], r = {};
+  !function t(n) {
+    n.forEach((function(n) {
+      n.code && (0 == n.level || "0" == n.level || n.level) && (n.children && n.children.length > 0 ? (r[n.level] || (r[n.level] = []), 
+      r[n.level].push(n), t(n.children), n.children = []) : (r[n.level] || (r[n.level] = []), 
+      n.label.indexOf(e) > -1 && r[n.level].push(n)));
+    }));
+  }(t);
+  var l = Object.keys(r).sort((function(e, t) {
+    return t - e;
+  }));
+  return _utils.reduce(l, (function(e, t) {
+    return t && t !== e && r[e].forEach((function(e, l) {
+      var c = !1;
+      r[t].forEach((function(t) {
+        isInclude(t.pos.split("-"), e.pos.split("-")) && (c = !0, t.children || (t.children = []), 
+        t.children.push(e));
+      })), c || n.push(e);
+    })), t;
+  })), r[l[l.length - 1]].concat(n);
 }
 
 function recombineFlatData(e, t) {
-  return flatCustomArr(e, t)
+  return flatCustomArr(e, t);
 }
 
 function flatMatchedData2Hierarchy(e) {
   if (!e.length) return e;
-  var l = [],
-    c = {};
-  e.forEach(function(e) {
-    var t;
-    e.code && (t = e.code.split("_").length, c[t] || (c[t] = []), c[t].push(e))
-  });
-  e = Object.keys(c).sort(function(e, t) {
-    return t - e
-  });
-  return _utils.reduce(e, function(e, r) {
-    return r && r !== e && c[e].forEach(function(t) {
-      var n = !1;
-      c[r].forEach(function(e) {
-        isInclude(e.code.split("_"), t.code.split("_")) && (n = !0, e.children || (e.children = []), e.children.push(t))
-      }), n || l.push(t)
-    }), r
-  }), c[e[e.length - 1]].concat(l)
+  var t = [], n = {};
+  e.forEach((function(e) {
+    if (e.code) {
+      var t = e.code.split("_").length;
+      n[t] || (n[t] = []), n[t].push(e);
+    }
+  }));
+  var r = Object.keys(n).sort((function(e, t) {
+    return t - e;
+  }));
+  return _utils.reduce(r, (function(e, r) {
+    return r && r !== e && n[e].forEach((function(e) {
+      var l = !1;
+      n[r].forEach((function(t) {
+        isInclude(t.code.split("_"), e.code.split("_")) && (l = !0, t.children || (t.children = []), 
+        t.children.push(e));
+      })), l || t.push(e);
+    })), r;
+  })), n[r[r.length - 1]].concat(t);
 }
 
-function fileterAllMatchedData(l, e) {
-  var c = [];
-  return function r(e) {
-      e.forEach(function(e) {
-        var t, n;
-        e.__matched || (e.__pos = e.code, t = e.label.indexOf(l), n = e.children, -1 < t && (e.__matched = !0, c.push(e)), n && r(n))
-      })
-    }(e),
-    function n(e, t) {
-      t = t || {
-        root: !0
-      };
-      var r = !1;
-      return e.forEach(function(e) {
-        var t = e.children;
-        !t || e.__matched || e.__halfMatched ? e.__matched && (r = !0) : n(t, e).__matched && (r = !0)
-      }), r && (t.__matched = !0, t.children = [], t.root || c.push(t)), t.root ? e : t
-    }(e), c.forEach(function(e, t) {
-      delete c[t].__matched, delete c[t].__halfMatched, delete c[t].__pos, delete c[t].children
-    }), c
+function fileterAllMatchedData(e, t) {
+  var n = [];
+  return function t(r) {
+    r.forEach((function(r) {
+      if (!r.__matched) {
+        r.__pos = r.code;
+        var l = r.label.indexOf(e), c = r.children;
+        l > -1 ? (r.__matched = !0, n.push(r), c && t(c)) : c && t(c);
+      }
+    }));
+  }(t), function e(t, r) {
+    r || (r = {
+      root: !0
+    });
+    var l = !1;
+    return t.forEach((function(t) {
+      var n = t.children;
+      !n || t.__matched || t.__halfMatched ? t.__matched && (l = !0) : e(n, t).__matched && (l = !0);
+    })), l && (r.__matched = !0, r.children = [], r.root || n.push(r)), r.root ? t : r;
+  }(t), n.forEach((function(e, t) {
+    delete n[t].__matched, delete n[t].__halfMatched, delete n[t].__pos, delete n[t].children;
+  })), n;
 }
 
 function recombineData(e, t) {
-  return e = _trim(e), !_utils.isEmpty(e) && t.length ? flatMatchedData2Hierarchy(fileterAllMatchedData(e, t = _deepCopy(t))) : t
+  return e = _trim(e), _utils.isEmpty(e) ? t : t.length ? flatMatchedData2Hierarchy(fileterAllMatchedData(e, t = _deepCopy(t))) : t;
 }
 
-function filterChilds(r, e) {
-  var l = [];
-  return function n(e) {
-    e.forEach(function(e, t) {
-      e.children && 0 < e.children.length ? n(e.children) : -1 < e.label.indexOf(r) && l.push(e)
-    })
-  }(e), l
+function filterChilds(e, t) {
+  var n = [];
+  return function t(r) {
+    r.forEach((function(r, l) {
+      r.children && r.children.length > 0 ? t(r.children) : r.label.indexOf(e) > -1 && n.push(r);
+    }));
+  }(t), n;
 }
 
 function filterTreeLevel(e, t, n) {
-  var r = 3,
-    l = (n = n || {}).levelKey || "level",
-    c = n.childrenKey || "children";
-  return function n(e) {
-    e.forEach(function(e, t) {
-      e[c] && 0 < e[c].length ? n(e[c]) : e[l] == r && delete e[c]
-    })
-  }(e = e || []), e
+  var r = (n = n || {}).levelKey || "level", l = n.childrenKey || "children";
+  return function e(t) {
+    t.forEach((function(t, n) {
+      t[l] && t[l].length > 0 ? e(t[l]) : 3 == t[r] && delete t[l];
+    }));
+  }(e = e || []), e;
 }
+
 module.exports = {
   getChildrenlength: getChildrenlength,
   flatToHierarchy: flatToHierarchy,
@@ -220,4 +229,4 @@ module.exports = {
   fileterAllMatchedData: fileterAllMatchedData,
   recursive: recursive,
   filterTreeLevel: filterTreeLevel
-};
+};

package/lib/throttleDebounce.js

@@ -1,34 +1,30 @@
 "use strict";
 
-function throttle(i, u, c, r) {
-  var l, d = !1,
-    a = 0;
-
-  function f() {
-    l && clearTimeout(l)
+function throttle(t, o, e, n) {
+  var i, u = !1, c = 0;
+  function r() {
+    i && clearTimeout(i);
   }
-
-  function t() {
-    var t = this,
-      o = Date.now() - a,
-      e = arguments;
-
-    function n() {
-      a = Date.now(), c.apply(t, e)
+  function l() {
+    var l = this, d = Date.now() - c, a = arguments;
+    function f() {
+      c = Date.now(), e.apply(l, a);
     }
-    d || (r && !l && n(), f(), void 0 === r && i < o ? n() : !0 !== u && (l = setTimeout(r ? function() {
-      l = void 0
-    } : n, void 0 === r ? i - o : i)))
+    function v() {
+      i = void 0;
+    }
+    u || (n && !i && f(), r(), void 0 === n && d > t ? f() : !0 !== o && (i = setTimeout(n ? v : f, void 0 === n ? t - d : t)));
   }
-  return "boolean" != typeof u && (r = c, c = u, u = void 0), t.cancel = function() {
-    f(), d = !0
-  }, t
+  return "boolean" != typeof o && (n = e, e = o, o = void 0), l.cancel = function() {
+    r(), u = !0;
+  }, l;
 }
 
 function debounce(t, o, e) {
-  return void 0 === e ? throttle(t, o, !1) : throttle(t, e, !1 !== o)
+  return void 0 === e ? throttle(t, o, !1) : throttle(t, e, !1 !== o);
 }
+
 module.exports = {
   throttle: throttle,
   debounce: debounce
-};
+};

package/lib/url/encodeUrl.js

@@ -1,9 +1,10 @@
 "use strict";
+
 var encodeLen = 8;
+
 module.exports = function(e) {
-  var r = [/[+]/g, /[ ]/g, /[\/]/g, /[\?]/g, /[#]/g, /[&]/g, /[=]/g],
-    g = ["%2B", "%20", "%2F", "%3F", "%23", "%26", "%3D"];
+  var r = [ /[+]/g, /[ ]/g, /[\/]/g, /[\?]/g, /[#]/g, /[&]/g, /[=]/g ], g = [ "%2B", "%20", "%2F", "%3F", "%23", "%26", "%3D" ];
   e = e.replace(/[%]/g, "%25");
   for (var n = 0; n < encodeLen - 1; n++) e = e.replace(r[n], g[n]);
-  return e
-};
+  return e;
+};

package/lib/url/restfulUrl.js

@@ -1,8 +1,9 @@
 "use strict";
-var utils = require("./../utils"),
-  _regex = /\{\s*([^\|\}]+?)\s*(?:\|([^\}]*))?\s*\}/g;
-module.exports = function(e, s, r) {
-  return r = r || _regex, e.replace ? e.replace(r, function(e, r) {
-    return utils.isUndefined(s[r]) ? e : s[r]
-  }) : e
-};
+
+var utils = require("./../utils"), _regex = /\{\s*([^\|\}]+?)\s*(?:\|([^\}]*))?\s*\}/g;
+
+module.exports = function(e, r, s) {
+  return s || (s = _regex), e.replace ? e.replace(s, (function(e, s) {
+    return utils.isUndefined(r[s]) ? e : r[s];
+  })) : e;
+};