@qy_better_lib/hooks 0.0.15 → 0.1.1

package/lib/packages/hooks/node_modules/graphlib/lib/graph.js

@@ -0,0 +1,210 @@
+import { __require as E } from "./lodash.js";
+var p, m;
+function v() {
+  if (m) return p;
+  m = 1;
+  var i = E();
+  p = n;
+  var y = "\0", a = "\0", _ = "
";
+  function n(e) {
+    this._isDirected = i.has(e, "directed") ? e.directed : !0, this._isMultigraph = i.has(e, "multigraph") ? e.multigraph : !1, this._isCompound = i.has(e, "compound") ? e.compound : !1, this._label = void 0, this._defaultNodeLabelFn = i.constant(void 0), this._defaultEdgeLabelFn = i.constant(void 0), this._nodes = {}, this._isCompound && (this._parent = {}, this._children = {}, this._children[a] = {}), this._in = {}, this._preds = {}, this._out = {}, this._sucs = {}, this._edgeObjs = {}, this._edgeLabels = {};
+  }
+  n.prototype._nodeCount = 0, n.prototype._edgeCount = 0, n.prototype.isDirected = function() {
+    return this._isDirected;
+  }, n.prototype.isMultigraph = function() {
+    return this._isMultigraph;
+  }, n.prototype.isCompound = function() {
+    return this._isCompound;
+  }, n.prototype.setGraph = function(e) {
+    return this._label = e, this;
+  }, n.prototype.graph = function() {
+    return this._label;
+  }, n.prototype.setDefaultNodeLabel = function(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultNodeLabelFn = e, this;
+  }, n.prototype.nodeCount = function() {
+    return this._nodeCount;
+  }, n.prototype.nodes = function() {
+    return i.keys(this._nodes);
+  }, n.prototype.sources = function() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._in[t]);
+    });
+  }, n.prototype.sinks = function() {
+    var e = this;
+    return i.filter(this.nodes(), function(t) {
+      return i.isEmpty(e._out[t]);
+    });
+  }, n.prototype.setNodes = function(e, t) {
+    var s = arguments, r = this;
+    return i.each(e, function(h) {
+      s.length > 1 ? r.setNode(h, t) : r.setNode(h);
+    }), this;
+  }, n.prototype.setNode = function(e, t) {
+    return i.has(this._nodes, e) ? (arguments.length > 1 && (this._nodes[e] = t), this) : (this._nodes[e] = arguments.length > 1 ? t : this._defaultNodeLabelFn(e), this._isCompound && (this._parent[e] = a, this._children[e] = {}, this._children[a][e] = !0), this._in[e] = {}, this._preds[e] = {}, this._out[e] = {}, this._sucs[e] = {}, ++this._nodeCount, this);
+  }, n.prototype.node = function(e) {
+    return this._nodes[e];
+  }, n.prototype.hasNode = function(e) {
+    return i.has(this._nodes, e);
+  }, n.prototype.removeNode = function(e) {
+    var t = this;
+    if (i.has(this._nodes, e)) {
+      var s = function(r) {
+        t.removeEdge(t._edgeObjs[r]);
+      };
+      delete this._nodes[e], this._isCompound && (this._removeFromParentsChildList(e), delete this._parent[e], i.each(this.children(e), function(r) {
+        t.setParent(r);
+      }), delete this._children[e]), i.each(i.keys(this._in[e]), s), delete this._in[e], delete this._preds[e], i.each(i.keys(this._out[e]), s), delete this._out[e], delete this._sucs[e], --this._nodeCount;
+    }
+    return this;
+  }, n.prototype.setParent = function(e, t) {
+    if (!this._isCompound)
+      throw new Error("Cannot set parent in a non-compound graph");
+    if (i.isUndefined(t))
+      t = a;
+    else {
+      t += "";
+      for (var s = t; !i.isUndefined(s); s = this.parent(s))
+        if (s === e)
+          throw new Error("Setting " + t + " as parent of " + e + " would create a cycle");
+      this.setNode(t);
+    }
+    return this.setNode(e), this._removeFromParentsChildList(e), this._parent[e] = t, this._children[t][e] = !0, this;
+  }, n.prototype._removeFromParentsChildList = function(e) {
+    delete this._children[this._parent[e]][e];
+  }, n.prototype.parent = function(e) {
+    if (this._isCompound) {
+      var t = this._parent[e];
+      if (t !== a)
+        return t;
+    }
+  }, n.prototype.children = function(e) {
+    if (i.isUndefined(e) && (e = a), this._isCompound) {
+      var t = this._children[e];
+      if (t)
+        return i.keys(t);
+    } else {
+      if (e === a)
+        return this.nodes();
+      if (this.hasNode(e))
+        return [];
+    }
+  }, n.prototype.predecessors = function(e) {
+    var t = this._preds[e];
+    if (t)
+      return i.keys(t);
+  }, n.prototype.successors = function(e) {
+    var t = this._sucs[e];
+    if (t)
+      return i.keys(t);
+  }, n.prototype.neighbors = function(e) {
+    var t = this.predecessors(e);
+    if (t)
+      return i.union(t, this.successors(e));
+  }, n.prototype.isLeaf = function(e) {
+    var t;
+    return this.isDirected() ? t = this.successors(e) : t = this.neighbors(e), t.length === 0;
+  }, n.prototype.filterNodes = function(e) {
+    var t = new this.constructor({
+      directed: this._isDirected,
+      multigraph: this._isMultigraph,
+      compound: this._isCompound
+    });
+    t.setGraph(this.graph());
+    var s = this;
+    i.each(this._nodes, function(o, u) {
+      e(u) && t.setNode(u, o);
+    }), i.each(this._edgeObjs, function(o) {
+      t.hasNode(o.v) && t.hasNode(o.w) && t.setEdge(o, s.edge(o));
+    });
+    var r = {};
+    function h(o) {
+      var u = s.parent(o);
+      return u === void 0 || t.hasNode(u) ? (r[o] = u, u) : u in r ? r[u] : h(u);
+    }
+    return this._isCompound && i.each(t.nodes(), function(o) {
+      t.setParent(o, h(o));
+    }), t;
+  }, n.prototype.setDefaultEdgeLabel = function(e) {
+    return i.isFunction(e) || (e = i.constant(e)), this._defaultEdgeLabelFn = e, this;
+  }, n.prototype.edgeCount = function() {
+    return this._edgeCount;
+  }, n.prototype.edges = function() {
+    return i.values(this._edgeObjs);
+  }, n.prototype.setPath = function(e, t) {
+    var s = this, r = arguments;
+    return i.reduce(e, function(h, o) {
+      return r.length > 1 ? s.setEdge(h, o, t) : s.setEdge(h, o), o;
+    }), this;
+  }, n.prototype.setEdge = function() {
+    var e, t, s, r, h = !1, o = arguments[0];
+    typeof o == "object" && o !== null && "v" in o ? (e = o.v, t = o.w, s = o.name, arguments.length === 2 && (r = arguments[1], h = !0)) : (e = o, t = arguments[1], s = arguments[3], arguments.length > 2 && (r = arguments[2], h = !0)), e = "" + e, t = "" + t, i.isUndefined(s) || (s = "" + s);
+    var u = f(this._isDirected, e, t, s);
+    if (i.has(this._edgeLabels, u))
+      return h && (this._edgeLabels[u] = r), this;
+    if (!i.isUndefined(s) && !this._isMultigraph)
+      throw new Error("Cannot set a named edge when isMultigraph = false");
+    this.setNode(e), this.setNode(t), this._edgeLabels[u] = h ? r : this._defaultEdgeLabelFn(e, t, s);
+    var d = b(this._isDirected, e, t, s);
+    return e = d.v, t = d.w, Object.freeze(d), this._edgeObjs[u] = d, l(this._preds[t], e), l(this._sucs[e], t), this._in[t][u] = d, this._out[e][u] = d, this._edgeCount++, this;
+  }, n.prototype.edge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return this._edgeLabels[r];
+  }, n.prototype.hasEdge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s);
+    return i.has(this._edgeLabels, r);
+  }, n.prototype.removeEdge = function(e, t, s) {
+    var r = arguments.length === 1 ? c(this._isDirected, arguments[0]) : f(this._isDirected, e, t, s), h = this._edgeObjs[r];
+    return h && (e = h.v, t = h.w, delete this._edgeLabels[r], delete this._edgeObjs[r], g(this._preds[t], e), g(this._sucs[e], t), delete this._in[t][r], delete this._out[e][r], this._edgeCount--), this;
+  }, n.prototype.inEdges = function(e, t) {
+    var s = this._in[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(h) {
+        return h.v === t;
+      }) : r;
+    }
+  }, n.prototype.outEdges = function(e, t) {
+    var s = this._out[e];
+    if (s) {
+      var r = i.values(s);
+      return t ? i.filter(r, function(h) {
+        return h.w === t;
+      }) : r;
+    }
+  }, n.prototype.nodeEdges = function(e, t) {
+    var s = this.inEdges(e, t);
+    if (s)
+      return s.concat(this.outEdges(e, t));
+  };
+  function l(e, t) {
+    e[t] ? e[t]++ : e[t] = 1;
+  }
+  function g(e, t) {
+    --e[t] || delete e[t];
+  }
+  function f(e, t, s, r) {
+    var h = "" + t, o = "" + s;
+    if (!e && h > o) {
+      var u = h;
+      h = o, o = u;
+    }
+    return h + _ + o + _ + (i.isUndefined(r) ? y : r);
+  }
+  function b(e, t, s, r) {
+    var h = "" + t, o = "" + s;
+    if (!e && h > o) {
+      var u = h;
+      h = o, o = u;
+    }
+    var d = { v: h, w: o };
+    return r && (d.name = r), d;
+  }
+  function c(e, t) {
+    return f(e, t.v, t.w, t.name);
+  }
+  return p;
+}
+export {
+  v as __require
+};

package/lib/packages/hooks/node_modules/graphlib/lib/index.js

@@ -0,0 +1,12 @@
+import { __require as i } from "./graph.js";
+import { __require as u } from "./version.js";
+var r, e;
+function q() {
+  return e || (e = 1, r = {
+    Graph: i(),
+    version: u()
+  }), r;
+}
+export {
+  q as __require
+};

package/lib/packages/hooks/node_modules/graphlib/lib/json.js

@@ -0,0 +1,48 @@
+import { __require as c } from "./lodash.js";
+import { __require as m } from "./graph.js";
+var d, o;
+function w() {
+  if (o) return d;
+  o = 1;
+  var a = c(), t = m();
+  d = {
+    write: s,
+    read: p
+  };
+  function s(e) {
+    var r = {
+      options: {
+        directed: e.isDirected(),
+        multigraph: e.isMultigraph(),
+        compound: e.isCompound()
+      },
+      nodes: f(e),
+      edges: v(e)
+    };
+    return a.isUndefined(e.graph()) || (r.value = a.clone(e.graph())), r;
+  }
+  function f(e) {
+    return a.map(e.nodes(), function(r) {
+      var n = e.node(r), i = e.parent(r), u = { v: r };
+      return a.isUndefined(n) || (u.value = n), a.isUndefined(i) || (u.parent = i), u;
+    });
+  }
+  function v(e) {
+    return a.map(e.edges(), function(r) {
+      var n = e.edge(r), i = { v: r.v, w: r.w };
+      return a.isUndefined(r.name) || (i.name = r.name), a.isUndefined(n) || (i.value = n), i;
+    });
+  }
+  function p(e) {
+    var r = new t(e.options).setGraph(e.value);
+    return a.each(e.nodes, function(n) {
+      r.setNode(n.v, n.value), n.parent && r.setParent(n.v, n.parent);
+    }), a.each(e.edges, function(n) {
+      r.setEdge({ v: n.v, w: n.w, name: n.name }, n.value);
+    }), r;
+  }
+  return d;
+}
+export {
+  w as __require
+};

package/lib/packages/hooks/node_modules/graphlib/lib/lodash.js

@@ -0,0 +1,49 @@
+import { commonjsRequire as o } from "../../../../../_virtual/_commonjs-dynamic-modules.js";
+import { __require as u } from "../../lodash/clone.js";
+import { __require as s } from "../../lodash/constant.js";
+import { __require as m } from "../../lodash/each.js";
+import { __require as a } from "../../lodash/filter.js";
+import { __require as q } from "../../lodash/has.js";
+import { __require as t } from "../../lodash/isArray.js";
+import { __require as _ } from "../../lodash/isEmpty.js";
+import { __require as f } from "../../lodash/isFunction.js";
+import { __require as n } from "../../lodash/isUndefined.js";
+import { __require as p } from "../../lodash/keys.js";
+import { __require as c } from "../../lodash/map.js";
+import { __require as d } from "../../lodash/reduce.js";
+import { __require as h } from "../../lodash/size.js";
+import { __require as l } from "../../lodash/transform.js";
+import { __require as y } from "../../lodash/union.js";
+import { __require as v } from "../../lodash/values.js";
+var e, i;
+function V() {
+  if (i) return e;
+  i = 1;
+  var r;
+  if (typeof o == "function")
+    try {
+      r = {
+        clone: u(),
+        constant: s(),
+        each: m(),
+        filter: a(),
+        has: q(),
+        isArray: t(),
+        isEmpty: _(),
+        isFunction: f(),
+        isUndefined: n(),
+        keys: p(),
+        map: c(),
+        reduce: d(),
+        size: h(),
+        transform: l(),
+        union: y(),
+        values: v()
+      };
+    } catch {
+    }
+  return r || (r = window._), e = r, e;
+}
+export {
+  V as __require
+};

package/lib/packages/hooks/node_modules/graphlib/lib/version.js

@@ -0,0 +1,7 @@
+var r, e;
+function i() {
+  return e || (e = 1, r = "2.1.8"), r;
+}
+export {
+  i as __require
+};

package/lib/packages/hooks/node_modules/lodash/_DataView.js

@@ -0,0 +1,12 @@
+import { __require as _ } from "./_getNative.js";
+import { __require as o } from "./_root.js";
+var r, e;
+function v() {
+  if (e) return r;
+  e = 1;
+  var a = _(), i = o(), t = a(i, "DataView");
+  return r = t, r;
+}
+export {
+  v as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Hash.js

@@ -0,0 +1,22 @@
+import { __require as l } from "./_hashClear.js";
+import { __require as m } from "./_hashDelete.js";
+import { __require as f } from "./_hashGet.js";
+import { __require as n } from "./_hashHas.js";
+import { __require as H } from "./_hashSet.js";
+var a, s;
+function x() {
+  if (s) return a;
+  s = 1;
+  var i = l(), o = m(), _ = f(), u = n(), p = H();
+  function e(r) {
+    var h = -1, q = r == null ? 0 : r.length;
+    for (this.clear(); ++h < q; ) {
+      var t = r[h];
+      this.set(t[0], t[1]);
+    }
+  }
+  return e.prototype.clear = i, e.prototype.delete = o, e.prototype.get = _, e.prototype.has = u, e.prototype.set = p, a = e, a;
+}
+export {
+  x as __require
+};

package/lib/packages/hooks/node_modules/lodash/_ListCache.js

@@ -0,0 +1,22 @@
+import { __require as p } from "./_listCacheClear.js";
+import { __require as C } from "./_listCacheDelete.js";
+import { __require as q } from "./_listCacheGet.js";
+import { __require as m } from "./_listCacheHas.js";
+import { __require as f } from "./_listCacheSet.js";
+var t, s;
+function g() {
+  if (s) return t;
+  s = 1;
+  var o = p(), l = C(), h = q(), _ = m(), c = f();
+  function e(r) {
+    var i = -1, u = r == null ? 0 : r.length;
+    for (this.clear(); ++i < u; ) {
+      var a = r[i];
+      this.set(a[0], a[1]);
+    }
+  }
+  return e.prototype.clear = o, e.prototype.delete = l, e.prototype.get = h, e.prototype.has = _, e.prototype.set = c, t = e, t;
+}
+export {
+  g as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Map.js

@@ -0,0 +1,12 @@
+import { __require as _ } from "./_getNative.js";
+import { __require as o } from "./_root.js";
+var r, e;
+function q() {
+  if (e) return r;
+  e = 1;
+  var a = _(), i = o(), t = a(i, "Map");
+  return r = t, r;
+}
+export {
+  q as __require
+};

package/lib/packages/hooks/node_modules/lodash/_MapCache.js

@@ -0,0 +1,22 @@
+import { __require as C } from "./_mapCacheClear.js";
+import { __require as q } from "./_mapCacheDelete.js";
+import { __require as l } from "./_mapCacheGet.js";
+import { __require as s } from "./_mapCacheHas.js";
+import { __require as f } from "./_mapCacheSet.js";
+var a, i;
+function g() {
+  if (i) return a;
+  i = 1;
+  var o = C(), h = q(), m = l(), _ = s(), c = f();
+  function e(r) {
+    var t = -1, u = r == null ? 0 : r.length;
+    for (this.clear(); ++t < u; ) {
+      var p = r[t];
+      this.set(p[0], p[1]);
+    }
+  }
+  return e.prototype.clear = o, e.prototype.delete = h, e.prototype.get = m, e.prototype.has = _, e.prototype.set = c, a = e, a;
+}
+export {
+  g as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Promise.js

@@ -0,0 +1,12 @@
+import { __require as _ } from "./_getNative.js";
+import { __require as a } from "./_root.js";
+var r, e;
+function s() {
+  if (e) return r;
+  e = 1;
+  var i = _(), o = a(), t = i(o, "Promise");
+  return r = t, r;
+}
+export {
+  s as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Set.js

@@ -0,0 +1,12 @@
+import { __require as a } from "./_getNative.js";
+import { __require as o } from "./_root.js";
+var r, e;
+function v() {
+  if (e) return r;
+  e = 1;
+  var t = a(), i = o(), _ = t(i, "Set");
+  return r = _, r;
+}
+export {
+  v as __require
+};

package/lib/packages/hooks/node_modules/lodash/_SetCache.js

@@ -0,0 +1,18 @@
+import { __require as s } from "./_MapCache.js";
+import { __require as u } from "./_setCacheAdd.js";
+import { __require as c } from "./_setCacheHas.js";
+var t, i;
+function q() {
+  if (i) return t;
+  i = 1;
+  var h = s(), _ = u(), o = c();
+  function e(r) {
+    var a = -1, p = r == null ? 0 : r.length;
+    for (this.__data__ = new h(); ++a < p; )
+      this.add(r[a]);
+  }
+  return e.prototype.add = e.prototype.push = _, e.prototype.has = o, t = e, t;
+}
+export {
+  q as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Stack.js

@@ -0,0 +1,20 @@
+import { __require as q } from "./_ListCache.js";
+import { __require as k } from "./_stackClear.js";
+import { __require as m } from "./_stackDelete.js";
+import { __require as f } from "./_stackGet.js";
+import { __require as n } from "./_stackHas.js";
+import { __require as h } from "./_stackSet.js";
+var r, t;
+function z() {
+  if (t) return r;
+  t = 1;
+  var a = q(), i = k(), s = m(), _ = f(), o = n(), c = h();
+  function e(u) {
+    var p = this.__data__ = new a(u);
+    this.size = p.size;
+  }
+  return e.prototype.clear = i, e.prototype.delete = s, e.prototype.get = _, e.prototype.has = o, e.prototype.set = c, r = e, r;
+}
+export {
+  z as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Symbol.js

@@ -0,0 +1,11 @@
+import { __require as u } from "./_root.js";
+var r, e;
+function a() {
+  if (e) return r;
+  e = 1;
+  var o = u(), i = o.Symbol;
+  return r = i, r;
+}
+export {
+  a as __require
+};

package/lib/packages/hooks/node_modules/lodash/_Uint8Array.js

@@ -0,0 +1,11 @@
+import { __require as t } from "./_root.js";
+var r, e;
+function o() {
+  if (e) return r;
+  e = 1;
+  var i = t(), a = i.Uint8Array;
+  return r = a, r;
+}
+export {
+  o as __require
+};

package/lib/packages/hooks/node_modules/lodash/_WeakMap.js

@@ -0,0 +1,12 @@
+import { __require as _ } from "./_getNative.js";
+import { __require as o } from "./_root.js";
+var r, e;
+function q() {
+  if (e) return r;
+  e = 1;
+  var a = _(), i = o(), t = a(i, "WeakMap");
+  return r = t, r;
+}
+export {
+  q as __require
+};

package/lib/packages/hooks/node_modules/lodash/_apply.js

@@ -0,0 +1,22 @@
+var r, a;
+function t() {
+  if (a) return r;
+  a = 1;
+  function n(l, p, e) {
+    switch (e.length) {
+      case 0:
+        return l.call(p);
+      case 1:
+        return l.call(p, e[0]);
+      case 2:
+        return l.call(p, e[0], e[1]);
+      case 3:
+        return l.call(p, e[0], e[1], e[2]);
+    }
+    return l.apply(p, e);
+  }
+  return r = n, r;
+}
+export {
+  t as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayEach.js

@@ -0,0 +1,14 @@
+var a, n;
+function t() {
+  if (n) return a;
+  n = 1;
+  function i(e, u) {
+    for (var r = -1, h = e == null ? 0 : e.length; ++r < h && u(e[r], r, e) !== !1; )
+      ;
+    return e;
+  }
+  return a = i, a;
+}
+export {
+  t as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayFilter.js

@@ -0,0 +1,16 @@
+var i, l;
+function h() {
+  if (l) return i;
+  l = 1;
+  function u(r, a) {
+    for (var e = -1, _ = r == null ? 0 : r.length, f = 0, t = []; ++e < _; ) {
+      var n = r[e];
+      a(n, e, r) && (t[f++] = n);
+    }
+    return t;
+  }
+  return i = u, i;
+}
+export {
+  h as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayIncludes.js

@@ -0,0 +1,15 @@
+import { __require as t } from "./_baseIndexOf.js";
+var e, n;
+function _() {
+  if (n) return e;
+  n = 1;
+  var u = t();
+  function a(r, i) {
+    var s = r == null ? 0 : r.length;
+    return !!s && u(r, i, 0) > -1;
+  }
+  return e = a, e;
+}
+export {
+  _ as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayIncludesWith.js

@@ -0,0 +1,15 @@
+var e, u;
+function h() {
+  if (u) return e;
+  u = 1;
+  function t(r, i, a) {
+    for (var n = -1, l = r == null ? 0 : r.length; ++n < l; )
+      if (a(i, r[n]))
+        return !0;
+    return !1;
+  }
+  return e = t, e;
+}
+export {
+  h as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayLikeKeys.js

@@ -0,0 +1,26 @@
+import { __require as c } from "./_baseTimes.js";
+import { __require as L } from "./isArguments.js";
+import { __require as T } from "./isArray.js";
+import { __require as x } from "./isBuffer.js";
+import { __require as K } from "./_isIndex.js";
+import { __require as O } from "./isTypedArray.js";
+var o, u;
+function R() {
+  if (u) return o;
+  u = 1;
+  var _ = c(), p = L(), m = T(), q = x(), y = K(), g = O(), h = Object.prototype, A = h.hasOwnProperty;
+  function b(e, I) {
+    var i = m(e), s = !i && p(e), t = !i && !s && q(e), f = !i && !s && !t && g(e), n = i || s || t || f, a = n ? _(e.length, String) : [], d = a.length;
+    for (var r in e)
+      (I || A.call(e, r)) && !(n && // Safari 9 has enumerable `arguments.length` in strict mode.
+      (r == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
+      t && (r == "offset" || r == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
+      f && (r == "buffer" || r == "byteLength" || r == "byteOffset") || // Skip index properties.
+      y(r, d))) && a.push(r);
+    return a;
+  }
+  return o = b, o;
+}
+export {
+  R as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayMap.js

@@ -0,0 +1,14 @@
+var a, t;
+function p() {
+  if (t) return a;
+  t = 1;
+  function i(r, l) {
+    for (var e = -1, n = r == null ? 0 : r.length, u = Array(n); ++e < n; )
+      u[e] = l(r[e], e, r);
+    return u;
+  }
+  return a = i, a;
+}
+export {
+  p as __require
+};

package/lib/packages/hooks/node_modules/lodash/_arrayPush.js

@@ -0,0 +1,14 @@
+var n, t;
+function s() {
+  if (t) return n;
+  t = 1;
+  function h(r, u) {
+    for (var e = -1, a = u.length, i = r.length; ++e < a; )
+      r[i + e] = u[e];
+    return r;
+  }
+  return n = h, n;
+}
+export {
+  s as __require
+};