@xiping/react-components 1.0.18 → 1.0.20

package/dist/es/node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timer.js

@@ -0,0 +1,62 @@
+var r = 0, a = 0, l = 0, p = 1e3, s, f, u = 0, i = 0, w = 0, c = typeof performance == "object" && performance.now ? performance : Date, y = typeof window == "object" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(t) {
+  setTimeout(t, 17);
+};
+function k() {
+  return i || (y(d), i = c.now() + w);
+}
+function d() {
+  i = 0;
+}
+function _() {
+  this._call = this._time = this._next = null;
+}
+_.prototype = v.prototype = {
+  constructor: _,
+  restart: function(t, n, e) {
+    if (typeof t != "function") throw new TypeError("callback is not a function");
+    e = (e == null ? k() : +e) + (n == null ? 0 : +n), !this._next && f !== this && (f ? f._next = this : s = this, f = this), this._call = t, this._time = e, m();
+  },
+  stop: function() {
+    this._call && (this._call = null, this._time = 1 / 0, m());
+  }
+};
+function v(t, n, e) {
+  var o = new _();
+  return o.restart(t, n, e), o;
+}
+function x() {
+  k(), ++r;
+  for (var t = s, n; t; )
+    (n = i - t._time) >= 0 && t._call.call(void 0, n), t = t._next;
+  --r;
+}
+function h() {
+  i = (u = c.now()) + w, r = a = 0;
+  try {
+    x();
+  } finally {
+    r = 0, I(), i = 0;
+  }
+}
+function T() {
+  var t = c.now(), n = t - u;
+  n > p && (w -= n, u = t);
+}
+function I() {
+  for (var t, n = s, e, o = 1 / 0; n; )
+    n._call ? (o > n._time && (o = n._time), t = n, n = n._next) : (e = n._next, n._next = null, n = t ? t._next = e : s = e);
+  f = t, m(o);
+}
+function m(t) {
+  if (!r) {
+    a && (a = clearTimeout(a));
+    var n = t - i;
+    n > 24 ? (t < 1 / 0 && (a = setTimeout(h, t - c.now() - w)), l && (l = clearInterval(l))) : (l || (u = c.now(), l = setInterval(T, p)), r = 1, y(h));
+  }
+}
+export {
+  _ as Timer,
+  k as now,
+  v as timer,
+  x as timerFlush
+};

package/dist/es/node_modules/.pnpm/data-bind-mapper@1.0.3/node_modules/data-bind-mapper/dist/data-bind-mapper.js

@@ -0,0 +1,173 @@
+import k from "../../../../accessor-fn@1.5.3/node_modules/accessor-fn/dist/accessor-fn.js";
+function d(e, t) {
+  (t == null || t > e.length) && (t = e.length);
+  for (var r = 0, n = Array(t); r < t; r++) n[r] = e[r];
+  return n;
+}
+function A(e) {
+  if (Array.isArray(e)) return e;
+}
+function M(e) {
+  if (Array.isArray(e)) return d(e);
+}
+function w(e, t, r) {
+  if (typeof e == "function" ? e === t : e.has(t)) return arguments.length < 3 ? t : r;
+  throw new TypeError("Private element is not present on this object");
+}
+function O(e, t) {
+  if (t.has(e)) throw new TypeError("Cannot initialize the same private elements twice on an object");
+}
+function S(e, t) {
+  if (!(e instanceof t)) throw new TypeError("Cannot call a class as a function");
+}
+function i(e, t) {
+  return e.get(w(e, t));
+}
+function l(e, t, r) {
+  O(e, t), t.set(e, r);
+}
+function y(e, t, r) {
+  return e.set(w(e, t), r), r;
+}
+function P(e, t) {
+  for (var r = 0; r < t.length; r++) {
+    var n = t[r];
+    n.enumerable = n.enumerable || !1, n.configurable = !0, "value" in n && (n.writable = !0), Object.defineProperty(e, B(n.key), n);
+  }
+}
+function T(e, t, r) {
+  return t && P(e.prototype, t), Object.defineProperty(e, "prototype", {
+    writable: !1
+  }), e;
+}
+function C(e) {
+  if (typeof Symbol < "u" && e[Symbol.iterator] != null || e["@@iterator"] != null) return Array.from(e);
+}
+function E(e, t) {
+  var r = e == null ? null : typeof Symbol < "u" && e[Symbol.iterator] || e["@@iterator"];
+  if (r != null) {
+    var n, u, a, o, p = [], h = !0, _ = !1;
+    try {
+      if (a = (r = r.call(e)).next, t !== 0) for (; !(h = (n = a.call(r)).done) && (p.push(n.value), p.length !== t); h = !0) ;
+    } catch (j) {
+      _ = !0, u = j;
+    } finally {
+      try {
+        if (!h && r.return != null && (o = r.return(), Object(o) !== o)) return;
+      } finally {
+        if (_) throw u;
+      }
+    }
+    return p;
+  }
+}
+function W() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function I() {
+  throw new TypeError(`Invalid attempt to spread non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function D(e, t) {
+  return A(e) || E(e, t) || g(e, t) || W();
+}
+function R(e) {
+  return M(e) || C(e) || g(e) || I();
+}
+function x(e, t) {
+  if (typeof e != "object" || !e) return e;
+  var r = e[Symbol.toPrimitive];
+  if (r !== void 0) {
+    var n = r.call(e, t);
+    if (typeof n != "object") return n;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return String(e);
+}
+function B(e) {
+  var t = x(e, "string");
+  return typeof t == "symbol" ? t : t + "";
+}
+function g(e, t) {
+  if (e) {
+    if (typeof e == "string") return d(e, t);
+    var r = {}.toString.call(e).slice(8, -1);
+    return r === "Object" && e.constructor && (r = e.constructor.name), r === "Map" || r === "Set" ? Array.from(e) : r === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r) ? d(e, t) : void 0;
+  }
+}
+var s = /* @__PURE__ */ new WeakMap(), f = /* @__PURE__ */ new WeakMap(), c = /* @__PURE__ */ new WeakMap(), v = /* @__PURE__ */ new WeakMap(), b = /* @__PURE__ */ new WeakMap(), m = /* @__PURE__ */ new WeakMap(), U = /* @__PURE__ */ function() {
+  function e() {
+    S(this, e), l(this, s, /* @__PURE__ */ new Map()), l(this, f, /* @__PURE__ */ new Map()), l(this, c, function(t) {
+      return t;
+    }), l(this, v, function() {
+      return {};
+    }), l(this, b, function() {
+    }), l(this, m, function() {
+    });
+  }
+  return T(e, [{
+    key: "getObj",
+    value: function(r) {
+      return i(s, this).get(i(c, this).call(this, r));
+    }
+  }, {
+    key: "getData",
+    value: function(r) {
+      return i(f, this).get(r);
+    }
+  }, {
+    key: "entries",
+    value: function() {
+      return R(i(f, this).entries()).map(function(r) {
+        var n = D(r, 2), u = n[0], a = n[1];
+        return [a, u];
+      });
+    }
+  }, {
+    key: "id",
+    value: function(r) {
+      return y(c, this, k(r)), this;
+    }
+  }, {
+    key: "onCreateObj",
+    value: function(r) {
+      return y(v, this, r), this;
+    }
+  }, {
+    key: "onUpdateObj",
+    value: function(r) {
+      return y(b, this, r), this;
+    }
+  }, {
+    key: "onRemoveObj",
+    value: function(r) {
+      return y(m, this, r), this;
+    }
+  }, {
+    key: "digest",
+    value: function(r) {
+      var n = this;
+      r.filter(function(a) {
+        return !i(s, n).has(i(c, n).call(n, a));
+      }).forEach(function(a) {
+        var o = i(v, n).call(n, a);
+        i(s, n).set(i(c, n).call(n, a), o), i(f, n).set(o, a);
+      });
+      var u = new Map(r.map(function(a) {
+        return [i(c, n).call(n, a), a];
+      }));
+      return i(s, this).forEach(function(a, o) {
+        u.has(o) ? i(b, n).call(n, a, u.get(o)) : (i(m, n).call(n, a, o), i(s, n).delete(o), i(f, n).delete(a));
+      }), this;
+    }
+  }, {
+    key: "clear",
+    value: function() {
+      return this.digest([]), this;
+    }
+  }]);
+}();
+export {
+  U as default
+};

package/dist/es/node_modules/.pnpm/dijkstrajs@1.0.3/node_modules/dijkstrajs/dijkstra.js

@@ -0,0 +1,72 @@
+import { __module as c } from "../../../../../_virtual/dijkstra.js";
+var m;
+function j() {
+  return m ? c.exports : (m = 1, function(y) {
+    var u = {
+      single_source_shortest_paths: function(o, t, e) {
+        var r = {}, i = {};
+        i[t] = 0;
+        var n = u.PriorityQueue.make();
+        n.push(t, 0);
+        for (var f, p, s, h, _, d, a, v, l; !n.empty(); ) {
+          f = n.pop(), p = f.value, h = f.cost, _ = o[p] || {};
+          for (s in _)
+            _.hasOwnProperty(s) && (d = _[s], a = h + d, v = i[s], l = typeof i[s] > "u", (l || v > a) && (i[s] = a, n.push(s, a), r[s] = p));
+        }
+        if (typeof e < "u" && typeof i[e] > "u") {
+          var q = ["Could not find a path from ", t, " to ", e, "."].join("");
+          throw new Error(q);
+        }
+        return r;
+      },
+      extract_shortest_path_from_predecessor_list: function(o, t) {
+        for (var e = [], r = t; r; )
+          e.push(r), o[r], r = o[r];
+        return e.reverse(), e;
+      },
+      find_path: function(o, t, e) {
+        var r = u.single_source_shortest_paths(o, t, e);
+        return u.extract_shortest_path_from_predecessor_list(
+          r,
+          e
+        );
+      },
+      /**
+       * A very naive priority queue implementation.
+       */
+      PriorityQueue: {
+        make: function(o) {
+          var t = u.PriorityQueue, e = {}, r;
+          o = o || {};
+          for (r in t)
+            t.hasOwnProperty(r) && (e[r] = t[r]);
+          return e.queue = [], e.sorter = o.sorter || t.default_sorter, e;
+        },
+        default_sorter: function(o, t) {
+          return o.cost - t.cost;
+        },
+        /**
+         * Add a new item to the queue and ensure the highest priority element
+         * is at the front of the queue.
+         */
+        push: function(o, t) {
+          var e = { value: o, cost: t };
+          this.queue.push(e), this.queue.sort(this.sorter);
+        },
+        /**
+         * Return the highest priority element in the queue.
+         */
+        pop: function() {
+          return this.queue.shift();
+        },
+        empty: function() {
+          return this.queue.length === 0;
+        }
+      }
+    };
+    y.exports = u;
+  }(c), c.exports);
+}
+export {
+  j as __require
+};

package/dist/es/node_modules/.pnpm/float-tooltip@1.7.5/node_modules/float-tooltip/dist/float-tooltip.js

@@ -0,0 +1,169 @@
+import x from "../../../../kapsule@1.16.3/node_modules/kapsule/dist/kapsule.js";
+import { isValidElement as E, cloneElement as h, render as j } from "../../../../preact@10.26.9/node_modules/preact/dist/preact.module.js";
+import O from "../../../../d3-selection@3.0.0/node_modules/d3-selection/src/select.js";
+import S from "../../../../d3-selection@3.0.0/node_modules/d3-selection/src/pointer.js";
+function b(n, e) {
+  (e == null || e > n.length) && (e = n.length);
+  for (var t = 0, o = Array(e); t < e; t++) o[t] = n[t];
+  return o;
+}
+function w(n) {
+  if (Array.isArray(n)) return n;
+}
+function _(n, e, t) {
+  return (e = Y(e)) in n ? Object.defineProperty(n, e, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : n[e] = t, n;
+}
+function P(n, e) {
+  var t = n == null ? null : typeof Symbol < "u" && n[Symbol.iterator] || n["@@iterator"];
+  if (t != null) {
+    var o, r, a, p, i = [], f = !0, c = !1;
+    try {
+      if (a = (t = t.call(n)).next, e !== 0) for (; !(f = (o = a.call(t)).done) && (i.push(o.value), i.length !== e); f = !0) ;
+    } catch (l) {
+      c = !0, r = l;
+    } finally {
+      try {
+        if (!f && t.return != null && (p = t.return(), Object(p) !== p)) return;
+      } finally {
+        if (c) throw r;
+      }
+    }
+    return i;
+  }
+}
+function A() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function v(n, e) {
+  var t = Object.keys(n);
+  if (Object.getOwnPropertySymbols) {
+    var o = Object.getOwnPropertySymbols(n);
+    e && (o = o.filter(function(r) {
+      return Object.getOwnPropertyDescriptor(n, r).enumerable;
+    })), t.push.apply(t, o);
+  }
+  return t;
+}
+function I(n) {
+  for (var e = 1; e < arguments.length; e++) {
+    var t = arguments[e] != null ? arguments[e] : {};
+    e % 2 ? v(Object(t), !0).forEach(function(o) {
+      _(n, o, t[o]);
+    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(n, Object.getOwnPropertyDescriptors(t)) : v(Object(t)).forEach(function(o) {
+      Object.defineProperty(n, o, Object.getOwnPropertyDescriptor(t, o));
+    });
+  }
+  return n;
+}
+function T(n, e) {
+  return w(n) || P(n, e) || C(n, e) || A();
+}
+function k(n, e) {
+  if (typeof n != "object" || !n) return n;
+  var t = n[Symbol.toPrimitive];
+  if (t !== void 0) {
+    var o = t.call(n, e);
+    if (typeof o != "object") return o;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return (e === "string" ? String : Number)(n);
+}
+function Y(n) {
+  var e = k(n, "string");
+  return typeof e == "symbol" ? e : e + "";
+}
+function s(n) {
+  "@babel/helpers - typeof";
+  return s = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? function(e) {
+    return typeof e;
+  } : function(e) {
+    return e && typeof Symbol == "function" && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
+  }, s(n);
+}
+function C(n, e) {
+  if (n) {
+    if (typeof n == "string") return b(n, e);
+    var t = {}.toString.call(n).slice(8, -1);
+    return t === "Object" && n.constructor && (t = n.constructor.name), t === "Map" || t === "Set" ? Array.from(n) : t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? b(n, e) : void 0;
+  }
+}
+var d = function(e) {
+  if (s(e) !== "object") return e;
+  var t = h(e);
+  if (t.props) {
+    var o;
+    t.props = I({}, t.props), t != null && (o = t.props) !== null && o !== void 0 && o.children && (t.props.children = Array.isArray(t.props.children) ? t.props.children.map(d) : d(t.props.children));
+  }
+  return t;
+}, X = function(e) {
+  return E(h(e));
+}, D = function(e, t) {
+  delete t.__k, j(d(e), t);
+};
+function M(n, e) {
+  e === void 0 && (e = {});
+  var t = e.insertAt;
+  if (!(typeof document > "u")) {
+    var o = document.head || document.getElementsByTagName("head")[0], r = document.createElement("style");
+    r.type = "text/css", t === "top" && o.firstChild ? o.insertBefore(r, o.firstChild) : o.appendChild(r), r.styleSheet ? r.styleSheet.cssText = n : r.appendChild(document.createTextNode(n));
+  }
+}
+var R = `.float-tooltip-kap {
+  position: absolute;
+  width: max-content; /* prevent shrinking near right edge */
+  max-width: max(50%, 150px);
+  padding: 3px 5px;
+  border-radius: 3px;
+  font: 12px sans-serif;
+  color: #eee;
+  background: rgba(0,0,0,0.6);
+  pointer-events: none;
+}
+`;
+M(R);
+var W = x({
+  props: {
+    content: {
+      default: !1
+    },
+    offsetX: {
+      triggerUpdate: !1
+    },
+    // null or number
+    offsetY: {
+      triggerUpdate: !1
+    }
+    // null or number
+  },
+  init: function(e, t) {
+    var o = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, r = o.style, a = r === void 0 ? {} : r, p = !!e && s(e) === "object" && !!e.node && typeof e.node == "function", i = O(p ? e.node() : e);
+    i.style("position") === "static" && i.style("position", "relative"), t.tooltipEl = i.append("div").attr("class", "float-tooltip-kap"), Object.entries(a).forEach(function(c) {
+      var l = T(c, 2), u = l[0], y = l[1];
+      return t.tooltipEl.style(u, y);
+    }), t.tooltipEl.style("left", "-10000px").style("display", "none");
+    var f = "tooltip-".concat(Math.round(Math.random() * 1e12));
+    t.mouseInside = !1, i.on("mousemove.".concat(f), function(c) {
+      t.mouseInside = !0;
+      var l = S(c), u = i.node(), y = u.offsetWidth, m = u.offsetHeight, g = [t.offsetX === null || t.offsetX === void 0 ? "-".concat(l[0] / y * 100, "%") : typeof t.offsetX == "number" ? "calc(-50% + ".concat(t.offsetX, "px)") : t.offsetX, t.offsetY === null || t.offsetY === void 0 ? m > 130 && m - l[1] < 100 ? "calc(-100% - 6px)" : "21px" : typeof t.offsetY == "number" ? t.offsetY < 0 ? "calc(-100% - ".concat(Math.abs(t.offsetY), "px)") : "".concat(t.offsetY, "px") : t.offsetY];
+      t.tooltipEl.style("left", l[0] + "px").style("top", l[1] + "px").style("transform", "translate(".concat(g.join(","), ")")), t.content && t.tooltipEl.style("display", "inline");
+    }), i.on("mouseover.".concat(f), function() {
+      t.mouseInside = !0, t.content && t.tooltipEl.style("display", "inline");
+    }), i.on("mouseout.".concat(f), function() {
+      t.mouseInside = !1, t.tooltipEl.style("display", "none");
+    });
+  },
+  update: function(e) {
+    e.tooltipEl.style("display", e.content && e.mouseInside ? "inline" : "none"), e.content ? e.content instanceof HTMLElement ? (e.tooltipEl.text(""), e.tooltipEl.append(function() {
+      return e.content;
+    })) : typeof e.content == "string" ? e.tooltipEl.html(e.content) : X(e.content) ? (e.tooltipEl.text(""), D(e.content, e.tooltipEl.node())) : (e.tooltipEl.style("display", "none"), console.warn("Tooltip content is invalid, skipping.", e.content, e.content.toString())) : e.tooltipEl.text("");
+  }
+});
+export {
+  W as default
+};

package/dist/es/node_modules/.pnpm/internmap@2.0.3/node_modules/internmap/src/index.js

@@ -0,0 +1,35 @@
+class i extends Map {
+  constructor(t, s = f) {
+    if (super(), Object.defineProperties(this, { _intern: { value: /* @__PURE__ */ new Map() }, _key: { value: s } }), t != null) for (const [r, o] of t) this.set(r, o);
+  }
+  get(t) {
+    return super.get(n(this, t));
+  }
+  has(t) {
+    return super.has(n(this, t));
+  }
+  set(t, s) {
+    return super.set(u(this, t), s);
+  }
+  delete(t) {
+    return super.delete(c(this, t));
+  }
+}
+function n({ _intern: e, _key: t }, s) {
+  const r = t(s);
+  return e.has(r) ? e.get(r) : s;
+}
+function u({ _intern: e, _key: t }, s) {
+  const r = t(s);
+  return e.has(r) ? e.get(r) : (e.set(r, s), s);
+}
+function c({ _intern: e, _key: t }, s) {
+  const r = t(s);
+  return e.has(r) && (s = e.get(r), e.delete(r)), s;
+}
+function f(e) {
+  return e !== null && typeof e == "object" ? e.valueOf() : e;
+}
+export {
+  i as InternMap
+};

package/dist/es/node_modules/.pnpm/jerrypick@1.1.2/node_modules/jerrypick/dist/jerrypick.js

@@ -0,0 +1,92 @@
+function m(r, t) {
+  var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+  if (e != null) {
+    var n, a, o, i, u = [], l = !0, c = !1;
+    try {
+      if (o = (e = e.call(r)).next, t === 0) {
+        if (Object(e) !== e) return;
+        l = !1;
+      } else for (; !(l = (n = o.call(e)).done) && (u.push(n.value), u.length !== t); l = !0) ;
+    } catch (s) {
+      c = !0, a = s;
+    } finally {
+      try {
+        if (!l && e.return != null && (i = e.return(), Object(i) !== i)) return;
+      } finally {
+        if (c) throw a;
+      }
+    }
+    return u;
+  }
+}
+function p(r, t, e) {
+  return t = j(t), t in r ? Object.defineProperty(r, t, {
+    value: e,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : r[t] = e, r;
+}
+function y(r, t) {
+  return h(r) || m(r, t) || b(r, t) || g();
+}
+function v(r) {
+  return d(r) || A(r) || b(r) || S();
+}
+function d(r) {
+  if (Array.isArray(r)) return f(r);
+}
+function h(r) {
+  if (Array.isArray(r)) return r;
+}
+function A(r) {
+  if (typeof Symbol < "u" && r[Symbol.iterator] != null || r["@@iterator"] != null) return Array.from(r);
+}
+function b(r, t) {
+  if (r) {
+    if (typeof r == "string") return f(r, t);
+    var e = Object.prototype.toString.call(r).slice(8, -1);
+    if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
+    if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return f(r, t);
+  }
+}
+function f(r, t) {
+  (t == null || t > r.length) && (t = r.length);
+  for (var e = 0, n = new Array(t); e < t; e++) n[e] = r[e];
+  return n;
+}
+function S() {
+  throw new TypeError(`Invalid attempt to spread non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function g() {
+  throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+}
+function w(r, t) {
+  if (typeof r != "object" || r === null) return r;
+  var e = r[Symbol.toPrimitive];
+  if (e !== void 0) {
+    var n = e.call(r, t);
+    if (typeof n != "object") return n;
+    throw new TypeError("@@toPrimitive must return a primitive value.");
+  }
+  return (t === "string" ? String : Number)(r);
+}
+function j(r) {
+  var t = w(r, "string");
+  return typeof t == "symbol" ? t : String(t);
+}
+var I = function(t, e) {
+  var n = new Set(e);
+  return Object.assign.apply(Object, [{}].concat(v(Object.entries(t).filter(function(a) {
+    var o = y(a, 1), i = o[0];
+    return !n.has(i);
+  }).map(function(a) {
+    var o = y(a, 2), i = o[0], u = o[1];
+    return p({}, i, u);
+  }))));
+};
+export {
+  I as omit
+};