amos-tool 1.4.4 → 1.4.8

package/lib/extra/_common.js

@@ -1,172 +1,125 @@
 "use strict";
 
-function _typeof(r) {
-  return (_typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(r) {
-    return typeof r
-  } : function(r) {
-    return r && "function" == typeof Symbol && r.constructor === Symbol && r !== Symbol.prototype ? "symbol" : typeof r
-  })(r)
-}
-var builtinIteratee, ObjProto = Object.prototype,
-  toString = ObjProto.toString,
-  nativeIsArray = Array.isArray,
-  nativeKeys = Object.keys,
-  hasEnumBug = !{
-    toString: null
-  }.propertyIsEnumerable("toString"),
-  nonEnumerableProps = ["valueOf", "isPrototypeOf", "toString", "propertyIsEnumerable", "hasOwnProperty", "toLocaleString"],
-  isNumber = function(r) {
-    return /^(\-|\+)?([0-9]+(\.[0-9]+)?|Infinity)$/.test(r)
-  },
-  _isNaN = function(r) {
-    return isNumber(r) && isNaN(r)
-  },
-  isFunction = function(r) {
-    return "function" == typeof r || !1
-  },
-  isObject = function(r) {
-    var t = _typeof(r);
-    return "function" === t || "object" === t && !!r
-  },
-  keys = function(r) {
-    if (!isObject(r)) return [];
-    if (nativeKeys) return nativeKeys(r);
-    var t = [];
-    for (var n in r) has(r, n) && t.push(n);
-    return hasEnumBug && collectNonEnumProps(r, t), t
-  },
-  allKeys = function(r) {
-    if (!isObject(r)) return [];
-    var t = [];
-    for (var n in r) t.push(n);
-    return hasEnumBug && collectNonEnumProps(r, t), t
-  },
-  isArray = nativeIsArray || function(r) {
-    return "[object Array]" === toString.call(r)
-  },
-  has = function(r, t) {
-    if (!isArray(t)) return null != r && Object.prototype.hasOwnProperty.call(r, t);
-    for (var n = t.length, e = 0; e < n; e++) {
-      var o = t[e];
-      if (null == r || !Object.prototype.hasOwnProperty.call(r, o)) return !1;
-      r = r[o]
-    }
-    return !!n
-  },
-  property = function(t) {
-    return function(r) {
-      return null == r ? void 0 : r[t]
-    }
-  },
-  values = function(r) {
-    for (var t = keys(r), n = t.length, e = Array(n), o = 0; o < n; o++) e[o] = r[t[o]];
-    return e
-  },
-  MAX_ARRAY_INDEX = Math.pow(2, 53) - 1,
-  getLength = property("length"),
-  isArrayLike = function(r) {
-    var t = getLength(r);
-    return "number" == typeof t && 0 <= t && t <= MAX_ARRAY_INDEX
-  },
-  optimizeCb = function(o, i, r) {
-    if (void 0 === i) return o;
-    switch (r) {
-      case 1:
-        return function(r) {
-          return o.call(i, r)
-        };
-      case null:
-      case 3:
-        return function(r, t, n) {
-          return o.call(i, r, t, n)
-        };
-      case 4:
-        return function(r, t, n, e) {
-          return o.call(i, r, t, n, e)
-        }
-    }
-    return function() {
-      return o.apply(i, arguments)
-    }
-  },
-  createAssigner = function(c, s) {
-    return function(r) {
-      var t = arguments.length;
-      if (s && (r = Object(r)), t < 2 || null == r) return r;
-      for (var n = 1; n < t; n++)
-        for (var e = arguments[n], o = c(e), i = o.length, u = 0; u < i; u++) {
-          var a = o[u];
-          s && void 0 !== r[a] || (r[a] = e[a])
-        }
-      return r
-    }
-  },
-  extendOwn = createAssigner(keys),
-  isMatch = function(r, t) {
-    var n = keys(t),
-      e = n.length;
-    if (null == r) return !e;
-    for (var o = Object(r), i = 0; i < e; i++) {
-      var u = n[i];
-      if (t[u] !== o[u] || !(u in o)) return !1
-    }
-    return !0
-  },
-  matcher = function(t) {
-    return t = extendOwn({}, t),
-      function(r) {
-        return isMatch(r, t)
-      }
-  },
-  slice = Array.prototype.slice,
-  createIndexFinder = function(i, u, a) {
-    return function(r, t, n) {
-      var e = 0,
-        o = getLength(r);
-      if ("number" == typeof n) 0 < i ? e = 0 <= n ? n : Math.max(n + o, e) : o = 0 <= n ? Math.min(n + 1, o) : n + o + 1;
-      else if (a && n && o) return r[n = a(r, t)] === t ? n : -1;
-      if (t != t) return 0 <= (n = u(slice.call(r, e, o), _isNaN)) ? n + e : -1;
-      for (n = 0 < i ? e : o - 1; 0 <= n && n < o; n += i)
-        if (r[n] === t) return n;
-      return -1
-    }
-  },
-  iteratee = builtinIteratee = function(r, t) {
-    return cb(r, t, 1 / 0)
-  },
-  identity = function(r) {
-    return r
-  },
-  cb = function(r, t, n) {
-    return iteratee !== builtinIteratee ? iteratee(r, t) : null == r ? identity : isFunction(r) ? optimizeCb(r, t, n) : (isObject(r) && !isArray(r) ? matcher : property)(r)
-  },
-  createPredicateIndexFinder = function(i) {
-    return function(r, t, n) {
-      t = cb(t, n);
-      for (var e = getLength(r), o = 0 < i ? 0 : e - 1; 0 <= o && o < e; o += i)
-        if (t(r[o], o, r)) return o;
-      return -1
-    }
-  },
-  findIndex = createPredicateIndexFinder(1),
-  sortedIndex = function(r, t, n, e) {
-    for (var o = (n = cb(n, e, 1))(t), i = 0, u = getLength(r); i < u;) {
-      var a = Math.floor((i + u) / 2);
-      n(r[a]) < o ? i = a + 1 : u = a
+var builtinIteratee, _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault"), _typeof2 = _interopRequireDefault(require("@babel/runtime/helpers/typeof")), ObjProto = Object.prototype, toString = ObjProto.toString, nativeIsArray = Array.isArray, nativeKeys = Object.keys, hasEnumBug = !{
+  toString: null
+}.propertyIsEnumerable("toString"), nonEnumerableProps = [ "valueOf", "isPrototypeOf", "toString", "propertyIsEnumerable", "hasOwnProperty", "toLocaleString" ], isNumber = function(r) {
+  return /^(\-|\+)?([0-9]+(\.[0-9]+)?|Infinity)$/.test(r);
+}, _isNaN = function(r) {
+  return isNumber(r) && isNaN(r);
+}, isFunction = function(r) {
+  return "function" == typeof r || !1;
+}, isObject = function(r) {
+  var e = (0, _typeof2.default)(r);
+  return "function" === e || "object" === e && !!r;
+}, keys = function(r) {
+  if (!isObject(r)) return [];
+  if (nativeKeys) return nativeKeys(r);
+  var e = [];
+  for (var t in r) has(r, t) && e.push(t);
+  return hasEnumBug && collectNonEnumProps(r, e), e;
+}, allKeys = function(r) {
+  if (!isObject(r)) return [];
+  var e = [];
+  for (var t in r) e.push(t);
+  return hasEnumBug && collectNonEnumProps(r, e), e;
+}, isArray = nativeIsArray || function(r) {
+  return "[object Array]" === toString.call(r);
+}, has = function(r, e) {
+  if (!isArray(e)) return null != r && Object.prototype.hasOwnProperty.call(r, e);
+  for (var t = e.length, n = 0; n < t; n++) {
+    var i = e[n];
+    if (null == r || !Object.prototype.hasOwnProperty.call(r, i)) return !1;
+    r = r[i];
+  }
+  return !!t;
+}, property = function(r) {
+  return function(e) {
+    return null == e ? void 0 : e[r];
+  };
+}, values = function(r) {
+  for (var e = keys(r), t = e.length, n = Array(t), i = 0; i < t; i++) n[i] = r[e[i]];
+  return n;
+}, MAX_ARRAY_INDEX = Math.pow(2, 53) - 1, getLength = property("length"), isArrayLike = function(r) {
+  var e = getLength(r);
+  return "number" == typeof e && e >= 0 && e <= MAX_ARRAY_INDEX;
+}, optimizeCb = function(r, e, t) {
+  if (void 0 === e) return r;
+  switch (t) {
+   case 1:
+    return function(t) {
+      return r.call(e, t);
+    };
+
+   case null:
+   case 3:
+    return function(t, n, i) {
+      return r.call(e, t, n, i);
+    };
+
+   case 4:
+    return function(t, n, i, u) {
+      return r.call(e, t, n, i, u);
+    };
+  }
+  return function() {
+    return r.apply(e, arguments);
+  };
+}, createAssigner = function(r, e) {
+  return function(t) {
+    var n = arguments.length;
+    if (e && (t = Object(t)), n < 2 || null == t) return t;
+    for (var i = 1; i < n; i++) for (var u = arguments[i], o = r(u), a = o.length, c = 0; c < a; c++) {
+      var s = o[c];
+      e && void 0 !== t[s] || (t[s] = u[s]);
     }
-    return i
-  },
-  indexOf = createIndexFinder(1, findIndex, sortedIndex),
-  contains = function(r, t, n, e) {
-    return isArrayLike(r) || (r = values(r)), "number" == typeof n && !e || (n = 0), 0 <= indexOf(r, t, n)
-  },
-  collectNonEnumProps = function(r, t) {
-    var n = nonEnumerableProps.length,
-      e = r.constructor,
-      o = isFunction(e) && e.prototype || ObjProto,
-      i = "constructor";
-    for (has(r, i) && !contains(t, i) && t.push(i); n--;)(i = nonEnumerableProps[n]) in r && r[i] !== o[i] && !contains(t, i) && t.push(i)
+    return t;
+  };
+}, extendOwn = createAssigner(keys), isMatch = function(r, e) {
+  var t = keys(e), n = t.length;
+  if (null == r) return !n;
+  for (var i = Object(r), u = 0; u < n; u++) {
+    var o = t[u];
+    if (e[o] !== i[o] || !(o in i)) return !1;
+  }
+  return !0;
+}, matcher = function(r) {
+  return r = extendOwn({}, r), function(e) {
+    return isMatch(e, r);
+  };
+}, slice = Array.prototype.slice, createIndexFinder = function(r, e, t) {
+  return function(n, i, u) {
+    var o = 0, a = getLength(n);
+    if ("number" == typeof u) r > 0 ? o = u >= 0 ? u : Math.max(u + a, o) : a = u >= 0 ? Math.min(u + 1, a) : u + a + 1; else if (t && u && a) return n[u = t(n, i)] === i ? u : -1;
+    if (i != i) return (u = e(slice.call(n, o, a), _isNaN)) >= 0 ? u + o : -1;
+    for (u = r > 0 ? o : a - 1; u >= 0 && u < a; u += r) if (n[u] === i) return u;
+    return -1;
   };
+}, iteratee = builtinIteratee = function(r, e) {
+  return cb(r, e, 1 / 0);
+}, identity = function(r) {
+  return r;
+}, cb = function(r, e, t) {
+  return iteratee !== builtinIteratee ? iteratee(r, e) : null == r ? identity : isFunction(r) ? optimizeCb(r, e, t) : isObject(r) && !isArray(r) ? matcher(r) : property(r);
+}, createPredicateIndexFinder = function(r) {
+  return function(e, t, n) {
+    t = cb(t, n);
+    for (var i = getLength(e), u = r > 0 ? 0 : i - 1; u >= 0 && u < i; u += r) if (t(e[u], u, e)) return u;
+    return -1;
+  };
+}, findIndex = createPredicateIndexFinder(1), sortedIndex = function(r, e, t, n) {
+  for (var i = (t = cb(t, n, 1))(e), u = 0, o = getLength(r); u < o; ) {
+    var a = Math.floor((u + o) / 2);
+    t(r[a]) < i ? u = a + 1 : o = a;
+  }
+  return u;
+}, indexOf = createIndexFinder(1, findIndex, sortedIndex), contains = function(r, e, t, n) {
+  return isArrayLike(r) || (r = values(r)), ("number" != typeof t || n) && (t = 0), 
+  indexOf(r, e, t) >= 0;
+}, collectNonEnumProps = function(r, e) {
+  var t = nonEnumerableProps.length, n = r.constructor, i = isFunction(n) && n.prototype || ObjProto, u = "constructor";
+  for (has(r, u) && !contains(e, u) && e.push(u); t--; ) (u = nonEnumerableProps[t]) in r && r[u] !== i[u] && !contains(e, u) && e.push(u);
+};
+
 module.exports = {
   keys: keys,
   allKeys: allKeys,
@@ -174,4 +127,4 @@ module.exports = {
   isArrayLike: isArrayLike,
   property: property,
   findIndex: findIndex
-};
+};

package/lib/extra/filterNull.js

@@ -1,6 +1,7 @@
 "use strict";
+
 module.exports = function(r) {
   var t = {};
   for (var e in r) 0 !== r[e] && !r[e] || "" === r[e].toString().replace(/(^\s*)|(\s*$)/g, "") || (t[e] = r[e]);
-  return t
-};
+  return t;
+};

package/lib/extra/find.js

@@ -1,12 +1,11 @@
 "use strict";
-var _common = require("./_common"),
-  findKey = function(n, o, i) {
-    o = _common.cb(o, i);
-    for (var r, e = _common.keys(n), m = 0, c = e.length; m < c; m++)
-      if (o(n[r = e[m]], r, n)) return r
-  },
-  find = function(n, o, i) {
-    var r = (_common.isArrayLike(n) ? _common.findIndex : findKey)(n, o, i);
-    if (void 0 !== r && -1 !== r) return n[r]
-  };
-module.exports = find;
+
+var _common = require("./_common"), findKey = function(n, o, i) {
+  o = _common.cb(o, i);
+  for (var r, e = _common.keys(n), m = 0, c = e.length; m < c; m++) if (o(n[r = e[m]], r, n)) return r;
+}, find = function(n, o, i) {
+  var r = (_common.isArrayLike(n) ? _common.findIndex : findKey)(n, o, i);
+  if (void 0 !== r && -1 !== r) return n[r];
+};
+
+module.exports = find;

package/lib/extra/index.js

@@ -1,7 +1,8 @@
 "use strict";
-var find = require("./find"),
-  sortBy = require("./sortBy");
+
+var find = require("./find"), sortBy = require("./sortBy");
+
 module.exports = {
   find: find,
   sortBy: sortBy
-};
+};

package/lib/extra/memo.js

@@ -0,0 +1,18 @@
+"use strict";
+
+function isInputEqual(t, r) {
+  if (t.length !== r.length) return !1;
+  for (var n = 0; n < t.length; n++) if (t[n] !== r[n]) return !1;
+  return !0;
+}
+
+module.exports = function(t, r) {
+  var n;
+  void 0 === r && (r = isInputEqual);
+  var u, e = [], i = !1;
+  return function() {
+    for (var l = [], o = 0; o < arguments.length; o++) l[o] = arguments[o];
+    return i && n === this && r(l, e) || (u = t.apply(this, l), i = !0, n = this, e = l), 
+    u;
+  };
+};

package/lib/extra/pathToTree.js

@@ -1,47 +1,53 @@
 "use strict";
 
-function _defineProperty(e, r, t) {
-  return r in e ? Object.defineProperty(e, r, {
-    value: t,
-    enumerable: !0,
-    configurable: !0,
-    writable: !0
-  }) : e[r] = t, e
-}
-module.exports = function(e, r) {
-  for (var t = 1 < arguments.length && void 0 !== r ? r : {}, n = t.pathKey, o = void 0 === n ? "path" : n, i = t.childrenKey, l = void 0 === i ? "children" : i, d = t.processor, h = [], f = 0; f < e.length; f++)
-    for (var a = e[f].split("/"), c = h, p = 0; p < a.length; p++) {
-      var u = a[p];
-      if ("" !== u) {
-        for (var v, s, g = c, y = 0; y < c.length; y++)
-          if (c[y][o] === u) {
-            c = c[y][l];
-            break
-          } g === c && (_defineProperty(v = {
-          key: p === a.length - 1 ? e[f] : a.slice(0, p + 1).join("/") + "/"
-        }, o, u), _defineProperty(v, l, []), s = v, d && d(s, u), p === a.length - 1 && delete s[l], c.push(s), c = s[l])
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault"), _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty")), memorize = require("./memo");
+
+function pathToTree(e) {
+  for (var r = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, t = r.pathKey, o = void 0 === t ? "path" : t, i = r.childrenKey, n = void 0 === i ? "children" : i, l = r.processor, a = [], u = 0; u < e.length; u++) for (var f = e[u].split("/"), h = a, d = 0; d < f.length; d++) {
+    var p = f[d];
+    if ("" !== p) {
+      for (var s = h, v = 0; v < h.length; v++) if (h[v][o] === p) {
+        h = h[v][n];
+        break;
+      }
+      if (s === h) {
+        var y, c = (y = {
+          key: d === f.length - 1 ? e[u] : f.slice(0, d + 1).join("/") + "/"
+        }, (0, _defineProperty2.default)(y, o, p), (0, _defineProperty2.default)(y, n, []), 
+        y);
+        l && l(c, p), d === f.length - 1 && delete c[n], h.push(c), h = c[n];
       }
     }
-  return h
-}, module.exports.pathToRoutes = function(e, r) {
-  for (var t = 1 < arguments.length && void 0 !== r ? r : {}, n = t.pathKey, o = void 0 === n ? "path" : n, i = t.childrenKey, l = void 0 === i ? "children" : i, d = t.processor, h = [], f = 0; f < e.length; f++)
-    for (var a = e[f].split("/"), c = h, p = 0; p < a.length; p++) {
-      var u = a[p];
-      if ("" === u) break;
-      for (var v, s, g = c, y = void 0, y = 0; y < c.length; y++)
-        if (c[y][o] === u) {
-          c = c[y][l];
-          break
-        } g === c ? (_defineProperty(v = {
-        key: p === a.length - 1 ? e[f] : a.slice(0, p + 1).join("/") + "/"
-      }, o, u), _defineProperty(v, l, []), s = v, d && d(s, u), c[y] = s, c = s[l]) : delete c[l]
+  }
+  return a;
+}
+
+function pathToRoutes(e) {
+  for (var r = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, t = r.pathKey, o = void 0 === t ? "path" : t, i = r.childrenKey, n = void 0 === i ? "children" : i, l = r.processor, a = [], u = 0; u < e.length; u++) for (var f = e[u].split("/"), h = a, d = 0; d < f.length; d++) {
+    var p = f[d];
+    if ("" === p) break;
+    var s = h, v = void 0;
+    for (v = 0; v < h.length; v++) if (h[v][o] === p) {
+      h = h[v][n];
+      break;
     }
-  return h
-}, module.exports.beautifyRoutes = function r(e, t) {
-  var n = 1 < arguments.length && void 0 !== t ? t : {},
-    o = n.childrenKey,
-    i = void 0 === o ? "children" : o;
-  e.forEach(function(e) {
-    i in e && e[i] && (0 < e[i].length ? r(e[i], n) : delete e[i])
-  })
-};
+    if (s === h) {
+      var y, c = (y = {
+        key: d === f.length - 1 ? e[u] : f.slice(0, d + 1).join("/") + "/"
+      }, (0, _defineProperty2.default)(y, o, p), (0, _defineProperty2.default)(y, n, []), 
+      y);
+      l && l(c, p), h[v] = c, h = c[n];
+    } else delete h[n];
+  }
+  return a;
+}
+
+function beautifyRoutes(e) {
+  var r = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, t = r.childrenKey, o = void 0 === t ? "children" : t;
+  e.forEach((function(e) {
+    o in e && e[o] && (e[o].length > 0 ? beautifyRoutes(e[o], r) : delete e[o]);
+  }));
+}
+
+module.exports = pathToTree, module.exports.pathToRoutes = pathToRoutes, module.exports.beautifyRoutes = beautifyRoutes, 
+module.exports.memoPathToTree = memorize(pathToTree);

package/lib/extra/pwdStrength.js

@@ -1,5 +1,7 @@
 "use strict";
+
 module.exports = function(t) {
   var e = 0;
-  return t.length < 6 || (/[0-9]/.test(t) && e++, /[a-z]/.test(t) && e++, /[A-Z]/.test(t) && e++, /[\.|-|_]/.test(t) && e++), e
-};
+  return t.length < 6 || (/[0-9]/.test(t) && e++, /[a-z]/.test(t) && e++, /[A-Z]/.test(t) && e++, 
+  /[\.|-|_]/.test(t) && e++), e;
+};

package/lib/extra/sortBy.js

@@ -1,32 +1,30 @@
 "use strict";
-var _common = require("./_common"),
-  map = function(r, n, o) {
-    n = _common.cb(n, o);
-    for (var e = !_common.isArrayLike(r) && _common.keys(r), i = (e || r).length, t = Array(i), c = 0; c < i; c++) {
-      var u = e ? e[c] : c;
-      t[c] = n(r[u], u, r)
+
+var _common = require("./_common"), map = function(r, n, o) {
+  n = _common.cb(n, o);
+  for (var e = !_common.isArrayLike(r) && _common.keys(r), i = (e || r).length, t = Array(i), c = 0; c < i; c++) {
+    var u = e ? e[c] : c;
+    t[c] = n(r[u], u, r);
+  }
+  return t;
+}, pluck = function(r, n) {
+  return map(r, _common.property(n));
+}, sortBy = function(r, n, o) {
+  var e = 0;
+  return n = _common.cb(n, o), pluck(map(r, (function(r, o, i) {
+    return {
+      value: r,
+      index: e++,
+      criteria: n(r, o, i)
+    };
+  })).sort((function(r, n) {
+    var o = r.criteria, e = n.criteria;
+    if (o !== e) {
+      if (o > e || void 0 === o) return 1;
+      if (o < e || void 0 === e) return -1;
     }
-    return t
-  },
-  pluck = function(r, n) {
-    return map(r, _common.property(n))
-  },
-  sortBy = function(r, e, n) {
-    var i = 0;
-    return e = _common.cb(e, n), pluck(map(r, function(r, n, o) {
-      return {
-        value: r,
-        index: i++,
-        criteria: e(r, n, o)
-      }
-    }).sort(function(r, n) {
-      var o = r.criteria,
-        e = n.criteria;
-      if (o !== e) {
-        if (e < o || void 0 === o) return 1;
-        if (o < e || void 0 === e) return -1
-      }
-      return r.index - n.index
-    }), "value")
-  };
-module.exports = sortBy;
+    return r.index - n.index;
+  })), "value");
+};
+
+module.exports = sortBy;

package/lib/flat.js

@@ -0,0 +1,15 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault"), _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray")), utils = require("./utils");
+
+function getTreeFlatKeys(e) {
+  var r = arguments.length > 1 && void 0 !== arguments[1] ? arguments[1] : {}, t = [], u = r.uniqueKey, l = void 0 === u ? "key" : u, i = r.childrenKey, a = void 0 === i ? "children" : i;
+  return utils.isArray(e) ? e.forEach((function(e) {
+    utils.isOnlyObject(e) && (l in e && t.push(e[l]), e[a] && t.push.apply(t, (0, _toConsumableArray2.default)(getTreeFlatKeys(e[a], r))));
+  })) : utils.isOnlyObject(e) && (l in e && t.push(e[l]), e[a] && t.push.apply(t, (0, 
+  _toConsumableArray2.default)(getTreeFlatKeys(e[a], r)))), t;
+}
+
+module.exports = {
+  getTreeFlatKeys: getTreeFlatKeys
+};