@yuku123/z-team-component 0.2.102 → 0.2.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 (58) hide show
  1. package/package.json +1 -1
  2. package/dist/ChangeLogView-BIlT58NX.js +0 -542
  3. package/dist/ComponentDoc-bhNM4jiY.js +0 -8035
  4. package/dist/InvitationManagementPage-9AmXUw6E.js +0 -495
  5. package/dist/OnboardingPage-B9oWippy.js +0 -393
  6. package/dist/ScheduledTasks-CkNxtgeb.js +0 -12127
  7. package/dist/SystemShell-Cz3bn2dt.js +0 -688
  8. package/dist/_commonjsHelpers-B52_cu2H.js +0 -26
  9. package/dist/admin-logs-BuwxECUY.js +0 -198
  10. package/dist/api-DL_MM5cW.js +0 -20
  11. package/dist/browser-jb_PFvU3.js +0 -1538
  12. package/dist/createWorkspaceWsHandler-B6LYCL3Q.js +0 -13142
  13. package/dist/ctc-sso-DtJHC-2M.js +0 -117
  14. package/dist/echarts-B1OU1xr4.js +0 -16
  15. package/dist/history-BlrA1eaW.js +0 -41
  16. package/dist/index-2dGExnjZ.js +0 -2217
  17. package/dist/index-B1AYMWHS.js +0 -10169
  18. package/dist/index-B5F1N9_V.js +0 -42049
  19. package/dist/index-B8O2io7L.js +0 -315
  20. package/dist/index-BIXeUFLa.js +0 -479
  21. package/dist/index-BPqoN-aE.js +0 -242
  22. package/dist/index-BTs7b4SV.js +0 -118
  23. package/dist/index-BYMhgsLe.js +0 -178
  24. package/dist/index-BZBxvwcT.js +0 -169
  25. package/dist/index-BZCQSW-G.js +0 -1222
  26. package/dist/index-B_LJRFsK.js +0 -339
  27. package/dist/index-BdmM-NHL.js +0 -5892
  28. package/dist/index-BmHFHD_e.js +0 -112
  29. package/dist/index-BohoJQPr.js +0 -7631
  30. package/dist/index-C1wsTstT.js +0 -434
  31. package/dist/index-C1wtrBjM.js +0 -8
  32. package/dist/index-C815hPWS.js +0 -430
  33. package/dist/index-CbH8YeqA.js +0 -913
  34. package/dist/index-CsweV-yM.js +0 -142
  35. package/dist/index-D3vyICxK.js +0 -2699
  36. package/dist/index-DKgyKXWm.js +0 -1640
  37. package/dist/index-DQHEr9-I.js +0 -93
  38. package/dist/index-DU-PHfEr.js +0 -189
  39. package/dist/index-DWsfQMp8.js +0 -208
  40. package/dist/index-DhDdFRHC.js +0 -279
  41. package/dist/index-DvTMESfc.js +0 -132
  42. package/dist/index-fl0m6QYf.js +0 -316
  43. package/dist/index-lux3nNJP.js +0 -574
  44. package/dist/index-mwtsohOK.js +0 -951
  45. package/dist/index-qd4awhFI.js +0 -956
  46. package/dist/index.js +0 -10
  47. package/dist/index.module-CAa-2T7m.js +0 -72
  48. package/dist/index.module-UI0iz8K0.js +0 -42
  49. package/dist/instance-4ACm8YFK.js +0 -216
  50. package/dist/menuPermission-C7yt7uNG.js +0 -60
  51. package/dist/mobile-client-O3yr9h6t.js +0 -24
  52. package/dist/pages.js +0 -21
  53. package/dist/send-default-agent-team-message-YRd0CkeT.js +0 -35
  54. package/dist/spark-md5-Dld54a-T.js +0 -178
  55. package/dist/sso-user-GnlYnP83.js +0 -43
  56. package/dist/training-CyK00fwu.js +0 -450
  57. package/dist/webide-SjnHsCZF.js +0 -5233
  58. package/dist/z-team-component.css +0 -1
@@ -1,1538 +0,0 @@
1
- import { g as re } from "./_commonjsHelpers-B52_cu2H.js";
2
- function oe(r, o) {
3
- for (var i = 0; i < o.length; i++) {
4
- const e = o[i];
5
- if (typeof e != "string" && !Array.isArray(e)) {
6
- for (const t in e)
7
- if (t !== "default" && !(t in r)) {
8
- const n = Object.getOwnPropertyDescriptor(e, t);
9
- n && Object.defineProperty(r, t, n.get ? n : {
10
- enumerable: !0,
11
- get: () => e[t]
12
- });
13
- }
14
- }
15
- }
16
- return Object.freeze(Object.defineProperty(r, Symbol.toStringTag, { value: "Module" }));
17
- }
18
- var z = {}, Q, Bt;
19
- function ie() {
20
- return Bt || (Bt = 1, Q = function() {
21
- return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
22
- }), Q;
23
- }
24
- var $ = {}, _ = {}, At;
25
- function U() {
26
- if (At) return _;
27
- At = 1;
28
- let r;
29
- const o = [
30
- 0,
31
- // Not used
32
- 26,
33
- 44,
34
- 70,
35
- 100,
36
- 134,
37
- 172,
38
- 196,
39
- 242,
40
- 292,
41
- 346,
42
- 404,
43
- 466,
44
- 532,
45
- 581,
46
- 655,
47
- 733,
48
- 815,
49
- 901,
50
- 991,
51
- 1085,
52
- 1156,
53
- 1258,
54
- 1364,
55
- 1474,
56
- 1588,
57
- 1706,
58
- 1828,
59
- 1921,
60
- 2051,
61
- 2185,
62
- 2323,
63
- 2465,
64
- 2611,
65
- 2761,
66
- 2876,
67
- 3034,
68
- 3196,
69
- 3362,
70
- 3532,
71
- 3706
72
- ];
73
- return _.getSymbolSize = function(e) {
74
- if (!e) throw new Error('"version" cannot be null or undefined');
75
- if (e < 1 || e > 40) throw new Error('"version" should be in range from 1 to 40');
76
- return e * 4 + 17;
77
- }, _.getSymbolTotalCodewords = function(e) {
78
- return o[e];
79
- }, _.getBCHDigit = function(i) {
80
- let e = 0;
81
- for (; i !== 0; )
82
- e++, i >>>= 1;
83
- return e;
84
- }, _.setToSJISFunction = function(e) {
85
- if (typeof e != "function")
86
- throw new Error('"toSJISFunc" is not a valid function.');
87
- r = e;
88
- }, _.isKanjiModeEnabled = function() {
89
- return typeof r < "u";
90
- }, _.toSJIS = function(e) {
91
- return r(e);
92
- }, _;
93
- }
94
- var W = {}, Rt;
95
- function yt() {
96
- return Rt || (Rt = 1, (function(r) {
97
- r.L = { bit: 1 }, r.M = { bit: 0 }, r.Q = { bit: 3 }, r.H = { bit: 2 };
98
- function o(i) {
99
- if (typeof i != "string")
100
- throw new Error("Param is not a string");
101
- switch (i.toLowerCase()) {
102
- case "l":
103
- case "low":
104
- return r.L;
105
- case "m":
106
- case "medium":
107
- return r.M;
108
- case "q":
109
- case "quartile":
110
- return r.Q;
111
- case "h":
112
- case "high":
113
- return r.H;
114
- default:
115
- throw new Error("Unknown EC Level: " + i);
116
- }
117
- }
118
- r.isValid = function(e) {
119
- return e && typeof e.bit < "u" && e.bit >= 0 && e.bit < 4;
120
- }, r.from = function(e, t) {
121
- if (r.isValid(e))
122
- return e;
123
- try {
124
- return o(e);
125
- } catch {
126
- return t;
127
- }
128
- };
129
- })(W)), W;
130
- }
131
- var Z, Tt;
132
- function se() {
133
- if (Tt) return Z;
134
- Tt = 1;
135
- function r() {
136
- this.buffer = [], this.length = 0;
137
- }
138
- return r.prototype = {
139
- get: function(o) {
140
- const i = Math.floor(o / 8);
141
- return (this.buffer[i] >>> 7 - o % 8 & 1) === 1;
142
- },
143
- put: function(o, i) {
144
- for (let e = 0; e < i; e++)
145
- this.putBit((o >>> i - e - 1 & 1) === 1);
146
- },
147
- getLengthInBits: function() {
148
- return this.length;
149
- },
150
- putBit: function(o) {
151
- const i = Math.floor(this.length / 8);
152
- this.buffer.length <= i && this.buffer.push(0), o && (this.buffer[i] |= 128 >>> this.length % 8), this.length++;
153
- }
154
- }, Z = r, Z;
155
- }
156
- var X, It;
157
- function ue() {
158
- if (It) return X;
159
- It = 1;
160
- function r(o) {
161
- if (!o || o < 1)
162
- throw new Error("BitMatrix size must be defined and greater than 0");
163
- this.size = o, this.data = new Uint8Array(o * o), this.reservedBit = new Uint8Array(o * o);
164
- }
165
- return r.prototype.set = function(o, i, e, t) {
166
- const n = o * this.size + i;
167
- this.data[n] = e, t && (this.reservedBit[n] = !0);
168
- }, r.prototype.get = function(o, i) {
169
- return this.data[o * this.size + i];
170
- }, r.prototype.xor = function(o, i, e) {
171
- this.data[o * this.size + i] ^= e;
172
- }, r.prototype.isReserved = function(o, i) {
173
- return this.reservedBit[o * this.size + i];
174
- }, X = r, X;
175
- }
176
- var x = {}, Nt;
177
- function ae() {
178
- return Nt || (Nt = 1, (function(r) {
179
- const o = U().getSymbolSize;
180
- r.getRowColCoords = function(e) {
181
- if (e === 1) return [];
182
- const t = Math.floor(e / 7) + 2, n = o(e), s = n === 145 ? 26 : Math.ceil((n - 13) / (2 * t - 2)) * 2, a = [n - 7];
183
- for (let u = 1; u < t - 1; u++)
184
- a[u] = a[u - 1] - s;
185
- return a.push(6), a.reverse();
186
- }, r.getPositions = function(e) {
187
- const t = [], n = r.getRowColCoords(e), s = n.length;
188
- for (let a = 0; a < s; a++)
189
- for (let u = 0; u < s; u++)
190
- a === 0 && u === 0 || // top-left
191
- a === 0 && u === s - 1 || // bottom-left
192
- a === s - 1 && u === 0 || t.push([n[a], n[u]]);
193
- return t;
194
- };
195
- })(x)), x;
196
- }
197
- var tt = {}, Pt;
198
- function ce() {
199
- if (Pt) return tt;
200
- Pt = 1;
201
- const r = U().getSymbolSize, o = 7;
202
- return tt.getPositions = function(e) {
203
- const t = r(e);
204
- return [
205
- // top-left
206
- [0, 0],
207
- // top-right
208
- [t - o, 0],
209
- // bottom-left
210
- [0, t - o]
211
- ];
212
- }, tt;
213
- }
214
- var et = {}, Mt;
215
- function fe() {
216
- return Mt || (Mt = 1, (function(r) {
217
- r.Patterns = {
218
- PATTERN000: 0,
219
- PATTERN001: 1,
220
- PATTERN010: 2,
221
- PATTERN011: 3,
222
- PATTERN100: 4,
223
- PATTERN101: 5,
224
- PATTERN110: 6,
225
- PATTERN111: 7
226
- };
227
- const o = {
228
- N1: 3,
229
- N2: 3,
230
- N3: 40,
231
- N4: 10
232
- };
233
- r.isValid = function(t) {
234
- return t != null && t !== "" && !isNaN(t) && t >= 0 && t <= 7;
235
- }, r.from = function(t) {
236
- return r.isValid(t) ? parseInt(t, 10) : void 0;
237
- }, r.getPenaltyN1 = function(t) {
238
- const n = t.size;
239
- let s = 0, a = 0, u = 0, c = null, d = null;
240
- for (let p = 0; p < n; p++) {
241
- a = u = 0, c = d = null;
242
- for (let h = 0; h < n; h++) {
243
- let f = t.get(p, h);
244
- f === c ? a++ : (a >= 5 && (s += o.N1 + (a - 5)), c = f, a = 1), f = t.get(h, p), f === d ? u++ : (u >= 5 && (s += o.N1 + (u - 5)), d = f, u = 1);
245
- }
246
- a >= 5 && (s += o.N1 + (a - 5)), u >= 5 && (s += o.N1 + (u - 5));
247
- }
248
- return s;
249
- }, r.getPenaltyN2 = function(t) {
250
- const n = t.size;
251
- let s = 0;
252
- for (let a = 0; a < n - 1; a++)
253
- for (let u = 0; u < n - 1; u++) {
254
- const c = t.get(a, u) + t.get(a, u + 1) + t.get(a + 1, u) + t.get(a + 1, u + 1);
255
- (c === 4 || c === 0) && s++;
256
- }
257
- return s * o.N2;
258
- }, r.getPenaltyN3 = function(t) {
259
- const n = t.size;
260
- let s = 0, a = 0, u = 0;
261
- for (let c = 0; c < n; c++) {
262
- a = u = 0;
263
- for (let d = 0; d < n; d++)
264
- a = a << 1 & 2047 | t.get(c, d), d >= 10 && (a === 1488 || a === 93) && s++, u = u << 1 & 2047 | t.get(d, c), d >= 10 && (u === 1488 || u === 93) && s++;
265
- }
266
- return s * o.N3;
267
- }, r.getPenaltyN4 = function(t) {
268
- let n = 0;
269
- const s = t.data.length;
270
- for (let u = 0; u < s; u++) n += t.data[u];
271
- return Math.abs(Math.ceil(n * 100 / s / 5) - 10) * o.N4;
272
- };
273
- function i(e, t, n) {
274
- switch (e) {
275
- case r.Patterns.PATTERN000:
276
- return (t + n) % 2 === 0;
277
- case r.Patterns.PATTERN001:
278
- return t % 2 === 0;
279
- case r.Patterns.PATTERN010:
280
- return n % 3 === 0;
281
- case r.Patterns.PATTERN011:
282
- return (t + n) % 3 === 0;
283
- case r.Patterns.PATTERN100:
284
- return (Math.floor(t / 2) + Math.floor(n / 3)) % 2 === 0;
285
- case r.Patterns.PATTERN101:
286
- return t * n % 2 + t * n % 3 === 0;
287
- case r.Patterns.PATTERN110:
288
- return (t * n % 2 + t * n % 3) % 2 === 0;
289
- case r.Patterns.PATTERN111:
290
- return (t * n % 3 + (t + n) % 2) % 2 === 0;
291
- default:
292
- throw new Error("bad maskPattern:" + e);
293
- }
294
- }
295
- r.applyMask = function(t, n) {
296
- const s = n.size;
297
- for (let a = 0; a < s; a++)
298
- for (let u = 0; u < s; u++)
299
- n.isReserved(u, a) || n.xor(u, a, i(t, u, a));
300
- }, r.getBestMask = function(t, n) {
301
- const s = Object.keys(r.Patterns).length;
302
- let a = 0, u = 1 / 0;
303
- for (let c = 0; c < s; c++) {
304
- n(c), r.applyMask(c, t);
305
- const d = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
306
- r.applyMask(c, t), d < u && (u = d, a = c);
307
- }
308
- return a;
309
- };
310
- })(et)), et;
311
- }
312
- var J = {}, St;
313
- function $t() {
314
- if (St) return J;
315
- St = 1;
316
- const r = yt(), o = [
317
- // L M Q H
318
- 1,
319
- 1,
320
- 1,
321
- 1,
322
- 1,
323
- 1,
324
- 1,
325
- 1,
326
- 1,
327
- 1,
328
- 2,
329
- 2,
330
- 1,
331
- 2,
332
- 2,
333
- 4,
334
- 1,
335
- 2,
336
- 4,
337
- 4,
338
- 2,
339
- 4,
340
- 4,
341
- 4,
342
- 2,
343
- 4,
344
- 6,
345
- 5,
346
- 2,
347
- 4,
348
- 6,
349
- 6,
350
- 2,
351
- 5,
352
- 8,
353
- 8,
354
- 4,
355
- 5,
356
- 8,
357
- 8,
358
- 4,
359
- 5,
360
- 8,
361
- 11,
362
- 4,
363
- 8,
364
- 10,
365
- 11,
366
- 4,
367
- 9,
368
- 12,
369
- 16,
370
- 4,
371
- 9,
372
- 16,
373
- 16,
374
- 6,
375
- 10,
376
- 12,
377
- 18,
378
- 6,
379
- 10,
380
- 17,
381
- 16,
382
- 6,
383
- 11,
384
- 16,
385
- 19,
386
- 6,
387
- 13,
388
- 18,
389
- 21,
390
- 7,
391
- 14,
392
- 21,
393
- 25,
394
- 8,
395
- 16,
396
- 20,
397
- 25,
398
- 8,
399
- 17,
400
- 23,
401
- 25,
402
- 9,
403
- 17,
404
- 23,
405
- 34,
406
- 9,
407
- 18,
408
- 25,
409
- 30,
410
- 10,
411
- 20,
412
- 27,
413
- 32,
414
- 12,
415
- 21,
416
- 29,
417
- 35,
418
- 12,
419
- 23,
420
- 34,
421
- 37,
422
- 12,
423
- 25,
424
- 34,
425
- 40,
426
- 13,
427
- 26,
428
- 35,
429
- 42,
430
- 14,
431
- 28,
432
- 38,
433
- 45,
434
- 15,
435
- 29,
436
- 40,
437
- 48,
438
- 16,
439
- 31,
440
- 43,
441
- 51,
442
- 17,
443
- 33,
444
- 45,
445
- 54,
446
- 18,
447
- 35,
448
- 48,
449
- 57,
450
- 19,
451
- 37,
452
- 51,
453
- 60,
454
- 19,
455
- 38,
456
- 53,
457
- 63,
458
- 20,
459
- 40,
460
- 56,
461
- 66,
462
- 21,
463
- 43,
464
- 59,
465
- 70,
466
- 22,
467
- 45,
468
- 62,
469
- 74,
470
- 24,
471
- 47,
472
- 65,
473
- 77,
474
- 25,
475
- 49,
476
- 68,
477
- 81
478
- ], i = [
479
- // L M Q H
480
- 7,
481
- 10,
482
- 13,
483
- 17,
484
- 10,
485
- 16,
486
- 22,
487
- 28,
488
- 15,
489
- 26,
490
- 36,
491
- 44,
492
- 20,
493
- 36,
494
- 52,
495
- 64,
496
- 26,
497
- 48,
498
- 72,
499
- 88,
500
- 36,
501
- 64,
502
- 96,
503
- 112,
504
- 40,
505
- 72,
506
- 108,
507
- 130,
508
- 48,
509
- 88,
510
- 132,
511
- 156,
512
- 60,
513
- 110,
514
- 160,
515
- 192,
516
- 72,
517
- 130,
518
- 192,
519
- 224,
520
- 80,
521
- 150,
522
- 224,
523
- 264,
524
- 96,
525
- 176,
526
- 260,
527
- 308,
528
- 104,
529
- 198,
530
- 288,
531
- 352,
532
- 120,
533
- 216,
534
- 320,
535
- 384,
536
- 132,
537
- 240,
538
- 360,
539
- 432,
540
- 144,
541
- 280,
542
- 408,
543
- 480,
544
- 168,
545
- 308,
546
- 448,
547
- 532,
548
- 180,
549
- 338,
550
- 504,
551
- 588,
552
- 196,
553
- 364,
554
- 546,
555
- 650,
556
- 224,
557
- 416,
558
- 600,
559
- 700,
560
- 224,
561
- 442,
562
- 644,
563
- 750,
564
- 252,
565
- 476,
566
- 690,
567
- 816,
568
- 270,
569
- 504,
570
- 750,
571
- 900,
572
- 300,
573
- 560,
574
- 810,
575
- 960,
576
- 312,
577
- 588,
578
- 870,
579
- 1050,
580
- 336,
581
- 644,
582
- 952,
583
- 1110,
584
- 360,
585
- 700,
586
- 1020,
587
- 1200,
588
- 390,
589
- 728,
590
- 1050,
591
- 1260,
592
- 420,
593
- 784,
594
- 1140,
595
- 1350,
596
- 450,
597
- 812,
598
- 1200,
599
- 1440,
600
- 480,
601
- 868,
602
- 1290,
603
- 1530,
604
- 510,
605
- 924,
606
- 1350,
607
- 1620,
608
- 540,
609
- 980,
610
- 1440,
611
- 1710,
612
- 570,
613
- 1036,
614
- 1530,
615
- 1800,
616
- 570,
617
- 1064,
618
- 1590,
619
- 1890,
620
- 600,
621
- 1120,
622
- 1680,
623
- 1980,
624
- 630,
625
- 1204,
626
- 1770,
627
- 2100,
628
- 660,
629
- 1260,
630
- 1860,
631
- 2220,
632
- 720,
633
- 1316,
634
- 1950,
635
- 2310,
636
- 750,
637
- 1372,
638
- 2040,
639
- 2430
640
- ];
641
- return J.getBlocksCount = function(t, n) {
642
- switch (n) {
643
- case r.L:
644
- return o[(t - 1) * 4 + 0];
645
- case r.M:
646
- return o[(t - 1) * 4 + 1];
647
- case r.Q:
648
- return o[(t - 1) * 4 + 2];
649
- case r.H:
650
- return o[(t - 1) * 4 + 3];
651
- default:
652
- return;
653
- }
654
- }, J.getTotalCodewordsCount = function(t, n) {
655
- switch (n) {
656
- case r.L:
657
- return i[(t - 1) * 4 + 0];
658
- case r.M:
659
- return i[(t - 1) * 4 + 1];
660
- case r.Q:
661
- return i[(t - 1) * 4 + 2];
662
- case r.H:
663
- return i[(t - 1) * 4 + 3];
664
- default:
665
- return;
666
- }
667
- }, J;
668
- }
669
- var nt = {}, K = {}, bt;
670
- function le() {
671
- if (bt) return K;
672
- bt = 1;
673
- const r = new Uint8Array(512), o = new Uint8Array(256);
674
- return (function() {
675
- let e = 1;
676
- for (let t = 0; t < 255; t++)
677
- r[t] = e, o[e] = t, e <<= 1, e & 256 && (e ^= 285);
678
- for (let t = 255; t < 512; t++)
679
- r[t] = r[t - 255];
680
- })(), K.log = function(e) {
681
- if (e < 1) throw new Error("log(" + e + ")");
682
- return o[e];
683
- }, K.exp = function(e) {
684
- return r[e];
685
- }, K.mul = function(e, t) {
686
- return e === 0 || t === 0 ? 0 : r[o[e] + o[t]];
687
- }, K;
688
- }
689
- var Lt;
690
- function de() {
691
- return Lt || (Lt = 1, (function(r) {
692
- const o = le();
693
- r.mul = function(e, t) {
694
- const n = new Uint8Array(e.length + t.length - 1);
695
- for (let s = 0; s < e.length; s++)
696
- for (let a = 0; a < t.length; a++)
697
- n[s + a] ^= o.mul(e[s], t[a]);
698
- return n;
699
- }, r.mod = function(e, t) {
700
- let n = new Uint8Array(e);
701
- for (; n.length - t.length >= 0; ) {
702
- const s = n[0];
703
- for (let u = 0; u < t.length; u++)
704
- n[u] ^= o.mul(t[u], s);
705
- let a = 0;
706
- for (; a < n.length && n[a] === 0; ) a++;
707
- n = n.slice(a);
708
- }
709
- return n;
710
- }, r.generateECPolynomial = function(e) {
711
- let t = new Uint8Array([1]);
712
- for (let n = 0; n < e; n++)
713
- t = r.mul(t, new Uint8Array([1, o.exp(n)]));
714
- return t;
715
- };
716
- })(nt)), nt;
717
- }
718
- var rt, Dt;
719
- function ge() {
720
- if (Dt) return rt;
721
- Dt = 1;
722
- const r = de();
723
- function o(i) {
724
- this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
725
- }
726
- return o.prototype.initialize = function(e) {
727
- this.degree = e, this.genPoly = r.generateECPolynomial(this.degree);
728
- }, o.prototype.encode = function(e) {
729
- if (!this.genPoly)
730
- throw new Error("Encoder not initialized");
731
- const t = new Uint8Array(e.length + this.degree);
732
- t.set(e);
733
- const n = r.mod(t, this.genPoly), s = this.degree - n.length;
734
- if (s > 0) {
735
- const a = new Uint8Array(this.degree);
736
- return a.set(n, s), a;
737
- }
738
- return n;
739
- }, rt = o, rt;
740
- }
741
- var ot = {}, it = {}, st = {}, qt;
742
- function Wt() {
743
- return qt || (qt = 1, st.isValid = function(o) {
744
- return !isNaN(o) && o >= 1 && o <= 40;
745
- }), st;
746
- }
747
- var L = {}, vt;
748
- function Zt() {
749
- if (vt) return L;
750
- vt = 1;
751
- const r = "[0-9]+", o = "[A-Z $%*+\\-./:]+";
752
- let i = "(?:[u3000-u303F]|[u3040-u309F]|[u30A0-u30FF]|[uFF00-uFFEF]|[u4E00-u9FAF]|[u2605-u2606]|[u2190-u2195]|u203B|[u2010u2015u2018u2019u2025u2026u201Cu201Du2225u2260]|[u0391-u0451]|[u00A7u00A8u00B1u00B4u00D7u00F7])+";
753
- i = i.replace(/u/g, "\\u");
754
- const e = "(?:(?![A-Z0-9 $%*+\\-./:]|" + i + `)(?:.|[\r
755
- ]))+`;
756
- L.KANJI = new RegExp(i, "g"), L.BYTE_KANJI = new RegExp("[^A-Z0-9 $%*+\\-./:]+", "g"), L.BYTE = new RegExp(e, "g"), L.NUMERIC = new RegExp(r, "g"), L.ALPHANUMERIC = new RegExp(o, "g");
757
- const t = new RegExp("^" + i + "$"), n = new RegExp("^" + r + "$"), s = new RegExp("^[A-Z0-9 $%*+\\-./:]+$");
758
- return L.testKanji = function(u) {
759
- return t.test(u);
760
- }, L.testNumeric = function(u) {
761
- return n.test(u);
762
- }, L.testAlphanumeric = function(u) {
763
- return s.test(u);
764
- }, L;
765
- }
766
- var _t;
767
- function F() {
768
- return _t || (_t = 1, (function(r) {
769
- const o = Wt(), i = Zt();
770
- r.NUMERIC = {
771
- id: "Numeric",
772
- bit: 1,
773
- ccBits: [10, 12, 14]
774
- }, r.ALPHANUMERIC = {
775
- id: "Alphanumeric",
776
- bit: 2,
777
- ccBits: [9, 11, 13]
778
- }, r.BYTE = {
779
- id: "Byte",
780
- bit: 4,
781
- ccBits: [8, 16, 16]
782
- }, r.KANJI = {
783
- id: "Kanji",
784
- bit: 8,
785
- ccBits: [8, 10, 12]
786
- }, r.MIXED = {
787
- bit: -1
788
- }, r.getCharCountIndicator = function(n, s) {
789
- if (!n.ccBits) throw new Error("Invalid mode: " + n);
790
- if (!o.isValid(s))
791
- throw new Error("Invalid version: " + s);
792
- return s >= 1 && s < 10 ? n.ccBits[0] : s < 27 ? n.ccBits[1] : n.ccBits[2];
793
- }, r.getBestModeForData = function(n) {
794
- return i.testNumeric(n) ? r.NUMERIC : i.testAlphanumeric(n) ? r.ALPHANUMERIC : i.testKanji(n) ? r.KANJI : r.BYTE;
795
- }, r.toString = function(n) {
796
- if (n && n.id) return n.id;
797
- throw new Error("Invalid mode");
798
- }, r.isValid = function(n) {
799
- return n && n.bit && n.ccBits;
800
- };
801
- function e(t) {
802
- if (typeof t != "string")
803
- throw new Error("Param is not a string");
804
- switch (t.toLowerCase()) {
805
- case "numeric":
806
- return r.NUMERIC;
807
- case "alphanumeric":
808
- return r.ALPHANUMERIC;
809
- case "kanji":
810
- return r.KANJI;
811
- case "byte":
812
- return r.BYTE;
813
- default:
814
- throw new Error("Unknown mode: " + t);
815
- }
816
- }
817
- r.from = function(n, s) {
818
- if (r.isValid(n))
819
- return n;
820
- try {
821
- return e(n);
822
- } catch {
823
- return s;
824
- }
825
- };
826
- })(it)), it;
827
- }
828
- var Ut;
829
- function he() {
830
- return Ut || (Ut = 1, (function(r) {
831
- const o = U(), i = $t(), e = yt(), t = F(), n = Wt(), s = 7973, a = o.getBCHDigit(s);
832
- function u(h, f, N) {
833
- for (let P = 1; P <= 40; P++)
834
- if (f <= r.getCapacity(P, N, h))
835
- return P;
836
- }
837
- function c(h, f) {
838
- return t.getCharCountIndicator(h, f) + 4;
839
- }
840
- function d(h, f) {
841
- let N = 0;
842
- return h.forEach(function(P) {
843
- const S = c(P.mode, f);
844
- N += S + P.getBitsLength();
845
- }), N;
846
- }
847
- function p(h, f) {
848
- for (let N = 1; N <= 40; N++)
849
- if (d(h, N) <= r.getCapacity(N, f, t.MIXED))
850
- return N;
851
- }
852
- r.from = function(f, N) {
853
- return n.isValid(f) ? parseInt(f, 10) : N;
854
- }, r.getCapacity = function(f, N, P) {
855
- if (!n.isValid(f))
856
- throw new Error("Invalid QR Code version");
857
- typeof P > "u" && (P = t.BYTE);
858
- const S = o.getSymbolTotalCodewords(f), R = i.getTotalCodewordsCount(f, N), M = (S - R) * 8;
859
- if (P === t.MIXED) return M;
860
- const T = M - c(P, f);
861
- switch (P) {
862
- case t.NUMERIC:
863
- return Math.floor(T / 10 * 3);
864
- case t.ALPHANUMERIC:
865
- return Math.floor(T / 11 * 2);
866
- case t.KANJI:
867
- return Math.floor(T / 13);
868
- case t.BYTE:
869
- default:
870
- return Math.floor(T / 8);
871
- }
872
- }, r.getBestVersionForData = function(f, N) {
873
- let P;
874
- const S = e.from(N, e.M);
875
- if (Array.isArray(f)) {
876
- if (f.length > 1)
877
- return p(f, S);
878
- if (f.length === 0)
879
- return 1;
880
- P = f[0];
881
- } else
882
- P = f;
883
- return u(P.mode, P.getLength(), S);
884
- }, r.getEncodedBits = function(f) {
885
- if (!n.isValid(f) || f < 7)
886
- throw new Error("Invalid QR Code version");
887
- let N = f << 12;
888
- for (; o.getBCHDigit(N) - a >= 0; )
889
- N ^= s << o.getBCHDigit(N) - a;
890
- return f << 12 | N;
891
- };
892
- })(ot)), ot;
893
- }
894
- var ut = {}, Ft;
895
- function me() {
896
- if (Ft) return ut;
897
- Ft = 1;
898
- const r = U(), o = 1335, i = 21522, e = r.getBCHDigit(o);
899
- return ut.getEncodedBits = function(n, s) {
900
- const a = n.bit << 3 | s;
901
- let u = a << 10;
902
- for (; r.getBCHDigit(u) - e >= 0; )
903
- u ^= o << r.getBCHDigit(u) - e;
904
- return (a << 10 | u) ^ i;
905
- }, ut;
906
- }
907
- var at = {}, ct, kt;
908
- function we() {
909
- if (kt) return ct;
910
- kt = 1;
911
- const r = F();
912
- function o(i) {
913
- this.mode = r.NUMERIC, this.data = i.toString();
914
- }
915
- return o.getBitsLength = function(e) {
916
- return 10 * Math.floor(e / 3) + (e % 3 ? e % 3 * 3 + 1 : 0);
917
- }, o.prototype.getLength = function() {
918
- return this.data.length;
919
- }, o.prototype.getBitsLength = function() {
920
- return o.getBitsLength(this.data.length);
921
- }, o.prototype.write = function(e) {
922
- let t, n, s;
923
- for (t = 0; t + 3 <= this.data.length; t += 3)
924
- n = this.data.substr(t, 3), s = parseInt(n, 10), e.put(s, 10);
925
- const a = this.data.length - t;
926
- a > 0 && (n = this.data.substr(t), s = parseInt(n, 10), e.put(s, a * 3 + 1));
927
- }, ct = o, ct;
928
- }
929
- var ft, zt;
930
- function ye() {
931
- if (zt) return ft;
932
- zt = 1;
933
- const r = F(), o = [
934
- "0",
935
- "1",
936
- "2",
937
- "3",
938
- "4",
939
- "5",
940
- "6",
941
- "7",
942
- "8",
943
- "9",
944
- "A",
945
- "B",
946
- "C",
947
- "D",
948
- "E",
949
- "F",
950
- "G",
951
- "H",
952
- "I",
953
- "J",
954
- "K",
955
- "L",
956
- "M",
957
- "N",
958
- "O",
959
- "P",
960
- "Q",
961
- "R",
962
- "S",
963
- "T",
964
- "U",
965
- "V",
966
- "W",
967
- "X",
968
- "Y",
969
- "Z",
970
- " ",
971
- "$",
972
- "%",
973
- "*",
974
- "+",
975
- "-",
976
- ".",
977
- "/",
978
- ":"
979
- ];
980
- function i(e) {
981
- this.mode = r.ALPHANUMERIC, this.data = e;
982
- }
983
- return i.getBitsLength = function(t) {
984
- return 11 * Math.floor(t / 2) + 6 * (t % 2);
985
- }, i.prototype.getLength = function() {
986
- return this.data.length;
987
- }, i.prototype.getBitsLength = function() {
988
- return i.getBitsLength(this.data.length);
989
- }, i.prototype.write = function(t) {
990
- let n;
991
- for (n = 0; n + 2 <= this.data.length; n += 2) {
992
- let s = o.indexOf(this.data[n]) * 45;
993
- s += o.indexOf(this.data[n + 1]), t.put(s, 11);
994
- }
995
- this.data.length % 2 && t.put(o.indexOf(this.data[n]), 6);
996
- }, ft = i, ft;
997
- }
998
- var lt, Vt;
999
- function Ce() {
1000
- if (Vt) return lt;
1001
- Vt = 1;
1002
- const r = F();
1003
- function o(i) {
1004
- this.mode = r.BYTE, typeof i == "string" ? this.data = new TextEncoder().encode(i) : this.data = new Uint8Array(i);
1005
- }
1006
- return o.getBitsLength = function(e) {
1007
- return e * 8;
1008
- }, o.prototype.getLength = function() {
1009
- return this.data.length;
1010
- }, o.prototype.getBitsLength = function() {
1011
- return o.getBitsLength(this.data.length);
1012
- }, o.prototype.write = function(i) {
1013
- for (let e = 0, t = this.data.length; e < t; e++)
1014
- i.put(this.data[e], 8);
1015
- }, lt = o, lt;
1016
- }
1017
- var dt, Kt;
1018
- function Ee() {
1019
- if (Kt) return dt;
1020
- Kt = 1;
1021
- const r = F(), o = U();
1022
- function i(e) {
1023
- this.mode = r.KANJI, this.data = e;
1024
- }
1025
- return i.getBitsLength = function(t) {
1026
- return t * 13;
1027
- }, i.prototype.getLength = function() {
1028
- return this.data.length;
1029
- }, i.prototype.getBitsLength = function() {
1030
- return i.getBitsLength(this.data.length);
1031
- }, i.prototype.write = function(e) {
1032
- let t;
1033
- for (t = 0; t < this.data.length; t++) {
1034
- let n = o.toSJIS(this.data[t]);
1035
- if (n >= 33088 && n <= 40956)
1036
- n -= 33088;
1037
- else if (n >= 57408 && n <= 60351)
1038
- n -= 49472;
1039
- else
1040
- throw new Error(
1041
- "Invalid SJIS character: " + this.data[t] + `
1042
- Make sure your charset is UTF-8`
1043
- );
1044
- n = (n >>> 8 & 255) * 192 + (n & 255), e.put(n, 13);
1045
- }
1046
- }, dt = i, dt;
1047
- }
1048
- var gt = { exports: {} }, Ht;
1049
- function pe() {
1050
- return Ht || (Ht = 1, (function(r) {
1051
- var o = {
1052
- single_source_shortest_paths: function(i, e, t) {
1053
- var n = {}, s = {};
1054
- s[e] = 0;
1055
- var a = o.PriorityQueue.make();
1056
- a.push(e, 0);
1057
- for (var u, c, d, p, h, f, N, P, S; !a.empty(); ) {
1058
- u = a.pop(), c = u.value, p = u.cost, h = i[c] || {};
1059
- for (d in h)
1060
- h.hasOwnProperty(d) && (f = h[d], N = p + f, P = s[d], S = typeof s[d] > "u", (S || P > N) && (s[d] = N, a.push(d, N), n[d] = c));
1061
- }
1062
- if (typeof t < "u" && typeof s[t] > "u") {
1063
- var R = ["Could not find a path from ", e, " to ", t, "."].join("");
1064
- throw new Error(R);
1065
- }
1066
- return n;
1067
- },
1068
- extract_shortest_path_from_predecessor_list: function(i, e) {
1069
- for (var t = [], n = e; n; )
1070
- t.push(n), i[n], n = i[n];
1071
- return t.reverse(), t;
1072
- },
1073
- find_path: function(i, e, t) {
1074
- var n = o.single_source_shortest_paths(i, e, t);
1075
- return o.extract_shortest_path_from_predecessor_list(
1076
- n,
1077
- t
1078
- );
1079
- },
1080
- /**
1081
- * A very naive priority queue implementation.
1082
- */
1083
- PriorityQueue: {
1084
- make: function(i) {
1085
- var e = o.PriorityQueue, t = {}, n;
1086
- i = i || {};
1087
- for (n in e)
1088
- e.hasOwnProperty(n) && (t[n] = e[n]);
1089
- return t.queue = [], t.sorter = i.sorter || e.default_sorter, t;
1090
- },
1091
- default_sorter: function(i, e) {
1092
- return i.cost - e.cost;
1093
- },
1094
- /**
1095
- * Add a new item to the queue and ensure the highest priority element
1096
- * is at the front of the queue.
1097
- */
1098
- push: function(i, e) {
1099
- var t = { value: i, cost: e };
1100
- this.queue.push(t), this.queue.sort(this.sorter);
1101
- },
1102
- /**
1103
- * Return the highest priority element in the queue.
1104
- */
1105
- pop: function() {
1106
- return this.queue.shift();
1107
- },
1108
- empty: function() {
1109
- return this.queue.length === 0;
1110
- }
1111
- }
1112
- };
1113
- r.exports = o;
1114
- })(gt)), gt.exports;
1115
- }
1116
- var Jt;
1117
- function Be() {
1118
- return Jt || (Jt = 1, (function(r) {
1119
- const o = F(), i = we(), e = ye(), t = Ce(), n = Ee(), s = Zt(), a = U(), u = pe();
1120
- function c(R) {
1121
- return unescape(encodeURIComponent(R)).length;
1122
- }
1123
- function d(R, M, T) {
1124
- const B = [];
1125
- let b;
1126
- for (; (b = R.exec(T)) !== null; )
1127
- B.push({
1128
- data: b[0],
1129
- index: b.index,
1130
- mode: M,
1131
- length: b[0].length
1132
- });
1133
- return B;
1134
- }
1135
- function p(R) {
1136
- const M = d(s.NUMERIC, o.NUMERIC, R), T = d(s.ALPHANUMERIC, o.ALPHANUMERIC, R);
1137
- let B, b;
1138
- return a.isKanjiModeEnabled() ? (B = d(s.BYTE, o.BYTE, R), b = d(s.KANJI, o.KANJI, R)) : (B = d(s.BYTE_KANJI, o.BYTE, R), b = []), M.concat(T, B, b).sort(function(C, y) {
1139
- return C.index - y.index;
1140
- }).map(function(C) {
1141
- return {
1142
- data: C.data,
1143
- mode: C.mode,
1144
- length: C.length
1145
- };
1146
- });
1147
- }
1148
- function h(R, M) {
1149
- switch (M) {
1150
- case o.NUMERIC:
1151
- return i.getBitsLength(R);
1152
- case o.ALPHANUMERIC:
1153
- return e.getBitsLength(R);
1154
- case o.KANJI:
1155
- return n.getBitsLength(R);
1156
- case o.BYTE:
1157
- return t.getBitsLength(R);
1158
- }
1159
- }
1160
- function f(R) {
1161
- return R.reduce(function(M, T) {
1162
- const B = M.length - 1 >= 0 ? M[M.length - 1] : null;
1163
- return B && B.mode === T.mode ? (M[M.length - 1].data += T.data, M) : (M.push(T), M);
1164
- }, []);
1165
- }
1166
- function N(R) {
1167
- const M = [];
1168
- for (let T = 0; T < R.length; T++) {
1169
- const B = R[T];
1170
- switch (B.mode) {
1171
- case o.NUMERIC:
1172
- M.push([
1173
- B,
1174
- { data: B.data, mode: o.ALPHANUMERIC, length: B.length },
1175
- { data: B.data, mode: o.BYTE, length: B.length }
1176
- ]);
1177
- break;
1178
- case o.ALPHANUMERIC:
1179
- M.push([
1180
- B,
1181
- { data: B.data, mode: o.BYTE, length: B.length }
1182
- ]);
1183
- break;
1184
- case o.KANJI:
1185
- M.push([
1186
- B,
1187
- { data: B.data, mode: o.BYTE, length: c(B.data) }
1188
- ]);
1189
- break;
1190
- case o.BYTE:
1191
- M.push([
1192
- { data: B.data, mode: o.BYTE, length: c(B.data) }
1193
- ]);
1194
- }
1195
- }
1196
- return M;
1197
- }
1198
- function P(R, M) {
1199
- const T = {}, B = { start: {} };
1200
- let b = ["start"];
1201
- for (let g = 0; g < R.length; g++) {
1202
- const C = R[g], y = [];
1203
- for (let l = 0; l < C.length; l++) {
1204
- const A = C[l], m = "" + g + l;
1205
- y.push(m), T[m] = { node: A, lastCount: 0 }, B[m] = {};
1206
- for (let E = 0; E < b.length; E++) {
1207
- const w = b[E];
1208
- T[w] && T[w].node.mode === A.mode ? (B[w][m] = h(T[w].lastCount + A.length, A.mode) - h(T[w].lastCount, A.mode), T[w].lastCount += A.length) : (T[w] && (T[w].lastCount = A.length), B[w][m] = h(A.length, A.mode) + 4 + o.getCharCountIndicator(A.mode, M));
1209
- }
1210
- }
1211
- b = y;
1212
- }
1213
- for (let g = 0; g < b.length; g++)
1214
- B[b[g]].end = 0;
1215
- return { map: B, table: T };
1216
- }
1217
- function S(R, M) {
1218
- let T;
1219
- const B = o.getBestModeForData(R);
1220
- if (T = o.from(M, B), T !== o.BYTE && T.bit < B.bit)
1221
- throw new Error('"' + R + '" cannot be encoded with mode ' + o.toString(T) + `.
1222
- Suggested mode is: ` + o.toString(B));
1223
- switch (T === o.KANJI && !a.isKanjiModeEnabled() && (T = o.BYTE), T) {
1224
- case o.NUMERIC:
1225
- return new i(R);
1226
- case o.ALPHANUMERIC:
1227
- return new e(R);
1228
- case o.KANJI:
1229
- return new n(R);
1230
- case o.BYTE:
1231
- return new t(R);
1232
- }
1233
- }
1234
- r.fromArray = function(M) {
1235
- return M.reduce(function(T, B) {
1236
- return typeof B == "string" ? T.push(S(B, null)) : B.data && T.push(S(B.data, B.mode)), T;
1237
- }, []);
1238
- }, r.fromString = function(M, T) {
1239
- const B = p(M, a.isKanjiModeEnabled()), b = N(B), g = P(b, T), C = u.find_path(g.map, "start", "end"), y = [];
1240
- for (let l = 1; l < C.length - 1; l++)
1241
- y.push(g.table[C[l]].node);
1242
- return r.fromArray(f(y));
1243
- }, r.rawSplit = function(M) {
1244
- return r.fromArray(
1245
- p(M, a.isKanjiModeEnabled())
1246
- );
1247
- };
1248
- })(at)), at;
1249
- }
1250
- var Ot;
1251
- function Ae() {
1252
- if (Ot) return $;
1253
- Ot = 1;
1254
- const r = U(), o = yt(), i = se(), e = ue(), t = ae(), n = ce(), s = fe(), a = $t(), u = ge(), c = he(), d = me(), p = F(), h = Be();
1255
- function f(g, C) {
1256
- const y = g.size, l = n.getPositions(C);
1257
- for (let A = 0; A < l.length; A++) {
1258
- const m = l[A][0], E = l[A][1];
1259
- for (let w = -1; w <= 7; w++)
1260
- if (!(m + w <= -1 || y <= m + w))
1261
- for (let I = -1; I <= 7; I++)
1262
- E + I <= -1 || y <= E + I || (w >= 0 && w <= 6 && (I === 0 || I === 6) || I >= 0 && I <= 6 && (w === 0 || w === 6) || w >= 2 && w <= 4 && I >= 2 && I <= 4 ? g.set(m + w, E + I, !0, !0) : g.set(m + w, E + I, !1, !0));
1263
- }
1264
- }
1265
- function N(g) {
1266
- const C = g.size;
1267
- for (let y = 8; y < C - 8; y++) {
1268
- const l = y % 2 === 0;
1269
- g.set(y, 6, l, !0), g.set(6, y, l, !0);
1270
- }
1271
- }
1272
- function P(g, C) {
1273
- const y = t.getPositions(C);
1274
- for (let l = 0; l < y.length; l++) {
1275
- const A = y[l][0], m = y[l][1];
1276
- for (let E = -2; E <= 2; E++)
1277
- for (let w = -2; w <= 2; w++)
1278
- E === -2 || E === 2 || w === -2 || w === 2 || E === 0 && w === 0 ? g.set(A + E, m + w, !0, !0) : g.set(A + E, m + w, !1, !0);
1279
- }
1280
- }
1281
- function S(g, C) {
1282
- const y = g.size, l = c.getEncodedBits(C);
1283
- let A, m, E;
1284
- for (let w = 0; w < 18; w++)
1285
- A = Math.floor(w / 3), m = w % 3 + y - 8 - 3, E = (l >> w & 1) === 1, g.set(A, m, E, !0), g.set(m, A, E, !0);
1286
- }
1287
- function R(g, C, y) {
1288
- const l = g.size, A = d.getEncodedBits(C, y);
1289
- let m, E;
1290
- for (m = 0; m < 15; m++)
1291
- E = (A >> m & 1) === 1, m < 6 ? g.set(m, 8, E, !0) : m < 8 ? g.set(m + 1, 8, E, !0) : g.set(l - 15 + m, 8, E, !0), m < 8 ? g.set(8, l - m - 1, E, !0) : m < 9 ? g.set(8, 15 - m - 1 + 1, E, !0) : g.set(8, 15 - m - 1, E, !0);
1292
- g.set(l - 8, 8, 1, !0);
1293
- }
1294
- function M(g, C) {
1295
- const y = g.size;
1296
- let l = -1, A = y - 1, m = 7, E = 0;
1297
- for (let w = y - 1; w > 0; w -= 2)
1298
- for (w === 6 && w--; ; ) {
1299
- for (let I = 0; I < 2; I++)
1300
- if (!g.isReserved(A, w - I)) {
1301
- let v = !1;
1302
- E < C.length && (v = (C[E] >>> m & 1) === 1), g.set(A, w - I, v), m--, m === -1 && (E++, m = 7);
1303
- }
1304
- if (A += l, A < 0 || y <= A) {
1305
- A -= l, l = -l;
1306
- break;
1307
- }
1308
- }
1309
- }
1310
- function T(g, C, y) {
1311
- const l = new i();
1312
- y.forEach(function(I) {
1313
- l.put(I.mode.bit, 4), l.put(I.getLength(), p.getCharCountIndicator(I.mode, g)), I.write(l);
1314
- });
1315
- const A = r.getSymbolTotalCodewords(g), m = a.getTotalCodewordsCount(g, C), E = (A - m) * 8;
1316
- for (l.getLengthInBits() + 4 <= E && l.put(0, 4); l.getLengthInBits() % 8 !== 0; )
1317
- l.putBit(0);
1318
- const w = (E - l.getLengthInBits()) / 8;
1319
- for (let I = 0; I < w; I++)
1320
- l.put(I % 2 ? 17 : 236, 8);
1321
- return B(l, g, C);
1322
- }
1323
- function B(g, C, y) {
1324
- const l = r.getSymbolTotalCodewords(C), A = a.getTotalCodewordsCount(C, y), m = l - A, E = a.getBlocksCount(C, y), w = l % E, I = E - w, v = Math.floor(l / E), V = Math.floor(m / E), te = V + 1, Ct = v - V, ee = new u(Ct);
1325
- let O = 0;
1326
- const H = new Array(E), Et = new Array(E);
1327
- let j = 0;
1328
- const ne = new Uint8Array(g.buffer);
1329
- for (let k = 0; k < E; k++) {
1330
- const G = k < I ? V : te;
1331
- H[k] = ne.slice(O, O + G), Et[k] = ee.encode(H[k]), O += G, j = Math.max(j, G);
1332
- }
1333
- const Y = new Uint8Array(l);
1334
- let pt = 0, D, q;
1335
- for (D = 0; D < j; D++)
1336
- for (q = 0; q < E; q++)
1337
- D < H[q].length && (Y[pt++] = H[q][D]);
1338
- for (D = 0; D < Ct; D++)
1339
- for (q = 0; q < E; q++)
1340
- Y[pt++] = Et[q][D];
1341
- return Y;
1342
- }
1343
- function b(g, C, y, l) {
1344
- let A;
1345
- if (Array.isArray(g))
1346
- A = h.fromArray(g);
1347
- else if (typeof g == "string") {
1348
- let v = C;
1349
- if (!v) {
1350
- const V = h.rawSplit(g);
1351
- v = c.getBestVersionForData(V, y);
1352
- }
1353
- A = h.fromString(g, v || 40);
1354
- } else
1355
- throw new Error("Invalid data");
1356
- const m = c.getBestVersionForData(A, y);
1357
- if (!m)
1358
- throw new Error("The amount of data is too big to be stored in a QR Code");
1359
- if (!C)
1360
- C = m;
1361
- else if (C < m)
1362
- throw new Error(
1363
- `
1364
- The chosen QR Code version cannot contain this amount of data.
1365
- Minimum version required to store current data is: ` + m + `.
1366
- `
1367
- );
1368
- const E = T(C, y, A), w = r.getSymbolSize(C), I = new e(w);
1369
- return f(I, C), N(I), P(I, C), R(I, y, 0), C >= 7 && S(I, C), M(I, E), isNaN(l) && (l = s.getBestMask(
1370
- I,
1371
- R.bind(null, I, y)
1372
- )), s.applyMask(l, I), R(I, y, l), {
1373
- modules: I,
1374
- version: C,
1375
- errorCorrectionLevel: y,
1376
- maskPattern: l,
1377
- segments: A
1378
- };
1379
- }
1380
- return $.create = function(C, y) {
1381
- if (typeof C > "u" || C === "")
1382
- throw new Error("No input text");
1383
- let l = o.M, A, m;
1384
- return typeof y < "u" && (l = o.from(y.errorCorrectionLevel, o.M), A = c.from(y.version), m = s.from(y.maskPattern), y.toSJISFunc && r.setToSJISFunction(y.toSJISFunc)), b(C, A, l, m);
1385
- }, $;
1386
- }
1387
- var ht = {}, mt = {}, jt;
1388
- function Xt() {
1389
- return jt || (jt = 1, (function(r) {
1390
- function o(i) {
1391
- if (typeof i == "number" && (i = i.toString()), typeof i != "string")
1392
- throw new Error("Color should be defined as hex string");
1393
- let e = i.slice().replace("#", "").split("");
1394
- if (e.length < 3 || e.length === 5 || e.length > 8)
1395
- throw new Error("Invalid hex color: " + i);
1396
- (e.length === 3 || e.length === 4) && (e = Array.prototype.concat.apply([], e.map(function(n) {
1397
- return [n, n];
1398
- }))), e.length === 6 && e.push("F", "F");
1399
- const t = parseInt(e.join(""), 16);
1400
- return {
1401
- r: t >> 24 & 255,
1402
- g: t >> 16 & 255,
1403
- b: t >> 8 & 255,
1404
- a: t & 255,
1405
- hex: "#" + e.slice(0, 6).join("")
1406
- };
1407
- }
1408
- r.getOptions = function(e) {
1409
- e || (e = {}), e.color || (e.color = {});
1410
- const t = typeof e.margin > "u" || e.margin === null || e.margin < 0 ? 4 : e.margin, n = e.width && e.width >= 21 ? e.width : void 0, s = e.scale || 4;
1411
- return {
1412
- width: n,
1413
- scale: n ? 4 : s,
1414
- margin: t,
1415
- color: {
1416
- dark: o(e.color.dark || "#000000ff"),
1417
- light: o(e.color.light || "#ffffffff")
1418
- },
1419
- type: e.type,
1420
- rendererOpts: e.rendererOpts || {}
1421
- };
1422
- }, r.getScale = function(e, t) {
1423
- return t.width && t.width >= e + t.margin * 2 ? t.width / (e + t.margin * 2) : t.scale;
1424
- }, r.getImageWidth = function(e, t) {
1425
- const n = r.getScale(e, t);
1426
- return Math.floor((e + t.margin * 2) * n);
1427
- }, r.qrToImageData = function(e, t, n) {
1428
- const s = t.modules.size, a = t.modules.data, u = r.getScale(s, n), c = Math.floor((s + n.margin * 2) * u), d = n.margin * u, p = [n.color.light, n.color.dark];
1429
- for (let h = 0; h < c; h++)
1430
- for (let f = 0; f < c; f++) {
1431
- let N = (h * c + f) * 4, P = n.color.light;
1432
- if (h >= d && f >= d && h < c - d && f < c - d) {
1433
- const S = Math.floor((h - d) / u), R = Math.floor((f - d) / u);
1434
- P = p[a[S * s + R] ? 1 : 0];
1435
- }
1436
- e[N++] = P.r, e[N++] = P.g, e[N++] = P.b, e[N] = P.a;
1437
- }
1438
- };
1439
- })(mt)), mt;
1440
- }
1441
- var Yt;
1442
- function Re() {
1443
- return Yt || (Yt = 1, (function(r) {
1444
- const o = Xt();
1445
- function i(t, n, s) {
1446
- t.clearRect(0, 0, n.width, n.height), n.style || (n.style = {}), n.height = s, n.width = s, n.style.height = s + "px", n.style.width = s + "px";
1447
- }
1448
- function e() {
1449
- try {
1450
- return document.createElement("canvas");
1451
- } catch {
1452
- throw new Error("You need to specify a canvas element");
1453
- }
1454
- }
1455
- r.render = function(n, s, a) {
1456
- let u = a, c = s;
1457
- typeof u > "u" && (!s || !s.getContext) && (u = s, s = void 0), s || (c = e()), u = o.getOptions(u);
1458
- const d = o.getImageWidth(n.modules.size, u), p = c.getContext("2d"), h = p.createImageData(d, d);
1459
- return o.qrToImageData(h.data, n, u), i(p, c, d), p.putImageData(h, 0, 0), c;
1460
- }, r.renderToDataURL = function(n, s, a) {
1461
- let u = a;
1462
- typeof u > "u" && (!s || !s.getContext) && (u = s, s = void 0), u || (u = {});
1463
- const c = r.render(n, s, u), d = u.type || "image/png", p = u.rendererOpts || {};
1464
- return c.toDataURL(d, p.quality);
1465
- };
1466
- })(ht)), ht;
1467
- }
1468
- var wt = {}, Gt;
1469
- function Te() {
1470
- if (Gt) return wt;
1471
- Gt = 1;
1472
- const r = Xt();
1473
- function o(t, n) {
1474
- const s = t.a / 255, a = n + '="' + t.hex + '"';
1475
- return s < 1 ? a + " " + n + '-opacity="' + s.toFixed(2).slice(1) + '"' : a;
1476
- }
1477
- function i(t, n, s) {
1478
- let a = t + n;
1479
- return typeof s < "u" && (a += " " + s), a;
1480
- }
1481
- function e(t, n, s) {
1482
- let a = "", u = 0, c = !1, d = 0;
1483
- for (let p = 0; p < t.length; p++) {
1484
- const h = Math.floor(p % n), f = Math.floor(p / n);
1485
- !h && !c && (c = !0), t[p] ? (d++, p > 0 && h > 0 && t[p - 1] || (a += c ? i("M", h + s, 0.5 + f + s) : i("m", u, 0), u = 0, c = !1), h + 1 < n && t[p + 1] || (a += i("h", d), d = 0)) : u++;
1486
- }
1487
- return a;
1488
- }
1489
- return wt.render = function(n, s, a) {
1490
- const u = r.getOptions(s), c = n.modules.size, d = n.modules.data, p = c + u.margin * 2, h = u.color.light.a ? "<path " + o(u.color.light, "fill") + ' d="M0 0h' + p + "v" + p + 'H0z"/>' : "", f = "<path " + o(u.color.dark, "stroke") + ' d="' + e(d, c, u.margin) + '"/>', N = 'viewBox="0 0 ' + p + " " + p + '"', S = '<svg xmlns="http://www.w3.org/2000/svg" ' + (u.width ? 'width="' + u.width + '" height="' + u.width + '" ' : "") + N + ' shape-rendering="crispEdges">' + h + f + `</svg>
1491
- `;
1492
- return typeof a == "function" && a(null, S), S;
1493
- }, wt;
1494
- }
1495
- var Qt;
1496
- function Ie() {
1497
- if (Qt) return z;
1498
- Qt = 1;
1499
- const r = ie(), o = Ae(), i = Re(), e = Te();
1500
- function t(n, s, a, u, c) {
1501
- const d = [].slice.call(arguments, 1), p = d.length, h = typeof d[p - 1] == "function";
1502
- if (!h && !r())
1503
- throw new Error("Callback required as last argument");
1504
- if (h) {
1505
- if (p < 2)
1506
- throw new Error("Too few arguments provided");
1507
- p === 2 ? (c = a, a = s, s = u = void 0) : p === 3 && (s.getContext && typeof c > "u" ? (c = u, u = void 0) : (c = u, u = a, a = s, s = void 0));
1508
- } else {
1509
- if (p < 1)
1510
- throw new Error("Too few arguments provided");
1511
- return p === 1 ? (a = s, s = u = void 0) : p === 2 && !s.getContext && (u = a, a = s, s = void 0), new Promise(function(f, N) {
1512
- try {
1513
- const P = o.create(a, u);
1514
- f(n(P, s, u));
1515
- } catch (P) {
1516
- N(P);
1517
- }
1518
- });
1519
- }
1520
- try {
1521
- const f = o.create(a, u);
1522
- c(null, n(f, s, u));
1523
- } catch (f) {
1524
- c(f);
1525
- }
1526
- }
1527
- return z.create = o.create, z.toCanvas = t.bind(null, i.render), z.toDataURL = t.bind(null, i.renderToDataURL), z.toString = t.bind(null, function(n, s, a) {
1528
- return e.render(n, a);
1529
- }), z;
1530
- }
1531
- var xt = Ie();
1532
- const Ne = /* @__PURE__ */ re(xt), Me = /* @__PURE__ */ oe({
1533
- __proto__: null,
1534
- default: Ne
1535
- }, [xt]);
1536
- export {
1537
- Me as b
1538
- };