asterui 0.12.0 → 0.12.1

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 (160) hide show
  1. package/README.md +1 -1
  2. package/dist/components/Form.d.ts +27 -2
  3. package/dist/components/Radio.d.ts +7 -1
  4. package/dist/components/Status.d.ts +18 -0
  5. package/dist/index.d.ts +4 -2
  6. package/dist/index.js +61 -59
  7. package/dist/index.js.map +1 -1
  8. package/dist/index100.js +7 -12
  9. package/dist/index100.js.map +1 -1
  10. package/dist/index101.js +11 -29
  11. package/dist/index101.js.map +1 -1
  12. package/dist/index102.js +29 -16
  13. package/dist/index102.js.map +1 -1
  14. package/dist/index103.js +17 -10792
  15. package/dist/index103.js.map +1 -1
  16. package/dist/index104.js +10793 -5
  17. package/dist/index104.js.map +1 -1
  18. package/dist/index105.js +5 -42
  19. package/dist/index105.js.map +1 -1
  20. package/dist/index106.js +42 -2
  21. package/dist/index106.js.map +1 -1
  22. package/dist/index107.js +2 -7
  23. package/dist/index107.js.map +1 -1
  24. package/dist/index108.js +6 -151
  25. package/dist/index108.js.map +1 -1
  26. package/dist/index109.js +147 -25
  27. package/dist/index109.js.map +1 -1
  28. package/dist/index110.js +28 -28
  29. package/dist/index110.js.map +1 -1
  30. package/dist/index111.js +30 -2
  31. package/dist/index111.js.map +1 -1
  32. package/dist/index112.js +2 -72
  33. package/dist/index112.js.map +1 -1
  34. package/dist/index113.js +71 -38
  35. package/dist/index113.js.map +1 -1
  36. package/dist/index114.js +37 -24
  37. package/dist/index114.js.map +1 -1
  38. package/dist/index115.js +24 -19
  39. package/dist/index115.js.map +1 -1
  40. package/dist/index116.js +20 -23
  41. package/dist/index116.js.map +1 -1
  42. package/dist/index117.js +23 -19
  43. package/dist/index117.js.map +1 -1
  44. package/dist/index118.js +19 -99
  45. package/dist/index118.js.map +1 -1
  46. package/dist/index119.js +98 -358
  47. package/dist/index119.js.map +1 -1
  48. package/dist/index120.js +358 -23
  49. package/dist/index120.js.map +1 -1
  50. package/dist/index121.js +23 -71
  51. package/dist/index121.js.map +1 -1
  52. package/dist/index122.js +72 -15
  53. package/dist/index122.js.map +1 -1
  54. package/dist/index123.js +15 -65
  55. package/dist/index123.js.map +1 -1
  56. package/dist/index124.js +61 -139
  57. package/dist/index124.js.map +1 -1
  58. package/dist/index125.js +144 -2
  59. package/dist/index125.js.map +1 -1
  60. package/dist/index126.js +2 -56
  61. package/dist/index126.js.map +1 -1
  62. package/dist/index127.js +56 -2
  63. package/dist/index127.js.map +1 -1
  64. package/dist/index128.js +2 -2
  65. package/dist/index131.js +2 -2
  66. package/dist/index132.js +2 -2
  67. package/dist/index133.js +2 -2
  68. package/dist/index134.js +2 -2
  69. package/dist/index135.js +2 -32
  70. package/dist/index135.js.map +1 -1
  71. package/dist/index136.js +32 -2
  72. package/dist/index136.js.map +1 -1
  73. package/dist/index137.js +2 -8
  74. package/dist/index137.js.map +1 -1
  75. package/dist/index138.js +8 -2
  76. package/dist/index138.js.map +1 -1
  77. package/dist/index139.js +2 -2
  78. package/dist/index140.js +2 -21
  79. package/dist/index140.js.map +1 -1
  80. package/dist/index141.js +21 -2
  81. package/dist/index141.js.map +1 -1
  82. package/dist/index142.js +2 -24
  83. package/dist/index142.js.map +1 -1
  84. package/dist/index143.js +17 -64
  85. package/dist/index143.js.map +1 -1
  86. package/dist/index144.js +68 -18
  87. package/dist/index144.js.map +1 -1
  88. package/dist/index145.js +18 -31
  89. package/dist/index145.js.map +1 -1
  90. package/dist/index146.js +32 -68
  91. package/dist/index146.js.map +1 -1
  92. package/dist/index147.js +70 -2
  93. package/dist/index147.js.map +1 -1
  94. package/dist/index148.js +2 -22
  95. package/dist/index148.js.map +1 -1
  96. package/dist/index149.js +22 -2
  97. package/dist/index149.js.map +1 -1
  98. package/dist/index15.js +1 -1
  99. package/dist/index151.js +2 -2
  100. package/dist/index152.js +2 -2
  101. package/dist/index153.js +2 -4
  102. package/dist/index153.js.map +1 -1
  103. package/dist/index154.js +7 -0
  104. package/dist/index154.js.map +1 -0
  105. package/dist/index31.js +175 -116
  106. package/dist/index31.js.map +1 -1
  107. package/dist/index62.js +1 -1
  108. package/dist/index63.js +24 -24
  109. package/dist/index63.js.map +1 -1
  110. package/dist/index75.js +31 -22
  111. package/dist/index75.js.map +1 -1
  112. package/dist/index76.js +20 -327
  113. package/dist/index76.js.map +1 -1
  114. package/dist/index77.js +323 -50
  115. package/dist/index77.js.map +1 -1
  116. package/dist/index78.js +56 -40
  117. package/dist/index78.js.map +1 -1
  118. package/dist/index79.js +40 -23
  119. package/dist/index79.js.map +1 -1
  120. package/dist/index80.js +21 -93
  121. package/dist/index80.js.map +1 -1
  122. package/dist/index81.js +88 -123
  123. package/dist/index81.js.map +1 -1
  124. package/dist/index82.js +123 -154
  125. package/dist/index82.js.map +1 -1
  126. package/dist/index83.js +159 -63
  127. package/dist/index83.js.map +1 -1
  128. package/dist/index84.js +65 -35
  129. package/dist/index84.js.map +1 -1
  130. package/dist/index85.js +35 -234
  131. package/dist/index85.js.map +1 -1
  132. package/dist/index86.js +231 -31
  133. package/dist/index86.js.map +1 -1
  134. package/dist/index87.js +34 -210
  135. package/dist/index87.js.map +1 -1
  136. package/dist/index88.js +195 -198
  137. package/dist/index88.js.map +1 -1
  138. package/dist/index89.js +159 -241
  139. package/dist/index89.js.map +1 -1
  140. package/dist/index90.js +283 -166
  141. package/dist/index90.js.map +1 -1
  142. package/dist/index91.js +173 -253
  143. package/dist/index91.js.map +1 -1
  144. package/dist/index92.js +258 -14
  145. package/dist/index92.js.map +1 -1
  146. package/dist/index93.js +12 -31
  147. package/dist/index93.js.map +1 -1
  148. package/dist/index94.js +32 -5
  149. package/dist/index94.js.map +1 -1
  150. package/dist/index95.js +5 -13
  151. package/dist/index95.js.map +1 -1
  152. package/dist/index96.js +11 -43
  153. package/dist/index96.js.map +1 -1
  154. package/dist/index97.js +44 -11
  155. package/dist/index97.js.map +1 -1
  156. package/dist/index98.js +10 -12
  157. package/dist/index98.js.map +1 -1
  158. package/dist/index99.js +14 -7
  159. package/dist/index99.js.map +1 -1
  160. package/package.json +1 -1
package/dist/index105.js CHANGED
@@ -1,45 +1,8 @@
1
- import { __exports as u } from "./index106.js";
2
- import { __require as C } from "./index107.js";
3
- import { __require as h } from "./index108.js";
4
- import { __require as R } from "./index109.js";
5
- import { __require as y } from "./index110.js";
6
- var _;
7
- function B() {
8
- if (_) return u;
9
- _ = 1;
10
- const q = C(), f = h(), l = R(), w = y();
11
- function a(d, e, r, n, o) {
12
- const m = [].slice.call(arguments, 1), i = m.length, g = typeof m[i - 1] == "function";
13
- if (!g && !q())
14
- throw new Error("Callback required as last argument");
15
- if (g) {
16
- if (i < 2)
17
- throw new Error("Too few arguments provided");
18
- i === 2 ? (o = r, r = e, e = n = void 0) : i === 3 && (e.getContext && typeof o > "u" ? (o = n, n = void 0) : (o = n, n = r, r = e, e = void 0));
19
- } else {
20
- if (i < 1)
21
- throw new Error("Too few arguments provided");
22
- return i === 1 ? (r = e, e = n = void 0) : i === 2 && !e.getContext && (n = r, r = e, e = void 0), new Promise(function(t, c) {
23
- try {
24
- const s = f.create(r, n);
25
- t(d(s, e, n));
26
- } catch (s) {
27
- c(s);
28
- }
29
- });
30
- }
31
- try {
32
- const t = f.create(r, n);
33
- o(null, d(t, e, n));
34
- } catch (t) {
35
- o(t);
36
- }
37
- }
38
- return u.create = f.create, u.toCanvas = a.bind(null, l.render), u.toDataURL = a.bind(null, l.renderToDataURL), u.toString = a.bind(null, function(d, e, r) {
39
- return w.render(d, r);
40
- }), u;
41
- }
1
+ import { getDefaultExportFromCjs as r } from "./index154.js";
2
+ import { __require as o } from "./index106.js";
3
+ var e = o();
4
+ const a = /* @__PURE__ */ r(e);
42
5
  export {
43
- B as __require
6
+ a as default
44
7
  };
45
8
  //# sourceMappingURL=index105.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index105.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/browser.js"],"sourcesContent":["\nconst canPromise = require('./can-promise')\n\nconst QRCode = require('./core/qrcode')\nconst CanvasRenderer = require('./renderer/canvas')\nconst SvgRenderer = require('./renderer/svg-tag.js')\n\nfunction renderCanvas (renderFunc, canvas, text, opts, cb) {\n const args = [].slice.call(arguments, 1)\n const argsNum = args.length\n const isLastArgCb = typeof args[argsNum - 1] === 'function'\n\n if (!isLastArgCb && !canPromise()) {\n throw new Error('Callback required as last argument')\n }\n\n if (isLastArgCb) {\n if (argsNum < 2) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 2) {\n cb = text\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 3) {\n if (canvas.getContext && typeof cb === 'undefined') {\n cb = opts\n opts = undefined\n } else {\n cb = opts\n opts = text\n text = canvas\n canvas = undefined\n }\n }\n } else {\n if (argsNum < 1) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 1) {\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 2 && !canvas.getContext) {\n opts = text\n text = canvas\n canvas = undefined\n }\n\n return new Promise(function (resolve, reject) {\n try {\n const data = QRCode.create(text, opts)\n resolve(renderFunc(data, canvas, opts))\n } catch (e) {\n reject(e)\n }\n })\n }\n\n try {\n const data = QRCode.create(text, opts)\n cb(null, renderFunc(data, canvas, opts))\n } catch (e) {\n cb(e)\n }\n}\n\nexports.create = QRCode.create\nexports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)\nexports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)\n\n// only svg for now.\nexports.toString = renderCanvas.bind(null, function (data, _, opts) {\n return SvgRenderer.render(data, opts)\n})\n"],"names":["canPromise","require$$0","QRCode","require$$1","CanvasRenderer","require$$2","SvgRenderer","require$$3","renderCanvas","renderFunc","canvas","text","opts","cb","args","argsNum","isLastArgCb","resolve","reject","data","e","browser","_"],"mappings":";;;;;;;;;AACA,QAAMA,IAAaC,EAAA,GAEbC,IAASC,EAAA,GACTC,IAAiBC,EAAA,GACjBC,IAAcC,EAAA;AAEpB,WAASC,EAAcC,GAAYC,GAAQC,GAAMC,GAAMC,GAAI;AACzD,UAAMC,IAAO,CAAA,EAAG,MAAM,KAAK,WAAW,CAAC,GACjCC,IAAUD,EAAK,QACfE,IAAc,OAAOF,EAAKC,IAAU,CAAC,KAAM;AAEjD,QAAI,CAACC,KAAe,CAAChB;AACnB,YAAM,IAAI,MAAM,oCAAoC;AAGtD,QAAIgB,GAAa;AACf,UAAID,IAAU;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAG9C,MAAIA,MAAY,KACdF,IAAKF,GACLA,IAAOD,GACPA,IAASE,IAAO,UACPG,MAAY,MACjBL,EAAO,cAAc,OAAOG,IAAO,OACrCA,IAAKD,GACLA,IAAO,WAEPC,IAAKD,GACLA,IAAOD,GACPA,IAAOD,GACPA,IAAS;AAAA,IAGjB,OAAS;AACL,UAAIK,IAAU;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAG9C,aAAIA,MAAY,KACdJ,IAAOD,GACPA,IAASE,IAAO,UACPG,MAAY,KAAK,CAACL,EAAO,eAClCE,IAAOD,GACPA,IAAOD,GACPA,IAAS,SAGJ,IAAI,QAAQ,SAAUO,GAASC,GAAQ;AAC5C,YAAI;AACF,gBAAMC,IAAOjB,EAAO,OAAOS,GAAMC,CAAI;AACrC,UAAAK,EAAQR,EAAWU,GAAMT,GAAQE,CAAI,CAAC;AAAA,QAC9C,SAAeQ,GAAG;AACV,UAAAF,EAAOE,CAAC;AAAA,QAChB;AAAA,MACA,CAAK;AAAA,IACL;AAEE,QAAI;AACF,YAAMD,IAAOjB,EAAO,OAAOS,GAAMC,CAAI;AACrC,MAAAC,EAAG,MAAMJ,EAAWU,GAAMT,GAAQE,CAAI,CAAC;AAAA,IAC3C,SAAWQ,GAAG;AACV,MAAAP,EAAGO,CAAC;AAAA,IACR;AAAA,EACA;AAEA,SAAAC,EAAA,SAAiBnB,EAAO,QACxBmB,EAAA,WAAmBb,EAAa,KAAK,MAAMJ,EAAe,MAAM,GAChEiB,EAAA,YAAoBb,EAAa,KAAK,MAAMJ,EAAe,eAAe,GAG1EiB,EAAA,WAAmBb,EAAa,KAAK,MAAM,SAAUW,GAAMG,GAAGV,GAAM;AAClE,WAAON,EAAY,OAAOa,GAAMP,CAAI;AAAA,EACtC,CAAC;;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index105.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}
package/dist/index106.js CHANGED
@@ -1,5 +1,45 @@
1
- var r = {};
1
+ import { __exports as u } from "./index107.js";
2
+ import { __require as C } from "./index108.js";
3
+ import { __require as h } from "./index109.js";
4
+ import { __require as R } from "./index110.js";
5
+ import { __require as y } from "./index111.js";
6
+ var _;
7
+ function B() {
8
+ if (_) return u;
9
+ _ = 1;
10
+ const q = C(), f = h(), l = R(), w = y();
11
+ function a(d, e, r, n, o) {
12
+ const m = [].slice.call(arguments, 1), i = m.length, g = typeof m[i - 1] == "function";
13
+ if (!g && !q())
14
+ throw new Error("Callback required as last argument");
15
+ if (g) {
16
+ if (i < 2)
17
+ throw new Error("Too few arguments provided");
18
+ i === 2 ? (o = r, r = e, e = n = void 0) : i === 3 && (e.getContext && typeof o > "u" ? (o = n, n = void 0) : (o = n, n = r, r = e, e = void 0));
19
+ } else {
20
+ if (i < 1)
21
+ throw new Error("Too few arguments provided");
22
+ return i === 1 ? (r = e, e = n = void 0) : i === 2 && !e.getContext && (n = r, r = e, e = void 0), new Promise(function(t, c) {
23
+ try {
24
+ const s = f.create(r, n);
25
+ t(d(s, e, n));
26
+ } catch (s) {
27
+ c(s);
28
+ }
29
+ });
30
+ }
31
+ try {
32
+ const t = f.create(r, n);
33
+ o(null, d(t, e, n));
34
+ } catch (t) {
35
+ o(t);
36
+ }
37
+ }
38
+ return u.create = f.create, u.toCanvas = a.bind(null, l.render), u.toDataURL = a.bind(null, l.renderToDataURL), u.toString = a.bind(null, function(d, e, r) {
39
+ return w.render(d, r);
40
+ }), u;
41
+ }
2
42
  export {
3
- r as __exports
43
+ B as __require
4
44
  };
5
45
  //# sourceMappingURL=index106.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index106.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
1
+ {"version":3,"file":"index106.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/browser.js"],"sourcesContent":["\nconst canPromise = require('./can-promise')\n\nconst QRCode = require('./core/qrcode')\nconst CanvasRenderer = require('./renderer/canvas')\nconst SvgRenderer = require('./renderer/svg-tag.js')\n\nfunction renderCanvas (renderFunc, canvas, text, opts, cb) {\n const args = [].slice.call(arguments, 1)\n const argsNum = args.length\n const isLastArgCb = typeof args[argsNum - 1] === 'function'\n\n if (!isLastArgCb && !canPromise()) {\n throw new Error('Callback required as last argument')\n }\n\n if (isLastArgCb) {\n if (argsNum < 2) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 2) {\n cb = text\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 3) {\n if (canvas.getContext && typeof cb === 'undefined') {\n cb = opts\n opts = undefined\n } else {\n cb = opts\n opts = text\n text = canvas\n canvas = undefined\n }\n }\n } else {\n if (argsNum < 1) {\n throw new Error('Too few arguments provided')\n }\n\n if (argsNum === 1) {\n text = canvas\n canvas = opts = undefined\n } else if (argsNum === 2 && !canvas.getContext) {\n opts = text\n text = canvas\n canvas = undefined\n }\n\n return new Promise(function (resolve, reject) {\n try {\n const data = QRCode.create(text, opts)\n resolve(renderFunc(data, canvas, opts))\n } catch (e) {\n reject(e)\n }\n })\n }\n\n try {\n const data = QRCode.create(text, opts)\n cb(null, renderFunc(data, canvas, opts))\n } catch (e) {\n cb(e)\n }\n}\n\nexports.create = QRCode.create\nexports.toCanvas = renderCanvas.bind(null, CanvasRenderer.render)\nexports.toDataURL = renderCanvas.bind(null, CanvasRenderer.renderToDataURL)\n\n// only svg for now.\nexports.toString = renderCanvas.bind(null, function (data, _, opts) {\n return SvgRenderer.render(data, opts)\n})\n"],"names":["canPromise","require$$0","QRCode","require$$1","CanvasRenderer","require$$2","SvgRenderer","require$$3","renderCanvas","renderFunc","canvas","text","opts","cb","args","argsNum","isLastArgCb","resolve","reject","data","e","browser","_"],"mappings":";;;;;;;;;AACA,QAAMA,IAAaC,EAAA,GAEbC,IAASC,EAAA,GACTC,IAAiBC,EAAA,GACjBC,IAAcC,EAAA;AAEpB,WAASC,EAAcC,GAAYC,GAAQC,GAAMC,GAAMC,GAAI;AACzD,UAAMC,IAAO,CAAA,EAAG,MAAM,KAAK,WAAW,CAAC,GACjCC,IAAUD,EAAK,QACfE,IAAc,OAAOF,EAAKC,IAAU,CAAC,KAAM;AAEjD,QAAI,CAACC,KAAe,CAAChB;AACnB,YAAM,IAAI,MAAM,oCAAoC;AAGtD,QAAIgB,GAAa;AACf,UAAID,IAAU;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAG9C,MAAIA,MAAY,KACdF,IAAKF,GACLA,IAAOD,GACPA,IAASE,IAAO,UACPG,MAAY,MACjBL,EAAO,cAAc,OAAOG,IAAO,OACrCA,IAAKD,GACLA,IAAO,WAEPC,IAAKD,GACLA,IAAOD,GACPA,IAAOD,GACPA,IAAS;AAAA,IAGjB,OAAS;AACL,UAAIK,IAAU;AACZ,cAAM,IAAI,MAAM,4BAA4B;AAG9C,aAAIA,MAAY,KACdJ,IAAOD,GACPA,IAASE,IAAO,UACPG,MAAY,KAAK,CAACL,EAAO,eAClCE,IAAOD,GACPA,IAAOD,GACPA,IAAS,SAGJ,IAAI,QAAQ,SAAUO,GAASC,GAAQ;AAC5C,YAAI;AACF,gBAAMC,IAAOjB,EAAO,OAAOS,GAAMC,CAAI;AACrC,UAAAK,EAAQR,EAAWU,GAAMT,GAAQE,CAAI,CAAC;AAAA,QAC9C,SAAeQ,GAAG;AACV,UAAAF,EAAOE,CAAC;AAAA,QAChB;AAAA,MACA,CAAK;AAAA,IACL;AAEE,QAAI;AACF,YAAMD,IAAOjB,EAAO,OAAOS,GAAMC,CAAI;AACrC,MAAAC,EAAG,MAAMJ,EAAWU,GAAMT,GAAQE,CAAI,CAAC;AAAA,IAC3C,SAAWQ,GAAG;AACV,MAAAP,EAAGO,CAAC;AAAA,IACR;AAAA,EACA;AAEA,SAAAC,EAAA,SAAiBnB,EAAO,QACxBmB,EAAA,WAAmBb,EAAa,KAAK,MAAMJ,EAAe,MAAM,GAChEiB,EAAA,YAAoBb,EAAa,KAAK,MAAMJ,EAAe,eAAe,GAG1EiB,EAAA,WAAmBb,EAAa,KAAK,MAAM,SAAUW,GAAMG,GAAGV,GAAM;AAClE,WAAON,EAAY,OAAOa,GAAMP,CAAI;AAAA,EACtC,CAAC;;","x_google_ignoreList":[0]}
package/dist/index107.js CHANGED
@@ -1,10 +1,5 @@
1
- var r, e;
2
- function o() {
3
- return e || (e = 1, r = function() {
4
- return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
5
- }), r;
6
- }
1
+ var r = {};
7
2
  export {
8
- o as __require
3
+ r as __exports
9
4
  };
10
5
  //# sourceMappingURL=index107.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index107.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js"],"sourcesContent":["// can-promise has a crash in some versions of react native that dont have\n// standard global objects\n// https://github.com/soldair/node-qrcode/issues/157\n\nmodule.exports = function () {\n return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then\n}\n"],"names":["canPromise"],"mappings":";;sBAIAA,IAAiB,WAAY;AAC3B,WAAO,OAAO,WAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AAAA,EACjF;;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index107.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
package/dist/index108.js CHANGED
@@ -1,155 +1,10 @@
1
- import { __exports as M } from "./index111.js";
2
- import { __require as Y } from "./index112.js";
3
- import { __require as Z } from "./index113.js";
4
- import { __require as $ } from "./index114.js";
5
- import { __require as x } from "./index115.js";
6
- import { __require as v } from "./index116.js";
7
- import { __require as ee } from "./index117.js";
8
- import { __require as te } from "./index118.js";
9
- import { __require as oe } from "./index119.js";
10
- import { __require as re } from "./index120.js";
11
- import { __require as ne } from "./index121.js";
12
- import { __require as se } from "./index122.js";
13
- import { __require as ie } from "./index123.js";
14
- import { __require as ue } from "./index124.js";
15
- var F;
16
- function Be() {
17
- if (F) return M;
18
- F = 1;
19
- const g = Y(), q = Z(), A = $(), k = x(), P = v(), D = ee(), _ = te(), h = oe(), V = re(), w = ne(), R = se(), G = ie(), C = ue();
20
- function Q(r, u) {
21
- const n = r.size, e = D.getPositions(u);
22
- for (let c = 0; c < e.length; c++) {
23
- const t = e[c][0], o = e[c][1];
24
- for (let i = -1; i <= 7; i++)
25
- if (!(t + i <= -1 || n <= t + i))
26
- for (let s = -1; s <= 7; s++)
27
- o + s <= -1 || n <= o + s || (i >= 0 && i <= 6 && (s === 0 || s === 6) || s >= 0 && s <= 6 && (i === 0 || i === 6) || i >= 2 && i <= 4 && s >= 2 && s <= 4 ? r.set(t + i, o + s, !0, !0) : r.set(t + i, o + s, !1, !0));
28
- }
29
- }
30
- function U(r) {
31
- const u = r.size;
32
- for (let n = 8; n < u - 8; n++) {
33
- const e = n % 2 === 0;
34
- r.set(n, 6, e, !0), r.set(6, n, e, !0);
35
- }
36
- }
37
- function J(r, u) {
38
- const n = P.getPositions(u);
39
- for (let e = 0; e < n.length; e++) {
40
- const c = n[e][0], t = n[e][1];
41
- for (let o = -2; o <= 2; o++)
42
- for (let i = -2; i <= 2; i++)
43
- o === -2 || o === 2 || i === -2 || i === 2 || o === 0 && i === 0 ? r.set(c + o, t + i, !0, !0) : r.set(c + o, t + i, !1, !0);
44
- }
45
- }
46
- function N(r, u) {
47
- const n = r.size, e = w.getEncodedBits(u);
48
- let c, t, o;
49
- for (let i = 0; i < 18; i++)
50
- c = Math.floor(i / 3), t = i % 3 + n - 8 - 3, o = (e >> i & 1) === 1, r.set(c, t, o, !0), r.set(t, c, o, !0);
51
- }
52
- function b(r, u, n) {
53
- const e = r.size, c = R.getEncodedBits(u, n);
54
- let t, o;
55
- for (t = 0; t < 15; t++)
56
- o = (c >> t & 1) === 1, t < 6 ? r.set(t, 8, o, !0) : t < 8 ? r.set(t + 1, 8, o, !0) : r.set(e - 15 + t, 8, o, !0), t < 8 ? r.set(8, e - t - 1, o, !0) : t < 9 ? r.set(8, 15 - t - 1 + 1, o, !0) : r.set(8, 15 - t - 1, o, !0);
57
- r.set(e - 8, 8, 1, !0);
58
- }
59
- function L(r, u) {
60
- const n = r.size;
61
- let e = -1, c = n - 1, t = 7, o = 0;
62
- for (let i = n - 1; i > 0; i -= 2)
63
- for (i === 6 && i--; ; ) {
64
- for (let s = 0; s < 2; s++)
65
- if (!r.isReserved(c, i - s)) {
66
- let a = !1;
67
- o < u.length && (a = (u[o] >>> t & 1) === 1), r.set(c, i - s, a), t--, t === -1 && (o++, t = 7);
68
- }
69
- if (c += e, c < 0 || n <= c) {
70
- c -= e, e = -e;
71
- break;
72
- }
73
- }
74
- }
75
- function j(r, u, n) {
76
- const e = new A();
77
- n.forEach(function(s) {
78
- e.put(s.mode.bit, 4), e.put(s.getLength(), G.getCharCountIndicator(s.mode, r)), s.write(e);
79
- });
80
- const c = g.getSymbolTotalCodewords(r), t = h.getTotalCodewordsCount(r, u), o = (c - t) * 8;
81
- for (e.getLengthInBits() + 4 <= o && e.put(0, 4); e.getLengthInBits() % 8 !== 0; )
82
- e.putBit(0);
83
- const i = (o - e.getLengthInBits()) / 8;
84
- for (let s = 0; s < i; s++)
85
- e.put(s % 2 ? 17 : 236, 8);
86
- return H(e, r, u);
87
- }
88
- function H(r, u, n) {
89
- const e = g.getSymbolTotalCodewords(u), c = h.getTotalCodewordsCount(u, n), t = e - c, o = h.getBlocksCount(u, n), i = e % o, s = o - i, a = Math.floor(e / o), m = Math.floor(t / o), O = m + 1, E = a - m, W = new V(E);
90
- let B = 0;
91
- const p = new Array(o), z = new Array(o);
92
- let S = 0;
93
- const X = new Uint8Array(r.buffer);
94
- for (let d = 0; d < o; d++) {
95
- const y = d < s ? m : O;
96
- p[d] = X.slice(B, B + y), z[d] = W.encode(p[d]), B += y, S = Math.max(S, y);
97
- }
98
- const I = new Uint8Array(e);
99
- let T = 0, f, l;
100
- for (f = 0; f < S; f++)
101
- for (l = 0; l < o; l++)
102
- f < p[l].length && (I[T++] = p[l][f]);
103
- for (f = 0; f < E; f++)
104
- for (l = 0; l < o; l++)
105
- I[T++] = z[l][f];
106
- return I;
107
- }
108
- function K(r, u, n, e) {
109
- let c;
110
- if (Array.isArray(r))
111
- c = C.fromArray(r);
112
- else if (typeof r == "string") {
113
- let a = u;
114
- if (!a) {
115
- const m = C.rawSplit(r);
116
- a = w.getBestVersionForData(m, n);
117
- }
118
- c = C.fromString(r, a || 40);
119
- } else
120
- throw new Error("Invalid data");
121
- const t = w.getBestVersionForData(c, n);
122
- if (!t)
123
- throw new Error("The amount of data is too big to be stored in a QR Code");
124
- if (!u)
125
- u = t;
126
- else if (u < t)
127
- throw new Error(
128
- `
129
- The chosen QR Code version cannot contain this amount of data.
130
- Minimum version required to store current data is: ` + t + `.
131
- `
132
- );
133
- const o = j(u, n, c), i = g.getSymbolSize(u), s = new k(i);
134
- return Q(s, u), U(s), J(s, u), b(s, n, 0), u >= 7 && N(s, u), L(s, o), isNaN(e) && (e = _.getBestMask(
135
- s,
136
- b.bind(null, s, n)
137
- )), _.applyMask(e, s), b(s, n, e), {
138
- modules: s,
139
- version: u,
140
- errorCorrectionLevel: n,
141
- maskPattern: e,
142
- segments: c
143
- };
144
- }
145
- return M.create = function(u, n) {
146
- if (typeof u > "u" || u === "")
147
- throw new Error("No input text");
148
- let e = q.M, c, t;
149
- return typeof n < "u" && (e = q.from(n.errorCorrectionLevel, q.M), c = w.from(n.version), t = _.from(n.maskPattern), n.toSJISFunc && g.setToSJISFunction(n.toSJISFunc)), K(u, c, e, t);
150
- }, M;
1
+ var r, e;
2
+ function o() {
3
+ return e || (e = 1, r = function() {
4
+ return typeof Promise == "function" && Promise.prototype && Promise.prototype.then;
5
+ }), r;
151
6
  }
152
7
  export {
153
- Be as __require
8
+ o as __require
154
9
  };
155
10
  //# sourceMappingURL=index108.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index108.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n const size = matrix.size\n const pos = FinderPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (let c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n const size = matrix.size\n\n for (let r = 8; r < size - 8; r++) {\n const value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n const pos = AlignmentPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -2; r <= 2; r++) {\n for (let c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n const size = matrix.size\n const bits = Version.getEncodedBits(version)\n let row, col, mod\n\n for (let i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n const size = matrix.size\n const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n let i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Uint8Array} data Data codewords\n */\nfunction setupData (matrix, data) {\n const size = matrix.size\n let inc = -1\n let row = size - 1\n let bitIndex = 7\n let byteIndex = 0\n\n for (let col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (let c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n let dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n const buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (let i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n const blocksInGroup2 = totalCodewords % ecTotalBlocks\n const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n const rs = new ReedSolomonEncoder(ecCount)\n\n let offset = 0\n const dcData = new Array(ecTotalBlocks)\n const ecData = new Array(ecTotalBlocks)\n let maxDataSize = 0\n const buffer = new Uint8Array(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (let b = 0; b < ecTotalBlocks; b++) {\n const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n const data = new Uint8Array(totalCodewords)\n let index = 0\n let i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n let segments\n\n if (Array.isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n let estimatedVersion = version\n\n if (!estimatedVersion) {\n const rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n const dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n const moduleCount = Utils.getSymbolSize(version)\n const modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (isNaN(maskPattern)) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n let errorCorrectionLevel = ECLevel.M\n let version\n let mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["Utils","require$$0","ECLevel","require$$1","BitBuffer","require$$2","BitMatrix","require$$3","AlignmentPattern","require$$4","FinderPattern","require$$5","MaskPattern","require$$6","ECCode","require$$7","ReedSolomonEncoder","require$$8","Version","require$$9","FormatInfo","require$$10","Mode","require$$11","Segments","require$$12","setupFinderPattern","matrix","version","size","pos","i","row","col","r","c","setupTimingPattern","value","setupAlignmentPattern","setupVersionInfo","bits","mod","setupFormatInfo","errorCorrectionLevel","maskPattern","setupData","data","inc","bitIndex","byteIndex","dark","createData","segments","buffer","totalCodewords","ecTotalCodewords","dataTotalCodewordsBits","remainingByte","createCodewords","bitBuffer","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","offset","dcData","ecData","maxDataSize","b","dataSize","index","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","qrcode","options","mask"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,QAAMA,IAAQC,EAAA,GACRC,IAAUC,EAAA,GACVC,IAAYC,EAAA,GACZC,IAAYC,EAAA,GACZC,IAAmBC,EAAA,GACnBC,IAAgBC,GAAA,GAChBC,IAAcC,GAAA,GACdC,IAASC,GAAA,GACTC,IAAqBC,GAAA,GACrBC,IAAUC,GAAA,GACVC,IAAaC,GAAA,GACbC,IAAOC,GAAA,GACPC,IAAWC,GAAA;AAkCjB,WAASC,EAAoBC,GAAQC,GAAS;AAC5C,UAAMC,IAAOF,EAAO,MACdG,IAAMpB,EAAc,aAAakB,CAAO;AAE9C,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAI,EAAAF,IAAME,KAAK,MAAML,KAAQG,IAAME;AAEnC,mBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAIF,IAAME,KAAK,MAAMN,KAAQI,IAAME,MAE9BD,KAAK,KAAKA,KAAK,MAAMC,MAAM,KAAKA,MAAM,MACxCA,KAAK,KAAKA,KAAK,MAAMD,MAAM,KAAKA,MAAM,MACtCA,KAAK,KAAKA,KAAK,KAAKC,KAAK,KAAKA,KAAK,IACpCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AASA,WAASC,EAAoBT,GAAQ;AACnC,UAAME,IAAOF,EAAO;AAEpB,aAASO,IAAI,GAAGA,IAAIL,IAAO,GAAGK,KAAK;AACjC,YAAMG,IAAQH,IAAI,MAAM;AACxB,MAAAP,EAAO,IAAIO,GAAG,GAAGG,GAAO,EAAI,GAC5BV,EAAO,IAAI,GAAGO,GAAGG,GAAO,EAAI;AAAA,IAChC;AAAA,EACA;AAUA,WAASC,EAAuBX,GAAQC,GAAS;AAC/C,UAAME,IAAMtB,EAAiB,aAAaoB,CAAO;AAEjD,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,iBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,UAAID,MAAM,MAAMA,MAAM,KAAKC,MAAM,MAAMA,MAAM,KAC1CD,MAAM,KAAKC,MAAM,IAClBR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AAQA,WAASI,EAAkBZ,GAAQC,GAAS;AAC1C,UAAMC,IAAOF,EAAO,MACda,IAAOtB,EAAQ,eAAeU,CAAO;AAC3C,QAAII,GAAKC,GAAKQ;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI;AACtB,MAAAT,IAAM,KAAK,MAAM,IAAI,CAAC,GACtBC,IAAM,IAAI,IAAIJ,IAAO,IAAI,GACzBY,KAAQD,KAAQ,IAAK,OAAO,GAE5Bb,EAAO,IAAIK,GAAKC,GAAKQ,GAAK,EAAI,GAC9Bd,EAAO,IAAIM,GAAKD,GAAKS,GAAK,EAAI;AAAA,EAElC;AASA,WAASC,EAAiBf,GAAQgB,GAAsBC,GAAa;AACnE,UAAMf,IAAOF,EAAO,MACda,IAAOpB,EAAW,eAAeuB,GAAsBC,CAAW;AACxE,QAAIb,GAAGU;AAEP,SAAKV,IAAI,GAAGA,IAAI,IAAIA;AAClB,MAAAU,KAAQD,KAAQT,IAAK,OAAO,GAGxBA,IAAI,IACNJ,EAAO,IAAII,GAAG,GAAGU,GAAK,EAAI,IACjBV,IAAI,IACbJ,EAAO,IAAII,IAAI,GAAG,GAAGU,GAAK,EAAI,IAE9Bd,EAAO,IAAIE,IAAO,KAAKE,GAAG,GAAGU,GAAK,EAAI,GAIpCV,IAAI,IACNJ,EAAO,IAAI,GAAGE,IAAOE,IAAI,GAAGU,GAAK,EAAI,IAC5BV,IAAI,IACbJ,EAAO,IAAI,GAAG,KAAKI,IAAI,IAAI,GAAGU,GAAK,EAAI,IAEvCd,EAAO,IAAI,GAAG,KAAKI,IAAI,GAAGU,GAAK,EAAI;AAKvC,IAAAd,EAAO,IAAIE,IAAO,GAAG,GAAG,GAAG,EAAI;AAAA,EACjC;AAQA,WAASgB,EAAWlB,GAAQmB,GAAM;AAChC,UAAMjB,IAAOF,EAAO;AACpB,QAAIoB,IAAM,IACNf,IAAMH,IAAO,GACbmB,IAAW,GACXC,IAAY;AAEhB,aAAShB,IAAMJ,IAAO,GAAGI,IAAM,GAAGA,KAAO;AAGvC,WAFIA,MAAQ,KAAGA,SAEF;AACX,iBAASE,IAAI,GAAGA,IAAI,GAAGA;AACrB,cAAI,CAACR,EAAO,WAAWK,GAAKC,IAAME,CAAC,GAAG;AACpC,gBAAIe,IAAO;AAEX,YAAID,IAAYH,EAAK,WACnBI,KAAUJ,EAAKG,CAAS,MAAMD,IAAY,OAAO,IAGnDrB,EAAO,IAAIK,GAAKC,IAAME,GAAGe,CAAI,GAC7BF,KAEIA,MAAa,OACfC,KACAD,IAAW;AAAA,UAEvB;AAKM,YAFAhB,KAAOe,GAEHf,IAAM,KAAKH,KAAQG,GAAK;AAC1B,UAAAA,KAAOe,GACPA,IAAM,CAACA;AACP;AAAA,QACR;AAAA,MACA;AAAA,EAEA;AAUA,WAASI,EAAYvB,GAASe,GAAsBS,GAAU;AAE5D,UAAMC,IAAS,IAAIjD,EAAS;AAE5B,IAAAgD,EAAS,QAAQ,SAAUN,GAAM;AAE/B,MAAAO,EAAO,IAAIP,EAAK,KAAK,KAAK,CAAC,GAS3BO,EAAO,IAAIP,EAAK,UAAS,GAAIxB,EAAK,sBAAsBwB,EAAK,MAAMlB,CAAO,CAAC,GAG3EkB,EAAK,MAAMO,CAAM;AAAA,IACrB,CAAG;AAGD,UAAMC,IAAiBtD,EAAM,wBAAwB4B,CAAO,GACtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAC9Ea,KAA0BF,IAAiBC,KAAoB;AAgBrE,SATIF,EAAO,oBAAoB,KAAKG,KAClCH,EAAO,IAAI,GAAG,CAAC,GAQVA,EAAO,oBAAoB,MAAM;AACtC,MAAAA,EAAO,OAAO,CAAC;AAOjB,UAAMI,KAAiBD,IAAyBH,EAAO,gBAAe,KAAM;AAC5E,aAAStB,IAAI,GAAGA,IAAI0B,GAAe1B;AACjC,MAAAsB,EAAO,IAAItB,IAAI,IAAI,KAAO,KAAM,CAAC;AAGnC,WAAO2B,EAAgBL,GAAQzB,GAASe,CAAoB;AAAA,EAC9D;AAWA,WAASe,EAAiBC,GAAW/B,GAASe,GAAsB;AAElE,UAAMW,IAAiBtD,EAAM,wBAAwB4B,CAAO,GAGtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAG9EiB,IAAqBN,IAAiBC,GAGtCM,IAAgB/C,EAAO,eAAec,GAASe,CAAoB,GAGnEmB,IAAiBR,IAAiBO,GAClCE,IAAiBF,IAAgBC,GAEjCE,IAAyB,KAAK,MAAMV,IAAiBO,CAAa,GAElEI,IAAwB,KAAK,MAAML,IAAqBC,CAAa,GACrEK,IAAwBD,IAAwB,GAGhDE,IAAUH,IAAyBC,GAGnCG,IAAK,IAAIpD,EAAmBmD,CAAO;AAEzC,QAAIE,IAAS;AACb,UAAMC,IAAS,IAAI,MAAMT,CAAa,GAChCU,IAAS,IAAI,MAAMV,CAAa;AACtC,QAAIW,IAAc;AAClB,UAAMnB,IAAS,IAAI,WAAWM,EAAU,MAAM;AAG9C,aAASc,IAAI,GAAGA,IAAIZ,GAAeY,KAAK;AACtC,YAAMC,IAAWD,IAAIV,IAAiBE,IAAwBC;AAG9D,MAAAI,EAAOG,CAAC,IAAIpB,EAAO,MAAMgB,GAAQA,IAASK,CAAQ,GAGlDH,EAAOE,CAAC,IAAIL,EAAG,OAAOE,EAAOG,CAAC,CAAC,GAE/BJ,KAAUK,GACVF,IAAc,KAAK,IAAIA,GAAaE,CAAQ;AAAA,IAChD;AAIE,UAAM5B,IAAO,IAAI,WAAWQ,CAAc;AAC1C,QAAIqB,IAAQ,GACR5C,GAAGG;AAGP,SAAKH,IAAI,GAAGA,IAAIyC,GAAazC;AAC3B,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAIH,IAAIuC,EAAOpC,CAAC,EAAE,WAChBY,EAAK6B,GAAO,IAAIL,EAAOpC,CAAC,EAAEH,CAAC;AAMjC,SAAKA,IAAI,GAAGA,IAAIoC,GAASpC;AACvB,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAAY,EAAK6B,GAAO,IAAIJ,EAAOrC,CAAC,EAAEH,CAAC;AAI/B,WAAOe;AAAA,EACT;AAWA,WAAS8B,EAAc9B,GAAMlB,GAASe,GAAsBC,GAAa;AACvE,QAAIQ;AAEJ,QAAI,MAAM,QAAQN,CAAI;AACpB,MAAAM,IAAW5B,EAAS,UAAUsB,CAAI;AAAA,aACzB,OAAOA,KAAS,UAAU;AACnC,UAAI+B,IAAmBjD;AAEvB,UAAI,CAACiD,GAAkB;AACrB,cAAMC,IAActD,EAAS,SAASsB,CAAI;AAG1C,QAAA+B,IAAmB3D,EAAQ,sBAAsB4D,GAAanC,CAAoB;AAAA,MACxF;AAII,MAAAS,IAAW5B,EAAS,WAAWsB,GAAM+B,KAAoB,EAAE;AAAA,IAC/D;AACI,YAAM,IAAI,MAAM,cAAc;AAIhC,UAAME,IAAc7D,EAAQ,sBAAsBkC,GAAUT,CAAoB;AAGhF,QAAI,CAACoC;AACH,YAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAI,CAACnD;AACH,MAAAA,IAAUmD;AAAA,aAGDnD,IAAUmD;AACnB,YAAM,IAAI;AAAA,QAAM;AAAA;AAAA,uDAE0CA,IAAc;AAAA;AAAA,MAC5E;AAGE,UAAMC,IAAW7B,EAAWvB,GAASe,GAAsBS,CAAQ,GAG7D6B,IAAcjF,EAAM,cAAc4B,CAAO,GACzCsD,IAAU,IAAI5E,EAAU2E,CAAW;AAGzC,WAAAvD,EAAmBwD,GAAStD,CAAO,GACnCQ,EAAmB8C,CAAO,GAC1B5C,EAAsB4C,GAAStD,CAAO,GAMtCc,EAAgBwC,GAASvC,GAAsB,CAAC,GAE5Cf,KAAW,KACbW,EAAiB2C,GAAStD,CAAO,GAInCiB,EAAUqC,GAASF,CAAQ,GAEvB,MAAMpC,CAAW,MAEnBA,IAAchC,EAAY;AAAA,MAAYsE;AAAA,MACpCxC,EAAgB,KAAK,MAAMwC,GAASvC,CAAoB;AAAA,IAAC,IAI7D/B,EAAY,UAAUgC,GAAasC,CAAO,GAG1CxC,EAAgBwC,GAASvC,GAAsBC,CAAW,GAEnD;AAAA,MACL,SAASsC;AAAA,MACT,SAAStD;AAAA,MACT,sBAAsBe;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUQ;AAAA,IACd;AAAA,EACA;AAWA,SAAA+B,EAAA,SAAiB,SAAiBrC,GAAMsC,GAAS;AAC/C,QAAI,OAAOtC,IAAS,OAAeA,MAAS;AAC1C,YAAM,IAAI,MAAM,eAAe;AAGjC,QAAIH,IAAuBzC,EAAQ,GAC/B0B,GACAyD;AAEJ,WAAI,OAAOD,IAAY,QAErBzC,IAAuBzC,EAAQ,KAAKkF,EAAQ,sBAAsBlF,EAAQ,CAAC,GAC3E0B,IAAUV,EAAQ,KAAKkE,EAAQ,OAAO,GACtCC,IAAOzE,EAAY,KAAKwE,EAAQ,WAAW,GAEvCA,EAAQ,cACVpF,EAAM,kBAAkBoF,EAAQ,UAAU,IAIvCR,EAAa9B,GAAMlB,GAASe,GAAsB0C,CAAI;AAAA,EAC/D;;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index108.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/can-promise.js"],"sourcesContent":["// can-promise has a crash in some versions of react native that dont have\n// standard global objects\n// https://github.com/soldair/node-qrcode/issues/157\n\nmodule.exports = function () {\n return typeof Promise === 'function' && Promise.prototype && Promise.prototype.then\n}\n"],"names":["canPromise"],"mappings":";;sBAIAA,IAAiB,WAAY;AAC3B,WAAO,OAAO,WAAY,cAAc,QAAQ,aAAa,QAAQ,UAAU;AAAA,EACjF;;","x_google_ignoreList":[0]}
package/dist/index109.js CHANGED
@@ -1,33 +1,155 @@
1
- import { __exports as a } from "./index125.js";
2
- import { __require as h } from "./index126.js";
3
- var p;
4
- function C() {
5
- return p ? a : (p = 1, (function(u) {
6
- const f = h();
7
- function m(d, r, e) {
8
- d.clearRect(0, 0, r.width, r.height), r.style || (r.style = {}), r.height = e, r.width = e, r.style.height = e + "px", r.style.width = e + "px";
1
+ import { __exports as M } from "./index112.js";
2
+ import { __require as Y } from "./index113.js";
3
+ import { __require as Z } from "./index114.js";
4
+ import { __require as $ } from "./index115.js";
5
+ import { __require as x } from "./index116.js";
6
+ import { __require as v } from "./index117.js";
7
+ import { __require as ee } from "./index118.js";
8
+ import { __require as te } from "./index119.js";
9
+ import { __require as oe } from "./index120.js";
10
+ import { __require as re } from "./index121.js";
11
+ import { __require as ne } from "./index122.js";
12
+ import { __require as se } from "./index123.js";
13
+ import { __require as ie } from "./index124.js";
14
+ import { __require as ue } from "./index125.js";
15
+ var F;
16
+ function Be() {
17
+ if (F) return M;
18
+ F = 1;
19
+ const g = Y(), q = Z(), A = $(), k = x(), P = v(), D = ee(), _ = te(), h = oe(), V = re(), w = ne(), R = se(), G = ie(), C = ue();
20
+ function Q(r, u) {
21
+ const n = r.size, e = D.getPositions(u);
22
+ for (let c = 0; c < e.length; c++) {
23
+ const t = e[c][0], o = e[c][1];
24
+ for (let i = -1; i <= 7; i++)
25
+ if (!(t + i <= -1 || n <= t + i))
26
+ for (let s = -1; s <= 7; s++)
27
+ o + s <= -1 || n <= o + s || (i >= 0 && i <= 6 && (s === 0 || s === 6) || s >= 0 && s <= 6 && (i === 0 || i === 6) || i >= 2 && i <= 4 && s >= 2 && s <= 4 ? r.set(t + i, o + s, !0, !0) : r.set(t + i, o + s, !1, !0));
9
28
  }
10
- function s() {
11
- try {
12
- return document.createElement("canvas");
13
- } catch {
14
- throw new Error("You need to specify a canvas element");
29
+ }
30
+ function U(r) {
31
+ const u = r.size;
32
+ for (let n = 8; n < u - 8; n++) {
33
+ const e = n % 2 === 0;
34
+ r.set(n, 6, e, !0), r.set(6, n, e, !0);
35
+ }
36
+ }
37
+ function J(r, u) {
38
+ const n = P.getPositions(u);
39
+ for (let e = 0; e < n.length; e++) {
40
+ const c = n[e][0], t = n[e][1];
41
+ for (let o = -2; o <= 2; o++)
42
+ for (let i = -2; i <= 2; i++)
43
+ o === -2 || o === 2 || i === -2 || i === 2 || o === 0 && i === 0 ? r.set(c + o, t + i, !0, !0) : r.set(c + o, t + i, !1, !0);
44
+ }
45
+ }
46
+ function N(r, u) {
47
+ const n = r.size, e = w.getEncodedBits(u);
48
+ let c, t, o;
49
+ for (let i = 0; i < 18; i++)
50
+ c = Math.floor(i / 3), t = i % 3 + n - 8 - 3, o = (e >> i & 1) === 1, r.set(c, t, o, !0), r.set(t, c, o, !0);
51
+ }
52
+ function b(r, u, n) {
53
+ const e = r.size, c = R.getEncodedBits(u, n);
54
+ let t, o;
55
+ for (t = 0; t < 15; t++)
56
+ o = (c >> t & 1) === 1, t < 6 ? r.set(t, 8, o, !0) : t < 8 ? r.set(t + 1, 8, o, !0) : r.set(e - 15 + t, 8, o, !0), t < 8 ? r.set(8, e - t - 1, o, !0) : t < 9 ? r.set(8, 15 - t - 1 + 1, o, !0) : r.set(8, 15 - t - 1, o, !0);
57
+ r.set(e - 8, 8, 1, !0);
58
+ }
59
+ function L(r, u) {
60
+ const n = r.size;
61
+ let e = -1, c = n - 1, t = 7, o = 0;
62
+ for (let i = n - 1; i > 0; i -= 2)
63
+ for (i === 6 && i--; ; ) {
64
+ for (let s = 0; s < 2; s++)
65
+ if (!r.isReserved(c, i - s)) {
66
+ let a = !1;
67
+ o < u.length && (a = (u[o] >>> t & 1) === 1), r.set(c, i - s, a), t--, t === -1 && (o++, t = 7);
68
+ }
69
+ if (c += e, c < 0 || n <= c) {
70
+ c -= e, e = -e;
71
+ break;
72
+ }
15
73
  }
74
+ }
75
+ function j(r, u, n) {
76
+ const e = new A();
77
+ n.forEach(function(s) {
78
+ e.put(s.mode.bit, 4), e.put(s.getLength(), G.getCharCountIndicator(s.mode, r)), s.write(e);
79
+ });
80
+ const c = g.getSymbolTotalCodewords(r), t = h.getTotalCodewordsCount(r, u), o = (c - t) * 8;
81
+ for (e.getLengthInBits() + 4 <= o && e.put(0, 4); e.getLengthInBits() % 8 !== 0; )
82
+ e.putBit(0);
83
+ const i = (o - e.getLengthInBits()) / 8;
84
+ for (let s = 0; s < i; s++)
85
+ e.put(s % 2 ? 17 : 236, 8);
86
+ return H(e, r, u);
87
+ }
88
+ function H(r, u, n) {
89
+ const e = g.getSymbolTotalCodewords(u), c = h.getTotalCodewordsCount(u, n), t = e - c, o = h.getBlocksCount(u, n), i = e % o, s = o - i, a = Math.floor(e / o), m = Math.floor(t / o), O = m + 1, E = a - m, W = new V(E);
90
+ let B = 0;
91
+ const p = new Array(o), z = new Array(o);
92
+ let S = 0;
93
+ const X = new Uint8Array(r.buffer);
94
+ for (let d = 0; d < o; d++) {
95
+ const y = d < s ? m : O;
96
+ p[d] = X.slice(B, B + y), z[d] = W.encode(p[d]), B += y, S = Math.max(S, y);
16
97
  }
17
- u.render = function(r, e, l) {
18
- let t = l, n = e;
19
- typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), e || (n = s()), t = f.getOptions(t);
20
- const i = f.getImageWidth(r.modules.size, t), o = n.getContext("2d"), g = o.createImageData(i, i);
21
- return f.qrToImageData(g.data, r, t), m(o, n, i), o.putImageData(g, 0, 0), n;
22
- }, u.renderToDataURL = function(r, e, l) {
23
- let t = l;
24
- typeof t > "u" && (!e || !e.getContext) && (t = e, e = void 0), t || (t = {});
25
- const n = u.render(r, e, t), i = t.type || "image/png", o = t.rendererOpts || {};
26
- return n.toDataURL(i, o.quality);
98
+ const I = new Uint8Array(e);
99
+ let T = 0, f, l;
100
+ for (f = 0; f < S; f++)
101
+ for (l = 0; l < o; l++)
102
+ f < p[l].length && (I[T++] = p[l][f]);
103
+ for (f = 0; f < E; f++)
104
+ for (l = 0; l < o; l++)
105
+ I[T++] = z[l][f];
106
+ return I;
107
+ }
108
+ function K(r, u, n, e) {
109
+ let c;
110
+ if (Array.isArray(r))
111
+ c = C.fromArray(r);
112
+ else if (typeof r == "string") {
113
+ let a = u;
114
+ if (!a) {
115
+ const m = C.rawSplit(r);
116
+ a = w.getBestVersionForData(m, n);
117
+ }
118
+ c = C.fromString(r, a || 40);
119
+ } else
120
+ throw new Error("Invalid data");
121
+ const t = w.getBestVersionForData(c, n);
122
+ if (!t)
123
+ throw new Error("The amount of data is too big to be stored in a QR Code");
124
+ if (!u)
125
+ u = t;
126
+ else if (u < t)
127
+ throw new Error(
128
+ `
129
+ The chosen QR Code version cannot contain this amount of data.
130
+ Minimum version required to store current data is: ` + t + `.
131
+ `
132
+ );
133
+ const o = j(u, n, c), i = g.getSymbolSize(u), s = new k(i);
134
+ return Q(s, u), U(s), J(s, u), b(s, n, 0), u >= 7 && N(s, u), L(s, o), isNaN(e) && (e = _.getBestMask(
135
+ s,
136
+ b.bind(null, s, n)
137
+ )), _.applyMask(e, s), b(s, n, e), {
138
+ modules: s,
139
+ version: u,
140
+ errorCorrectionLevel: n,
141
+ maskPattern: e,
142
+ segments: c
27
143
  };
28
- })(a), a);
144
+ }
145
+ return M.create = function(u, n) {
146
+ if (typeof u > "u" || u === "")
147
+ throw new Error("No input text");
148
+ let e = q.M, c, t;
149
+ return typeof n < "u" && (e = q.from(n.errorCorrectionLevel, q.M), c = w.from(n.version), t = _.from(n.maskPattern), n.toSJISFunc && g.setToSJISFunction(n.toSJISFunc)), K(u, c, e, t);
150
+ }, M;
29
151
  }
30
152
  export {
31
- C as __require
153
+ Be as __require
32
154
  };
33
155
  //# sourceMappingURL=index109.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index109.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/renderer/canvas.js"],"sourcesContent":["const Utils = require('./utils')\n\nfunction clearCanvas (ctx, canvas, size) {\n ctx.clearRect(0, 0, canvas.width, canvas.height)\n\n if (!canvas.style) canvas.style = {}\n canvas.height = size\n canvas.width = size\n canvas.style.height = size + 'px'\n canvas.style.width = size + 'px'\n}\n\nfunction getCanvasElement () {\n try {\n return document.createElement('canvas')\n } catch (e) {\n throw new Error('You need to specify a canvas element')\n }\n}\n\nexports.render = function render (qrData, canvas, options) {\n let opts = options\n let canvasEl = canvas\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!canvas) {\n canvasEl = getCanvasElement()\n }\n\n opts = Utils.getOptions(opts)\n const size = Utils.getImageWidth(qrData.modules.size, opts)\n\n const ctx = canvasEl.getContext('2d')\n const image = ctx.createImageData(size, size)\n Utils.qrToImageData(image.data, qrData, opts)\n\n clearCanvas(ctx, canvasEl, size)\n ctx.putImageData(image, 0, 0)\n\n return canvasEl\n}\n\nexports.renderToDataURL = function renderToDataURL (qrData, canvas, options) {\n let opts = options\n\n if (typeof opts === 'undefined' && (!canvas || !canvas.getContext)) {\n opts = canvas\n canvas = undefined\n }\n\n if (!opts) opts = {}\n\n const canvasEl = exports.render(qrData, canvas, opts)\n\n const type = opts.type || 'image/png'\n const rendererOpts = opts.rendererOpts || {}\n\n return canvasEl.toDataURL(type, rendererOpts.quality)\n}\n"],"names":["Utils","require$$0","clearCanvas","ctx","canvas","size","getCanvasElement","exports","qrData","options","opts","canvasEl","image","type","rendererOpts"],"mappings":";;;;;AAAA,UAAMA,IAAQC,EAAA;AAEd,aAASC,EAAaC,GAAKC,GAAQC,GAAM;AACvC,MAAAF,EAAI,UAAU,GAAG,GAAGC,EAAO,OAAOA,EAAO,MAAM,GAE1CA,EAAO,UAAOA,EAAO,QAAQ,CAAA,IAClCA,EAAO,SAASC,GAChBD,EAAO,QAAQC,GACfD,EAAO,MAAM,SAASC,IAAO,MAC7BD,EAAO,MAAM,QAAQC,IAAO;AAAA,IAC9B;AAEA,aAASC,IAAoB;AAC3B,UAAI;AACF,eAAO,SAAS,cAAc,QAAQ;AAAA,MAC1C,QAAc;AACV,cAAM,IAAI,MAAM,sCAAsC;AAAA,MAC1D;AAAA,IACA;AAEAC,IAAAA,EAAA,SAAiB,SAAiBC,GAAQJ,GAAQK,GAAS;AACzD,UAAIC,IAAOD,GACPE,IAAWP;AAEf,MAAI,OAAOM,IAAS,QAAgB,CAACN,KAAU,CAACA,EAAO,gBACrDM,IAAON,GACPA,IAAS,SAGNA,MACHO,IAAWL,EAAgB,IAG7BI,IAAOV,EAAM,WAAWU,CAAI;AAC5B,YAAML,IAAOL,EAAM,cAAcQ,EAAO,QAAQ,MAAME,CAAI,GAEpDP,IAAMQ,EAAS,WAAW,IAAI,GAC9BC,IAAQT,EAAI,gBAAgBE,GAAMA,CAAI;AAC5C,aAAAL,EAAM,cAAcY,EAAM,MAAMJ,GAAQE,CAAI,GAE5CR,EAAYC,GAAKQ,GAAUN,CAAI,GAC/BF,EAAI,aAAaS,GAAO,GAAG,CAAC,GAErBD;AAAA,IACT,GAEAJ,EAAA,kBAA0B,SAA0BC,GAAQJ,GAAQK,GAAS;AAC3E,UAAIC,IAAOD;AAEX,MAAI,OAAOC,IAAS,QAAgB,CAACN,KAAU,CAACA,EAAO,gBACrDM,IAAON,GACPA,IAAS,SAGNM,MAAMA,IAAO,CAAA;AAElB,YAAMC,IAAWJ,EAAQ,OAAOC,GAAQJ,GAAQM,CAAI,GAE9CG,IAAOH,EAAK,QAAQ,aACpBI,IAAeJ,EAAK,gBAAgB,CAAA;AAE1C,aAAOC,EAAS,UAAUE,GAAMC,EAAa,OAAO;AAAA,IACtD;AAAA;;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index109.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/qrcode.js"],"sourcesContent":["const Utils = require('./utils')\nconst ECLevel = require('./error-correction-level')\nconst BitBuffer = require('./bit-buffer')\nconst BitMatrix = require('./bit-matrix')\nconst AlignmentPattern = require('./alignment-pattern')\nconst FinderPattern = require('./finder-pattern')\nconst MaskPattern = require('./mask-pattern')\nconst ECCode = require('./error-correction-code')\nconst ReedSolomonEncoder = require('./reed-solomon-encoder')\nconst Version = require('./version')\nconst FormatInfo = require('./format-info')\nconst Mode = require('./mode')\nconst Segments = require('./segments')\n\n/**\n * QRCode for JavaScript\n *\n * modified by Ryan Day for nodejs support\n * Copyright (c) 2011 Ryan Day\n *\n * Licensed under the MIT license:\n * http://www.opensource.org/licenses/mit-license.php\n *\n//---------------------------------------------------------------------\n// QRCode for JavaScript\n//\n// Copyright (c) 2009 Kazuhiko Arase\n//\n// URL: http://www.d-project.com/\n//\n// Licensed under the MIT license:\n// http://www.opensource.org/licenses/mit-license.php\n//\n// The word \"QR Code\" is registered trademark of\n// DENSO WAVE INCORPORATED\n// http://www.denso-wave.com/qrcode/faqpatent-e.html\n//\n//---------------------------------------------------------------------\n*/\n\n/**\n * Add finder patterns bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupFinderPattern (matrix, version) {\n const size = matrix.size\n const pos = FinderPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -1; r <= 7; r++) {\n if (row + r <= -1 || size <= row + r) continue\n\n for (let c = -1; c <= 7; c++) {\n if (col + c <= -1 || size <= col + c) continue\n\n if ((r >= 0 && r <= 6 && (c === 0 || c === 6)) ||\n (c >= 0 && c <= 6 && (r === 0 || r === 6)) ||\n (r >= 2 && r <= 4 && c >= 2 && c <= 4)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add timing pattern bits to matrix\n *\n * Note: this function must be called before {@link setupAlignmentPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n */\nfunction setupTimingPattern (matrix) {\n const size = matrix.size\n\n for (let r = 8; r < size - 8; r++) {\n const value = r % 2 === 0\n matrix.set(r, 6, value, true)\n matrix.set(6, r, value, true)\n }\n}\n\n/**\n * Add alignment patterns bits to matrix\n *\n * Note: this function must be called after {@link setupTimingPattern}\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupAlignmentPattern (matrix, version) {\n const pos = AlignmentPattern.getPositions(version)\n\n for (let i = 0; i < pos.length; i++) {\n const row = pos[i][0]\n const col = pos[i][1]\n\n for (let r = -2; r <= 2; r++) {\n for (let c = -2; c <= 2; c++) {\n if (r === -2 || r === 2 || c === -2 || c === 2 ||\n (r === 0 && c === 0)) {\n matrix.set(row + r, col + c, true, true)\n } else {\n matrix.set(row + r, col + c, false, true)\n }\n }\n }\n }\n}\n\n/**\n * Add version info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Number} version QR Code version\n */\nfunction setupVersionInfo (matrix, version) {\n const size = matrix.size\n const bits = Version.getEncodedBits(version)\n let row, col, mod\n\n for (let i = 0; i < 18; i++) {\n row = Math.floor(i / 3)\n col = i % 3 + size - 8 - 3\n mod = ((bits >> i) & 1) === 1\n\n matrix.set(row, col, mod, true)\n matrix.set(col, row, mod, true)\n }\n}\n\n/**\n * Add format info bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {Number} maskPattern Mask pattern reference value\n */\nfunction setupFormatInfo (matrix, errorCorrectionLevel, maskPattern) {\n const size = matrix.size\n const bits = FormatInfo.getEncodedBits(errorCorrectionLevel, maskPattern)\n let i, mod\n\n for (i = 0; i < 15; i++) {\n mod = ((bits >> i) & 1) === 1\n\n // vertical\n if (i < 6) {\n matrix.set(i, 8, mod, true)\n } else if (i < 8) {\n matrix.set(i + 1, 8, mod, true)\n } else {\n matrix.set(size - 15 + i, 8, mod, true)\n }\n\n // horizontal\n if (i < 8) {\n matrix.set(8, size - i - 1, mod, true)\n } else if (i < 9) {\n matrix.set(8, 15 - i - 1 + 1, mod, true)\n } else {\n matrix.set(8, 15 - i - 1, mod, true)\n }\n }\n\n // fixed module\n matrix.set(size - 8, 8, 1, true)\n}\n\n/**\n * Add encoded data bits to matrix\n *\n * @param {BitMatrix} matrix Modules matrix\n * @param {Uint8Array} data Data codewords\n */\nfunction setupData (matrix, data) {\n const size = matrix.size\n let inc = -1\n let row = size - 1\n let bitIndex = 7\n let byteIndex = 0\n\n for (let col = size - 1; col > 0; col -= 2) {\n if (col === 6) col--\n\n while (true) {\n for (let c = 0; c < 2; c++) {\n if (!matrix.isReserved(row, col - c)) {\n let dark = false\n\n if (byteIndex < data.length) {\n dark = (((data[byteIndex] >>> bitIndex) & 1) === 1)\n }\n\n matrix.set(row, col - c, dark)\n bitIndex--\n\n if (bitIndex === -1) {\n byteIndex++\n bitIndex = 7\n }\n }\n }\n\n row += inc\n\n if (row < 0 || size <= row) {\n row -= inc\n inc = -inc\n break\n }\n }\n }\n}\n\n/**\n * Create encoded codewords from data input\n *\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @param {ByteData} data Data input\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createData (version, errorCorrectionLevel, segments) {\n // Prepare data buffer\n const buffer = new BitBuffer()\n\n segments.forEach(function (data) {\n // prefix data with mode indicator (4 bits)\n buffer.put(data.mode.bit, 4)\n\n // Prefix data with character count indicator.\n // The character count indicator is a string of bits that represents the\n // number of characters that are being encoded.\n // The character count indicator must be placed after the mode indicator\n // and must be a certain number of bits long, depending on the QR version\n // and data mode\n // @see {@link Mode.getCharCountIndicator}.\n buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version))\n\n // add binary data sequence to buffer\n data.write(buffer)\n })\n\n // Calculate required number of bits\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8\n\n // Add a terminator.\n // If the bit string is shorter than the total number of required bits,\n // a terminator of up to four 0s must be added to the right side of the string.\n // If the bit string is more than four bits shorter than the required number of bits,\n // add four 0s to the end.\n if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {\n buffer.put(0, 4)\n }\n\n // If the bit string is fewer than four bits shorter, add only the number of 0s that\n // are needed to reach the required number of bits.\n\n // After adding the terminator, if the number of bits in the string is not a multiple of 8,\n // pad the string on the right with 0s to make the string's length a multiple of 8.\n while (buffer.getLengthInBits() % 8 !== 0) {\n buffer.putBit(0)\n }\n\n // Add pad bytes if the string is still shorter than the total number of required bits.\n // Extend the buffer to fill the data capacity of the symbol corresponding to\n // the Version and Error Correction Level by adding the Pad Codewords 11101100 (0xEC)\n // and 00010001 (0x11) alternately.\n const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8\n for (let i = 0; i < remainingByte; i++) {\n buffer.put(i % 2 ? 0x11 : 0xEC, 8)\n }\n\n return createCodewords(buffer, version, errorCorrectionLevel)\n}\n\n/**\n * Encode input data with Reed-Solomon and return codewords with\n * relative error correction bits\n *\n * @param {BitBuffer} bitBuffer Data to encode\n * @param {Number} version QR Code version\n * @param {ErrorCorrectionLevel} errorCorrectionLevel Error correction level\n * @return {Uint8Array} Buffer containing encoded codewords\n */\nfunction createCodewords (bitBuffer, version, errorCorrectionLevel) {\n // Total codewords for this QR code version (Data + Error correction)\n const totalCodewords = Utils.getSymbolTotalCodewords(version)\n\n // Total number of error correction codewords\n const ecTotalCodewords = ECCode.getTotalCodewordsCount(version, errorCorrectionLevel)\n\n // Total number of data codewords\n const dataTotalCodewords = totalCodewords - ecTotalCodewords\n\n // Total number of blocks\n const ecTotalBlocks = ECCode.getBlocksCount(version, errorCorrectionLevel)\n\n // Calculate how many blocks each group should contain\n const blocksInGroup2 = totalCodewords % ecTotalBlocks\n const blocksInGroup1 = ecTotalBlocks - blocksInGroup2\n\n const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks)\n\n const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks)\n const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1\n\n // Number of EC codewords is the same for both groups\n const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1\n\n // Initialize a Reed-Solomon encoder with a generator polynomial of degree ecCount\n const rs = new ReedSolomonEncoder(ecCount)\n\n let offset = 0\n const dcData = new Array(ecTotalBlocks)\n const ecData = new Array(ecTotalBlocks)\n let maxDataSize = 0\n const buffer = new Uint8Array(bitBuffer.buffer)\n\n // Divide the buffer into the required number of blocks\n for (let b = 0; b < ecTotalBlocks; b++) {\n const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2\n\n // extract a block of data from buffer\n dcData[b] = buffer.slice(offset, offset + dataSize)\n\n // Calculate EC codewords for this data block\n ecData[b] = rs.encode(dcData[b])\n\n offset += dataSize\n maxDataSize = Math.max(maxDataSize, dataSize)\n }\n\n // Create final data\n // Interleave the data and error correction codewords from each block\n const data = new Uint8Array(totalCodewords)\n let index = 0\n let i, r\n\n // Add data codewords\n for (i = 0; i < maxDataSize; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n if (i < dcData[r].length) {\n data[index++] = dcData[r][i]\n }\n }\n }\n\n // Apped EC codewords\n for (i = 0; i < ecCount; i++) {\n for (r = 0; r < ecTotalBlocks; r++) {\n data[index++] = ecData[r][i]\n }\n }\n\n return data\n}\n\n/**\n * Build QR Code symbol\n *\n * @param {String} data Input string\n * @param {Number} version QR Code version\n * @param {ErrorCorretionLevel} errorCorrectionLevel Error level\n * @param {MaskPattern} maskPattern Mask pattern\n * @return {Object} Object containing symbol data\n */\nfunction createSymbol (data, version, errorCorrectionLevel, maskPattern) {\n let segments\n\n if (Array.isArray(data)) {\n segments = Segments.fromArray(data)\n } else if (typeof data === 'string') {\n let estimatedVersion = version\n\n if (!estimatedVersion) {\n const rawSegments = Segments.rawSplit(data)\n\n // Estimate best version that can contain raw splitted segments\n estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel)\n }\n\n // Build optimized segments\n // If estimated version is undefined, try with the highest version\n segments = Segments.fromString(data, estimatedVersion || 40)\n } else {\n throw new Error('Invalid data')\n }\n\n // Get the min version that can contain data\n const bestVersion = Version.getBestVersionForData(segments, errorCorrectionLevel)\n\n // If no version is found, data cannot be stored\n if (!bestVersion) {\n throw new Error('The amount of data is too big to be stored in a QR Code')\n }\n\n // If not specified, use min version as default\n if (!version) {\n version = bestVersion\n\n // Check if the specified version can contain the data\n } else if (version < bestVersion) {\n throw new Error('\\n' +\n 'The chosen QR Code version cannot contain this amount of data.\\n' +\n 'Minimum version required to store current data is: ' + bestVersion + '.\\n'\n )\n }\n\n const dataBits = createData(version, errorCorrectionLevel, segments)\n\n // Allocate matrix buffer\n const moduleCount = Utils.getSymbolSize(version)\n const modules = new BitMatrix(moduleCount)\n\n // Add function modules\n setupFinderPattern(modules, version)\n setupTimingPattern(modules)\n setupAlignmentPattern(modules, version)\n\n // Add temporary dummy bits for format info just to set them as reserved.\n // This is needed to prevent these bits from being masked by {@link MaskPattern.applyMask}\n // since the masking operation must be performed only on the encoding region.\n // These blocks will be replaced with correct values later in code.\n setupFormatInfo(modules, errorCorrectionLevel, 0)\n\n if (version >= 7) {\n setupVersionInfo(modules, version)\n }\n\n // Add data codewords\n setupData(modules, dataBits)\n\n if (isNaN(maskPattern)) {\n // Find best mask pattern\n maskPattern = MaskPattern.getBestMask(modules,\n setupFormatInfo.bind(null, modules, errorCorrectionLevel))\n }\n\n // Apply mask pattern\n MaskPattern.applyMask(maskPattern, modules)\n\n // Replace format info bits with correct values\n setupFormatInfo(modules, errorCorrectionLevel, maskPattern)\n\n return {\n modules: modules,\n version: version,\n errorCorrectionLevel: errorCorrectionLevel,\n maskPattern: maskPattern,\n segments: segments\n }\n}\n\n/**\n * QR Code\n *\n * @param {String | Array} data Input data\n * @param {Object} options Optional configurations\n * @param {Number} options.version QR Code version\n * @param {String} options.errorCorrectionLevel Error correction level\n * @param {Function} options.toSJISFunc Helper func to convert utf8 to sjis\n */\nexports.create = function create (data, options) {\n if (typeof data === 'undefined' || data === '') {\n throw new Error('No input text')\n }\n\n let errorCorrectionLevel = ECLevel.M\n let version\n let mask\n\n if (typeof options !== 'undefined') {\n // Use higher error correction level as default\n errorCorrectionLevel = ECLevel.from(options.errorCorrectionLevel, ECLevel.M)\n version = Version.from(options.version)\n mask = MaskPattern.from(options.maskPattern)\n\n if (options.toSJISFunc) {\n Utils.setToSJISFunction(options.toSJISFunc)\n }\n }\n\n return createSymbol(data, version, errorCorrectionLevel, mask)\n}\n"],"names":["Utils","require$$0","ECLevel","require$$1","BitBuffer","require$$2","BitMatrix","require$$3","AlignmentPattern","require$$4","FinderPattern","require$$5","MaskPattern","require$$6","ECCode","require$$7","ReedSolomonEncoder","require$$8","Version","require$$9","FormatInfo","require$$10","Mode","require$$11","Segments","require$$12","setupFinderPattern","matrix","version","size","pos","i","row","col","r","c","setupTimingPattern","value","setupAlignmentPattern","setupVersionInfo","bits","mod","setupFormatInfo","errorCorrectionLevel","maskPattern","setupData","data","inc","bitIndex","byteIndex","dark","createData","segments","buffer","totalCodewords","ecTotalCodewords","dataTotalCodewordsBits","remainingByte","createCodewords","bitBuffer","dataTotalCodewords","ecTotalBlocks","blocksInGroup2","blocksInGroup1","totalCodewordsInGroup1","dataCodewordsInGroup1","dataCodewordsInGroup2","ecCount","rs","offset","dcData","ecData","maxDataSize","b","dataSize","index","createSymbol","estimatedVersion","rawSegments","bestVersion","dataBits","moduleCount","modules","qrcode","options","mask"],"mappings":";;;;;;;;;;;;;;;;;;AAAA,QAAMA,IAAQC,EAAA,GACRC,IAAUC,EAAA,GACVC,IAAYC,EAAA,GACZC,IAAYC,EAAA,GACZC,IAAmBC,EAAA,GACnBC,IAAgBC,GAAA,GAChBC,IAAcC,GAAA,GACdC,IAASC,GAAA,GACTC,IAAqBC,GAAA,GACrBC,IAAUC,GAAA,GACVC,IAAaC,GAAA,GACbC,IAAOC,GAAA,GACPC,IAAWC,GAAA;AAkCjB,WAASC,EAAoBC,GAAQC,GAAS;AAC5C,UAAMC,IAAOF,EAAO,MACdG,IAAMpB,EAAc,aAAakB,CAAO;AAE9C,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAI,EAAAF,IAAME,KAAK,MAAML,KAAQG,IAAME;AAEnC,mBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,YAAIF,IAAME,KAAK,MAAMN,KAAQI,IAAME,MAE9BD,KAAK,KAAKA,KAAK,MAAMC,MAAM,KAAKA,MAAM,MACxCA,KAAK,KAAKA,KAAK,MAAMD,MAAM,KAAKA,MAAM,MACtCA,KAAK,KAAKA,KAAK,KAAKC,KAAK,KAAKA,KAAK,IACpCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AASA,WAASC,EAAoBT,GAAQ;AACnC,UAAME,IAAOF,EAAO;AAEpB,aAASO,IAAI,GAAGA,IAAIL,IAAO,GAAGK,KAAK;AACjC,YAAMG,IAAQH,IAAI,MAAM;AACxB,MAAAP,EAAO,IAAIO,GAAG,GAAGG,GAAO,EAAI,GAC5BV,EAAO,IAAI,GAAGO,GAAGG,GAAO,EAAI;AAAA,IAChC;AAAA,EACA;AAUA,WAASC,EAAuBX,GAAQC,GAAS;AAC/C,UAAME,IAAMtB,EAAiB,aAAaoB,CAAO;AAEjD,aAASG,IAAI,GAAGA,IAAID,EAAI,QAAQC,KAAK;AACnC,YAAMC,IAAMF,EAAIC,CAAC,EAAE,CAAC,GACdE,IAAMH,EAAIC,CAAC,EAAE,CAAC;AAEpB,eAASG,IAAI,IAAIA,KAAK,GAAGA;AACvB,iBAASC,IAAI,IAAIA,KAAK,GAAGA;AACvB,UAAID,MAAM,MAAMA,MAAM,KAAKC,MAAM,MAAMA,MAAM,KAC1CD,MAAM,KAAKC,MAAM,IAClBR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAM,EAAI,IAEvCR,EAAO,IAAIK,IAAME,GAAGD,IAAME,GAAG,IAAO,EAAI;AAAA,IAIlD;AAAA,EACA;AAQA,WAASI,EAAkBZ,GAAQC,GAAS;AAC1C,UAAMC,IAAOF,EAAO,MACda,IAAOtB,EAAQ,eAAeU,CAAO;AAC3C,QAAII,GAAKC,GAAKQ;AAEd,aAAS,IAAI,GAAG,IAAI,IAAI;AACtB,MAAAT,IAAM,KAAK,MAAM,IAAI,CAAC,GACtBC,IAAM,IAAI,IAAIJ,IAAO,IAAI,GACzBY,KAAQD,KAAQ,IAAK,OAAO,GAE5Bb,EAAO,IAAIK,GAAKC,GAAKQ,GAAK,EAAI,GAC9Bd,EAAO,IAAIM,GAAKD,GAAKS,GAAK,EAAI;AAAA,EAElC;AASA,WAASC,EAAiBf,GAAQgB,GAAsBC,GAAa;AACnE,UAAMf,IAAOF,EAAO,MACda,IAAOpB,EAAW,eAAeuB,GAAsBC,CAAW;AACxE,QAAIb,GAAGU;AAEP,SAAKV,IAAI,GAAGA,IAAI,IAAIA;AAClB,MAAAU,KAAQD,KAAQT,IAAK,OAAO,GAGxBA,IAAI,IACNJ,EAAO,IAAII,GAAG,GAAGU,GAAK,EAAI,IACjBV,IAAI,IACbJ,EAAO,IAAII,IAAI,GAAG,GAAGU,GAAK,EAAI,IAE9Bd,EAAO,IAAIE,IAAO,KAAKE,GAAG,GAAGU,GAAK,EAAI,GAIpCV,IAAI,IACNJ,EAAO,IAAI,GAAGE,IAAOE,IAAI,GAAGU,GAAK,EAAI,IAC5BV,IAAI,IACbJ,EAAO,IAAI,GAAG,KAAKI,IAAI,IAAI,GAAGU,GAAK,EAAI,IAEvCd,EAAO,IAAI,GAAG,KAAKI,IAAI,GAAGU,GAAK,EAAI;AAKvC,IAAAd,EAAO,IAAIE,IAAO,GAAG,GAAG,GAAG,EAAI;AAAA,EACjC;AAQA,WAASgB,EAAWlB,GAAQmB,GAAM;AAChC,UAAMjB,IAAOF,EAAO;AACpB,QAAIoB,IAAM,IACNf,IAAMH,IAAO,GACbmB,IAAW,GACXC,IAAY;AAEhB,aAAShB,IAAMJ,IAAO,GAAGI,IAAM,GAAGA,KAAO;AAGvC,WAFIA,MAAQ,KAAGA,SAEF;AACX,iBAASE,IAAI,GAAGA,IAAI,GAAGA;AACrB,cAAI,CAACR,EAAO,WAAWK,GAAKC,IAAME,CAAC,GAAG;AACpC,gBAAIe,IAAO;AAEX,YAAID,IAAYH,EAAK,WACnBI,KAAUJ,EAAKG,CAAS,MAAMD,IAAY,OAAO,IAGnDrB,EAAO,IAAIK,GAAKC,IAAME,GAAGe,CAAI,GAC7BF,KAEIA,MAAa,OACfC,KACAD,IAAW;AAAA,UAEvB;AAKM,YAFAhB,KAAOe,GAEHf,IAAM,KAAKH,KAAQG,GAAK;AAC1B,UAAAA,KAAOe,GACPA,IAAM,CAACA;AACP;AAAA,QACR;AAAA,MACA;AAAA,EAEA;AAUA,WAASI,EAAYvB,GAASe,GAAsBS,GAAU;AAE5D,UAAMC,IAAS,IAAIjD,EAAS;AAE5B,IAAAgD,EAAS,QAAQ,SAAUN,GAAM;AAE/B,MAAAO,EAAO,IAAIP,EAAK,KAAK,KAAK,CAAC,GAS3BO,EAAO,IAAIP,EAAK,UAAS,GAAIxB,EAAK,sBAAsBwB,EAAK,MAAMlB,CAAO,CAAC,GAG3EkB,EAAK,MAAMO,CAAM;AAAA,IACrB,CAAG;AAGD,UAAMC,IAAiBtD,EAAM,wBAAwB4B,CAAO,GACtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAC9Ea,KAA0BF,IAAiBC,KAAoB;AAgBrE,SATIF,EAAO,oBAAoB,KAAKG,KAClCH,EAAO,IAAI,GAAG,CAAC,GAQVA,EAAO,oBAAoB,MAAM;AACtC,MAAAA,EAAO,OAAO,CAAC;AAOjB,UAAMI,KAAiBD,IAAyBH,EAAO,gBAAe,KAAM;AAC5E,aAAStB,IAAI,GAAGA,IAAI0B,GAAe1B;AACjC,MAAAsB,EAAO,IAAItB,IAAI,IAAI,KAAO,KAAM,CAAC;AAGnC,WAAO2B,EAAgBL,GAAQzB,GAASe,CAAoB;AAAA,EAC9D;AAWA,WAASe,EAAiBC,GAAW/B,GAASe,GAAsB;AAElE,UAAMW,IAAiBtD,EAAM,wBAAwB4B,CAAO,GAGtD2B,IAAmBzC,EAAO,uBAAuBc,GAASe,CAAoB,GAG9EiB,IAAqBN,IAAiBC,GAGtCM,IAAgB/C,EAAO,eAAec,GAASe,CAAoB,GAGnEmB,IAAiBR,IAAiBO,GAClCE,IAAiBF,IAAgBC,GAEjCE,IAAyB,KAAK,MAAMV,IAAiBO,CAAa,GAElEI,IAAwB,KAAK,MAAML,IAAqBC,CAAa,GACrEK,IAAwBD,IAAwB,GAGhDE,IAAUH,IAAyBC,GAGnCG,IAAK,IAAIpD,EAAmBmD,CAAO;AAEzC,QAAIE,IAAS;AACb,UAAMC,IAAS,IAAI,MAAMT,CAAa,GAChCU,IAAS,IAAI,MAAMV,CAAa;AACtC,QAAIW,IAAc;AAClB,UAAMnB,IAAS,IAAI,WAAWM,EAAU,MAAM;AAG9C,aAASc,IAAI,GAAGA,IAAIZ,GAAeY,KAAK;AACtC,YAAMC,IAAWD,IAAIV,IAAiBE,IAAwBC;AAG9D,MAAAI,EAAOG,CAAC,IAAIpB,EAAO,MAAMgB,GAAQA,IAASK,CAAQ,GAGlDH,EAAOE,CAAC,IAAIL,EAAG,OAAOE,EAAOG,CAAC,CAAC,GAE/BJ,KAAUK,GACVF,IAAc,KAAK,IAAIA,GAAaE,CAAQ;AAAA,IAChD;AAIE,UAAM5B,IAAO,IAAI,WAAWQ,CAAc;AAC1C,QAAIqB,IAAQ,GACR5C,GAAGG;AAGP,SAAKH,IAAI,GAAGA,IAAIyC,GAAazC;AAC3B,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAIH,IAAIuC,EAAOpC,CAAC,EAAE,WAChBY,EAAK6B,GAAO,IAAIL,EAAOpC,CAAC,EAAEH,CAAC;AAMjC,SAAKA,IAAI,GAAGA,IAAIoC,GAASpC;AACvB,WAAKG,IAAI,GAAGA,IAAI2B,GAAe3B;AAC7B,QAAAY,EAAK6B,GAAO,IAAIJ,EAAOrC,CAAC,EAAEH,CAAC;AAI/B,WAAOe;AAAA,EACT;AAWA,WAAS8B,EAAc9B,GAAMlB,GAASe,GAAsBC,GAAa;AACvE,QAAIQ;AAEJ,QAAI,MAAM,QAAQN,CAAI;AACpB,MAAAM,IAAW5B,EAAS,UAAUsB,CAAI;AAAA,aACzB,OAAOA,KAAS,UAAU;AACnC,UAAI+B,IAAmBjD;AAEvB,UAAI,CAACiD,GAAkB;AACrB,cAAMC,IAActD,EAAS,SAASsB,CAAI;AAG1C,QAAA+B,IAAmB3D,EAAQ,sBAAsB4D,GAAanC,CAAoB;AAAA,MACxF;AAII,MAAAS,IAAW5B,EAAS,WAAWsB,GAAM+B,KAAoB,EAAE;AAAA,IAC/D;AACI,YAAM,IAAI,MAAM,cAAc;AAIhC,UAAME,IAAc7D,EAAQ,sBAAsBkC,GAAUT,CAAoB;AAGhF,QAAI,CAACoC;AACH,YAAM,IAAI,MAAM,yDAAyD;AAI3E,QAAI,CAACnD;AACH,MAAAA,IAAUmD;AAAA,aAGDnD,IAAUmD;AACnB,YAAM,IAAI;AAAA,QAAM;AAAA;AAAA,uDAE0CA,IAAc;AAAA;AAAA,MAC5E;AAGE,UAAMC,IAAW7B,EAAWvB,GAASe,GAAsBS,CAAQ,GAG7D6B,IAAcjF,EAAM,cAAc4B,CAAO,GACzCsD,IAAU,IAAI5E,EAAU2E,CAAW;AAGzC,WAAAvD,EAAmBwD,GAAStD,CAAO,GACnCQ,EAAmB8C,CAAO,GAC1B5C,EAAsB4C,GAAStD,CAAO,GAMtCc,EAAgBwC,GAASvC,GAAsB,CAAC,GAE5Cf,KAAW,KACbW,EAAiB2C,GAAStD,CAAO,GAInCiB,EAAUqC,GAASF,CAAQ,GAEvB,MAAMpC,CAAW,MAEnBA,IAAchC,EAAY;AAAA,MAAYsE;AAAA,MACpCxC,EAAgB,KAAK,MAAMwC,GAASvC,CAAoB;AAAA,IAAC,IAI7D/B,EAAY,UAAUgC,GAAasC,CAAO,GAG1CxC,EAAgBwC,GAASvC,GAAsBC,CAAW,GAEnD;AAAA,MACL,SAASsC;AAAA,MACT,SAAStD;AAAA,MACT,sBAAsBe;AAAA,MACtB,aAAaC;AAAA,MACb,UAAUQ;AAAA,IACd;AAAA,EACA;AAWA,SAAA+B,EAAA,SAAiB,SAAiBrC,GAAMsC,GAAS;AAC/C,QAAI,OAAOtC,IAAS,OAAeA,MAAS;AAC1C,YAAM,IAAI,MAAM,eAAe;AAGjC,QAAIH,IAAuBzC,EAAQ,GAC/B0B,GACAyD;AAEJ,WAAI,OAAOD,IAAY,QAErBzC,IAAuBzC,EAAQ,KAAKkF,EAAQ,sBAAsBlF,EAAQ,CAAC,GAC3E0B,IAAUV,EAAQ,KAAKkE,EAAQ,OAAO,GACtCC,IAAOzE,EAAY,KAAKwE,EAAQ,WAAW,GAEvCA,EAAQ,cACVpF,EAAM,kBAAkBoF,EAAQ,UAAU,IAIvCR,EAAa9B,GAAMlB,GAASe,GAAsB0C,CAAI;AAAA,EAC/D;;","x_google_ignoreList":[0]}