@coinbase/cdp-core 0.0.92 → 0.0.93

package/dist/native/index.native202.js

@@ -1,37 +1,41 @@
-var o, u;
-function c() {
-  if (u) return o;
-  u = 1;
-  var t = {
-    // UTF-8 encoding
-    utf8: {
-      // Convert a string to a byte array
-      stringToBytes: function(n) {
-        return t.bin.stringToBytes(unescape(encodeURIComponent(n)));
-      },
-      // Convert a byte array to a string
-      bytesToString: function(n) {
-        return decodeURIComponent(escape(t.bin.bytesToString(n)));
+import { __module as h } from "./index.native203.js";
+import { __require as S } from "./index.native204.js";
+import { __require as q } from "./index.native205.js";
+import { __require as w } from "./index.native206.js";
+var x;
+function G() {
+  return x ? h.exports : (x = 1, function() {
+    var v = S(), p = q().utf8, B = w(), F = q().bin, d = function(o, f) {
+      o.constructor == String ? f && f.encoding === "binary" ? o = F.stringToBytes(o) : o = p.stringToBytes(o) : B(o) ? o = Array.prototype.slice.call(o, 0) : !Array.isArray(o) && o.constructor !== Uint8Array && (o = o.toString());
+      for (var u = v.bytesToWords(o), a = o.length * 8, n = 1732584193, r = -271733879, i = -1732584194, t = 271733878, e = 0; e < u.length; e++)
+        u[e] = (u[e] << 8 | u[e] >>> 24) & 16711935 | (u[e] << 24 | u[e] >>> 8) & 4278255360;
+      u[a >>> 5] |= 128 << a % 32, u[(a + 64 >>> 9 << 4) + 14] = a;
+      for (var _ = d._ff, c = d._gg, l = d._hh, y = d._ii, e = 0; e < u.length; e += 16) {
+        var T = n, b = r, A = i, I = t;
+        n = _(n, r, i, t, u[e + 0], 7, -680876936), t = _(t, n, r, i, u[e + 1], 12, -389564586), i = _(i, t, n, r, u[e + 2], 17, 606105819), r = _(r, i, t, n, u[e + 3], 22, -1044525330), n = _(n, r, i, t, u[e + 4], 7, -176418897), t = _(t, n, r, i, u[e + 5], 12, 1200080426), i = _(i, t, n, r, u[e + 6], 17, -1473231341), r = _(r, i, t, n, u[e + 7], 22, -45705983), n = _(n, r, i, t, u[e + 8], 7, 1770035416), t = _(t, n, r, i, u[e + 9], 12, -1958414417), i = _(i, t, n, r, u[e + 10], 17, -42063), r = _(r, i, t, n, u[e + 11], 22, -1990404162), n = _(n, r, i, t, u[e + 12], 7, 1804603682), t = _(t, n, r, i, u[e + 13], 12, -40341101), i = _(i, t, n, r, u[e + 14], 17, -1502002290), r = _(r, i, t, n, u[e + 15], 22, 1236535329), n = c(n, r, i, t, u[e + 1], 5, -165796510), t = c(t, n, r, i, u[e + 6], 9, -1069501632), i = c(i, t, n, r, u[e + 11], 14, 643717713), r = c(r, i, t, n, u[e + 0], 20, -373897302), n = c(n, r, i, t, u[e + 5], 5, -701558691), t = c(t, n, r, i, u[e + 10], 9, 38016083), i = c(i, t, n, r, u[e + 15], 14, -660478335), r = c(r, i, t, n, u[e + 4], 20, -405537848), n = c(n, r, i, t, u[e + 9], 5, 568446438), t = c(t, n, r, i, u[e + 14], 9, -1019803690), i = c(i, t, n, r, u[e + 3], 14, -187363961), r = c(r, i, t, n, u[e + 8], 20, 1163531501), n = c(n, r, i, t, u[e + 13], 5, -1444681467), t = c(t, n, r, i, u[e + 2], 9, -51403784), i = c(i, t, n, r, u[e + 7], 14, 1735328473), r = c(r, i, t, n, u[e + 12], 20, -1926607734), n = l(n, r, i, t, u[e + 5], 4, -378558), t = l(t, n, r, i, u[e + 8], 11, -2022574463), i = l(i, t, n, r, u[e + 11], 16, 1839030562), r = l(r, i, t, n, u[e + 14], 23, -35309556), n = l(n, r, i, t, u[e + 1], 4, -1530992060), t = l(t, n, r, i, u[e + 4], 11, 1272893353), i = l(i, t, n, r, u[e + 7], 16, -155497632), r = l(r, i, t, n, u[e + 10], 23, -1094730640), n = l(n, r, i, t, u[e + 13], 4, 681279174), t = l(t, n, r, i, u[e + 0], 11, -358537222), i = l(i, t, n, r, u[e + 3], 16, -722521979), r = l(r, i, t, n, u[e + 6], 23, 76029189), n = l(n, r, i, t, u[e + 9], 4, -640364487), t = l(t, n, r, i, u[e + 12], 11, -421815835), i = l(i, t, n, r, u[e + 15], 16, 530742520), r = l(r, i, t, n, u[e + 2], 23, -995338651), n = y(n, r, i, t, u[e + 0], 6, -198630844), t = y(t, n, r, i, u[e + 7], 10, 1126891415), i = y(i, t, n, r, u[e + 14], 15, -1416354905), r = y(r, i, t, n, u[e + 5], 21, -57434055), n = y(n, r, i, t, u[e + 12], 6, 1700485571), t = y(t, n, r, i, u[e + 3], 10, -1894986606), i = y(i, t, n, r, u[e + 10], 15, -1051523), r = y(r, i, t, n, u[e + 1], 21, -2054922799), n = y(n, r, i, t, u[e + 8], 6, 1873313359), t = y(t, n, r, i, u[e + 15], 10, -30611744), i = y(i, t, n, r, u[e + 6], 15, -1560198380), r = y(r, i, t, n, u[e + 13], 21, 1309151649), n = y(n, r, i, t, u[e + 4], 6, -145523070), t = y(t, n, r, i, u[e + 11], 10, -1120210379), i = y(i, t, n, r, u[e + 2], 15, 718787259), r = y(r, i, t, n, u[e + 9], 21, -343485551), n = n + T >>> 0, r = r + b >>> 0, i = i + A >>> 0, t = t + I >>> 0;
       }
-    },
-    // Binary encoding
-    bin: {
-      // Convert a string to a byte array
-      stringToBytes: function(n) {
-        for (var e = [], r = 0; r < n.length; r++)
-          e.push(n.charCodeAt(r) & 255);
-        return e;
-      },
-      // Convert a byte array to a string
-      bytesToString: function(n) {
-        for (var e = [], r = 0; r < n.length; r++)
-          e.push(String.fromCharCode(n[r]));
-        return e.join("");
-      }
-    }
-  };
-  return o = t, o;
+      return v.endian([n, r, i, t]);
+    };
+    d._ff = function(o, f, u, a, n, r, i) {
+      var t = o + (f & u | ~f & a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._gg = function(o, f, u, a, n, r, i) {
+      var t = o + (f & a | u & ~a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._hh = function(o, f, u, a, n, r, i) {
+      var t = o + (f ^ u ^ a) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._ii = function(o, f, u, a, n, r, i) {
+      var t = o + (u ^ (f | ~a)) + (n >>> 0) + i;
+      return (t << r | t >>> 32 - r) + f;
+    }, d._blocksize = 16, d._digestsize = 16, h.exports = function(o, f) {
+      if (o == null)
+        throw new Error("Illegal argument " + o);
+      var u = v.wordsToBytes(d(o, f));
+      return f && f.asBytes ? u : f && f.asString ? F.bytesToString(u) : v.bytesToHex(u);
+    };
+  }(), h.exports);
 }
 export {
-  c as __require
+  G as __require
 };

package/dist/native/index.native203.js

@@ -1,23 +1,4 @@
-/*!
- * Determine if an object is a Buffer
- *
- * @author   Feross Aboukhadijeh <https://feross.org>
- * @license  MIT
- */
-var f, e;
-function t() {
-  if (e) return f;
-  e = 1, f = function(r) {
-    return r != null && (u(r) || n(r) || !!r._isBuffer);
-  };
-  function u(r) {
-    return !!r.constructor && typeof r.constructor.isBuffer == "function" && r.constructor.isBuffer(r);
-  }
-  function n(r) {
-    return typeof r.readFloatLE == "function" && typeof r.slice == "function" && u(r.slice(0, 0));
-  }
-  return f;
-}
+var e = { exports: {} };
 export {
-  t as __require
+  e as __module
 };

package/dist/native/index.native204.js

@@ -1,10 +1,72 @@
-import { __module as e } from "./index.native205.js";
-import { __require as o } from "./index.native206.js";
-import { __require as t } from "./index.native207.js";
-var r;
-function s() {
-  return r ? e.exports : (r = 1, process.env.NODE_ENV === "production" ? e.exports = o() : e.exports = t(), e.exports);
+import { __module as a } from "./index.native220.js";
+var h;
+function c() {
+  return h ? a.exports : (h = 1, function() {
+    var f = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = {
+      // Bit-wise rotation left
+      rotl: function(r, t) {
+        return r << t | r >>> 32 - t;
+      },
+      // Bit-wise rotation right
+      rotr: function(r, t) {
+        return r << 32 - t | r >>> t;
+      },
+      // Swap big-endian to little-endian and vice versa
+      endian: function(r) {
+        if (r.constructor == Number)
+          return u.rotl(r, 8) & 16711935 | u.rotl(r, 24) & 4278255360;
+        for (var t = 0; t < r.length; t++)
+          r[t] = u.endian(r[t]);
+        return r;
+      },
+      // Generate an array of any length of random bytes
+      randomBytes: function(r) {
+        for (var t = []; r > 0; r--)
+          t.push(Math.floor(Math.random() * 256));
+        return t;
+      },
+      // Convert a byte array to big-endian 32-bit words
+      bytesToWords: function(r) {
+        for (var t = [], n = 0, o = 0; n < r.length; n++, o += 8)
+          t[o >>> 5] |= r[n] << 24 - o % 32;
+        return t;
+      },
+      // Convert big-endian 32-bit words to a byte array
+      wordsToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length * 32; n += 8)
+          t.push(r[n >>> 5] >>> 24 - n % 32 & 255);
+        return t;
+      },
+      // Convert a byte array to a hex string
+      bytesToHex: function(r) {
+        for (var t = [], n = 0; n < r.length; n++)
+          t.push((r[n] >>> 4).toString(16)), t.push((r[n] & 15).toString(16));
+        return t.join("");
+      },
+      // Convert a hex string to a byte array
+      hexToBytes: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 2)
+          t.push(parseInt(r.substr(n, 2), 16));
+        return t;
+      },
+      // Convert a byte array to a base-64 string
+      bytesToBase64: function(r) {
+        for (var t = [], n = 0; n < r.length; n += 3)
+          for (var o = r[n] << 16 | r[n + 1] << 8 | r[n + 2], e = 0; e < 4; e++)
+            n * 8 + e * 6 <= r.length * 8 ? t.push(f.charAt(o >>> 6 * (3 - e) & 63)) : t.push("=");
+        return t.join("");
+      },
+      // Convert a base-64 string to a byte array
+      base64ToBytes: function(r) {
+        r = r.replace(/[^A-Z0-9+\/]/ig, "");
+        for (var t = [], n = 0, o = 0; n < r.length; o = ++n % 4)
+          o != 0 && t.push((f.indexOf(r.charAt(n - 1)) & Math.pow(2, -2 * o + 8) - 1) << o * 2 | f.indexOf(r.charAt(n)) >>> 6 - o * 2);
+        return t;
+      }
+    };
+    a.exports = u;
+  }(), a.exports);
 }
 export {
-  s as __require
+  c as __require
 };

package/dist/native/index.native205.js

@@ -1,4 +1,37 @@
-var e = { exports: {} };
+var o, u;
+function c() {
+  if (u) return o;
+  u = 1;
+  var t = {
+    // UTF-8 encoding
+    utf8: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        return t.bin.stringToBytes(unescape(encodeURIComponent(n)));
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        return decodeURIComponent(escape(t.bin.bytesToString(n)));
+      }
+    },
+    // Binary encoding
+    bin: {
+      // Convert a string to a byte array
+      stringToBytes: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(n.charCodeAt(r) & 255);
+        return e;
+      },
+      // Convert a byte array to a string
+      bytesToString: function(n) {
+        for (var e = [], r = 0; r < n.length; r++)
+          e.push(String.fromCharCode(n[r]));
+        return e.join("");
+      }
+    }
+  };
+  return o = t, o;
+}
 export {
-  e as __module
+  c as __require
 };

package/dist/native/index.native206.js

@@ -1,380 +1,23 @@
-import { __exports as o } from "./index.native225.js";
-/**
-* @license React
-* react.production.js
-*
-* Copyright (c) Meta Platforms, Inc. and affiliates.
-*
-* This source code is licensed under the MIT license found in the
-* LICENSE file in the root directory of this source tree.
-*/
-var $;
-function X() {
-  if ($) return o;
-  $ = 1;
-  var E = Symbol.for("react.transitional.element"), N = Symbol.for("react.portal"), M = Symbol.for("react.fragment"), Y = Symbol.for("react.strict_mode"), I = Symbol.for("react.profiler"), L = Symbol.for("react.consumer"), U = Symbol.for("react.context"), k = Symbol.for("react.forward_ref"), x = Symbol.for("react.suspense"), b = Symbol.for("react.memo"), d = Symbol.for("react.lazy"), C = Symbol.iterator;
-  function D(t) {
-    return t === null || typeof t != "object" ? null : (t = C && t[C] || t["@@iterator"], typeof t == "function" ? t : null);
-  }
-  var w = {
-    isMounted: function() {
-      return !1;
-    },
-    enqueueForceUpdate: function() {
-    },
-    enqueueReplaceState: function() {
-    },
-    enqueueSetState: function() {
-    }
-  }, A = Object.assign, S = {};
-  function _(t, e, n) {
-    this.props = t, this.context = e, this.refs = S, this.updater = n || w;
-  }
-  _.prototype.isReactComponent = {}, _.prototype.setState = function(t, e) {
-    if (typeof t != "object" && typeof t != "function" && t != null)
-      throw Error(
-        "takes an object of state variables to update or a function which returns an object of state variables."
-      );
-    this.updater.enqueueSetState(this, t, e, "setState");
-  }, _.prototype.forceUpdate = function(t) {
-    this.updater.enqueueForceUpdate(this, t, "forceUpdate");
+/*!
+ * Determine if an object is a Buffer
+ *
+ * @author   Feross Aboukhadijeh <https://feross.org>
+ * @license  MIT
+ */
+var f, e;
+function t() {
+  if (e) return f;
+  e = 1, f = function(r) {
+    return r != null && (u(r) || n(r) || !!r._isBuffer);
   };
-  function h() {
-  }
-  h.prototype = _.prototype;
-  function y(t, e, n) {
-    this.props = t, this.context = e, this.refs = S, this.updater = n || w;
-  }
-  var v = y.prototype = new h();
-  v.constructor = y, A(v, _.prototype), v.isPureReactComponent = !0;
-  var g = Array.isArray, i = { H: null, A: null, T: null, S: null, V: null }, O = Object.prototype.hasOwnProperty;
-  function R(t, e, n, r, s, f) {
-    return n = f.ref, {
-      $$typeof: E,
-      type: t,
-      key: e,
-      ref: n !== void 0 ? n : null,
-      props: f
-    };
-  }
-  function q(t, e) {
-    return R(
-      t.type,
-      e,
-      void 0,
-      void 0,
-      void 0,
-      t.props
-    );
-  }
-  function T(t) {
-    return typeof t == "object" && t !== null && t.$$typeof === E;
-  }
-  function z(t) {
-    var e = { "=": "=0", ":": "=2" };
-    return "$" + t.replace(/[=:]/g, function(n) {
-      return e[n];
-    });
+  function u(r) {
+    return !!r.constructor && typeof r.constructor.isBuffer == "function" && r.constructor.isBuffer(r);
   }
-  var H = /\/+/g;
-  function m(t, e) {
-    return typeof t == "object" && t !== null && t.key != null ? z("" + t.key) : e.toString(36);
-  }
-  function j() {
-  }
-  function G(t) {
-    switch (t.status) {
-      case "fulfilled":
-        return t.value;
-      case "rejected":
-        throw t.reason;
-      default:
-        switch (typeof t.status == "string" ? t.then(j, j) : (t.status = "pending", t.then(
-          function(e) {
-            t.status === "pending" && (t.status = "fulfilled", t.value = e);
-          },
-          function(e) {
-            t.status === "pending" && (t.status = "rejected", t.reason = e);
-          }
-        )), t.status) {
-          case "fulfilled":
-            return t.value;
-          case "rejected":
-            throw t.reason;
-        }
-    }
-    throw t;
-  }
-  function a(t, e, n, r, s) {
-    var f = typeof t;
-    (f === "undefined" || f === "boolean") && (t = null);
-    var u = !1;
-    if (t === null) u = !0;
-    else
-      switch (f) {
-        case "bigint":
-        case "string":
-        case "number":
-          u = !0;
-          break;
-        case "object":
-          switch (t.$$typeof) {
-            case E:
-            case N:
-              u = !0;
-              break;
-            case d:
-              return u = t._init, a(
-                u(t._payload),
-                e,
-                n,
-                r,
-                s
-              );
-          }
-      }
-    if (u)
-      return s = s(t), u = r === "" ? "." + m(t, 0) : r, g(s) ? (n = "", u != null && (n = u.replace(H, "$&/") + "/"), a(s, e, n, "", function(W) {
-        return W;
-      })) : s != null && (T(s) && (s = q(
-        s,
-        n + (s.key == null || t && t.key === s.key ? "" : ("" + s.key).replace(
-          H,
-          "$&/"
-        ) + "/") + u
-      )), e.push(s)), 1;
-    u = 0;
-    var p = r === "" ? "." : r + ":";
-    if (g(t))
-      for (var c = 0; c < t.length; c++)
-        r = t[c], f = p + m(r, c), u += a(
-          r,
-          e,
-          n,
-          f,
-          s
-        );
-    else if (c = D(t), typeof c == "function")
-      for (t = c.call(t), c = 0; !(r = t.next()).done; )
-        r = r.value, f = p + m(r, c++), u += a(
-          r,
-          e,
-          n,
-          f,
-          s
-        );
-    else if (f === "object") {
-      if (typeof t.then == "function")
-        return a(
-          G(t),
-          e,
-          n,
-          r,
-          s
-        );
-      throw e = String(t), Error(
-        "Objects are not valid as a React child (found: " + (e === "[object Object]" ? "object with keys {" + Object.keys(t).join(", ") + "}" : e) + "). If you meant to render a collection of children, use an array instead."
-      );
-    }
-    return u;
-  }
-  function l(t, e, n) {
-    if (t == null) return t;
-    var r = [], s = 0;
-    return a(t, r, "", "", function(f) {
-      return e.call(n, f, s++);
-    }), r;
-  }
-  function K(t) {
-    if (t._status === -1) {
-      var e = t._result;
-      e = e(), e.then(
-        function(n) {
-          (t._status === 0 || t._status === -1) && (t._status = 1, t._result = n);
-        },
-        function(n) {
-          (t._status === 0 || t._status === -1) && (t._status = 2, t._result = n);
-        }
-      ), t._status === -1 && (t._status = 0, t._result = e);
-    }
-    if (t._status === 1) return t._result.default;
-    throw t._result;
-  }
-  var P = typeof reportError == "function" ? reportError : function(t) {
-    if (typeof window == "object" && typeof window.ErrorEvent == "function") {
-      var e = new window.ErrorEvent("error", {
-        bubbles: !0,
-        cancelable: !0,
-        message: typeof t == "object" && t !== null && typeof t.message == "string" ? String(t.message) : String(t),
-        error: t
-      });
-      if (!window.dispatchEvent(e)) return;
-    } else if (typeof process == "object" && typeof process.emit == "function") {
-      process.emit("uncaughtException", t);
-      return;
-    }
-    console.error(t);
-  };
-  function B() {
+  function n(r) {
+    return typeof r.readFloatLE == "function" && typeof r.slice == "function" && u(r.slice(0, 0));
   }
-  return o.Children = {
-    map: l,
-    forEach: function(t, e, n) {
-      l(
-        t,
-        function() {
-          e.apply(this, arguments);
-        },
-        n
-      );
-    },
-    count: function(t) {
-      var e = 0;
-      return l(t, function() {
-        e++;
-      }), e;
-    },
-    toArray: function(t) {
-      return l(t, function(e) {
-        return e;
-      }) || [];
-    },
-    only: function(t) {
-      if (!T(t))
-        throw Error(
-          "React.Children.only expected to receive a single React element child."
-        );
-      return t;
-    }
-  }, o.Component = _, o.Fragment = M, o.Profiler = I, o.PureComponent = y, o.StrictMode = Y, o.Suspense = x, o.__CLIENT_INTERNALS_DO_NOT_USE_OR_WARN_USERS_THEY_CANNOT_UPGRADE = i, o.__COMPILER_RUNTIME = {
-    __proto__: null,
-    c: function(t) {
-      return i.H.useMemoCache(t);
-    }
-  }, o.cache = function(t) {
-    return function() {
-      return t.apply(null, arguments);
-    };
-  }, o.cloneElement = function(t, e, n) {
-    if (t == null)
-      throw Error(
-        "The argument must be a React element, but you passed " + t + "."
-      );
-    var r = A({}, t.props), s = t.key, f = void 0;
-    if (e != null)
-      for (u in e.ref !== void 0 && (f = void 0), e.key !== void 0 && (s = "" + e.key), e)
-        !O.call(e, u) || u === "key" || u === "__self" || u === "__source" || u === "ref" && e.ref === void 0 || (r[u] = e[u]);
-    var u = arguments.length - 2;
-    if (u === 1) r.children = n;
-    else if (1 < u) {
-      for (var p = Array(u), c = 0; c < u; c++)
-        p[c] = arguments[c + 2];
-      r.children = p;
-    }
-    return R(t.type, s, void 0, void 0, f, r);
-  }, o.createContext = function(t) {
-    return t = {
-      $$typeof: U,
-      _currentValue: t,
-      _currentValue2: t,
-      _threadCount: 0,
-      Provider: null,
-      Consumer: null
-    }, t.Provider = t, t.Consumer = {
-      $$typeof: L,
-      _context: t
-    }, t;
-  }, o.createElement = function(t, e, n) {
-    var r, s = {}, f = null;
-    if (e != null)
-      for (r in e.key !== void 0 && (f = "" + e.key), e)
-        O.call(e, r) && r !== "key" && r !== "__self" && r !== "__source" && (s[r] = e[r]);
-    var u = arguments.length - 2;
-    if (u === 1) s.children = n;
-    else if (1 < u) {
-      for (var p = Array(u), c = 0; c < u; c++)
-        p[c] = arguments[c + 2];
-      s.children = p;
-    }
-    if (t && t.defaultProps)
-      for (r in u = t.defaultProps, u)
-        s[r] === void 0 && (s[r] = u[r]);
-    return R(t, f, void 0, void 0, null, s);
-  }, o.createRef = function() {
-    return { current: null };
-  }, o.forwardRef = function(t) {
-    return { $$typeof: k, render: t };
-  }, o.isValidElement = T, o.lazy = function(t) {
-    return {
-      $$typeof: d,
-      _payload: { _status: -1, _result: t },
-      _init: K
-    };
-  }, o.memo = function(t, e) {
-    return {
-      $$typeof: b,
-      type: t,
-      compare: e === void 0 ? null : e
-    };
-  }, o.startTransition = function(t) {
-    var e = i.T, n = {};
-    i.T = n;
-    try {
-      var r = t(), s = i.S;
-      s !== null && s(n, r), typeof r == "object" && r !== null && typeof r.then == "function" && r.then(B, P);
-    } catch (f) {
-      P(f);
-    } finally {
-      i.T = e;
-    }
-  }, o.unstable_useCacheRefresh = function() {
-    return i.H.useCacheRefresh();
-  }, o.use = function(t) {
-    return i.H.use(t);
-  }, o.useActionState = function(t, e, n) {
-    return i.H.useActionState(t, e, n);
-  }, o.useCallback = function(t, e) {
-    return i.H.useCallback(t, e);
-  }, o.useContext = function(t) {
-    return i.H.useContext(t);
-  }, o.useDebugValue = function() {
-  }, o.useDeferredValue = function(t, e) {
-    return i.H.useDeferredValue(t, e);
-  }, o.useEffect = function(t, e, n) {
-    var r = i.H;
-    if (typeof n == "function")
-      throw Error(
-        "useEffect CRUD overload is not enabled in this build of React."
-      );
-    return r.useEffect(t, e);
-  }, o.useId = function() {
-    return i.H.useId();
-  }, o.useImperativeHandle = function(t, e, n) {
-    return i.H.useImperativeHandle(t, e, n);
-  }, o.useInsertionEffect = function(t, e) {
-    return i.H.useInsertionEffect(t, e);
-  }, o.useLayoutEffect = function(t, e) {
-    return i.H.useLayoutEffect(t, e);
-  }, o.useMemo = function(t, e) {
-    return i.H.useMemo(t, e);
-  }, o.useOptimistic = function(t, e) {
-    return i.H.useOptimistic(t, e);
-  }, o.useReducer = function(t, e, n) {
-    return i.H.useReducer(t, e, n);
-  }, o.useRef = function(t) {
-    return i.H.useRef(t);
-  }, o.useState = function(t) {
-    return i.H.useState(t);
-  }, o.useSyncExternalStore = function(t, e, n) {
-    return i.H.useSyncExternalStore(
-      t,
-      e,
-      n
-    );
-  }, o.useTransition = function() {
-    return i.H.useTransition();
-  }, o.version = "19.1.2", o;
+  return f;
 }
 export {
-  X as __require
+  t as __require
 };