@nano-lib/util 1.1.2 → 1.1.4

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.
package/lib/index.mjs CHANGED
@@ -10,12 +10,12 @@ function Gn(t) {
10
10
  return t ? document.querySelector(t).scrollTop : document.documentElement.scrollTop || document.body.parentNode.scrollTop || document.body.scrollTop;
11
11
  }
12
12
  function Wn(t) {
13
- const { target: i, to: o = 0, duration: s = 500, callback: u } = t ?? {}, f = Gn(i), d = o - f, a = 20;
14
- let b = 0;
13
+ const { target: i, to: o = 0, duration: s = 500, callback: u } = t ?? {}, f = Gn(i), h = o - f, a = 20;
14
+ let y = 0;
15
15
  const m = function() {
16
- b += a;
17
- const v = jn(b, f, d, s);
18
- Zn(v, i), b < s ? Un(m) : u && u();
16
+ y += a;
17
+ const v = jn(y, f, h, s);
18
+ Zn(v, i), y < s ? Un(m) : u && u();
19
19
  };
20
20
  m();
21
21
  }
@@ -41,13 +41,13 @@ function Xn() {
41
41
  function mt(t, i) {
42
42
  if (!t) return "-";
43
43
  t.toString().length === 10 && (t = +t * 1e3), i ?? (i = "YYYY-MM-DD HH:mm:ss");
44
- const o = new Date(t), s = (d, a, b = " ") => {
45
- if (d.length >= a) return d;
46
- const m = a - d.length;
47
- let v = Math.ceil(m / b.length);
44
+ const o = new Date(t), s = (h, a, y = " ") => {
45
+ if (h.length >= a) return h;
46
+ const m = a - h.length;
47
+ let v = Math.ceil(m / y.length);
48
48
  for (; v >>= 1; )
49
- b += b, v === 1 && (b += b);
50
- return b.slice(0, m) + d;
49
+ y += y, v === 1 && (y += y);
50
+ return y.slice(0, m) + h;
51
51
  };
52
52
  let u;
53
53
  const f = {
@@ -58,8 +58,8 @@ function mt(t, i) {
58
58
  "m+": o.getMinutes().toString(),
59
59
  "s+": o.getSeconds().toString()
60
60
  };
61
- for (const d in f)
62
- u = new RegExp("(" + d + ")").exec(i), u && (i = i.replace(u[1], u[1].length == 1 ? f[d] : s(f[d], u[1].length, "0")));
61
+ for (const h in f)
62
+ u = new RegExp("(" + h + ")").exec(i), u && (i = i.replace(u[1], u[1].length == 1 ? f[h] : s(f[h], u[1].length, "0")));
63
63
  return i;
64
64
  }
65
65
  function Kn(t, i) {
@@ -180,10 +180,10 @@ function pr(t) {
180
180
  }
181
181
  const jt = () => {
182
182
  };
183
- function bi(t) {
183
+ function wi(t) {
184
184
  return new Promise((i) => setTimeout(i, t));
185
185
  }
186
- function wi(t, i) {
186
+ function Ti(t, i) {
187
187
  return new Promise((o) => {
188
188
  const s = setInterval(() => {
189
189
  if (t === 0)
@@ -192,18 +192,18 @@ function wi(t, i) {
192
192
  }, 1e3);
193
193
  });
194
194
  }
195
- function Ti(t, i) {
195
+ function Fi(t, i) {
196
196
  const o = t.slice(), s = [];
197
197
  let u = o.length;
198
198
  const f = [];
199
199
  if (i > u) return null;
200
200
  for (; i--; ) {
201
- const d = Math.floor(Math.random() * u);
202
- s[i] = o[d in f ? f[d] : d], f[d] = --u in f ? f[u] : u;
201
+ const h = Math.floor(Math.random() * u);
202
+ s[i] = o[h in f ? f[h] : h], f[h] = --u in f ? f[u] : u;
203
203
  }
204
204
  return s;
205
205
  }
206
- function Fi(t, i) {
206
+ function Si(t, i) {
207
207
  let o = null;
208
208
  return function(...s) {
209
209
  o !== null && clearTimeout(o), o = setTimeout(() => {
@@ -211,41 +211,58 @@ function Fi(t, i) {
211
211
  }, i);
212
212
  };
213
213
  }
214
- function Si(t) {
214
+ function Ei(t) {
215
215
  if (!zt(t))
216
216
  throw new Error("Please provide a valid ID number!");
217
217
  const i = t.length, o = i === 15 ? t[i - 1] : t[i - 2];
218
218
  return parseInt(o) % 2 === 1 ? "1" : "2";
219
219
  }
220
- function Ei(t) {
220
+ function Bi(t) {
221
221
  if (!zt(t))
222
222
  throw new Error("Please provide a valid ID number!");
223
223
  return t.substring(6, 10) + "-" + t.substring(10, 12) + "-" + t.substring(12, 14);
224
224
  }
225
- const Bi = (t = "443", i = "80") => {
226
- const { protocol: o, hostname: s, port: u, pathname: f } = window.location, d = o.replace(":", ""), a = u || (d === "https" ? t : i), b = gr(f);
225
+ function _i(t) {
226
+ const { baseUrl: i, initUrl: o, initParams: s, initFn: u } = t;
227
+ return new Promise((f) => {
228
+ if (i) {
229
+ f(!0);
230
+ return;
231
+ }
232
+ const h = {};
233
+ if (s !== null && typeof s == "object")
234
+ Object.assign(h, s);
235
+ else {
236
+ const { protocol: a, hostname: y, port: m, pathname: v } = gr();
237
+ Object.assign(h, { frontendProtocol: a, frontendDomain: y, frontendPort: m, frontendContextPath: v });
238
+ }
239
+ u(o, h).then((a) => f(a)).catch(() => f(!1));
240
+ });
241
+ }
242
+ const gr = (t = "443", i = "80") => {
243
+ const { protocol: o, hostname: s, port: u, pathname: f } = window.location, h = o.replace(":", ""), a = u || (h === "https" ? t : i), y = xr(f);
227
244
  return {
228
245
  hostname: s,
229
- protocol: d,
246
+ protocol: h,
230
247
  port: a,
231
- pathname: b
248
+ pathname: y
232
249
  };
233
- }, gr = (t) => {
250
+ }, xr = (t) => {
234
251
  const i = "/";
235
252
  if (!t || t === i) return i;
236
253
  const o = t.endsWith("/") ? t.slice(0, -1) : t, s = o.lastIndexOf("/");
237
254
  return s > 0 && o.substring(s + 1).includes(".") ? o.substring(0, s) : o;
238
- }, xr = (t, i = "") => {
255
+ }, mr = (t, i = "") => {
239
256
  i || (i = location.origin);
240
257
  const o = new RegExp(/^http(s)?:\/\//), s = new RegExp(/^((?:[a-z]+:)?\/\/|data:image\/)(.*)/i);
241
258
  return o.test(t) || s.test(t) ? t : i + t;
242
- }, _i = (t, i = "") => {
259
+ }, Ri = (t, i = "") => {
243
260
  typeof t == "string" && (t = t === "" ? [] : t.split(","));
244
261
  for (const o in t)
245
- t[o] = xr(t[o], i);
262
+ t[o] = mr(t[o], i);
246
263
  return t;
247
264
  };
248
- function Ri(t) {
265
+ function Di(t) {
249
266
  if (!t.length)
250
267
  return;
251
268
  let i = 0;
@@ -258,7 +275,7 @@ function Ri(t) {
258
275
  }
259
276
  o();
260
277
  }
261
- function Di(t) {
278
+ function Ai(t) {
262
279
  let i = jt;
263
280
  return (...o) => new Promise((s, u) => {
264
281
  i(), i = () => {
@@ -269,35 +286,35 @@ function Di(t) {
269
286
  );
270
287
  });
271
288
  }
272
- function Ai(t, i) {
289
+ function Ii(t, i) {
273
290
  const o = document.createElement("a");
274
291
  o.download = i, o.href = t, o.click();
275
292
  }
276
- function mr(t) {
293
+ function vr(t) {
277
294
  const i = [];
278
295
  for (let o = 0; o < t.length; o++)
279
296
  t[o] && i.push(t[o]);
280
297
  return i;
281
298
  }
282
- function Ii(t, i, o = !1) {
299
+ function Mi(t, i, o = !1) {
283
300
  let s = Math.round(t / i * 1e4) / 100;
284
301
  return Number.isNaN(s) && (s = 0), o ? Math.floor(s) : s;
285
302
  }
286
- function Mi(t) {
303
+ function Oi(t) {
287
304
  const i = document.createElement("link");
288
305
  i.rel = "stylesheet", i.href = t, i.crossOrigin = "anonymous", document.getElementsByTagName("head")[0].appendChild(i);
289
306
  }
290
- function Oi(t) {
307
+ function qi(t) {
291
308
  return new Promise((i, o) => {
292
309
  const s = document.createElement("script");
293
310
  s.type = "text/javascript", s.src = t, s.onload = () => i(), s.onerror = (u) => o(u), document.getElementsByTagName("head")[0].appendChild(s);
294
311
  });
295
312
  }
296
- function qi(t, i = 48, o = 48) {
313
+ function Ci(t, i = 48, o = 48) {
297
314
  const s = t.replace("#", "");
298
315
  return `data:image/svg+xml;utf8,<svg viewBox="0 0 1024 1024" version="1.1" xmlns="http://www.w3.org/2000/svg" width="${i}" height="${o}"><path d="M787.510356 387.850445c0-152.160515-123.350352-275.511891-275.510868-275.511891S236.487597 235.68993 236.487597 387.850445c0 44.665269 10.640338 86.841857 29.507034 124.151601l-0.010233-0.001023 0.059352 0.100284c5.548366 10.962679 11.812023 21.500687 18.723434 31.56081L511.999488 926.678464l227.234351-383.021463c6.909363-10.057053 13.170974-20.593014 18.71934-31.552623l0.062422-0.104377-0.011256 0.002047C776.870018 474.692303 787.510356 432.515714 787.510356 387.850445zM511.999488 506.802628c-74.596975 0-135.070278-60.47228-135.070278-135.070278 0-74.595952 60.47228-135.069255 135.070278-135.069255 74.595952 0 135.069255 60.473303 135.069255 135.069255C647.068743 446.330348 586.59544 506.802628 511.999488 506.802628z" fill="%23${s}"></path></svg>`;
299
316
  }
300
- const vr = [
317
+ const yr = [
301
318
  ["date", "YYYY-MM-DD"],
302
319
  ["daterange", "YYYY-MM-DD"],
303
320
  ["datetime", "YYYY-MM-DD HH:mm:ss"],
@@ -307,7 +324,7 @@ const vr = [
307
324
  ["year", "YYYY"],
308
325
  ["yearrange", "YYYY"],
309
326
  ["time", "HH:mm:ss"]
310
- ], yr = {
327
+ ], br = {
311
328
  view: "查看",
312
329
  add: "添加",
313
330
  edit: "编辑",
@@ -355,8 +372,9 @@ const vr = [
355
372
  all: "全部",
356
373
  export: "导出",
357
374
  import: "导入",
375
+ tip: "提示",
358
376
  defaultErrorCode: "系统未知错误,请反馈给管理员"
359
- }, br = {
377
+ }, wr = {
360
378
  400: "请求失败,请您稍后重试!",
361
379
  401: "认证失败,无法访问系统资源!",
362
380
  403: "当前操作没有权限!",
@@ -367,43 +385,43 @@ const vr = [
367
385
  502: "网关错误!",
368
386
  503: "服务不可用!",
369
387
  504: "网关超时!"
370
- }, wr = new Map(vr), et = yr, Tr = br, fe = ["jpg", "jpeg", "png", "bmp", "gif"], ce = ["mp3", "mp4", "webm", "ogg", "3gp"], ue = ["doc", "docx", "xls", "xlsx", "ppt", "txt", "pdf", "zip"], Fr = [...fe, ...ce, ...ue];
371
- function Sr(t) {
372
- return Tr[t] ?? et.defaultErrorCode;
373
- }
388
+ }, Tr = new Map(yr), et = br, Fr = wr, fe = ["jpg", "jpeg", "png", "bmp", "gif"], ce = ["mp3", "mp4", "webm", "ogg", "3gp"], ue = ["doc", "docx", "xls", "xlsx", "ppt", "txt", "pdf", "zip"], Sr = [...fe, ...ce, ...ue];
374
389
  function Er(t) {
375
- return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.yes : et.no);
390
+ return Fr[t] ?? et.defaultErrorCode;
376
391
  }
377
392
  function Br(t) {
378
- return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.have : et.noHave);
393
+ return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.yes : et.no);
379
394
  }
380
395
  function _r(t) {
396
+ return t == null ? et.unfilled : (t = typeof t == "number" ? `${t}` : t, t === "1" ? et.have : et.noHave);
397
+ }
398
+ function Rr(t) {
381
399
  return t ? t.replace(/(\d{3})\d{4}(\d{4})/, "$1****$2") : "";
382
400
  }
383
- function Rr(t, i, o) {
401
+ function Dr(t, i, o) {
384
402
  if (i ?? (i = 4), o ?? (o = 4), t) {
385
403
  const s = t.length;
386
404
  return t.substring(0, i) + "*".repeat(s - i - o) + t.substring(s - o);
387
405
  }
388
406
  return "";
389
407
  }
390
- function Dr(t) {
408
+ function Ar(t) {
391
409
  return t.replace(/( |^)[a-z]/g, (i) => i.toUpperCase());
392
410
  }
393
- function Ar(t) {
411
+ function Ir(t) {
394
412
  return t.replace(/( |^)[A-Z]/g, (i) => i.toLowerCase());
395
413
  }
396
- function Ir(t, i) {
414
+ function Mr(t, i) {
397
415
  const o = t.find((s) => s.value === i);
398
416
  return o ? o.label : "";
399
417
  }
400
- function Mr(t, i, o) {
418
+ function Or(t, i, o) {
401
419
  const s = [], u = i.split(","), f = o.split(",");
402
420
  return Array.from(new Set(u)).forEach((a) => {
403
- const b = t.find((m) => m.value === a);
404
- b && f.forEach((m) => {
421
+ const y = t.find((m) => m.value === a);
422
+ y && f.forEach((m) => {
405
423
  var B;
406
- const v = (B = b.children) == null ? void 0 : B.find((_) => _.value === m);
424
+ const v = (B = y.children) == null ? void 0 : B.find((_) => _.value === m);
407
425
  v && s.push(v);
408
426
  });
409
427
  }), s.map((a) => a.label).join();
@@ -411,22 +429,22 @@ function Mr(t, i, o) {
411
429
  function ae(t, i, o) {
412
430
  var f;
413
431
  if (!i) return "";
414
- const s = i.split(","), u = o.find((d) => d.value === s[t]);
432
+ const s = i.split(","), u = o.find((h) => h.value === s[t]);
415
433
  return u ? ((f = u.children) != null && f.length && ae(t + 1, i, u.children), u.label) : "";
416
434
  }
417
- function Or(t, i, o) {
435
+ function qr(t, i, o) {
418
436
  if (!t) return "";
419
- const s = t.split(","), u = [], f = s.length - 1, d = s.findIndex((a) => a === o);
420
- if (d !== -1) {
437
+ const s = t.split(","), u = [], f = s.length - 1, h = s.findIndex((a) => a === o);
438
+ if (h !== -1) {
421
439
  const a = s[f] === o;
422
- s.splice(a ? 0 : d, a ? f : 1);
440
+ s.splice(a ? 0 : h, a ? f : 1);
423
441
  }
424
442
  return s.forEach((a) => {
425
- const b = i.find((m) => m.value === a);
426
- b && u.push(b);
443
+ const y = i.find((m) => m.value === a);
444
+ y && u.push(y);
427
445
  }), u.map((a) => a.label).join();
428
446
  }
429
- function qr(t) {
447
+ function Cr(t) {
430
448
  let i = "";
431
449
  for (const o of Object.keys(t)) {
432
450
  const s = t[o], u = `${encodeURIComponent(o)}=`;
@@ -434,7 +452,7 @@ function qr(t) {
434
452
  if (typeof s == "object") {
435
453
  for (const f of Object.keys(s))
436
454
  if (s[f] !== null && typeof s[f] < "u") {
437
- const d = `${o}[${f}]`, a = `${encodeURIComponent(d)}=`;
455
+ const h = `${o}[${f}]`, a = `${encodeURIComponent(h)}=`;
438
456
  i += `${a + encodeURIComponent(s[f])}&`;
439
457
  }
440
458
  } else
@@ -442,12 +460,12 @@ function qr(t) {
442
460
  }
443
461
  return i;
444
462
  }
445
- function Cr(t) {
446
- return t ? mr(
463
+ function Pr(t) {
464
+ return t ? vr(
447
465
  Object.keys(t).map((i) => t[i] === void 0 ? "" : `${encodeURIComponent(i)}=${encodeURIComponent(t[i])}`)
448
466
  ).join("&") : "";
449
467
  }
450
- function Pr(t) {
468
+ function zr(t) {
451
469
  const i = decodeURIComponent(t.split("?")[1]).replace(/\+/g, " ");
452
470
  if (!i)
453
471
  return {};
@@ -455,8 +473,8 @@ function Pr(t) {
455
473
  return i.split("&").forEach((u) => {
456
474
  const f = u.indexOf("=");
457
475
  if (f !== -1) {
458
- const d = u.substring(0, f), a = u.substring(f + 1, u.length);
459
- o[d] = a;
476
+ const h = u.substring(0, f), a = u.substring(f + 1, u.length);
477
+ o[h] = a;
460
478
  }
461
479
  }), o;
462
480
  }
@@ -500,46 +518,46 @@ var he = function() {
500
518
  }, i.prototype.forEach = function(o, s) {
501
519
  s === void 0 && (s = null);
502
520
  for (var u = 0, f = this.__entries__; u < f.length; u++) {
503
- var d = f[u];
504
- o.call(s, d[1], d[0]);
521
+ var h = f[u];
522
+ o.call(s, h[1], h[0]);
505
523
  }
506
524
  }, i;
507
525
  }()
508
526
  );
509
527
  }(), Ct = typeof window < "u" && typeof document < "u" && window.document === document, vt = function() {
510
528
  return typeof global < "u" && global.Math === Math ? global : typeof self < "u" && self.Math === Math ? self : typeof window < "u" && window.Math === Math ? window : Function("return this")();
511
- }(), zr = function() {
529
+ }(), Lr = function() {
512
530
  return typeof requestAnimationFrame == "function" ? requestAnimationFrame.bind(vt) : function(t) {
513
531
  return setTimeout(function() {
514
532
  return t(Date.now());
515
533
  }, 1e3 / 60);
516
534
  };
517
- }(), Lr = 2;
518
- function Hr(t, i) {
535
+ }(), Hr = 2;
536
+ function Nr(t, i) {
519
537
  var o = !1, s = !1, u = 0;
520
538
  function f() {
521
539
  o && (o = !1, t()), s && a();
522
540
  }
523
- function d() {
524
- zr(f);
541
+ function h() {
542
+ Lr(f);
525
543
  }
526
544
  function a() {
527
- var b = Date.now();
545
+ var y = Date.now();
528
546
  if (o) {
529
- if (b - u < Lr)
547
+ if (y - u < Hr)
530
548
  return;
531
549
  s = !0;
532
550
  } else
533
- o = !0, s = !1, setTimeout(d, i);
534
- u = b;
551
+ o = !0, s = !1, setTimeout(h, i);
552
+ u = y;
535
553
  }
536
554
  return a;
537
555
  }
538
- var Nr = 20, Yr = ["top", "right", "bottom", "left", "width", "height", "size", "weight"], kr = typeof MutationObserver < "u", Vr = (
556
+ var Yr = 20, kr = ["top", "right", "bottom", "left", "width", "height", "size", "weight"], Vr = typeof MutationObserver < "u", $r = (
539
557
  /** @class */
540
558
  function() {
541
559
  function t() {
542
- this.connected_ = !1, this.mutationEventsAdded_ = !1, this.mutationsObserver_ = null, this.observers_ = [], this.onTransitionEnd_ = this.onTransitionEnd_.bind(this), this.refresh = Hr(this.refresh.bind(this), Nr);
560
+ this.connected_ = !1, this.mutationEventsAdded_ = !1, this.mutationsObserver_ = null, this.observers_ = [], this.onTransitionEnd_ = this.onTransitionEnd_.bind(this), this.refresh = Nr(this.refresh.bind(this), Yr);
543
561
  }
544
562
  return t.prototype.addObserver = function(i) {
545
563
  ~this.observers_.indexOf(i) || this.observers_.push(i), this.connected_ || this.connect_();
@@ -557,7 +575,7 @@ var Nr = 20, Yr = ["top", "right", "bottom", "left", "width", "height", "size",
557
575
  return o.broadcastActive();
558
576
  }), i.length > 0;
559
577
  }, t.prototype.connect_ = function() {
560
- !Ct || this.connected_ || (document.addEventListener("transitionend", this.onTransitionEnd_), window.addEventListener("resize", this.refresh), kr ? (this.mutationsObserver_ = new MutationObserver(this.refresh), this.mutationsObserver_.observe(document, {
578
+ !Ct || this.connected_ || (document.addEventListener("transitionend", this.onTransitionEnd_), window.addEventListener("resize", this.refresh), Vr ? (this.mutationsObserver_ = new MutationObserver(this.refresh), this.mutationsObserver_.observe(document, {
561
579
  attributes: !0,
562
580
  childList: !0,
563
581
  characterData: !0,
@@ -566,7 +584,7 @@ var Nr = 20, Yr = ["top", "right", "bottom", "left", "width", "height", "size",
566
584
  }, t.prototype.disconnect_ = function() {
567
585
  !Ct || !this.connected_ || (document.removeEventListener("transitionend", this.onTransitionEnd_), window.removeEventListener("resize", this.refresh), this.mutationsObserver_ && this.mutationsObserver_.disconnect(), this.mutationEventsAdded_ && document.removeEventListener("DOMSubtreeModified", this.refresh), this.mutationsObserver_ = null, this.mutationEventsAdded_ = !1, this.connected_ = !1);
568
586
  }, t.prototype.onTransitionEnd_ = function(i) {
569
- var o = i.propertyName, s = o === void 0 ? "" : o, u = Yr.some(function(f) {
587
+ var o = i.propertyName, s = o === void 0 ? "" : o, u = kr.some(function(f) {
570
588
  return !!~s.indexOf(f);
571
589
  });
572
590
  u && this.refresh();
@@ -600,44 +618,44 @@ function Ut(t) {
600
618
  return s + yt(f);
601
619
  }, 0);
602
620
  }
603
- function $r(t) {
621
+ function jr(t) {
604
622
  for (var i = ["top", "right", "bottom", "left"], o = {}, s = 0, u = i; s < u.length; s++) {
605
- var f = u[s], d = t["padding-" + f];
606
- o[f] = yt(d);
623
+ var f = u[s], h = t["padding-" + f];
624
+ o[f] = yt(h);
607
625
  }
608
626
  return o;
609
627
  }
610
- function jr(t) {
628
+ function Ur(t) {
611
629
  var i = t.getBBox();
612
630
  return bt(0, 0, i.width, i.height);
613
631
  }
614
- function Ur(t) {
632
+ function Zr(t) {
615
633
  var i = t.clientWidth, o = t.clientHeight;
616
634
  if (!i && !o)
617
635
  return de;
618
- var s = st(t).getComputedStyle(t), u = $r(s), f = u.left + u.right, d = u.top + u.bottom, a = yt(s.width), b = yt(s.height);
619
- if (s.boxSizing === "border-box" && (Math.round(a + f) !== i && (a -= Ut(s, "left", "right") + f), Math.round(b + d) !== o && (b -= Ut(s, "top", "bottom") + d)), !Gr(t)) {
620
- var m = Math.round(a + f) - i, v = Math.round(b + d) - o;
621
- Math.abs(m) !== 1 && (a -= m), Math.abs(v) !== 1 && (b -= v);
636
+ var s = st(t).getComputedStyle(t), u = jr(s), f = u.left + u.right, h = u.top + u.bottom, a = yt(s.width), y = yt(s.height);
637
+ if (s.boxSizing === "border-box" && (Math.round(a + f) !== i && (a -= Ut(s, "left", "right") + f), Math.round(y + h) !== o && (y -= Ut(s, "top", "bottom") + h)), !Wr(t)) {
638
+ var m = Math.round(a + f) - i, v = Math.round(y + h) - o;
639
+ Math.abs(m) !== 1 && (a -= m), Math.abs(v) !== 1 && (y -= v);
622
640
  }
623
- return bt(u.left, u.top, a, b);
641
+ return bt(u.left, u.top, a, y);
624
642
  }
625
- var Zr = /* @__PURE__ */ function() {
643
+ var Gr = /* @__PURE__ */ function() {
626
644
  return typeof SVGGraphicsElement < "u" ? function(t) {
627
645
  return t instanceof st(t).SVGGraphicsElement;
628
646
  } : function(t) {
629
647
  return t instanceof st(t).SVGElement && typeof t.getBBox == "function";
630
648
  };
631
649
  }();
632
- function Gr(t) {
633
- return t === st(t).document.documentElement;
634
- }
635
650
  function Wr(t) {
636
- return Ct ? Zr(t) ? jr(t) : Ur(t) : de;
651
+ return t === st(t).document.documentElement;
637
652
  }
638
653
  function Jr(t) {
639
- var i = t.x, o = t.y, s = t.width, u = t.height, f = typeof DOMRectReadOnly < "u" ? DOMRectReadOnly : Object, d = Object.create(f.prototype);
640
- return le(d, {
654
+ return Ct ? Gr(t) ? Ur(t) : Zr(t) : de;
655
+ }
656
+ function Xr(t) {
657
+ var i = t.x, o = t.y, s = t.width, u = t.height, f = typeof DOMRectReadOnly < "u" ? DOMRectReadOnly : Object, h = Object.create(f.prototype);
658
+ return le(h, {
641
659
  x: i,
642
660
  y: o,
643
661
  width: s,
@@ -646,35 +664,35 @@ function Jr(t) {
646
664
  right: i + s,
647
665
  bottom: u + o,
648
666
  left: i
649
- }), d;
667
+ }), h;
650
668
  }
651
669
  function bt(t, i, o, s) {
652
670
  return { x: t, y: i, width: o, height: s };
653
671
  }
654
- var Xr = (
672
+ var Kr = (
655
673
  /** @class */
656
674
  function() {
657
675
  function t(i) {
658
676
  this.broadcastWidth = 0, this.broadcastHeight = 0, this.contentRect_ = bt(0, 0, 0, 0), this.target = i;
659
677
  }
660
678
  return t.prototype.isActive = function() {
661
- var i = Wr(this.target);
679
+ var i = Jr(this.target);
662
680
  return this.contentRect_ = i, i.width !== this.broadcastWidth || i.height !== this.broadcastHeight;
663
681
  }, t.prototype.broadcastRect = function() {
664
682
  var i = this.contentRect_;
665
683
  return this.broadcastWidth = i.width, this.broadcastHeight = i.height, i;
666
684
  }, t;
667
685
  }()
668
- ), Kr = (
686
+ ), Qr = (
669
687
  /** @class */
670
688
  /* @__PURE__ */ function() {
671
689
  function t(i, o) {
672
- var s = Jr(o);
690
+ var s = Xr(o);
673
691
  le(this, { target: i, contentRect: s });
674
692
  }
675
693
  return t;
676
694
  }()
677
- ), Qr = (
695
+ ), ti = (
678
696
  /** @class */
679
697
  function() {
680
698
  function t(i, o, s) {
@@ -689,7 +707,7 @@ var Xr = (
689
707
  if (!(i instanceof st(i).Element))
690
708
  throw new TypeError('parameter 1 is not of type "Element".');
691
709
  var o = this.observations_;
692
- o.has(i) || (o.set(i, new Xr(i)), this.controller_.addObserver(this), this.controller_.refresh());
710
+ o.has(i) || (o.set(i, new Kr(i)), this.controller_.addObserver(this), this.controller_.refresh());
693
711
  }
694
712
  }, t.prototype.unobserve = function(i) {
695
713
  if (!arguments.length)
@@ -710,7 +728,7 @@ var Xr = (
710
728
  }, t.prototype.broadcastActive = function() {
711
729
  if (this.hasActive()) {
712
730
  var i = this.callbackCtx_, o = this.activeObservations_.map(function(s) {
713
- return new Kr(s.target, s.broadcastRect());
731
+ return new Qr(s.target, s.broadcastRect());
714
732
  });
715
733
  this.callback_.call(i, o, i), this.clearActive();
716
734
  }
@@ -728,7 +746,7 @@ var Xr = (
728
746
  throw new TypeError("Cannot call a class as a function.");
729
747
  if (!arguments.length)
730
748
  throw new TypeError("1 argument required, but only 0 present.");
731
- var o = Vr.getInstance(), s = new Qr(i, o, this);
749
+ var o = $r.getInstance(), s = new ti(i, o, this);
732
750
  pe.set(this, s);
733
751
  }
734
752
  return t;
@@ -744,22 +762,22 @@ var Xr = (
744
762
  return (i = pe.get(this))[t].apply(i, arguments);
745
763
  };
746
764
  });
747
- var ti = function() {
765
+ var ei = function() {
748
766
  return typeof vt.ResizeObserver < "u" ? vt.ResizeObserver : ge;
749
767
  }();
750
- function ei(t) {
768
+ function ni(t) {
751
769
  for (const i of t) {
752
770
  const o = i.target.__resizeListeners__ || [];
753
771
  o.length && o.forEach((s) => s());
754
772
  }
755
773
  }
756
- function Ci(t, i) {
757
- typeof window > "u" || (t.__resizeListeners__ || (t.__resizeListeners__ = [], t.__ro__ = new ti(ei), t.__ro__.observe(t)), t.__resizeListeners__.push(i));
758
- }
759
774
  function Pi(t, i) {
775
+ typeof window > "u" || (t.__resizeListeners__ || (t.__resizeListeners__ = [], t.__ro__ = new ei(ni), t.__ro__.observe(t)), t.__resizeListeners__.push(i));
776
+ }
777
+ function zi(t, i) {
760
778
  !t || !t.__resizeListeners__ || (t.__resizeListeners__.splice(t.__resizeListeners__.indexOf(i), 1), t.__resizeListeners__.length || t.__ro__.disconnect());
761
779
  }
762
- var xt = { exports: {} }, ni = xt.exports, Zt;
780
+ var xt = { exports: {} }, ri = xt.exports, Zt;
763
781
  function wt() {
764
782
  return Zt || (Zt = 1, function(t, i) {
765
783
  (function() {
@@ -767,32 +785,32 @@ function wt() {
767
785
  function f(e, n, r) {
768
786
  e != null && (typeof e == "number" ? this.fromNumber(e, n, r) : n == null && typeof e != "string" ? this.fromString(e, 256) : this.fromString(e, n));
769
787
  }
770
- function d() {
788
+ function h() {
771
789
  return new f(null);
772
790
  }
773
- function a(e, n, r, c, x, y) {
774
- for (; --y >= 0; ) {
791
+ function a(e, n, r, c, x, b) {
792
+ for (; --b >= 0; ) {
775
793
  var S = n * this[e++] + r[c] + x;
776
794
  x = Math.floor(S / 67108864), r[c++] = S & 67108863;
777
795
  }
778
796
  return x;
779
797
  }
780
- function b(e, n, r, c, x, y) {
781
- for (var S = n & 32767, E = n >> 15; --y >= 0; ) {
798
+ function y(e, n, r, c, x, b) {
799
+ for (var S = n & 32767, E = n >> 15; --b >= 0; ) {
782
800
  var N = this[e] & 32767, k = this[e++] >> 15, Z = E * N + k * S;
783
801
  N = S * N + ((Z & 32767) << 15) + r[c] + (x & 1073741823), x = (N >>> 30) + (Z >>> 15) + E * k + (x >>> 30), r[c++] = N & 1073741823;
784
802
  }
785
803
  return x;
786
804
  }
787
- function m(e, n, r, c, x, y) {
788
- for (var S = n & 16383, E = n >> 14; --y >= 0; ) {
805
+ function m(e, n, r, c, x, b) {
806
+ for (var S = n & 16383, E = n >> 14; --b >= 0; ) {
789
807
  var N = this[e] & 16383, k = this[e++] >> 14, Z = E * N + k * S;
790
808
  N = S * N + ((Z & 16383) << 14) + r[c] + x, x = (N >> 28) + (Z >> 14) + E * k, r[c++] = N & 268435455;
791
809
  }
792
810
  return x;
793
811
  }
794
812
  var v = typeof navigator < "u";
795
- v && u && navigator.appName == "Microsoft Internet Explorer" ? (f.prototype.am = b, o = 30) : v && u && navigator.appName != "Netscape" ? (f.prototype.am = a, o = 26) : (f.prototype.am = m, o = 28), f.prototype.DB = o, f.prototype.DM = (1 << o) - 1, f.prototype.DV = 1 << o;
813
+ v && u && navigator.appName == "Microsoft Internet Explorer" ? (f.prototype.am = y, o = 30) : v && u && navigator.appName != "Netscape" ? (f.prototype.am = a, o = 26) : (f.prototype.am = m, o = 28), f.prototype.DB = o, f.prototype.DM = (1 << o) - 1, f.prototype.DV = 1 << o;
796
814
  var B = 52;
797
815
  f.prototype.FV = Math.pow(2, B), f.prototype.F1 = B - o, f.prototype.F2 = 2 * o - B;
798
816
  var _ = "0123456789abcdefghijklmnopqrstuvwxyz", M = new Array(), R, q;
@@ -810,14 +828,14 @@ function wt() {
810
828
  for (var n = this.t - 1; n >= 0; --n) e[n] = this[n];
811
829
  e.t = this.t, e.s = this.s;
812
830
  }
813
- function l(e) {
831
+ function d(e) {
814
832
  this.t = 1, this.s = e < 0 ? -1 : 0, e > 0 ? this[0] = e : e < -1 ? this[0] = e + this.DV : this.t = 0;
815
833
  }
816
834
  function T(e) {
817
- var n = d();
835
+ var n = h();
818
836
  return n.fromInt(e), n;
819
837
  }
820
- function h(e, n) {
838
+ function l(e, n) {
821
839
  var r;
822
840
  if (n == 16) r = 4;
823
841
  else if (n == 8) r = 3;
@@ -830,15 +848,15 @@ function wt() {
830
848
  return;
831
849
  }
832
850
  this.t = 0, this.s = 0;
833
- for (var c = e.length, x = !1, y = 0; --c >= 0; ) {
851
+ for (var c = e.length, x = !1, b = 0; --c >= 0; ) {
834
852
  var S = r == 8 ? e[c] & 255 : w(e, c);
835
853
  if (S < 0) {
836
854
  e.charAt(c) == "-" && (x = !0);
837
855
  continue;
838
856
  }
839
- x = !1, y == 0 ? this[this.t++] = S : y + r > this.DB ? (this[this.t - 1] |= (S & (1 << this.DB - y) - 1) << y, this[this.t++] = S >> this.DB - y) : this[this.t - 1] |= S << y, y += r, y >= this.DB && (y -= this.DB);
857
+ x = !1, b == 0 ? this[this.t++] = S : b + r > this.DB ? (this[this.t - 1] |= (S & (1 << this.DB - b) - 1) << b, this[this.t++] = S >> this.DB - b) : this[this.t - 1] |= S << b, b += r, b >= this.DB && (b -= this.DB);
840
858
  }
841
- r == 8 && (e[0] & 128) != 0 && (this.s = -1, y > 0 && (this[this.t - 1] |= (1 << this.DB - y) - 1 << y)), this.clamp(), x && f.ZERO.subTo(this, this);
859
+ r == 8 && (e[0] & 128) != 0 && (this.s = -1, b > 0 && (this[this.t - 1] |= (1 << this.DB - b) - 1 << b)), this.clamp(), x && f.ZERO.subTo(this, this);
842
860
  }
843
861
  function F() {
844
862
  for (var e = this.s & this.DM; this.t > 0 && this[this.t - 1] == e; ) --this.t;
@@ -852,14 +870,14 @@ function wt() {
852
870
  else if (e == 32) n = 5;
853
871
  else if (e == 4) n = 2;
854
872
  else return this.toRadix(e);
855
- var r = (1 << n) - 1, c, x = !1, y = "", S = this.t, E = this.DB - S * this.DB % n;
873
+ var r = (1 << n) - 1, c, x = !1, b = "", S = this.t, E = this.DB - S * this.DB % n;
856
874
  if (S-- > 0)
857
- for (E < this.DB && (c = this[S] >> E) > 0 && (x = !0, y = p(c)); S >= 0; )
858
- E < n ? (c = (this[S] & (1 << E) - 1) << n - E, c |= this[--S] >> (E += this.DB - n)) : (c = this[S] >> (E -= n) & r, E <= 0 && (E += this.DB, --S)), c > 0 && (x = !0), x && (y += p(c));
859
- return x ? y : "0";
875
+ for (E < this.DB && (c = this[S] >> E) > 0 && (x = !0, b = p(c)); S >= 0; )
876
+ E < n ? (c = (this[S] & (1 << E) - 1) << n - E, c |= this[--S] >> (E += this.DB - n)) : (c = this[S] >> (E -= n) & r, E <= 0 && (E += this.DB, --S)), c > 0 && (x = !0), x && (b += p(c));
877
+ return x ? b : "0";
860
878
  }
861
879
  function O() {
862
- var e = d();
880
+ var e = h();
863
881
  return f.ZERO.subTo(this, e), e;
864
882
  }
865
883
  function C() {
@@ -891,11 +909,11 @@ function wt() {
891
909
  n.t = Math.max(this.t - e, 0), n.s = this.s;
892
910
  }
893
911
  function $(e, n) {
894
- var r = e % this.DB, c = this.DB - r, x = (1 << c) - 1, y = Math.floor(e / this.DB), S = this.s << r & this.DM, E;
912
+ var r = e % this.DB, c = this.DB - r, x = (1 << c) - 1, b = Math.floor(e / this.DB), S = this.s << r & this.DM, E;
895
913
  for (E = this.t - 1; E >= 0; --E)
896
- n[E + y + 1] = this[E] >> c | S, S = (this[E] & x) << r;
897
- for (E = y - 1; E >= 0; --E) n[E] = 0;
898
- n[y] = S, n.t = this.t + y + 1, n.s = this.s, n.clamp();
914
+ n[E + b + 1] = this[E] >> c | S, S = (this[E] & x) << r;
915
+ for (E = b - 1; E >= 0; --E) n[E] = 0;
916
+ n[b] = S, n.t = this.t + b + 1, n.s = this.s, n.clamp();
899
917
  }
900
918
  function K(e, n) {
901
919
  n.s = this.s;
@@ -904,11 +922,11 @@ function wt() {
904
922
  n.t = 0;
905
923
  return;
906
924
  }
907
- var c = e % this.DB, x = this.DB - c, y = (1 << c) - 1;
925
+ var c = e % this.DB, x = this.DB - c, b = (1 << c) - 1;
908
926
  n[0] = this[r] >> c;
909
927
  for (var S = r + 1; S < this.t; ++S)
910
- n[S - r - 1] |= (this[S] & y) << x, n[S - r] = this[S] >> c;
911
- c > 0 && (n[this.t - r - 1] |= (this.s & y) << x), n.t = this.t - r, n.clamp();
928
+ n[S - r - 1] |= (this[S] & b) << x, n[S - r] = this[S] >> c;
929
+ c > 0 && (n[this.t - r - 1] |= (this.s & b) << x), n.t = this.t - r, n.clamp();
912
930
  }
913
931
  function G(e, n) {
914
932
  for (var r = 0, c = 0, x = Math.min(e.t, this.t); r < x; )
@@ -946,24 +964,24 @@ function wt() {
946
964
  n != null && n.fromInt(0), r != null && this.copyTo(r);
947
965
  return;
948
966
  }
949
- r == null && (r = d());
950
- var y = d(), S = this.s, E = e.s, N = this.DB - D(c[c.t - 1]);
951
- N > 0 ? (c.lShiftTo(N, y), x.lShiftTo(N, r)) : (c.copyTo(y), x.copyTo(r));
952
- var k = y.t, Z = y[k - 1];
967
+ r == null && (r = h());
968
+ var b = h(), S = this.s, E = e.s, N = this.DB - D(c[c.t - 1]);
969
+ N > 0 ? (c.lShiftTo(N, b), x.lShiftTo(N, r)) : (c.copyTo(b), x.copyTo(r));
970
+ var k = b.t, Z = b[k - 1];
953
971
  if (Z != 0) {
954
- var U = Z * (1 << this.F1) + (k > 1 ? y[k - 2] >> this.F2 : 0), Q = this.FV / U, dt = (1 << this.F1) / U, J = 1 << this.F2, X = r.t, pt = X - k, tt = n ?? d();
955
- for (y.dlShiftTo(pt, tt), r.compareTo(tt) >= 0 && (r[r.t++] = 1, r.subTo(tt, r)), f.ONE.dlShiftTo(k, tt), tt.subTo(y, y); y.t < k; ) y[y.t++] = 0;
972
+ var U = Z * (1 << this.F1) + (k > 1 ? b[k - 2] >> this.F2 : 0), Q = this.FV / U, dt = (1 << this.F1) / U, J = 1 << this.F2, X = r.t, pt = X - k, tt = n ?? h();
973
+ for (b.dlShiftTo(pt, tt), r.compareTo(tt) >= 0 && (r[r.t++] = 1, r.subTo(tt, r)), f.ONE.dlShiftTo(k, tt), tt.subTo(b, b); b.t < k; ) b[b.t++] = 0;
956
974
  for (; --pt >= 0; ) {
957
975
  var Et = r[--X] == Z ? this.DM : Math.floor(r[X] * Q + (r[X - 1] + J) * dt);
958
- if ((r[X] += y.am(0, Et, r, pt, 0, k)) < Et)
959
- for (y.dlShiftTo(pt, tt), r.subTo(tt, r); r[X] < --Et; ) r.subTo(tt, r);
976
+ if ((r[X] += b.am(0, Et, r, pt, 0, k)) < Et)
977
+ for (b.dlShiftTo(pt, tt), r.subTo(tt, r); r[X] < --Et; ) r.subTo(tt, r);
960
978
  }
961
979
  n != null && (r.drShiftTo(k, n), S != E && f.ZERO.subTo(n, n)), r.t = k, r.clamp(), N > 0 && r.rShiftTo(N, r), S < 0 && f.ZERO.subTo(r, r);
962
980
  }
963
981
  }
964
982
  }
965
983
  function ht(e) {
966
- var n = d();
984
+ var n = h();
967
985
  return this.abs().divRemTo(e, null, n), this.s < 0 && n.compareTo(f.ZERO) > 0 && e.subTo(n, n), n;
968
986
  }
969
987
  function I(e) {
@@ -996,11 +1014,11 @@ function wt() {
996
1014
  this.m = e, this.mp = e.invDigit(), this.mpl = this.mp & 32767, this.mph = this.mp >> 15, this.um = (1 << e.DB - 15) - 1, this.mt2 = 2 * e.t;
997
1015
  }
998
1016
  function Be(e) {
999
- var n = d();
1017
+ var n = h();
1000
1018
  return e.abs().dlShiftTo(this.m.t, n), n.divRemTo(this.m, null, n), e.s < 0 && n.compareTo(f.ZERO) > 0 && this.m.subTo(n, n), n;
1001
1019
  }
1002
1020
  function _e(e) {
1003
- var n = d();
1021
+ var n = h();
1004
1022
  return e.copyTo(n), this.reduce(n), n;
1005
1023
  }
1006
1024
  function Re(e) {
@@ -1025,9 +1043,9 @@ function wt() {
1025
1043
  }
1026
1044
  function Me(e, n) {
1027
1045
  if (e > 4294967295 || e < 1) return f.ONE;
1028
- var r = d(), c = d(), x = n.convert(this), y = D(e) - 1;
1029
- for (x.copyTo(r); --y >= 0; )
1030
- if (n.sqrTo(r, c), (e & 1 << y) > 0) n.mulTo(c, x, r);
1046
+ var r = h(), c = h(), x = n.convert(this), b = D(e) - 1;
1047
+ for (x.copyTo(r); --b >= 0; )
1048
+ if (n.sqrTo(r, c), (e & 1 << b) > 0) n.mulTo(c, x, r);
1031
1049
  else {
1032
1050
  var S = r;
1033
1051
  r = c, c = S;
@@ -1038,9 +1056,9 @@ function wt() {
1038
1056
  var r;
1039
1057
  return e < 256 || n.isEven() ? r = new I(n) : r = new nt(n), this.exp(e, r);
1040
1058
  }
1041
- f.prototype.copyTo = g, f.prototype.fromInt = l, f.prototype.fromString = h, f.prototype.clamp = F, f.prototype.dlShiftTo = z, f.prototype.drShiftTo = H, f.prototype.lShiftTo = $, f.prototype.rShiftTo = K, f.prototype.subTo = G, f.prototype.multiplyTo = ot, f.prototype.squareTo = ut, f.prototype.divRemTo = at, f.prototype.invDigit = Ee, f.prototype.isEven = Ie, f.prototype.exp = Me, f.prototype.toString = A, f.prototype.negate = O, f.prototype.abs = C, f.prototype.compareTo = L, f.prototype.bitLength = P, f.prototype.mod = ht, f.prototype.modPowInt = Oe, f.ZERO = T(0), f.ONE = T(1);
1059
+ f.prototype.copyTo = g, f.prototype.fromInt = d, f.prototype.fromString = l, f.prototype.clamp = F, f.prototype.dlShiftTo = z, f.prototype.drShiftTo = H, f.prototype.lShiftTo = $, f.prototype.rShiftTo = K, f.prototype.subTo = G, f.prototype.multiplyTo = ot, f.prototype.squareTo = ut, f.prototype.divRemTo = at, f.prototype.invDigit = Ee, f.prototype.isEven = Ie, f.prototype.exp = Me, f.prototype.toString = A, f.prototype.negate = O, f.prototype.abs = C, f.prototype.compareTo = L, f.prototype.bitLength = P, f.prototype.mod = ht, f.prototype.modPowInt = Oe, f.ZERO = T(0), f.ONE = T(1);
1042
1060
  function qe() {
1043
- var e = d();
1061
+ var e = h();
1044
1062
  return this.copyTo(e), e;
1045
1063
  }
1046
1064
  function Ce() {
@@ -1067,22 +1085,22 @@ function wt() {
1067
1085
  }
1068
1086
  function Ne(e) {
1069
1087
  if (e == null && (e = 10), this.signum() == 0 || e < 2 || e > 36) return "0";
1070
- var n = this.chunkSize(e), r = Math.pow(e, n), c = T(r), x = d(), y = d(), S = "";
1071
- for (this.divRemTo(c, x, y); x.signum() > 0; )
1072
- S = (r + y.intValue()).toString(e).substr(1) + S, x.divRemTo(c, x, y);
1073
- return y.intValue().toString(e) + S;
1088
+ var n = this.chunkSize(e), r = Math.pow(e, n), c = T(r), x = h(), b = h(), S = "";
1089
+ for (this.divRemTo(c, x, b); x.signum() > 0; )
1090
+ S = (r + b.intValue()).toString(e).substr(1) + S, x.divRemTo(c, x, b);
1091
+ return b.intValue().toString(e) + S;
1074
1092
  }
1075
1093
  function Ye(e, n) {
1076
1094
  this.fromInt(0), n == null && (n = 10);
1077
- for (var r = this.chunkSize(n), c = Math.pow(n, r), x = !1, y = 0, S = 0, E = 0; E < e.length; ++E) {
1095
+ for (var r = this.chunkSize(n), c = Math.pow(n, r), x = !1, b = 0, S = 0, E = 0; E < e.length; ++E) {
1078
1096
  var N = w(e, E);
1079
1097
  if (N < 0) {
1080
1098
  e.charAt(E) == "-" && this.signum() == 0 && (x = !0);
1081
1099
  continue;
1082
1100
  }
1083
- S = n * S + N, ++y >= r && (this.dMultiply(c), this.dAddOffset(S, 0), y = 0, S = 0);
1101
+ S = n * S + N, ++b >= r && (this.dMultiply(c), this.dAddOffset(S, 0), b = 0, S = 0);
1084
1102
  }
1085
- y > 0 && (this.dMultiply(Math.pow(n, y)), this.dAddOffset(S, 0)), x && f.ZERO.subTo(this, this);
1103
+ b > 0 && (this.dMultiply(Math.pow(n, b)), this.dAddOffset(S, 0)), x && f.ZERO.subTo(this, this);
1086
1104
  }
1087
1105
  function ke(e, n, r) {
1088
1106
  if (typeof n == "number")
@@ -1114,13 +1132,13 @@ function wt() {
1114
1132
  return this.compareTo(e) > 0 ? this : e;
1115
1133
  }
1116
1134
  function Ze(e, n, r) {
1117
- var c, x, y = Math.min(e.t, this.t);
1118
- for (c = 0; c < y; ++c) r[c] = n(this[c], e[c]);
1135
+ var c, x, b = Math.min(e.t, this.t);
1136
+ for (c = 0; c < b; ++c) r[c] = n(this[c], e[c]);
1119
1137
  if (e.t < this.t) {
1120
- for (x = e.s & this.DM, c = y; c < this.t; ++c) r[c] = n(this[c], x);
1138
+ for (x = e.s & this.DM, c = b; c < this.t; ++c) r[c] = n(this[c], x);
1121
1139
  r.t = this.t;
1122
1140
  } else {
1123
- for (x = this.s & this.DM, c = y; c < e.t; ++c) r[c] = n(x, e[c]);
1141
+ for (x = this.s & this.DM, c = b; c < e.t; ++c) r[c] = n(x, e[c]);
1124
1142
  r.t = e.t;
1125
1143
  }
1126
1144
  r.s = n(this.s, e.s), r.clamp();
@@ -1129,40 +1147,40 @@ function wt() {
1129
1147
  return e & n;
1130
1148
  }
1131
1149
  function We(e) {
1132
- var n = d();
1150
+ var n = h();
1133
1151
  return this.bitwiseTo(e, Ge, n), n;
1134
1152
  }
1135
1153
  function Tt(e, n) {
1136
1154
  return e | n;
1137
1155
  }
1138
1156
  function Je(e) {
1139
- var n = d();
1157
+ var n = h();
1140
1158
  return this.bitwiseTo(e, Tt, n), n;
1141
1159
  }
1142
1160
  function Lt(e, n) {
1143
1161
  return e ^ n;
1144
1162
  }
1145
1163
  function Xe(e) {
1146
- var n = d();
1164
+ var n = h();
1147
1165
  return this.bitwiseTo(e, Lt, n), n;
1148
1166
  }
1149
1167
  function Ht(e, n) {
1150
1168
  return e & ~n;
1151
1169
  }
1152
1170
  function Ke(e) {
1153
- var n = d();
1171
+ var n = h();
1154
1172
  return this.bitwiseTo(e, Ht, n), n;
1155
1173
  }
1156
1174
  function Qe() {
1157
- for (var e = d(), n = 0; n < this.t; ++n) e[n] = this.DM & ~this[n];
1175
+ for (var e = h(), n = 0; n < this.t; ++n) e[n] = this.DM & ~this[n];
1158
1176
  return e.t = this.t, e.s = ~this.s, e;
1159
1177
  }
1160
1178
  function tn(e) {
1161
- var n = d();
1179
+ var n = h();
1162
1180
  return e < 0 ? this.rShiftTo(-e, n) : this.lShiftTo(e, n), n;
1163
1181
  }
1164
1182
  function en(e) {
1165
- var n = d();
1183
+ var n = h();
1166
1184
  return e < 0 ? this.lShiftTo(-e, n) : this.rShiftTo(e, n), n;
1167
1185
  }
1168
1186
  function nn(e) {
@@ -1216,31 +1234,31 @@ function wt() {
1216
1234
  n.s = c < 0 ? -1 : 0, c > 0 ? n[r++] = c : c < -1 && (n[r++] = this.DV + c), n.t = r, n.clamp();
1217
1235
  }
1218
1236
  function dn(e) {
1219
- var n = d();
1237
+ var n = h();
1220
1238
  return this.addTo(e, n), n;
1221
1239
  }
1222
1240
  function pn(e) {
1223
- var n = d();
1241
+ var n = h();
1224
1242
  return this.subTo(e, n), n;
1225
1243
  }
1226
1244
  function gn(e) {
1227
- var n = d();
1245
+ var n = h();
1228
1246
  return this.multiplyTo(e, n), n;
1229
1247
  }
1230
1248
  function xn() {
1231
- var e = d();
1249
+ var e = h();
1232
1250
  return this.squareTo(e), e;
1233
1251
  }
1234
1252
  function mn(e) {
1235
- var n = d();
1253
+ var n = h();
1236
1254
  return this.divRemTo(e, n, null), n;
1237
1255
  }
1238
1256
  function vn(e) {
1239
- var n = d();
1257
+ var n = h();
1240
1258
  return this.divRemTo(e, null, n), n;
1241
1259
  }
1242
1260
  function yn(e) {
1243
- var n = d(), r = d();
1261
+ var n = h(), r = h();
1244
1262
  return this.divRemTo(e, n, r), new Array(n, r);
1245
1263
  }
1246
1264
  function bn(e) {
@@ -1285,12 +1303,12 @@ function wt() {
1285
1303
  r.clamp(), r.drShiftTo(1, r);
1286
1304
  }
1287
1305
  function rt(e) {
1288
- this.r2 = d(), this.q3 = d(), f.ONE.dlShiftTo(2 * e.t, this.r2), this.mu = this.r2.divide(e), this.m = e;
1306
+ this.r2 = h(), this.q3 = h(), f.ONE.dlShiftTo(2 * e.t, this.r2), this.mu = this.r2.divide(e), this.m = e;
1289
1307
  }
1290
1308
  function _n(e) {
1291
1309
  if (e.s < 0 || e.t > 2 * this.m.t) return e.mod(this.m);
1292
1310
  if (e.compareTo(this.m) < 0) return e;
1293
- var n = d();
1311
+ var n = h();
1294
1312
  return e.copyTo(n), this.reduce(n), n;
1295
1313
  }
1296
1314
  function Rn(e) {
@@ -1308,16 +1326,16 @@ function wt() {
1308
1326
  }
1309
1327
  rt.prototype.convert = _n, rt.prototype.revert = Rn, rt.prototype.reduce = Dn, rt.prototype.mulTo = In, rt.prototype.sqrTo = An;
1310
1328
  function Mn(e, n) {
1311
- var r = e.bitLength(), c, x = T(1), y;
1329
+ var r = e.bitLength(), c, x = T(1), b;
1312
1330
  if (r <= 0) return x;
1313
- r < 18 ? c = 1 : r < 48 ? c = 3 : r < 144 ? c = 4 : r < 768 ? c = 5 : c = 6, r < 8 ? y = new I(n) : n.isEven() ? y = new rt(n) : y = new nt(n);
1331
+ r < 18 ? c = 1 : r < 48 ? c = 3 : r < 144 ? c = 4 : r < 768 ? c = 5 : c = 6, r < 8 ? b = new I(n) : n.isEven() ? b = new rt(n) : b = new nt(n);
1314
1332
  var S = new Array(), E = 3, N = c - 1, k = (1 << c) - 1;
1315
- if (S[1] = y.convert(this), c > 1) {
1316
- var Z = d();
1317
- for (y.sqrTo(S[1], Z); E <= k; )
1318
- S[E] = d(), y.mulTo(Z, S[E - 2], S[E]), E += 2;
1333
+ if (S[1] = b.convert(this), c > 1) {
1334
+ var Z = h();
1335
+ for (b.sqrTo(S[1], Z); E <= k; )
1336
+ S[E] = h(), b.mulTo(Z, S[E - 2], S[E]), E += 2;
1319
1337
  }
1320
- var U = e.t - 1, Q, dt = !0, J = d(), X;
1338
+ var U = e.t - 1, Q, dt = !0, J = h(), X;
1321
1339
  for (r = D(e[U]) - 1; U >= 0; ) {
1322
1340
  for (r >= N ? Q = e[U] >> r - N & k : (Q = (e[U] & (1 << r + 1) - 1) << N - r, U > 0 && (Q |= e[U - 1] >> this.DB + r - N)), E = c; (Q & 1) == 0; )
1323
1341
  Q >>= 1, --E;
@@ -1325,13 +1343,13 @@ function wt() {
1325
1343
  S[Q].copyTo(x), dt = !1;
1326
1344
  else {
1327
1345
  for (; E > 1; )
1328
- y.sqrTo(x, J), y.sqrTo(J, x), E -= 2;
1329
- E > 0 ? y.sqrTo(x, J) : (X = x, x = J, J = X), y.mulTo(J, S[Q], x);
1346
+ b.sqrTo(x, J), b.sqrTo(J, x), E -= 2;
1347
+ E > 0 ? b.sqrTo(x, J) : (X = x, x = J, J = X), b.mulTo(J, S[Q], x);
1330
1348
  }
1331
1349
  for (; U >= 0 && (e[U] & 1 << r) == 0; )
1332
- y.sqrTo(x, J), X = x, x = J, J = X, --r < 0 && (r = this.DB - 1, --U);
1350
+ b.sqrTo(x, J), X = x, x = J, J = X, --r < 0 && (r = this.DB - 1, --U);
1333
1351
  }
1334
- return y.revert(x);
1352
+ return b.revert(x);
1335
1353
  }
1336
1354
  function On(e) {
1337
1355
  var n = this.s < 0 ? this.negate() : this.clone(), r = e.s < 0 ? e.negate() : e.clone();
@@ -1339,11 +1357,11 @@ function wt() {
1339
1357
  var c = n;
1340
1358
  n = r, r = c;
1341
1359
  }
1342
- var x = n.getLowestSetBit(), y = r.getLowestSetBit();
1343
- if (y < 0) return n;
1344
- for (x < y && (y = x), y > 0 && (n.rShiftTo(y, n), r.rShiftTo(y, r)); n.signum() > 0; )
1360
+ var x = n.getLowestSetBit(), b = r.getLowestSetBit();
1361
+ if (b < 0) return n;
1362
+ for (x < b && (b = x), b > 0 && (n.rShiftTo(b, n), r.rShiftTo(b, r)); n.signum() > 0; )
1345
1363
  (x = n.getLowestSetBit()) > 0 && n.rShiftTo(x, n), (x = r.getLowestSetBit()) > 0 && r.rShiftTo(x, r), n.compareTo(r) >= 0 ? (n.subTo(r, n), n.rShiftTo(1, n)) : (r.subTo(n, r), r.rShiftTo(1, r));
1346
- return y > 0 && r.lShiftTo(y, r), r;
1364
+ return b > 0 && r.lShiftTo(b, r), r;
1347
1365
  }
1348
1366
  function qn(e) {
1349
1367
  if (e <= 0) return 0;
@@ -1356,12 +1374,12 @@ function wt() {
1356
1374
  function Cn(e) {
1357
1375
  var n = e.isEven();
1358
1376
  if (this.isEven() && n || e.signum() == 0) return f.ZERO;
1359
- for (var r = e.clone(), c = this.clone(), x = T(1), y = T(0), S = T(0), E = T(1); r.signum() != 0; ) {
1377
+ for (var r = e.clone(), c = this.clone(), x = T(1), b = T(0), S = T(0), E = T(1); r.signum() != 0; ) {
1360
1378
  for (; r.isEven(); )
1361
- r.rShiftTo(1, r), n ? ((!x.isEven() || !y.isEven()) && (x.addTo(this, x), y.subTo(e, y)), x.rShiftTo(1, x)) : y.isEven() || y.subTo(e, y), y.rShiftTo(1, y);
1379
+ r.rShiftTo(1, r), n ? ((!x.isEven() || !b.isEven()) && (x.addTo(this, x), b.subTo(e, b)), x.rShiftTo(1, x)) : b.isEven() || b.subTo(e, b), b.rShiftTo(1, b);
1362
1380
  for (; c.isEven(); )
1363
1381
  c.rShiftTo(1, c), n ? ((!S.isEven() || !E.isEven()) && (S.addTo(this, S), E.subTo(e, E)), S.rShiftTo(1, S)) : E.isEven() || E.subTo(e, E), E.rShiftTo(1, E);
1364
- r.compareTo(c) >= 0 ? (r.subTo(c, r), n && x.subTo(S, x), y.subTo(E, y)) : (c.subTo(r, c), n && S.subTo(x, S), E.subTo(y, E));
1382
+ r.compareTo(c) >= 0 ? (r.subTo(c, r), n && x.subTo(S, x), b.subTo(E, b)) : (c.subTo(r, c), n && S.subTo(x, S), E.subTo(b, E));
1365
1383
  }
1366
1384
  if (c.compareTo(f.ONE) != 0) return f.ZERO;
1367
1385
  if (E.compareTo(e) >= 0) return E.subtract(e);
@@ -1389,7 +1407,7 @@ function wt() {
1389
1407
  if (r <= 0) return !1;
1390
1408
  var c = n.shiftRight(r);
1391
1409
  e = e + 1 >> 1, e > V.length && (e = V.length);
1392
- for (var x = d(), y = 0; y < e; ++y) {
1410
+ for (var x = h(), b = 0; b < e; ++b) {
1393
1411
  x.fromInt(V[Math.floor(Math.random() * V.length)]);
1394
1412
  var S = x.modPow(c, this);
1395
1413
  if (S.compareTo(f.ONE) != 0 && S.compareTo(n) != 0) {
@@ -1466,16 +1484,16 @@ function wt() {
1466
1484
  BigInteger: f,
1467
1485
  SecureRandom: $t
1468
1486
  };
1469
- }).call(ni);
1487
+ }).call(ri);
1470
1488
  }(xt)), xt.exports;
1471
1489
  }
1472
1490
  var Bt, Gt;
1473
- function ri() {
1491
+ function ii() {
1474
1492
  if (Gt) return Bt;
1475
1493
  Gt = 1;
1476
1494
  const { BigInteger: t } = wt();
1477
- function i(b) {
1478
- let m = b.toString(16);
1495
+ function i(y) {
1496
+ let m = y.toString(16);
1479
1497
  if (m[0] !== "-")
1480
1498
  m.length % 2 === 1 ? m = "0" + m : m.match(/^[0-7]/) || (m = "00" + m);
1481
1499
  else {
@@ -1484,7 +1502,7 @@ function ri() {
1484
1502
  v % 2 === 1 ? v += 1 : m.match(/^[0-7]/) || (v += 2);
1485
1503
  let B = "";
1486
1504
  for (let _ = 0; _ < v; _++) B += "f";
1487
- B = new t(B, 16), m = B.xor(b).add(t.ONE), m = m.toString(16).replace(/^-/, "");
1505
+ B = new t(B, 16), m = B.xor(y).add(t.ONE), m = m.toString(16).replace(/^-/, "");
1488
1506
  }
1489
1507
  return m;
1490
1508
  }
@@ -1523,42 +1541,42 @@ function ri() {
1523
1541
  return this.v = this.asn1Array.map((m) => m.getEncodedHex()).join(""), this.v;
1524
1542
  }
1525
1543
  }
1526
- function f(b, m) {
1527
- return +b[m + 2] < 8 ? 1 : +b.substr(m + 2, 2) & 128;
1544
+ function f(y, m) {
1545
+ return +y[m + 2] < 8 ? 1 : +y.substr(m + 2, 2) & 128;
1528
1546
  }
1529
- function d(b, m) {
1530
- const v = f(b, m), B = b.substr(m + 2, v * 2);
1547
+ function h(y, m) {
1548
+ const v = f(y, m), B = y.substr(m + 2, v * 2);
1531
1549
  return B ? (+B[0] < 8 ? new t(B, 16) : new t(B.substr(2), 16)).intValue() : -1;
1532
1550
  }
1533
- function a(b, m) {
1534
- const v = f(b, m);
1551
+ function a(y, m) {
1552
+ const v = f(y, m);
1535
1553
  return m + (v + 1) * 2;
1536
1554
  }
1537
1555
  return Bt = {
1538
1556
  /**
1539
1557
  * ASN.1 der 编码,针对 sm2 签名
1540
1558
  */
1541
- encodeDer(b, m) {
1542
- const v = new s(b), B = new s(m);
1559
+ encodeDer(y, m) {
1560
+ const v = new s(y), B = new s(m);
1543
1561
  return new u([v, B]).getEncodedHex();
1544
1562
  },
1545
1563
  /**
1546
1564
  * 解析 ASN.1 der,针对 sm2 验签
1547
1565
  */
1548
- decodeDer(b) {
1549
- const m = a(b, 0), v = a(b, m), B = d(b, m), _ = b.substr(v, B * 2), M = v + _.length, R = a(b, M), q = d(b, M), p = b.substr(R, q * 2), w = new t(_, 16), g = new t(p, 16);
1566
+ decodeDer(y) {
1567
+ const m = a(y, 0), v = a(y, m), B = h(y, m), _ = y.substr(v, B * 2), M = v + _.length, R = a(y, M), q = h(y, M), p = y.substr(R, q * 2), w = new t(_, 16), g = new t(p, 16);
1550
1568
  return { r: w, s: g };
1551
1569
  }
1552
1570
  }, Bt;
1553
1571
  }
1554
1572
  var _t, Wt;
1555
- function ii() {
1573
+ function oi() {
1556
1574
  if (Wt) return _t;
1557
1575
  Wt = 1;
1558
1576
  const { BigInteger: t } = wt(), i = new t("2"), o = new t("3");
1559
1577
  class s {
1560
- constructor(a, b) {
1561
- this.x = b, this.q = a;
1578
+ constructor(a, y) {
1579
+ this.x = y, this.q = a;
1562
1580
  }
1563
1581
  /**
1564
1582
  * 判断相等
@@ -1610,8 +1628,8 @@ function ii() {
1610
1628
  }
1611
1629
  }
1612
1630
  class u {
1613
- constructor(a, b, m, v) {
1614
- this.curve = a, this.x = b, this.y = m, this.z = v ?? t.ONE, this.zinv = null;
1631
+ constructor(a, y, m, v) {
1632
+ this.curve = a, this.x = y, this.y = m, this.z = v ?? t.ONE, this.zinv = null;
1615
1633
  }
1616
1634
  getX() {
1617
1635
  return this.zinv === null && (this.zinv = this.z.modInverse(this.curve.q)), this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
@@ -1660,10 +1678,10 @@ function ii() {
1660
1678
  add(a) {
1661
1679
  if (this.isInfinity()) return a;
1662
1680
  if (a.isInfinity()) return this;
1663
- const b = this.x.toBigInteger(), m = this.y.toBigInteger(), v = this.z, B = a.x.toBigInteger(), _ = a.y.toBigInteger(), M = a.z, R = this.curve.q, q = b.multiply(M).mod(R), p = B.multiply(v).mod(R), w = q.subtract(p), g = m.multiply(M).mod(R), l = _.multiply(v).mod(R), T = g.subtract(l);
1681
+ const y = this.x.toBigInteger(), m = this.y.toBigInteger(), v = this.z, B = a.x.toBigInteger(), _ = a.y.toBigInteger(), M = a.z, R = this.curve.q, q = y.multiply(M).mod(R), p = B.multiply(v).mod(R), w = q.subtract(p), g = m.multiply(M).mod(R), d = _.multiply(v).mod(R), T = g.subtract(d);
1664
1682
  if (t.ZERO.equals(w))
1665
1683
  return t.ZERO.equals(T) ? this.twice() : this.curve.infinity;
1666
- const h = q.add(p), F = v.multiply(M).mod(R), A = w.square().mod(R), O = w.multiply(A).mod(R), C = F.multiply(T.square()).subtract(h.multiply(A)).mod(R), L = w.multiply(C).mod(R), D = T.multiply(A.multiply(q).subtract(C)).subtract(g.multiply(O)).mod(R), P = O.multiply(F).mod(R);
1684
+ const l = q.add(p), F = v.multiply(M).mod(R), A = w.square().mod(R), O = w.multiply(A).mod(R), C = F.multiply(T.square()).subtract(l.multiply(A)).mod(R), L = w.multiply(C).mod(R), D = T.multiply(A.multiply(q).subtract(C)).subtract(g.multiply(O)).mod(R), P = O.multiply(F).mod(R);
1667
1685
  return new u(this.curve, this.curve.fromBigInteger(L), this.curve.fromBigInteger(D), P);
1668
1686
  }
1669
1687
  /**
@@ -1684,8 +1702,8 @@ function ii() {
1684
1702
  twice() {
1685
1703
  if (this.isInfinity()) return this;
1686
1704
  if (!this.y.toBigInteger().signum()) return this.curve.infinity;
1687
- const a = this.x.toBigInteger(), b = this.y.toBigInteger(), m = this.z, v = this.curve.q, B = this.curve.a.toBigInteger(), _ = a.square().multiply(o).add(B.multiply(m.square())).mod(v), M = b.shiftLeft(1).multiply(m).mod(v), R = b.square().mod(v), q = R.multiply(a).multiply(m).mod(v), p = M.square().mod(v), w = _.square().subtract(q.shiftLeft(3)).mod(v), g = M.multiply(w).mod(v), l = _.multiply(q.shiftLeft(2).subtract(w)).subtract(p.shiftLeft(1).multiply(R)).mod(v), T = M.multiply(p).mod(v);
1688
- return new u(this.curve, this.curve.fromBigInteger(g), this.curve.fromBigInteger(l), T);
1705
+ const a = this.x.toBigInteger(), y = this.y.toBigInteger(), m = this.z, v = this.curve.q, B = this.curve.a.toBigInteger(), _ = a.square().multiply(o).add(B.multiply(m.square())).mod(v), M = y.shiftLeft(1).multiply(m).mod(v), R = y.square().mod(v), q = R.multiply(a).multiply(m).mod(v), p = M.square().mod(v), w = _.square().subtract(q.shiftLeft(3)).mod(v), g = M.multiply(w).mod(v), d = _.multiply(q.shiftLeft(2).subtract(w)).subtract(p.shiftLeft(1).multiply(R)).mod(v), T = M.multiply(p).mod(v);
1706
+ return new u(this.curve, this.curve.fromBigInteger(g), this.curve.fromBigInteger(d), T);
1689
1707
  }
1690
1708
  /**
1691
1709
  * 倍点计算
@@ -1693,19 +1711,19 @@ function ii() {
1693
1711
  multiply(a) {
1694
1712
  if (this.isInfinity()) return this;
1695
1713
  if (!a.signum()) return this.curve.infinity;
1696
- const b = a.multiply(o), m = this.negate();
1714
+ const y = a.multiply(o), m = this.negate();
1697
1715
  let v = this;
1698
- for (let B = b.bitLength() - 2; B > 0; B--) {
1716
+ for (let B = y.bitLength() - 2; B > 0; B--) {
1699
1717
  v = v.twice();
1700
- const _ = b.testBit(B), M = a.testBit(B);
1718
+ const _ = y.testBit(B), M = a.testBit(B);
1701
1719
  _ !== M && (v = v.add(_ ? this : m));
1702
1720
  }
1703
1721
  return v;
1704
1722
  }
1705
1723
  }
1706
1724
  class f {
1707
- constructor(a, b, m) {
1708
- this.q = a, this.a = this.fromBigInteger(b), this.b = this.fromBigInteger(m), this.infinity = new u(this, null, null);
1725
+ constructor(a, y, m) {
1726
+ this.q = a, this.a = this.fromBigInteger(y), this.b = this.fromBigInteger(m), this.infinity = new u(this, null, null);
1709
1727
  }
1710
1728
  /**
1711
1729
  * 判断两个椭圆曲线是否相等
@@ -1729,14 +1747,14 @@ function ii() {
1729
1747
  return this.infinity;
1730
1748
  case 2:
1731
1749
  case 3:
1732
- const b = this.fromBigInteger(new t(a.substr(2), 16));
1733
- let m = this.fromBigInteger(b.multiply(b.square()).add(
1734
- b.multiply(this.a)
1750
+ const y = this.fromBigInteger(new t(a.substr(2), 16));
1751
+ let m = this.fromBigInteger(y.multiply(y.square()).add(
1752
+ y.multiply(this.a)
1735
1753
  ).add(this.b).toBigInteger().modPow(
1736
1754
  this.q.divide(new t("4")).add(t.ONE),
1737
1755
  this.q
1738
1756
  ));
1739
- return m.toBigInteger().mod(i).equals(new t(a.substr(0, 2), 16).subtract(i)) || (m = m.negate()), new u(this, b, m);
1757
+ return m.toBigInteger().mod(i).equals(new t(a.substr(0, 2), 16).subtract(i)) || (m = m.negate()), new u(this, y, m);
1740
1758
  case 4:
1741
1759
  case 6:
1742
1760
  case 7:
@@ -1753,84 +1771,84 @@ function ii() {
1753
1771
  }, _t;
1754
1772
  }
1755
1773
  var Rt, Jt;
1756
- function oi() {
1774
+ function si() {
1757
1775
  if (Jt) return Rt;
1758
1776
  Jt = 1;
1759
- const { BigInteger: t, SecureRandom: i } = wt(), { ECCurveFp: o } = ii(), s = new i(), { curve: u, G: f, n: d } = b();
1777
+ const { BigInteger: t, SecureRandom: i } = wt(), { ECCurveFp: o } = oi(), s = new i(), { curve: u, G: f, n: h } = y();
1760
1778
  function a() {
1761
1779
  return u;
1762
1780
  }
1763
- function b() {
1764
- const g = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), l = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), T = new t("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), h = new o(g, l, T), O = h.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), C = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
1765
- return { curve: h, G: O, n: C };
1781
+ function y() {
1782
+ const g = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFF", 16), d = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFC", 16), T = new t("28E9FA9E9D9F5E344D5A9E4BCF6509A7F39789F515AB8F92DDBCBD414D940E93", 16), l = new o(g, d, T), O = l.decodePointHex("04" + "32C4AE2C1F1981195F9904466A39C9948FE30BBFF2660BE1715A4589334C74C7" + "BC3736A2F4F6779C59BDCEE36B692153D0A9877CC62A474002DF32E52139F0A0"), C = new t("FFFFFFFEFFFFFFFFFFFFFFFFFFFFFFFF7203DF6B21C6052B53BBF40939D54123", 16);
1783
+ return { curve: l, G: O, n: C };
1766
1784
  }
1767
- function m(g, l, T) {
1768
- const F = (g ? new t(g, l, T) : new t(d.bitLength(), s)).mod(d.subtract(t.ONE)).add(t.ONE), A = _(F.toString(16), 64), O = f.multiply(F), C = _(O.getX().toBigInteger().toString(16), 64), L = _(O.getY().toBigInteger().toString(16), 64), D = "04" + C + L;
1785
+ function m(g, d, T) {
1786
+ const F = (g ? new t(g, d, T) : new t(h.bitLength(), s)).mod(h.subtract(t.ONE)).add(t.ONE), A = _(F.toString(16), 64), O = f.multiply(F), C = _(O.getX().toBigInteger().toString(16), 64), L = _(O.getY().toBigInteger().toString(16), 64), D = "04" + C + L;
1769
1787
  return { privateKey: A, publicKey: D };
1770
1788
  }
1771
1789
  function v(g) {
1772
1790
  if (g.length !== 130) throw new Error("Invalid public key to compress");
1773
- const l = (g.length - 2) / 2, T = g.substr(2, l), h = new t(g.substr(l + 2, l), 16);
1791
+ const d = (g.length - 2) / 2, T = g.substr(2, d), l = new t(g.substr(d + 2, d), 16);
1774
1792
  let F = "03";
1775
- return h.mod(new t("2")).equals(t.ZERO) && (F = "02"), F + T;
1793
+ return l.mod(new t("2")).equals(t.ZERO) && (F = "02"), F + T;
1776
1794
  }
1777
1795
  function B(g) {
1778
1796
  g = unescape(encodeURIComponent(g));
1779
- const l = g.length, T = [];
1780
- for (let F = 0; F < l; F++)
1797
+ const d = g.length, T = [];
1798
+ for (let F = 0; F < d; F++)
1781
1799
  T[F >>> 2] |= (g.charCodeAt(F) & 255) << 24 - F % 4 * 8;
1782
- const h = [];
1783
- for (let F = 0; F < l; F++) {
1800
+ const l = [];
1801
+ for (let F = 0; F < d; F++) {
1784
1802
  const A = T[F >>> 2] >>> 24 - F % 4 * 8 & 255;
1785
- h.push((A >>> 4).toString(16)), h.push((A & 15).toString(16));
1803
+ l.push((A >>> 4).toString(16)), l.push((A & 15).toString(16));
1786
1804
  }
1787
- return h.join("");
1805
+ return l.join("");
1788
1806
  }
1789
- function _(g, l) {
1790
- return g.length >= l ? g : new Array(l - g.length + 1).join("0") + g;
1807
+ function _(g, d) {
1808
+ return g.length >= d ? g : new Array(d - g.length + 1).join("0") + g;
1791
1809
  }
1792
1810
  function M(g) {
1793
- return g.map((l) => (l = l.toString(16), l.length === 1 ? "0" + l : l)).join("");
1811
+ return g.map((d) => (d = d.toString(16), d.length === 1 ? "0" + d : d)).join("");
1794
1812
  }
1795
1813
  function R(g) {
1796
- const l = [];
1814
+ const d = [];
1797
1815
  let T = 0;
1798
- for (let h = 0; h < g.length * 2; h += 2)
1799
- l[h >>> 3] |= parseInt(g[T], 10) << 24 - h % 8 * 4, T++;
1816
+ for (let l = 0; l < g.length * 2; l += 2)
1817
+ d[l >>> 3] |= parseInt(g[T], 10) << 24 - l % 8 * 4, T++;
1800
1818
  try {
1801
- const h = [];
1819
+ const l = [];
1802
1820
  for (let F = 0; F < g.length; F++) {
1803
- const A = l[F >>> 2] >>> 24 - F % 4 * 8 & 255;
1804
- h.push(String.fromCharCode(A));
1821
+ const A = d[F >>> 2] >>> 24 - F % 4 * 8 & 255;
1822
+ l.push(String.fromCharCode(A));
1805
1823
  }
1806
- return decodeURIComponent(escape(h.join("")));
1824
+ return decodeURIComponent(escape(l.join("")));
1807
1825
  } catch {
1808
1826
  throw new Error("Malformed UTF-8 data");
1809
1827
  }
1810
1828
  }
1811
1829
  function q(g) {
1812
- const l = [];
1830
+ const d = [];
1813
1831
  let T = g.length;
1814
1832
  T % 2 !== 0 && (g = _(g, T + 1)), T = g.length;
1815
- for (let h = 0; h < T; h += 2)
1816
- l.push(parseInt(g.substr(h, 2), 16));
1817
- return l;
1833
+ for (let l = 0; l < T; l += 2)
1834
+ d.push(parseInt(g.substr(l, 2), 16));
1835
+ return d;
1818
1836
  }
1819
1837
  function p(g) {
1820
- const l = u.decodePointHex(g);
1821
- if (!l) return !1;
1822
- const T = l.getX();
1823
- return l.getY().square().equals(T.multiply(T.square()).add(T.multiply(u.a)).add(u.b));
1838
+ const d = u.decodePointHex(g);
1839
+ if (!d) return !1;
1840
+ const T = d.getX();
1841
+ return d.getY().square().equals(T.multiply(T.square()).add(T.multiply(u.a)).add(u.b));
1824
1842
  }
1825
- function w(g, l) {
1843
+ function w(g, d) {
1826
1844
  const T = u.decodePointHex(g);
1827
1845
  if (!T) return !1;
1828
- const h = u.decodePointHex(l);
1829
- return h ? T.equals(h) : !1;
1846
+ const l = u.decodePointHex(d);
1847
+ return l ? T.equals(l) : !1;
1830
1848
  }
1831
1849
  return Rt = {
1832
1850
  getGlobalCurve: a,
1833
- generateEcparam: b,
1851
+ generateEcparam: y,
1834
1852
  generateKeyPairHex: m,
1835
1853
  compressPublicKeyHex: v,
1836
1854
  utf8ToHex: B,
@@ -1862,22 +1880,22 @@ function xe() {
1862
1880
  function f(B) {
1863
1881
  return B ^ o(B, 15) ^ o(B, 23);
1864
1882
  }
1865
- function d(B) {
1883
+ function h(B) {
1866
1884
  let _ = B.length * 8, M = _ % 512;
1867
1885
  M = M >= 448 ? 512 - M % 448 - 1 : 448 - M - 1;
1868
1886
  const R = new Array((M - 7) / 8), q = new Array(8);
1869
- for (let h = 0, F = R.length; h < F; h++) R[h] = 0;
1870
- for (let h = 0, F = q.length; h < F; h++) q[h] = 0;
1887
+ for (let l = 0, F = R.length; l < F; l++) R[l] = 0;
1888
+ for (let l = 0, F = q.length; l < F; l++) q[l] = 0;
1871
1889
  _ = _.toString(2);
1872
- for (let h = 7; h >= 0; h--)
1890
+ for (let l = 7; l >= 0; l--)
1873
1891
  if (_.length > 8) {
1874
1892
  const F = _.length - 8;
1875
- q[h] = parseInt(_.substr(F), 2), _ = _.substr(0, F);
1876
- } else _.length > 0 && (q[h] = parseInt(_, 2), _ = "");
1877
- const p = new Uint8Array([...B, 128, ...R, ...q]), w = new DataView(p.buffer, 0), g = p.length / 64, l = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
1878
- for (let h = 0; h < g; h++) {
1893
+ q[l] = parseInt(_.substr(F), 2), _ = _.substr(0, F);
1894
+ } else _.length > 0 && (q[l] = parseInt(_, 2), _ = "");
1895
+ const p = new Uint8Array([...B, 128, ...R, ...q]), w = new DataView(p.buffer, 0), g = p.length / 64, d = new Uint32Array([1937774191, 1226093241, 388252375, 3666478592, 2842636476, 372324522, 3817729613, 2969243214]);
1896
+ for (let l = 0; l < g; l++) {
1879
1897
  t.fill(0), i.fill(0);
1880
- const F = 16 * h;
1898
+ const F = 16 * l;
1881
1899
  for (let I = 0; I < 16; I++)
1882
1900
  t[I] = w.getUint32((F + I) * 4, !1);
1883
1901
  for (let I = 16; I < 68; I++)
@@ -1885,41 +1903,41 @@ function xe() {
1885
1903
  for (let I = 0; I < 64; I++)
1886
1904
  i[I] = t[I] ^ t[I + 4];
1887
1905
  const A = 2043430169, O = 2055708042;
1888
- let C = l[0], L = l[1], D = l[2], P = l[3], z = l[4], H = l[5], $ = l[6], K = l[7], G, ot, ut, at, ht;
1906
+ let C = d[0], L = d[1], D = d[2], P = d[3], z = d[4], H = d[5], $ = d[6], K = d[7], G, ot, ut, at, ht;
1889
1907
  for (let I = 0; I < 64; I++)
1890
1908
  ht = I >= 0 && I <= 15 ? A : O, G = o(o(C, 12) + z + o(ht, I), 7), ot = G ^ o(C, 12), ut = (I >= 0 && I <= 15 ? C ^ L ^ D : C & L | C & D | L & D) + P + ot + i[I], at = (I >= 0 && I <= 15 ? z ^ H ^ $ : z & H | ~z & $) + K + G + t[I], P = D, D = o(L, 9), L = C, C = ut, K = $, $ = o(H, 19), H = z, z = u(at);
1891
- l[0] ^= C, l[1] ^= L, l[2] ^= D, l[3] ^= P, l[4] ^= z, l[5] ^= H, l[6] ^= $, l[7] ^= K;
1909
+ d[0] ^= C, d[1] ^= L, d[2] ^= D, d[3] ^= P, d[4] ^= z, d[5] ^= H, d[6] ^= $, d[7] ^= K;
1892
1910
  }
1893
1911
  const T = [];
1894
- for (let h = 0, F = l.length; h < F; h++) {
1895
- const A = l[h];
1912
+ for (let l = 0, F = d.length; l < F; l++) {
1913
+ const A = d[l];
1896
1914
  T.push((A & 4278190080) >>> 24, (A & 16711680) >>> 16, (A & 65280) >>> 8, A & 255);
1897
1915
  }
1898
1916
  return T;
1899
1917
  }
1900
- const a = 64, b = new Uint8Array(a), m = new Uint8Array(a);
1918
+ const a = 64, y = new Uint8Array(a), m = new Uint8Array(a);
1901
1919
  for (let B = 0; B < a; B++)
1902
- b[B] = 54, m[B] = 92;
1920
+ y[B] = 54, m[B] = 92;
1903
1921
  function v(B, _) {
1904
- for (_.length > a && (_ = d(_)); _.length < a; ) _.push(0);
1905
- const M = s(_, b), R = s(_, m), q = d([...M, ...B]);
1906
- return d([...R, ...q]);
1922
+ for (_.length > a && (_ = h(_)); _.length < a; ) _.push(0);
1923
+ const M = s(_, y), R = s(_, m), q = h([...M, ...B]);
1924
+ return h([...R, ...q]);
1907
1925
  }
1908
1926
  return Dt = {
1909
- sm3: d,
1927
+ sm3: h,
1910
1928
  hmac: v
1911
1929
  }, Dt;
1912
1930
  }
1913
1931
  var At, Kt;
1914
- function si() {
1932
+ function fi() {
1915
1933
  if (Kt) return At;
1916
1934
  Kt = 1;
1917
- const { BigInteger: t } = wt(), { encodeDer: i, decodeDer: o } = ri(), s = oi(), u = xe().sm3, { G: f, curve: d, n: a } = s.generateEcparam(), b = 0;
1935
+ const { BigInteger: t } = wt(), { encodeDer: i, decodeDer: o } = ii(), s = si(), u = xe().sm3, { G: f, curve: h, n: a } = s.generateEcparam(), y = 0;
1918
1936
  function m(p, w, g = 1) {
1919
1937
  p = typeof p == "string" ? s.hexToArray(s.utf8ToHex(p)) : Array.prototype.slice.call(p), w = s.getGlobalCurve().decodePointHex(w);
1920
- const l = s.generateKeyPairHex(), T = new t(l.privateKey, 16);
1921
- let h = l.publicKey;
1922
- h.length > 128 && (h = h.substr(h.length - 128));
1938
+ const d = s.generateKeyPairHex(), T = new t(d.privateKey, 16);
1939
+ let l = d.publicKey;
1940
+ l.length > 128 && (l = l.substr(l.length - 128));
1923
1941
  const F = w.multiply(T), A = s.hexToArray(s.leftPad(F.getX().toBigInteger().toRadix(16), 64)), O = s.hexToArray(s.leftPad(F.getY().toBigInteger().toRadix(16), 64)), C = s.arrayToHex(u([].concat(A, p, O)));
1924
1942
  let L = 1, D = 0, P = [];
1925
1943
  const z = [].concat(A, O), H = () => {
@@ -1929,15 +1947,15 @@ function si() {
1929
1947
  for (let K = 0, G = p.length; K < G; K++)
1930
1948
  D === P.length && H(), p[K] ^= P[D++] & 255;
1931
1949
  const $ = s.arrayToHex(p);
1932
- return g === b ? h + $ + C : h + C + $;
1950
+ return g === y ? l + $ + C : l + C + $;
1933
1951
  }
1934
1952
  function v(p, w, g = 1, {
1935
- output: l = "string"
1953
+ output: d = "string"
1936
1954
  } = {}) {
1937
1955
  w = new t(w, 16);
1938
- let T = p.substr(128, 64), h = p.substr(192);
1939
- g === b && (T = p.substr(p.length - 64), h = p.substr(128, p.length - 128 - 64));
1940
- const F = s.hexToArray(h), O = s.getGlobalCurve().decodePointHex("04" + p.substr(0, 128)).multiply(w), C = s.hexToArray(s.leftPad(O.getX().toBigInteger().toRadix(16), 64)), L = s.hexToArray(s.leftPad(O.getY().toBigInteger().toRadix(16), 64));
1956
+ let T = p.substr(128, 64), l = p.substr(192);
1957
+ g === y && (T = p.substr(p.length - 64), l = p.substr(128, p.length - 128 - 64));
1958
+ const F = s.hexToArray(l), O = s.getGlobalCurve().decodePointHex("04" + p.substr(0, 128)).multiply(w), C = s.hexToArray(s.leftPad(O.getX().toBigInteger().toRadix(16), 64)), L = s.hexToArray(s.leftPad(O.getY().toBigInteger().toRadix(16), 64));
1941
1959
  let D = 1, P = 0, z = [];
1942
1960
  const H = [].concat(C, L), $ = () => {
1943
1961
  z = u([...H, D >> 24 & 255, D >> 16 & 255, D >> 8 & 255, D & 255]), D++, P = 0;
@@ -1945,17 +1963,17 @@ function si() {
1945
1963
  $();
1946
1964
  for (let G = 0, ot = F.length; G < ot; G++)
1947
1965
  P === z.length && $(), F[G] ^= z[P++] & 255;
1948
- return s.arrayToHex(u([].concat(C, F, L))) === T.toLowerCase() ? l === "array" ? F : s.arrayToUtf8(F) : l === "array" ? [] : "";
1966
+ return s.arrayToHex(u([].concat(C, F, L))) === T.toLowerCase() ? d === "array" ? F : s.arrayToUtf8(F) : d === "array" ? [] : "";
1949
1967
  }
1950
1968
  function B(p, w, {
1951
1969
  pointPool: g,
1952
- der: l,
1970
+ der: d,
1953
1971
  hash: T,
1954
- publicKey: h,
1972
+ publicKey: l,
1955
1973
  userId: F
1956
1974
  } = {}) {
1957
1975
  let A = typeof p == "string" ? s.utf8ToHex(p) : s.arrayToHex(p);
1958
- T && (h = h || R(w), A = M(A, h, F));
1976
+ T && (l = l || R(w), A = M(A, l, F));
1959
1977
  const O = new t(w, 16), C = new t(A, 16);
1960
1978
  let L = null, D = null, P = null;
1961
1979
  do {
@@ -1965,25 +1983,25 @@ function si() {
1965
1983
  } while (D.equals(t.ZERO) || D.add(L).equals(a));
1966
1984
  P = O.add(t.ONE).modInverse(a).multiply(L.subtract(D.multiply(O))).mod(a);
1967
1985
  } while (P.equals(t.ZERO));
1968
- return l ? i(D, P) : s.leftPad(D.toString(16), 64) + s.leftPad(P.toString(16), 64);
1986
+ return d ? i(D, P) : s.leftPad(D.toString(16), 64) + s.leftPad(P.toString(16), 64);
1969
1987
  }
1970
- function _(p, w, g, { der: l, hash: T, userId: h } = {}) {
1988
+ function _(p, w, g, { der: d, hash: T, userId: l } = {}) {
1971
1989
  let F = typeof p == "string" ? s.utf8ToHex(p) : s.arrayToHex(p);
1972
- T && (F = M(F, g, h));
1990
+ T && (F = M(F, g, l));
1973
1991
  let A, O;
1974
- if (l) {
1992
+ if (d) {
1975
1993
  const H = o(w);
1976
1994
  A = H.r, O = H.s;
1977
1995
  } else
1978
1996
  A = new t(w.substring(0, 64), 16), O = new t(w.substring(64), 16);
1979
- const C = d.decodePointHex(g), L = new t(F, 16), D = A.add(O).mod(a);
1997
+ const C = h.decodePointHex(g), L = new t(F, 16), D = A.add(O).mod(a);
1980
1998
  if (D.equals(t.ZERO)) return !1;
1981
1999
  const P = f.multiply(O).add(C.multiply(D)), z = L.add(P.getX().toBigInteger()).mod(a);
1982
2000
  return A.equals(z);
1983
2001
  }
1984
2002
  function M(p, w, g = "1234567812345678") {
1985
2003
  g = s.utf8ToHex(g);
1986
- const l = s.leftPad(f.curve.a.toBigInteger().toRadix(16), 64), T = s.leftPad(f.curve.b.toBigInteger().toRadix(16), 64), h = s.leftPad(f.getX().toBigInteger().toRadix(16), 64), F = s.leftPad(f.getY().toBigInteger().toRadix(16), 64);
2004
+ const d = s.leftPad(f.curve.a.toBigInteger().toRadix(16), 64), T = s.leftPad(f.curve.b.toBigInteger().toRadix(16), 64), l = s.leftPad(f.getX().toBigInteger().toRadix(16), 64), F = s.leftPad(f.getY().toBigInteger().toRadix(16), 64);
1987
2005
  let A, O;
1988
2006
  if (w.length === 128)
1989
2007
  A = w.substr(0, 64), O = w.substr(64, 64);
@@ -1991,17 +2009,17 @@ function si() {
1991
2009
  const P = f.curve.decodePointHex(w);
1992
2010
  A = s.leftPad(P.getX().toBigInteger().toRadix(16), 64), O = s.leftPad(P.getY().toBigInteger().toRadix(16), 64);
1993
2011
  }
1994
- const C = s.hexToArray(g + l + T + h + F + A + O), L = g.length * 4;
2012
+ const C = s.hexToArray(g + d + T + l + F + A + O), L = g.length * 4;
1995
2013
  C.unshift(L & 255), C.unshift(L >> 8 & 255);
1996
2014
  const D = u(C);
1997
2015
  return s.arrayToHex(u(D.concat(s.hexToArray(p))));
1998
2016
  }
1999
2017
  function R(p) {
2000
- const w = f.multiply(new t(p, 16)), g = s.leftPad(w.getX().toBigInteger().toString(16), 64), l = s.leftPad(w.getY().toBigInteger().toString(16), 64);
2001
- return "04" + g + l;
2018
+ const w = f.multiply(new t(p, 16)), g = s.leftPad(w.getX().toBigInteger().toString(16), 64), d = s.leftPad(w.getY().toBigInteger().toString(16), 64);
2019
+ return "04" + g + d;
2002
2020
  }
2003
2021
  function q() {
2004
- const p = s.generateKeyPairHex(), w = d.decodePointHex(p.publicKey);
2022
+ const p = s.generateKeyPairHex(), w = h.decodePointHex(p.publicKey);
2005
2023
  return p.k = new t(p.privateKey, 16), p.x1 = w.getX().toBigInteger(), p;
2006
2024
  }
2007
2025
  return At = {
@@ -2018,28 +2036,28 @@ function si() {
2018
2036
  }, At;
2019
2037
  }
2020
2038
  var It, Qt;
2021
- function fi() {
2039
+ function ci() {
2022
2040
  if (Qt) return It;
2023
2041
  Qt = 1;
2024
2042
  const { sm3: t, hmac: i } = xe();
2025
- function o(d, a) {
2026
- return d.length >= a ? d : new Array(a - d.length + 1).join("0") + d;
2043
+ function o(h, a) {
2044
+ return h.length >= a ? h : new Array(a - h.length + 1).join("0") + h;
2027
2045
  }
2028
- function s(d) {
2029
- return d.map((a) => (a = a.toString(16), a.length === 1 ? "0" + a : a)).join("");
2046
+ function s(h) {
2047
+ return h.map((a) => (a = a.toString(16), a.length === 1 ? "0" + a : a)).join("");
2030
2048
  }
2031
- function u(d) {
2049
+ function u(h) {
2032
2050
  const a = [];
2033
- let b = d.length;
2034
- b % 2 !== 0 && (d = o(d, b + 1)), b = d.length;
2035
- for (let m = 0; m < b; m += 2)
2036
- a.push(parseInt(d.substr(m, 2), 16));
2051
+ let y = h.length;
2052
+ y % 2 !== 0 && (h = o(h, y + 1)), y = h.length;
2053
+ for (let m = 0; m < y; m += 2)
2054
+ a.push(parseInt(h.substr(m, 2), 16));
2037
2055
  return a;
2038
2056
  }
2039
- function f(d) {
2057
+ function f(h) {
2040
2058
  const a = [];
2041
- for (let b = 0, m = d.length; b < m; b++) {
2042
- const v = d.codePointAt(b);
2059
+ for (let y = 0, m = h.length; y < m; y++) {
2060
+ const v = h.codePointAt(y);
2043
2061
  if (v <= 127)
2044
2062
  a.push(v);
2045
2063
  else if (v <= 2047)
@@ -2047,24 +2065,24 @@ function fi() {
2047
2065
  else if (v <= 55295 || v >= 57344 && v <= 65535)
2048
2066
  a.push(224 | v >>> 12), a.push(128 | v >>> 6 & 63), a.push(128 | v & 63);
2049
2067
  else if (v >= 65536 && v <= 1114111)
2050
- b++, a.push(240 | v >>> 18 & 28), a.push(128 | v >>> 12 & 63), a.push(128 | v >>> 6 & 63), a.push(128 | v & 63);
2068
+ y++, a.push(240 | v >>> 18 & 28), a.push(128 | v >>> 12 & 63), a.push(128 | v >>> 6 & 63), a.push(128 | v & 63);
2051
2069
  else
2052
2070
  throw a.push(v), new Error("input is not supported");
2053
2071
  }
2054
2072
  return a;
2055
2073
  }
2056
- return It = function(d, a) {
2057
- if (d = typeof d == "string" ? f(d) : Array.prototype.slice.call(d), a) {
2074
+ return It = function(h, a) {
2075
+ if (h = typeof h == "string" ? f(h) : Array.prototype.slice.call(h), a) {
2058
2076
  if ((a.mode || "hmac") !== "hmac") throw new Error("invalid mode");
2059
2077
  let m = a.key;
2060
2078
  if (!m) throw new Error("invalid key");
2061
- return m = typeof m == "string" ? u(m) : Array.prototype.slice.call(m), s(i(d, m));
2079
+ return m = typeof m == "string" ? u(m) : Array.prototype.slice.call(m), s(i(h, m));
2062
2080
  }
2063
- return s(t(d));
2081
+ return s(t(h));
2064
2082
  }, It;
2065
2083
  }
2066
2084
  var Mt, te;
2067
- function ci() {
2085
+ function ui() {
2068
2086
  if (te) return Mt;
2069
2087
  te = 1;
2070
2088
  const t = 0, i = 32, o = 16, s = [
@@ -2360,16 +2378,16 @@ function ci() {
2360
2378
  ];
2361
2379
  function f(p) {
2362
2380
  const w = [];
2363
- for (let g = 0, l = p.length; g < l; g += 2)
2381
+ for (let g = 0, d = p.length; g < d; g += 2)
2364
2382
  w.push(parseInt(p.substr(g, 2), 16));
2365
2383
  return w;
2366
2384
  }
2367
- function d(p) {
2385
+ function h(p) {
2368
2386
  return p.map((w) => (w = w.toString(16), w.length === 1 ? "0" + w : w)).join("");
2369
2387
  }
2370
2388
  function a(p) {
2371
2389
  const w = [];
2372
- for (let g = 0, l = p.length; g < l; g++) {
2390
+ for (let g = 0, d = p.length; g < d; g++) {
2373
2391
  const T = p.codePointAt(g);
2374
2392
  if (T <= 127)
2375
2393
  w.push(T);
@@ -2384,9 +2402,9 @@ function ci() {
2384
2402
  }
2385
2403
  return w;
2386
2404
  }
2387
- function b(p) {
2405
+ function y(p) {
2388
2406
  const w = [];
2389
- for (let g = 0, l = p.length; g < l; g++)
2407
+ for (let g = 0, d = p.length; g < d; g++)
2390
2408
  p[g] >= 240 && p[g] <= 247 ? (w.push(String.fromCodePoint(((p[g] & 7) << 18) + ((p[g + 1] & 63) << 12) + ((p[g + 2] & 63) << 6) + (p[g + 3] & 63))), g += 3) : p[g] >= 224 && p[g] <= 239 ? (w.push(String.fromCodePoint(((p[g] & 15) << 12) + ((p[g + 1] & 63) << 6) + (p[g + 2] & 63))), g += 2) : p[g] >= 192 && p[g] <= 223 ? (w.push(String.fromCodePoint(((p[g] & 31) << 6) + (p[g + 1] & 63))), g++) : w.push(String.fromCodePoint(p[g]));
2391
2409
  return w.join("");
2392
2410
  }
@@ -2404,43 +2422,43 @@ function ci() {
2404
2422
  return p ^ m(p, 13) ^ m(p, 23);
2405
2423
  }
2406
2424
  function M(p, w, g) {
2407
- const l = new Array(4), T = new Array(4);
2408
- for (let h = 0; h < 4; h++)
2409
- T[0] = p[4 * h] & 255, T[1] = p[4 * h + 1] & 255, T[2] = p[4 * h + 2] & 255, T[3] = p[4 * h + 3] & 255, l[h] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
2410
- for (let h = 0, F; h < 32; h += 4)
2411
- F = l[1] ^ l[2] ^ l[3] ^ g[h + 0], l[0] ^= B(v(F)), F = l[2] ^ l[3] ^ l[0] ^ g[h + 1], l[1] ^= B(v(F)), F = l[3] ^ l[0] ^ l[1] ^ g[h + 2], l[2] ^= B(v(F)), F = l[0] ^ l[1] ^ l[2] ^ g[h + 3], l[3] ^= B(v(F));
2412
- for (let h = 0; h < 16; h += 4)
2413
- w[h] = l[3 - h / 4] >>> 24 & 255, w[h + 1] = l[3 - h / 4] >>> 16 & 255, w[h + 2] = l[3 - h / 4] >>> 8 & 255, w[h + 3] = l[3 - h / 4] & 255;
2425
+ const d = new Array(4), T = new Array(4);
2426
+ for (let l = 0; l < 4; l++)
2427
+ T[0] = p[4 * l] & 255, T[1] = p[4 * l + 1] & 255, T[2] = p[4 * l + 2] & 255, T[3] = p[4 * l + 3] & 255, d[l] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
2428
+ for (let l = 0, F; l < 32; l += 4)
2429
+ F = d[1] ^ d[2] ^ d[3] ^ g[l + 0], d[0] ^= B(v(F)), F = d[2] ^ d[3] ^ d[0] ^ g[l + 1], d[1] ^= B(v(F)), F = d[3] ^ d[0] ^ d[1] ^ g[l + 2], d[2] ^= B(v(F)), F = d[0] ^ d[1] ^ d[2] ^ g[l + 3], d[3] ^= B(v(F));
2430
+ for (let l = 0; l < 16; l += 4)
2431
+ w[l] = d[3 - l / 4] >>> 24 & 255, w[l + 1] = d[3 - l / 4] >>> 16 & 255, w[l + 2] = d[3 - l / 4] >>> 8 & 255, w[l + 3] = d[3 - l / 4] & 255;
2414
2432
  }
2415
2433
  function R(p, w, g) {
2416
- const l = new Array(4), T = new Array(4);
2417
- for (let h = 0; h < 4; h++)
2418
- T[0] = p[0 + 4 * h] & 255, T[1] = p[1 + 4 * h] & 255, T[2] = p[2 + 4 * h] & 255, T[3] = p[3 + 4 * h] & 255, l[h] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
2419
- l[0] ^= 2746333894, l[1] ^= 1453994832, l[2] ^= 1736282519, l[3] ^= 2993693404;
2420
- for (let h = 0, F; h < 32; h += 4)
2421
- F = l[1] ^ l[2] ^ l[3] ^ u[h + 0], w[h + 0] = l[0] ^= _(v(F)), F = l[2] ^ l[3] ^ l[0] ^ u[h + 1], w[h + 1] = l[1] ^= _(v(F)), F = l[3] ^ l[0] ^ l[1] ^ u[h + 2], w[h + 2] = l[2] ^= _(v(F)), F = l[0] ^ l[1] ^ l[2] ^ u[h + 3], w[h + 3] = l[3] ^= _(v(F));
2434
+ const d = new Array(4), T = new Array(4);
2435
+ for (let l = 0; l < 4; l++)
2436
+ T[0] = p[0 + 4 * l] & 255, T[1] = p[1 + 4 * l] & 255, T[2] = p[2 + 4 * l] & 255, T[3] = p[3 + 4 * l] & 255, d[l] = T[0] << 24 | T[1] << 16 | T[2] << 8 | T[3];
2437
+ d[0] ^= 2746333894, d[1] ^= 1453994832, d[2] ^= 1736282519, d[3] ^= 2993693404;
2438
+ for (let l = 0, F; l < 32; l += 4)
2439
+ F = d[1] ^ d[2] ^ d[3] ^ u[l + 0], w[l + 0] = d[0] ^= _(v(F)), F = d[2] ^ d[3] ^ d[0] ^ u[l + 1], w[l + 1] = d[1] ^= _(v(F)), F = d[3] ^ d[0] ^ d[1] ^ u[l + 2], w[l + 2] = d[2] ^= _(v(F)), F = d[0] ^ d[1] ^ d[2] ^ u[l + 3], w[l + 3] = d[3] ^= _(v(F));
2422
2440
  if (g === t)
2423
- for (let h = 0, F; h < 16; h++)
2424
- F = w[h], w[h] = w[31 - h], w[31 - h] = F;
2441
+ for (let l = 0, F; l < 16; l++)
2442
+ F = w[l], w[l] = w[31 - l], w[31 - l] = F;
2425
2443
  }
2426
2444
  function q(p, w, g, {
2427
- padding: l = "pkcs#7",
2445
+ padding: d = "pkcs#7",
2428
2446
  mode: T,
2429
- iv: h = [],
2447
+ iv: l = [],
2430
2448
  output: F = "string"
2431
2449
  } = {}) {
2432
- if (T === "cbc" && (typeof h == "string" && (h = f(h)), h.length !== 128 / 8))
2450
+ if (T === "cbc" && (typeof l == "string" && (l = f(l)), l.length !== 128 / 8))
2433
2451
  throw new Error("iv is invalid");
2434
2452
  if (typeof w == "string" && (w = f(w)), w.length !== 128 / 8)
2435
2453
  throw new Error("key is invalid");
2436
- if (typeof p == "string" ? g !== t ? p = a(p) : p = f(p) : p = [...p], (l === "pkcs#5" || l === "pkcs#7") && g !== t) {
2454
+ if (typeof p == "string" ? g !== t ? p = a(p) : p = f(p) : p = [...p], (d === "pkcs#5" || d === "pkcs#7") && g !== t) {
2437
2455
  const P = o - p.length % o;
2438
2456
  for (let z = 0; z < P; z++) p.push(P);
2439
2457
  }
2440
2458
  const A = new Array(i);
2441
2459
  R(w, A, g);
2442
2460
  const O = [];
2443
- let C = h, L = p.length, D = 0;
2461
+ let C = l, L = p.length, D = 0;
2444
2462
  for (; L >= o; ) {
2445
2463
  const P = p.slice(D, D + 16), z = new Array(16);
2446
2464
  if (T === "cbc")
@@ -2451,13 +2469,13 @@ function ci() {
2451
2469
  T === "cbc" && g === t && (z[H] ^= C[H]), O[D + H] = z[H];
2452
2470
  T === "cbc" && (g !== t ? C = z : C = P), L -= o, D += o;
2453
2471
  }
2454
- if ((l === "pkcs#5" || l === "pkcs#7") && g === t) {
2472
+ if ((d === "pkcs#5" || d === "pkcs#7") && g === t) {
2455
2473
  const P = O.length, z = O[P - 1];
2456
2474
  for (let H = 1; H <= z; H++)
2457
2475
  if (O[P - H] !== z) throw new Error("padding is invalid");
2458
2476
  O.splice(P - z, z);
2459
2477
  }
2460
- return F !== "array" ? g !== t ? d(O) : b(O) : O;
2478
+ return F !== "array" ? g !== t ? h(O) : y(O) : O;
2461
2479
  }
2462
2480
  return Mt = {
2463
2481
  encrypt(p, w, g) {
@@ -2469,22 +2487,22 @@ function ci() {
2469
2487
  }, Mt;
2470
2488
  }
2471
2489
  var Ot, ee;
2472
- function ui() {
2490
+ function ai() {
2473
2491
  return ee || (ee = 1, Ot = {
2474
- sm2: si(),
2475
- sm3: fi(),
2476
- sm4: ci()
2492
+ sm2: fi(),
2493
+ sm3: ci(),
2494
+ sm4: ui()
2477
2495
  }), Ot;
2478
2496
  }
2479
- var me = ui();
2480
- const ve = me.sm2, ye = me.sm4, zi = (t, i, o = "04") => o + ve.doEncrypt(t, i), Li = (t, i, o = "04") => ve.doDecrypt(t.startsWith(o) ? t.slice(2) : t, i), Hi = (t, i) => ye.encrypt(t, i), Ni = (t, i) => ye.decrypt(t, i);
2481
- let ct = [], ai = { consecutiveFrames: 0, lastBlinkTime: 0 }, hi = { consecutiveFrames: 0, lastBlinkTime: 0 };
2482
- const li = /* @__PURE__ */ new Map([
2483
- ["nod", [yi, 30, 100]],
2484
- ["shake", [vi, 7, 100]],
2485
- ["mouth", [mi, 0.35, 100]],
2486
- ["eye", [xi, 0.3, 100]]
2487
- ]), Yi = ["nod", "shake", "mouth", "eye"], ki = {
2497
+ var me = ai();
2498
+ const ve = me.sm2, ye = me.sm4, Li = (t, i, o = "04") => o + ve.doEncrypt(t, i), Hi = (t, i, o = "04") => ve.doDecrypt(t.startsWith(o) ? t.slice(2) : t, i), Ni = (t, i) => ye.encrypt(t, i), Yi = (t, i) => ye.decrypt(t, i);
2499
+ let ct = [], hi = { consecutiveFrames: 0, lastBlinkTime: 0 }, li = { consecutiveFrames: 0, lastBlinkTime: 0 };
2500
+ const di = /* @__PURE__ */ new Map([
2501
+ ["nod", [bi, 30, 100]],
2502
+ ["shake", [yi, 7, 100]],
2503
+ ["mouth", [vi, 0.35, 100]],
2504
+ ["eye", [mi, 0.3, 100]]
2505
+ ]), ki = ["nod", "shake", "mouth", "eye"], Vi = {
2488
2506
  nod: "请点点头",
2489
2507
  shake: "请摇摇头",
2490
2508
  mouth: "请张张嘴",
@@ -2497,7 +2515,7 @@ function ne(t, i) {
2497
2515
  o.map((u, f) => u - s[f]).reduce((u, f) => u + Math.pow(f, 2), 0)
2498
2516
  );
2499
2517
  }
2500
- function* di(t, i, o = 8, s = 0) {
2518
+ function* pi(t, i, o = 8, s = 0) {
2501
2519
  for (let u = o; u > 0; u--)
2502
2520
  yield t(i, 0.5, s);
2503
2521
  }
@@ -2512,16 +2530,16 @@ function re(t) {
2512
2530
  const i = qt(t[1], t[5]), o = qt(t[2], t[4]), s = qt(t[0], t[3]);
2513
2531
  return (i + o) / (2 * s);
2514
2532
  }
2515
- function pi(t) {
2533
+ function gi(t) {
2516
2534
  const i = ne(gt(t[13]), gt(t[19])), o = ne(gt(t[0]), gt(t[6]));
2517
2535
  return i / o;
2518
2536
  }
2519
- function gi(t) {
2537
+ function xi(t) {
2520
2538
  const i = t.positions[30], o = t.positions[36], s = t.positions[45], u = (o.x + s.x) / 2;
2521
2539
  return (i.x - u) / (s.x - o.x) * 30;
2522
2540
  }
2523
- function xi(t, i) {
2524
- const o = Date.now(), s = ie(re(t.getLeftEye()), i, ai, o), u = ie(re(t.getRightEye()), i, hi, o);
2541
+ function mi(t, i) {
2542
+ const o = Date.now(), s = ie(re(t.getLeftEye()), i, hi, o), u = ie(re(t.getRightEye()), i, li, o);
2525
2543
  return !!(s || u);
2526
2544
  }
2527
2545
  function ie(t, i, o, s) {
@@ -2531,14 +2549,14 @@ function ie(t, i, o, s) {
2531
2549
  return o.lastBlinkTime = s, o.consecutiveFrames = 0, !0;
2532
2550
  return !1;
2533
2551
  }
2534
- function mi(t, i) {
2535
- return pi(t.getMouth()) > i;
2536
- }
2537
2552
  function vi(t, i) {
2538
- const o = gi(t);
2539
- return Math.abs(o) > i;
2553
+ return gi(t.getMouth()) > i;
2540
2554
  }
2541
2555
  function yi(t, i) {
2556
+ const o = xi(t);
2557
+ return Math.abs(o) > i;
2558
+ }
2559
+ function bi(t, i) {
2542
2560
  const o = ct.length, s = t.positions[33];
2543
2561
  if (o < 5)
2544
2562
  ct.push(s.y);
@@ -2550,24 +2568,24 @@ function yi(t, i) {
2550
2568
  }
2551
2569
  return !1;
2552
2570
  }
2553
- function Vi(t, i = "blob", o = 1) {
2571
+ function $i(t, i = "blob", o = 1) {
2554
2572
  return new Promise((s) => {
2555
2573
  const u = document.createElement("canvas"), f = u.getContext("2d");
2556
2574
  u.width = t.videoWidth, u.height = t.videoHeight, f == null || f.drawImage(t, 0, 0, u.width, u.height), i === "blob" ? u.toBlob(
2557
- (d) => {
2575
+ (h) => {
2558
2576
  const a = new FileReader();
2559
- a.onload = () => s(a.result), a.readAsArrayBuffer(d);
2577
+ a.onload = () => s(a.result), a.readAsArrayBuffer(h);
2560
2578
  },
2561
2579
  "image/png",
2562
2580
  o
2563
2581
  ) : s(u.toDataURL("image/png", o));
2564
2582
  });
2565
2583
  }
2566
- async function $i(t, i, o, s = 5) {
2567
- const [u, f, d] = li.get(o);
2584
+ async function ji(t, i, o, s = 5) {
2585
+ const [u, f, h] = di.get(o);
2568
2586
  if (!u) return !1;
2569
- const a = [], b = di(t, i, s, d);
2570
- for (const m of b) {
2587
+ const a = [], y = pi(t, i, s, h);
2588
+ for (const m of y) {
2571
2589
  const v = await m;
2572
2590
  if (!v) continue;
2573
2591
  const B = u(v.landmarks, f);
@@ -2576,26 +2594,26 @@ async function $i(t, i, o, s = 5) {
2576
2594
  return a.includes(!0);
2577
2595
  }
2578
2596
  let it = null;
2579
- function ji(t) {
2597
+ function Ui(t) {
2580
2598
  const { cacheKey: i, cacheMode: o = "session", saveState: s = !0, handler: u } = t;
2581
2599
  return s && it || (it = o === "local" ? se.get(i) : oe.get(i), it && typeof u == "function" && (it = u(it))), it;
2582
2600
  }
2583
- const Ui = { DATE_VALUE_FORMAT: wr, COMMON_TEXT: et, IMAGE_TYPE: fe, MEDIA_TYPE: ce, DOC_TYPE: ue, FILE_TYPE: Fr }, Zi = {
2584
- encodeURIToParams: qr,
2585
- paramsToQueryString: Cr,
2586
- queryStringToParams: Pr,
2587
- errorCodeToString: Sr,
2588
- YNToString: Er,
2589
- HNToString: Br,
2590
- valueToLabel: Ir,
2591
- chargeToLabel: Mr,
2601
+ const Zi = { DATE_VALUE_FORMAT: Tr, COMMON_TEXT: et, IMAGE_TYPE: fe, MEDIA_TYPE: ce, DOC_TYPE: ue, FILE_TYPE: Sr }, Gi = {
2602
+ encodeURIToParams: Cr,
2603
+ paramsToQueryString: Pr,
2604
+ queryStringToParams: zr,
2605
+ errorCodeToString: Er,
2606
+ YNToString: Br,
2607
+ HNToString: _r,
2608
+ valueToLabel: Mr,
2609
+ chargeToLabel: Or,
2592
2610
  cascaderToLabel: ae,
2593
- multipleSelectToLabel: Or,
2594
- phoneToAsterisk: _r,
2595
- idNumberToAsterisk: Rr,
2596
- firstLetterToUpperCase: Dr,
2597
- firstLetterToLowerCase: Ar
2598
- }, Gi = {
2611
+ multipleSelectToLabel: qr,
2612
+ phoneToAsterisk: Rr,
2613
+ idNumberToAsterisk: Dr,
2614
+ firstLetterToUpperCase: Ar,
2615
+ firstLetterToLowerCase: Ir
2616
+ }, Wi = {
2599
2617
  validHttp: or,
2600
2618
  validExternal: sr,
2601
2619
  validString: fr,
@@ -2607,45 +2625,46 @@ const Ui = { DATE_VALUE_FORMAT: wr, COMMON_TEXT: et, IMAGE_TYPE: fe, MEDIA_TYPE:
2607
2625
  validIdNumber: zt,
2608
2626
  validPhone: pr,
2609
2627
  validTel: dr
2610
- }, Wi = { scrollTo: Wn, addClass: er, removeClass: nr, hasClass: Pt, toggleClass: tr, noContextmenu: ir, useRafThrottle: rr }, Ji = { parseTime: mt, getTimeDistance: Kn, getDayRange: Qn }, Xi = { local: se, session: oe }, Ki = { uuid: Xn, randomNum: Jn };
2628
+ }, Ji = { scrollTo: Wn, addClass: er, removeClass: nr, hasClass: Pt, toggleClass: tr, noContextmenu: ir, useRafThrottle: rr }, Xi = { parseTime: mt, getTimeDistance: Kn, getDayRange: Qn }, Ki = { local: se, session: oe }, Qi = { uuid: Xn, randomNum: Jn };
2611
2629
  export {
2612
- Ui as CONSTANTS,
2630
+ Zi as CONSTANTS,
2613
2631
  jt as NOOP,
2614
- Ci as addResizeListener,
2615
- Xi as cacheUtil,
2616
- wi as countdownTimer,
2617
- Di as creatCancelTask,
2618
- Ji as dateUtil,
2619
- Fi as debounce,
2620
- Ai as downloadFile,
2621
- Wi as elementUtil,
2622
- Yi as faceLivingEvent,
2623
- ki as faceLivingEventHint,
2624
- _i as getArrayFullUrl,
2625
- Ei as getBirthdayByIdNumber,
2626
- $i as getFaceGestureResult,
2627
- Vi as getFaceVideoFrame,
2628
- xr as getFullUrl,
2629
- Si as getGenderByIdNumber,
2630
- Bi as getLocationConfig,
2631
- qi as getMapLocationIcon,
2632
- Ii as getPercentage,
2633
- Ti as getRandomItemInArray,
2634
- ji as getRequestBaseUrl,
2635
- Mi as loadCss,
2636
- Oi as loadJs,
2637
- Ki as randomUtil,
2638
- Pi as removeResizeListener,
2639
- Ri as ricTask,
2640
- bi as sleep,
2632
+ Pi as addResizeListener,
2633
+ Ki as cacheUtil,
2634
+ Ti as countdownTimer,
2635
+ Ai as creatCancelTask,
2636
+ Xi as dateUtil,
2637
+ Si as debounce,
2638
+ Ii as downloadFile,
2639
+ Ji as elementUtil,
2640
+ ki as faceLivingEvent,
2641
+ Vi as faceLivingEventHint,
2642
+ Ri as getArrayFullUrl,
2643
+ Bi as getBirthdayByIdNumber,
2644
+ ji as getFaceGestureResult,
2645
+ $i as getFaceVideoFrame,
2646
+ mr as getFullUrl,
2647
+ Ei as getGenderByIdNumber,
2648
+ gr as getLocationConfig,
2649
+ Ci as getMapLocationIcon,
2650
+ Mi as getPercentage,
2651
+ Fi as getRandomItemInArray,
2652
+ Ui as getRequestBaseUrl,
2653
+ _i as getSystemConfig,
2654
+ Oi as loadCss,
2655
+ qi as loadJs,
2656
+ Qi as randomUtil,
2657
+ zi as removeResizeListener,
2658
+ Di as ricTask,
2659
+ wi as sleep,
2641
2660
  ve as sm2Crypto,
2642
- Li as sm2Decrypt,
2643
- zi as sm2Encrypt,
2661
+ Hi as sm2Decrypt,
2662
+ Li as sm2Encrypt,
2644
2663
  ye as sm4Crypto,
2645
- Ni as sm4Decrypt,
2646
- Hi as sm4Encrypt,
2647
- Zi as toUtil,
2648
- gr as transformPathName,
2649
- mr as trimArray,
2650
- Gi as validUtil
2664
+ Yi as sm4Decrypt,
2665
+ Ni as sm4Encrypt,
2666
+ Gi as toUtil,
2667
+ xr as transformPathName,
2668
+ vr as trimArray,
2669
+ Wi as validUtil
2651
2670
  };