asterui 0.10.3 → 0.11.0

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 (179) hide show
  1. package/README.md +3 -0
  2. package/dist/components/Segmented.d.ts +37 -0
  3. package/dist/components/Tour.d.ts +61 -0
  4. package/dist/hooks/useClickOutside.d.ts +17 -0
  5. package/dist/hooks/useClipboard.d.ts +20 -0
  6. package/dist/hooks/useDebounce.d.ts +18 -0
  7. package/dist/hooks/useDisclosure.d.ts +20 -0
  8. package/dist/hooks/useHover.d.ts +18 -0
  9. package/dist/hooks/useKeyPress.d.ts +40 -0
  10. package/dist/hooks/useLocalStorage.d.ts +12 -0
  11. package/dist/hooks/usePrevious.d.ts +15 -0
  12. package/dist/hooks/useWindowSize.d.ts +21 -0
  13. package/dist/index.d.ts +18 -0
  14. package/dist/index.js +143 -120
  15. package/dist/index.js.map +1 -1
  16. package/dist/index100.js +5 -21
  17. package/dist/index100.js.map +1 -1
  18. package/dist/index101.js +41 -23
  19. package/dist/index101.js.map +1 -1
  20. package/dist/index102.js +2 -20
  21. package/dist/index102.js.map +1 -1
  22. package/dist/index103.js +6 -99
  23. package/dist/index103.js.map +1 -1
  24. package/dist/index104.js +149 -357
  25. package/dist/index104.js.map +1 -1
  26. package/dist/index105.js +28 -23
  27. package/dist/index105.js.map +1 -1
  28. package/dist/index106.js +28 -71
  29. package/dist/index106.js.map +1 -1
  30. package/dist/index107.js +2 -16
  31. package/dist/index107.js.map +1 -1
  32. package/dist/index108.js +71 -65
  33. package/dist/index108.js.map +1 -1
  34. package/dist/index109.js +34 -139
  35. package/dist/index109.js.map +1 -1
  36. package/dist/index110.js +26 -2
  37. package/dist/index110.js.map +1 -1
  38. package/dist/index111.js +20 -55
  39. package/dist/index111.js.map +1 -1
  40. package/dist/index112.js +24 -2
  41. package/dist/index112.js.map +1 -1
  42. package/dist/index113.js +20 -2
  43. package/dist/index113.js.map +1 -1
  44. package/dist/index114.js +100 -2
  45. package/dist/index114.js.map +1 -1
  46. package/dist/index115.js +360 -2
  47. package/dist/index115.js.map +1 -1
  48. package/dist/index116.js +25 -2
  49. package/dist/index116.js.map +1 -1
  50. package/dist/index117.js +73 -2
  51. package/dist/index117.js.map +1 -1
  52. package/dist/index118.js +16 -2
  53. package/dist/index118.js.map +1 -1
  54. package/dist/index119.js +63 -29
  55. package/dist/index119.js.map +1 -1
  56. package/dist/index120.js +144 -2
  57. package/dist/index120.js.map +1 -1
  58. package/dist/index121.js +2 -8
  59. package/dist/index121.js.map +1 -1
  60. package/dist/index122.js +56 -2
  61. package/dist/index122.js.map +1 -1
  62. package/dist/index123.js +2 -2
  63. package/dist/index124.js +2 -21
  64. package/dist/index124.js.map +1 -1
  65. package/dist/index125.js +2 -2
  66. package/dist/index126.js +2 -24
  67. package/dist/index126.js.map +1 -1
  68. package/dist/index127.js +2 -71
  69. package/dist/index127.js.map +1 -1
  70. package/dist/index128.js +2 -21
  71. package/dist/index128.js.map +1 -1
  72. package/dist/index129.js +2 -34
  73. package/dist/index129.js.map +1 -1
  74. package/dist/index130.js +28 -66
  75. package/dist/index130.js.map +1 -1
  76. package/dist/index132.js +8 -2
  77. package/dist/index132.js.map +1 -1
  78. package/dist/index133.js +2 -22
  79. package/dist/index133.js.map +1 -1
  80. package/dist/index135.js +21 -2
  81. package/dist/index135.js.map +1 -1
  82. package/dist/index136.js +2 -2
  83. package/dist/index137.js +24 -2
  84. package/dist/index137.js.map +1 -1
  85. package/dist/index138.js +70 -3
  86. package/dist/index138.js.map +1 -1
  87. package/dist/index139.js +24 -0
  88. package/dist/index139.js.map +1 -0
  89. package/dist/index14.js +1 -1
  90. package/dist/index140.js +37 -0
  91. package/dist/index140.js.map +1 -0
  92. package/dist/index141.js +73 -0
  93. package/dist/index141.js.map +1 -0
  94. package/dist/index142.js +5 -0
  95. package/dist/index142.js.map +1 -0
  96. package/dist/index143.js +5 -0
  97. package/dist/index143.js.map +1 -0
  98. package/dist/index144.js +25 -0
  99. package/dist/index144.js.map +1 -0
  100. package/dist/index145.js +5 -0
  101. package/dist/index145.js.map +1 -0
  102. package/dist/index146.js +5 -0
  103. package/dist/index146.js.map +1 -0
  104. package/dist/index147.js +5 -0
  105. package/dist/index147.js.map +1 -0
  106. package/dist/index148.js +5 -0
  107. package/dist/index148.js.map +1 -0
  108. package/dist/index149.js +7 -0
  109. package/dist/index149.js.map +1 -0
  110. package/dist/index59.js +1 -1
  111. package/dist/index66.js +66 -19
  112. package/dist/index66.js.map +1 -1
  113. package/dist/index67.js +18 -43
  114. package/dist/index67.js.map +1 -1
  115. package/dist/index68.js +44 -132
  116. package/dist/index68.js.map +1 -1
  117. package/dist/index69.js +132 -50
  118. package/dist/index69.js.map +1 -1
  119. package/dist/index70.js +51 -21
  120. package/dist/index70.js.map +1 -1
  121. package/dist/index71.js +19 -19
  122. package/dist/index71.js.map +1 -1
  123. package/dist/index72.js +20 -327
  124. package/dist/index72.js.map +1 -1
  125. package/dist/index73.js +323 -50
  126. package/dist/index73.js.map +1 -1
  127. package/dist/index74.js +56 -40
  128. package/dist/index74.js.map +1 -1
  129. package/dist/index75.js +40 -95
  130. package/dist/index75.js.map +1 -1
  131. package/dist/index76.js +88 -123
  132. package/dist/index76.js.map +1 -1
  133. package/dist/index77.js +123 -154
  134. package/dist/index77.js.map +1 -1
  135. package/dist/index78.js +159 -63
  136. package/dist/index78.js.map +1 -1
  137. package/dist/index79.js +65 -35
  138. package/dist/index79.js.map +1 -1
  139. package/dist/index80.js +35 -34
  140. package/dist/index80.js.map +1 -1
  141. package/dist/index81.js +222 -198
  142. package/dist/index81.js.map +1 -1
  143. package/dist/index82.js +34 -213
  144. package/dist/index82.js.map +1 -1
  145. package/dist/index83.js +190 -275
  146. package/dist/index83.js.map +1 -1
  147. package/dist/index84.js +202 -167
  148. package/dist/index84.js.map +1 -1
  149. package/dist/index85.js +263 -226
  150. package/dist/index85.js.map +1 -1
  151. package/dist/index86.js +176 -12
  152. package/dist/index86.js.map +1 -1
  153. package/dist/index87.js +257 -32
  154. package/dist/index87.js.map +1 -1
  155. package/dist/index88.js +13 -10792
  156. package/dist/index88.js.map +1 -1
  157. package/dist/index89.js +33 -5
  158. package/dist/index89.js.map +1 -1
  159. package/dist/index90.js +5 -41
  160. package/dist/index90.js.map +1 -1
  161. package/dist/index91.js +14 -2
  162. package/dist/index91.js.map +1 -1
  163. package/dist/index92.js +45 -6
  164. package/dist/index92.js.map +1 -1
  165. package/dist/index93.js +11 -150
  166. package/dist/index93.js.map +1 -1
  167. package/dist/index94.js +13 -28
  168. package/dist/index94.js.map +1 -1
  169. package/dist/index95.js +7 -29
  170. package/dist/index95.js.map +1 -1
  171. package/dist/index96.js +13 -2
  172. package/dist/index96.js.map +1 -1
  173. package/dist/index97.js +30 -71
  174. package/dist/index97.js.map +1 -1
  175. package/dist/index98.js +16 -37
  176. package/dist/index98.js.map +1 -1
  177. package/dist/index99.js +10792 -25
  178. package/dist/index99.js.map +1 -1
  179. package/package.json +1 -1
package/dist/index110.js CHANGED
@@ -1,5 +1,29 @@
1
- var a = {};
1
+ var i, u;
2
+ function n() {
3
+ if (u) return i;
4
+ u = 1;
5
+ function r() {
6
+ this.buffer = [], this.length = 0;
7
+ }
8
+ return r.prototype = {
9
+ get: function(f) {
10
+ const t = Math.floor(f / 8);
11
+ return (this.buffer[t] >>> 7 - f % 8 & 1) === 1;
12
+ },
13
+ put: function(f, t) {
14
+ for (let e = 0; e < t; e++)
15
+ this.putBit((f >>> t - e - 1 & 1) === 1);
16
+ },
17
+ getLengthInBits: function() {
18
+ return this.length;
19
+ },
20
+ putBit: function(f) {
21
+ const t = Math.floor(this.length / 8);
22
+ this.buffer.length <= t && this.buffer.push(0), f && (this.buffer[t] |= 128 >>> this.length % 8), this.length++;
23
+ }
24
+ }, i = r, i;
25
+ }
2
26
  export {
3
- a as __exports
27
+ n as __require
4
28
  };
5
29
  //# sourceMappingURL=index110.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index110.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
1
+ {"version":3,"file":"index110.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-buffer.js"],"sourcesContent":["function BitBuffer () {\n this.buffer = []\n this.length = 0\n}\n\nBitBuffer.prototype = {\n\n get: function (index) {\n const bufIndex = Math.floor(index / 8)\n return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) === 1\n },\n\n put: function (num, length) {\n for (let i = 0; i < length; i++) {\n this.putBit(((num >>> (length - i - 1)) & 1) === 1)\n }\n },\n\n getLengthInBits: function () {\n return this.length\n },\n\n putBit: function (bit) {\n const bufIndex = Math.floor(this.length / 8)\n if (this.buffer.length <= bufIndex) {\n this.buffer.push(0)\n }\n\n if (bit) {\n this.buffer[bufIndex] |= (0x80 >>> (this.length % 8))\n }\n\n this.length++\n }\n}\n\nmodule.exports = BitBuffer\n"],"names":["BitBuffer","index","bufIndex","num","length","i","bit","bitBuffer"],"mappings":";;;;AAAA,WAASA,IAAa;AACpB,SAAK,SAAS,CAAA,GACd,KAAK,SAAS;AAAA,EAChB;AAEA,SAAAA,EAAU,YAAY;AAAA,IAEpB,KAAK,SAAUC,GAAO;AACpB,YAAMC,IAAW,KAAK,MAAMD,IAAQ,CAAC;AACrC,cAAS,KAAK,OAAOC,CAAQ,MAAO,IAAID,IAAQ,IAAM,OAAO;AAAA,IACjE;AAAA,IAEE,KAAK,SAAUE,GAAKC,GAAQ;AAC1B,eAASC,IAAI,GAAGA,IAAID,GAAQC;AAC1B,aAAK,QAASF,MAASC,IAASC,IAAI,IAAM,OAAO,CAAC;AAAA,IAExD;AAAA,IAEE,iBAAiB,WAAY;AAC3B,aAAO,KAAK;AAAA,IAChB;AAAA,IAEE,QAAQ,SAAUC,GAAK;AACrB,YAAMJ,IAAW,KAAK,MAAM,KAAK,SAAS,CAAC;AAC3C,MAAI,KAAK,OAAO,UAAUA,KACxB,KAAK,OAAO,KAAK,CAAC,GAGhBI,MACF,KAAK,OAAOJ,CAAQ,KAAM,QAAU,KAAK,SAAS,IAGpD,KAAK;AAAA,IACT;AAAA,EACA,GAEAK,IAAiBP;;","x_google_ignoreList":[0]}
package/dist/index111.js CHANGED
@@ -1,59 +1,24 @@
1
- import { __exports as u } from "./index131.js";
2
- var s;
3
- function M() {
4
- return s ? u : (s = 1, (function(l) {
5
- function m(n) {
6
- if (typeof n == "number" && (n = n.toString()), typeof n != "string")
7
- throw new Error("Color should be defined as hex string");
8
- let e = n.slice().replace("#", "").split("");
9
- if (e.length < 3 || e.length === 5 || e.length > 8)
10
- throw new Error("Invalid hex color: " + n);
11
- (e.length === 3 || e.length === 4) && (e = Array.prototype.concat.apply([], e.map(function(t) {
12
- return [t, t];
13
- }))), e.length === 6 && e.push("F", "F");
14
- const r = parseInt(e.join(""), 16);
15
- return {
16
- r: r >> 24 & 255,
17
- g: r >> 16 & 255,
18
- b: r >> 8 & 255,
19
- a: r & 255,
20
- hex: "#" + e.slice(0, 6).join("")
21
- };
22
- }
23
- l.getOptions = function(e) {
24
- e || (e = {}), e.color || (e.color = {});
25
- const r = typeof e.margin > "u" || e.margin === null || e.margin < 0 ? 4 : e.margin, t = e.width && e.width >= 21 ? e.width : void 0, f = e.scale || 4;
26
- return {
27
- width: t,
28
- scale: t ? 4 : f,
29
- margin: r,
30
- color: {
31
- dark: m(e.color.dark || "#000000ff"),
32
- light: m(e.color.light || "#ffffffff")
33
- },
34
- type: e.type,
35
- rendererOpts: e.rendererOpts || {}
36
- };
37
- }, l.getScale = function(e, r) {
38
- return r.width && r.width >= e + r.margin * 2 ? r.width / (e + r.margin * 2) : r.scale;
39
- }, l.getImageWidth = function(e, r) {
40
- const t = l.getScale(e, r);
41
- return Math.floor((e + r.margin * 2) * t);
42
- }, l.qrToImageData = function(e, r, t) {
43
- const f = r.modules.size, w = r.modules.data, d = l.getScale(f, t), g = Math.floor((f + t.margin * 2) * d), a = t.margin * d, y = [t.color.light, t.color.dark];
44
- for (let i = 0; i < g; i++)
45
- for (let c = 0; c < g; c++) {
46
- let h = (i * g + c) * 4, o = t.color.light;
47
- if (i >= a && c >= a && i < g - a && c < g - a) {
48
- const b = Math.floor((i - a) / d), I = Math.floor((c - a) / d);
49
- o = y[w[b * f + I] ? 1 : 0];
50
- }
51
- e[h++] = o.r, e[h++] = o.g, e[h++] = o.b, e[h] = o.a;
52
- }
53
- };
54
- })(u), u);
1
+ var n, s;
2
+ function h() {
3
+ if (s) return n;
4
+ s = 1;
5
+ function i(t) {
6
+ if (!t || t < 1)
7
+ throw new Error("BitMatrix size must be defined and greater than 0");
8
+ this.size = t, this.data = new Uint8Array(t * t), this.reservedBit = new Uint8Array(t * t);
9
+ }
10
+ return i.prototype.set = function(t, r, e, o) {
11
+ const a = t * this.size + r;
12
+ this.data[a] = e, o && (this.reservedBit[a] = !0);
13
+ }, i.prototype.get = function(t, r) {
14
+ return this.data[t * this.size + r];
15
+ }, i.prototype.xor = function(t, r, e) {
16
+ this.data[t * this.size + r] ^= e;
17
+ }, i.prototype.isReserved = function(t, r) {
18
+ return this.reservedBit[t * this.size + r];
19
+ }, n = i, n;
55
20
  }
56
21
  export {
57
- M as __require
22
+ h as __require
58
23
  };
59
24
  //# sourceMappingURL=index111.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index111.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/renderer/utils.js"],"sourcesContent":["function hex2rgba (hex) {\n if (typeof hex === 'number') {\n hex = hex.toString()\n }\n\n if (typeof hex !== 'string') {\n throw new Error('Color should be defined as hex string')\n }\n\n let hexCode = hex.slice().replace('#', '').split('')\n if (hexCode.length < 3 || hexCode.length === 5 || hexCode.length > 8) {\n throw new Error('Invalid hex color: ' + hex)\n }\n\n // Convert from short to long form (fff -> ffffff)\n if (hexCode.length === 3 || hexCode.length === 4) {\n hexCode = Array.prototype.concat.apply([], hexCode.map(function (c) {\n return [c, c]\n }))\n }\n\n // Add default alpha value\n if (hexCode.length === 6) hexCode.push('F', 'F')\n\n const hexValue = parseInt(hexCode.join(''), 16)\n\n return {\n r: (hexValue >> 24) & 255,\n g: (hexValue >> 16) & 255,\n b: (hexValue >> 8) & 255,\n a: hexValue & 255,\n hex: '#' + hexCode.slice(0, 6).join('')\n }\n}\n\nexports.getOptions = function getOptions (options) {\n if (!options) options = {}\n if (!options.color) options.color = {}\n\n const margin = typeof options.margin === 'undefined' ||\n options.margin === null ||\n options.margin < 0\n ? 4\n : options.margin\n\n const width = options.width && options.width >= 21 ? options.width : undefined\n const scale = options.scale || 4\n\n return {\n width: width,\n scale: width ? 4 : scale,\n margin: margin,\n color: {\n dark: hex2rgba(options.color.dark || '#000000ff'),\n light: hex2rgba(options.color.light || '#ffffffff')\n },\n type: options.type,\n rendererOpts: options.rendererOpts || {}\n }\n}\n\nexports.getScale = function getScale (qrSize, opts) {\n return opts.width && opts.width >= qrSize + opts.margin * 2\n ? opts.width / (qrSize + opts.margin * 2)\n : opts.scale\n}\n\nexports.getImageWidth = function getImageWidth (qrSize, opts) {\n const scale = exports.getScale(qrSize, opts)\n return Math.floor((qrSize + opts.margin * 2) * scale)\n}\n\nexports.qrToImageData = function qrToImageData (imgData, qr, opts) {\n const size = qr.modules.size\n const data = qr.modules.data\n const scale = exports.getScale(size, opts)\n const symbolSize = Math.floor((size + opts.margin * 2) * scale)\n const scaledMargin = opts.margin * scale\n const palette = [opts.color.light, opts.color.dark]\n\n for (let i = 0; i < symbolSize; i++) {\n for (let j = 0; j < symbolSize; j++) {\n let posDst = (i * symbolSize + j) * 4\n let pxColor = opts.color.light\n\n if (i >= scaledMargin && j >= scaledMargin &&\n i < symbolSize - scaledMargin && j < symbolSize - scaledMargin) {\n const iSrc = Math.floor((i - scaledMargin) / scale)\n const jSrc = Math.floor((j - scaledMargin) / scale)\n pxColor = palette[data[iSrc * size + jSrc] ? 1 : 0]\n }\n\n imgData[posDst++] = pxColor.r\n imgData[posDst++] = pxColor.g\n imgData[posDst++] = pxColor.b\n imgData[posDst] = pxColor.a\n }\n }\n}\n"],"names":["hex2rgba","hex","hexCode","c","hexValue","exports","options","margin","width","scale","qrSize","opts","imgData","qr","size","data","symbolSize","scaledMargin","palette","j","posDst","pxColor","iSrc","jSrc"],"mappings":";;;;AAAA,aAASA,EAAUC,GAAK;AAKtB,UAJI,OAAOA,KAAQ,aACjBA,IAAMA,EAAI,SAAQ,IAGhB,OAAOA,KAAQ;AACjB,cAAM,IAAI,MAAM,uCAAuC;AAGzD,UAAIC,IAAUD,EAAI,MAAK,EAAG,QAAQ,KAAK,EAAE,EAAE,MAAM,EAAE;AACnD,UAAIC,EAAQ,SAAS,KAAKA,EAAQ,WAAW,KAAKA,EAAQ,SAAS;AACjE,cAAM,IAAI,MAAM,wBAAwBD,CAAG;AAI7C,OAAIC,EAAQ,WAAW,KAAKA,EAAQ,WAAW,OAC7CA,IAAU,MAAM,UAAU,OAAO,MAAM,CAAA,GAAIA,EAAQ,IAAI,SAAUC,GAAG;AAClE,eAAO,CAACA,GAAGA,CAAC;AAAA,MAClB,CAAK,CAAC,IAIAD,EAAQ,WAAW,KAAGA,EAAQ,KAAK,KAAK,GAAG;AAE/C,YAAME,IAAW,SAASF,EAAQ,KAAK,EAAE,GAAG,EAAE;AAE9C,aAAO;AAAA,QACL,GAAIE,KAAY,KAAM;AAAA,QACtB,GAAIA,KAAY,KAAM;AAAA,QACtB,GAAIA,KAAY,IAAK;AAAA,QACrB,GAAGA,IAAW;AAAA,QACd,KAAK,MAAMF,EAAQ,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE;AAAA,MAC1C;AAAA,IACA;AAEAG,IAAAA,EAAA,aAAqB,SAAqBC,GAAS;AACjD,MAAKA,MAASA,IAAU,CAAA,IACnBA,EAAQ,UAAOA,EAAQ,QAAQ,CAAA;AAEpC,YAAMC,IAAS,OAAOD,EAAQ,SAAW,OACvCA,EAAQ,WAAW,QACnBA,EAAQ,SAAS,IACf,IACAA,EAAQ,QAENE,IAAQF,EAAQ,SAASA,EAAQ,SAAS,KAAKA,EAAQ,QAAQ,QAC/DG,IAAQH,EAAQ,SAAS;AAE/B,aAAO;AAAA,QACL,OAAOE;AAAA,QACP,OAAOA,IAAQ,IAAIC;AAAA,QACnB,QAAQF;AAAA,QACR,OAAO;AAAA,UACL,MAAMP,EAASM,EAAQ,MAAM,QAAQ,WAAW;AAAA,UAChD,OAAON,EAASM,EAAQ,MAAM,SAAS,WAAW;AAAA;QAEpD,MAAMA,EAAQ;AAAA,QACd,cAAcA,EAAQ,gBAAgB,CAAA;AAAA,MAC1C;AAAA,IACA,GAEAD,EAAA,WAAmB,SAAmBK,GAAQC,GAAM;AAClD,aAAOA,EAAK,SAASA,EAAK,SAASD,IAASC,EAAK,SAAS,IACtDA,EAAK,SAASD,IAASC,EAAK,SAAS,KACrCA,EAAK;AAAA,IACX,GAEAN,EAAA,gBAAwB,SAAwBK,GAAQC,GAAM;AAC5D,YAAMF,IAAQJ,EAAQ,SAASK,GAAQC,CAAI;AAC3C,aAAO,KAAK,OAAOD,IAASC,EAAK,SAAS,KAAKF,CAAK;AAAA,IACtD,GAEAJ,EAAA,gBAAwB,SAAwBO,GAASC,GAAIF,GAAM;AACjE,YAAMG,IAAOD,EAAG,QAAQ,MAClBE,IAAOF,EAAG,QAAQ,MAClBJ,IAAQJ,EAAQ,SAASS,GAAMH,CAAI,GACnCK,IAAa,KAAK,OAAOF,IAAOH,EAAK,SAAS,KAAKF,CAAK,GACxDQ,IAAeN,EAAK,SAASF,GAC7BS,IAAU,CAACP,EAAK,MAAM,OAAOA,EAAK,MAAM,IAAI;AAElD,eAAS,IAAI,GAAG,IAAIK,GAAY;AAC9B,iBAASG,IAAI,GAAGA,IAAIH,GAAYG,KAAK;AACnC,cAAIC,KAAU,IAAIJ,IAAaG,KAAK,GAChCE,IAAUV,EAAK,MAAM;AAEzB,cAAI,KAAKM,KAAgBE,KAAKF,KAC5B,IAAID,IAAaC,KAAgBE,IAAIH,IAAaC,GAAc;AAChE,kBAAMK,IAAO,KAAK,OAAO,IAAIL,KAAgBR,CAAK,GAC5Cc,IAAO,KAAK,OAAOJ,IAAIF,KAAgBR,CAAK;AAClD,YAAAY,IAAUH,EAAQH,EAAKO,IAAOR,IAAOS,CAAI,IAAI,IAAI,CAAC;AAAA,UAC1D;AAEM,UAAAX,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,GAAQ,IAAIC,EAAQ,GAC5BT,EAAQQ,CAAM,IAAIC,EAAQ;AAAA,QAChC;AAAA,IAEA;AAAA;;","x_google_ignoreList":[0]}
1
+ {"version":3,"file":"index111.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/bit-matrix.js"],"sourcesContent":["/**\n * Helper class to handle QR Code symbol modules\n *\n * @param {Number} size Symbol size\n */\nfunction BitMatrix (size) {\n if (!size || size < 1) {\n throw new Error('BitMatrix size must be defined and greater than 0')\n }\n\n this.size = size\n this.data = new Uint8Array(size * size)\n this.reservedBit = new Uint8Array(size * size)\n}\n\n/**\n * Set bit value at specified location\n * If reserved flag is set, this bit will be ignored during masking process\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n * @param {Boolean} reserved\n */\nBitMatrix.prototype.set = function (row, col, value, reserved) {\n const index = row * this.size + col\n this.data[index] = value\n if (reserved) this.reservedBit[index] = true\n}\n\n/**\n * Returns bit value at specified location\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.get = function (row, col) {\n return this.data[row * this.size + col]\n}\n\n/**\n * Applies xor operator at specified location\n * (used during masking process)\n *\n * @param {Number} row\n * @param {Number} col\n * @param {Boolean} value\n */\nBitMatrix.prototype.xor = function (row, col, value) {\n this.data[row * this.size + col] ^= value\n}\n\n/**\n * Check if bit at specified location is reserved\n *\n * @param {Number} row\n * @param {Number} col\n * @return {Boolean}\n */\nBitMatrix.prototype.isReserved = function (row, col) {\n return this.reservedBit[row * this.size + col]\n}\n\nmodule.exports = BitMatrix\n"],"names":["BitMatrix","size","row","col","value","reserved","index","bitMatrix"],"mappings":";;;;AAKA,WAASA,EAAWC,GAAM;AACxB,QAAI,CAACA,KAAQA,IAAO;AAClB,YAAM,IAAI,MAAM,mDAAmD;AAGrE,SAAK,OAAOA,GACZ,KAAK,OAAO,IAAI,WAAWA,IAAOA,CAAI,GACtC,KAAK,cAAc,IAAI,WAAWA,IAAOA,CAAI;AAAA,EAC/C;AAWA,SAAAD,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAKC,GAAOC,GAAU;AAC7D,UAAMC,IAAQJ,IAAM,KAAK,OAAOC;AAChC,SAAK,KAAKG,CAAK,IAAIF,GACfC,MAAU,KAAK,YAAYC,CAAK,IAAI;AAAA,EAC1C,GASAN,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAK;AAC5C,WAAO,KAAK,KAAKD,IAAM,KAAK,OAAOC,CAAG;AAAA,EACxC,GAUAH,EAAU,UAAU,MAAM,SAAUE,GAAKC,GAAKC,GAAO;AACnD,SAAK,KAAKF,IAAM,KAAK,OAAOC,CAAG,KAAKC;AAAA,EACtC,GASAJ,EAAU,UAAU,aAAa,SAAUE,GAAKC,GAAK;AACnD,WAAO,KAAK,YAAYD,IAAM,KAAK,OAAOC,CAAG;AAAA,EAC/C,GAEAI,IAAiBP;;","x_google_ignoreList":[0]}
package/dist/index112.js CHANGED
@@ -1,5 +1,27 @@
1
- var a = {};
1
+ import { __exports as u } from "./index126.js";
2
+ import { __require as a } from "./index108.js";
3
+ var l;
4
+ function p() {
5
+ return l ? u : (l = 1, (function(s) {
6
+ const c = a().getSymbolSize;
7
+ s.getRowColCoords = function(r) {
8
+ if (r === 1) return [];
9
+ const i = Math.floor(r / 7) + 2, e = c(r), n = e === 145 ? 26 : Math.ceil((e - 13) / (2 * i - 2)) * 2, t = [e - 7];
10
+ for (let o = 1; o < i - 1; o++)
11
+ t[o] = t[o - 1] - n;
12
+ return t.push(6), t.reverse();
13
+ }, s.getPositions = function(r) {
14
+ const i = [], e = s.getRowColCoords(r), n = e.length;
15
+ for (let t = 0; t < n; t++)
16
+ for (let o = 0; o < n; o++)
17
+ t === 0 && o === 0 || // top-left
18
+ t === 0 && o === n - 1 || // bottom-left
19
+ t === n - 1 && o === 0 || i.push([e[t], e[o]]);
20
+ return i;
21
+ };
22
+ })(u), u);
23
+ }
2
24
  export {
3
- a as __exports
25
+ p as __require
4
26
  };
5
27
  //# sourceMappingURL=index112.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index112.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
1
+ {"version":3,"file":"index112.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/alignment-pattern.js"],"sourcesContent":["/**\n * Alignment pattern are fixed reference pattern in defined positions\n * in a matrix symbology, which enables the decode software to re-synchronise\n * the coordinate mapping of the image modules in the event of moderate amounts\n * of distortion of the image.\n *\n * Alignment patterns are present only in QR Code symbols of version 2 or larger\n * and their number depends on the symbol version.\n */\n\nconst getSymbolSize = require('./utils').getSymbolSize\n\n/**\n * Calculate the row/column coordinates of the center module of each alignment pattern\n * for the specified QR Code version.\n *\n * The alignment patterns are positioned symmetrically on either side of the diagonal\n * running from the top left corner of the symbol to the bottom right corner.\n *\n * Since positions are simmetrical only half of the coordinates are returned.\n * Each item of the array will represent in turn the x and y coordinate.\n * @see {@link getPositions}\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinate\n */\nexports.getRowColCoords = function getRowColCoords (version) {\n if (version === 1) return []\n\n const posCount = Math.floor(version / 7) + 2\n const size = getSymbolSize(version)\n const intervals = size === 145 ? 26 : Math.ceil((size - 13) / (2 * posCount - 2)) * 2\n const positions = [size - 7] // Last coord is always (size - 7)\n\n for (let i = 1; i < posCount - 1; i++) {\n positions[i] = positions[i - 1] - intervals\n }\n\n positions.push(6) // First coord is always 6\n\n return positions.reverse()\n}\n\n/**\n * Returns an array containing the positions of each alignment pattern.\n * Each array's element represent the center point of the pattern as (x, y) coordinates\n *\n * Coordinates are calculated expanding the row/column coordinates returned by {@link getRowColCoords}\n * and filtering out the items that overlaps with finder pattern\n *\n * @example\n * For a Version 7 symbol {@link getRowColCoords} returns values 6, 22 and 38.\n * The alignment patterns, therefore, are to be centered on (row, column)\n * positions (6,22), (22,6), (22,22), (22,38), (38,22), (38,38).\n * Note that the coordinates (6,6), (6,38), (38,6) are occupied by finder patterns\n * and are not therefore used for alignment patterns.\n *\n * let pos = getPositions(7)\n * // [[6,22], [22,6], [22,22], [22,38], [38,22], [38,38]]\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n const coords = []\n const pos = exports.getRowColCoords(version)\n const posLength = pos.length\n\n for (let i = 0; i < posLength; i++) {\n for (let j = 0; j < posLength; j++) {\n // Skip if position is occupied by finder patterns\n if ((i === 0 && j === 0) || // top-left\n (i === 0 && j === posLength - 1) || // bottom-left\n (i === posLength - 1 && j === 0)) { // top-right\n continue\n }\n\n coords.push([pos[i], pos[j]])\n }\n }\n\n return coords\n}\n"],"names":["getSymbolSize","require$$0","exports","version","posCount","size","intervals","positions","i","coords","pos","posLength","j"],"mappings":";;;;;AAUA,UAAMA,IAAgBC,IAAmB;AAgBzCC,IAAAA,EAAA,kBAA0B,SAA0BC,GAAS;AAC3D,UAAIA,MAAY,EAAG,QAAO,CAAA;AAE1B,YAAMC,IAAW,KAAK,MAAMD,IAAU,CAAC,IAAI,GACrCE,IAAOL,EAAcG,CAAO,GAC5BG,IAAYD,MAAS,MAAM,KAAK,KAAK,MAAMA,IAAO,OAAO,IAAID,IAAW,EAAE,IAAI,GAC9EG,IAAY,CAACF,IAAO,CAAC;AAE3B,eAASG,IAAI,GAAGA,IAAIJ,IAAW,GAAGI;AAChC,QAAAD,EAAUC,CAAC,IAAID,EAAUC,IAAI,CAAC,IAAIF;AAGpC,aAAAC,EAAU,KAAK,CAAC,GAETA,EAAU,QAAO;AAAA,IAC1B,GAsBAL,EAAA,eAAuB,SAAuBC,GAAS;AACrD,YAAMM,IAAS,CAAA,GACTC,IAAMR,EAAQ,gBAAgBC,CAAO,GACrCQ,IAAYD,EAAI;AAEtB,eAASF,IAAI,GAAGA,IAAIG,GAAWH;AAC7B,iBAASI,IAAI,GAAGA,IAAID,GAAWC;AAE7B,UAAKJ,MAAM,KAAKI,MAAM;AAAA,UACjBJ,MAAM,KAAKI,MAAMD,IAAY;AAAA,UAC7BH,MAAMG,IAAY,KAAKC,MAAM,KAIlCH,EAAO,KAAK,CAACC,EAAIF,CAAC,GAAGE,EAAIE,CAAC,CAAC,CAAC;AAIhC,aAAOH;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}
package/dist/index113.js CHANGED
@@ -1,5 +1,23 @@
1
- var r = {};
1
+ import { __exports as e } from "./index127.js";
2
+ import { __require as s } from "./index108.js";
3
+ var i;
4
+ function f() {
5
+ if (i) return e;
6
+ i = 1;
7
+ const n = s().getSymbolSize, r = 7;
8
+ return e.getPositions = function(o) {
9
+ const t = n(o);
10
+ return [
11
+ // top-left
12
+ [0, 0],
13
+ // top-right
14
+ [t - r, 0],
15
+ // bottom-left
16
+ [0, t - r]
17
+ ];
18
+ }, e;
19
+ }
2
20
  export {
3
- r as __exports
21
+ f as __require
4
22
  };
5
23
  //# sourceMappingURL=index113.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index113.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
1
+ {"version":3,"file":"index113.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/finder-pattern.js"],"sourcesContent":["const getSymbolSize = require('./utils').getSymbolSize\nconst FINDER_PATTERN_SIZE = 7\n\n/**\n * Returns an array containing the positions of each finder pattern.\n * Each array's element represent the top-left point of the pattern as (x, y) coordinates\n *\n * @param {Number} version QR Code version\n * @return {Array} Array of coordinates\n */\nexports.getPositions = function getPositions (version) {\n const size = getSymbolSize(version)\n\n return [\n // top-left\n [0, 0],\n // top-right\n [size - FINDER_PATTERN_SIZE, 0],\n // bottom-left\n [0, size - FINDER_PATTERN_SIZE]\n ]\n}\n"],"names":["getSymbolSize","require$$0","FINDER_PATTERN_SIZE","finderPattern","version","size"],"mappings":";;;;;;AAAA,QAAMA,IAAgBC,IAAmB,eACnCC,IAAsB;AAS5B,SAAAC,EAAA,eAAuB,SAAuBC,GAAS;AACrD,UAAMC,IAAOL,EAAcI,CAAO;AAElC,WAAO;AAAA;AAAA,MAEL,CAAC,GAAG,CAAC;AAAA;AAAA,MAEL,CAACC,IAAOH,GAAqB,CAAC;AAAA;AAAA,MAE9B,CAAC,GAAGG,IAAOH,CAAmB;AAAA,IAClC;AAAA,EACA;;","x_google_ignoreList":[0]}
package/dist/index114.js CHANGED
@@ -1,5 +1,103 @@
1
- var r = {};
1
+ import { __exports as c } from "./index128.js";
2
+ var T;
3
+ function R() {
4
+ return T ? c : (T = 1, (function(r) {
5
+ r.Patterns = {
6
+ PATTERN000: 0,
7
+ PATTERN001: 1,
8
+ PATTERN010: 2,
9
+ PATTERN011: 3,
10
+ PATTERN100: 4,
11
+ PATTERN101: 5,
12
+ PATTERN110: 6,
13
+ PATTERN111: 7
14
+ };
15
+ const u = {
16
+ N1: 3,
17
+ N2: 3,
18
+ N3: 40,
19
+ N4: 10
20
+ };
21
+ r.isValid = function(t) {
22
+ return t != null && t !== "" && !isNaN(t) && t >= 0 && t <= 7;
23
+ }, r.from = function(t) {
24
+ return r.isValid(t) ? parseInt(t, 10) : void 0;
25
+ }, r.getPenaltyN1 = function(t) {
26
+ const l = t.size;
27
+ let s = 0, n = 0, e = 0, i = null, o = null;
28
+ for (let f = 0; f < l; f++) {
29
+ n = e = 0, i = o = null;
30
+ for (let N = 0; N < l; N++) {
31
+ let a = t.get(f, N);
32
+ a === i ? n++ : (n >= 5 && (s += u.N1 + (n - 5)), i = a, n = 1), a = t.get(N, f), a === o ? e++ : (e >= 5 && (s += u.N1 + (e - 5)), o = a, e = 1);
33
+ }
34
+ n >= 5 && (s += u.N1 + (n - 5)), e >= 5 && (s += u.N1 + (e - 5));
35
+ }
36
+ return s;
37
+ }, r.getPenaltyN2 = function(t) {
38
+ const l = t.size;
39
+ let s = 0;
40
+ for (let n = 0; n < l - 1; n++)
41
+ for (let e = 0; e < l - 1; e++) {
42
+ const i = t.get(n, e) + t.get(n, e + 1) + t.get(n + 1, e) + t.get(n + 1, e + 1);
43
+ (i === 4 || i === 0) && s++;
44
+ }
45
+ return s * u.N2;
46
+ }, r.getPenaltyN3 = function(t) {
47
+ const l = t.size;
48
+ let s = 0, n = 0, e = 0;
49
+ for (let i = 0; i < l; i++) {
50
+ n = e = 0;
51
+ for (let o = 0; o < l; o++)
52
+ n = n << 1 & 2047 | t.get(i, o), o >= 10 && (n === 1488 || n === 93) && s++, e = e << 1 & 2047 | t.get(o, i), o >= 10 && (e === 1488 || e === 93) && s++;
53
+ }
54
+ return s * u.N3;
55
+ }, r.getPenaltyN4 = function(t) {
56
+ let l = 0;
57
+ const s = t.data.length;
58
+ for (let e = 0; e < s; e++) l += t.data[e];
59
+ return Math.abs(Math.ceil(l * 100 / s / 5) - 10) * u.N4;
60
+ };
61
+ function g(P, t, l) {
62
+ switch (P) {
63
+ case r.Patterns.PATTERN000:
64
+ return (t + l) % 2 === 0;
65
+ case r.Patterns.PATTERN001:
66
+ return t % 2 === 0;
67
+ case r.Patterns.PATTERN010:
68
+ return l % 3 === 0;
69
+ case r.Patterns.PATTERN011:
70
+ return (t + l) % 3 === 0;
71
+ case r.Patterns.PATTERN100:
72
+ return (Math.floor(t / 2) + Math.floor(l / 3)) % 2 === 0;
73
+ case r.Patterns.PATTERN101:
74
+ return t * l % 2 + t * l % 3 === 0;
75
+ case r.Patterns.PATTERN110:
76
+ return (t * l % 2 + t * l % 3) % 2 === 0;
77
+ case r.Patterns.PATTERN111:
78
+ return (t * l % 3 + (t + l) % 2) % 2 === 0;
79
+ default:
80
+ throw new Error("bad maskPattern:" + P);
81
+ }
82
+ }
83
+ r.applyMask = function(t, l) {
84
+ const s = l.size;
85
+ for (let n = 0; n < s; n++)
86
+ for (let e = 0; e < s; e++)
87
+ l.isReserved(e, n) || l.xor(e, n, g(t, e, n));
88
+ }, r.getBestMask = function(t, l) {
89
+ const s = Object.keys(r.Patterns).length;
90
+ let n = 0, e = 1 / 0;
91
+ for (let i = 0; i < s; i++) {
92
+ l(i), r.applyMask(i, t);
93
+ const o = r.getPenaltyN1(t) + r.getPenaltyN2(t) + r.getPenaltyN3(t) + r.getPenaltyN4(t);
94
+ r.applyMask(i, t), o < e && (e = o, n = i);
95
+ }
96
+ return n;
97
+ };
98
+ })(c), c);
99
+ }
2
100
  export {
3
- r as __exports
101
+ R as __require
4
102
  };
5
103
  //# sourceMappingURL=index114.js.map
@@ -1 +1 @@
1
- {"version":3,"file":"index114.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
1
+ {"version":3,"file":"index114.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/mask-pattern.js"],"sourcesContent":["/**\n * Data mask pattern reference\n * @type {Object}\n */\nexports.Patterns = {\n PATTERN000: 0,\n PATTERN001: 1,\n PATTERN010: 2,\n PATTERN011: 3,\n PATTERN100: 4,\n PATTERN101: 5,\n PATTERN110: 6,\n PATTERN111: 7\n}\n\n/**\n * Weighted penalty scores for the undesirable features\n * @type {Object}\n */\nconst PenaltyScores = {\n N1: 3,\n N2: 3,\n N3: 40,\n N4: 10\n}\n\n/**\n * Check if mask pattern value is valid\n *\n * @param {Number} mask Mask pattern\n * @return {Boolean} true if valid, false otherwise\n */\nexports.isValid = function isValid (mask) {\n return mask != null && mask !== '' && !isNaN(mask) && mask >= 0 && mask <= 7\n}\n\n/**\n * Returns mask pattern from a value.\n * If value is not valid, returns undefined\n *\n * @param {Number|String} value Mask pattern value\n * @return {Number} Valid mask pattern or undefined\n */\nexports.from = function from (value) {\n return exports.isValid(value) ? parseInt(value, 10) : undefined\n}\n\n/**\n* Find adjacent modules in row/column with the same color\n* and assign a penalty value.\n*\n* Points: N1 + i\n* i is the amount by which the number of adjacent modules of the same color exceeds 5\n*/\nexports.getPenaltyN1 = function getPenaltyN1 (data) {\n const size = data.size\n let points = 0\n let sameCountCol = 0\n let sameCountRow = 0\n let lastCol = null\n let lastRow = null\n\n for (let row = 0; row < size; row++) {\n sameCountCol = sameCountRow = 0\n lastCol = lastRow = null\n\n for (let col = 0; col < size; col++) {\n let module = data.get(row, col)\n if (module === lastCol) {\n sameCountCol++\n } else {\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n lastCol = module\n sameCountCol = 1\n }\n\n module = data.get(col, row)\n if (module === lastRow) {\n sameCountRow++\n } else {\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n lastRow = module\n sameCountRow = 1\n }\n }\n\n if (sameCountCol >= 5) points += PenaltyScores.N1 + (sameCountCol - 5)\n if (sameCountRow >= 5) points += PenaltyScores.N1 + (sameCountRow - 5)\n }\n\n return points\n}\n\n/**\n * Find 2x2 blocks with the same color and assign a penalty value\n *\n * Points: N2 * (m - 1) * (n - 1)\n */\nexports.getPenaltyN2 = function getPenaltyN2 (data) {\n const size = data.size\n let points = 0\n\n for (let row = 0; row < size - 1; row++) {\n for (let col = 0; col < size - 1; col++) {\n const last = data.get(row, col) +\n data.get(row, col + 1) +\n data.get(row + 1, col) +\n data.get(row + 1, col + 1)\n\n if (last === 4 || last === 0) points++\n }\n }\n\n return points * PenaltyScores.N2\n}\n\n/**\n * Find 1:1:3:1:1 ratio (dark:light:dark:light:dark) pattern in row/column,\n * preceded or followed by light area 4 modules wide\n *\n * Points: N3 * number of pattern found\n */\nexports.getPenaltyN3 = function getPenaltyN3 (data) {\n const size = data.size\n let points = 0\n let bitsCol = 0\n let bitsRow = 0\n\n for (let row = 0; row < size; row++) {\n bitsCol = bitsRow = 0\n for (let col = 0; col < size; col++) {\n bitsCol = ((bitsCol << 1) & 0x7FF) | data.get(row, col)\n if (col >= 10 && (bitsCol === 0x5D0 || bitsCol === 0x05D)) points++\n\n bitsRow = ((bitsRow << 1) & 0x7FF) | data.get(col, row)\n if (col >= 10 && (bitsRow === 0x5D0 || bitsRow === 0x05D)) points++\n }\n }\n\n return points * PenaltyScores.N3\n}\n\n/**\n * Calculate proportion of dark modules in entire symbol\n *\n * Points: N4 * k\n *\n * k is the rating of the deviation of the proportion of dark modules\n * in the symbol from 50% in steps of 5%\n */\nexports.getPenaltyN4 = function getPenaltyN4 (data) {\n let darkCount = 0\n const modulesCount = data.data.length\n\n for (let i = 0; i < modulesCount; i++) darkCount += data.data[i]\n\n const k = Math.abs(Math.ceil((darkCount * 100 / modulesCount) / 5) - 10)\n\n return k * PenaltyScores.N4\n}\n\n/**\n * Return mask value at given position\n *\n * @param {Number} maskPattern Pattern reference value\n * @param {Number} i Row\n * @param {Number} j Column\n * @return {Boolean} Mask value\n */\nfunction getMaskAt (maskPattern, i, j) {\n switch (maskPattern) {\n case exports.Patterns.PATTERN000: return (i + j) % 2 === 0\n case exports.Patterns.PATTERN001: return i % 2 === 0\n case exports.Patterns.PATTERN010: return j % 3 === 0\n case exports.Patterns.PATTERN011: return (i + j) % 3 === 0\n case exports.Patterns.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 === 0\n case exports.Patterns.PATTERN101: return (i * j) % 2 + (i * j) % 3 === 0\n case exports.Patterns.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 === 0\n case exports.Patterns.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 === 0\n\n default: throw new Error('bad maskPattern:' + maskPattern)\n }\n}\n\n/**\n * Apply a mask pattern to a BitMatrix\n *\n * @param {Number} pattern Pattern reference number\n * @param {BitMatrix} data BitMatrix data\n */\nexports.applyMask = function applyMask (pattern, data) {\n const size = data.size\n\n for (let col = 0; col < size; col++) {\n for (let row = 0; row < size; row++) {\n if (data.isReserved(row, col)) continue\n data.xor(row, col, getMaskAt(pattern, row, col))\n }\n }\n}\n\n/**\n * Returns the best mask pattern for data\n *\n * @param {BitMatrix} data\n * @return {Number} Mask pattern reference number\n */\nexports.getBestMask = function getBestMask (data, setupFormatFunc) {\n const numPatterns = Object.keys(exports.Patterns).length\n let bestPattern = 0\n let lowerPenalty = Infinity\n\n for (let p = 0; p < numPatterns; p++) {\n setupFormatFunc(p)\n exports.applyMask(p, data)\n\n // Calculate penalty\n const penalty =\n exports.getPenaltyN1(data) +\n exports.getPenaltyN2(data) +\n exports.getPenaltyN3(data) +\n exports.getPenaltyN4(data)\n\n // Undo previously applied mask\n exports.applyMask(p, data)\n\n if (penalty < lowerPenalty) {\n lowerPenalty = penalty\n bestPattern = p\n }\n }\n\n return bestPattern\n}\n"],"names":["exports","PenaltyScores","mask","value","data","size","points","sameCountCol","sameCountRow","lastCol","lastRow","row","col","module","last","bitsCol","bitsRow","darkCount","modulesCount","i","getMaskAt","maskPattern","j","pattern","setupFormatFunc","numPatterns","bestPattern","lowerPenalty","p","penalty"],"mappings":";;;;AAIAA,IAAAA,EAAA,WAAmB;AAAA,MACjB,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,MACZ,YAAY;AAAA,IACd;AAMA,UAAMC,IAAgB;AAAA,MACpB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,IAAI;AAAA,IACN;AAQAD,IAAAA,EAAA,UAAkB,SAAkBE,GAAM;AACxC,aAAOA,KAAQ,QAAQA,MAAS,MAAM,CAAC,MAAMA,CAAI,KAAKA,KAAQ,KAAKA,KAAQ;AAAA,IAC7E,GASAF,EAAA,OAAe,SAAeG,GAAO;AACnC,aAAOH,EAAQ,QAAQG,CAAK,IAAI,SAASA,GAAO,EAAE,IAAI;AAAA,IACxD,GASAH,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTC,IAAe,GACfC,IAAe,GACfC,IAAU,MACVC,IAAU;AAEd,eAASC,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAJ,IAAeC,IAAe,GAC9BC,IAAUC,IAAU;AAEpB,iBAASE,IAAM,GAAGA,IAAMP,GAAMO,KAAO;AACnC,cAAIC,IAAST,EAAK,IAAIO,GAAKC,CAAG;AAC9B,UAAIC,MAAWJ,IACbF,OAEIA,KAAgB,MAAGD,KAAUL,EAAc,MAAMM,IAAe,KACpEE,IAAUI,GACVN,IAAe,IAGjBM,IAAST,EAAK,IAAIQ,GAAKD,CAAG,GACtBE,MAAWH,IACbF,OAEIA,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe,KACpEE,IAAUG,GACVL,IAAe;AAAA,QAEvB;AAEI,QAAID,KAAgB,MAAGD,KAAUL,EAAc,MAAMM,IAAe,KAChEC,KAAgB,MAAGF,KAAUL,EAAc,MAAMO,IAAe;AAAA,MACxE;AAEE,aAAOF;AAAA,IACT,GAOAN,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS;AAEb,eAASK,IAAM,GAAGA,IAAMN,IAAO,GAAGM;AAChC,iBAASC,IAAM,GAAGA,IAAMP,IAAO,GAAGO,KAAO;AACvC,gBAAME,IAAOV,EAAK,IAAIO,GAAKC,CAAG,IAC5BR,EAAK,IAAIO,GAAKC,IAAM,CAAC,IACrBR,EAAK,IAAIO,IAAM,GAAGC,CAAG,IACrBR,EAAK,IAAIO,IAAM,GAAGC,IAAM,CAAC;AAE3B,WAAIE,MAAS,KAAKA,MAAS,MAAGR;AAAA,QACpC;AAGE,aAAOA,IAASL,EAAc;AAAA,IAChC,GAQAD,EAAA,eAAuB,SAAuBI,GAAM;AAClD,YAAMC,IAAOD,EAAK;AAClB,UAAIE,IAAS,GACTS,IAAU,GACVC,IAAU;AAEd,eAASL,IAAM,GAAGA,IAAMN,GAAMM,KAAO;AACnC,QAAAI,IAAUC,IAAU;AACpB,iBAASJ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,UAAAG,IAAYA,KAAW,IAAK,OAASX,EAAK,IAAIO,GAAKC,CAAG,GAClDA,KAAO,OAAOG,MAAY,QAASA,MAAY,OAAQT,KAE3DU,IAAYA,KAAW,IAAK,OAASZ,EAAK,IAAIQ,GAAKD,CAAG,GAClDC,KAAO,OAAOI,MAAY,QAASA,MAAY,OAAQV;AAAA,MAEjE;AAEE,aAAOA,IAASL,EAAc;AAAA,IAChC,GAUAD,EAAA,eAAuB,SAAuBI,GAAM;AAClD,UAAIa,IAAY;AAChB,YAAMC,IAAed,EAAK,KAAK;AAE/B,eAASe,IAAI,GAAGA,IAAID,GAAcC,IAAK,CAAAF,KAAab,EAAK,KAAKe,CAAC;AAI/D,aAFU,KAAK,IAAI,KAAK,KAAMF,IAAY,MAAMC,IAAgB,CAAC,IAAI,EAAE,IAE5DjB,EAAc;AAAA,IAC3B;AAUA,aAASmB,EAAWC,GAAaF,GAAGG,GAAG;AACrC,cAAQD,GAAW;AAAA,QACjB,KAAKrB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,iBAAOmB,IAAI,MAAM;AAAA,QACnD,KAAKnB,EAAQ,SAAS;AAAY,iBAAOsB,IAAI,MAAM;AAAA,QACnD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQmB,IAAIG,KAAK,MAAM;AAAA,QACzD,KAAKtB,EAAQ,SAAS;AAAY,kBAAQ,KAAK,MAAMmB,IAAI,CAAC,IAAI,KAAK,MAAMG,IAAI,CAAC,KAAK,MAAM;AAAA,QACzF,KAAKtB,EAAQ,SAAS;AAAY,iBAAQmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,MAAM;AAAA,QACvE,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,IAAKH,IAAIG,IAAK,KAAK,MAAM;AAAA,QAC7E,KAAKtB,EAAQ,SAAS;AAAY,kBAASmB,IAAIG,IAAK,KAAKH,IAAIG,KAAK,KAAK,MAAM;AAAA,QAE7E;AAAS,gBAAM,IAAI,MAAM,qBAAqBD,CAAW;AAAA,MAC7D;AAAA,IACA;AAQArB,IAAAA,EAAA,YAAoB,SAAoBuB,GAASnB,GAAM;AACrD,YAAMC,IAAOD,EAAK;AAElB,eAASQ,IAAM,GAAGA,IAAMP,GAAMO;AAC5B,iBAASD,IAAM,GAAGA,IAAMN,GAAMM;AAC5B,UAAIP,EAAK,WAAWO,GAAKC,CAAG,KAC5BR,EAAK,IAAIO,GAAKC,GAAKQ,EAAUG,GAASZ,GAAKC,CAAG,CAAC;AAAA,IAGrD,GAQAZ,EAAA,cAAsB,SAAsBI,GAAMoB,GAAiB;AACjE,YAAMC,IAAc,OAAO,KAAKzB,EAAQ,QAAQ,EAAE;AAClD,UAAI0B,IAAc,GACdC,IAAe;AAEnB,eAASC,IAAI,GAAGA,IAAIH,GAAaG,KAAK;AACpC,QAAAJ,EAAgBI,CAAC,GACjB5B,EAAQ,UAAU4B,GAAGxB,CAAI;AAGzB,cAAMyB,IACJ7B,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI,IACzBJ,EAAQ,aAAaI,CAAI;AAG3BJ,QAAAA,EAAQ,UAAU4B,GAAGxB,CAAI,GAErByB,IAAUF,MACZA,IAAeE,GACfH,IAAcE;AAAA,MAEpB;AAEE,aAAOF;AAAA,IACT;AAAA;;","x_google_ignoreList":[0]}