@gearbox-protocol/ui-kit 4.0.0-next.56 → 4.0.0-next.58

package/dist/esm/node_modules/.pnpm/inline-style-parser@0.2.7/node_modules/inline-style-parser/cjs/index.js

@@ -0,0 +1,93 @@
+var v, g;
+function Y() {
+  if (g) return v;
+  g = 1;
+  var E = /\/\*[^*]*\*+([^/*][^*]*\*+)*\//g, d = /\n/g, w = /^\s*/, N = /^(\*?[-#/*\\\w]+(\[[0-9a-z_-]+\])?)\s*/, O = /^:\s*/, G = /^((?:'(?:\\'|.)*?'|"(?:\\"|.)*?"|\([^)]*?\)|[^};])+)/, I = /^[;\s]*/, C = /^\s+|\s+$/g, P = `
+`, f = "/", s = "*", t = "", X = "comment", L = "declaration";
+  function M(e, c) {
+    if (typeof e != "string")
+      throw new TypeError("First argument must be a string");
+    if (!e) return [];
+    c = c || {};
+    var o = 1, i = 1;
+    function m(n) {
+      var r = n.match(d);
+      r && (o += r.length);
+      var a = n.lastIndexOf(P);
+      i = ~a ? n.length - a : i + n.length;
+    }
+    function p() {
+      var n = { line: o, column: i };
+      return function(r) {
+        return r.position = new l(n), _(), r;
+      };
+    }
+    function l(n) {
+      this.start = n, this.end = { line: o, column: i }, this.source = c.source;
+    }
+    l.prototype.content = e;
+    function R(n) {
+      var r = new Error(
+        c.source + ":" + o + ":" + i + ": " + n
+      );
+      if (r.reason = n, r.filename = c.source, r.line = o, r.column = i, r.source = e, !c.silent) throw r;
+    }
+    function u(n) {
+      var r = n.exec(e);
+      if (r) {
+        var a = r[0];
+        return m(a), e = e.slice(a.length), r;
+      }
+    }
+    function _() {
+      u(w);
+    }
+    function A(n) {
+      var r;
+      for (n = n || []; r = T(); )
+        r !== !1 && n.push(r);
+      return n;
+    }
+    function T() {
+      var n = p();
+      if (!(f != e.charAt(0) || s != e.charAt(1))) {
+        for (var r = 2; t != e.charAt(r) && (s != e.charAt(r) || f != e.charAt(r + 1)); )
+          ++r;
+        if (r += 2, t === e.charAt(r - 1))
+          return R("End of comment missing");
+        var a = e.slice(2, r - 2);
+        return i += 2, m(a), e = e.slice(r), i += 2, n({
+          type: X,
+          comment: a
+        });
+      }
+    }
+    function S() {
+      var n = p(), r = u(N);
+      if (r) {
+        if (T(), !u(O)) return R("property missing ':'");
+        var a = u(G), W = n({
+          type: L,
+          property: h(r[0].replace(E, t)),
+          value: a ? h(a[0].replace(E, t)) : t
+        });
+        return u(I), W;
+      }
+    }
+    function x() {
+      var n = [];
+      A(n);
+      for (var r; r = S(); )
+        r !== !1 && (n.push(r), A(n));
+      return n;
+    }
+    return _(), x();
+  }
+  function h(e) {
+    return e ? e.replace(C, t) : t;
+  }
+  return v = M, v;
+}
+export {
+  Y as __require
+};

package/dist/esm/node_modules/.pnpm/is-plain-obj@4.1.0/node_modules/is-plain-obj/index.js

@@ -0,0 +1,9 @@
+function e(t) {
+  if (typeof t != "object" || t === null)
+    return !1;
+  const o = Object.getPrototypeOf(t);
+  return (o === null || o === Object.prototype || Object.getPrototypeOf(o) === null) && !(Symbol.toStringTag in t) && !(Symbol.iterator in t);
+}
+export {
+  e as default
+};

package/dist/esm/node_modules/.pnpm/longest-streak@3.1.0/node_modules/longest-streak/index.js

@@ -0,0 +1,12 @@
+function f(l, t) {
+  const i = String(l);
+  let e = i.indexOf(t), n = e, o = 0, r = 0;
+  if (typeof t != "string")
+    throw new TypeError("Expected substring");
+  for (; e !== -1; )
+    e === n ? ++o > r && (r = o) : o = 1, n = e + t.length, e = i.indexOf(t, n);
+  return r;
+}
+export {
+  f as longestStreak
+};

package/dist/esm/node_modules/.pnpm/markdown-table@3.0.4/node_modules/markdown-table/index.js

@@ -0,0 +1,75 @@
+function C(i) {
+  return i.length;
+}
+function L(i, f) {
+  const n = f || {}, d = (n.align || []).concat(), y = n.stringLength || C, p = [], u = [], w = [], a = [];
+  let g = 0, s = -1;
+  for (; ++s < i.length; ) {
+    const r = [], c = [];
+    let t = -1;
+    for (i[s].length > g && (g = i[s].length); ++t < i[s].length; ) {
+      const l = I(i[s][t]);
+      if (n.alignDelimiters !== !1) {
+        const o = y(l);
+        c[t] = o, (a[t] === void 0 || o > a[t]) && (a[t] = o);
+      }
+      r.push(l);
+    }
+    u[s] = r, w[s] = c;
+  }
+  let e = -1;
+  if (typeof d == "object" && "length" in d)
+    for (; ++e < g; )
+      p[e] = S(d[e]);
+  else {
+    const r = S(d);
+    for (; ++e < g; )
+      p[e] = r;
+  }
+  e = -1;
+  const z = [], x = [];
+  for (; ++e < g; ) {
+    const r = p[e];
+    let c = "", t = "";
+    r === 99 ? (c = ":", t = ":") : r === 108 ? c = ":" : r === 114 && (t = ":");
+    let l = n.alignDelimiters === !1 ? 1 : Math.max(
+      1,
+      a[e] - c.length - t.length
+    );
+    const o = c + "-".repeat(l) + t;
+    n.alignDelimiters !== !1 && (l = c.length + l + t.length, l > a[e] && (a[e] = l), x[e] = l), z[e] = o;
+  }
+  u.splice(1, 0, z), w.splice(1, 0, x), s = -1;
+  const D = [];
+  for (; ++s < u.length; ) {
+    const r = u[s], c = w[s];
+    e = -1;
+    const t = [];
+    for (; ++e < g; ) {
+      const l = r[e] || "";
+      let o = "", m = "";
+      if (n.alignDelimiters !== !1) {
+        const h = a[e] - (c[e] || 0), j = p[e];
+        j === 114 ? o = " ".repeat(h) : j === 99 ? h % 2 ? (o = " ".repeat(h / 2 + 0.5), m = " ".repeat(h / 2 - 0.5)) : (o = " ".repeat(h / 2), m = o) : m = " ".repeat(h);
+      }
+      n.delimiterStart !== !1 && !e && t.push("|"), n.padding !== !1 && // Don’t add the opening space if we’re not aligning and the cell is
+      // empty: there will be a closing space.
+      !(n.alignDelimiters === !1 && l === "") && (n.delimiterStart !== !1 || e) && t.push(" "), n.alignDelimiters !== !1 && t.push(o), t.push(l), n.alignDelimiters !== !1 && t.push(m), n.padding !== !1 && t.push(" "), (n.delimiterEnd !== !1 || e !== g - 1) && t.push("|");
+    }
+    D.push(
+      n.delimiterEnd === !1 ? t.join("").replace(/ +$/, "") : t.join("")
+    );
+  }
+  return D.join(`
+`);
+}
+function I(i) {
+  return i == null ? "" : String(i);
+}
+function S(i) {
+  const f = typeof i == "string" ? i.codePointAt(0) : 0;
+  return f === 67 || f === 99 ? 99 : f === 76 || f === 108 ? 108 : f === 82 || f === 114 ? 114 : 0;
+}
+export {
+  L as markdownTable
+};

package/dist/esm/node_modules/.pnpm/mdast-util-find-and-replace@3.0.2/node_modules/mdast-util-find-and-replace/lib/index.js

@@ -0,0 +1,70 @@
+import b from "../../../../escape-string-regexp@5.0.0/node_modules/escape-string-regexp/index.js";
+import { convert as E } from "../../../../unist-util-is@6.0.1/node_modules/unist-util-is/lib/index.js";
+import { visitParents as I } from "../../../../unist-util-visit-parents@6.0.2/node_modules/unist-util-visit-parents/lib/index.js";
+function q(e, f, a) {
+  const p = E((a || {}).ignore || []), x = R(f);
+  let d = -1;
+  for (; ++d < x.length; )
+    I(e, "text", m);
+  function m(n, s) {
+    let c = -1, t;
+    for (; ++c < s.length; ) {
+      const u = s[c], r = t ? t.children : void 0;
+      if (p(
+        u,
+        r ? r.indexOf(u) : void 0,
+        t
+      ))
+        return;
+      t = u;
+    }
+    if (t)
+      return w(n, s);
+  }
+  function w(n, s) {
+    const c = s[s.length - 1], t = x[d][0], u = x[d][1];
+    let r = 0;
+    const y = c.children.indexOf(n);
+    let v = !1, l = [];
+    t.lastIndex = 0;
+    let o = t.exec(n.value);
+    for (; o; ) {
+      const h = o.index, A = {
+        index: o.index,
+        input: o.input,
+        stack: [...s, n]
+      };
+      let i = u(...o, A);
+      if (typeof i == "string" && (i = i.length > 0 ? { type: "text", value: i } : void 0), i === !1 ? t.lastIndex = h + 1 : (r !== h && l.push({
+        type: "text",
+        value: n.value.slice(r, h)
+      }), Array.isArray(i) ? l.push(...i) : i && l.push(i), r = h + o[0].length, v = !0), !t.global)
+        break;
+      o = t.exec(n.value);
+    }
+    return v ? (r < n.value.length && l.push({ type: "text", value: n.value.slice(r) }), c.children.splice(y, 1, ...l)) : l = [n], y + l.length;
+  }
+}
+function R(e) {
+  const f = [];
+  if (!Array.isArray(e))
+    throw new TypeError("Expected find and replace tuple or list of tuples");
+  const a = !e[0] || Array.isArray(e[0]) ? e : [e];
+  let g = -1;
+  for (; ++g < a.length; ) {
+    const p = a[g];
+    f.push([k(p[0]), P(p[1])]);
+  }
+  return f;
+}
+function k(e) {
+  return typeof e == "string" ? new RegExp(b(e), "g") : e;
+}
+function P(e) {
+  return typeof e == "function" ? e : function() {
+    return e;
+  };
+}
+export {
+  q as findAndReplace
+};