@kelet-ai/feedback-ui 0.5.1 → 0.7.0

package/dist/feedback-ui.es.min.js

@@ -1,12 +1,12 @@
-import De, { createContext as Ee, useContext as ae, useCallback as W, isValidElement as Z, cloneElement as Q, useState as X, useRef as U, useId as ce, useEffect as ke } from "react";
-function _e(n) {
-  return n && n.__esModule && Object.prototype.hasOwnProperty.call(n, "default") ? n.default : n;
+import De, { createContext as ke, useContext as ae, useCallback as W, isValidElement as Z, cloneElement as Q, useState as X, useRef as z, useId as ce, useEffect as Ee } from "react";
+function _e(t) {
+  return t && t.__esModule && Object.prototype.hasOwnProperty.call(t, "default") ? t.default : t;
 }
-function Se(n) {
-  if (Object.prototype.hasOwnProperty.call(n, "__esModule")) return n;
-  var e = n.default;
+function je(t) {
+  if (Object.prototype.hasOwnProperty.call(t, "__esModule")) return t;
+  var e = t.default;
   if (typeof e == "function") {
-    var t = function r() {
+    var n = function r() {
       var o = !1;
       try {
         o = this instanceof r;
@@ -14,17 +14,17 @@ function Se(n) {
       }
       return o ? Reflect.construct(e, arguments, this.constructor) : e.apply(this, arguments);
     };
-    t.prototype = e.prototype;
-  } else t = {};
-  return Object.defineProperty(t, "__esModule", { value: !0 }), Object.keys(n).forEach(function(r) {
-    var o = Object.getOwnPropertyDescriptor(n, r);
-    Object.defineProperty(t, r, o.get ? o : {
+    n.prototype = e.prototype;
+  } else n = {};
+  return Object.defineProperty(n, "__esModule", { value: !0 }), Object.keys(t).forEach(function(r) {
+    var o = Object.getOwnPropertyDescriptor(t, r);
+    Object.defineProperty(n, r, o.get ? o : {
       enumerable: !0,
       get: function() {
-        return n[r];
+        return t[r];
       }
     });
-  }), t;
+  }), n;
 }
 var re = { exports: {} }, V = {};
 /**
@@ -37,11 +37,11 @@ var re = { exports: {} }, V = {};
  * LICENSE file in the root directory of this source tree.
  */
 var fe;
-function je() {
+function Ne() {
   if (fe) return V;
   fe = 1;
-  var n = Symbol.for("react.transitional.element"), e = Symbol.for("react.fragment");
-  function t(r, o, u) {
+  var t = Symbol.for("react.transitional.element"), e = Symbol.for("react.fragment");
+  function n(r, o, u) {
     var d = null;
     if (u !== void 0 && (d = "" + u), o.key !== void 0 && (d = "" + o.key), "key" in o) {
       u = {};
@@ -49,14 +49,14 @@ function je() {
         f !== "key" && (u[f] = o[f]);
     } else u = o;
     return o = u.ref, {
-      $$typeof: n,
+      $$typeof: t,
       type: r,
       key: d,
       ref: o !== void 0 ? o : null,
       props: u
     };
   }
-  return V.Fragment = e, V.jsx = t, V.jsxs = t, V;
+  return V.Fragment = e, V.jsx = n, V.jsxs = n, V;
 }
 var G = {};
 /**
@@ -69,23 +69,23 @@ var G = {};
  * LICENSE file in the root directory of this source tree.
  */
 var de;
-function Ne() {
+function Se() {
   return de || (de = 1, process.env.NODE_ENV !== "production" && function() {
-    function n(a) {
+    function t(a) {
       if (a == null) return null;
       if (typeof a == "function")
         return a.$$typeof === s ? null : a.displayName || a.name || null;
       if (typeof a == "string") return a;
       switch (a) {
-        case g:
+        case w:
           return "Fragment";
-        case P:
+        case R:
           return "Profiler";
-        case C:
+        case A:
           return "StrictMode";
-        case R:
+        case O:
           return "Suspense";
-        case I:
+        case N:
           return "SuspenseList";
         case l:
           return "Activity";
@@ -96,19 +96,19 @@ function Ne() {
         ), a.$$typeof) {
           case h:
             return "Portal";
-          case k:
+          case g:
             return (a.displayName || "Context") + ".Provider";
-          case v:
+          case b:
             return (a._context.displayName || "Context") + ".Consumer";
-          case O:
+          case k:
             var T = a.render;
             return a = a.displayName, a || (a = T.displayName || T.name || "", a = a !== "" ? "ForwardRef(" + a + ")" : "ForwardRef"), a;
-          case L:
-            return T = a.displayName || null, T !== null ? T : n(a.type) || "Memo";
+          case F:
+            return T = a.displayName || null, T !== null ? T : t(a.type) || "Memo";
           case i:
             T = a._payload, a = a._init;
             try {
-              return n(a(T));
+              return t(a(T));
             } catch {
             }
         }
@@ -117,7 +117,7 @@ function Ne() {
     function e(a) {
       return "" + a;
     }
-    function t(a) {
+    function n(a) {
       try {
         e(a);
         var T = !1;
@@ -126,20 +126,20 @@ function Ne() {
       }
       if (T) {
         T = console;
-        var _ = T.error, S = typeof Symbol == "function" && Symbol.toStringTag && a[Symbol.toStringTag] || a.constructor.name || "Object";
+        var _ = T.error, j = typeof Symbol == "function" && Symbol.toStringTag && a[Symbol.toStringTag] || a.constructor.name || "Object";
         return _.call(
           T,
           "The provided key is an unsupported type %s. This value must be coerced to a string before using it here.",
-          S
+          j
         ), e(a);
       }
     }
     function r(a) {
-      if (a === g) return "<>";
+      if (a === w) return "<>";
       if (typeof a == "object" && a !== null && a.$$typeof === i)
         return "<...>";
       try {
-        var T = n(a);
+        var T = t(a);
         return T ? "<" + T + ">" : "<...>";
       } catch {
         return "<...>";
@@ -153,7 +153,7 @@ function Ne() {
       return Error("react-stack-top-frame");
     }
     function d(a) {
-      if (b.call(a, "key")) {
+      if (v.call(a, "key")) {
         var T = Object.getOwnPropertyDescriptor(a, "key").get;
         if (T && T.isReactWarning) return !1;
       }
@@ -172,14 +172,14 @@ function Ne() {
       });
     }
     function p() {
-      var a = n(this.type);
-      return N[a] || (N[a] = !0, console.error(
+      var a = t(this.type);
+      return I[a] || (I[a] = !0, console.error(
         "Accessing element.ref was removed in React 19. ref is now a regular prop. It will be removed from the JSX Element type in a future release."
       )), a = this.props.ref, a !== void 0 ? a : null;
     }
-    function y(a, T, _, S, q, $, B, K) {
+    function y(a, T, _, j, q, $, B, K) {
       return _ = $.ref, a = {
-        $$typeof: E,
+        $$typeof: P,
         type: a,
         key: T,
         props: $,
@@ -209,48 +209,48 @@ function Ne() {
         value: K
       }), Object.freeze && (Object.freeze(a.props), Object.freeze(a)), a;
     }
-    function m(a, T, _, S, q, $, B, K) {
-      var j = T.children;
-      if (j !== void 0)
-        if (S)
-          if (D(j)) {
-            for (S = 0; S < j.length; S++)
-              A(j[S]);
-            Object.freeze && Object.freeze(j);
+    function m(a, T, _, j, q, $, B, K) {
+      var S = T.children;
+      if (S !== void 0)
+        if (j)
+          if (D(S)) {
+            for (j = 0; j < S.length; j++)
+              C(S[j]);
+            Object.freeze && Object.freeze(S);
           } else
             console.error(
               "React.jsx: Static children should always be an array. You are likely explicitly calling React.jsxs or React.jsxDEV. Use the Babel transform instead."
             );
-        else A(j);
-      if (b.call(T, "key")) {
-        j = n(a);
+        else C(S);
+      if (v.call(T, "key")) {
+        S = t(a);
         var Y = Object.keys(T).filter(function(Ae) {
           return Ae !== "key";
         });
-        S = 0 < Y.length ? "{key: someKey, " + Y.join(": ..., ") + ": ...}" : "{key: someKey}", ne[j + S] || (Y = 0 < Y.length ? "{" + Y.join(": ..., ") + ": ...}" : "{}", console.error(
+        j = 0 < Y.length ? "{key: someKey, " + Y.join(": ..., ") + ": ...}" : "{key: someKey}", ne[S + j] || (Y = 0 < Y.length ? "{" + Y.join(": ..., ") + ": ...}" : "{}", console.error(
           `A props object containing a "key" prop is being spread into JSX:
   let props = %s;
   <%s {...props} />
 React keys must be passed directly to JSX without using spread:
   let props = %s;
   <%s key={someKey} {...props} />`,
-          S,
           j,
+          S,
           Y,
-          j
-        ), ne[j + S] = !0);
+          S
+        ), ne[S + j] = !0);
       }
-      if (j = null, _ !== void 0 && (t(_), j = "" + _), d(T) && (t(T.key), j = "" + T.key), "key" in T) {
+      if (S = null, _ !== void 0 && (n(_), S = "" + _), d(T) && (n(T.key), S = "" + T.key), "key" in T) {
         _ = {};
         for (var le in T)
           le !== "key" && (_[le] = T[le]);
       } else _ = T;
-      return j && f(
+      return S && f(
         _,
         typeof a == "function" ? a.displayName || a.name || "Unknown" : a
       ), y(
         a,
-        j,
+        S,
         $,
         q,
         o(),
@@ -259,43 +259,43 @@ React keys must be passed directly to JSX without using spread:
         K
       );
     }
-    function A(a) {
-      typeof a == "object" && a !== null && a.$$typeof === E && a._store && (a._store.validated = 1);
+    function C(a) {
+      typeof a == "object" && a !== null && a.$$typeof === P && a._store && (a._store.validated = 1);
     }
-    var w = De, E = Symbol.for("react.transitional.element"), h = Symbol.for("react.portal"), g = Symbol.for("react.fragment"), C = Symbol.for("react.strict_mode"), P = Symbol.for("react.profiler"), v = Symbol.for("react.consumer"), k = Symbol.for("react.context"), O = Symbol.for("react.forward_ref"), R = Symbol.for("react.suspense"), I = Symbol.for("react.suspense_list"), L = Symbol.for("react.memo"), i = Symbol.for("react.lazy"), l = Symbol.for("react.activity"), s = Symbol.for("react.client.reference"), c = w.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, b = Object.prototype.hasOwnProperty, D = Array.isArray, x = console.createTask ? console.createTask : function() {
+    var E = De, P = Symbol.for("react.transitional.element"), h = Symbol.for("react.portal"), w = Symbol.for("react.fragment"), A = Symbol.for("react.strict_mode"), R = Symbol.for("react.profiler"), b = Symbol.for("react.consumer"), g = Symbol.for("react.context"), k = Symbol.for("react.forward_ref"), O = Symbol.for("react.suspense"), N = Symbol.for("react.suspense_list"), F = Symbol.for("react.memo"), i = Symbol.for("react.lazy"), l = Symbol.for("react.activity"), s = Symbol.for("react.client.reference"), c = E.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE, v = Object.prototype.hasOwnProperty, D = Array.isArray, x = console.createTask ? console.createTask : function() {
       return null;
     };
-    w = {
+    E = {
       react_stack_bottom_frame: function(a) {
         return a();
       }
     };
-    var M, N = {}, H = w.react_stack_bottom_frame.bind(
-      w,
+    var M, I = {}, U = E.react_stack_bottom_frame.bind(
+      E,
       u
     )(), J = x(r(u)), ne = {};
-    G.Fragment = g, G.jsx = function(a, T, _, S, q) {
+    G.Fragment = w, G.jsx = function(a, T, _, j, q) {
       var $ = 1e4 > c.recentlyCreatedOwnerStacks++;
       return m(
         a,
         T,
         _,
         !1,
-        S,
+        j,
         q,
-        $ ? Error("react-stack-top-frame") : H,
+        $ ? Error("react-stack-top-frame") : U,
         $ ? x(r(a)) : J
       );
-    }, G.jsxs = function(a, T, _, S, q) {
+    }, G.jsxs = function(a, T, _, j, q) {
       var $ = 1e4 > c.recentlyCreatedOwnerStacks++;
       return m(
         a,
         T,
         _,
         !0,
-        S,
+        j,
         q,
-        $ ? Error("react-stack-top-frame") : H,
+        $ ? Error("react-stack-top-frame") : U,
         $ ? x(r(a)) : J
       );
     };
@@ -303,20 +303,22 @@ React keys must be passed directly to JSX without using spread:
 }
 var pe;
 function Ie() {
-  return pe || (pe = 1, process.env.NODE_ENV === "production" ? re.exports = je() : re.exports = Ne()), re.exports;
+  return pe || (pe = 1, process.env.NODE_ENV === "production" ? re.exports = Ne() : re.exports = Se()), re.exports;
 }
-var F = Ie();
-const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
-  const n = ae(se);
-  if (!n)
+var L = Ie();
+const se = ke(null), Fe = "https://api.kelet.ai/api", pt = () => {
+  const t = ae(se);
+  if (!t)
     throw new Error("useKelet must be used within a KeletProvider");
-  return n;
+  return t;
 }, Pe = () => {
-  const n = ae(se);
-  return n ? n.feedback : async () => {
-  };
-}, ht = ({ apiKey: n, project: e, children: t }) => {
-  const r = ae(se), o = n || r?.api_key;
+  const t = ae(se);
+  return t ? t.feedback : (console.warn(
+    "No FeedbackHandler found: defaultFeedbackHandler is not possible since there's no KeletProvider wrapping this call, and handler not provided"
+  ), async () => {
+  });
+}, ht = ({ apiKey: t, project: e, children: n }) => {
+  const r = ae(se), o = t || r?.api_key;
   if (!o)
     throw new Error(
       "apiKey is required either directly or from a parent KeletProvider"
@@ -345,38 +347,38 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
         throw new Error(`Failed to submit feedback: ${m.statusText}`);
     }
   };
-  return /* @__PURE__ */ F.jsx(se.Provider, { value: d, children: t });
-}, ee = (n, e) => {
-  const t = { ...e };
+  return /* @__PURE__ */ L.jsx(se.Provider, { value: d, children: n });
+}, ee = (t, e) => {
+  const n = { ...e };
   for (const r in e) {
-    const o = n[r], u = e[r];
-    /^on[A-Z]/.test(r) ? o && u ? t[r] = (...f) => {
+    const o = t[r], u = e[r];
+    /^on[A-Z]/.test(r) ? o && u ? n[r] = (...f) => {
       u(...f), o(...f);
-    } : o && (t[r] = o) : r === "style" ? t[r] = { ...o, ...u } : r === "className" ? t[r] = [o, u].filter(Boolean).join(" ") : t[r] = u !== void 0 ? u : o;
+    } : o && (n[r] = o) : r === "style" ? n[r] = { ...o, ...u } : r === "className" ? n[r] = [o, u].filter(Boolean).join(" ") : n[r] = u !== void 0 ? u : o;
   }
-  return { ...n, ...t };
-}, xe = Ee(
+  return { ...t, ...n };
+}, xe = ke(
   null
 ), te = () => {
-  const n = ae(xe);
-  if (!n)
+  const t = ae(xe);
+  if (!t)
     throw new Error(
       "VoteFeedback components must be used within VoteFeedback.Root"
     );
-  return n;
+  return t;
 }, Le = ({
-  children: n,
+  children: t,
   onFeedback: e,
-  defaultText: t = "",
+  defaultText: n = "",
   tx_id: r,
   extra_metadata: o,
   trigger_name: u
 }) => {
-  const d = typeof r == "function" ? r() : r, [f, p] = X(!1), [y, m] = X(t), [A, w] = X(!1), [E, h] = X(null), g = U(null), C = U(null), P = ce(), v = ce(), k = Pe(), O = e || k;
-  ke(() => {
-    p(!1), m(t), w(!1), h(null), setTimeout(() => C.current?.focus(), 0);
-  }, [d, t]);
-  const R = W(async () => {
+  const d = typeof r == "function" ? r() : r, [f, p] = X(!1), [y, m] = X(n), [C, E] = X(!1), [P, h] = X(null), w = z(null), A = z(null), R = ce(), b = ce(), g = Pe(), k = e || g;
+  Ee(() => {
+    p(!1), m(n), E(!1), h(null), setTimeout(() => A.current?.focus(), 0);
+  }, [d, n]);
+  const O = W(async () => {
     h("upvote");
     const c = {
       tx_id: d,
@@ -385,12 +387,12 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
       ...u && { trigger_name: u }
     };
     try {
-      w(!0), await O(c);
+      E(!0), await k(c);
     } finally {
-      w(!1);
+      E(!1);
     }
-  }, [O, d, o, u]), I = W(async () => {
-    if (h("downvote"), O) {
+  }, [k, d, o, u]), N = W(async () => {
+    if (h("downvote"), k) {
       const c = {
         tx_id: d,
         vote: "downvote",
@@ -398,17 +400,17 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
         ...u && { trigger_name: u }
       };
       try {
-        w(!0), await O(c);
+        E(!0), await k(c);
       } finally {
-        w(!1);
+        E(!1);
       }
     }
     p(!0), setTimeout(() => {
-      g.current?.focus();
+      w.current?.focus();
       const c = document.createElement("div");
       c.setAttribute("aria-live", "polite"), c.setAttribute("aria-atomic", "true"), c.className = "sr-only", c.textContent = "Feedback dialog opened. You can provide additional details about your downvote.", document.body.appendChild(c), setTimeout(() => document.body.removeChild(c), 1e3);
     }, 0);
-  }, [O, d, o, u]), L = W(
+  }, [k, d, o, u]), F = W(
     (c) => {
       m(c.target.value);
     },
@@ -416,7 +418,7 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
   ), i = W(async () => {
     const c = y.trim().length > 0;
     if (c) {
-      const b = {
+      const v = {
         tx_id: d,
         vote: "downvote",
         explanation: y,
@@ -424,67 +426,67 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
         ...u && { trigger_name: u }
       };
       try {
-        w(!0), await O(b);
+        E(!0), await k(v);
       } finally {
-        w(!1);
+        E(!1);
       }
     }
-    if (p(!1), m(t), C.current?.focus(), c) {
-      const b = document.createElement("div");
-      b.setAttribute("aria-live", "polite"), b.className = "sr-only", b.textContent = "Feedback submitted successfully.", document.body.appendChild(b), setTimeout(() => document.body.removeChild(b), 1e3);
+    if (p(!1), m(n), A.current?.focus(), c) {
+      const v = document.createElement("div");
+      v.setAttribute("aria-live", "polite"), v.className = "sr-only", v.textContent = "Feedback submitted successfully.", document.body.appendChild(v), setTimeout(() => document.body.removeChild(v), 1e3);
     }
-  }, [O, y, t, d, o, u]), l = W(
+  }, [k, y, n, d, o, u]), l = W(
     (c) => {
       if (c.key === "Escape")
-        p(!1), m(t), C.current?.focus();
+        p(!1), m(n), A.current?.focus();
       else if ((c.metaKey || c.ctrlKey) && c.key === "Enter")
-        c.preventDefault(), i().then((b) => {
+        c.preventDefault(), i().then((v) => {
         });
       else if (c.key === "Tab" && f) {
-        const b = document.getElementById(P);
-        if (b) {
-          const D = b.querySelectorAll(
+        const v = document.getElementById(R);
+        if (v) {
+          const D = v.querySelectorAll(
             'button, textarea, input, select, a[href], [tabindex]:not([tabindex="-1"])'
           ), x = D[0], M = D[D.length - 1];
           c.shiftKey && document.activeElement === x ? (c.preventDefault(), M?.focus()) : !c.shiftKey && document.activeElement === M && (c.preventDefault(), x?.focus());
         }
       }
     },
-    [i, f, P, t]
+    [i, f, R, n]
   ), s = {
-    onFeedback: O,
+    onFeedback: k,
     showPopover: f,
     setShowPopover: p,
     feedbackText: y,
     setFeedbackText: m,
-    isSubmitting: A,
-    setIsSubmitting: w,
-    vote: E,
-    handleUpvote: R,
-    handleDownvote: I,
-    handleTextareaChange: L,
+    isSubmitting: C,
+    setIsSubmitting: E,
+    vote: P,
+    handleUpvote: O,
+    handleDownvote: N,
+    handleTextareaChange: F,
     handleSubmit: i,
     handleKeyDown: l,
-    textareaRef: g,
-    triggerRef: C,
-    popoverId: P,
-    triggerId: v,
+    textareaRef: w,
+    triggerRef: A,
+    popoverId: R,
+    triggerId: b,
     tx_id: d,
     extra_metadata: o,
     trigger_name: u
   };
-  return /* @__PURE__ */ F.jsx(xe.Provider, { value: s, children: n });
+  return /* @__PURE__ */ L.jsx(xe.Provider, { value: s, children: t });
 }, Me = ({
-  asChild: n,
+  asChild: t,
   children: e,
-  onClick: t,
+  onClick: n,
   ...r
 }) => {
   const { handleUpvote: o, isSubmitting: u, vote: d } = te(), f = W(
     (m) => {
-      o(), t?.(m);
+      o(), n?.(m);
     },
-    [o, t]
+    [o, n]
   ), p = {
     ...r,
     onClick: f,
@@ -492,7 +494,7 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
     "aria-label": r["aria-label"] || "Upvote feedback",
     type: "button"
   }, y = d === "upvote";
-  if (n) {
+  if (t) {
     const m = typeof e == "function" ? e({ isSelected: y }) : e;
     if (Z(m))
       return Q(
@@ -500,11 +502,11 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
         ee(p, m.props)
       );
   }
-  return /* @__PURE__ */ F.jsx("button", { ...p, children: typeof e == "function" ? e({ isSelected: y }) : e });
+  return /* @__PURE__ */ L.jsx("button", { ...p, children: typeof e == "function" ? e({ isSelected: y }) : e });
 }, $e = ({
-  asChild: n,
+  asChild: t,
   children: e,
-  onClick: t,
+  onClick: n,
   ...r
 }) => {
   const {
@@ -515,36 +517,36 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
     triggerId: p,
     triggerRef: y,
     vote: m
-  } = te(), A = W(
+  } = te(), C = W(
     (h) => {
-      o(), t?.(h);
+      o(), n?.(h);
     },
-    [o, t]
-  ), w = {
+    [o, n]
+  ), E = {
     ...r,
     ref: y,
-    onClick: A,
+    onClick: C,
     disabled: d || r.disabled,
     "aria-label": r["aria-label"] || "Downvote feedback",
     "aria-expanded": u,
     "aria-controls": f,
     id: p,
     type: "button"
-  }, E = m === "downvote";
-  if (n) {
-    const h = typeof e == "function" ? e({ isSelected: E }) : e;
+  }, P = m === "downvote";
+  if (t) {
+    const h = typeof e == "function" ? e({ isSelected: P }) : e;
     if (Z(h))
-      return Q(h, ee(w, h.props));
+      return Q(h, ee(E, h.props));
     if (h)
       return h;
   }
-  return /* @__PURE__ */ F.jsx("button", { ...w, children: typeof e == "function" ? e({ isSelected: E }) : e });
-}, qe = ({ asChild: n, children: e, ...t }) => {
+  return /* @__PURE__ */ L.jsx("button", { ...E, children: typeof e == "function" ? e({ isSelected: P }) : e });
+}, qe = ({ asChild: t, children: e, ...n }) => {
   const { showPopover: r, handleKeyDown: o, popoverId: u, triggerId: d } = te();
   if (!r)
     return null;
   const f = {
-    ...t,
+    ...n,
     role: "dialog",
     "aria-labelledby": d,
     "aria-modal": !0,
@@ -553,17 +555,17 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
     onKeyDown: o,
     tabIndex: -1
   };
-  return n && Z(e) ? /* @__PURE__ */ F.jsxs(F.Fragment, { children: [
+  return t && Z(e) ? /* @__PURE__ */ L.jsxs(L.Fragment, { children: [
     Q(
       e,
       ee(f, e.props)
     ),
-    /* @__PURE__ */ F.jsx("div", { id: `${u}-description`, className: "sr-only", children: "Provide additional feedback for your downvote" })
-  ] }) : /* @__PURE__ */ F.jsxs("div", { ...f, children: [
-    /* @__PURE__ */ F.jsx("div", { id: `${u}-description`, className: "sr-only", children: "Provide additional feedback for your downvote" }),
+    /* @__PURE__ */ L.jsx("div", { id: `${u}-description`, className: "sr-only", children: "Provide additional feedback for your downvote" })
+  ] }) : /* @__PURE__ */ L.jsxs("div", { ...f, children: [
+    /* @__PURE__ */ L.jsx("div", { id: `${u}-description`, className: "sr-only", children: "Provide additional feedback for your downvote" }),
     e
   ] });
-}, We = ({ asChild: n, value: e, onChange: t, ...r }) => {
+}, We = ({ asChild: t, value: e, onChange: n, ...r }) => {
   const {
     feedbackText: o,
     handleTextareaChange: u,
@@ -574,28 +576,28 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
     ...r,
     ref: d,
     value: e !== void 0 ? e : o,
-    onChange: t || u,
+    onChange: n || u,
     onKeyDown: f,
     placeholder: r.placeholder || "What did we miss?",
     "aria-label": r["aria-label"] || "Additional feedback",
     "aria-describedby": `${p}-help`,
     rows: r.rows || 3
   };
-  return n && Z(r.children) ? Q(
+  return t && Z(r.children) ? Q(
     r.children,
     ee(y, r.children.props)
-  ) : /* @__PURE__ */ F.jsx("textarea", { ...y });
+  ) : /* @__PURE__ */ L.jsx("textarea", { ...y });
 }, Ye = ({
-  asChild: n,
+  asChild: t,
   children: e,
-  onClick: t,
+  onClick: n,
   ...r
 }) => {
   const { handleSubmit: o, isSubmitting: u, feedbackText: d } = te(), f = W(
-    (A) => {
-      o(), t?.(A);
+    (C) => {
+      o(), n?.(C);
     },
-    [o, t]
+    [o, n]
   ), p = d.trim().length > 0, y = p ? "Submit feedback" : "Close without feedback", m = {
     ...r,
     onClick: f,
@@ -604,15 +606,15 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
     "aria-label": r["aria-label"] || y,
     "aria-describedby": p ? void 0 : "submit-help"
   };
-  return n && Z(e) ? /* @__PURE__ */ F.jsxs(F.Fragment, { children: [
+  return t && Z(e) ? /* @__PURE__ */ L.jsxs(L.Fragment, { children: [
     Q(
       e,
       ee(m, e.props)
     ),
-    !p && /* @__PURE__ */ F.jsx("span", { id: "submit-help", className: "sr-only", children: "This will close the dialog without submitting feedback" })
-  ] }) : /* @__PURE__ */ F.jsxs("button", { ...m, children: [
+    !p && /* @__PURE__ */ L.jsx("span", { id: "submit-help", className: "sr-only", children: "This will close the dialog without submitting feedback" })
+  ] }) : /* @__PURE__ */ L.jsxs("button", { ...m, children: [
     e,
-    !p && /* @__PURE__ */ F.jsx("span", { id: "submit-help", className: "sr-only", children: "This will close the dialog without submitting feedback" })
+    !p && /* @__PURE__ */ L.jsx("span", { id: "submit-help", className: "sr-only", children: "This will close the dialog without submitting feedback" })
   ] });
 }, mt = {
   Root: Le,
@@ -623,12 +625,12 @@ const se = Ee(null), Fe = "https://api.kelet.ai/api", pt = () => {
   SubmitButton: Ye
 };
 var ie = { exports: {} }, ze = ie.exports, he;
-function Ke() {
-  return he || (he = 1, function(n, e) {
-    (function(t, r) {
-      var o = r(t);
-      n.exports = o;
-    })(ze, function(t) {
+function He() {
+  return he || (he = 1, function(t, e) {
+    (function(n, r) {
+      var o = r(n);
+      t.exports = o;
+    })(ze, function(n) {
       var r = ["N", "E", "A", "D"];
       function o(i, l) {
         i.super_ = l, i.prototype = Object.create(l.prototype, {
@@ -687,11 +689,11 @@ function Ke() {
         var c = i.slice(l + 1 || i.length);
         return i.length = l < 0 ? i.length + l : l, i.push.apply(i, c), i;
       }
-      function A(i) {
+      function C(i) {
         var l = typeof i;
         return l !== "object" ? l : i === Math ? "math" : i === null ? "null" : Array.isArray(i) ? "array" : Object.prototype.toString.call(i) === "[object Date]" ? "date" : typeof i.toString == "function" && /^\/.*\//.test(i.toString()) ? "regexp" : "object";
       }
-      function w(i) {
+      function E(i) {
         var l = 0;
         if (i.length === 0)
           return l;
@@ -701,128 +703,128 @@ function Ke() {
         }
         return l;
       }
-      function E(i) {
-        var l = 0, s = A(i);
+      function P(i) {
+        var l = 0, s = C(i);
         if (s === "array") {
           i.forEach(function(M) {
-            l += E(M);
+            l += P(M);
           });
           var c = "[type: array, hash: " + l + "]";
-          return l + w(c);
+          return l + E(c);
         }
         if (s === "object") {
-          for (var b in i)
-            if (i.hasOwnProperty(b)) {
-              var D = "[ type: object, key: " + b + ", value hash: " + E(i[b]) + "]";
-              l += w(D);
+          for (var v in i)
+            if (i.hasOwnProperty(v)) {
+              var D = "[ type: object, key: " + v + ", value hash: " + P(i[v]) + "]";
+              l += E(D);
             }
           return l;
         }
         var x = "[ type: " + s + " ; value: " + i + "]";
-        return l + w(x);
+        return l + E(x);
       }
-      function h(i, l, s, c, b, D, x, M) {
-        s = s || [], b = b || [], x = x || [];
-        var N = b.slice(0);
+      function h(i, l, s, c, v, D, x, M) {
+        s = s || [], v = v || [], x = x || [];
+        var I = v.slice(0);
         if (typeof D < "u" && D !== null) {
           if (c) {
-            if (typeof c == "function" && c(N, D))
+            if (typeof c == "function" && c(I, D))
               return;
             if (typeof c == "object") {
-              if (c.prefilter && c.prefilter(N, D))
+              if (c.prefilter && c.prefilter(I, D))
                 return;
               if (c.normalize) {
-                var H = c.normalize(N, D, i, l);
-                H && (i = H[0], l = H[1]);
+                var U = c.normalize(I, D, i, l);
+                U && (i = U[0], l = U[1]);
               }
             }
           }
-          N.push(D);
+          I.push(D);
         }
-        A(i) === "regexp" && A(l) === "regexp" && (i = i.toString(), l = l.toString());
-        var J = typeof i, ne = typeof l, a, T, _, S, q = J !== "undefined" || x && x.length > 0 && x[x.length - 1].lhs && Object.getOwnPropertyDescriptor(x[x.length - 1].lhs, D), $ = ne !== "undefined" || x && x.length > 0 && x[x.length - 1].rhs && Object.getOwnPropertyDescriptor(x[x.length - 1].rhs, D);
+        C(i) === "regexp" && C(l) === "regexp" && (i = i.toString(), l = l.toString());
+        var J = typeof i, ne = typeof l, a, T, _, j, q = J !== "undefined" || x && x.length > 0 && x[x.length - 1].lhs && Object.getOwnPropertyDescriptor(x[x.length - 1].lhs, D), $ = ne !== "undefined" || x && x.length > 0 && x[x.length - 1].rhs && Object.getOwnPropertyDescriptor(x[x.length - 1].rhs, D);
         if (!q && $)
-          s.push(new f(N, l));
+          s.push(new f(I, l));
         else if (!$ && q)
-          s.push(new p(N, i));
-        else if (A(i) !== A(l))
-          s.push(new d(N, i, l));
-        else if (A(i) === "date" && i - l !== 0)
-          s.push(new d(N, i, l));
+          s.push(new p(I, i));
+        else if (C(i) !== C(l))
+          s.push(new d(I, i, l));
+        else if (C(i) === "date" && i - l !== 0)
+          s.push(new d(I, i, l));
         else if (J === "object" && i !== null && l !== null) {
           for (a = x.length - 1; a > -1; --a)
             if (x[a].lhs === i) {
-              S = !0;
+              j = !0;
               break;
             }
-          if (S)
-            i !== l && s.push(new d(N, i, l));
+          if (j)
+            i !== l && s.push(new d(I, i, l));
           else {
             if (x.push({ lhs: i, rhs: l }), Array.isArray(i)) {
-              for (M && (i.sort(function(j, Y) {
-                return E(j) - E(Y);
-              }), l.sort(function(j, Y) {
-                return E(j) - E(Y);
+              for (M && (i.sort(function(S, Y) {
+                return P(S) - P(Y);
+              }), l.sort(function(S, Y) {
+                return P(S) - P(Y);
               })), a = l.length - 1, T = i.length - 1; a > T; )
-                s.push(new y(N, a, new f(void 0, l[a--])));
+                s.push(new y(I, a, new f(void 0, l[a--])));
               for (; T > a; )
-                s.push(new y(N, T, new p(void 0, i[T--])));
+                s.push(new y(I, T, new p(void 0, i[T--])));
               for (; a >= 0; --a)
-                h(i[a], l[a], s, c, N, a, x, M);
+                h(i[a], l[a], s, c, I, a, x, M);
             } else {
               var B = Object.keys(i), K = Object.keys(l);
               for (a = 0; a < B.length; ++a)
-                _ = B[a], S = K.indexOf(_), S >= 0 ? (h(i[_], l[_], s, c, N, _, x, M), K[S] = null) : h(i[_], void 0, s, c, N, _, x, M);
+                _ = B[a], j = K.indexOf(_), j >= 0 ? (h(i[_], l[_], s, c, I, _, x, M), K[j] = null) : h(i[_], void 0, s, c, I, _, x, M);
               for (a = 0; a < K.length; ++a)
-                _ = K[a], _ && h(void 0, l[_], s, c, N, _, x, M);
+                _ = K[a], _ && h(void 0, l[_], s, c, I, _, x, M);
             }
             x.length = x.length - 1;
           }
-        } else i !== l && (J === "number" && isNaN(i) && isNaN(l) || s.push(new d(N, i, l)));
+        } else i !== l && (J === "number" && isNaN(i) && isNaN(l) || s.push(new d(I, i, l)));
       }
-      function g(i, l, s, c, b) {
+      function w(i, l, s, c, v) {
         var D = [];
-        if (h(i, l, D, c, null, null, null, b), s)
+        if (h(i, l, D, c, null, null, null, v), s)
           for (var x = 0; x < D.length; ++x)
             s(D[x]);
         return D;
       }
-      function C(i, l, s, c, b, D, x) {
-        return h(i, l, s, c, b, D, x, !0);
+      function A(i, l, s, c, v, D, x) {
+        return h(i, l, s, c, v, D, x, !0);
       }
-      function P(i, l, s, c) {
-        var b = c ? function(x) {
+      function R(i, l, s, c) {
+        var v = c ? function(x) {
           x && c.push(x);
-        } : void 0, D = g(i, l, b, s);
+        } : void 0, D = w(i, l, v, s);
         return c || (D.length ? D : void 0);
       }
-      function v(i, l, s, c) {
-        var b = c ? function(x) {
+      function b(i, l, s, c) {
+        var v = c ? function(x) {
           x && c.push(x);
-        } : void 0, D = g(i, l, b, s, !0);
+        } : void 0, D = w(i, l, v, s, !0);
         return c || (D.length ? D : void 0);
       }
-      function k(i, l, s) {
+      function g(i, l, s) {
         if (s.path && s.path.length) {
-          var c = i[l], b, D = s.path.length - 1;
-          for (b = 0; b < D; b++)
-            c = c[s.path[b]];
+          var c = i[l], v, D = s.path.length - 1;
+          for (v = 0; v < D; v++)
+            c = c[s.path[v]];
           switch (s.kind) {
             case "A":
-              k(c[s.path[b]], s.index, s.item);
+              g(c[s.path[v]], s.index, s.item);
               break;
             case "D":
-              delete c[s.path[b]];
+              delete c[s.path[v]];
               break;
             case "E":
             case "N":
-              c[s.path[b]] = s.rhs;
+              c[s.path[v]] = s.rhs;
               break;
           }
         } else
           switch (s.kind) {
             case "A":
-              k(i[l], s.index, s.item);
+              g(i[l], s.index, s.item);
               break;
             case "D":
               i = m(i, l);
@@ -834,47 +836,47 @@ function Ke() {
           }
         return i;
       }
-      function O(i, l, s) {
+      function k(i, l, s) {
         if (typeof s > "u" && l && ~r.indexOf(l.kind) && (s = l), i && s && s.kind) {
-          for (var c = i, b = -1, D = s.path ? s.path.length - 1 : 0; ++b < D; )
-            typeof c[s.path[b]] > "u" && (c[s.path[b]] = typeof s.path[b + 1] < "u" && typeof s.path[b + 1] == "number" ? [] : {}), c = c[s.path[b]];
+          for (var c = i, v = -1, D = s.path ? s.path.length - 1 : 0; ++v < D; )
+            typeof c[s.path[v]] > "u" && (c[s.path[v]] = typeof s.path[v + 1] < "u" && typeof s.path[v + 1] == "number" ? [] : {}), c = c[s.path[v]];
           switch (s.kind) {
             case "A":
-              s.path && typeof c[s.path[b]] > "u" && (c[s.path[b]] = []), k(s.path ? c[s.path[b]] : c, s.index, s.item);
+              s.path && typeof c[s.path[v]] > "u" && (c[s.path[v]] = []), g(s.path ? c[s.path[v]] : c, s.index, s.item);
               break;
             case "D":
-              delete c[s.path[b]];
+              delete c[s.path[v]];
               break;
             case "E":
             case "N":
-              c[s.path[b]] = s.rhs;
+              c[s.path[v]] = s.rhs;
               break;
           }
         }
       }
-      function R(i, l, s) {
+      function O(i, l, s) {
         if (s.path && s.path.length) {
-          var c = i[l], b, D = s.path.length - 1;
-          for (b = 0; b < D; b++)
-            c = c[s.path[b]];
+          var c = i[l], v, D = s.path.length - 1;
+          for (v = 0; v < D; v++)
+            c = c[s.path[v]];
           switch (s.kind) {
             case "A":
-              R(c[s.path[b]], s.index, s.item);
+              O(c[s.path[v]], s.index, s.item);
               break;
             case "D":
-              c[s.path[b]] = s.lhs;
+              c[s.path[v]] = s.lhs;
               break;
             case "E":
-              c[s.path[b]] = s.lhs;
+              c[s.path[v]] = s.lhs;
               break;
             case "N":
-              delete c[s.path[b]];
+              delete c[s.path[v]];
               break;
           }
         } else
           switch (s.kind) {
             case "A":
-              R(i[l], s.index, s.item);
+              O(i[l], s.index, s.item);
               break;
             case "D":
               i[l] = s.lhs;
@@ -888,66 +890,66 @@ function Ke() {
           }
         return i;
       }
-      function I(i, l, s) {
+      function N(i, l, s) {
         if (i && l && s && s.kind) {
-          var c = i, b, D;
-          for (D = s.path.length - 1, b = 0; b < D; b++)
-            typeof c[s.path[b]] > "u" && (c[s.path[b]] = {}), c = c[s.path[b]];
+          var c = i, v, D;
+          for (D = s.path.length - 1, v = 0; v < D; v++)
+            typeof c[s.path[v]] > "u" && (c[s.path[v]] = {}), c = c[s.path[v]];
           switch (s.kind) {
             case "A":
-              R(c[s.path[b]], s.index, s.item);
+              O(c[s.path[v]], s.index, s.item);
               break;
             case "D":
-              c[s.path[b]] = s.lhs;
+              c[s.path[v]] = s.lhs;
               break;
             case "E":
-              c[s.path[b]] = s.lhs;
+              c[s.path[v]] = s.lhs;
               break;
             case "N":
-              delete c[s.path[b]];
+              delete c[s.path[v]];
               break;
           }
         }
       }
-      function L(i, l, s) {
+      function F(i, l, s) {
         if (i && l) {
-          var c = function(b) {
-            (!s || s(i, l, b)) && O(i, l, b);
+          var c = function(v) {
+            (!s || s(i, l, v)) && k(i, l, v);
           };
-          g(i, l, c);
+          w(i, l, c);
         }
       }
-      return Object.defineProperties(P, {
+      return Object.defineProperties(R, {
         diff: {
-          value: P,
+          value: R,
           enumerable: !0
         },
         orderIndependentDiff: {
-          value: v,
+          value: b,
           enumerable: !0
         },
         observableDiff: {
-          value: g,
+          value: w,
           enumerable: !0
         },
         orderIndependentObservableDiff: {
-          value: C,
+          value: A,
           enumerable: !0
         },
         orderIndepHash: {
-          value: E,
+          value: P,
           enumerable: !0
         },
         applyDiff: {
-          value: L,
+          value: F,
           enumerable: !0
         },
         applyChange: {
-          value: O,
+          value: k,
           enumerable: !0
         },
         revertChange: {
-          value: I,
+          value: N,
           enumerable: !0
         },
         isConflict: {
@@ -956,80 +958,80 @@ function Ke() {
           },
           enumerable: !0
         }
-      }), P.DeepDiff = P, t && (t.DeepDiff = P), P;
+      }), R.DeepDiff = R, n && (n.DeepDiff = R), R;
     });
   }(ie)), ie.exports;
 }
-var Te = Ke(), oe = { exports: {} };
-const z = new Uint32Array(65536), Ue = (n, e) => {
-  const t = n.length, r = e.length, o = 1 << t - 1;
-  let u = -1, d = 0, f = t, p = t;
+var Te = He(), oe = { exports: {} };
+const H = new Uint32Array(65536), Ke = (t, e) => {
+  const n = t.length, r = e.length, o = 1 << n - 1;
+  let u = -1, d = 0, f = n, p = n;
   for (; p--; )
-    z[n.charCodeAt(p)] |= 1 << p;
+    H[t.charCodeAt(p)] |= 1 << p;
   for (p = 0; p < r; p++) {
-    let y = z[e.charCodeAt(p)];
+    let y = H[e.charCodeAt(p)];
     const m = y | d;
     y |= (y & u) + u ^ u, d |= ~(y | u), u &= y, d & o && f++, u & o && f--, d = d << 1 | 1, u = u << 1 | ~(m | d), d &= m;
   }
-  for (p = t; p--; )
-    z[n.charCodeAt(p)] = 0;
+  for (p = n; p--; )
+    H[t.charCodeAt(p)] = 0;
   return f;
-}, He = (n, e) => {
-  const t = e.length, r = n.length, o = [], u = [], d = Math.ceil(t / 32), f = Math.ceil(r / 32);
+}, Ue = (t, e) => {
+  const n = e.length, r = t.length, o = [], u = [], d = Math.ceil(n / 32), f = Math.ceil(r / 32);
   for (let h = 0; h < d; h++)
     u[h] = -1, o[h] = 0;
   let p = 0;
   for (; p < f - 1; p++) {
-    let h = 0, g = -1;
-    const C = p * 32, P = Math.min(32, r) + C;
-    for (let v = C; v < P; v++)
-      z[n.charCodeAt(v)] |= 1 << v;
-    for (let v = 0; v < t; v++) {
-      const k = z[e.charCodeAt(v)], O = u[v / 32 | 0] >>> v & 1, R = o[v / 32 | 0] >>> v & 1, I = k | h, L = ((k | R) & g) + g ^ g | k | R;
-      let i = h | ~(L | g), l = g & L;
-      i >>> 31 ^ O && (u[v / 32 | 0] ^= 1 << v), l >>> 31 ^ R && (o[v / 32 | 0] ^= 1 << v), i = i << 1 | O, l = l << 1 | R, g = l | ~(I | i), h = i & I;
+    let h = 0, w = -1;
+    const A = p * 32, R = Math.min(32, r) + A;
+    for (let b = A; b < R; b++)
+      H[t.charCodeAt(b)] |= 1 << b;
+    for (let b = 0; b < n; b++) {
+      const g = H[e.charCodeAt(b)], k = u[b / 32 | 0] >>> b & 1, O = o[b / 32 | 0] >>> b & 1, N = g | h, F = ((g | O) & w) + w ^ w | g | O;
+      let i = h | ~(F | w), l = w & F;
+      i >>> 31 ^ k && (u[b / 32 | 0] ^= 1 << b), l >>> 31 ^ O && (o[b / 32 | 0] ^= 1 << b), i = i << 1 | k, l = l << 1 | O, w = l | ~(N | i), h = i & N;
     }
-    for (let v = C; v < P; v++)
-      z[n.charCodeAt(v)] = 0;
+    for (let b = A; b < R; b++)
+      H[t.charCodeAt(b)] = 0;
   }
   let y = 0, m = -1;
-  const A = p * 32, w = Math.min(32, r - A) + A;
-  for (let h = A; h < w; h++)
-    z[n.charCodeAt(h)] |= 1 << h;
-  let E = r;
-  for (let h = 0; h < t; h++) {
-    const g = z[e.charCodeAt(h)], C = u[h / 32 | 0] >>> h & 1, P = o[h / 32 | 0] >>> h & 1, v = g | y, k = ((g | P) & m) + m ^ m | g | P;
-    let O = y | ~(k | m), R = m & k;
-    E += O >>> r - 1 & 1, E -= R >>> r - 1 & 1, O >>> 31 ^ C && (u[h / 32 | 0] ^= 1 << h), R >>> 31 ^ P && (o[h / 32 | 0] ^= 1 << h), O = O << 1 | C, R = R << 1 | P, m = R | ~(v | O), y = O & v;
+  const C = p * 32, E = Math.min(32, r - C) + C;
+  for (let h = C; h < E; h++)
+    H[t.charCodeAt(h)] |= 1 << h;
+  let P = r;
+  for (let h = 0; h < n; h++) {
+    const w = H[e.charCodeAt(h)], A = u[h / 32 | 0] >>> h & 1, R = o[h / 32 | 0] >>> h & 1, b = w | y, g = ((w | R) & m) + m ^ m | w | R;
+    let k = y | ~(g | m), O = m & g;
+    P += k >>> r - 1 & 1, P -= O >>> r - 1 & 1, k >>> 31 ^ A && (u[h / 32 | 0] ^= 1 << h), O >>> 31 ^ R && (o[h / 32 | 0] ^= 1 << h), k = k << 1 | A, O = O << 1 | R, m = O | ~(b | k), y = k & b;
   }
-  for (let h = A; h < w; h++)
-    z[n.charCodeAt(h)] = 0;
-  return E;
-}, Ce = (n, e) => {
-  if (n.length < e.length) {
-    const t = e;
-    e = n, n = t;
+  for (let h = C; h < E; h++)
+    H[t.charCodeAt(h)] = 0;
+  return P;
+}, Ce = (t, e) => {
+  if (t.length < e.length) {
+    const n = e;
+    e = t, t = n;
   }
-  return e.length === 0 ? n.length : n.length <= 32 ? Ue(n, e) : He(n, e);
-}, Je = (n, e) => {
-  let t = 1 / 0, r = 0;
+  return e.length === 0 ? t.length : t.length <= 32 ? Ke(t, e) : Ue(t, e);
+}, Je = (t, e) => {
+  let n = 1 / 0, r = 0;
   for (let o = 0; o < e.length; o++) {
-    const u = Ce(n, e[o]);
-    u < t && (t = u, r = o);
+    const u = Ce(t, e[o]);
+    u < n && (n = u, r = o);
   }
   return e[r];
 }, Be = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   closest: Je,
   distance: Ce
-}, Symbol.toStringTag, { value: "Module" })), Ve = /* @__PURE__ */ Se(Be);
+}, Symbol.toStringTag, { value: "Module" })), Ve = /* @__PURE__ */ je(Be);
 var me;
 function Ge() {
-  return me || (me = 1, function(n, e) {
+  return me || (me = 1, function(t, e) {
     (function() {
-      var t;
+      var n;
       try {
-        t = typeof Intl < "u" && typeof Intl.Collator < "u" ? Intl.Collator("generic", { sensitivity: "base" }) : null;
+        n = typeof Intl < "u" && typeof Intl.Collator < "u" ? Intl.Collator("generic", { sensitivity: "base" }) : null;
       } catch {
         console.log("Collator could not be initialized and wouldn't be used");
       }
@@ -1044,137 +1046,137 @@ function Ge() {
          * @return Integer the levenshtein distance (0 and above).
          */
         get: function(f, p, y) {
-          var m = y && t && y.useCollator;
+          var m = y && n && y.useCollator;
           if (m) {
-            var A = f.length, w = p.length;
-            if (A === 0) return w;
-            if (w === 0) return A;
-            var E, h, g, C, P;
-            for (g = 0; g < w; ++g)
-              o[g] = g, u[g] = p.charCodeAt(g);
-            o[w] = w;
-            var v;
-            for (g = 0; g < A; ++g) {
-              for (h = g + 1, C = 0; C < w; ++C)
-                E = h, v = t.compare(f.charAt(g), String.fromCharCode(u[C])) === 0, h = o[C] + (v ? 0 : 1), P = E + 1, h > P && (h = P), P = o[C + 1] + 1, h > P && (h = P), o[C] = E;
-              o[C] = h;
+            var C = f.length, E = p.length;
+            if (C === 0) return E;
+            if (E === 0) return C;
+            var P, h, w, A, R;
+            for (w = 0; w < E; ++w)
+              o[w] = w, u[w] = p.charCodeAt(w);
+            o[E] = E;
+            var b;
+            for (w = 0; w < C; ++w) {
+              for (h = w + 1, A = 0; A < E; ++A)
+                P = h, b = n.compare(f.charAt(w), String.fromCharCode(u[A])) === 0, h = o[A] + (b ? 0 : 1), R = P + 1, h > R && (h = R), R = o[A + 1] + 1, h > R && (h = R), o[A] = P;
+              o[A] = h;
             }
             return h;
           }
           return r.distance(f, p);
         }
       };
-      n !== null && n.exports === e ? n.exports = d : typeof self < "u" && typeof self.postMessage == "function" && typeof self.importScripts == "function" ? self.Levenshtein = d : typeof window < "u" && window !== null && (window.Levenshtein = d);
+      t !== null && t.exports === e ? t.exports = d : typeof self < "u" && typeof self.postMessage == "function" && typeof self.importScripts == "function" ? self.Levenshtein = d : typeof window < "u" && window !== null && (window.Levenshtein = d);
     })();
   }(oe, oe.exports)), oe.exports;
 }
 var Xe = Ge();
 const Ze = /* @__PURE__ */ _e(Xe);
 class Qe {
-  diff(e, t, r = {}) {
+  diff(e, n, r = {}) {
     let o;
     typeof r == "function" ? (o = r, r = {}) : "callback" in r && (o = r.callback);
-    const u = this.castInput(e, r), d = this.castInput(t, r), f = this.removeEmpty(this.tokenize(u, r)), p = this.removeEmpty(this.tokenize(d, r));
+    const u = this.castInput(e, r), d = this.castInput(n, r), f = this.removeEmpty(this.tokenize(u, r)), p = this.removeEmpty(this.tokenize(d, r));
     return this.diffWithOptionsObj(f, p, r, o);
   }
-  diffWithOptionsObj(e, t, r, o) {
+  diffWithOptionsObj(e, n, r, o) {
     var u;
-    const d = (v) => {
-      if (v = this.postProcess(v, r), o) {
+    const d = (b) => {
+      if (b = this.postProcess(b, r), o) {
         setTimeout(function() {
-          o(v);
+          o(b);
         }, 0);
         return;
       } else
-        return v;
-    }, f = t.length, p = e.length;
+        return b;
+    }, f = n.length, p = e.length;
     let y = 1, m = f + p;
     r.maxEditLength != null && (m = Math.min(m, r.maxEditLength));
-    const A = (u = r.timeout) !== null && u !== void 0 ? u : 1 / 0, w = Date.now() + A, E = [{ oldPos: -1, lastComponent: void 0 }];
-    let h = this.extractCommon(E[0], t, e, 0, r);
-    if (E[0].oldPos + 1 >= p && h + 1 >= f)
-      return d(this.buildValues(E[0].lastComponent, t, e));
-    let g = -1 / 0, C = 1 / 0;
-    const P = () => {
-      for (let v = Math.max(g, -y); v <= Math.min(C, y); v += 2) {
-        let k;
-        const O = E[v - 1], R = E[v + 1];
-        O && (E[v - 1] = void 0);
-        let I = !1;
-        if (R) {
-          const i = R.oldPos - v;
-          I = R && 0 <= i && i < f;
+    const C = (u = r.timeout) !== null && u !== void 0 ? u : 1 / 0, E = Date.now() + C, P = [{ oldPos: -1, lastComponent: void 0 }];
+    let h = this.extractCommon(P[0], n, e, 0, r);
+    if (P[0].oldPos + 1 >= p && h + 1 >= f)
+      return d(this.buildValues(P[0].lastComponent, n, e));
+    let w = -1 / 0, A = 1 / 0;
+    const R = () => {
+      for (let b = Math.max(w, -y); b <= Math.min(A, y); b += 2) {
+        let g;
+        const k = P[b - 1], O = P[b + 1];
+        k && (P[b - 1] = void 0);
+        let N = !1;
+        if (O) {
+          const i = O.oldPos - b;
+          N = O && 0 <= i && i < f;
         }
-        const L = O && O.oldPos + 1 < p;
-        if (!I && !L) {
-          E[v] = void 0;
+        const F = k && k.oldPos + 1 < p;
+        if (!N && !F) {
+          P[b] = void 0;
           continue;
         }
-        if (!L || I && O.oldPos < R.oldPos ? k = this.addToPath(R, !0, !1, 0, r) : k = this.addToPath(O, !1, !0, 1, r), h = this.extractCommon(k, t, e, v, r), k.oldPos + 1 >= p && h + 1 >= f)
-          return d(this.buildValues(k.lastComponent, t, e)) || !0;
-        E[v] = k, k.oldPos + 1 >= p && (C = Math.min(C, v - 1)), h + 1 >= f && (g = Math.max(g, v + 1));
+        if (!F || N && k.oldPos < O.oldPos ? g = this.addToPath(O, !0, !1, 0, r) : g = this.addToPath(k, !1, !0, 1, r), h = this.extractCommon(g, n, e, b, r), g.oldPos + 1 >= p && h + 1 >= f)
+          return d(this.buildValues(g.lastComponent, n, e)) || !0;
+        P[b] = g, g.oldPos + 1 >= p && (A = Math.min(A, b - 1)), h + 1 >= f && (w = Math.max(w, b + 1));
       }
       y++;
     };
     if (o)
-      (function v() {
+      (function b() {
         setTimeout(function() {
-          if (y > m || Date.now() > w)
+          if (y > m || Date.now() > E)
             return o(void 0);
-          P() || v();
+          R() || b();
         }, 0);
       })();
     else
-      for (; y <= m && Date.now() <= w; ) {
-        const v = P();
-        if (v)
-          return v;
+      for (; y <= m && Date.now() <= E; ) {
+        const b = R();
+        if (b)
+          return b;
       }
   }
-  addToPath(e, t, r, o, u) {
+  addToPath(e, n, r, o, u) {
     const d = e.lastComponent;
-    return d && !u.oneChangePerToken && d.added === t && d.removed === r ? {
+    return d && !u.oneChangePerToken && d.added === n && d.removed === r ? {
       oldPos: e.oldPos + o,
-      lastComponent: { count: d.count + 1, added: t, removed: r, previousComponent: d.previousComponent }
+      lastComponent: { count: d.count + 1, added: n, removed: r, previousComponent: d.previousComponent }
     } : {
       oldPos: e.oldPos + o,
-      lastComponent: { count: 1, added: t, removed: r, previousComponent: d }
+      lastComponent: { count: 1, added: n, removed: r, previousComponent: d }
     };
   }
-  extractCommon(e, t, r, o, u) {
-    const d = t.length, f = r.length;
+  extractCommon(e, n, r, o, u) {
+    const d = n.length, f = r.length;
     let p = e.oldPos, y = p - o, m = 0;
-    for (; y + 1 < d && p + 1 < f && this.equals(r[p + 1], t[y + 1], u); )
+    for (; y + 1 < d && p + 1 < f && this.equals(r[p + 1], n[y + 1], u); )
       y++, p++, m++, u.oneChangePerToken && (e.lastComponent = { count: 1, previousComponent: e.lastComponent, added: !1, removed: !1 });
     return m && !u.oneChangePerToken && (e.lastComponent = { count: m, previousComponent: e.lastComponent, added: !1, removed: !1 }), e.oldPos = p, y;
   }
-  equals(e, t, r) {
-    return r.comparator ? r.comparator(e, t) : e === t || !!r.ignoreCase && e.toLowerCase() === t.toLowerCase();
+  equals(e, n, r) {
+    return r.comparator ? r.comparator(e, n) : e === n || !!r.ignoreCase && e.toLowerCase() === n.toLowerCase();
   }
   removeEmpty(e) {
-    const t = [];
+    const n = [];
     for (let r = 0; r < e.length; r++)
-      e[r] && t.push(e[r]);
-    return t;
+      e[r] && n.push(e[r]);
+    return n;
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars
-  castInput(e, t) {
+  castInput(e, n) {
     return e;
   }
   // eslint-disable-next-line @typescript-eslint/no-unused-vars
-  tokenize(e, t) {
+  tokenize(e, n) {
     return Array.from(e);
   }
   join(e) {
     return e.join("");
   }
-  postProcess(e, t) {
+  postProcess(e, n) {
     return e;
   }
   get useLongestToken() {
     return !1;
   }
-  buildValues(e, t, r) {
+  buildValues(e, n, r) {
     const o = [];
     let u;
     for (; e; )
@@ -1188,13 +1190,13 @@ class Qe {
         m.value = this.join(r.slice(y, y + m.count)), y += m.count;
       else {
         if (!m.added && this.useLongestToken) {
-          let A = t.slice(p, p + m.count);
-          A = A.map(function(w, E) {
-            const h = r[y + E];
-            return h.length > w.length ? h : w;
-          }), m.value = this.join(A);
+          let C = n.slice(p, p + m.count);
+          C = C.map(function(E, P) {
+            const h = r[y + P];
+            return h.length > E.length ? h : E;
+          }), m.value = this.join(C);
         } else
-          m.value = this.join(t.slice(p, p + m.count));
+          m.value = this.join(n.slice(p, p + m.count));
         p += m.count, m.added || (y += m.count);
       }
     }
@@ -1205,30 +1207,30 @@ class et extends Qe {
   constructor() {
     super(...arguments), this.tokenize = nt;
   }
-  equals(e, t, r) {
+  equals(e, n, r) {
     return r.ignoreWhitespace ? ((!r.newlineIsToken || !e.includes(`
-`)) && (e = e.trim()), (!r.newlineIsToken || !t.includes(`
-`)) && (t = t.trim())) : r.ignoreNewlineAtEof && !r.newlineIsToken && (e.endsWith(`
-`) && (e = e.slice(0, -1)), t.endsWith(`
-`) && (t = t.slice(0, -1))), super.equals(e, t, r);
+`)) && (e = e.trim()), (!r.newlineIsToken || !n.includes(`
+`)) && (n = n.trim())) : r.ignoreNewlineAtEof && !r.newlineIsToken && (e.endsWith(`
+`) && (e = e.slice(0, -1)), n.endsWith(`
+`) && (n = n.slice(0, -1))), super.equals(e, n, r);
   }
 }
 const tt = new et();
-function ve(n, e, t) {
-  return tt.diff(n, e, t);
+function ve(t, e, n) {
+  return tt.diff(t, e, n);
 }
-function nt(n, e) {
-  e.stripTrailingCr && (n = n.replace(/\r\n/g, `
+function nt(t, e) {
+  e.stripTrailingCr && (t = t.replace(/\r\n/g, `
 `));
-  const t = [], r = n.split(/(\n|\r\n)/);
+  const n = [], r = t.split(/(\n|\r\n)/);
   r[r.length - 1] || r.pop();
   for (let o = 0; o < r.length; o++) {
     const u = r[o];
-    o % 2 && !e.newlineIsToken ? t[t.length - 1] += u : t.push(u);
+    o % 2 && !e.newlineIsToken ? n[n.length - 1] += u : n.push(u);
   }
-  return t;
+  return n;
 }
-function be(n, e, t, r, o, u, d) {
+function be(t, e, n, r, o, u, d) {
   let f;
   d ? typeof d == "function" ? f = { callback: d } : f = d : f = {}, typeof f.context > "u" && (f.context = 4);
   const p = f.context;
@@ -1236,75 +1238,75 @@ function be(n, e, t, r, o, u, d) {
     throw new Error("newlineIsToken may not be used with patch-generation functions, only with diffing functions");
   if (f.callback) {
     const { callback: m } = f;
-    ve(t, r, Object.assign(Object.assign({}, f), { callback: (A) => {
-      const w = y(A);
-      m(w);
+    ve(n, r, Object.assign(Object.assign({}, f), { callback: (C) => {
+      const E = y(C);
+      m(E);
     } }));
   } else
-    return y(ve(t, r, f));
+    return y(ve(n, r, f));
   function y(m) {
     if (!m)
       return;
     m.push({ value: "", lines: [] });
-    function A(v) {
-      return v.map(function(k) {
-        return " " + k;
+    function C(b) {
+      return b.map(function(g) {
+        return " " + g;
       });
     }
-    const w = [];
-    let E = 0, h = 0, g = [], C = 1, P = 1;
-    for (let v = 0; v < m.length; v++) {
-      const k = m[v], O = k.lines || ot(k.value);
-      if (k.lines = O, k.added || k.removed) {
-        if (!E) {
-          const R = m[v - 1];
-          E = C, h = P, R && (g = p > 0 ? A(R.lines.slice(-p)) : [], E -= g.length, h -= g.length);
+    const E = [];
+    let P = 0, h = 0, w = [], A = 1, R = 1;
+    for (let b = 0; b < m.length; b++) {
+      const g = m[b], k = g.lines || ot(g.value);
+      if (g.lines = k, g.added || g.removed) {
+        if (!P) {
+          const O = m[b - 1];
+          P = A, h = R, O && (w = p > 0 ? C(O.lines.slice(-p)) : [], P -= w.length, h -= w.length);
         }
-        for (const R of O)
-          g.push((k.added ? "+" : "-") + R);
-        k.added ? P += O.length : C += O.length;
+        for (const O of k)
+          w.push((g.added ? "+" : "-") + O);
+        g.added ? R += k.length : A += k.length;
       } else {
-        if (E)
-          if (O.length <= p * 2 && v < m.length - 2)
-            for (const R of A(O))
-              g.push(R);
+        if (P)
+          if (k.length <= p * 2 && b < m.length - 2)
+            for (const O of C(k))
+              w.push(O);
           else {
-            const R = Math.min(O.length, p);
-            for (const L of A(O.slice(0, R)))
-              g.push(L);
-            const I = {
-              oldStart: E,
-              oldLines: C - E + R,
+            const O = Math.min(k.length, p);
+            for (const F of C(k.slice(0, O)))
+              w.push(F);
+            const N = {
+              oldStart: P,
+              oldLines: A - P + O,
               newStart: h,
-              newLines: P - h + R,
-              lines: g
+              newLines: R - h + O,
+              lines: w
             };
-            w.push(I), E = 0, h = 0, g = [];
+            E.push(N), P = 0, h = 0, w = [];
           }
-        C += O.length, P += O.length;
+        A += k.length, R += k.length;
       }
     }
-    for (const v of w)
-      for (let k = 0; k < v.lines.length; k++)
-        v.lines[k].endsWith(`
-`) ? v.lines[k] = v.lines[k].slice(0, -1) : (v.lines.splice(k + 1, 0, "\"), k++);
+    for (const b of E)
+      for (let g = 0; g < b.lines.length; g++)
+        b.lines[g].endsWith(`
+`) ? b.lines[g] = b.lines[g].slice(0, -1) : (b.lines.splice(g + 1, 0, "\"), g++);
     return {
-      oldFileName: n,
+      oldFileName: t,
       newFileName: e,
       oldHeader: o,
       newHeader: u,
-      hunks: w
+      hunks: E
     };
   }
 }
-function ue(n) {
-  if (Array.isArray(n))
-    return n.map(ue).join(`
+function ue(t) {
+  if (Array.isArray(t))
+    return t.map(ue).join(`
 `);
   const e = [];
-  n.oldFileName == n.newFileName && e.push("Index: " + n.oldFileName), e.push("==================================================================="), e.push("--- " + n.oldFileName + (typeof n.oldHeader > "u" ? "" : "	" + n.oldHeader)), e.push("+++ " + n.newFileName + (typeof n.newHeader > "u" ? "" : "	" + n.newHeader));
-  for (let t = 0; t < n.hunks.length; t++) {
-    const r = n.hunks[t];
+  t.oldFileName == t.newFileName && e.push("Index: " + t.oldFileName), e.push("==================================================================="), e.push("--- " + t.oldFileName + (typeof t.oldHeader > "u" ? "" : "	" + t.oldHeader)), e.push("+++ " + t.newFileName + (typeof t.newHeader > "u" ? "" : "	" + t.newHeader));
+  for (let n = 0; n < t.hunks.length; n++) {
+    const r = t.hunks[n];
     r.oldLines === 0 && (r.oldStart -= 1), r.newLines === 0 && (r.newStart -= 1), e.push("@@ -" + r.oldStart + "," + r.oldLines + " +" + r.newStart + "," + r.newLines + " @@");
     for (const o of r.lines)
       e.push(o);
@@ -1313,38 +1315,38 @@ function ue(n) {
 `) + `
 `;
 }
-function rt(n, e, t, r, o, u, d) {
+function rt(t, e, n, r, o, u, d) {
   if (typeof d == "function" && (d = { callback: d }), d?.callback) {
     const { callback: f } = d;
-    be(n, e, t, r, o, u, Object.assign(Object.assign({}, d), { callback: (p) => {
+    be(t, e, n, r, o, u, Object.assign(Object.assign({}, d), { callback: (p) => {
       f(p ? ue(p) : void 0);
     } }));
   } else {
-    const f = be(n, e, t, r, o, u, d);
+    const f = be(t, e, n, r, o, u, d);
     return f ? ue(f) : void 0;
   }
 }
-function ot(n) {
-  const e = n.endsWith(`
-`), t = n.split(`
+function ot(t) {
+  const e = t.endsWith(`
+`), n = t.split(`
 `).map((r) => r + `
 `);
-  return e ? t.pop() : t.push(t.pop().slice(0, -1)), t;
+  return e ? n.pop() : n.push(n.pop().slice(0, -1)), n;
 }
-function it(n, e, t = "git", r = 3) {
-  switch (t) {
+function it(t, e, n = "git", r = 3) {
+  switch (n) {
     case "git":
-      return ye(n, e, r);
+      return ye(t, e, r);
     case "object":
-      return st(n, e);
+      return st(t, e);
     case "json":
-      return at(n, e);
+      return at(t, e);
     default:
-      return ye(n, e, r);
+      return ye(t, e, r);
   }
 }
-function ye(n, e, t = 3) {
-  const r = ge(n), o = ge(e);
+function ye(t, e, n = 3) {
+  const r = ge(t), o = ge(e);
   return rt(
     /* oldFilename */
     "",
@@ -1356,48 +1358,48 @@ function ye(n, e, t = 3) {
     "",
     /* newHeader   */
     "",
-    { context: t }
+    { context: n }
   ).split(`
 `).slice(2).join(`
 `);
 }
-function st(n, e) {
-  const t = Te.diff(n, e) || [];
-  return JSON.stringify(t, null, 2);
+function st(t, e) {
+  const n = Te.diff(t, e) || [];
+  return JSON.stringify(n, null, 2);
 }
-function at(n, e) {
+function at(t, e) {
   return JSON.stringify(
     {
-      before: n,
+      before: t,
       after: e
     },
     null,
     2
   );
 }
-function lt(n, e) {
-  return typeof n == "string" && typeof e == "string" ? Oe(n, e) : typeof n == "number" && typeof e == "number" ? Re(n, e) : ut(n, e);
+function lt(t, e) {
+  return typeof t == "string" && typeof e == "string" ? Oe(t, e) : typeof t == "number" && typeof e == "number" ? Re(t, e) : ut(t, e);
 }
-function Oe(n, e) {
-  if (n === e) return 0;
-  if (n.length === 0 || e.length === 0) return 1;
-  const t = Ze.get(n, e), r = Math.max(n.length, e.length);
-  return t / r;
+function Oe(t, e) {
+  if (t === e) return 0;
+  if (t.length === 0 || e.length === 0) return 1;
+  const n = Ze.get(t, e), r = Math.max(t.length, e.length);
+  return n / r;
 }
-function Re(n, e) {
-  if (n === e) return 0;
-  if (n === 0) return 1;
-  const t = Math.abs(e - n), r = Math.max(Math.abs(n), Math.abs(e));
-  return Math.min(t / r, 1);
+function Re(t, e) {
+  if (t === e) return 0;
+  if (t === 0) return 1;
+  const n = Math.abs(e - t), r = Math.max(Math.abs(t), Math.abs(e));
+  return Math.min(n / r, 1);
 }
-function ut(n, e) {
-  if (n === e) return 0;
-  const t = Te.diff(n, e) || [];
-  if (t.length === 0) return 0;
-  const r = we(n), o = we(e), u = Math.max(r, o);
+function ut(t, e) {
+  if (t === e) return 0;
+  const n = Te.diff(t, e) || [];
+  if (n.length === 0) return 0;
+  const r = we(t), o = we(e), u = Math.max(r, o);
   if (u === 0) return 0;
   let d = 0;
-  for (const f of t)
+  for (const f of n)
     switch (f.kind) {
       case "N":
         d += 1;
@@ -1427,92 +1429,106 @@ function ut(n, e) {
     }
   return Math.min(d / u, 1);
 }
-function we(n) {
-  if (n == null) return 0;
-  if (typeof n != "object") return 1;
-  if (Array.isArray(n)) return n.length;
+function we(t) {
+  if (t == null) return 0;
+  if (typeof t != "object") return 1;
+  if (Array.isArray(t)) return t.length;
   let e = 0;
-  for (const t in n)
-    Object.prototype.hasOwnProperty.call(n, t) && (e += 1);
+  for (const n in t)
+    Object.prototype.hasOwnProperty.call(t, n) && (e += 1);
   return e;
 }
-function ge(n) {
+function ge(t) {
   try {
     return JSON.stringify(
-      n,
-      (e, t) => typeof t == "function" ? "[Function]" : t === void 0 ? "[undefined]" : t === 1 / 0 ? "[Infinity]" : Number.isNaN(t) ? "[NaN]" : t,
+      t,
+      (e, n) => typeof n == "function" ? "[Function]" : n === void 0 ? "[undefined]" : n === 1 / 0 ? "[Infinity]" : Number.isNaN(n) ? "[NaN]" : n,
       2
     );
   } catch {
-    return String(n);
+    return String(t);
   }
 }
-function ct(n, e, t) {
-  const r = Pe(), o = t?.onFeedback || r, u = t?.debounceMs ?? 1500, d = t?.diffType ?? "git", f = t?.compareWith, p = t?.default_trigger_name ?? "auto_state_change", y = U(n), m = U(n), A = U(!0), w = U(null), E = U(void 0), h = W(
-    (C, P, v) => {
-      const k = lt(C, P), O = it(C, P, d);
-      let R;
-      t?.vote ? typeof t.vote == "function" ? R = t.vote(C, P, k) : R = t.vote : R = k > 0.5 ? "downvote" : "upvote";
-      const I = typeof e == "function" ? e(P) : e;
+function ct(t, e, n) {
+  const r = Pe(), o = n?.onFeedback || r, u = n?.debounceMs ?? 1500, d = n?.diffType ?? "git", f = n?.compareWith, p = n?.default_trigger_name ?? "auto_state_change", y = n?.ignoreInitialNullish ?? !0, m = z(t), C = z(t), E = z(!0), P = z(t), h = z(
+    t != null
+    // != null catches both null and undefined
+  ), w = z(null), A = z(void 0), R = W(
+    (g, k, O) => {
+      const N = lt(g, k), F = it(g, k, d);
+      let i;
+      n?.vote ? typeof n.vote == "function" ? i = n.vote(g, k, N) : i = n.vote : i = N > 0.5 ? "downvote" : "upvote";
+      const l = typeof e == "function" ? e(k) : e;
       o({
-        tx_id: I,
-        vote: R,
-        explanation: `State change with diff percentage: ${(k * 100).toFixed(1)}%`,
-        correction: O,
+        tx_id: l,
+        vote: i,
+        explanation: `State change with diff percentage: ${(N * 100).toFixed(1)}%`,
+        correction: F,
         source: "IMPLICIT",
-        extra_metadata: t?.metadata,
-        trigger_name: v
+        extra_metadata: n?.metadata,
+        trigger_name: O
       });
     },
-    [t, e, d, o]
-  ), g = W(
-    (C) => {
-      const P = C || p;
-      if (w.current && E.current && E.current !== P) {
+    [n, e, d, o]
+  ), b = W(
+    (g) => {
+      const k = g || p;
+      if (w.current && A.current && A.current !== k) {
         clearTimeout(w.current);
-        const v = m.current;
-        h(
-          v,
-          n,
-          E.current
+        const O = C.current;
+        R(
+          O,
+          t,
+          A.current
         ), w.current = null;
       }
-      E.current = P;
+      A.current = k;
     },
-    [n, p, h]
+    [t, p, R]
   );
-  return ke(() => {
-    if (A.current) {
-      A.current = !1, y.current = n, m.current = n;
+  return Ee(() => {
+    if (E.current) {
+      E.current = !1, m.current = t, C.current = t;
       return;
     }
-    const C = y.current;
-    return (f ? f(C, n) : JSON.stringify(C) === JSON.stringify(n)) || (w.current || (m.current = C), w.current && clearTimeout(w.current), y.current = n, w.current = setTimeout(() => {
-      const v = m.current, k = n;
-      h(
-        v,
-        k,
-        E.current || p
-      ), m.current = k, w.current = null;
-    }, u)), () => {
+    const g = m.current;
+    if (!(f ? f(g, t) : JSON.stringify(g) === JSON.stringify(t))) {
+      const O = y && P.current == null && // Initial state was nullish
+      !h.current && // We haven't had non-nullish state before
+      t != null;
+      if (t != null && (h.current = !0), O) {
+        m.current = t, C.current = t;
+        return;
+      }
+      w.current || (C.current = g), w.current && clearTimeout(w.current), m.current = t, w.current = setTimeout(() => {
+        const N = C.current, F = t;
+        R(
+          N,
+          F,
+          A.current || p
+        ), C.current = F, w.current = null;
+      }, u);
+    }
+    return () => {
       w.current && clearTimeout(w.current);
     };
   }, [
-    n,
-    e,
     t,
+    e,
+    n,
     o,
     d,
     u,
     f,
     p,
-    h
+    y,
+    R
   ]), {
-    notifyChange: g
+    notifyChange: b
   };
 }
-function vt(n, e, t) {
-  const [r, o] = X(n), { notifyChange: u } = ct(r, e, t), d = W(
+function vt(t, e, n) {
+  const [r, o] = X(t), { notifyChange: u } = ct(r, e, n), d = W(
     (f, p) => {
       u(p), o((y) => typeof f == "function" ? f(y) : f);
     },
@@ -1530,20 +1546,20 @@ let ft = () => {
   }
 };
 function bt() {
-  const { trace: n, context: e } = ft();
+  const { trace: t, context: e } = ft();
   try {
-    const t = n.getSpanContext(e.active());
-    if (t?.traceId)
-      return t.traceId;
-    const r = n.getSpan(e.active());
+    const n = t.getSpanContext(e.active());
+    if (n?.traceId)
+      return n.traceId;
+    const r = t.getSpan(e.active());
     if (r) {
       const o = r.spanContext();
       if (o.traceId)
         return o.traceId;
     }
-  } catch (t) {
+  } catch (n) {
     throw new Error(
-      `Failed to extract OpenTelemetry trace ID: ${t instanceof Error ? t.message : "Unknown error"}`
+      `Failed to extract OpenTelemetry trace ID: ${n instanceof Error ? n.message : "Unknown error"}`
     );
   }
   throw new Error(