@orbs-network/spot-react 0.0.102 → 0.0.103

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.
Files changed (10) hide show
  1. package/dist/{ccip-AR1zTcOj.js → ccip-CoUpV1TR.js} +1 -1
  2. package/dist/{index-Bym4mjAW.js → index-DbicTd1-.js} +476 -477
  3. package/dist/spot-react/package.json.d.ts +1 -1
  4. package/dist/spot-react/src/hooks/use-repermit-order-data.d.ts.map +1 -1
  5. package/dist/spot-react.js +1 -1
  6. package/dist/spot-react.umd.cjs +11 -11
  7. package/dist/spot-ui/src/lib/build-repermit-order-data.d.ts +1 -0
  8. package/dist/spot-ui/src/lib/build-repermit-order-data.d.ts.map +1 -1
  9. package/dist/spot-ui/src/lib/consts.d.ts.map +1 -1
  10. package/package.json +2 -2
package/dist/{index-Bym4mjAW.js → index-DbicTd1-.js} RENAMED
@@ -1172,7 +1172,7 @@ function bb(e) {
1172
1172
  suffix: ""
1173
1173
  }, E = "0123456789abcdefghijklmnopqrstuvwxyz", v = !0;
1174
1174
  function w(h, y) {
1175
- var x, T, I, B, _, k, S, O, U = this;
1175
+ var x, T, I, B, _, k, P, O, U = this;
1176
1176
  if (!(U instanceof w)) return new w(h, y);
1177
1177
  if (y == null) {
1178
1178
  if (h && h._isBigNumber === !0) {
@@ -1200,11 +1200,11 @@ function bb(e) {
1200
1200
  throw Error($m + h);
1201
1201
  } else
1202
1202
  U.s = O.charCodeAt(0) === 45 ? (O = O.slice(1), -1) : 1;
1203
- for (x = E.slice(0, y), B = _ = 0, S = O.length; _ < S; _++)
1203
+ for (x = E.slice(0, y), B = _ = 0, P = O.length; _ < P; _++)
1204
1204
  if (x.indexOf(T = O.charAt(_)) < 0) {
1205
1205
  if (T == ".") {
1206
1206
  if (_ > B) {
1207
- B = S;
1207
+ B = P;
1208
1208
  continue;
1209
1209
  }
1210
1210
  } else if (!I && (O == O.toUpperCase() && (O = O.toLowerCase()) || O == O.toLowerCase() && (O = O.toUpperCase()))) {
@@ -1216,21 +1216,21 @@ function bb(e) {
1216
1216
  k = !1, O = r(O, y, 10, U.s), (B = O.indexOf(".")) > -1 ? O = O.replace(".", "") : B = O.length;
1217
1217
  }
1218
1218
  for (_ = 0; O.charCodeAt(_) === 48; _++) ;
1219
- for (S = O.length; O.charCodeAt(--S) === 48; ) ;
1220
- if (O = O.slice(_, ++S)) {
1221
- if (S -= _, k && w.DEBUG && S > 15 && (h > id || h !== wr(h)))
1219
+ for (P = O.length; O.charCodeAt(--P) === 48; ) ;
1220
+ if (O = O.slice(_, ++P)) {
1221
+ if (P -= _, k && w.DEBUG && P > 15 && (h > id || h !== wr(h)))
1222
1222
  throw Error($m + U.s * h);
1223
1223
  if ((B = B - _ - 1) > d)
1224
1224
  U.c = U.e = null;
1225
1225
  else if (B < u)
1226
1226
  U.c = [U.e = 0];
1227
1227
  else {
1228
- if (U.e = B, U.c = [], _ = (B + 1) % ke, B < 0 && (_ += ke), _ < S) {
1229
- for (_ && U.c.push(+O.slice(0, _)), S -= ke; _ < S; )
1228
+ if (U.e = B, U.c = [], _ = (B + 1) % ke, B < 0 && (_ += ke), _ < P) {
1229
+ for (_ && U.c.push(+O.slice(0, _)), P -= ke; _ < P; )
1230
1230
  U.c.push(+O.slice(_, _ += ke));
1231
1231
  _ = ke - (O = O.slice(_)).length;
1232
1232
  } else
1233
- _ -= S;
1233
+ _ -= P;
1234
1234
  for (; _--; O += "0") ;
1235
1235
  U.c.push(+O);
1236
1236
  }
@@ -1310,28 +1310,28 @@ function bb(e) {
1310
1310
  return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
1311
1311
  };
1312
1312
  return function(x) {
1313
- var T, I, B, _, k, S = 0, O = [], U = new w(a);
1313
+ var T, I, B, _, k, P = 0, O = [], U = new w(a);
1314
1314
  if (x == null ? x = o : ut(x, 0, It), _ = od(x / ke), f)
1315
1315
  if (crypto.getRandomValues) {
1316
- for (T = crypto.getRandomValues(new Uint32Array(_ *= 2)); S < _; )
1317
- k = T[S] * 131072 + (T[S + 1] >>> 11), k >= 9e15 ? (I = crypto.getRandomValues(new Uint32Array(2)), T[S] = I[0], T[S + 1] = I[1]) : (O.push(k % 1e14), S += 2);
1318
- S = _ / 2;
1316
+ for (T = crypto.getRandomValues(new Uint32Array(_ *= 2)); P < _; )
1317
+ k = T[P] * 131072 + (T[P + 1] >>> 11), k >= 9e15 ? (I = crypto.getRandomValues(new Uint32Array(2)), T[P] = I[0], T[P + 1] = I[1]) : (O.push(k % 1e14), P += 2);
1318
+ P = _ / 2;
1319
1319
  } else if (crypto.randomBytes) {
1320
- for (T = crypto.randomBytes(_ *= 7); S < _; )
1321
- k = (T[S] & 31) * 281474976710656 + T[S + 1] * 1099511627776 + T[S + 2] * 4294967296 + T[S + 3] * 16777216 + (T[S + 4] << 16) + (T[S + 5] << 8) + T[S + 6], k >= 9e15 ? crypto.randomBytes(7).copy(T, S) : (O.push(k % 1e14), S += 7);
1322
- S = _ / 7;
1320
+ for (T = crypto.randomBytes(_ *= 7); P < _; )
1321
+ k = (T[P] & 31) * 281474976710656 + T[P + 1] * 1099511627776 + T[P + 2] * 4294967296 + T[P + 3] * 16777216 + (T[P + 4] << 16) + (T[P + 5] << 8) + T[P + 6], k >= 9e15 ? crypto.randomBytes(7).copy(T, P) : (O.push(k % 1e14), P += 7);
1322
+ P = _ / 7;
1323
1323
  } else
1324
1324
  throw f = !1, Error(Yt + "crypto unavailable");
1325
1325
  if (!f)
1326
- for (; S < _; )
1327
- k = y(), k < 9e15 && (O[S++] = k % 1e14);
1328
- for (_ = O[--S], x %= ke, _ && x && (k = cd[ke - x], O[S] = wr(_ / k) * k); O[S] === 0; O.pop(), S--) ;
1329
- if (S < 0)
1326
+ for (; P < _; )
1327
+ k = y(), k < 9e15 && (O[P++] = k % 1e14);
1328
+ for (_ = O[--P], x %= ke, _ && x && (k = cd[ke - x], O[P] = wr(_ / k) * k); O[P] === 0; O.pop(), P--) ;
1329
+ if (P < 0)
1330
1330
  O = [B = 0];
1331
1331
  else {
1332
1332
  for (B = -1; O[0] === 0; O.splice(0, 1), B -= ke) ;
1333
- for (S = 1, k = O[0]; k >= 10; k /= 10, S++) ;
1334
- S < ke && (B -= ke - S);
1333
+ for (P = 1, k = O[0]; k >= 10; k /= 10, P++) ;
1334
+ P < ke && (B -= ke - P);
1335
1335
  }
1336
1336
  return U.e = B, U.c = O, U;
1337
1337
  };
@@ -1341,15 +1341,15 @@ function bb(e) {
1341
1341
  }, r = /* @__PURE__ */ (function() {
1342
1342
  var h = "0123456789";
1343
1343
  function y(x, T, I, B) {
1344
- for (var _, k = [0], S, O = 0, U = x.length; O < U; ) {
1345
- for (S = k.length; S--; k[S] *= T) ;
1344
+ for (var _, k = [0], P, O = 0, U = x.length; O < U; ) {
1345
+ for (P = k.length; P--; k[P] *= T) ;
1346
1346
  for (k[0] += B.indexOf(x.charAt(O++)), _ = 0; _ < k.length; _++)
1347
1347
  k[_] > I - 1 && (k[_ + 1] == null && (k[_ + 1] = 0), k[_ + 1] += k[_] / I | 0, k[_] %= I);
1348
1348
  }
1349
1349
  return k.reverse();
1350
1350
  }
1351
1351
  return function(x, T, I, B, _) {
1352
- var k, S, O, U, N, L, H, Z, fe = x.indexOf("."), ye = o, ie = i;
1352
+ var k, P, O, U, N, L, H, Z, fe = x.indexOf("."), ye = o, ie = i;
1353
1353
  for (fe >= 0 && (U = b, b = 0, x = x.replace(".", ""), Z = new w(T), L = Z.pow(x.length - fe), b = U, Z.c = y(
1354
1354
  wn(gr(L.c), L.e, "0"),
1355
1355
  10,
@@ -1357,12 +1357,12 @@ function bb(e) {
1357
1357
  h
1358
1358
  ), Z.e = Z.c.length), H = y(x, T, I, _ ? (k = E, h) : (k = h, E)), O = U = H.length; H[--U] == 0; H.pop()) ;
1359
1359
  if (!H[0]) return k.charAt(0);
1360
- if (fe < 0 ? --O : (L.c = H, L.e = O, L.s = B, L = t(L, Z, ye, ie, I), H = L.c, N = L.r, O = L.e), S = O + ye + 1, fe = H[S], U = I / 2, N = N || S < 0 || H[S + 1] != null, N = ie < 4 ? (fe != null || N) && (ie == 0 || ie == (L.s < 0 ? 3 : 2)) : fe > U || fe == U && (ie == 4 || N || ie == 6 && H[S - 1] & 1 || ie == (L.s < 0 ? 8 : 7)), S < 1 || !H[0])
1360
+ if (fe < 0 ? --O : (L.c = H, L.e = O, L.s = B, L = t(L, Z, ye, ie, I), H = L.c, N = L.r, O = L.e), P = O + ye + 1, fe = H[P], U = I / 2, N = N || P < 0 || H[P + 1] != null, N = ie < 4 ? (fe != null || N) && (ie == 0 || ie == (L.s < 0 ? 3 : 2)) : fe > U || fe == U && (ie == 4 || N || ie == 6 && H[P - 1] & 1 || ie == (L.s < 0 ? 8 : 7)), P < 1 || !H[0])
1361
1361
  x = N ? wn(k.charAt(1), -ye, k.charAt(0)) : k.charAt(0);
1362
1362
  else {
1363
- if (H.length = S, N)
1364
- for (--I; ++H[--S] > I; )
1365
- H[S] = 0, S || (++O, H = [1].concat(H));
1363
+ if (H.length = P, N)
1364
+ for (--I; ++H[--P] > I; )
1365
+ H[P] = 0, P || (++O, H = [1].concat(H));
1366
1366
  for (U = H.length; !H[--U]; ) ;
1367
1367
  for (fe = 0, x = ""; fe <= U; x += k.charAt(H[fe++])) ;
1368
1368
  x = wn(x, O, k.charAt(0));
@@ -1371,22 +1371,22 @@ function bb(e) {
1371
1371
  };
1372
1372
  })(), t = /* @__PURE__ */ (function() {
1373
1373
  function h(T, I, B) {
1374
- var _, k, S, O, U = 0, N = T.length, L = I % Jn, H = I / Jn | 0;
1374
+ var _, k, P, O, U = 0, N = T.length, L = I % Jn, H = I / Jn | 0;
1375
1375
  for (T = T.slice(); N--; )
1376
- S = T[N] % Jn, O = T[N] / Jn | 0, _ = H * S + O * L, k = L * S + _ % Jn * Jn + U, U = (k / B | 0) + (_ / Jn | 0) + H * O, T[N] = k % B;
1376
+ P = T[N] % Jn, O = T[N] / Jn | 0, _ = H * P + O * L, k = L * P + _ % Jn * Jn + U, U = (k / B | 0) + (_ / Jn | 0) + H * O, T[N] = k % B;
1377
1377
  return U && (T = [U].concat(T)), T;
1378
1378
  }
1379
1379
  function y(T, I, B, _) {
1380
- var k, S;
1380
+ var k, P;
1381
1381
  if (B != _)
1382
- S = B > _ ? 1 : -1;
1382
+ P = B > _ ? 1 : -1;
1383
1383
  else
1384
- for (k = S = 0; k < B; k++)
1384
+ for (k = P = 0; k < B; k++)
1385
1385
  if (T[k] != I[k]) {
1386
- S = T[k] > I[k] ? 1 : -1;
1386
+ P = T[k] > I[k] ? 1 : -1;
1387
1387
  break;
1388
1388
  }
1389
- return S;
1389
+ return P;
1390
1390
  }
1391
1391
  function x(T, I, B, _) {
1392
1392
  for (var k = 0; B--; )
@@ -1394,7 +1394,7 @@ function bb(e) {
1394
1394
  for (; !T[0] && T.length > 1; T.splice(0, 1)) ;
1395
1395
  }
1396
1396
  return function(T, I, B, _, k) {
1397
- var S, O, U, N, L, H, Z, fe, ye, ie, pe, Ue, K, ve, De, He, at, Ae = T.s == I.s ? 1 : -1, Ee = T.c, ge = I.c;
1397
+ var P, O, U, N, L, H, Z, fe, ye, ie, pe, Ue, K, ve, De, He, at, Ae = T.s == I.s ? 1 : -1, Ee = T.c, ge = I.c;
1398
1398
  if (!Ee || !Ee[0] || !ge || !ge[0])
1399
1399
  return new w(
1400
1400
  // Return NaN if either NaN, or both Infinity or 0.
@@ -1410,16 +1410,16 @@ function bb(e) {
1410
1410
  for (ve = Ee.length, He = ge.length, U = 0, Ae += 2, L = wr(k / (ge[0] + 1)), L > 1 && (ge = h(ge, L, k), Ee = h(Ee, L, k), He = ge.length, ve = Ee.length), K = He, ie = Ee.slice(0, He), pe = ie.length; pe < He; ie[pe++] = 0) ;
1411
1411
  at = ge.slice(), at = [0].concat(at), De = ge[0], ge[1] >= k / 2 && De++;
1412
1412
  do {
1413
- if (L = 0, S = y(ge, ie, He, pe), S < 0) {
1413
+ if (L = 0, P = y(ge, ie, He, pe), P < 0) {
1414
1414
  if (Ue = ie[0], He != pe && (Ue = Ue * k + (ie[1] || 0)), L = wr(Ue / De), L > 1)
1415
1415
  for (L >= k && (L = k - 1), H = h(ge, L, k), Z = H.length, pe = ie.length; y(H, ie, Z, pe) == 1; )
1416
- L--, x(H, He < Z ? at : ge, Z, k), Z = H.length, S = 1;
1416
+ L--, x(H, He < Z ? at : ge, Z, k), Z = H.length, P = 1;
1417
1417
  else
1418
- L == 0 && (S = L = 1), H = ge.slice(), Z = H.length;
1419
- if (Z < pe && (H = [0].concat(H)), x(ie, H, pe, k), pe = ie.length, S == -1)
1418
+ L == 0 && (P = L = 1), H = ge.slice(), Z = H.length;
1419
+ if (Z < pe && (H = [0].concat(H)), x(ie, H, pe, k), pe = ie.length, P == -1)
1420
1420
  for (; y(ge, ie, He, pe) < 1; )
1421
1421
  L++, x(ie, He < pe ? at : ge, pe, k), pe = ie.length;
1422
- } else S === 0 && (L++, ie = [0]);
1422
+ } else P === 0 && (L++, ie = [0]);
1423
1423
  ye[U++] = L, ie[0] ? ie[pe++] = Ee[K] || 0 : (ie = [Ee[K]], pe = 1);
1424
1424
  } while ((K++ < ve || ie[0] != null) && Ae--);
1425
1425
  N = ie[0] != null, ye[0] || ye.splice(0, 1);
@@ -1433,18 +1433,18 @@ function bb(e) {
1433
1433
  };
1434
1434
  })();
1435
1435
  function A(h, y, x, T) {
1436
- var I, B, _, k, S;
1436
+ var I, B, _, k, P;
1437
1437
  if (x == null ? x = i : ut(x, 0, 8), !h.c) return h.toString();
1438
1438
  if (I = h.c[0], _ = h.e, y == null)
1439
- S = gr(h.c), S = T == 1 || T == 2 && (_ <= c || _ >= l) ? Lc(S, _) : wn(S, _, "0");
1440
- else if (h = R(new w(h), y, x), B = h.e, S = gr(h.c), k = S.length, T == 1 || T == 2 && (y <= B || B <= c)) {
1441
- for (; k < y; S += "0", k++) ;
1442
- S = Lc(S, B);
1443
- } else if (y -= _ + (T === 2 && B > _), S = wn(S, B, "0"), B + 1 > k) {
1444
- if (--y > 0) for (S += "."; y--; S += "0") ;
1439
+ P = gr(h.c), P = T == 1 || T == 2 && (_ <= c || _ >= l) ? Lc(P, _) : wn(P, _, "0");
1440
+ else if (h = R(new w(h), y, x), B = h.e, P = gr(h.c), k = P.length, T == 1 || T == 2 && (y <= B || B <= c)) {
1441
+ for (; k < y; P += "0", k++) ;
1442
+ P = Lc(P, B);
1443
+ } else if (y -= _ + (T === 2 && B > _), P = wn(P, B, "0"), B + 1 > k) {
1444
+ if (--y > 0) for (P += "."; y--; P += "0") ;
1445
1445
  } else if (y += B - k, y > 0)
1446
- for (B + 1 == k && (S += "."); y--; S += "0") ;
1447
- return h.s < 0 && I ? "-" + S : S;
1446
+ for (B + 1 == k && (P += "."); y--; P += "0") ;
1447
+ return h.s < 0 && I ? "-" + P : P;
1448
1448
  }
1449
1449
  function C(h, y) {
1450
1450
  for (var x, T, I = 1, B = new w(h[0]); I < h.length; I++)
@@ -1458,46 +1458,46 @@ function bb(e) {
1458
1458
  }
1459
1459
  n = /* @__PURE__ */ (function() {
1460
1460
  var h = /^(-?)0([xbo])(?=\w[\w.]*$)/i, y = /^([^.]+)\.$/, x = /^\.([^.]+)$/, T = /^-?(Infinity|NaN)$/, I = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
1461
- return function(B, _, k, S) {
1461
+ return function(B, _, k, P) {
1462
1462
  var O, U = k ? _ : _.replace(I, "");
1463
1463
  if (T.test(U))
1464
1464
  B.s = isNaN(U) ? null : U < 0 ? -1 : 1;
1465
1465
  else {
1466
1466
  if (!k && (U = U.replace(h, function(N, L, H) {
1467
- return O = (H = H.toLowerCase()) == "x" ? 16 : H == "b" ? 2 : 8, !S || S == O ? L : N;
1468
- }), S && (O = S, U = U.replace(y, "$1").replace(x, "0.$1")), _ != U))
1467
+ return O = (H = H.toLowerCase()) == "x" ? 16 : H == "b" ? 2 : 8, !P || P == O ? L : N;
1468
+ }), P && (O = P, U = U.replace(y, "$1").replace(x, "0.$1")), _ != U))
1469
1469
  return new w(U, O);
1470
1470
  if (w.DEBUG)
1471
- throw Error(Yt + "Not a" + (S ? " base " + S : "") + " number: " + _);
1471
+ throw Error(Yt + "Not a" + (P ? " base " + P : "") + " number: " + _);
1472
1472
  B.s = null;
1473
1473
  }
1474
1474
  B.c = B.e = null;
1475
1475
  };
1476
1476
  })();
1477
1477
  function R(h, y, x, T) {
1478
- var I, B, _, k, S, O, U, N = h.c, L = cd;
1478
+ var I, B, _, k, P, O, U, N = h.c, L = cd;
1479
1479
  if (N) {
1480
1480
  e: {
1481
1481
  for (I = 1, k = N[0]; k >= 10; k /= 10, I++) ;
1482
1482
  if (B = y - I, B < 0)
1483
- B += ke, _ = y, S = N[O = 0], U = wr(S / L[I - _ - 1] % 10);
1483
+ B += ke, _ = y, P = N[O = 0], U = wr(P / L[I - _ - 1] % 10);
1484
1484
  else if (O = od((B + 1) / ke), O >= N.length)
1485
1485
  if (T) {
1486
1486
  for (; N.length <= O; N.push(0)) ;
1487
- S = U = 0, I = 1, B %= ke, _ = B - ke + 1;
1487
+ P = U = 0, I = 1, B %= ke, _ = B - ke + 1;
1488
1488
  } else
1489
1489
  break e;
1490
1490
  else {
1491
- for (S = k = N[O], I = 1; k >= 10; k /= 10, I++) ;
1492
- B %= ke, _ = B - ke + I, U = _ < 0 ? 0 : wr(S / L[I - _ - 1] % 10);
1491
+ for (P = k = N[O], I = 1; k >= 10; k /= 10, I++) ;
1492
+ B %= ke, _ = B - ke + I, U = _ < 0 ? 0 : wr(P / L[I - _ - 1] % 10);
1493
1493
  }
1494
1494
  if (T = T || y < 0 || // Are there any non-zero digits after the rounding digit?
1495
1495
  // The expression n % pows10[d - j - 1] returns all digits of n to the right
1496
1496
  // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
1497
- N[O + 1] != null || (_ < 0 ? S : S % L[I - _ - 1]), T = x < 4 ? (U || T) && (x == 0 || x == (h.s < 0 ? 3 : 2)) : U > 5 || U == 5 && (x == 4 || T || x == 6 && // Check whether the digit to the left of the rounding digit is odd.
1498
- (B > 0 ? _ > 0 ? S / L[I - _] : 0 : N[O - 1]) % 10 & 1 || x == (h.s < 0 ? 8 : 7)), y < 1 || !N[0])
1497
+ N[O + 1] != null || (_ < 0 ? P : P % L[I - _ - 1]), T = x < 4 ? (U || T) && (x == 0 || x == (h.s < 0 ? 3 : 2)) : U > 5 || U == 5 && (x == 4 || T || x == 6 && // Check whether the digit to the left of the rounding digit is odd.
1498
+ (B > 0 ? _ > 0 ? P / L[I - _] : 0 : N[O - 1]) % 10 & 1 || x == (h.s < 0 ? 8 : 7)), y < 1 || !N[0])
1499
1499
  return N.length = 0, T ? (y -= h.e + 1, N[0] = L[(ke - y % ke) % ke], h.e = -y || 0) : N[0] = h.e = 0, h;
1500
- if (B == 0 ? (N.length = O, k = 1, O--) : (N.length = O + 1, k = L[ke - B], N[O] = _ > 0 ? wr(S / L[I - _] % L[_]) * k : 0), T)
1500
+ if (B == 0 ? (N.length = O, k = 1, O--) : (N.length = O + 1, k = L[ke - B], N[O] = _ > 0 ? wr(P / L[I - _] % L[_]) * k : 0), T)
1501
1501
  for (; ; )
1502
1502
  if (O == 0) {
1503
1503
  for (B = 1, _ = N[0]; _ >= 10; _ /= 10, B++) ;
@@ -1514,7 +1514,7 @@ function bb(e) {
1514
1514
  }
1515
1515
  return h;
1516
1516
  }
1517
- function P(h) {
1517
+ function S(h) {
1518
1518
  var y, x = h.e;
1519
1519
  return x === null ? h.toString() : (y = gr(h.c), y = x <= c || x >= l ? Lc(y, x) : wn(y, x, "0"), h.s < 0 ? "-" + y : y);
1520
1520
  }
@@ -1535,20 +1535,20 @@ function bb(e) {
1535
1535
  }, s.dividedToIntegerBy = s.idiv = function(h, y) {
1536
1536
  return t(this, new w(h, y), 0, 1);
1537
1537
  }, s.exponentiatedBy = s.pow = function(h, y) {
1538
- var x, T, I, B, _, k, S, O, U, N = this;
1538
+ var x, T, I, B, _, k, P, O, U, N = this;
1539
1539
  if (h = new w(h), h.c && !h.isInteger())
1540
- throw Error(Yt + "Exponent not an integer: " + P(h));
1540
+ throw Error(Yt + "Exponent not an integer: " + S(h));
1541
1541
  if (y != null && (y = new w(y)), k = h.e > 14, !N.c || !N.c[0] || N.c[0] == 1 && !N.e && N.c.length == 1 || !h.c || !h.c[0])
1542
- return U = new w(Math.pow(+P(N), k ? h.s * (2 - Nc(h)) : +P(h))), y ? U.mod(y) : U;
1543
- if (S = h.s < 0, y) {
1542
+ return U = new w(Math.pow(+S(N), k ? h.s * (2 - Nc(h)) : +S(h))), y ? U.mod(y) : U;
1543
+ if (P = h.s < 0, y) {
1544
1544
  if (y.c ? !y.c[0] : !y.s) return new w(NaN);
1545
- T = !S && N.isInteger() && y.isInteger(), T && (N = N.mod(y));
1545
+ T = !P && N.isInteger() && y.isInteger(), T && (N = N.mod(y));
1546
1546
  } else {
1547
1547
  if (h.e > 9 && (N.e > 0 || N.e < -1 || (N.e == 0 ? N.c[0] > 1 || k && N.c[1] >= 24e7 : N.c[0] < 8e13 || k && N.c[0] <= 9999975e7)))
1548
- return B = N.s < 0 && Nc(h) ? -0 : 0, N.e > -1 && (B = 1 / B), new w(S ? 1 / B : B);
1548
+ return B = N.s < 0 && Nc(h) ? -0 : 0, N.e > -1 && (B = 1 / B), new w(P ? 1 / B : B);
1549
1549
  b && (B = od(b / ke + 2));
1550
1550
  }
1551
- for (k ? (x = new w(0.5), S && (h.s = 1), O = Nc(h)) : (I = Math.abs(+P(h)), O = I % 2), U = new w(a); ; ) {
1551
+ for (k ? (x = new w(0.5), P && (h.s = 1), O = Nc(h)) : (I = Math.abs(+S(h)), O = I % 2), U = new w(a); ; ) {
1552
1552
  if (O) {
1553
1553
  if (U = U.times(N), !U.c) break;
1554
1554
  B ? U.c.length > B && (U.c.length = B) : T && (U = U.mod(y));
@@ -1559,12 +1559,12 @@ function bb(e) {
1559
1559
  } else if (h = h.times(x), R(h, h.e + 1, 1), h.e > 14)
1560
1560
  O = Nc(h);
1561
1561
  else {
1562
- if (I = +P(h), I === 0) break;
1562
+ if (I = +S(h), I === 0) break;
1563
1563
  O = I % 2;
1564
1564
  }
1565
1565
  N = N.times(N), B ? N.c && N.c.length > B && (N.c.length = B) : T && (N = N.mod(y));
1566
1566
  }
1567
- return T ? U : (S && (U = a.div(U)), y ? U.mod(y) : B ? R(U, b, i, _) : U);
1567
+ return T ? U : (P && (U = a.div(U)), y ? U.mod(y) : B ? R(U, b, i, _) : U);
1568
1568
  }, s.integerValue = function(h) {
1569
1569
  var y = new w(this);
1570
1570
  return h == null ? h = i : ut(h, 0, 8), R(y, y.e + 1, h);
@@ -1595,8 +1595,8 @@ function bb(e) {
1595
1595
  if (h = new w(h, y), y = h.s, !k || !y) return new w(NaN);
1596
1596
  if (k != y)
1597
1597
  return h.s = -y, _.plus(h);
1598
- var S = _.e / ke, O = h.e / ke, U = _.c, N = h.c;
1599
- if (!S || !O) {
1598
+ var P = _.e / ke, O = h.e / ke, U = _.c, N = h.c;
1599
+ if (!P || !O) {
1600
1600
  if (!U || !N) return U ? (h.s = -y, h) : new w(N ? _ : NaN);
1601
1601
  if (!U[0] || !N[0])
1602
1602
  return N[0] ? (h.s = -y, h) : new w(U[0] ? _ : (
@@ -1604,8 +1604,8 @@ function bb(e) {
1604
1604
  i == 3 ? -0 : 0
1605
1605
  ));
1606
1606
  }
1607
- if (S = vr(S), O = vr(O), U = U.slice(), k = S - O) {
1608
- for ((B = k < 0) ? (k = -k, I = U) : (O = S, I = N), I.reverse(), y = k; y--; I.push(0)) ;
1607
+ if (P = vr(P), O = vr(O), U = U.slice(), k = P - O) {
1608
+ for ((B = k < 0) ? (k = -k, I = U) : (O = P, I = N), I.reverse(), y = k; y--; I.push(0)) ;
1609
1609
  I.reverse();
1610
1610
  } else
1611
1611
  for (T = (B = (k = U.length) < (y = N.length)) ? k : y, k = y = 0; y < T; y++)
@@ -1627,12 +1627,12 @@ function bb(e) {
1627
1627
  var x, T, I = this;
1628
1628
  return h = new w(h, y), !I.c || !h.s || h.c && !h.c[0] ? new w(NaN) : !h.c || I.c && !I.c[0] ? new w(I) : (m == 9 ? (T = h.s, h.s = 1, x = t(I, h, 0, 3), h.s = T, x.s *= T) : x = t(I, h, 0, m), h = I.minus(x.times(h)), !h.c[0] && m == 1 && (h.s = I.s), h);
1629
1629
  }, s.multipliedBy = s.times = function(h, y) {
1630
- var x, T, I, B, _, k, S, O, U, N, L, H, Z, fe, ye, ie = this, pe = ie.c, Ue = (h = new w(h, y)).c;
1630
+ var x, T, I, B, _, k, P, O, U, N, L, H, Z, fe, ye, ie = this, pe = ie.c, Ue = (h = new w(h, y)).c;
1631
1631
  if (!pe || !Ue || !pe[0] || !Ue[0])
1632
1632
  return !ie.s || !h.s || pe && !pe[0] && !Ue || Ue && !Ue[0] && !pe ? h.c = h.e = h.s = null : (h.s *= ie.s, !pe || !Ue ? h.c = h.e = null : (h.c = [0], h.e = 0)), h;
1633
- for (T = vr(ie.e / ke) + vr(h.e / ke), h.s *= ie.s, S = pe.length, N = Ue.length, S < N && (Z = pe, pe = Ue, Ue = Z, I = S, S = N, N = I), I = S + N, Z = []; I--; Z.push(0)) ;
1633
+ for (T = vr(ie.e / ke) + vr(h.e / ke), h.s *= ie.s, P = pe.length, N = Ue.length, P < N && (Z = pe, pe = Ue, Ue = Z, I = P, P = N, N = I), I = P + N, Z = []; I--; Z.push(0)) ;
1634
1634
  for (fe = Dr, ye = Jn, I = N; --I >= 0; ) {
1635
- for (x = 0, L = Ue[I] % ye, H = Ue[I] / ye | 0, _ = S, B = I + _; B > I; )
1635
+ for (x = 0, L = Ue[I] % ye, H = Ue[I] / ye | 0, _ = P, B = I + _; B > I; )
1636
1636
  O = pe[--_] % ye, U = pe[_] / ye | 0, k = H * O + U * L, O = L * O + k % ye * ye + Z[B] + x, x = (O / fe | 0) + (k / ye | 0) + H * U, Z[B--] = O % fe;
1637
1637
  Z[B] = x;
1638
1638
  }
@@ -1645,17 +1645,17 @@ function bb(e) {
1645
1645
  if (h = new w(h, y), y = h.s, !I || !y) return new w(NaN);
1646
1646
  if (I != y)
1647
1647
  return h.s = -y, T.minus(h);
1648
- var B = T.e / ke, _ = h.e / ke, k = T.c, S = h.c;
1648
+ var B = T.e / ke, _ = h.e / ke, k = T.c, P = h.c;
1649
1649
  if (!B || !_) {
1650
- if (!k || !S) return new w(I / 0);
1651
- if (!k[0] || !S[0]) return S[0] ? h : new w(k[0] ? T : I * 0);
1650
+ if (!k || !P) return new w(I / 0);
1651
+ if (!k[0] || !P[0]) return P[0] ? h : new w(k[0] ? T : I * 0);
1652
1652
  }
1653
1653
  if (B = vr(B), _ = vr(_), k = k.slice(), I = B - _) {
1654
- for (I > 0 ? (_ = B, x = S) : (I = -I, x = k), x.reverse(); I--; x.push(0)) ;
1654
+ for (I > 0 ? (_ = B, x = P) : (I = -I, x = k), x.reverse(); I--; x.push(0)) ;
1655
1655
  x.reverse();
1656
1656
  }
1657
- for (I = k.length, y = S.length, I - y < 0 && (x = S, S = k, k = x, y = I), I = 0; y; )
1658
- I = (k[--y] = k[y] + S[y] + I) / Dr | 0, k[y] = Dr === k[y] ? 0 : k[y] % Dr;
1657
+ for (I = k.length, y = P.length, I - y < 0 && (x = P, P = k, k = x, y = I), I = 0; y; )
1658
+ I = (k[--y] = k[y] + P[y] + I) / Dr | 0, k[y] = Dr === k[y] ? 0 : k[y] % Dr;
1659
1659
  return I && (k = [I].concat(k), ++_), F(h, k, _);
1660
1660
  }, s.precision = s.sd = function(h, y) {
1661
1661
  var x, T, I, B = this;
@@ -1670,13 +1670,13 @@ function bb(e) {
1670
1670
  }, s.shiftedBy = function(h) {
1671
1671
  return ut(h, -id, id), this.times("1e" + h);
1672
1672
  }, s.squareRoot = s.sqrt = function() {
1673
- var h, y, x, T, I, B = this, _ = B.c, k = B.s, S = B.e, O = o + 4, U = new w("0.5");
1673
+ var h, y, x, T, I, B = this, _ = B.c, k = B.s, P = B.e, O = o + 4, U = new w("0.5");
1674
1674
  if (k !== 1 || !_ || !_[0])
1675
1675
  return new w(!k || k < 0 && (!_ || _[0]) ? NaN : _ ? B : 1 / 0);
1676
- if (k = Math.sqrt(+P(B)), k == 0 || k == 1 / 0 ? (y = gr(_), (y.length + S) % 2 == 0 && (y += "0"), k = Math.sqrt(+y), S = vr((S + 1) / 2) - (S < 0 || S % 2), k == 1 / 0 ? y = "5e" + S : (y = k.toExponential(), y = y.slice(0, y.indexOf("e") + 1) + S), x = new w(y)) : x = new w(k + ""), x.c[0]) {
1677
- for (S = x.e, k = S + O, k < 3 && (k = 0); ; )
1676
+ if (k = Math.sqrt(+S(B)), k == 0 || k == 1 / 0 ? (y = gr(_), (y.length + P) % 2 == 0 && (y += "0"), k = Math.sqrt(+y), P = vr((P + 1) / 2) - (P < 0 || P % 2), k == 1 / 0 ? y = "5e" + P : (y = k.toExponential(), y = y.slice(0, y.indexOf("e") + 1) + P), x = new w(y)) : x = new w(k + ""), x.c[0]) {
1677
+ for (P = x.e, k = P + O, k < 3 && (k = 0); ; )
1678
1678
  if (I = x, x = U.times(I.plus(t(B, I, O, 1))), gr(I.c).slice(0, k) === (y = gr(x.c)).slice(0, k))
1679
- if (x.e < S && --k, y = y.slice(k - 3, k + 1), y == "9999" || !T && y == "4999") {
1679
+ if (x.e < P && --k, y = y.slice(k - 3, k + 1), y == "9999" || !T && y == "4999") {
1680
1680
  if (!T && (R(I, I.e + o + 2, 0), I.times(I).eq(B))) {
1681
1681
  x = I;
1682
1682
  break;
@@ -1699,36 +1699,36 @@ function bb(e) {
1699
1699
  else if (typeof x != "object")
1700
1700
  throw Error(Yt + "Argument not an object: " + x);
1701
1701
  if (T = I.toFixed(h, y), I.c) {
1702
- var B, _ = T.split("."), k = +x.groupSize, S = +x.secondaryGroupSize, O = x.groupSeparator || "", U = _[0], N = _[1], L = I.s < 0, H = L ? U.slice(1) : U, Z = H.length;
1703
- if (S && (B = k, k = S, S = B, Z -= B), k > 0 && Z > 0) {
1702
+ var B, _ = T.split("."), k = +x.groupSize, P = +x.secondaryGroupSize, O = x.groupSeparator || "", U = _[0], N = _[1], L = I.s < 0, H = L ? U.slice(1) : U, Z = H.length;
1703
+ if (P && (B = k, k = P, P = B, Z -= B), k > 0 && Z > 0) {
1704
1704
  for (B = Z % k || k, U = H.substr(0, B); B < Z; B += k) U += O + H.substr(B, k);
1705
- S > 0 && (U += O + H.slice(B)), L && (U = "-" + U);
1705
+ P > 0 && (U += O + H.slice(B)), L && (U = "-" + U);
1706
1706
  }
1707
- T = N ? U + (x.decimalSeparator || "") + ((S = +x.fractionGroupSize) ? N.replace(
1708
- new RegExp("\\d{" + S + "}\\B", "g"),
1707
+ T = N ? U + (x.decimalSeparator || "") + ((P = +x.fractionGroupSize) ? N.replace(
1708
+ new RegExp("\\d{" + P + "}\\B", "g"),
1709
1709
  "$&" + (x.fractionGroupSeparator || "")
1710
1710
  ) : N) : U;
1711
1711
  }
1712
1712
  return (x.prefix || "") + T + (x.suffix || "");
1713
1713
  }, s.toFraction = function(h) {
1714
- var y, x, T, I, B, _, k, S, O, U, N, L, H = this, Z = H.c;
1714
+ var y, x, T, I, B, _, k, P, O, U, N, L, H = this, Z = H.c;
1715
1715
  if (h != null && (k = new w(h), !k.isInteger() && (k.c || k.s !== 1) || k.lt(a)))
1716
- throw Error(Yt + "Argument " + (k.isInteger() ? "out of range: " : "not an integer: ") + P(k));
1716
+ throw Error(Yt + "Argument " + (k.isInteger() ? "out of range: " : "not an integer: ") + S(k));
1717
1717
  if (!Z) return new w(H);
1718
- for (y = new w(a), O = x = new w(a), T = S = new w(a), L = gr(Z), B = y.e = L.length - H.e - 1, y.c[0] = cd[(_ = B % ke) < 0 ? ke + _ : _], h = !h || k.comparedTo(y) > 0 ? B > 0 ? y : O : k, _ = d, d = 1 / 0, k = new w(L), S.c[0] = 0; U = t(k, y, 0, 1), I = x.plus(U.times(T)), I.comparedTo(h) != 1; )
1719
- x = T, T = I, O = S.plus(U.times(I = O)), S = I, y = k.minus(U.times(I = y)), k = I;
1720
- return I = t(h.minus(x), T, 0, 1), S = S.plus(I.times(O)), x = x.plus(I.times(T)), S.s = O.s = H.s, B = B * 2, N = t(O, T, B, i).minus(H).abs().comparedTo(
1721
- t(S, x, B, i).minus(H).abs()
1722
- ) < 1 ? [O, T] : [S, x], d = _, N;
1718
+ for (y = new w(a), O = x = new w(a), T = P = new w(a), L = gr(Z), B = y.e = L.length - H.e - 1, y.c[0] = cd[(_ = B % ke) < 0 ? ke + _ : _], h = !h || k.comparedTo(y) > 0 ? B > 0 ? y : O : k, _ = d, d = 1 / 0, k = new w(L), P.c[0] = 0; U = t(k, y, 0, 1), I = x.plus(U.times(T)), I.comparedTo(h) != 1; )
1719
+ x = T, T = I, O = P.plus(U.times(I = O)), P = I, y = k.minus(U.times(I = y)), k = I;
1720
+ return I = t(h.minus(x), T, 0, 1), P = P.plus(I.times(O)), x = x.plus(I.times(T)), P.s = O.s = H.s, B = B * 2, N = t(O, T, B, i).minus(H).abs().comparedTo(
1721
+ t(P, x, B, i).minus(H).abs()
1722
+ ) < 1 ? [O, T] : [P, x], d = _, N;
1723
1723
  }, s.toNumber = function() {
1724
- return +P(this);
1724
+ return +S(this);
1725
1725
  }, s.toPrecision = function(h, y) {
1726
1726
  return h != null && ut(h, 1, It), A(this, h, y, 2);
1727
1727
  }, s.toString = function(h) {
1728
1728
  var y, x = this, T = x.s, I = x.e;
1729
1729
  return I === null ? T ? (y = "Infinity", T < 0 && (y = "-" + y)) : y = "NaN" : (h == null ? y = I <= c || I >= l ? Lc(gr(x.c), I) : wn(gr(x.c), I, "0") : h === 10 && v ? (x = R(new w(x), o + I + 1, i), y = wn(gr(x.c), x.e, "0")) : (ut(h, 2, E.length, "Base"), y = r(wn(gr(x.c), I, "0"), 10, h, T, !0)), T < 0 && x.c[0] && (y = "-" + y)), y;
1730
1730
  }, s.valueOf = s.toJSON = function() {
1731
- return P(this);
1731
+ return S(this);
1732
1732
  }, s._isBigNumber = !0, s[Symbol.toStringTag] = "BigNumber", s[Symbol.for("nodejs.util.inspect.custom")] = s.valueOf, e != null && w.set(e), w;
1733
1733
  }
1734
1734
  function vr(e) {
@@ -2187,18 +2187,18 @@ function fw(e) {
2187
2187
  const mw = {
2188
2188
  1: { dex: { sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
2189
2189
  14: { dex: { spark: { type: "default:spark", adapter: "0xB18c633B6584A33E45a8840a759f56dF17117b1D", fee: "0xaeA8C3e1a129A77686E115b1a46D9aD8405F7D2b" } } },
2190
- 56: { dex: { agent: { type: "default:odos-v2", router: "0x89b8AA89FDd0507a99d334CBe3C808fAFC7d850E", adapter: "0x67Feba015c968c76cCB2EEabf197b4578640BE2C", fee: "0x03A70aC8126340d3cd6b5828816172693C398661" }, thena: { type: "default:odos-v2", adapter: "0xB75218ba5A99bF57Fd02556B70F05A4A0f1Dbe67", fee: "0x15eBc8b5b3877512FFF23650188694A9a8891FAc" }, pancake: { type: "p2:pancakeswap-v2", adapter: "0x654272F7e6e6E912D38650f783eFd44452fD6ee5", fee: "0x37A957f10F458e0d7fDECBE2917971b57F15c927" }, newera: { type: "default:odos-v2", adapter: "0x845f459271D800f6Ab32D78400b8Aa18414E80b0", fee: "0x4E7454909eB6D539111D56b50d68897E933D2d11" } } },
2190
+ 56: { dex: { thena: { type: "default:odos-v2", adapter: "0xB75218ba5A99bF57Fd02556B70F05A4A0f1Dbe67", fee: "0x15eBc8b5b3877512FFF23650188694A9a8891FAc" }, pancake: { type: "p2:pancakeswap-v2", adapter: "0x654272F7e6e6E912D38650f783eFd44452fD6ee5", fee: "0x37A957f10F458e0d7fDECBE2917971b57F15c927" }, newera: { type: "default:odos-v2", adapter: "0x845f459271D800f6Ab32D78400b8Aa18414E80b0", fee: "0x4E7454909eB6D539111D56b50d68897E933D2d11" } } },
2191
2191
  137: { dex: { quick: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xd207DC6a6dA88f27c8DB78201F974161b1d84b1f" }, teafi: { type: "paraswap:paraswap-v5", adapter: "0xe95db7a60164B112C64cE67bA8587b1d4a0E0D29", fee: "0x04Ff96e2c4D62b5771795d307AD679a25b3D2D50" } } },
2192
2192
  143: { dex: { yowie: { type: "default:openocean-v2", adapter: "0x18bc9533c3539073B9A9acF12b0AbF7cB73e0F1f", fee: "0x6AF3eE77A3A3257777F5649aFa611b4C7Fd975Ef" }, pangolin: { type: "default:kyber-v2", adapter: "0xd7D9CAA2910f49F37AC3447f5cAd27153944354A", fee: "0xde92da99D188Ceb54A11ec711EF52D808A6260B5" } } },
2193
2193
  146: { dex: { spooky: { type: "default:magpie-v3", adapter: "0xdCee7FDdB932104329d528144Cd17A408722B7e2", fee: "0x840Df4684B35BC68BcdA3F6707A3c82A0D662f8b" }, swapx: { type: "default:openocean-v2", adapter: "0xecc733D6F6f2DEa341832D650E30822118884FEb", fee: "0x6E03f7BC0f141894612AA017796096399623895F" }, shadow: { type: "default:magpie-v3", adapter: "0x5f3E5F6ACCfc65243A01Da3E93b5A700285592C3", fee: "0xb9e3751fAF3187E1bC468E56a707a8A91754460e" } } },
2194
2194
  1329: { dex: { dragon: { type: "default:dragon", adapter: "0x02d9d5882129241b67ec21Ebc2C86e1BE9BC9890", fee: "0x0dc1E0525202b32e89bA78ed55b1e5cEdB751334" }, nami: { type: "default:openocean-v2", adapter: "0x2D4A1237A98f8cb03C3C85960e859aA44036a306", fee: "0xeB58450e23632003f013568703F54446070E2E80" } } },
2195
2195
  8453: { dex: { quick: { type: "default:kyber-v2", adapter: "0xc73F03c929A123Ee2f3A98EC18BB240f03980AE5", fee: "0xd207DC6a6dA88f27c8DB78201F974161b1d84b1f" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
2196
- 42161: { dex: { agent: { type: "default:odos-v2", router: "0xa669e7A0d4b3e4Fa48af2dE86BD4CD7126Be4e13", adapter: "0x026B8977319F67078e932a08feAcB59182B5380f", fee: "0x03A70aC8126340d3cd6b5828816172693C398661" }, arbidex: { type: "default:odos-v2", adapter: "0xa734b32151108139e48dCA06eE721538d90A9Ef6", fee: "0xa0c11852f8A44e32F9EC10AD25986A53842f72Ca" }, ramses: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xB5BaCB60ECDa0bEF809B2A26eC9B4B926835D7af" }, omni: { type: "paraswap:paraswap-v5", adapter: "0xa1baE146161223cd9dCa7137F68eb385934130BE", fee: "0xba5291526c30B097E9F1Fd1Be301E2ab6E0782aa" }, chronos: { type: "default:odos-v2", adapter: "0x4Ff90F32aceD08b3e3257B018EA495Fd1Bfe4455", fee: "0x5729af83240EFecAa18eafaAE82961c2DD045Dbe" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
2196
+ 42161: { dex: { arbidex: { type: "default:odos-v2", adapter: "0xa734b32151108139e48dCA06eE721538d90A9Ef6", fee: "0xa0c11852f8A44e32F9EC10AD25986A53842f72Ca" }, ramses: { type: "paraswap:paraswap-v5", adapter: "0x023fD6848234f2655818705237F77F02215FEfe5", fee: "0xB5BaCB60ECDa0bEF809B2A26eC9B4B926835D7af" }, omni: { type: "paraswap:paraswap-v5", adapter: "0xa1baE146161223cd9dCa7137F68eb385934130BE", fee: "0xba5291526c30B097E9F1Fd1Be301E2ab6E0782aa" }, chronos: { type: "default:odos-v2", adapter: "0x4Ff90F32aceD08b3e3257B018EA495Fd1Bfe4455", fee: "0x5729af83240EFecAa18eafaAE82961c2DD045Dbe" }, sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
2197
2197
  43114: { dex: { blackhole: { type: "default:kyber-v2", adapter: "0x426ec4bc0d58B80959CDE77576a1942dd40592Fa", fee: "0x7f8B62520D9B5DA0ED517cc36e8dcb2a356f1928" }, pangolin: { type: "default:kyber-v2", adapter: "0xd7D9CAA2910f49F37AC3447f5cAd27153944354A", fee: "0xde92da99D188Ceb54A11ec711EF52D808A6260B5" } } },
2198
2198
  59144: { dex: { lynex: { type: "default:openocean", adapter: "0x4FF6A97A67fe395212f168f011D71fE79E4396f2", fee: "0xcb36ed1B1BfAD8F7FC9651f52d21f04A68677423" } } },
2199
2199
  80094: { dex: { kodiak: { type: "default:kodiak", adapter: "0xBbaa527Aac00b1Ee9A3909D4D8c4447630E29B1F", fee: "0xBA47Ec15aFbCF6e7e9F52900632049530bB6bAe4" } } },
2200
2200
  747474: { dex: { sushiswap: { type: "default:sushi", router: "0xAC4c6e212A361c968F1725b4d055b47E63F80b75", adapter: "0x3Ee50D79e6D0205f325928AAFb041b63E1767Bc5", fee: "0x28F6C9dBE21fFc146Af8d5D15c49Cf48F61140Dc" } } },
2201
- "*": { wm: "0x0005d5cE0dB57e5BE3b2b8b6FeB75f0ccd015000", repermit: "0x00002a9C4D9497df5Bd31768eC5d30eEf5405000", cosigner: "0x000ECFa392ecDEfEE6e2a5C095d39B7A32f1E000", reactor: "0x000000b33fE4fB9d999Dd684F79b110731c3d000", executor: "0x000642A0966d9bd49870D9519f76b5cf823f3000", refinery: "0x000E474c0D7084EAA35A501035E73269f4b009A5", salt: { wm: "0xc9b46eae42dfeba3222a0315bf682f33cd5cc9d60c9625642e88406f8415f152", repermit: "0x4871dc9008e605821ea9677b65ea2a60ffb774afb31e0dcaea2e192880096be7", cosigner: "0x1117fe6f4e25c9380d10b2b3314a1e9b33e5f65ba0e55e0c63d0640db0dd60a2", reactor: "0xec73677f3a465a9755d4c9eab9509b59a24613fdb8b78719682930373e9876f5", executor: "0x9abc67d936f79e493f1f14050c2f6adb87ec208ff7aaae2e7ae788a7cb4796d7", refinery: "0x9746de29f1dd31b2c8460d71e92a7aefa34911130e61f274f37776e598c48bec" } }
2201
+ "*": { wm: "0x0005d5cE0dB57e5BE3b2b8b6FeB75f0ccd015000", repermit: "0x00002a9C4D9497df5Bd31768eC5d30eEf5405000", cosigner: "0x0007ec53404c423C935e830ec21903e184690000", reactor: "0x0006a959430e8fBB858D81B2D1140B0ae5c26001", executor: "0x000eBA869d76C618ddc4A6D685A0820A620Ce002", refinery: "0x000E474c0D7084EAA35A501035E73269f4b009A5", salt: { wm: "0xc9b46eae42dfeba3222a0315bf682f33cd5cc9d60c9625642e88406f8415f152", repermit: "0x4871dc9008e605821ea9677b65ea2a60ffb774afb31e0dcaea2e192880096be7", cosigner: "0x37576f2ac1d2a602f00777611edf6f0cbc27611b0980b29bc7856fa79b2b8073", reactor: "0x034169222370f2fd587ef8998082d762cceef58a272330215f5110ec0d76d400", executor: "0xea139bc421fa5e272bed3db74233b2e02077e0aacf8b855f87961e98f2fb467f", refinery: "0x9746de29f1dd31b2c8460d71e92a7aefa34911130e61f274f37776e598c48bec" } }
2202
2202
  };
2203
2203
  var ud, Gm;
2204
2204
  function hw() {
@@ -2210,17 +2210,13 @@ function hw() {
2210
2210
  reactor: t("OrderReactor"),
2211
2211
  executor: t("Executor"),
2212
2212
  refinery: t("Refinery"),
2213
- settler: t("Settler"),
2214
2213
  adapter: t("DefaultDexAdapter")
2215
2214
  });
2216
2215
  function n(s, a) {
2217
- if (!s) return;
2216
+ if (!s || !(a != null && a.trim())) return;
2218
2217
  const { dex: o, ...i } = e["*"] ?? {}, c = e[s];
2219
2218
  if (!c) return;
2220
- const { dex: l, ...u } = c;
2221
- if (!(a != null && a.trim()))
2222
- return { ...i, ...u };
2223
- const d = l == null ? void 0 : l[a];
2219
+ const { dex: l, ...u } = c, d = l == null ? void 0 : l[a];
2224
2220
  if (d)
2225
2221
  return { ...i, ...u, ...d };
2226
2222
  }
@@ -2495,37 +2491,38 @@ const bw = (e, t, r) => {
2495
2491
  dstMinAmountPerTrade: l = "0",
2496
2492
  triggerAmountPerTrade: u = "0",
2497
2493
  config: d,
2498
- module: f
2494
+ module: f,
2495
+ feePercentage: m
2499
2496
  }) => {
2500
- const { nonce: m, epoch: b, deadline: g, freshness: E } = Cb(
2497
+ const { nonce: b, epoch: g, deadline: E, freshness: v } = Cb(
2501
2498
  a,
2502
2499
  s
2503
- ), v = Math.floor(Date.now() / 1e3).toString(), w = l, A = f === xe.STOP_LOSS ? u : "0", C = f === xe.TAKE_PROFIT ? u : "0", F = {
2500
+ ), w = Math.floor(Date.now() / 1e3).toString(), A = l, C = m * 100, F = f === xe.STOP_LOSS ? u : "0", R = f === xe.TAKE_PROFIT ? u : "0", S = {
2504
2501
  permitted: {
2505
2502
  token: t,
2506
2503
  amount: n
2507
2504
  },
2508
2505
  spender: d.reactor,
2509
- nonce: m,
2510
- deadline: g,
2506
+ nonce: b,
2507
+ deadline: E,
2511
2508
  witness: {
2512
2509
  reactor: d.reactor,
2513
2510
  executor: d.executor,
2514
2511
  exchange: {
2515
2512
  adapter: d.adapter,
2516
2513
  ref: d.fee,
2517
- share: 0,
2514
+ share: C,
2518
2515
  data: "0x"
2519
2516
  },
2520
2517
  swapper: i,
2521
- nonce: m,
2522
- start: v,
2523
- deadline: g,
2518
+ nonce: b,
2519
+ start: w,
2520
+ deadline: E,
2524
2521
  chainid: e,
2525
2522
  exclusivity: 0,
2526
- epoch: b,
2523
+ epoch: g,
2527
2524
  slippage: o,
2528
- freshness: E,
2525
+ freshness: v,
2529
2526
  input: {
2530
2527
  token: t,
2531
2528
  amount: c,
@@ -2533,9 +2530,9 @@ const bw = (e, t, r) => {
2533
2530
  },
2534
2531
  output: {
2535
2532
  token: r,
2536
- limit: z(w || 0).toFixed(),
2537
- triggerLower: z(A || 0).toFixed(),
2538
- triggerUpper: z(C || 0).toFixed(),
2533
+ limit: z(A || 0).toFixed(),
2534
+ triggerLower: z(F || 0).toFixed(),
2535
+ triggerUpper: z(R || 0).toFixed(),
2539
2536
  recipient: i
2540
2537
  }
2541
2538
  }
@@ -2547,11 +2544,11 @@ const bw = (e, t, r) => {
2547
2544
  chainId: e,
2548
2545
  verifyingContract: d.repermit
2549
2546
  },
2550
- order: F,
2547
+ order: S,
2551
2548
  types: iw,
2552
2549
  primaryType: wb
2553
2550
  };
2554
- }, zw = (e) => iu() ? Lw(e) : Nw(e), $w = "1.9.4", Hw = {
2551
+ }, zw = (e) => iu() ? Lw(e) : Nw(e), $w = "1.10.0", Hw = {
2555
2552
  version: $w
2556
2553
  }, Gw = 0.7, jw = `https://bi.orbs.network/putes/twap-ui-${Gw}`, Tb = Hw.version;
2557
2554
  let cp = "unknown";
@@ -3239,7 +3236,7 @@ const p3 = async ({
3239
3236
  }) => (await Promise.all([
3240
3237
  s ? p3({ chainId: r, signal: e, page: t, limit: n, filters: { accounts: [a], configs: s.twapConfig ? [s.twapConfig] : [] } }) : Promise.resolve([]),
3241
3238
  n3({ chainId: r, signal: e, account: a, exchange: s == null ? void 0 : s.adapter })
3242
- ]).then(([c, l]) => [...c, ...l])).sort((c, l) => l.createdAt - c.createdAt), b3 = "0.0.102", y3 = {
3239
+ ]).then(([c, l]) => [...c, ...l])).sort((c, l) => l.createdAt - c.createdAt), b3 = "0.0.103", y3 = {
3243
3240
  version: b3
3244
3241
  };
3245
3242
  var vo = class {
@@ -3828,12 +3825,12 @@ var Ws, cb, Db = (cb = class {
3828
3825
  });
3829
3826
  }, a = () => {
3830
3827
  const C = Bb(this.options, r), R = (() => {
3831
- const P = {
3828
+ const S = {
3832
3829
  client: M(this, Ks),
3833
3830
  queryKey: this.queryKey,
3834
3831
  meta: this.meta
3835
3832
  };
3836
- return s(P), P;
3833
+ return s(S), S;
3837
3834
  })();
3838
3835
  return X(this, Ys, !1), this.options.persister ? this.options.persister(
3839
3836
  C,
@@ -4321,7 +4318,7 @@ function eh(e) {
4321
4318
  return Promise.reject();
4322
4319
  if (C == null && A.pages.length)
4323
4320
  return Promise.resolve(A);
4324
- const P = (() => {
4321
+ const S = (() => {
4325
4322
  const T = {
4326
4323
  client: t.client,
4327
4324
  queryKey: t.queryKey,
@@ -4330,7 +4327,7 @@ function eh(e) {
4330
4327
  meta: t.options.meta
4331
4328
  };
4332
4329
  return E(T), T;
4333
- })(), h = await v(P), { maxPages: y } = t.options, x = F ? T3 : C3;
4330
+ })(), h = await v(S), { maxPages: y } = t.options, x = F ? T3 : C3;
4334
4331
  return {
4335
4332
  pages: x(A.pages, h, y),
4336
4333
  pageParams: x(A.pageParams, C, y)
@@ -4422,7 +4419,7 @@ var Ji, nn, jt, Js, sn, ss, db, M3 = (db = class extends Db {
4422
4419
  this.execute(this.state.variables);
4423
4420
  }
4424
4421
  async execute(t) {
4425
- var o, i, c, l, u, d, f, m, b, g, E, v, w, A, C, F, R, P, h, y;
4422
+ var o, i, c, l, u, d, f, m, b, g, E, v, w, A, C, F, R, S, h, y;
4426
4423
  const r = () => {
4427
4424
  Se(this, sn, ss).call(this, { type: "continue" });
4428
4425
  }, n = {
@@ -4512,7 +4509,7 @@ var Ji, nn, jt, Js, sn, ss, db, M3 = (db = class extends Db {
4512
4509
  t,
4513
4510
  this.state.context,
4514
4511
  n
4515
- )), await ((P = (R = M(this, jt).config).onSettled) == null ? void 0 : P.call(
4512
+ )), await ((S = (R = M(this, jt).config).onSettled) == null ? void 0 : S.call(
4516
4513
  R,
4517
4514
  void 0,
4518
4515
  x,
@@ -9821,12 +9818,12 @@ class Hy extends zy {
9821
9818
  for (let A = 0; A < 16; A++, r += 4)
9822
9819
  rs[A] = t.getUint32(r), ns[A] = t.getUint32(r += 4);
9823
9820
  for (let A = 16; A < 80; A++) {
9824
- const C = rs[A - 15] | 0, F = ns[A - 15] | 0, R = Ta(C, F, 1) ^ Ta(C, F, 8) ^ xh(C, F, 7), P = Aa(C, F, 1) ^ Aa(C, F, 8) ^ wh(C, F, 7), h = rs[A - 2] | 0, y = ns[A - 2] | 0, x = Ta(h, y, 19) ^ Hc(h, y, 61) ^ xh(h, y, 6), T = Aa(h, y, 19) ^ Gc(h, y, 61) ^ wh(h, y, 6), I = Hv(P, T, ns[A - 7], ns[A - 16]), B = Gv(I, R, x, rs[A - 7], rs[A - 16]);
9821
+ const C = rs[A - 15] | 0, F = ns[A - 15] | 0, R = Ta(C, F, 1) ^ Ta(C, F, 8) ^ xh(C, F, 7), S = Aa(C, F, 1) ^ Aa(C, F, 8) ^ wh(C, F, 7), h = rs[A - 2] | 0, y = ns[A - 2] | 0, x = Ta(h, y, 19) ^ Hc(h, y, 61) ^ xh(h, y, 6), T = Aa(h, y, 19) ^ Gc(h, y, 61) ^ wh(h, y, 6), I = Hv(S, T, ns[A - 7], ns[A - 16]), B = Gv(I, R, x, rs[A - 7], rs[A - 16]);
9825
9822
  rs[A] = B | 0, ns[A] = I | 0;
9826
9823
  }
9827
9824
  let { Ah: n, Al: s, Bh: a, Bl: o, Ch: i, Cl: c, Dh: l, Dl: u, Eh: d, El: f, Fh: m, Fl: b, Gh: g, Gl: E, Hh: v, Hl: w } = this;
9828
9825
  for (let A = 0; A < 80; A++) {
9829
- const C = Ta(d, f, 14) ^ Ta(d, f, 18) ^ Hc(d, f, 41), F = Aa(d, f, 14) ^ Aa(d, f, 18) ^ Gc(d, f, 41), R = d & m ^ ~d & g, P = f & b ^ ~f & E, h = jv(w, F, P, Ck[A], ns[A]), y = Vv(h, v, C, R, kk[A], rs[A]), x = h | 0, T = Ta(n, s, 28) ^ Hc(n, s, 34) ^ Hc(n, s, 39), I = Aa(n, s, 28) ^ Gc(n, s, 34) ^ Gc(n, s, 39), B = n & a ^ n & i ^ a & i, _ = s & o ^ s & c ^ o & c;
9826
+ const C = Ta(d, f, 14) ^ Ta(d, f, 18) ^ Hc(d, f, 41), F = Aa(d, f, 14) ^ Aa(d, f, 18) ^ Gc(d, f, 41), R = d & m ^ ~d & g, S = f & b ^ ~f & E, h = jv(w, F, S, Ck[A], ns[A]), y = Vv(h, v, C, R, kk[A], rs[A]), x = h | 0, T = Ta(n, s, 28) ^ Hc(n, s, 34) ^ Hc(n, s, 39), I = Aa(n, s, 28) ^ Gc(n, s, 34) ^ Gc(n, s, 39), B = n & a ^ n & i ^ a & i, _ = s & o ^ s & c ^ o & c;
9830
9827
  v = g | 0, w = E | 0, g = m | 0, E = b | 0, m = d | 0, b = f | 0, { h: d, l: f } = kn(l | 0, u | 0, y | 0, x | 0), l = i | 0, u = c | 0, i = a | 0, c = o | 0, a = n | 0, o = s | 0;
9831
9828
  const k = zv(x, I, _);
9832
9829
  n = $v(k, y, T, B), s = k | 0;
@@ -9977,7 +9974,7 @@ async function s0(e, t) {
9977
9974
  });
9978
9975
  })();
9979
9976
  bn(t);
9980
- const F = (y = (h = a == null ? void 0 : a.formatters) == null ? void 0 : h.transactionRequest) == null ? void 0 : y.format, P = (F || Xr)({
9977
+ const F = (y = (h = a == null ? void 0 : a.formatters) == null ? void 0 : h.transactionRequest) == null ? void 0 : y.format, S = (F || Xr)({
9981
9978
  // Pick out extra data that might exist on the chain's transaction request type.
9982
9979
  ...ga(A, { format: F }),
9983
9980
  account: r ? Je(r) : void 0,
@@ -9999,10 +9996,10 @@ async function s0(e, t) {
9999
9996
  try {
10000
9997
  const B = await e.request({
10001
9998
  method: "eth_fillTransaction",
10002
- params: [P]
9999
+ params: [S]
10003
10000
  }), k = (((T = (x = a == null ? void 0 : a.formatters) == null ? void 0 : x.transaction) == null ? void 0 : T.format) || xa)(B.tx);
10004
10001
  delete k.blockHash, delete k.blockNumber, delete k.r, delete k.s, delete k.transactionIndex, delete k.v, delete k.yParity, k.data = k.input, k.gas && (k.gas = t.gas ?? k.gas), k.gasPrice && (k.gasPrice = t.gasPrice ?? k.gasPrice), k.maxFeePerBlobGas && (k.maxFeePerBlobGas = t.maxFeePerBlobGas ?? k.maxFeePerBlobGas), k.maxFeePerGas && (k.maxFeePerGas = t.maxFeePerGas ?? k.maxFeePerGas), k.maxPriorityFeePerGas && (k.maxPriorityFeePerGas = t.maxPriorityFeePerGas ?? k.maxPriorityFeePerGas), k.nonce && (k.nonce = t.nonce ?? k.nonce);
10005
- const S = await (async () => {
10002
+ const P = await (async () => {
10006
10003
  var L, H;
10007
10004
  if (typeof ((L = a == null ? void 0 : a.fees) == null ? void 0 : L.baseFeeMultiplier) == "function") {
10008
10005
  const Z = await se(e, zr, "getBlock")({});
@@ -10014,13 +10011,13 @@ async function s0(e, t) {
10014
10011
  }
10015
10012
  return ((H = a == null ? void 0 : a.fees) == null ? void 0 : H.baseFeeMultiplier) ?? 1.2;
10016
10013
  })();
10017
- if (S < 1)
10014
+ if (P < 1)
10018
10015
  throw new My();
10019
- const U = 10 ** (((I = S.toString().split(".")[1]) == null ? void 0 : I.length) ?? 0), N = (L) => L * BigInt(Math.ceil(S * U)) / BigInt(U);
10016
+ const U = 10 ** (((I = P.toString().split(".")[1]) == null ? void 0 : I.length) ?? 0), N = (L) => L * BigInt(Math.ceil(P * U)) / BigInt(U);
10020
10017
  return k.maxFeePerGas && !t.maxFeePerGas && (k.maxFeePerGas = N(k.maxFeePerGas)), k.gasPrice && !t.gasPrice && (k.gasPrice = N(k.gasPrice)), {
10021
10018
  raw: B.raw,
10022
10019
  transaction: {
10023
- from: P.from,
10020
+ from: S.from,
10024
10021
  ...k
10025
10022
  }
10026
10023
  };
@@ -10062,22 +10059,22 @@ async function dc(e, t) {
10062
10059
  const u = n && Je(n);
10063
10060
  let d = r.nonce;
10064
10061
  if (o.includes("nonce") && typeof d > "u" && u && a) {
10065
- const P = await l();
10062
+ const S = await l();
10066
10063
  d = await a.consume({
10067
10064
  address: u.address,
10068
- chainId: P,
10065
+ chainId: S,
10069
10066
  client: e
10070
10067
  });
10071
10068
  }
10072
10069
  i != null && i.fn && ((C = i.runAt) != null && C.includes("beforeFillTransaction")) && (r = await i.fn({ ...r, chain: s }, {
10073
10070
  phase: "beforeFillTransaction"
10074
10071
  }), d ?? (d = r.nonce));
10075
- const m = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && r.kzg && r.blobs || gd.get(e.uid) === !1 || !["fees", "gas"].some((h) => o.includes(h)) ? !1 : !!(o.includes("chainId") && typeof r.chainId != "number" || o.includes("nonce") && typeof d != "number" || o.includes("fees") && typeof r.gasPrice != "bigint" && (typeof r.maxFeePerGas != "bigint" || typeof r.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof r.gas != "bigint")) ? await se(e, s0, "fillTransaction")({ ...r, nonce: d }).then((P) => {
10076
- const { chainId: h, from: y, gas: x, gasPrice: T, nonce: I, maxFeePerBlobGas: B, maxFeePerGas: _, maxPriorityFeePerGas: k, type: S, ...O } = P.transaction;
10072
+ const m = ((o.includes("blobVersionedHashes") || o.includes("sidecars")) && r.kzg && r.blobs || gd.get(e.uid) === !1 || !["fees", "gas"].some((h) => o.includes(h)) ? !1 : !!(o.includes("chainId") && typeof r.chainId != "number" || o.includes("nonce") && typeof d != "number" || o.includes("fees") && typeof r.gasPrice != "bigint" && (typeof r.maxFeePerGas != "bigint" || typeof r.maxPriorityFeePerGas != "bigint") || o.includes("gas") && typeof r.gas != "bigint")) ? await se(e, s0, "fillTransaction")({ ...r, nonce: d }).then((S) => {
10073
+ const { chainId: h, from: y, gas: x, gasPrice: T, nonce: I, maxFeePerBlobGas: B, maxFeePerGas: _, maxPriorityFeePerGas: k, type: P, ...O } = S.transaction;
10077
10074
  return gd.set(e.uid, !0), {
10078
10075
  ...r,
10079
10076
  ...y ? { from: y } : {},
10080
- ...S ? { type: S } : {},
10077
+ ...P ? { type: P } : {},
10081
10078
  ...typeof h < "u" ? { chainId: h } : {},
10082
10079
  ...typeof x < "u" ? { gas: x } : {},
10083
10080
  ...typeof T < "u" ? { gasPrice: T } : {},
@@ -10087,9 +10084,9 @@ async function dc(e, t) {
10087
10084
  ...typeof k < "u" ? { maxPriorityFeePerGas: k } : {},
10088
10085
  ..."nonceKey" in O && typeof O.nonceKey < "u" ? { nonceKey: O.nonceKey } : {}
10089
10086
  };
10090
- }).catch((P) => {
10087
+ }).catch((S) => {
10091
10088
  var x;
10092
- const h = P;
10089
+ const h = S;
10093
10090
  return h.name !== "TransactionExecutionError" || ((x = h.walk) == null ? void 0 : x.call(h, (T) => {
10094
10091
  const I = T;
10095
10092
  return I.name === "MethodNotFoundRpcError" || I.name === "MethodNotSupportedRpcError";
@@ -10112,18 +10109,18 @@ async function dc(e, t) {
10112
10109
  address: u.address,
10113
10110
  blockTag: "pending"
10114
10111
  })), (o.includes("blobVersionedHashes") || o.includes("sidecars")) && b && E) {
10115
- const P = Jf({ blobs: b, kzg: E });
10112
+ const S = Jf({ blobs: b, kzg: E });
10116
10113
  if (o.includes("blobVersionedHashes")) {
10117
10114
  const h = Vy({
10118
- commitments: P,
10115
+ commitments: S,
10119
10116
  to: "hex"
10120
10117
  });
10121
10118
  r.blobVersionedHashes = h;
10122
10119
  }
10123
10120
  if (o.includes("sidecars")) {
10124
- const h = e0({ blobs: b, commitments: P, kzg: E }), y = Zy({
10121
+ const h = e0({ blobs: b, commitments: S, kzg: E }), y = Zy({
10125
10122
  blobs: b,
10126
- commitments: P,
10123
+ commitments: S,
10127
10124
  proofs: h,
10128
10125
  to: "hex"
10129
10126
  });
@@ -10134,18 +10131,18 @@ async function dc(e, t) {
10134
10131
  try {
10135
10132
  r.type = n0(r);
10136
10133
  } catch {
10137
- let P = _h.get(e.uid);
10138
- if (typeof P > "u") {
10134
+ let S = _h.get(e.uid);
10135
+ if (typeof S > "u") {
10139
10136
  const h = await A();
10140
- P = typeof (h == null ? void 0 : h.baseFeePerGas) == "bigint", _h.set(e.uid, P);
10137
+ S = typeof (h == null ? void 0 : h.baseFeePerGas) == "bigint", _h.set(e.uid, S);
10141
10138
  }
10142
- r.type = P ? "eip1559" : "legacy";
10139
+ r.type = S ? "eip1559" : "legacy";
10143
10140
  }
10144
10141
  if (o.includes("fees"))
10145
10142
  if (r.type !== "legacy" && r.type !== "eip2930") {
10146
10143
  if (typeof r.maxFeePerGas > "u" || typeof r.maxPriorityFeePerGas > "u") {
10147
- const P = await A(), { maxFeePerGas: h, maxPriorityFeePerGas: y } = await Hp(e, {
10148
- block: P,
10144
+ const S = await A(), { maxFeePerGas: h, maxPriorityFeePerGas: y } = await Hp(e, {
10145
+ block: S,
10149
10146
  chain: s,
10150
10147
  request: r
10151
10148
  });
@@ -10159,8 +10156,8 @@ async function dc(e, t) {
10159
10156
  if (typeof r.maxFeePerGas < "u" || typeof r.maxPriorityFeePerGas < "u")
10160
10157
  throw new Kf();
10161
10158
  if (typeof r.gasPrice > "u") {
10162
- const P = await A(), { gasPrice: h } = await Hp(e, {
10163
- block: P,
10159
+ const S = await A(), { gasPrice: h } = await Hp(e, {
10160
+ block: S,
10164
10161
  chain: s,
10165
10162
  request: r,
10166
10163
  type: "legacy"
@@ -10194,7 +10191,7 @@ async function o0(e, t) {
10194
10191
  }).catch(() => {
10195
10192
  throw new $("`to` is required. Could not infer from `authorizationList`");
10196
10193
  });
10197
- })(), { accessList: u, authorizationList: d, blobs: f, blobVersionedHashes: m, blockNumber: b, blockTag: g, data: E, gas: v, gasPrice: w, maxFeePerBlobGas: A, maxFeePerGas: C, maxPriorityFeePerGas: F, nonce: R, value: P, stateOverride: h, ...y } = n ? await dc(e, {
10194
+ })(), { accessList: u, authorizationList: d, blobs: f, blobVersionedHashes: m, blockNumber: b, blockTag: g, data: E, gas: v, gasPrice: w, maxFeePerBlobGas: A, maxFeePerGas: C, maxPriorityFeePerGas: F, nonce: R, value: S, stateOverride: h, ...y } = n ? await dc(e, {
10198
10195
  ...t,
10199
10196
  parameters: a,
10200
10197
  to: l
@@ -10218,7 +10215,7 @@ async function o0(e, t) {
10218
10215
  maxPriorityFeePerGas: F,
10219
10216
  nonce: R,
10220
10217
  to: l,
10221
- value: P
10218
+ value: S
10222
10219
  }, "estimateGas");
10223
10220
  return BigInt(await e.request({
10224
10221
  method: "eth_estimateGas",
@@ -11843,8 +11840,8 @@ function wg({ fn: e, id: t, shouldSplitBatch: r, wait: n = 0, sort: s }) {
11843
11840
  };
11844
11841
  }
11845
11842
  async function Au(e, t) {
11846
- var B, _, k, S;
11847
- const { account: r = e.account, authorizationList: n, batch: s = !!((B = e.batch) != null && B.multicall), blockNumber: a, blockTag: o = e.experimental_blockTag ?? "latest", accessList: i, blobs: c, blockOverrides: l, code: u, data: d, factory: f, factoryData: m, gas: b, gasPrice: g, maxFeePerBlobGas: E, maxFeePerGas: v, maxPriorityFeePerGas: w, nonce: A, to: C, value: F, stateOverride: R, ...P } = t, h = r ? Je(r) : void 0;
11843
+ var B, _, k, P;
11844
+ const { account: r = e.account, authorizationList: n, batch: s = !!((B = e.batch) != null && B.multicall), blockNumber: a, blockTag: o = e.experimental_blockTag ?? "latest", accessList: i, blobs: c, blockOverrides: l, code: u, data: d, factory: f, factoryData: m, gas: b, gasPrice: g, maxFeePerBlobGas: E, maxFeePerGas: v, maxPriorityFeePerGas: w, nonce: A, to: C, value: F, stateOverride: R, ...S } = t, h = r ? Je(r) : void 0;
11848
11845
  if (u && (f || m))
11849
11846
  throw new $("Cannot provide both `code` & `factory`/`factoryData` as parameters.");
11850
11847
  if (u && C)
@@ -11860,9 +11857,9 @@ async function Au(e, t) {
11860
11857
  }) : d;
11861
11858
  try {
11862
11859
  bn(t);
11863
- const U = (typeof a == "bigint" ? V(a) : void 0) || o, N = l ? fg(l) : void 0, L = qf(R), H = (S = (k = (_ = e.chain) == null ? void 0 : _.formatters) == null ? void 0 : k.transactionRequest) == null ? void 0 : S.format, fe = (H || Xr)({
11860
+ const U = (typeof a == "bigint" ? V(a) : void 0) || o, N = l ? fg(l) : void 0, L = qf(R), H = (P = (k = (_ = e.chain) == null ? void 0 : _.formatters) == null ? void 0 : k.transactionRequest) == null ? void 0 : P.format, fe = (H || Xr)({
11864
11861
  // Pick out extra data that might exist on the chain's transaction request type.
11865
- ...ga(P, { format: H }),
11862
+ ...ga(S, { format: H }),
11866
11863
  accessList: i,
11867
11864
  account: h,
11868
11865
  authorizationList: n,
@@ -11900,7 +11897,7 @@ async function Au(e, t) {
11900
11897
  });
11901
11898
  return ie === "0x" ? { data: void 0 } : { data: ie };
11902
11899
  } catch (O) {
11903
- const U = C7(O), { offchainLookup: N, offchainLookupSignature: L } = await import("./ccip-AR1zTcOj.js");
11900
+ const U = C7(O), { offchainLookup: N, offchainLookupSignature: L } = await import("./ccip-CoUpV1TR.js");
11904
11901
  if (e.ccipRead !== !1 && (U == null ? void 0 : U.slice(0, 10)) === L && C)
11905
11902
  return { data: await N(e, { data: U, to: C }) };
11906
11903
  throw T && (U == null ? void 0 : U.slice(0, 10)) === "0x101bb98d" ? new JE({ factory: f }) : m0(O, {
@@ -12184,7 +12181,7 @@ function U7(e, t) {
12184
12181
  i !== void 0 && (A = i - 1n);
12185
12182
  let C, F = !1;
12186
12183
  const R = So(async () => {
12187
- var P;
12184
+ var S;
12188
12185
  if (!F) {
12189
12186
  try {
12190
12187
  C = await se(e, Cy, "createContractEventFilter")({
@@ -12224,7 +12221,7 @@ function U7(e, t) {
12224
12221
  for (const y of h)
12225
12222
  w.onLogs([y]);
12226
12223
  } catch (h) {
12227
- C && h instanceof Es && (F = !1), (P = w.onError) == null || P.call(w, h);
12224
+ C && h instanceof Es && (F = !1), (S = w.onError) == null || S.call(w, h);
12228
12225
  }
12229
12226
  }, {
12230
12227
  emitOnBegin: !0,
@@ -12258,7 +12255,7 @@ function U7(e, t) {
12258
12255
  abi: r,
12259
12256
  eventName: o,
12260
12257
  args: s
12261
- }) : [], { unsubscribe: P } = await F.subscribe({
12258
+ }) : [], { unsubscribe: S } = await F.subscribe({
12262
12259
  params: ["logs", { address: n, topics: R }],
12263
12260
  onData(h) {
12264
12261
  var x;
@@ -12295,7 +12292,7 @@ function U7(e, t) {
12295
12292
  (y = C.onError) == null || y.call(C, h);
12296
12293
  }
12297
12294
  });
12298
- A = P, w || A();
12295
+ A = S, w || A();
12299
12296
  } catch (F) {
12300
12297
  c == null || c(F);
12301
12298
  }
@@ -12358,9 +12355,9 @@ async function Iu(e, t) {
12358
12355
  });
12359
12356
  })();
12360
12357
  if ((v == null ? void 0 : v.type) === "json-rpc" || v === null) {
12361
- let P;
12362
- n !== null && (P = await se(e, Ps, "getChainId")({}), b0({
12363
- currentChainId: P,
12358
+ let S;
12359
+ n !== null && (S = await se(e, Ps, "getChainId")({}), b0({
12360
+ currentChainId: S,
12364
12361
  chain: n
12365
12362
  }));
12366
12363
  const h = (C = (A = (w = e.chain) == null ? void 0 : w.formatters) == null ? void 0 : A.transactionRequest) == null ? void 0 : C.format, x = (h || Xr)({
@@ -12370,7 +12367,7 @@ async function Iu(e, t) {
12370
12367
  account: v,
12371
12368
  authorizationList: a,
12372
12369
  blobs: o,
12373
- chainId: P,
12370
+ chainId: S,
12374
12371
  data: i,
12375
12372
  gas: c,
12376
12373
  gasPrice: l,
@@ -12396,14 +12393,14 @@ async function Iu(e, t) {
12396
12393
  method: "wallet_sendTransaction",
12397
12394
  params: [x]
12398
12395
  }, { retryCount: 0 }).then((k) => (Td.set(e.uid, !0), k)).catch((k) => {
12399
- const S = k;
12400
- throw S.name === "MethodNotFoundRpcError" || S.name === "MethodNotSupportedRpcError" ? (Td.set(e.uid, !1), _) : S;
12396
+ const P = k;
12397
+ throw P.name === "MethodNotFoundRpcError" || P.name === "MethodNotSupportedRpcError" ? (Td.set(e.uid, !1), _) : P;
12401
12398
  });
12402
12399
  throw _;
12403
12400
  }
12404
12401
  }
12405
12402
  if ((v == null ? void 0 : v.type) === "local") {
12406
- const P = await se(e, dc, "prepareTransactionRequest")({
12403
+ const S = await se(e, dc, "prepareTransactionRequest")({
12407
12404
  account: v,
12408
12405
  accessList: s,
12409
12406
  authorizationList: a,
@@ -12422,7 +12419,7 @@ async function Iu(e, t) {
12422
12419
  value: g,
12423
12420
  ...E,
12424
12421
  to: R
12425
- }), h = (F = n == null ? void 0 : n.serializers) == null ? void 0 : F.transaction, y = await v.signTransaction(P, {
12422
+ }), h = (F = n == null ? void 0 : n.serializers) == null ? void 0 : F.transaction, y = await v.signTransaction(S, {
12426
12423
  serializer: h
12427
12424
  });
12428
12425
  return await se(e, y0, "sendRawTransaction")({
@@ -12733,8 +12730,8 @@ function Ig(e) {
12733
12730
  function w(A) {
12734
12731
  return (C) => {
12735
12732
  const F = C(A);
12736
- for (const P in v)
12737
- delete F[P];
12733
+ for (const S in v)
12734
+ delete F[S];
12738
12735
  const R = { ...A, ...F };
12739
12736
  return Object.assign(R, { extend: w(R) });
12740
12737
  };
@@ -13237,7 +13234,7 @@ async function Dg(e, t) {
13237
13234
  const { account: r = e.account, blockNumber: n, blockTag: s = "latest", blobs: a, data: o, gas: i, gasPrice: c, maxFeePerBlobGas: l, maxFeePerGas: u, maxPriorityFeePerGas: d, to: f, value: m, ...b } = t, g = r ? Je(r) : void 0;
13238
13235
  try {
13239
13236
  bn(t);
13240
- const C = (typeof n == "bigint" ? V(n) : void 0) || s, F = (w = (v = (E = e.chain) == null ? void 0 : E.formatters) == null ? void 0 : v.transactionRequest) == null ? void 0 : w.format, P = (F || Xr)({
13237
+ const C = (typeof n == "bigint" ? V(n) : void 0) || s, F = (w = (v = (E = e.chain) == null ? void 0 : E.formatters) == null ? void 0 : v.transactionRequest) == null ? void 0 : w.format, S = (F || Xr)({
13241
13238
  // Pick out extra data that might exist on the chain's transaction request type.
13242
13239
  ...ga(b, { format: F }),
13243
13240
  account: g,
@@ -13252,7 +13249,7 @@ async function Dg(e, t) {
13252
13249
  value: m
13253
13250
  }, "createAccessList"), h = await e.request({
13254
13251
  method: "eth_createAccessList",
13255
- params: [P, C]
13252
+ params: [S, C]
13256
13253
  });
13257
13254
  return {
13258
13255
  accessList: h.accessList,
@@ -15667,8 +15664,8 @@ function Z9(e) {
15667
15664
  return { x: F, y: R };
15668
15665
  });
15669
15666
  function o(A) {
15670
- const { a: C, b: F } = t, R = r.sqr(A), P = r.mul(R, A);
15671
- return r.add(r.add(P, r.mul(A, C)), F);
15667
+ const { a: C, b: F } = t, R = r.sqr(A), S = r.mul(R, A);
15668
+ return r.add(r.add(S, r.mul(A, C)), F);
15672
15669
  }
15673
15670
  function i(A, C) {
15674
15671
  const F = r.sqr(C), R = o(A);
@@ -15683,7 +15680,7 @@ function Z9(e) {
15683
15680
  return d0(A, Ft, t.n);
15684
15681
  }
15685
15682
  function d(A) {
15686
- const { allowedPrivateKeyLengths: C, nByteLength: F, wrapPrivateKey: R, n: P } = t;
15683
+ const { allowedPrivateKeyLengths: C, nByteLength: F, wrapPrivateKey: R, n: S } = t;
15687
15684
  if (C && typeof A != "bigint") {
15688
15685
  if (fc(A) && (A = Oi(A)), typeof A != "string" || !C.includes(A.length))
15689
15686
  throw new Error("invalid private key");
@@ -15695,19 +15692,19 @@ function Z9(e) {
15695
15692
  } catch {
15696
15693
  throw new Error("invalid private key, expected hex or " + F + " bytes, got " + typeof A);
15697
15694
  }
15698
- return R && (h = er(h, P)), Ha("private key", h, Ft, P), h;
15695
+ return R && (h = er(h, S)), Ha("private key", h, Ft, S), h;
15699
15696
  }
15700
15697
  function f(A) {
15701
15698
  if (!(A instanceof g))
15702
15699
  throw new Error("ProjectivePoint expected");
15703
15700
  }
15704
15701
  const m = Lh((A, C) => {
15705
- const { px: F, py: R, pz: P } = A;
15706
- if (r.eql(P, r.ONE))
15702
+ const { px: F, py: R, pz: S } = A;
15703
+ if (r.eql(S, r.ONE))
15707
15704
  return { x: F, y: R };
15708
15705
  const h = A.is0();
15709
- C == null && (C = h ? r.ONE : r.inv(P));
15710
- const y = r.mul(F, C), x = r.mul(R, C), T = r.mul(P, C);
15706
+ C == null && (C = h ? r.ONE : r.inv(S));
15707
+ const y = r.mul(F, C), x = r.mul(R, C), T = r.mul(S, C);
15711
15708
  if (h)
15712
15709
  return { x: r.ZERO, y: r.ZERO };
15713
15710
  if (!r.eql(T, r.ONE))
@@ -15746,8 +15743,8 @@ function Z9(e) {
15746
15743
  throw new Error("invalid affine point");
15747
15744
  if (C instanceof g)
15748
15745
  throw new Error("projective point not allowed");
15749
- const P = (h) => r.eql(h, r.ZERO);
15750
- return P(F) && P(R) ? g.ZERO : new g(F, R, r.ONE);
15746
+ const S = (h) => r.eql(h, r.ZERO);
15747
+ return S(F) && S(R) ? g.ZERO : new g(F, R, r.ONE);
15751
15748
  }
15752
15749
  get x() {
15753
15750
  return this.toAffine().x;
@@ -15763,7 +15760,7 @@ function Z9(e) {
15763
15760
  */
15764
15761
  static normalizeZ(C) {
15765
15762
  const F = a6(r, C.map((R) => R.pz));
15766
- return C.map((R, P) => R.toAffine(F[P])).map(g.fromAffine);
15763
+ return C.map((R, S) => R.toAffine(F[S])).map(g.fromAffine);
15767
15764
  }
15768
15765
  /**
15769
15766
  * Converts hash string or Uint8Array to Point.
@@ -15800,7 +15797,7 @@ function Z9(e) {
15800
15797
  */
15801
15798
  equals(C) {
15802
15799
  f(C);
15803
- const { px: F, py: R, pz: P } = this, { px: h, py: y, pz: x } = C, T = r.eql(r.mul(F, x), r.mul(h, P)), I = r.eql(r.mul(R, x), r.mul(y, P));
15800
+ const { px: F, py: R, pz: S } = this, { px: h, py: y, pz: x } = C, T = r.eql(r.mul(F, x), r.mul(h, S)), I = r.eql(r.mul(R, x), r.mul(y, S));
15804
15801
  return T && I;
15805
15802
  }
15806
15803
  /**
@@ -15814,9 +15811,9 @@ function Z9(e) {
15814
15811
  // https://eprint.iacr.org/2015/1060, algorithm 3
15815
15812
  // Cost: 8M + 3S + 3*a + 2*b3 + 15add.
15816
15813
  double() {
15817
- const { a: C, b: F } = t, R = r.mul(F, Dd), { px: P, py: h, pz: y } = this;
15818
- let x = r.ZERO, T = r.ZERO, I = r.ZERO, B = r.mul(P, P), _ = r.mul(h, h), k = r.mul(y, y), S = r.mul(P, h);
15819
- return S = r.add(S, S), I = r.mul(P, y), I = r.add(I, I), x = r.mul(C, I), T = r.mul(R, k), T = r.add(x, T), x = r.sub(_, T), T = r.add(_, T), T = r.mul(x, T), x = r.mul(S, x), I = r.mul(R, I), k = r.mul(C, k), S = r.sub(B, k), S = r.mul(C, S), S = r.add(S, I), I = r.add(B, B), B = r.add(I, B), B = r.add(B, k), B = r.mul(B, S), T = r.add(T, B), k = r.mul(h, y), k = r.add(k, k), B = r.mul(k, S), x = r.sub(x, B), I = r.mul(k, _), I = r.add(I, I), I = r.add(I, I), new g(x, T, I);
15814
+ const { a: C, b: F } = t, R = r.mul(F, Dd), { px: S, py: h, pz: y } = this;
15815
+ let x = r.ZERO, T = r.ZERO, I = r.ZERO, B = r.mul(S, S), _ = r.mul(h, h), k = r.mul(y, y), P = r.mul(S, h);
15816
+ return P = r.add(P, P), I = r.mul(S, y), I = r.add(I, I), x = r.mul(C, I), T = r.mul(R, k), T = r.add(x, T), x = r.sub(_, T), T = r.add(_, T), T = r.mul(x, T), x = r.mul(P, x), I = r.mul(R, I), k = r.mul(C, k), P = r.sub(B, k), P = r.mul(C, P), P = r.add(P, I), I = r.add(B, B), B = r.add(I, B), B = r.add(B, k), B = r.mul(B, P), T = r.add(T, B), k = r.mul(h, y), k = r.add(k, k), B = r.mul(k, P), x = r.sub(x, B), I = r.mul(k, _), I = r.add(I, I), I = r.add(I, I), new g(x, T, I);
15820
15817
  }
15821
15818
  // Renes-Costello-Batina exception-free addition formula.
15822
15819
  // There is 30% faster Jacobian formula, but it is not complete.
@@ -15824,13 +15821,13 @@ function Z9(e) {
15824
15821
  // Cost: 12M + 0S + 3*a + 3*b3 + 23add.
15825
15822
  add(C) {
15826
15823
  f(C);
15827
- const { px: F, py: R, pz: P } = this, { px: h, py: y, pz: x } = C;
15824
+ const { px: F, py: R, pz: S } = this, { px: h, py: y, pz: x } = C;
15828
15825
  let T = r.ZERO, I = r.ZERO, B = r.ZERO;
15829
15826
  const _ = t.a, k = r.mul(t.b, Dd);
15830
- let S = r.mul(F, h), O = r.mul(R, y), U = r.mul(P, x), N = r.add(F, R), L = r.add(h, y);
15831
- N = r.mul(N, L), L = r.add(S, O), N = r.sub(N, L), L = r.add(F, P);
15827
+ let P = r.mul(F, h), O = r.mul(R, y), U = r.mul(S, x), N = r.add(F, R), L = r.add(h, y);
15828
+ N = r.mul(N, L), L = r.add(P, O), N = r.sub(N, L), L = r.add(F, S);
15832
15829
  let H = r.add(h, x);
15833
- return L = r.mul(L, H), H = r.add(S, U), L = r.sub(L, H), H = r.add(R, P), T = r.add(y, x), H = r.mul(H, T), T = r.add(O, U), H = r.sub(H, T), B = r.mul(_, L), T = r.mul(k, U), B = r.add(T, B), T = r.sub(O, B), B = r.add(O, B), I = r.mul(T, B), O = r.add(S, S), O = r.add(O, S), U = r.mul(_, U), L = r.mul(k, L), O = r.add(O, U), U = r.sub(S, U), U = r.mul(_, U), L = r.add(L, U), S = r.mul(O, L), I = r.add(I, S), S = r.mul(H, L), T = r.mul(N, T), T = r.sub(T, S), S = r.mul(N, O), B = r.mul(H, B), B = r.add(B, S), new g(T, I, B);
15830
+ return L = r.mul(L, H), H = r.add(P, U), L = r.sub(L, H), H = r.add(R, S), T = r.add(y, x), H = r.mul(H, T), T = r.add(O, U), H = r.sub(H, T), B = r.mul(_, L), T = r.mul(k, U), B = r.add(T, B), T = r.sub(O, B), B = r.add(O, B), I = r.mul(T, B), O = r.add(P, P), O = r.add(O, P), U = r.mul(_, U), L = r.mul(k, L), O = r.add(O, U), U = r.sub(P, U), U = r.mul(_, U), L = r.add(L, U), P = r.mul(O, L), I = r.add(I, P), P = r.mul(H, L), T = r.mul(N, T), T = r.sub(T, P), P = r.mul(N, O), B = r.mul(H, B), B = r.add(B, P), new g(T, I, B);
15834
15831
  }
15835
15832
  subtract(C) {
15836
15833
  return this.add(C.negate());
@@ -15849,14 +15846,14 @@ function Z9(e) {
15849
15846
  multiplyUnsafe(C) {
15850
15847
  const { endo: F, n: R } = t;
15851
15848
  Ha("scalar", C, _n, R);
15852
- const P = g.ZERO;
15849
+ const S = g.ZERO;
15853
15850
  if (C === _n)
15854
- return P;
15851
+ return S;
15855
15852
  if (this.is0() || C === Ft)
15856
15853
  return this;
15857
15854
  if (!F || w.hasPrecomputes(this))
15858
15855
  return w.wNAFCachedUnsafe(this, C, g.normalizeZ);
15859
- let { k1neg: h, k1: y, k2neg: x, k2: T } = F.splitScalar(C), I = P, B = P, _ = this;
15856
+ let { k1neg: h, k1: y, k2neg: x, k2: T } = F.splitScalar(C), I = S, B = S, _ = this;
15860
15857
  for (; y > _n || T > _n; )
15861
15858
  y & Ft && (I = I.add(_)), T & Ft && (B = B.add(_)), _ = _.double(), y >>= Ft, T >>= Ft;
15862
15859
  return h && (I = I.negate()), x && (B = B.negate()), B = new g(r.mul(B.px, F.beta), B.py, B.pz), I.add(B);
@@ -15873,16 +15870,16 @@ function Z9(e) {
15873
15870
  multiply(C) {
15874
15871
  const { endo: F, n: R } = t;
15875
15872
  Ha("scalar", C, Ft, R);
15876
- let P, h;
15873
+ let S, h;
15877
15874
  if (F) {
15878
15875
  const { k1neg: y, k1: x, k2neg: T, k2: I } = F.splitScalar(C);
15879
- let { p: B, f: _ } = this.wNAF(x), { p: k, f: S } = this.wNAF(I);
15880
- B = w.constTimeNegate(y, B), k = w.constTimeNegate(T, k), k = new g(r.mul(k.px, F.beta), k.py, k.pz), P = B.add(k), h = _.add(S);
15876
+ let { p: B, f: _ } = this.wNAF(x), { p: k, f: P } = this.wNAF(I);
15877
+ B = w.constTimeNegate(y, B), k = w.constTimeNegate(T, k), k = new g(r.mul(k.px, F.beta), k.py, k.pz), S = B.add(k), h = _.add(P);
15881
15878
  } else {
15882
15879
  const { p: y, f: x } = this.wNAF(C);
15883
- P = y, h = x;
15880
+ S = y, h = x;
15884
15881
  }
15885
- return g.normalizeZ([P, h])[0];
15882
+ return g.normalizeZ([S, h])[0];
15886
15883
  }
15887
15884
  /**
15888
15885
  * Efficiently calculate `aP + bQ`. Unsafe, can expose private key, if used incorrectly.
@@ -15891,7 +15888,7 @@ function Z9(e) {
15891
15888
  * @returns non-zero affine point
15892
15889
  */
15893
15890
  multiplyAndAddUnsafe(C, F, R) {
15894
- const P = g.BASE, h = (x, T) => T === _n || T === Ft || !x.equals(P) ? x.multiplyUnsafe(T) : x.multiply(T), y = h(this, F).add(h(C, R));
15891
+ const S = g.BASE, h = (x, T) => T === _n || T === Ft || !x.equals(S) ? x.multiplyUnsafe(T) : x.multiply(T), y = h(this, F).add(h(C, R));
15895
15892
  return y.is0() ? void 0 : y;
15896
15893
  }
15897
15894
  // Converts Projective point to affine (x, y) coordinates.
@@ -15951,13 +15948,13 @@ function Q9(e) {
15951
15948
  }
15952
15949
  const { ProjectivePoint: u, normPrivateKeyToScalar: d, weierstrassEquation: f, isWithinCurveOrder: m } = Z9({
15953
15950
  ...t,
15954
- toBytes(k, S, O) {
15955
- const U = S.toAffine(), N = r.toBytes(U.x), L = Vl;
15956
- return Ui("isCompressed", O), O ? L(Uint8Array.from([S.hasEvenY() ? 2 : 3]), N) : L(Uint8Array.from([4]), N, r.toBytes(U.y));
15951
+ toBytes(k, P, O) {
15952
+ const U = P.toAffine(), N = r.toBytes(U.x), L = Vl;
15953
+ return Ui("isCompressed", O), O ? L(Uint8Array.from([P.hasEvenY() ? 2 : 3]), N) : L(Uint8Array.from([4]), N, r.toBytes(U.y));
15957
15954
  },
15958
15955
  fromBytes(k) {
15959
- const S = k.length, O = k[0], U = k.subarray(1);
15960
- if (S === o && (O === 2 || O === 3)) {
15956
+ const P = k.length, O = k[0], U = k.subarray(1);
15957
+ if (P === o && (O === 2 || O === 3)) {
15961
15958
  const N = ta(U);
15962
15959
  if (!d0(N, Ft, r.ORDER))
15963
15960
  throw new Error("Point is not on curve");
@@ -15971,36 +15968,36 @@ function Q9(e) {
15971
15968
  }
15972
15969
  const Z = (H & Ft) === Ft;
15973
15970
  return (O & 1) === 1 !== Z && (H = r.neg(H)), { x: N, y: H };
15974
- } else if (S === i && O === 4) {
15971
+ } else if (P === i && O === 4) {
15975
15972
  const N = r.fromBytes(U.subarray(0, r.BYTES)), L = r.fromBytes(U.subarray(r.BYTES, 2 * r.BYTES));
15976
15973
  return { x: N, y: L };
15977
15974
  } else {
15978
15975
  const N = o, L = i;
15979
- throw new Error("invalid Point, expected length of " + N + ", or uncompressed " + L + ", got " + S);
15976
+ throw new Error("invalid Point, expected length of " + N + ", or uncompressed " + L + ", got " + P);
15980
15977
  }
15981
15978
  }
15982
15979
  });
15983
15980
  function b(k) {
15984
- const S = n >> Ft;
15985
- return k > S;
15981
+ const P = n >> Ft;
15982
+ return k > P;
15986
15983
  }
15987
15984
  function g(k) {
15988
15985
  return b(k) ? c(-k) : k;
15989
15986
  }
15990
- const E = (k, S, O) => ta(k.slice(S, O));
15987
+ const E = (k, P, O) => ta(k.slice(P, O));
15991
15988
  class v {
15992
- constructor(S, O, U) {
15993
- Ha("r", S, Ft, n), Ha("s", O, Ft, n), this.r = S, this.s = O, U != null && (this.recovery = U), Object.freeze(this);
15989
+ constructor(P, O, U) {
15990
+ Ha("r", P, Ft, n), Ha("s", O, Ft, n), this.r = P, this.s = O, U != null && (this.recovery = U), Object.freeze(this);
15994
15991
  }
15995
15992
  // pair (bytes of r, bytes of s)
15996
- static fromCompact(S) {
15993
+ static fromCompact(P) {
15997
15994
  const O = s;
15998
- return S = Er("compactSignature", S, O * 2), new v(E(S, 0, O), E(S, O, 2 * O));
15995
+ return P = Er("compactSignature", P, O * 2), new v(E(P, 0, O), E(P, O, 2 * O));
15999
15996
  }
16000
15997
  // DER encoded ECDSA signature
16001
15998
  // https://bitcoin.stackexchange.com/questions/57644/what-are-the-parts-of-a-bitcoin-transaction-input-script
16002
- static fromDER(S) {
16003
- const { r: O, s: U } = Bn.toSig(Er("DER", S));
15999
+ static fromDER(P) {
16000
+ const { r: O, s: U } = Bn.toSig(Er("DER", P));
16004
16001
  return new v(O, U);
16005
16002
  }
16006
16003
  /**
@@ -16009,11 +16006,11 @@ function Q9(e) {
16009
16006
  */
16010
16007
  assertValidity() {
16011
16008
  }
16012
- addRecoveryBit(S) {
16013
- return new v(this.r, this.s, S);
16009
+ addRecoveryBit(P) {
16010
+ return new v(this.r, this.s, P);
16014
16011
  }
16015
- recoverPublicKey(S) {
16016
- const { r: O, s: U, recovery: N } = this, L = P(Er("msgHash", S));
16012
+ recoverPublicKey(P) {
16013
+ const { r: O, s: U, recovery: N } = this, L = S(Er("msgHash", P));
16017
16014
  if (N == null || ![0, 1, 2, 3].includes(N))
16018
16015
  throw new Error("recovery id invalid");
16019
16016
  const H = N === 2 || N === 3 ? O + t.n : O;
@@ -16043,8 +16040,8 @@ function Q9(e) {
16043
16040
  return jl(this.toCompactHex());
16044
16041
  }
16045
16042
  toCompactHex() {
16046
- const S = s;
16047
- return Od(this.r, S) + Od(this.s, S);
16043
+ const P = s;
16044
+ return Od(this.r, P) + Od(this.s, P);
16048
16045
  }
16049
16046
  }
16050
16047
  const w = {
@@ -16072,12 +16069,12 @@ function Q9(e) {
16072
16069
  * const fast = utils.precompute(8, ProjectivePoint.fromHex(someonesPubKey));
16073
16070
  * fast.multiply(privKey); // much faster ECDH now
16074
16071
  */
16075
- precompute(k = 8, S = u.BASE) {
16076
- return S._setWindowSize(k), S.multiply(BigInt(3)), S;
16072
+ precompute(k = 8, P = u.BASE) {
16073
+ return P._setWindowSize(k), P.multiply(BigInt(3)), P;
16077
16074
  }
16078
16075
  };
16079
- function A(k, S = !0) {
16080
- return u.fromPrivateKey(k).toRawBytes(S);
16076
+ function A(k, P = !0) {
16077
+ return u.fromPrivateKey(k).toRawBytes(P);
16081
16078
  }
16082
16079
  function C(k) {
16083
16080
  if (typeof k == "bigint")
@@ -16088,31 +16085,31 @@ function Q9(e) {
16088
16085
  if (!(t.allowedPrivateKeyLengths || s === N))
16089
16086
  return O === N || O === L;
16090
16087
  }
16091
- function F(k, S, O = !0) {
16088
+ function F(k, P, O = !0) {
16092
16089
  if (C(k) === !0)
16093
16090
  throw new Error("first arg must be private key");
16094
- if (C(S) === !1)
16091
+ if (C(P) === !1)
16095
16092
  throw new Error("second arg must be public key");
16096
- return u.fromHex(S).multiply(d(k)).toRawBytes(O);
16093
+ return u.fromHex(P).multiply(d(k)).toRawBytes(O);
16097
16094
  }
16098
16095
  const R = t.bits2int || function(k) {
16099
16096
  if (k.length > 8192)
16100
16097
  throw new Error("input is too large");
16101
- const S = ta(k), O = k.length * 8 - a;
16102
- return O > 0 ? S >> BigInt(O) : S;
16103
- }, P = t.bits2int_modN || function(k) {
16098
+ const P = ta(k), O = k.length * 8 - a;
16099
+ return O > 0 ? P >> BigInt(O) : P;
16100
+ }, S = t.bits2int_modN || function(k) {
16104
16101
  return c(R(k));
16105
16102
  }, h = vu(a);
16106
16103
  function y(k) {
16107
16104
  return Ha("num < 2^" + a, k, _n, h), mc(k, s);
16108
16105
  }
16109
- function x(k, S, O = T) {
16106
+ function x(k, P, O = T) {
16110
16107
  if (["recovered", "canonical"].some((ve) => ve in O))
16111
16108
  throw new Error("sign() legacy options not supported");
16112
16109
  const { hash: U, randomBytes: N } = t;
16113
16110
  let { lowS: L, prehash: H, extraEntropy: Z } = O;
16114
16111
  L == null && (L = !0), k = Er("msgHash", k), a1(O), H && (k = Er("prehashed msgHash", U(k)));
16115
- const fe = P(k), ye = d(S), ie = [y(ye), y(fe)];
16112
+ const fe = S(k), ye = d(P), ie = [y(ye), y(fe)];
16116
16113
  if (Z != null && Z !== !1) {
16117
16114
  const ve = Z === !0 ? N(r.BYTES) : Z;
16118
16115
  ie.push(Er("extraEntropy", ve));
@@ -16134,15 +16131,15 @@ function Q9(e) {
16134
16131
  return { seed: pe, k2sig: K };
16135
16132
  }
16136
16133
  const T = { lowS: t.lowS, prehash: !1 }, I = { lowS: t.lowS, prehash: !1 };
16137
- function B(k, S, O = T) {
16138
- const { seed: U, k2sig: N } = x(k, S, O), L = t;
16134
+ function B(k, P, O = T) {
16135
+ const { seed: U, k2sig: N } = x(k, P, O), L = t;
16139
16136
  return Nk(L.hash.outputLen, L.nByteLength, L.hmac)(U, N);
16140
16137
  }
16141
16138
  u.BASE._setWindowSize(8);
16142
- function _(k, S, O, U = I) {
16139
+ function _(k, P, O, U = I) {
16143
16140
  var ge;
16144
16141
  const N = k;
16145
- S = Er("msgHash", S), O = Er("publicKey", O);
16142
+ P = Er("msgHash", P), O = Er("publicKey", O);
16146
16143
  const { lowS: L, prehash: H, format: Z } = U;
16147
16144
  if (a1(U), "strict" in U)
16148
16145
  throw new Error("options.strict was renamed to lowS");
@@ -16168,8 +16165,8 @@ function Q9(e) {
16168
16165
  }
16169
16166
  if (!ie || L && ie.hasHighS())
16170
16167
  return !1;
16171
- H && (S = t.hash(S));
16172
- const { r: Ue, s: K } = ie, ve = P(S), De = l(K), He = c(ve * De), at = c(Ue * De), Ae = (ge = u.BASE.multiplyAndAddUnsafe(pe, He, at)) == null ? void 0 : ge.toAffine();
16168
+ H && (P = t.hash(P));
16169
+ const { r: Ue, s: K } = ie, ve = S(P), De = l(K), He = c(ve * De), at = c(Ue * De), Ae = (ge = u.BASE.multiplyAndAddUnsafe(pe, He, at)) == null ? void 0 : ge.toAffine();
16173
16170
  return Ae ? c(Ae.x) === Ue : !1;
16174
16171
  }
16175
16172
  return {
@@ -16608,9 +16605,9 @@ async function FT(e, t) {
16608
16605
  })(), m = [[]];
16609
16606
  let b = 0, g = 0;
16610
16607
  for (let A = 0; A < l.length; A++) {
16611
- const { abi: C, address: F, args: R, functionName: P } = l[A];
16608
+ const { abi: C, address: F, args: R, functionName: S } = l[A];
16612
16609
  try {
16613
- const h = fr({ abi: C, args: R, functionName: P });
16610
+ const h = fr({ abi: C, args: R, functionName: S });
16614
16611
  g += (h.length - 2) / 2, // Check if batching is enabled.
16615
16612
  u > 0 && // Check if the current size of the batch exceeds the size limit.
16616
16613
  g > u && // Check if the current chunk is not already empty.
@@ -16628,7 +16625,7 @@ async function FT(e, t) {
16628
16625
  address: F,
16629
16626
  args: R,
16630
16627
  docsPath: "/docs/contract/multicall",
16631
- functionName: P,
16628
+ functionName: S,
16632
16629
  sender: r
16633
16630
  });
16634
16631
  if (!s)
@@ -16670,16 +16667,16 @@ async function FT(e, t) {
16670
16667
  }
16671
16668
  const F = C.value;
16672
16669
  for (let R = 0; R < F.length; R++) {
16673
- const { returnData: P, success: h } = F[R], { callData: y } = m[A][R], { abi: x, address: T, functionName: I, args: B } = l[v.length];
16670
+ const { returnData: S, success: h } = F[R], { callData: y } = m[A][R], { abi: x, address: T, functionName: I, args: B } = l[v.length];
16674
16671
  try {
16675
16672
  if (y === "0x")
16676
16673
  throw new sc();
16677
16674
  if (!h)
16678
- throw new hu({ data: P });
16675
+ throw new hu({ data: S });
16679
16676
  const _ = wa({
16680
16677
  abi: x,
16681
16678
  args: B,
16682
- data: P,
16679
+ data: S,
16683
16680
  functionName: I
16684
16681
  });
16685
16682
  v.push(s ? { result: _, status: "success" } : _);
@@ -16732,13 +16729,13 @@ async function nf(e, t) {
16732
16729
  ...Yf(f),
16733
16730
  calls: f.calls.map((b, g) => {
16734
16731
  var x, T;
16735
- const { abi: E, args: v, functionName: w, to: A } = s[m].calls[g], C = ((x = b.error) == null ? void 0 : x.data) ?? b.returnData, F = BigInt(b.gasUsed), R = (T = b.logs) == null ? void 0 : T.map((I) => pn(I)), P = b.status === "0x1" ? "success" : "failure", h = E && P === "success" && C !== "0x" ? wa({
16732
+ const { abi: E, args: v, functionName: w, to: A } = s[m].calls[g], C = ((x = b.error) == null ? void 0 : x.data) ?? b.returnData, F = BigInt(b.gasUsed), R = (T = b.logs) == null ? void 0 : T.map((I) => pn(I)), S = b.status === "0x1" ? "success" : "failure", h = E && S === "success" && C !== "0x" ? wa({
16736
16733
  abi: E,
16737
16734
  data: C,
16738
16735
  functionName: w
16739
16736
  }) : null, y = (() => {
16740
16737
  var B;
16741
- if (P === "success")
16738
+ if (S === "success")
16742
16739
  return;
16743
16740
  let I;
16744
16741
  if (((B = b.error) == null ? void 0 : B.data) === "0x" ? I = new sc() : b.error && (I = new hu(b.error)), !!I)
@@ -16753,8 +16750,8 @@ async function nf(e, t) {
16753
16750
  data: C,
16754
16751
  gasUsed: F,
16755
16752
  logs: R,
16756
- status: P,
16757
- ...P === "success" ? {
16753
+ status: S,
16754
+ ...S === "success" ? {
16758
16755
  result: h
16759
16756
  } : {
16760
16757
  error: y
@@ -17129,12 +17126,12 @@ async function $T(e, t) {
17129
17126
  ],
17130
17127
  traceTransfers: i,
17131
17128
  validation: c
17132
- }), m = o ? f[2] : f[0], [b, g, , E, v, w, A, C] = o ? f : [], { calls: F, ...R } = m, P = F.slice(0, -1) ?? [], h = (b == null ? void 0 : b.calls) ?? [], y = (g == null ? void 0 : g.calls) ?? [], x = [...h, ...y].map((U) => U.status === "success" ? Le(U.data) : null), T = (E == null ? void 0 : E.calls) ?? [], I = (v == null ? void 0 : v.calls) ?? [], B = [...T, ...I].map((U) => U.status === "success" ? Le(U.data) : null), _ = ((w == null ? void 0 : w.calls) ?? []).map((U) => U.status === "success" ? U.result : null), k = ((C == null ? void 0 : C.calls) ?? []).map((U) => U.status === "success" ? U.result : null), S = ((A == null ? void 0 : A.calls) ?? []).map((U) => U.status === "success" ? U.result : null), O = [];
17129
+ }), m = o ? f[2] : f[0], [b, g, , E, v, w, A, C] = o ? f : [], { calls: F, ...R } = m, S = F.slice(0, -1) ?? [], h = (b == null ? void 0 : b.calls) ?? [], y = (g == null ? void 0 : g.calls) ?? [], x = [...h, ...y].map((U) => U.status === "success" ? Le(U.data) : null), T = (E == null ? void 0 : E.calls) ?? [], I = (v == null ? void 0 : v.calls) ?? [], B = [...T, ...I].map((U) => U.status === "success" ? Le(U.data) : null), _ = ((w == null ? void 0 : w.calls) ?? []).map((U) => U.status === "success" ? U.result : null), k = ((C == null ? void 0 : C.calls) ?? []).map((U) => U.status === "success" ? U.result : null), P = ((A == null ? void 0 : A.calls) ?? []).map((U) => U.status === "success" ? U.result : null), O = [];
17133
17130
  for (const [U, N] of B.entries()) {
17134
17131
  const L = x[U];
17135
17132
  if (typeof N != "bigint" || typeof L != "bigint")
17136
17133
  continue;
17137
- const H = _[U - 1], Z = k[U - 1], fe = S[U - 1], ye = U === 0 ? {
17134
+ const H = _[U - 1], Z = k[U - 1], fe = P[U - 1], ye = U === 0 ? {
17138
17135
  address: LT,
17139
17136
  decimals: 18,
17140
17137
  symbol: "ETH"
@@ -17155,7 +17152,7 @@ async function $T(e, t) {
17155
17152
  return {
17156
17153
  assetChanges: O,
17157
17154
  block: R,
17158
- results: P
17155
+ results: S
17159
17156
  };
17160
17157
  }
17161
17158
  const v6 = "0x6492649264926492649264926492649264926492649264926492649264926492";
@@ -17453,7 +17450,7 @@ async function k6(e, t) {
17453
17450
  poll: !0,
17454
17451
  pollingInterval: u,
17455
17452
  async onBlockNumber(R) {
17456
- const P = (y) => {
17453
+ const S = (y) => {
17457
17454
  clearTimeout(C), E == null || E(), y(), g == null || g();
17458
17455
  };
17459
17456
  let h = R;
@@ -17462,7 +17459,7 @@ async function k6(e, t) {
17462
17459
  if (m) {
17463
17460
  if (n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n))
17464
17461
  return;
17465
- P(() => F.resolve(m));
17462
+ S(() => F.resolve(m));
17466
17463
  return;
17467
17464
  }
17468
17465
  if (r && !d && (b = !0, await ql(async () => {
@@ -17472,7 +17469,7 @@ async function k6(e, t) {
17472
17469
  retryCount: o
17473
17470
  }), b = !1), m = await se(e, Fl, "getTransactionReceipt")({ hash: s }), n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n))
17474
17471
  return;
17475
- P(() => F.resolve(m));
17472
+ S(() => F.resolve(m));
17476
17473
  } catch (y) {
17477
17474
  if (y instanceof Py || y instanceof Iy) {
17478
17475
  if (!d) {
@@ -17496,7 +17493,7 @@ async function k6(e, t) {
17496
17493
  }), n > 1 && (!m.blockNumber || h - m.blockNumber + 1n < n)))
17497
17494
  return;
17498
17495
  let I = "replaced";
17499
- T.to === f.to && T.value === f.value && T.input === f.input ? I = "repriced" : T.from === T.to && T.value === 0n && (I = "cancelled"), P(() => {
17496
+ T.to === f.to && T.value === f.value && T.input === f.input ? I = "repriced" : T.from === T.to && T.value === 0n && (I = "cancelled"), S(() => {
17500
17497
  var B;
17501
17498
  (B = F.onReplaced) == null || B.call(F, {
17502
17499
  reason: I,
@@ -17506,10 +17503,10 @@ async function k6(e, t) {
17506
17503
  }), F.resolve(m);
17507
17504
  });
17508
17505
  } catch (x) {
17509
- P(() => F.reject(x));
17506
+ S(() => F.reject(x));
17510
17507
  }
17511
17508
  } else
17512
- P(() => F.reject(y));
17509
+ S(() => F.reject(y));
17513
17510
  }
17514
17511
  }
17515
17512
  });
@@ -17634,29 +17631,29 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
17634
17631
  return;
17635
17632
  }
17636
17633
  try {
17637
- let P;
17634
+ let S;
17638
17635
  if (A)
17639
- P = await se(e, Su, "getFilterChanges")({ filter: A });
17636
+ S = await se(e, Su, "getFilterChanges")({ filter: A });
17640
17637
  else {
17641
17638
  const h = await se(e, yc, "getBlockNumber")({});
17642
- w && w !== h ? P = await se(e, c0, "getLogs")({
17639
+ w && w !== h ? S = await se(e, c0, "getLogs")({
17643
17640
  address: t,
17644
17641
  args: r,
17645
17642
  event: s,
17646
17643
  events: a,
17647
17644
  fromBlock: w + 1n,
17648
17645
  toBlock: h
17649
- }) : P = [], w = h;
17646
+ }) : S = [], w = h;
17650
17647
  }
17651
- if (P.length === 0)
17648
+ if (S.length === 0)
17652
17649
  return;
17653
17650
  if (n)
17654
- v.onLogs(P);
17651
+ v.onLogs(S);
17655
17652
  else
17656
- for (const h of P)
17653
+ for (const h of S)
17657
17654
  v.onLogs([h]);
17658
- } catch (P) {
17659
- A && P instanceof Es && (C = !1), (R = v.onError) == null || R.call(v, P);
17655
+ } catch (S) {
17656
+ A && S instanceof Es && (C = !1), (R = v.onError) == null || R.call(v, S);
17660
17657
  }
17661
17658
  }, {
17662
17659
  emitOnBegin: !0,
@@ -17672,15 +17669,15 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
17672
17669
  try {
17673
17670
  const w = (() => {
17674
17671
  if (e.transport.type === "fallback") {
17675
- const R = e.transport.transports.find((P) => P.config.type === "webSocket" || P.config.type === "ipc");
17672
+ const R = e.transport.transports.find((S) => S.config.type === "webSocket" || S.config.type === "ipc");
17676
17673
  return R ? R.value : e.transport;
17677
17674
  }
17678
17675
  return e.transport;
17679
17676
  })(), A = a ?? (s ? [s] : void 0);
17680
17677
  let C = [];
17681
- A && (C = [A.flatMap((P) => ic({
17682
- abi: [P],
17683
- eventName: P.name,
17678
+ A && (C = [A.flatMap((S) => ic({
17679
+ abi: [S],
17680
+ eventName: S.name,
17684
17681
  args: r
17685
17682
  }))], s && (C = C[0]));
17686
17683
  const { unsubscribe: F } = await w.subscribe({
@@ -17689,14 +17686,14 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
17689
17686
  var h;
17690
17687
  if (!E)
17691
17688
  return;
17692
- const P = R.result;
17689
+ const S = R.result;
17693
17690
  try {
17694
17691
  const { eventName: y, args: x } = Gl({
17695
17692
  abi: A ?? [],
17696
- data: P.data,
17697
- topics: P.topics,
17693
+ data: S.data,
17694
+ topics: S.topics,
17698
17695
  strict: m
17699
- }), T = pn(P, { args: x, eventName: y });
17696
+ }), T = pn(S, { args: x, eventName: y });
17700
17697
  c([T]);
17701
17698
  } catch (y) {
17702
17699
  let x, T;
@@ -17705,7 +17702,7 @@ function JT(e, { address: t, args: r, batch: n = !0, event: s, events: a, fromBl
17705
17702
  return;
17706
17703
  x = y.abiItem.name, T = (h = y.abiItem.inputs) == null ? void 0 : h.some((B) => !("name" in B && B.name));
17707
17704
  }
17708
- const I = pn(P, {
17705
+ const I = pn(S, {
17709
17706
  args: T ? [] : {},
17710
17707
  eventName: x
17711
17708
  });
@@ -17995,7 +17992,7 @@ async function h4(e, t) {
17995
17992
  }
17996
17993
  const Md = new ko(128);
17997
17994
  async function T6(e, t) {
17998
- var F, R, P, h;
17995
+ var F, R, S, h;
17999
17996
  const { account: r = e.account, chain: n = e.chain, accessList: s, authorizationList: a, blobs: o, data: i, gas: c, gasPrice: l, maxFeePerBlobGas: u, maxFeePerGas: d, maxPriorityFeePerGas: f, nonce: m, pollingInterval: b, throwOnReceiptRevert: g, type: E, value: v, ...w } = t, A = t.timeout ?? Math.max(((n == null ? void 0 : n.blockTime) ?? 0) * 3, 5e3);
18000
17997
  if (typeof r > "u")
18001
17998
  throw new Zn({
@@ -18020,7 +18017,7 @@ async function T6(e, t) {
18020
18017
  currentChainId: x,
18021
18018
  chain: n
18022
18019
  }));
18023
- const T = (P = (R = (F = e.chain) == null ? void 0 : F.formatters) == null ? void 0 : R.transactionRequest) == null ? void 0 : P.format, B = (T || Xr)({
18020
+ const T = (S = (R = (F = e.chain) == null ? void 0 : F.formatters) == null ? void 0 : R.transactionRequest) == null ? void 0 : S.format, B = (T || Xr)({
18024
18021
  // Pick out extra data that might exist on the chain's transaction request type.
18025
18022
  ...ga(w, { format: T }),
18026
18023
  accessList: s,
@@ -18038,7 +18035,7 @@ async function T6(e, t) {
18038
18035
  to: y,
18039
18036
  type: E,
18040
18037
  value: v
18041
- }, "sendTransaction"), _ = Md.get(e.uid), k = _ ? "wallet_sendTransaction" : "eth_sendTransaction", S = await (async () => {
18038
+ }, "sendTransaction"), _ = Md.get(e.uid), k = _ ? "wallet_sendTransaction" : "eth_sendTransaction", P = await (async () => {
18042
18039
  try {
18043
18040
  return await e.request({
18044
18041
  method: k,
@@ -18060,7 +18057,7 @@ async function T6(e, t) {
18060
18057
  }
18061
18058
  })(), O = await se(e, k6, "waitForTransactionReceipt")({
18062
18059
  checkReplacement: !1,
18063
- hash: S,
18060
+ hash: P,
18064
18061
  pollingInterval: b,
18065
18062
  timeout: A
18066
18063
  });
@@ -18322,7 +18319,7 @@ function P4(e, t = {}) {
18322
18319
  methods: o,
18323
18320
  name: i,
18324
18321
  async request({ method: F, params: R }) {
18325
- const P = { method: F, params: R }, { schedule: h } = wg({
18322
+ const S = { method: F, params: R }, { schedule: h } = wg({
18326
18323
  id: A,
18327
18324
  wait: E,
18328
18325
  shouldSplitBatch(I) {
@@ -18336,12 +18333,12 @@ function P4(e, t = {}) {
18336
18333
  await C.request({
18337
18334
  body: I
18338
18335
  })
18339
- ], [{ error: x, result: T }] = await y(P);
18336
+ ], [{ error: x, result: T }] = await y(S);
18340
18337
  if (d)
18341
18338
  return { error: x, result: T };
18342
18339
  if (x)
18343
18340
  throw new Vf({
18344
- body: P,
18341
+ body: S,
18345
18342
  error: x,
18346
18343
  url: A
18347
18344
  });
@@ -26269,7 +26266,7 @@ async function gU(e, t) {
26269
26266
  try {
26270
26267
  const { accessList: i, blockNumber: c, blockTag: l, data: u, gas: d, gasPrice: f, maxFeePerGas: m, maxPriorityFeePerGas: b, nonce: g, to: E, value: v, ...w } = t, C = (typeof c == "bigint" ? V(c) : void 0) || l;
26271
26268
  bn(t);
26272
- const F = (o = (a = (s = e.chain) == null ? void 0 : s.formatters) == null ? void 0 : a.transactionRequest) == null ? void 0 : o.format, P = (F || Xr)({
26269
+ const F = (o = (a = (s = e.chain) == null ? void 0 : s.formatters) == null ? void 0 : a.transactionRequest) == null ? void 0 : o.format, S = (F || Xr)({
26273
26270
  // Pick out extra data that might exist on the chain's transaction request type.
26274
26271
  ...ga(w, { format: F }),
26275
26272
  account: n,
@@ -26284,7 +26281,7 @@ async function gU(e, t) {
26284
26281
  value: v
26285
26282
  }, "estimateGas"), { baseFeePerGas: h, gasLimit: y, priorityFeePerGas: x } = await e.request({
26286
26283
  method: "linea_estimateGas",
26287
- params: C ? [P, C] : [P]
26284
+ params: C ? [S, C] : [S]
26288
26285
  });
26289
26286
  return {
26290
26287
  baseFeePerGas: BigInt(h),
@@ -33045,8 +33042,8 @@ function qR(e) {
33045
33042
  if (Mr(a) && a !== "0x" && (A.gas = BigInt(a)), Mr(l) && (A.nonce = l === "0x" ? 0n : BigInt(l)), Mr(s) && s !== "0x" && (A.maxFeePerGas = BigInt(s)), Mr(n) && n !== "0x" && (A.maxPriorityFeePerGas = BigInt(n)), Mr(c) && (A.nonceKey = c === "0x" ? 0n : BigInt(c)), Mr(u) && u !== "0x" && (A.validBefore = Number(u)), Mr(d) && d !== "0x" && (A.validAfter = Number(d)), Mr(f) && f !== "0x" && (A.feeToken = f), o && o !== "0x") {
33046
33043
  const F = o;
33047
33044
  A.calls = F.map((R) => {
33048
- const [P, h, y] = R, x = {};
33049
- return P && P !== "0x" && (x.to = P), h && h !== "0x" && (x.value = BigInt(h)), y && y !== "0x" && (x.data = y), x;
33045
+ const [S, h, y] = R, x = {};
33046
+ return S && S !== "0x" && (x.to = S), h && h !== "0x" && (x.value = BigInt(h)), y && y !== "0x" && (x.data = y), x;
33050
33047
  });
33051
33048
  }
33052
33049
  (i == null ? void 0 : i.length) !== 0 && i !== "0x" && (A.accessList = RR(i)), (b == null ? void 0 : b.length) !== 0 && b !== "0x" && (A.authorizationList = ER(b)), m !== "0x" && m !== void 0 && (m === "0x00" || Zl(m) ? A.feePayerSignature = null : A.feePayerSignature = oT(m)), v && (A.keyAuthorization = PR(v));
@@ -39320,8 +39317,8 @@ function xj(e, t, r) {
39320
39317
  return H && (Z = 2), Z && (O = O.substring(Z), U -= Z, N -= Z), { value: O, start: U, end: N, hasNegation: L };
39321
39318
  }, w = v(e, u, d), A = w.hasNegation;
39322
39319
  n = w, e = n.value, u = n.start, d = n.end;
39323
- var C = v(t.lastValue, c.start, c.end), F = C.start, R = C.end, P = C.value, h = e.substring(u, d);
39324
- e.length && P.length && (F > P.length - o.length || R < a.length) && !(h && o.startsWith(h)) && (e = P);
39320
+ var C = v(t.lastValue, c.start, c.end), F = C.start, R = C.end, S = C.value, h = e.substring(u, d);
39321
+ e.length && S.length && (F > S.length - o.length || R < a.length) && !(h && o.startsWith(h)) && (e = S);
39325
39322
  var y = 0;
39326
39323
  e.startsWith(a) ? y += a.length : u < a.length && (y = u), e = e.substring(y), d -= y;
39327
39324
  var x = e.length, T = e.length - o.length;
@@ -39330,8 +39327,8 @@ function xj(e, t, r) {
39330
39327
  e = e.replace(new RegExp(Z2(b), "g"), function(O, U) {
39331
39328
  return U === I ? "." : "";
39332
39329
  });
39333
- var B = ym(e, s), _ = B.beforeDecimal, k = B.afterDecimal, S = B.addNegation;
39334
- return l.end - l.start < c.end - c.start && _ === "" && g && !parseFloat(k) && (e = S ? "-" : ""), e;
39330
+ var B = ym(e, s), _ = B.beforeDecimal, k = B.afterDecimal, P = B.addNegation;
39331
+ return l.end - l.start < c.end - c.start && _ === "" && g && !parseFloat(k) && (e = P ? "-" : ""), e;
39335
39332
  }
39336
39333
  function wj(e, t) {
39337
39334
  var r = t.prefix;
@@ -39369,28 +39366,28 @@ function Ej(e) {
39369
39366
  a === void 0 && (a = xf);
39370
39367
  var o = e.thousandSeparator, i = e.decimalScale, c = e.fixedDecimalScale, l = e.prefix;
39371
39368
  l === void 0 && (l = "");
39372
- var u = e.defaultValue, d = e.value, f = e.valueIsNumericString, m = e.onValueChange, b = oj(e, ["decimalSeparator", "allowedDecimalSeparators", "thousandsGroupStyle", "suffix", "allowNegative", "allowLeadingZeros", "onKeyDown", "onBlur", "thousandSeparator", "decimalScale", "fixedDecimalScale", "prefix", "defaultValue", "value", "valueIsNumericString", "onValueChange"]), g = Zu(e), E = g.decimalSeparator, v = g.allowedDecimalSeparators, w = function(S) {
39373
- return U1(S, e);
39374
- }, A = function(S, O) {
39375
- return xj(S, O, e);
39369
+ var u = e.defaultValue, d = e.value, f = e.valueIsNumericString, m = e.onValueChange, b = oj(e, ["decimalSeparator", "allowedDecimalSeparators", "thousandsGroupStyle", "suffix", "allowNegative", "allowLeadingZeros", "onKeyDown", "onBlur", "thousandSeparator", "decimalScale", "fixedDecimalScale", "prefix", "defaultValue", "value", "valueIsNumericString", "onValueChange"]), g = Zu(e), E = g.decimalSeparator, v = g.allowedDecimalSeparators, w = function(P) {
39370
+ return U1(P, e);
39371
+ }, A = function(P, O) {
39372
+ return xj(P, O, e);
39376
39373
  }, C = qa(d) ? u : d, F = f ?? gj(C, l, t);
39377
39374
  qa(d) ? qa(u) || (F = F || typeof u == "number") : F = F || typeof d == "number";
39378
- var R = function(S) {
39379
- return Y2(S) ? S : (typeof S == "number" && (S = Q2(S)), F && typeof i == "number" ? F1(S, i, !!c) : S);
39380
- }, P = hj(R(d), R(u), !!F, w, A, m), h = P[0], y = h.numAsString, x = h.formattedValue, T = P[1], I = function(S) {
39381
- var O = S.target, U = S.key, N = O.selectionStart, L = O.selectionEnd, H = O.value;
39375
+ var R = function(P) {
39376
+ return Y2(P) ? P : (typeof P == "number" && (P = Q2(P)), F && typeof i == "number" ? F1(P, i, !!c) : P);
39377
+ }, S = hj(R(d), R(u), !!F, w, A, m), h = S[0], y = h.numAsString, x = h.formattedValue, T = S[1], I = function(P) {
39378
+ var O = P.target, U = P.key, N = O.selectionStart, L = O.selectionEnd, H = O.value;
39382
39379
  if (H === void 0 && (H = ""), (U === "Backspace" || U === "Delete") && L < l.length) {
39383
- S.preventDefault();
39380
+ P.preventDefault();
39384
39381
  return;
39385
39382
  }
39386
39383
  if (N !== L) {
39387
- s(S);
39384
+ s(P);
39388
39385
  return;
39389
39386
  }
39390
- U === "Backspace" && H[0] === "-" && N === l.length + 1 && r && ei(O, 1), i && c && (U === "Backspace" && H[N - 1] === E ? (ei(O, N - 1), S.preventDefault()) : U === "Delete" && H[N] === E && S.preventDefault()), v != null && v.includes(U) && H[N] === E && ei(O, N + 1);
39387
+ U === "Backspace" && H[0] === "-" && N === l.length + 1 && r && ei(O, 1), i && c && (U === "Backspace" && H[N - 1] === E ? (ei(O, N - 1), P.preventDefault()) : U === "Delete" && H[N] === E && P.preventDefault()), v != null && v.includes(U) && H[N] === E && ei(O, N + 1);
39391
39388
  var Z = o === !0 ? "," : o;
39392
- U === "Backspace" && H[N - 1] === Z && ei(O, N - 1), U === "Delete" && H[N] === Z && ei(O, N + 1), s(S);
39393
- }, B = function(S) {
39389
+ U === "Backspace" && H[N - 1] === Z && ei(O, N - 1), U === "Delete" && H[N] === Z && ei(O, N + 1), s(P);
39390
+ }, B = function(P) {
39394
39391
  var O = y;
39395
39392
  if (O.match(/\d/g) || (O = ""), n || (O = pj(O)), c && i && (O = F1(O, i, c)), O !== y) {
39396
39393
  var U = U1(O, e);
@@ -39399,15 +39396,15 @@ function Ej(e) {
39399
39396
  value: O,
39400
39397
  floatValue: parseFloat(O)
39401
39398
  }, {
39402
- event: S,
39399
+ event: P,
39403
39400
  source: gf.event
39404
39401
  });
39405
39402
  }
39406
- a(S);
39407
- }, _ = function(S) {
39408
- return S === E ? !0 : K2(S);
39409
- }, k = function(S) {
39410
- var O = S.currentValue, U = S.lastValue, N = S.formattedValue, L = S.currentValueIndex, H = S.formattedValueIndex, Z = O[L], fe = N[H], ye = fj(U, O), ie = ye.to, pe = function(Ue) {
39403
+ a(P);
39404
+ }, _ = function(P) {
39405
+ return P === E ? !0 : K2(P);
39406
+ }, k = function(P) {
39407
+ var O = P.currentValue, U = P.lastValue, N = P.formattedValue, L = P.currentValueIndex, H = P.formattedValueIndex, Z = O[L], fe = N[H], ye = fj(U, O), ie = ye.to, pe = function(Ue) {
39411
39408
  return A(Ue).indexOf(".") + l.length;
39412
39409
  };
39413
39410
  return d === 0 && c && i && O[ie.start] === E && pe(O) < L && pe(N) > H ? !1 : L >= ie.start && L < ie.end && v && v.includes(Z) && fe === E ? !0 : Z === fe;
@@ -39420,8 +39417,8 @@ function Ej(e) {
39420
39417
  onValueChange: T,
39421
39418
  format: w,
39422
39419
  removeFormatting: A,
39423
- getCaretBoundary: function(S) {
39424
- return wj(S, e);
39420
+ getCaretBoundary: function(P) {
39421
+ return wj(P, e);
39425
39422
  },
39426
39423
  onKeyDown: I,
39427
39424
  onBlur: B
@@ -40891,31 +40888,31 @@ const sq = {
40891
40888
  offsetWidth: "width"
40892
40889
  }, xn = Ve(
40893
40890
  ([{ log: e }, { recalcInProgress: t }]) => {
40894
- const r = Re(), n = Re(), s = Lt(n, 0), a = Re(), o = Re(), i = q(0), c = q([]), l = q(void 0), u = q(void 0), d = q(void 0), f = q(void 0), m = q((P, h) => Ts(P, sq[h])), b = q(void 0), g = q(0), E = YW(), v = Lt(
40891
+ const r = Re(), n = Re(), s = Lt(n, 0), a = Re(), o = Re(), i = q(0), c = q([]), l = q(void 0), u = q(void 0), d = q(void 0), f = q(void 0), m = q((S, h) => Ts(S, sq[h])), b = q(void 0), g = q(0), E = YW(), v = Lt(
40895
40892
  j(r, Pe(c, e, g), ln(eq, E), tt()),
40896
40893
  E
40897
40894
  ), w = Lt(
40898
40895
  j(
40899
40896
  c,
40900
40897
  tt(),
40901
- ln((P, h) => ({ current: h, prev: P.current }), {
40898
+ ln((S, h) => ({ current: h, prev: S.current }), {
40902
40899
  current: [],
40903
40900
  prev: []
40904
40901
  }),
40905
- re(({ prev: P }) => P)
40902
+ re(({ prev: S }) => S)
40906
40903
  ),
40907
40904
  []
40908
40905
  );
40909
40906
  ce(
40910
40907
  j(
40911
40908
  c,
40912
- he((P) => P.length > 0),
40909
+ he((S) => S.length > 0),
40913
40910
  Pe(v, g),
40914
- re(([P, h, y]) => {
40915
- const x = P.reduce((T, I, B) => cr(T, I, Wi(I, h.offsetTree, y) || B), Ka());
40911
+ re(([S, h, y]) => {
40912
+ const x = S.reduce((T, I, B) => cr(T, I, Wi(I, h.offsetTree, y) || B), Ka());
40916
40913
  return {
40917
40914
  ...h,
40918
- groupIndices: P,
40915
+ groupIndices: S,
40919
40916
  groupOffsetTree: x
40920
40917
  };
40921
40918
  })
@@ -40925,12 +40922,12 @@ const sq = {
40925
40922
  j(
40926
40923
  n,
40927
40924
  Pe(v),
40928
- he(([P, { lastIndex: h }]) => P < h),
40929
- re(([P, { lastIndex: h, lastSize: y }]) => [
40925
+ he(([S, { lastIndex: h }]) => S < h),
40926
+ re(([S, { lastIndex: h, lastSize: y }]) => [
40930
40927
  {
40931
40928
  endIndex: h,
40932
40929
  size: y,
40933
- startIndex: P
40930
+ startIndex: S
40934
40931
  }
40935
40932
  ])
40936
40933
  ),
@@ -40939,32 +40936,32 @@ const sq = {
40939
40936
  const A = Lt(
40940
40937
  j(
40941
40938
  l,
40942
- re((P) => P === void 0)
40939
+ re((S) => S === void 0)
40943
40940
  ),
40944
40941
  !0
40945
40942
  );
40946
40943
  ce(
40947
40944
  j(
40948
40945
  u,
40949
- he((P) => P !== void 0 && Ze(ct(v).sizeTree)),
40950
- re((P) => {
40946
+ he((S) => S !== void 0 && Ze(ct(v).sizeTree)),
40947
+ re((S) => {
40951
40948
  const h = ct(d), y = ct(c).length > 0;
40952
40949
  return h ? y ? [
40953
40950
  { endIndex: 0, size: h, startIndex: 0 },
40954
- { endIndex: 1, size: P, startIndex: 1 }
40955
- ] : [] : [{ endIndex: 0, size: P, startIndex: 0 }];
40951
+ { endIndex: 1, size: S, startIndex: 1 }
40952
+ ] : [] : [{ endIndex: 0, size: S, startIndex: 0 }];
40956
40953
  })
40957
40954
  ),
40958
40955
  r
40959
40956
  ), ce(
40960
40957
  j(
40961
40958
  f,
40962
- he((P) => P !== void 0 && P.length > 0 && Ze(ct(v).sizeTree)),
40963
- re((P) => {
40959
+ he((S) => S !== void 0 && S.length > 0 && Ze(ct(v).sizeTree)),
40960
+ re((S) => {
40964
40961
  const h = [];
40965
- let y = P[0], x = 0;
40966
- for (let T = 1; T < P.length; T++) {
40967
- const I = P[T];
40962
+ let y = S[0], x = 0;
40963
+ for (let T = 1; T < S.length; T++) {
40964
+ const I = S[T];
40968
40965
  I !== y && (h.push({
40969
40966
  endIndex: T - 1,
40970
40967
  size: y,
@@ -40972,7 +40969,7 @@ const sq = {
40972
40969
  }), y = I, x = T);
40973
40970
  }
40974
40971
  return h.push({
40975
- endIndex: P.length - 1,
40972
+ endIndex: S.length - 1,
40976
40973
  size: y,
40977
40974
  startIndex: x
40978
40975
  }), h;
@@ -40983,11 +40980,11 @@ const sq = {
40983
40980
  j(
40984
40981
  c,
40985
40982
  Pe(d, u),
40986
- he(([, P, h]) => P !== void 0 && h !== void 0),
40987
- re(([P, h, y]) => {
40983
+ he(([, S, h]) => S !== void 0 && h !== void 0),
40984
+ re(([S, h, y]) => {
40988
40985
  const x = [];
40989
- for (let T = 0; T < P.length; T++) {
40990
- const I = P[T], B = P[T + 1];
40986
+ for (let T = 0; T < S.length; T++) {
40987
+ const I = S[T], B = S[T + 1];
40991
40988
  x.push({
40992
40989
  startIndex: I,
40993
40990
  endIndex: I,
@@ -41008,35 +41005,35 @@ const sq = {
41008
41005
  r,
41009
41006
  Pe(v),
41010
41007
  ln(
41011
- ({ sizes: P }, [h, y]) => ({
41012
- changed: y !== P,
41008
+ ({ sizes: S }, [h, y]) => ({
41009
+ changed: y !== S,
41013
41010
  sizes: y
41014
41011
  }),
41015
41012
  { changed: !1, sizes: E }
41016
41013
  ),
41017
- re((P) => P.changed)
41014
+ re((S) => S.changed)
41018
41015
  )
41019
41016
  );
41020
41017
  qe(
41021
41018
  j(
41022
41019
  i,
41023
41020
  ln(
41024
- (P, h) => ({ diff: P.prev - h, prev: h }),
41021
+ (S, h) => ({ diff: S.prev - h, prev: h }),
41025
41022
  { diff: 0, prev: 0 }
41026
41023
  ),
41027
- re((P) => P.diff)
41024
+ re((S) => S.diff)
41028
41025
  ),
41029
- (P) => {
41026
+ (S) => {
41030
41027
  const { groupIndices: h } = ct(v);
41031
- if (P > 0)
41032
- Te(t, !0), Te(a, P + N1(P, h));
41033
- else if (P < 0) {
41028
+ if (S > 0)
41029
+ Te(t, !0), Te(a, S + N1(S, h));
41030
+ else if (S < 0) {
41034
41031
  const y = ct(w);
41035
- y.length > 0 && (P -= N1(-P, y)), Te(o, P);
41032
+ y.length > 0 && (S -= N1(-S, y)), Te(o, S);
41036
41033
  }
41037
41034
  }
41038
- ), qe(j(i, Pe(e)), ([P, h]) => {
41039
- P < 0 && h(
41035
+ ), qe(j(i, Pe(e)), ([S, h]) => {
41036
+ S < 0 && h(
41040
41037
  "`firstItemIndex` prop should not be set to less than zero. If you don't know the total count, just use a very high value",
41041
41038
  { firstItemIndex: i },
41042
41039
  sr.ERROR
@@ -41047,42 +41044,42 @@ const sq = {
41047
41044
  j(
41048
41045
  a,
41049
41046
  Pe(v),
41050
- re(([P, h]) => {
41047
+ re(([S, h]) => {
41051
41048
  const y = h.groupIndices.length > 0, x = [], T = h.lastSize;
41052
41049
  if (y) {
41053
41050
  const I = ji(h.sizeTree, 0);
41054
41051
  let B = 0, _ = 0;
41055
- for (; B < P; ) {
41056
- const S = h.groupIndices[_], O = h.groupIndices.length === _ + 1 ? 1 / 0 : h.groupIndices[_ + 1] - S - 1;
41052
+ for (; B < S; ) {
41053
+ const P = h.groupIndices[_], O = h.groupIndices.length === _ + 1 ? 1 / 0 : h.groupIndices[_ + 1] - P - 1;
41057
41054
  x.push({
41058
- endIndex: S,
41055
+ endIndex: P,
41059
41056
  size: I,
41060
- startIndex: S
41057
+ startIndex: P
41061
41058
  }), x.push({
41062
- endIndex: S + 1 + O - 1,
41059
+ endIndex: P + 1 + O - 1,
41063
41060
  size: T,
41064
- startIndex: S + 1
41061
+ startIndex: P + 1
41065
41062
  }), _++, B += O + 1;
41066
41063
  }
41067
41064
  const k = Gs(h.sizeTree);
41068
- return B !== P && k.shift(), k.reduce(
41069
- (S, { k: O, v: U }) => {
41070
- let N = S.ranges;
41071
- return S.prevSize !== 0 && (N = [
41072
- ...S.ranges,
41065
+ return B !== S && k.shift(), k.reduce(
41066
+ (P, { k: O, v: U }) => {
41067
+ let N = P.ranges;
41068
+ return P.prevSize !== 0 && (N = [
41069
+ ...P.ranges,
41073
41070
  {
41074
- endIndex: O + P - 1,
41075
- size: S.prevSize,
41076
- startIndex: S.prevIndex
41071
+ endIndex: O + S - 1,
41072
+ size: P.prevSize,
41073
+ startIndex: P.prevIndex
41077
41074
  }
41078
41075
  ]), {
41079
- prevIndex: O + P,
41076
+ prevIndex: O + S,
41080
41077
  prevSize: U,
41081
41078
  ranges: N
41082
41079
  };
41083
41080
  },
41084
41081
  {
41085
- prevIndex: P,
41082
+ prevIndex: S,
41086
41083
  prevSize: 0,
41087
41084
  ranges: x
41088
41085
  }
@@ -41090,9 +41087,9 @@ const sq = {
41090
41087
  }
41091
41088
  return Gs(h.sizeTree).reduce(
41092
41089
  (I, { k: B, v: _ }) => ({
41093
- prevIndex: B + P,
41090
+ prevIndex: B + S,
41094
41091
  prevSize: _,
41095
- ranges: [...I.ranges, { endIndex: B + P - 1, size: I.prevSize, startIndex: I.prevIndex }]
41092
+ ranges: [...I.ranges, { endIndex: B + S - 1, size: I.prevSize, startIndex: I.prevIndex }]
41096
41093
  }),
41097
41094
  {
41098
41095
  prevIndex: 0,
@@ -41108,8 +41105,8 @@ const sq = {
41108
41105
  j(
41109
41106
  o,
41110
41107
  Pe(v, g),
41111
- re(([P, { offsetTree: h }, y]) => {
41112
- const x = -P;
41108
+ re(([S, { offsetTree: h }, y]) => {
41109
+ const x = -S;
41113
41110
  return Wi(x, h, y);
41114
41111
  })
41115
41112
  )
@@ -41118,23 +41115,23 @@ const sq = {
41118
41115
  j(
41119
41116
  o,
41120
41117
  Pe(v, g),
41121
- re(([P, h, y]) => {
41118
+ re(([S, h, y]) => {
41122
41119
  if (h.groupIndices.length > 0) {
41123
41120
  if (Ze(h.sizeTree))
41124
41121
  return h;
41125
41122
  let x = Ka();
41126
41123
  const T = ct(w);
41127
41124
  let I = 0, B = 0, _ = 0;
41128
- for (; I < -P; ) {
41125
+ for (; I < -S; ) {
41129
41126
  _ = T[B];
41130
41127
  const k = T[B + 1] - _ - 1;
41131
41128
  B++, I += k + 1;
41132
41129
  }
41133
- if (x = Gs(h.sizeTree).reduce((k, { k: S, v: O }) => cr(k, Math.max(0, S + P), O), x), I !== -P) {
41130
+ if (x = Gs(h.sizeTree).reduce((k, { k: P, v: O }) => cr(k, Math.max(0, P + S), O), x), I !== -S) {
41134
41131
  const k = ji(h.sizeTree, _);
41135
41132
  x = cr(x, 0, k);
41136
- const S = Yr(h.sizeTree, -P + 1)[1];
41137
- x = cr(x, 1, S);
41133
+ const P = Yr(h.sizeTree, -S + 1)[1];
41134
+ x = cr(x, 1, P);
41138
41135
  }
41139
41136
  return {
41140
41137
  ...h,
@@ -41142,7 +41139,7 @@ const sq = {
41142
41139
  ...Cf(h.offsetTree, 0, x, y)
41143
41140
  };
41144
41141
  } else {
41145
- const x = Gs(h.sizeTree).reduce((T, { k: I, v: B }) => cr(T, Math.max(0, I + P), B), Ka());
41142
+ const x = Gs(h.sizeTree).reduce((T, { k: I, v: B }) => cr(T, Math.max(0, I + S), B), Ka());
41146
41143
  return {
41147
41144
  ...h,
41148
41145
  sizeTree: x,
@@ -41262,14 +41259,14 @@ const Ic = Ve(
41262
41259
  Pe(e, a, s),
41263
41260
  re(
41264
41261
  ([
41265
- [C, F, R, P, h, y, x, T],
41262
+ [C, F, R, S, h, y, x, T],
41266
41263
  I,
41267
41264
  B,
41268
41265
  _
41269
41266
  ]) => {
41270
- const k = Tx(C), { align: S, behavior: O, offset: U } = k, N = P - 1, L = kx(k, F, N);
41267
+ const k = Tx(C), { align: P, behavior: O, offset: U } = k, N = S - 1, L = kx(k, F, N);
41271
41268
  let H = Wi(L, F.offsetTree, I) + y;
41272
- S === "end" ? (H += B + Yr(F.sizeTree, L)[1] - R + _, L === N && (H += x)) : S === "center" ? H += (B + Yr(F.sizeTree, L)[1] - R + _) / 2 : H -= h, U && (H += U);
41269
+ P === "end" ? (H += B + Yr(F.sizeTree, L)[1] - R + _, L === N && (H += x)) : P === "center" ? H += (B + Yr(F.sizeTree, L)[1] - R + _) / 2 : H -= h, U && (H += U);
41273
41270
  const Z = (fe) => {
41274
41271
  A(), fe ? (T("retrying to scroll to", { location: C }, sr.DEBUG), Te(m, C)) : (Te(b, !0), T("list did not change, scroll successful", {}, sr.DEBUG));
41275
41272
  };
@@ -41395,7 +41392,7 @@ const qi = "up", ii = "down", cq = "none", lq = {
41395
41392
  const b = ur(
41396
41393
  j(
41397
41394
  vt(n, me(a), me(t), me(e), me(u)),
41398
- ln((w, [{ scrollHeight: A, scrollTop: C }, F, R, P, h]) => {
41395
+ ln((w, [{ scrollHeight: A, scrollTop: C }, F, R, S, h]) => {
41399
41396
  const y = C + F - A > -h, x = {
41400
41397
  scrollHeight: A,
41401
41398
  scrollTop: C,
@@ -41541,11 +41538,11 @@ const Am = Ve(
41541
41538
  A
41542
41539
  ]) => {
41543
41540
  const C = u - w, F = E + v, R = Math.max(f - C, 0);
41544
- let P = L1;
41541
+ let S = L1;
41545
41542
  const h = $1(A, Ki), y = $1(A, Yi);
41546
- return m -= w, m += f + v, b += f + v, b -= w, m > u + F - h && (P = qi), b < u - R + d + y && (P = ii), P !== L1 ? [
41547
- Math.max(C - f - z1(g, Ki, P) - h, 0),
41548
- C - R - v + d + z1(g, Yi, P) + y
41543
+ return m -= w, m += f + v, b += f + v, b -= w, m > u + F - h && (S = qi), b < u - R + d + y && (S = ii), S !== L1 ? [
41544
+ Math.max(C - f - z1(g, Ki, S) - h, 0),
41545
+ C - R - v + d + z1(g, Yi, S) + y
41549
41546
  ] : null;
41550
41547
  }
41551
41548
  ),
@@ -41684,15 +41681,15 @@ const ka = Ve(
41684
41681
  me(w),
41685
41682
  e
41686
41683
  ),
41687
- he(([P, h, , y, , , , , , , , x]) => {
41684
+ he(([S, h, , y, , , , , , , , x]) => {
41688
41685
  const T = x && x.length !== y;
41689
- return P && !h && !T;
41686
+ return S && !h && !T;
41690
41687
  }),
41691
41688
  re(
41692
41689
  ([
41693
41690
  ,
41694
41691
  ,
41695
- [P, h],
41692
+ [S, h],
41696
41693
  y,
41697
41694
  x,
41698
41695
  T,
@@ -41700,14 +41697,14 @@ const ka = Ve(
41700
41697
  B,
41701
41698
  _,
41702
41699
  k,
41703
- S,
41700
+ P,
41704
41701
  O
41705
41702
  ]) => {
41706
41703
  var U, N, L, H;
41707
41704
  const Z = x, { offsetTree: fe, sizeTree: ye } = Z, ie = ct(E);
41708
41705
  if (y === 0)
41709
41706
  return { ...Xd, totalCount: y };
41710
- if (P === 0 && h === 0)
41707
+ if (S === 0 && h === 0)
41711
41708
  return ie === 0 ? { ...Xd, totalCount: y } : Sx(ie, T, x, _, k, O || []);
41712
41709
  if (Ze(ye))
41713
41710
  return ie > 0 ? null : Rl(
@@ -41730,7 +41727,7 @@ const ka = Ve(
41730
41727
  }
41731
41728
  if (!I)
41732
41729
  return Rl([], pe, y, k, Z, _);
41733
- const Ue = B.length > 0 ? B[B.length - 1] + 1 : 0, K = JW(fe, P, h, Ue);
41730
+ const Ue = B.length > 0 ? B[B.length - 1] + 1 : 0, K = JW(fe, S, h, Ue);
41734
41731
  if (K.length === 0)
41735
41732
  return null;
41736
41733
  const ve = y - 1, De = ed([], (Ae) => {
@@ -41738,8 +41735,8 @@ const ka = Ve(
41738
41735
  const ge = Ee.value;
41739
41736
  let Qe = ge.offset, Ye = Ee.start;
41740
41737
  const et = ge.size;
41741
- if (ge.offset < P) {
41742
- Ye += Math.floor((P - ge.offset + k) / (et + k));
41738
+ if (ge.offset < S) {
41739
+ Ye += Math.floor((S - ge.offset + k) / (et + k));
41743
41740
  const Ot = Ye - Ee.start;
41744
41741
  Qe += Ot * et + Ot * k;
41745
41742
  }
@@ -41748,7 +41745,7 @@ const ka = Ve(
41748
41745
  for (let Ot = Ye; Ot <= yr && !(Qe >= h); Ot++)
41749
41746
  Ae.push({ data: O == null ? void 0 : O[Ot], index: Ot, offset: Qe, size: et }), Qe += et + k;
41750
41747
  }
41751
- }), He = G1(S, Ki), at = G1(S, Yi);
41748
+ }), He = G1(P, Ki), at = G1(P, Yi);
41752
41749
  if (De.length > 0 && (He > 0 || at > 0)) {
41753
41750
  const Ae = De[0], Ee = De[De.length - 1];
41754
41751
  if (He > 0 && Ae.index > Ue) {
@@ -41773,7 +41770,7 @@ const ka = Ve(
41773
41770
  }
41774
41771
  ),
41775
41772
  //@ts-expect-error filter needs to be fixed
41776
- he((P) => P !== null),
41773
+ he((S) => S !== null),
41777
41774
  tt()
41778
41775
  ),
41779
41776
  Xd
@@ -41782,59 +41779,59 @@ const ka = Ve(
41782
41779
  j(
41783
41780
  e,
41784
41781
  he(xm),
41785
- re((P) => P == null ? void 0 : P.length)
41782
+ re((S) => S == null ? void 0 : S.length)
41786
41783
  ),
41787
41784
  s
41788
41785
  ), ce(
41789
41786
  j(
41790
41787
  A,
41791
- re((P) => P.topListHeight)
41788
+ re((S) => S.topListHeight)
41792
41789
  ),
41793
41790
  d
41794
41791
  ), ce(d, i), ce(
41795
41792
  j(
41796
41793
  A,
41797
- re((P) => [P.top, P.bottom])
41794
+ re((S) => [S.top, S.bottom])
41798
41795
  ),
41799
41796
  o
41800
41797
  ), ce(
41801
41798
  j(
41802
41799
  A,
41803
- re((P) => P.items)
41800
+ re((S) => S.items)
41804
41801
  ),
41805
41802
  v
41806
41803
  );
41807
41804
  const C = ur(
41808
41805
  j(
41809
41806
  A,
41810
- he(({ items: P }) => P.length > 0),
41807
+ he(({ items: S }) => S.length > 0),
41811
41808
  Pe(s, e),
41812
- he(([{ items: P }, h]) => P[P.length - 1].originalIndex === h - 1),
41813
- re(([, P, h]) => [P - 1, h]),
41809
+ he(([{ items: S }, h]) => S[S.length - 1].originalIndex === h - 1),
41810
+ re(([, S, h]) => [S - 1, h]),
41814
41811
  tt(Vi),
41815
- re(([P]) => P)
41812
+ re(([S]) => S)
41816
41813
  )
41817
41814
  ), F = ur(
41818
41815
  j(
41819
41816
  A,
41820
41817
  Nn(200),
41821
- he(({ items: P, topItems: h }) => P.length > 0 && P[0].originalIndex === h.length),
41822
- re(({ items: P }) => P[0].index),
41818
+ he(({ items: S, topItems: h }) => S.length > 0 && S[0].originalIndex === h.length),
41819
+ re(({ items: S }) => S[0].index),
41823
41820
  tt()
41824
41821
  )
41825
41822
  ), R = ur(
41826
41823
  j(
41827
41824
  A,
41828
- he(({ items: P }) => P.length > 0),
41829
- re(({ items: P }) => {
41830
- let h = 0, y = P.length - 1;
41831
- for (; P[h].type === "group" && h < y; )
41825
+ he(({ items: S }) => S.length > 0),
41826
+ re(({ items: S }) => {
41827
+ let h = 0, y = S.length - 1;
41828
+ for (; S[h].type === "group" && h < y; )
41832
41829
  h++;
41833
- for (; P[y].type === "group" && y > h; )
41830
+ for (; S[y].type === "group" && y > h; )
41834
41831
  y--;
41835
41832
  return {
41836
- endIndex: P[y].index,
41837
- startIndex: P[h].index
41833
+ endIndex: S[y].index,
41834
+ startIndex: S[h].index
41838
41835
  };
41839
41836
  }),
41840
41837
  tt(wx)
@@ -41913,14 +41910,14 @@ const ka = Ve(
41913
41910
  Pe(t, c, r, a, s, n, i),
41914
41911
  Pe(e),
41915
41912
  re(([[d, f, m, b, g, E, v, w], A]) => {
41916
- const { align: C, behavior: F, calculateViewLocation: R = fq, done: P, ...h } = d, y = kx(d, f, b - 1), x = Wi(y, f.offsetTree, A) + g + E, T = x + Yr(f.sizeTree, y)[1], I = w + E, B = w + m - v, _ = R({
41913
+ const { align: C, behavior: F, calculateViewLocation: R = fq, done: S, ...h } = d, y = kx(d, f, b - 1), x = Wi(y, f.offsetTree, A) + g + E, T = x + Yr(f.sizeTree, y)[1], I = w + E, B = w + m - v, _ = R({
41917
41914
  itemBottom: T,
41918
41915
  itemTop: x,
41919
41916
  locationParams: { align: C, behavior: F, ...h },
41920
41917
  viewportBottom: B,
41921
41918
  viewportTop: I
41922
41919
  });
41923
- return _ ? P && Hr(
41920
+ return _ ? S && Hr(
41924
41921
  j(
41925
41922
  o,
41926
41923
  he((k) => !k),
@@ -41928,8 +41925,8 @@ const ka = Ve(
41928
41925
  // but if scrollingInProgress is true, we skip the initial publish.
41929
41926
  ma(ct(o) ? 1 : 2)
41930
41927
  ),
41931
- P
41932
- ) : P && P(), _;
41928
+ S
41929
+ ) : S && S(), _;
41933
41930
  }),
41934
41931
  he((d) => d !== null)
41935
41932
  ),
@@ -41969,9 +41966,9 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
41969
41966
  j(
41970
41967
  vt(j(me(t), ma(1)), c),
41971
41968
  Pe(me(b), a, i, d),
41972
- re(([[F, R], P, h, y, x]) => {
41969
+ re(([[F, R], S, h, y, x]) => {
41973
41970
  let T = R && y, I = "auto";
41974
- return T && (I = mq(P, h || x), T = T && !!I), { followOutputBehavior: I, shouldFollow: T, totalCount: F };
41971
+ return T && (I = mq(S, h || x), T = T && !!I), { followOutputBehavior: I, shouldFollow: T, totalCount: F };
41975
41972
  }),
41976
41973
  he(({ shouldFollow: F }) => F)
41977
41974
  ),
@@ -41984,8 +41981,8 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
41984
41981
  }
41985
41982
  );
41986
41983
  function w(F) {
41987
- const R = Hr(s, (P) => {
41988
- F && !P.atBottom && P.notAtBottomBecause === "SIZE_INCREASED" && !E && (ct(u)("scrolling to bottom due to increased size", {}, sr.DEBUG), v("auto"));
41984
+ const R = Hr(s, (S) => {
41985
+ F && !S.atBottom && S.notAtBottomBecause === "SIZE_INCREASED" && !E && (ct(u)("scrolling to bottom due to increased size", {}, sr.DEBUG), v("auto"));
41989
41986
  });
41990
41987
  setTimeout(R, 100);
41991
41988
  }
@@ -42025,7 +42022,7 @@ const mq = (e, t) => typeof e == "function" ? j1(e(t)) : t && j1(e), hq = Ve(
42025
42022
  j(
42026
42023
  vt(j(C, ma(1)), c),
42027
42024
  Pe(me(A), i, d, f),
42028
- re(([[F, R], P, h, y, x]) => R && h && (P == null ? void 0 : P({ context: x, totalCount: F, scrollingInProgress: y }))),
42025
+ re(([[F, R], S, h, y, x]) => R && h && (S == null ? void 0 : S({ context: x, totalCount: F, scrollingInProgress: y }))),
42029
42026
  he((F) => !!F),
42030
42027
  Nn(0)
42031
42028
  ),
@@ -42219,10 +42216,10 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
42219
42216
  c,
42220
42217
  Pe(o),
42221
42218
  ln(
42222
- ([, v, w, A], [{ bottom: C, items: F, offsetBottom: R, totalCount: P }, h]) => {
42219
+ ([, v, w, A], [{ bottom: C, items: F, offsetBottom: R, totalCount: S }, h]) => {
42223
42220
  const y = C + R;
42224
42221
  let x = 0;
42225
- return w === P && v.length > 0 && F.length > 0 && (F[0].originalIndex === 0 && v[0].originalIndex === 0 || (x = y - A, x !== 0 && (x += h))), [x, F, P, y];
42222
+ return w === S && v.length > 0 && F.length > 0 && (F[0].originalIndex === 0 && v[0].originalIndex === 0 || (x = y - A, x !== 0 && (x += h))), [x, F, S, y];
42226
42223
  },
42227
42224
  [0, [], 0, 0]
42228
42225
  ),
@@ -42256,21 +42253,21 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
42256
42253
  l,
42257
42254
  Pe(f, u),
42258
42255
  re(([v, { groupIndices: w, lastSize: A, sizeTree: C }, F]) => {
42259
- function R(P) {
42260
- return P * (A + F);
42256
+ function R(S) {
42257
+ return S * (A + F);
42261
42258
  }
42262
42259
  if (w.length === 0)
42263
42260
  return R(v);
42264
42261
  {
42265
- let P = 0;
42262
+ let S = 0;
42266
42263
  const h = ji(C, 0);
42267
42264
  let y = 0, x = 0;
42268
42265
  for (; y < v; ) {
42269
- y++, P += h;
42266
+ y++, S += h;
42270
42267
  let T = w.length === x + 1 ? 1 / 0 : w[x + 1] - w[x] - 1;
42271
- y + T > v && (P -= h, T = v - y + 1), y += T, P += R(T), x++;
42268
+ y + T > v && (S -= h, T = v - y + 1), y += T, S += R(T), x++;
42272
42269
  }
42273
- return P;
42270
+ return S;
42274
42271
  }
42275
42272
  })
42276
42273
  ),
@@ -42348,7 +42345,7 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
42348
42345
  C,
42349
42346
  { scrollToIndex: F },
42350
42347
  R,
42351
- { topItemCount: P },
42348
+ { topItemCount: S },
42352
42349
  { groupCounts: h },
42353
42350
  y
42354
42351
  ]) => {
@@ -42372,7 +42369,7 @@ const vq = Ux(() => /iP(ad|od|hone)/i.test(navigator.userAgent) && /WebKit/i.tes
42372
42369
  initialTopMostItemIndex: g,
42373
42370
  scrolledToInitialItem: E,
42374
42371
  sizeRanges: l,
42375
- topItemCount: P,
42372
+ topItemCount: S,
42376
42373
  topItemsIndexes: I,
42377
42374
  // input
42378
42375
  totalCount: f,
@@ -42445,12 +42442,12 @@ function Dx(e, t, r) {
42445
42442
  return o.reduce((v, w) => (v[w] = zW(E[t.events[w]]), v), {});
42446
42443
  }
42447
42444
  const d = te.forwardRef((E, v) => {
42448
- const { children: w, ...A } = E, [C] = te.useState(() => ed(HW(e), (P) => {
42449
- c(P, A);
42445
+ const { children: w, ...A } = E, [C] = te.useState(() => ed(HW(e), (S) => {
42446
+ c(S, A);
42450
42447
  })), [F] = te.useState(D1(u, C));
42451
42448
  Sl(() => {
42452
- for (const P of o)
42453
- P in A && qe(F[P], A[P]);
42449
+ for (const S of o)
42450
+ S in A && qe(F[S], A[S]);
42454
42451
  return () => {
42455
42452
  Object.values(F).map(wm);
42456
42453
  };
@@ -42607,7 +42604,7 @@ const Aq = /* @__PURE__ */ Ve(() => {
42607
42604
  Bm("deviation", (_) => {
42608
42605
  v !== _ && w(_);
42609
42606
  });
42610
- const A = we("EmptyPlaceholder"), C = we("ScrollSeekPlaceholder") || Pq, F = we("ListComponent"), R = we("ItemComponent"), P = we("GroupComponent"), h = we("computeItemKey"), y = we("isSeeking"), x = we("groupIndices").length > 0, T = we("alignToBottom"), I = we("initialItemFinalLocationReached"), B = e ? {} : {
42607
+ const A = we("EmptyPlaceholder"), C = we("ScrollSeekPlaceholder") || Pq, F = we("ListComponent"), R = we("ItemComponent"), S = we("GroupComponent"), h = we("computeItemKey"), y = we("isSeeking"), x = we("groupIndices").length > 0, T = we("alignToBottom"), I = we("initialItemFinalLocationReached"), B = e ? {} : {
42611
42608
  boxSizing: "border-box",
42612
42609
  ...g ? {
42613
42610
  display: "inline-block",
@@ -42631,25 +42628,25 @@ const Aq = /* @__PURE__ */ Ve(() => {
42631
42628
  ref: E,
42632
42629
  style: B,
42633
42630
  children: (e ? t.topItems : t.items).map((_) => {
42634
- const k = _.originalIndex, S = h(k + t.firstItemIndex, _.data, l);
42631
+ const k = _.originalIndex, P = h(k + t.firstItemIndex, _.data, l);
42635
42632
  return y ? /* @__PURE__ */ Na(
42636
42633
  C,
42637
42634
  {
42638
42635
  ...Nt(C, l),
42639
42636
  height: _.size,
42640
42637
  index: _.index,
42641
- key: S,
42638
+ key: P,
42642
42639
  type: _.type || "item",
42643
42640
  ..._.type === "group" ? {} : { groupIndex: _.groupIndex }
42644
42641
  }
42645
42642
  ) : _.type === "group" ? /* @__PURE__ */ Na(
42646
- P,
42643
+ S,
42647
42644
  {
42648
- ...Nt(P, l),
42645
+ ...Nt(S, l),
42649
42646
  "data-index": k,
42650
42647
  "data-item-index": _.index,
42651
42648
  "data-known-size": _.size,
42652
- key: S,
42649
+ key: P,
42653
42650
  style: Iq
42654
42651
  },
42655
42652
  u(_.index, l)
@@ -42662,7 +42659,7 @@ const Aq = /* @__PURE__ */ Ve(() => {
42662
42659
  "data-item-group-index": _.groupIndex,
42663
42660
  "data-item-index": _.index,
42664
42661
  "data-known-size": _.size,
42665
- key: S,
42662
+ key: P,
42666
42663
  style: g ? Bq : Lx
42667
42664
  },
42668
42665
  x ? c(_.index, _.groupIndex, _.data, l) : c(_.index, _.data, l)
@@ -42954,7 +42951,7 @@ const Kq = /* @__PURE__ */ Ve(
42954
42951
  { customScrollParent: E, useWindowScroll: v, windowScrollContainerState: w, windowScrollTo: A, windowViewportRect: C },
42955
42952
  F
42956
42953
  ]) => {
42957
- const R = q(0), P = q(0), h = q(q1), y = q({ height: 0, width: 0 }), x = q({ height: 0, width: 0 }), T = Re(), I = Re(), B = q(0), _ = q(null), k = q({ column: 0, row: 0 }), S = Re(), O = Re(), U = q(!1), N = q(0), L = q(!0), H = q(!1), Z = q(!1);
42954
+ const R = q(0), S = q(0), h = q(q1), y = q({ height: 0, width: 0 }), x = q({ height: 0, width: 0 }), T = Re(), I = Re(), B = q(0), _ = q(null), k = q({ column: 0, row: 0 }), P = Re(), O = Re(), U = q(!1), N = q(0), L = q(!0), H = q(!1), Z = q(!1);
42958
42955
  qe(
42959
42956
  j(
42960
42957
  b,
@@ -42982,7 +42979,7 @@ const Kq = /* @__PURE__ */ Ve(
42982
42979
  he((K) => K != null && K.scrollTop > 0),
42983
42980
  on(0)
42984
42981
  ),
42985
- P
42982
+ S
42986
42983
  ), qe(
42987
42984
  j(
42988
42985
  b,
@@ -43015,7 +43012,7 @@ const Kq = /* @__PURE__ */ Ve(
43015
43012
  viewport: K
43016
43013
  }))
43017
43014
  ),
43018
- S
43015
+ P
43019
43016
  ), ce(
43020
43017
  j(
43021
43018
  vt(
@@ -43025,7 +43022,7 @@ const Kq = /* @__PURE__ */ Ve(
43025
43022
  me(x, Pl),
43026
43023
  me(y, Pl),
43027
43024
  me(_),
43028
- me(P),
43025
+ me(S),
43029
43026
  me(U),
43030
43027
  me(L),
43031
43028
  me(N)
@@ -43156,7 +43153,7 @@ const Kq = /* @__PURE__ */ Ve(
43156
43153
  gap: k,
43157
43154
  headerHeight: a,
43158
43155
  increaseViewportBy: e,
43159
- initialItemCount: P,
43156
+ initialItemCount: S,
43160
43157
  itemDimensions: x,
43161
43158
  overscan: r,
43162
43159
  restoreStateFrom: O,
@@ -43184,7 +43181,7 @@ const Kq = /* @__PURE__ */ Ve(
43184
43181
  propsReady: g,
43185
43182
  rangeChanged: pe,
43186
43183
  startReached: ie,
43187
- stateChanged: S,
43184
+ stateChanged: P,
43188
43185
  stateRestoreInProgress: U,
43189
43186
  ...F
43190
43187
  };
@@ -44374,23 +44371,24 @@ const gZ = () => {
44374
44371
  usd: Cs(n, t)
44375
44372
  };
44376
44373
  }, JK = () => {
44377
- const { srcToken: e, dstToken: t, account: r, chainId: n, slippage: s, config: a, module: o } = ne(), { amountWei: i } = Jr(), { amountPerTradeWei: c, totalTrades: l } = Fr(), u = nd(), { amountWei: d } = Dc(), { pricePerChunkWei: f } = Ds(), { milliseconds: m } = Os();
44374
+ const { srcToken: e, dstToken: t, account: r, chainId: n, slippage: s, config: a, module: o, fees: i } = ne(), { amountWei: c } = Jr(), { amountPerTradeWei: l, totalTrades: u } = Fr(), d = nd(), { amountWei: f } = Dc(), { pricePerChunkWei: m } = Ds(), { milliseconds: b } = Os();
44378
44375
  return Q(() => {
44379
- var b;
44376
+ var g;
44380
44377
  return zw({
44381
44378
  chainId: n,
44382
- srcToken: xo((e == null ? void 0 : e.address) || "") ? ((b = wo(n)) == null ? void 0 : b.wToken.address) || "" : (e == null ? void 0 : e.address) || "",
44379
+ srcToken: xo((e == null ? void 0 : e.address) || "") ? ((g = wo(n)) == null ? void 0 : g.wToken.address) || "" : (e == null ? void 0 : e.address) || "",
44383
44380
  dstToken: (t == null ? void 0 : t.address) || "",
44384
- srcAmount: i,
44385
- deadlineMillis: u,
44386
- fillDelayMillis: !l || l === 1 ? 0 : m,
44381
+ srcAmount: c,
44382
+ deadlineMillis: d,
44383
+ fillDelayMillis: !u || u === 1 ? 0 : b,
44387
44384
  slippage: s * 100,
44388
44385
  account: r,
44389
- srcAmountPerTrade: c,
44390
- dstMinAmountPerTrade: d,
44391
- triggerAmountPerTrade: f,
44386
+ srcAmountPerTrade: l,
44387
+ dstMinAmountPerTrade: f,
44388
+ triggerAmountPerTrade: m,
44392
44389
  config: a,
44393
- module: o
44390
+ module: o,
44391
+ feePercentage: i
44394
44392
  });
44395
44393
  }, [
44396
44394
  e,
@@ -44400,12 +44398,13 @@ const gZ = () => {
44400
44398
  s,
44401
44399
  a,
44402
44400
  o,
44403
- i,
44404
44401
  c,
44405
44402
  l,
44403
+ u,
44404
+ b,
44405
+ f,
44406
44406
  m,
44407
- d,
44408
- f
44407
+ i
44409
44408
  ]);
44410
44409
  }, eY = () => {
44411
44410
  const { srcToken: e, dstToken: t, account: r } = ne(), { amountWei: n } = Jr(), { amountWei: s } = Uc(), { amountPerTradeWei: a, totalTrades: o } = Fr(), i = nd(), { amountWei: c } = Dc(), { pricePerChunkWei: l } = Ds(), { milliseconds: u } = Os(), d = JK();
@@ -44445,7 +44444,7 @@ const gZ = () => {
44445
44444
  amount: b,
44446
44445
  percent: g,
44447
44446
  usd: E
44448
- } = QK(), { milliseconds: v } = Os(), { amountUI: w } = Oc(), { srcAmountUsd: A, dstAmountUsd: C } = XK(), F = Jr().amountUI, R = J((T) => T.state.isMarketOrder), P = J((T) => T.state.currentTime), h = ex({
44447
+ } = QK(), { milliseconds: v } = Os(), { amountUI: w } = Oc(), { srcAmountUsd: A, dstAmountUsd: C } = XK(), F = Jr().amountUI, R = J((T) => T.state.isMarketOrder), S = J((T) => T.state.currentTime), h = ex({
44449
44448
  srcToken: e,
44450
44449
  dstToken: t,
44451
44450
  account: r,
@@ -44465,7 +44464,7 @@ const gZ = () => {
44465
44464
  dstUsd: C,
44466
44465
  dstAmount: w,
44467
44466
  orderType: nx(),
44468
- createdAt: P
44467
+ createdAt: S
44469
44468
  }), y = Kr({ value: b }), x = Kr({ value: E });
44470
44469
  return Q(() => ({
44471
44470
  ...h,