@coinbase/cdp-api-client 0.0.87 → 0.0.89

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,72 +1,380 @@
1
- import { __module as a } from "./index21.js";
2
- var h;
3
- function c() {
4
- return h ? a.exports : (h = 1, function() {
5
- var f = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", u = {
6
- // Bit-wise rotation left
7
- rotl: function(r, t) {
8
- return r << t | r >>> 32 - t;
9
- },
10
- // Bit-wise rotation right
11
- rotr: function(r, t) {
12
- return r << 32 - t | r >>> t;
13
- },
14
- // Swap big-endian to little-endian and vice versa
15
- endian: function(r) {
16
- if (r.constructor == Number)
17
- return u.rotl(r, 8) & 16711935 | u.rotl(r, 24) & 4278255360;
18
- for (var t = 0; t < r.length; t++)
19
- r[t] = u.endian(r[t]);
20
- return r;
21
- },
22
- // Generate an array of any length of random bytes
23
- randomBytes: function(r) {
24
- for (var t = []; r > 0; r--)
25
- t.push(Math.floor(Math.random() * 256));
26
- return t;
27
- },
28
- // Convert a byte array to big-endian 32-bit words
29
- bytesToWords: function(r) {
30
- for (var t = [], n = 0, o = 0; n < r.length; n++, o += 8)
31
- t[o >>> 5] |= r[n] << 24 - o % 32;
32
- return t;
33
- },
34
- // Convert big-endian 32-bit words to a byte array
35
- wordsToBytes: function(r) {
36
- for (var t = [], n = 0; n < r.length * 32; n += 8)
37
- t.push(r[n >>> 5] >>> 24 - n % 32 & 255);
38
- return t;
39
- },
40
- // Convert a byte array to a hex string
41
- bytesToHex: function(r) {
42
- for (var t = [], n = 0; n < r.length; n++)
43
- t.push((r[n] >>> 4).toString(16)), t.push((r[n] & 15).toString(16));
44
- return t.join("");
45
- },
46
- // Convert a hex string to a byte array
47
- hexToBytes: function(r) {
48
- for (var t = [], n = 0; n < r.length; n += 2)
49
- t.push(parseInt(r.substr(n, 2), 16));
50
- return t;
51
- },
52
- // Convert a byte array to a base-64 string
53
- bytesToBase64: function(r) {
54
- for (var t = [], n = 0; n < r.length; n += 3)
55
- for (var o = r[n] << 16 | r[n + 1] << 8 | r[n + 2], e = 0; e < 4; e++)
56
- n * 8 + e * 6 <= r.length * 8 ? t.push(f.charAt(o >>> 6 * (3 - e) & 63)) : t.push("=");
57
- return t.join("");
58
- },
59
- // Convert a base-64 string to a byte array
60
- base64ToBytes: function(r) {
61
- r = r.replace(/[^A-Z0-9+\/]/ig, "");
62
- for (var t = [], n = 0, o = 0; n < r.length; o = ++n % 4)
63
- 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);
64
- return t;
1
+ import { __exports as o } from "./index21.js";
2
+ /**
3
+ * @license React
4
+ * react.production.js
5
+ *
6
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
7
+ *
8
+ * This source code is licensed under the MIT license found in the
9
+ * LICENSE file in the root directory of this source tree.
10
+ */
11
+ var $;
12
+ function X() {
13
+ if ($) return o;
14
+ $ = 1;
15
+ 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;
16
+ function D(t) {
17
+ return t === null || typeof t != "object" ? null : (t = C && t[C] || t["@@iterator"], typeof t == "function" ? t : null);
18
+ }
19
+ var w = {
20
+ isMounted: function() {
21
+ return !1;
22
+ },
23
+ enqueueForceUpdate: function() {
24
+ },
25
+ enqueueReplaceState: function() {
26
+ },
27
+ enqueueSetState: function() {
28
+ }
29
+ }, A = Object.assign, S = {};
30
+ function _(t, e, n) {
31
+ this.props = t, this.context = e, this.refs = S, this.updater = n || w;
32
+ }
33
+ _.prototype.isReactComponent = {}, _.prototype.setState = function(t, e) {
34
+ if (typeof t != "object" && typeof t != "function" && t != null)
35
+ throw Error(
36
+ "takes an object of state variables to update or a function which returns an object of state variables."
37
+ );
38
+ this.updater.enqueueSetState(this, t, e, "setState");
39
+ }, _.prototype.forceUpdate = function(t) {
40
+ this.updater.enqueueForceUpdate(this, t, "forceUpdate");
41
+ };
42
+ function h() {
43
+ }
44
+ h.prototype = _.prototype;
45
+ function y(t, e, n) {
46
+ this.props = t, this.context = e, this.refs = S, this.updater = n || w;
47
+ }
48
+ var v = y.prototype = new h();
49
+ v.constructor = y, A(v, _.prototype), v.isPureReactComponent = !0;
50
+ var g = Array.isArray, i = { H: null, A: null, T: null, S: null, V: null }, O = Object.prototype.hasOwnProperty;
51
+ function R(t, e, n, r, s, f) {
52
+ return n = f.ref, {
53
+ $$typeof: E,
54
+ type: t,
55
+ key: e,
56
+ ref: n !== void 0 ? n : null,
57
+ props: f
58
+ };
59
+ }
60
+ function q(t, e) {
61
+ return R(
62
+ t.type,
63
+ e,
64
+ void 0,
65
+ void 0,
66
+ void 0,
67
+ t.props
68
+ );
69
+ }
70
+ function T(t) {
71
+ return typeof t == "object" && t !== null && t.$$typeof === E;
72
+ }
73
+ function z(t) {
74
+ var e = { "=": "=0", ":": "=2" };
75
+ return "$" + t.replace(/[=:]/g, function(n) {
76
+ return e[n];
77
+ });
78
+ }
79
+ var H = /\/+/g;
80
+ function m(t, e) {
81
+ return typeof t == "object" && t !== null && t.key != null ? z("" + t.key) : e.toString(36);
82
+ }
83
+ function j() {
84
+ }
85
+ function G(t) {
86
+ switch (t.status) {
87
+ case "fulfilled":
88
+ return t.value;
89
+ case "rejected":
90
+ throw t.reason;
91
+ default:
92
+ switch (typeof t.status == "string" ? t.then(j, j) : (t.status = "pending", t.then(
93
+ function(e) {
94
+ t.status === "pending" && (t.status = "fulfilled", t.value = e);
95
+ },
96
+ function(e) {
97
+ t.status === "pending" && (t.status = "rejected", t.reason = e);
98
+ }
99
+ )), t.status) {
100
+ case "fulfilled":
101
+ return t.value;
102
+ case "rejected":
103
+ throw t.reason;
104
+ }
105
+ }
106
+ throw t;
107
+ }
108
+ function a(t, e, n, r, s) {
109
+ var f = typeof t;
110
+ (f === "undefined" || f === "boolean") && (t = null);
111
+ var u = !1;
112
+ if (t === null) u = !0;
113
+ else
114
+ switch (f) {
115
+ case "bigint":
116
+ case "string":
117
+ case "number":
118
+ u = !0;
119
+ break;
120
+ case "object":
121
+ switch (t.$$typeof) {
122
+ case E:
123
+ case N:
124
+ u = !0;
125
+ break;
126
+ case d:
127
+ return u = t._init, a(
128
+ u(t._payload),
129
+ e,
130
+ n,
131
+ r,
132
+ s
133
+ );
134
+ }
65
135
  }
136
+ if (u)
137
+ 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) {
138
+ return W;
139
+ })) : s != null && (T(s) && (s = q(
140
+ s,
141
+ n + (s.key == null || t && t.key === s.key ? "" : ("" + s.key).replace(
142
+ H,
143
+ "$&/"
144
+ ) + "/") + u
145
+ )), e.push(s)), 1;
146
+ u = 0;
147
+ var p = r === "" ? "." : r + ":";
148
+ if (g(t))
149
+ for (var c = 0; c < t.length; c++)
150
+ r = t[c], f = p + m(r, c), u += a(
151
+ r,
152
+ e,
153
+ n,
154
+ f,
155
+ s
156
+ );
157
+ else if (c = D(t), typeof c == "function")
158
+ for (t = c.call(t), c = 0; !(r = t.next()).done; )
159
+ r = r.value, f = p + m(r, c++), u += a(
160
+ r,
161
+ e,
162
+ n,
163
+ f,
164
+ s
165
+ );
166
+ else if (f === "object") {
167
+ if (typeof t.then == "function")
168
+ return a(
169
+ G(t),
170
+ e,
171
+ n,
172
+ r,
173
+ s
174
+ );
175
+ throw e = String(t), Error(
176
+ "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."
177
+ );
178
+ }
179
+ return u;
180
+ }
181
+ function l(t, e, n) {
182
+ if (t == null) return t;
183
+ var r = [], s = 0;
184
+ return a(t, r, "", "", function(f) {
185
+ return e.call(n, f, s++);
186
+ }), r;
187
+ }
188
+ function K(t) {
189
+ if (t._status === -1) {
190
+ var e = t._result;
191
+ e = e(), e.then(
192
+ function(n) {
193
+ (t._status === 0 || t._status === -1) && (t._status = 1, t._result = n);
194
+ },
195
+ function(n) {
196
+ (t._status === 0 || t._status === -1) && (t._status = 2, t._result = n);
197
+ }
198
+ ), t._status === -1 && (t._status = 0, t._result = e);
199
+ }
200
+ if (t._status === 1) return t._result.default;
201
+ throw t._result;
202
+ }
203
+ var P = typeof reportError == "function" ? reportError : function(t) {
204
+ if (typeof window == "object" && typeof window.ErrorEvent == "function") {
205
+ var e = new window.ErrorEvent("error", {
206
+ bubbles: !0,
207
+ cancelable: !0,
208
+ message: typeof t == "object" && t !== null && typeof t.message == "string" ? String(t.message) : String(t),
209
+ error: t
210
+ });
211
+ if (!window.dispatchEvent(e)) return;
212
+ } else if (typeof process == "object" && typeof process.emit == "function") {
213
+ process.emit("uncaughtException", t);
214
+ return;
215
+ }
216
+ console.error(t);
217
+ };
218
+ function B() {
219
+ }
220
+ return o.Children = {
221
+ map: l,
222
+ forEach: function(t, e, n) {
223
+ l(
224
+ t,
225
+ function() {
226
+ e.apply(this, arguments);
227
+ },
228
+ n
229
+ );
230
+ },
231
+ count: function(t) {
232
+ var e = 0;
233
+ return l(t, function() {
234
+ e++;
235
+ }), e;
236
+ },
237
+ toArray: function(t) {
238
+ return l(t, function(e) {
239
+ return e;
240
+ }) || [];
241
+ },
242
+ only: function(t) {
243
+ if (!T(t))
244
+ throw Error(
245
+ "React.Children.only expected to receive a single React element child."
246
+ );
247
+ return t;
248
+ }
249
+ }, 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 = {
250
+ __proto__: null,
251
+ c: function(t) {
252
+ return i.H.useMemoCache(t);
253
+ }
254
+ }, o.cache = function(t) {
255
+ return function() {
256
+ return t.apply(null, arguments);
257
+ };
258
+ }, o.cloneElement = function(t, e, n) {
259
+ if (t == null)
260
+ throw Error(
261
+ "The argument must be a React element, but you passed " + t + "."
262
+ );
263
+ var r = A({}, t.props), s = t.key, f = void 0;
264
+ if (e != null)
265
+ for (u in e.ref !== void 0 && (f = void 0), e.key !== void 0 && (s = "" + e.key), e)
266
+ !O.call(e, u) || u === "key" || u === "__self" || u === "__source" || u === "ref" && e.ref === void 0 || (r[u] = e[u]);
267
+ var u = arguments.length - 2;
268
+ if (u === 1) r.children = n;
269
+ else if (1 < u) {
270
+ for (var p = Array(u), c = 0; c < u; c++)
271
+ p[c] = arguments[c + 2];
272
+ r.children = p;
273
+ }
274
+ return R(t.type, s, void 0, void 0, f, r);
275
+ }, o.createContext = function(t) {
276
+ return t = {
277
+ $$typeof: U,
278
+ _currentValue: t,
279
+ _currentValue2: t,
280
+ _threadCount: 0,
281
+ Provider: null,
282
+ Consumer: null
283
+ }, t.Provider = t, t.Consumer = {
284
+ $$typeof: L,
285
+ _context: t
286
+ }, t;
287
+ }, o.createElement = function(t, e, n) {
288
+ var r, s = {}, f = null;
289
+ if (e != null)
290
+ for (r in e.key !== void 0 && (f = "" + e.key), e)
291
+ O.call(e, r) && r !== "key" && r !== "__self" && r !== "__source" && (s[r] = e[r]);
292
+ var u = arguments.length - 2;
293
+ if (u === 1) s.children = n;
294
+ else if (1 < u) {
295
+ for (var p = Array(u), c = 0; c < u; c++)
296
+ p[c] = arguments[c + 2];
297
+ s.children = p;
298
+ }
299
+ if (t && t.defaultProps)
300
+ for (r in u = t.defaultProps, u)
301
+ s[r] === void 0 && (s[r] = u[r]);
302
+ return R(t, f, void 0, void 0, null, s);
303
+ }, o.createRef = function() {
304
+ return { current: null };
305
+ }, o.forwardRef = function(t) {
306
+ return { $$typeof: k, render: t };
307
+ }, o.isValidElement = T, o.lazy = function(t) {
308
+ return {
309
+ $$typeof: d,
310
+ _payload: { _status: -1, _result: t },
311
+ _init: K
312
+ };
313
+ }, o.memo = function(t, e) {
314
+ return {
315
+ $$typeof: b,
316
+ type: t,
317
+ compare: e === void 0 ? null : e
66
318
  };
67
- a.exports = u;
68
- }(), a.exports);
319
+ }, o.startTransition = function(t) {
320
+ var e = i.T, n = {};
321
+ i.T = n;
322
+ try {
323
+ var r = t(), s = i.S;
324
+ s !== null && s(n, r), typeof r == "object" && r !== null && typeof r.then == "function" && r.then(B, P);
325
+ } catch (f) {
326
+ P(f);
327
+ } finally {
328
+ i.T = e;
329
+ }
330
+ }, o.unstable_useCacheRefresh = function() {
331
+ return i.H.useCacheRefresh();
332
+ }, o.use = function(t) {
333
+ return i.H.use(t);
334
+ }, o.useActionState = function(t, e, n) {
335
+ return i.H.useActionState(t, e, n);
336
+ }, o.useCallback = function(t, e) {
337
+ return i.H.useCallback(t, e);
338
+ }, o.useContext = function(t) {
339
+ return i.H.useContext(t);
340
+ }, o.useDebugValue = function() {
341
+ }, o.useDeferredValue = function(t, e) {
342
+ return i.H.useDeferredValue(t, e);
343
+ }, o.useEffect = function(t, e, n) {
344
+ var r = i.H;
345
+ if (typeof n == "function")
346
+ throw Error(
347
+ "useEffect CRUD overload is not enabled in this build of React."
348
+ );
349
+ return r.useEffect(t, e);
350
+ }, o.useId = function() {
351
+ return i.H.useId();
352
+ }, o.useImperativeHandle = function(t, e, n) {
353
+ return i.H.useImperativeHandle(t, e, n);
354
+ }, o.useInsertionEffect = function(t, e) {
355
+ return i.H.useInsertionEffect(t, e);
356
+ }, o.useLayoutEffect = function(t, e) {
357
+ return i.H.useLayoutEffect(t, e);
358
+ }, o.useMemo = function(t, e) {
359
+ return i.H.useMemo(t, e);
360
+ }, o.useOptimistic = function(t, e) {
361
+ return i.H.useOptimistic(t, e);
362
+ }, o.useReducer = function(t, e, n) {
363
+ return i.H.useReducer(t, e, n);
364
+ }, o.useRef = function(t) {
365
+ return i.H.useRef(t);
366
+ }, o.useState = function(t) {
367
+ return i.H.useState(t);
368
+ }, o.useSyncExternalStore = function(t, e, n) {
369
+ return i.H.useSyncExternalStore(
370
+ t,
371
+ e,
372
+ n
373
+ );
374
+ }, o.useTransition = function() {
375
+ return i.H.useTransition();
376
+ }, o.version = "19.1.2", o;
69
377
  }
70
378
  export {
71
- c as __require
379
+ X as __require
72
380
  };