@ozdao/prometheus-framework 0.2.199 → 0.2.201

package/dist/node_modules/qrcode/lib/core/polynomial.js

@@ -1,29 +1,36 @@
-import { __exports as u } from "../../../../_virtual/polynomial.js";
+import { __exports as polynomial } from "../../../../_virtual/polynomial.js";
 import "./galois-field.js";
-import { __exports as a } from "../../../../_virtual/galois-field.js";
-(function(r) {
-  const f = a;
-  r.mul = function(l, n) {
-    const e = new Uint8Array(l.length + n.length - 1);
-    for (let o = 0; o < l.length; o++)
-      for (let t = 0; t < n.length; t++)
-        e[o + t] ^= f.mul(l[o], n[t]);
-    return e;
-  }, r.mod = function(l, n) {
-    let e = new Uint8Array(l);
-    for (; e.length - n.length >= 0; ) {
-      const o = e[0];
-      for (let i = 0; i < n.length; i++)
-        e[i] ^= f.mul(n[i], o);
-      let t = 0;
-      for (; t < e.length && e[t] === 0; ) t++;
-      e = e.slice(t);
+import { __exports as galoisField } from "../../../../_virtual/galois-field.js";
+(function(exports) {
+  const GF = galoisField;
+  exports.mul = function mul(p1, p2) {
+    const coeff = new Uint8Array(p1.length + p2.length - 1);
+    for (let i = 0; i < p1.length; i++) {
+      for (let j = 0; j < p2.length; j++) {
+        coeff[i + j] ^= GF.mul(p1[i], p2[j]);
+      }
     }
-    return e;
-  }, r.generateECPolynomial = function(l) {
-    let n = new Uint8Array([1]);
-    for (let e = 0; e < l; e++)
-      n = r.mul(n, new Uint8Array([1, f.exp(e)]));
-    return n;
+    return coeff;
   };
-})(u);
+  exports.mod = function mod(divident, divisor) {
+    let result = new Uint8Array(divident);
+    while (result.length - divisor.length >= 0) {
+      const coeff = result[0];
+      for (let i = 0; i < divisor.length; i++) {
+        result[i] ^= GF.mul(divisor[i], coeff);
+      }
+      let offset = 0;
+      while (offset < result.length && result[offset] === 0) offset++;
+      result = result.slice(offset);
+    }
+    return result;
+  };
+  exports.generateECPolynomial = function generateECPolynomial(degree) {
+    let poly = new Uint8Array([1]);
+    for (let i = 0; i < degree; i++) {
+      poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]));
+    }
+    return poly;
+  };
+})(polynomial);
+//# sourceMappingURL=polynomial.js.map

package/dist/node_modules/qrcode/lib/core/polynomial.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"polynomial.js","sources":["../../../../../../node_modules/qrcode/lib/core/polynomial.js"],"sourcesContent":["const GF = require('./galois-field')\n\n/**\n * Multiplies two polynomials inside Galois Field\n *\n * @param  {Uint8Array} p1 Polynomial\n * @param  {Uint8Array} p2 Polynomial\n * @return {Uint8Array}    Product of p1 and p2\n */\nexports.mul = function mul (p1, p2) {\n  const coeff = new Uint8Array(p1.length + p2.length - 1)\n\n  for (let i = 0; i < p1.length; i++) {\n    for (let j = 0; j < p2.length; j++) {\n      coeff[i + j] ^= GF.mul(p1[i], p2[j])\n    }\n  }\n\n  return coeff\n}\n\n/**\n * Calculate the remainder of polynomials division\n *\n * @param  {Uint8Array} divident Polynomial\n * @param  {Uint8Array} divisor  Polynomial\n * @return {Uint8Array}          Remainder\n */\nexports.mod = function mod (divident, divisor) {\n  let result = new Uint8Array(divident)\n\n  while ((result.length - divisor.length) >= 0) {\n    const coeff = result[0]\n\n    for (let i = 0; i < divisor.length; i++) {\n      result[i] ^= GF.mul(divisor[i], coeff)\n    }\n\n    // remove all zeros from buffer head\n    let offset = 0\n    while (offset < result.length && result[offset] === 0) offset++\n    result = result.slice(offset)\n  }\n\n  return result\n}\n\n/**\n * Generate an irreducible generator polynomial of specified degree\n * (used by Reed-Solomon encoder)\n *\n * @param  {Number} degree Degree of the generator polynomial\n * @return {Uint8Array}    Buffer containing polynomial coefficients\n */\nexports.generateECPolynomial = function generateECPolynomial (degree) {\n  let poly = new Uint8Array([1])\n  for (let i = 0; i < degree; i++) {\n    poly = exports.mul(poly, new Uint8Array([1, GF.exp(i)]))\n  }\n\n  return poly\n}\n"],"names":["require$$0"],"mappings":";;;;AAAA,QAAM,KAAKA;AASX,UAAA,MAAc,SAAS,IAAK,IAAI,IAAI;AAClC,UAAM,QAAQ,IAAI,WAAW,GAAG,SAAS,GAAG,SAAS,CAAC;AAEtD,aAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,eAAS,IAAI,GAAG,IAAI,GAAG,QAAQ,KAAK;AAClC,cAAM,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,MACpC;AAAA,IACF;AAED,WAAO;AAAA,EACR;AASD,UAAA,MAAc,SAAS,IAAK,UAAU,SAAS;AAC7C,QAAI,SAAS,IAAI,WAAW,QAAQ;AAEpC,WAAQ,OAAO,SAAS,QAAQ,UAAW,GAAG;AAC5C,YAAM,QAAQ,OAAO,CAAC;AAEtB,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,eAAO,CAAC,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,KAAK;AAAA,MACtC;AAGD,UAAI,SAAS;AACb,aAAO,SAAS,OAAO,UAAU,OAAO,MAAM,MAAM,EAAG;AACvD,eAAS,OAAO,MAAM,MAAM;AAAA,IAC7B;AAED,WAAO;AAAA,EACR;AASD,UAAA,uBAA+B,SAAS,qBAAsB,QAAQ;AACpE,QAAI,OAAO,IAAI,WAAW,CAAC,CAAC,CAAC;AAC7B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAO,QAAQ,IAAI,MAAM,IAAI,WAAW,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAAA,IACxD;AAED,WAAO;AAAA,EACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/qrcode/lib/core/qrcode.cjs

@@ -1,4 +1,283 @@
-"use strict";Object.defineProperties(exports,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}});const E=require("../../../../_virtual/qrcode.cjs");require("./utils.cjs");require("./error-correction-level.cjs");const F=require("./bit-buffer.cjs"),x=require("./bit-matrix.cjs");require("./alignment-pattern.cjs");require("./finder-pattern.cjs");require("./mask-pattern.cjs");require("./error-correction-code.cjs");const D=require("./reed-solomon-encoder.cjs");require("./version.cjs");require("./format-info.cjs");require("./mode.cjs");require("./segments.cjs");const V=require("../../../../_virtual/utils.cjs"),G=require("../../../../_virtual/error-correction-level.cjs"),R=require("../../../../_virtual/mask-pattern.cjs"),J=require("../../../../_virtual/version.cjs"),N=require("../../../../_virtual/segments.cjs"),U=require("../../../../_virtual/alignment-pattern.cjs"),Q=require("../../../../_virtual/finder-pattern.cjs"),j=require("../../../../_virtual/error-correction-code.cjs"),L=require("../../../../_virtual/format-info.cjs"),O=require("../../../../_virtual/mode.cjs"),b=V.__exports,h=G.__exports,H=F.bitBuffer,K=x.bitMatrix,W=U.__exports,X=Q.__exports,I=R.__exports,y=j.__exports,Y=D.reedSolomonEncoder,p=J.__exports,Z=L.__exports,$=O.__exports,S=N.__exports;function v(n,c){const r=n.size,e=X.getPositions(c);for(let u=0;u<e.length;u++){const t=e[u][0],o=e[u][1];for(let i=-1;i<=7;i++)if(!(t+i<=-1||r<=t+i))for(let s=-1;s<=7;s++)o+s<=-1||r<=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?n.set(t+i,o+s,!0,!0):n.set(t+i,o+s,!1,!0))}}function ee(n){const c=n.size;for(let r=8;r<c-8;r++){const e=r%2===0;n.set(r,6,e,!0),n.set(6,r,e,!0)}}function te(n,c){const r=W.getPositions(c);for(let e=0;e<r.length;e++){const u=r[e][0],t=r[e][1];for(let o=-2;o<=2;o++)for(let i=-2;i<=2;i++)o===-2||o===2||i===-2||i===2||o===0&&i===0?n.set(u+o,t+i,!0,!0):n.set(u+o,t+i,!1,!0)}}function oe(n,c){const r=n.size,e=p.getEncodedBits(c);let u,t,o;for(let i=0;i<18;i++)u=Math.floor(i/3),t=i%3+r-8-3,o=(e>>i&1)===1,n.set(u,t,o,!0),n.set(t,u,o,!0)}function B(n,c,r){const e=n.size,u=Z.getEncodedBits(c,r);let t,o;for(t=0;t<15;t++)o=(u>>t&1)===1,t<6?n.set(t,8,o,!0):t<8?n.set(t+1,8,o,!0):n.set(e-15+t,8,o,!0),t<8?n.set(8,e-t-1,o,!0):t<9?n.set(8,15-t-1+1,o,!0):n.set(8,15-t-1,o,!0);n.set(e-8,8,1,!0)}function ne(n,c){const r=n.size;let e=-1,u=r-1,t=7,o=0;for(let i=r-1;i>0;i-=2)for(i===6&&i--;;){for(let s=0;s<2;s++)if(!n.isReserved(u,i-s)){let d=!1;o<c.length&&(d=(c[o]>>>t&1)===1),n.set(u,i-s,d),t--,t===-1&&(o++,t=7)}if(u+=e,u<0||r<=u){u-=e,e=-e;break}}}function re(n,c,r){const e=new H;r.forEach(function(s){e.put(s.mode.bit,4),e.put(s.getLength(),$.getCharCountIndicator(s.mode,n)),s.write(e)});const u=b.getSymbolTotalCodewords(n),t=y.getTotalCodewordsCount(n,c),o=(u-t)*8;for(e.getLengthInBits()+4<=o&&e.put(0,4);e.getLengthInBits()%8!==0;)e.putBit(0);const i=(o-e.getLengthInBits())/8;for(let s=0;s<i;s++)e.put(s%2?17:236,8);return se(e,n,c)}function se(n,c,r){const e=b.getSymbolTotalCodewords(c),u=y.getTotalCodewordsCount(c,r),t=e-u,o=y.getBlocksCount(c,r),i=e%o,s=o-i,d=Math.floor(e/o),g=Math.floor(t/o),P=g+1,M=d-g,k=new Y(M);let q=0;const w=new Array(o),T=new Array(o);let _=0;const A=new Uint8Array(n.buffer);for(let a=0;a<o;a++){const C=a<s?g:P;w[a]=A.slice(q,q+C),T[a]=k.encode(w[a]),q+=C,_=Math.max(_,C)}const m=new Uint8Array(e);let z=0,f,l;for(f=0;f<_;f++)for(l=0;l<o;l++)f<w[l].length&&(m[z++]=w[l][f]);for(f=0;f<M;f++)for(l=0;l<o;l++)m[z++]=T[l][f];return m}function ie(n,c,r,e){let u;if(Array.isArray(n))u=S.fromArray(n);else if(typeof n=="string"){let d=c;if(!d){const g=S.rawSplit(n);d=p.getBestVersionForData(g,r)}u=S.fromString(n,d||40)}else throw new Error("Invalid data");const t=p.getBestVersionForData(u,r);if(!t)throw new Error("The amount of data is too big to be stored in a QR Code");if(!c)c=t;else if(c<t)throw new Error(`
-The chosen QR Code version cannot contain this amount of data.
-Minimum version required to store current data is: `+t+`.
-`);const o=re(c,r,u),i=b.getSymbolSize(c),s=new K(i);return v(s,c),ee(s),te(s,c),B(s,r,0),c>=7&&oe(s,c),ne(s,o),isNaN(e)&&(e=I.getBestMask(s,B.bind(null,s,r))),I.applyMask(e,s),B(s,r,e),{modules:s,version:c,errorCorrectionLevel:r,maskPattern:e,segments:u}}E.__exports.create=function(c,r){if(typeof c>"u"||c==="")throw new Error("No input text");let e=h.M,u,t;return typeof r<"u"&&(e=h.from(r.errorCorrectionLevel,h.M),u=p.from(r.version),t=I.from(r.maskPattern),r.toSJISFunc&&b.setToSJISFunction(r.toSJISFunc)),ie(c,u,e,t)};exports.default=E.__exports;
+"use strict";
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
+const qrcode = require("../../../../_virtual/qrcode.cjs");
+require("./utils.cjs");
+require("./error-correction-level.cjs");
+const bitBuffer = require("./bit-buffer.cjs");
+const bitMatrix = require("./bit-matrix.cjs");
+require("./alignment-pattern.cjs");
+require("./finder-pattern.cjs");
+require("./mask-pattern.cjs");
+require("./error-correction-code.cjs");
+const reedSolomonEncoder = require("./reed-solomon-encoder.cjs");
+require("./version.cjs");
+require("./format-info.cjs");
+require("./mode.cjs");
+require("./segments.cjs");
+const utils = require("../../../../_virtual/utils.cjs");
+const errorCorrectionLevel = require("../../../../_virtual/error-correction-level.cjs");
+const maskPattern = require("../../../../_virtual/mask-pattern.cjs");
+const version = require("../../../../_virtual/version.cjs");
+const segments = require("../../../../_virtual/segments.cjs");
+const alignmentPattern = require("../../../../_virtual/alignment-pattern.cjs");
+const finderPattern = require("../../../../_virtual/finder-pattern.cjs");
+const errorCorrectionCode = require("../../../../_virtual/error-correction-code.cjs");
+const formatInfo = require("../../../../_virtual/format-info.cjs");
+const mode = require("../../../../_virtual/mode.cjs");
+const Utils = utils.__exports;
+const ECLevel = errorCorrectionLevel.__exports;
+const BitBuffer = bitBuffer.bitBuffer;
+const BitMatrix = bitMatrix.bitMatrix;
+const AlignmentPattern = alignmentPattern.__exports;
+const FinderPattern = finderPattern.__exports;
+const MaskPattern = maskPattern.__exports;
+const ECCode = errorCorrectionCode.__exports;
+const ReedSolomonEncoder = reedSolomonEncoder.reedSolomonEncoder;
+const Version = version.__exports;
+const FormatInfo = formatInfo.__exports;
+const Mode = mode.__exports;
+const Segments = segments.__exports;
+function setupFinderPattern(matrix, version2) {
+  const size = matrix.size;
+  const pos = FinderPattern.getPositions(version2);
+  for (let i = 0; i < pos.length; i++) {
+    const row = pos[i][0];
+    const col = pos[i][1];
+    for (let r = -1; r <= 7; r++) {
+      if (row + r <= -1 || size <= row + r) continue;
+      for (let c = -1; c <= 7; c++) {
+        if (col + c <= -1 || size <= col + c) continue;
+        if (r >= 0 && r <= 6 && (c === 0 || c === 6) || c >= 0 && c <= 6 && (r === 0 || r === 6) || r >= 2 && r <= 4 && c >= 2 && c <= 4) {
+          matrix.set(row + r, col + c, true, true);
+        } else {
+          matrix.set(row + r, col + c, false, true);
+        }
+      }
+    }
+  }
+}
+function setupTimingPattern(matrix) {
+  const size = matrix.size;
+  for (let r = 8; r < size - 8; r++) {
+    const value = r % 2 === 0;
+    matrix.set(r, 6, value, true);
+    matrix.set(6, r, value, true);
+  }
+}
+function setupAlignmentPattern(matrix, version2) {
+  const pos = AlignmentPattern.getPositions(version2);
+  for (let i = 0; i < pos.length; i++) {
+    const row = pos[i][0];
+    const col = pos[i][1];
+    for (let r = -2; r <= 2; r++) {
+      for (let c = -2; c <= 2; c++) {
+        if (r === -2 || r === 2 || c === -2 || c === 2 || r === 0 && c === 0) {
+          matrix.set(row + r, col + c, true, true);
+        } else {
+          matrix.set(row + r, col + c, false, true);
+        }
+      }
+    }
+  }
+}
+function setupVersionInfo(matrix, version2) {
+  const size = matrix.size;
+  const bits = Version.getEncodedBits(version2);
+  let row, col, mod;
+  for (let i = 0; i < 18; i++) {
+    row = Math.floor(i / 3);
+    col = i % 3 + size - 8 - 3;
+    mod = (bits >> i & 1) === 1;
+    matrix.set(row, col, mod, true);
+    matrix.set(col, row, mod, true);
+  }
+}
+function setupFormatInfo(matrix, errorCorrectionLevel2, maskPattern2) {
+  const size = matrix.size;
+  const bits = FormatInfo.getEncodedBits(errorCorrectionLevel2, maskPattern2);
+  let i, mod;
+  for (i = 0; i < 15; i++) {
+    mod = (bits >> i & 1) === 1;
+    if (i < 6) {
+      matrix.set(i, 8, mod, true);
+    } else if (i < 8) {
+      matrix.set(i + 1, 8, mod, true);
+    } else {
+      matrix.set(size - 15 + i, 8, mod, true);
+    }
+    if (i < 8) {
+      matrix.set(8, size - i - 1, mod, true);
+    } else if (i < 9) {
+      matrix.set(8, 15 - i - 1 + 1, mod, true);
+    } else {
+      matrix.set(8, 15 - i - 1, mod, true);
+    }
+  }
+  matrix.set(size - 8, 8, 1, true);
+}
+function setupData(matrix, data) {
+  const size = matrix.size;
+  let inc = -1;
+  let row = size - 1;
+  let bitIndex = 7;
+  let byteIndex = 0;
+  for (let col = size - 1; col > 0; col -= 2) {
+    if (col === 6) col--;
+    while (true) {
+      for (let c = 0; c < 2; c++) {
+        if (!matrix.isReserved(row, col - c)) {
+          let dark = false;
+          if (byteIndex < data.length) {
+            dark = (data[byteIndex] >>> bitIndex & 1) === 1;
+          }
+          matrix.set(row, col - c, dark);
+          bitIndex--;
+          if (bitIndex === -1) {
+            byteIndex++;
+            bitIndex = 7;
+          }
+        }
+      }
+      row += inc;
+      if (row < 0 || size <= row) {
+        row -= inc;
+        inc = -inc;
+        break;
+      }
+    }
+  }
+}
+function createData(version2, errorCorrectionLevel2, segments2) {
+  const buffer = new BitBuffer();
+  segments2.forEach(function(data) {
+    buffer.put(data.mode.bit, 4);
+    buffer.put(data.getLength(), Mode.getCharCountIndicator(data.mode, version2));
+    data.write(buffer);
+  });
+  const totalCodewords = Utils.getSymbolTotalCodewords(version2);
+  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+  const dataTotalCodewordsBits = (totalCodewords - ecTotalCodewords) * 8;
+  if (buffer.getLengthInBits() + 4 <= dataTotalCodewordsBits) {
+    buffer.put(0, 4);
+  }
+  while (buffer.getLengthInBits() % 8 !== 0) {
+    buffer.putBit(0);
+  }
+  const remainingByte = (dataTotalCodewordsBits - buffer.getLengthInBits()) / 8;
+  for (let i = 0; i < remainingByte; i++) {
+    buffer.put(i % 2 ? 17 : 236, 8);
+  }
+  return createCodewords(buffer, version2, errorCorrectionLevel2);
+}
+function createCodewords(bitBuffer2, version2, errorCorrectionLevel2) {
+  const totalCodewords = Utils.getSymbolTotalCodewords(version2);
+  const ecTotalCodewords = ECCode.getTotalCodewordsCount(version2, errorCorrectionLevel2);
+  const dataTotalCodewords = totalCodewords - ecTotalCodewords;
+  const ecTotalBlocks = ECCode.getBlocksCount(version2, errorCorrectionLevel2);
+  const blocksInGroup2 = totalCodewords % ecTotalBlocks;
+  const blocksInGroup1 = ecTotalBlocks - blocksInGroup2;
+  const totalCodewordsInGroup1 = Math.floor(totalCodewords / ecTotalBlocks);
+  const dataCodewordsInGroup1 = Math.floor(dataTotalCodewords / ecTotalBlocks);
+  const dataCodewordsInGroup2 = dataCodewordsInGroup1 + 1;
+  const ecCount = totalCodewordsInGroup1 - dataCodewordsInGroup1;
+  const rs = new ReedSolomonEncoder(ecCount);
+  let offset = 0;
+  const dcData = new Array(ecTotalBlocks);
+  const ecData = new Array(ecTotalBlocks);
+  let maxDataSize = 0;
+  const buffer = new Uint8Array(bitBuffer2.buffer);
+  for (let b = 0; b < ecTotalBlocks; b++) {
+    const dataSize = b < blocksInGroup1 ? dataCodewordsInGroup1 : dataCodewordsInGroup2;
+    dcData[b] = buffer.slice(offset, offset + dataSize);
+    ecData[b] = rs.encode(dcData[b]);
+    offset += dataSize;
+    maxDataSize = Math.max(maxDataSize, dataSize);
+  }
+  const data = new Uint8Array(totalCodewords);
+  let index = 0;
+  let i, r;
+  for (i = 0; i < maxDataSize; i++) {
+    for (r = 0; r < ecTotalBlocks; r++) {
+      if (i < dcData[r].length) {
+        data[index++] = dcData[r][i];
+      }
+    }
+  }
+  for (i = 0; i < ecCount; i++) {
+    for (r = 0; r < ecTotalBlocks; r++) {
+      data[index++] = ecData[r][i];
+    }
+  }
+  return data;
+}
+function createSymbol(data, version2, errorCorrectionLevel2, maskPattern2) {
+  let segments2;
+  if (Array.isArray(data)) {
+    segments2 = Segments.fromArray(data);
+  } else if (typeof data === "string") {
+    let estimatedVersion = version2;
+    if (!estimatedVersion) {
+      const rawSegments = Segments.rawSplit(data);
+      estimatedVersion = Version.getBestVersionForData(rawSegments, errorCorrectionLevel2);
+    }
+    segments2 = Segments.fromString(data, estimatedVersion || 40);
+  } else {
+    throw new Error("Invalid data");
+  }
+  const bestVersion = Version.getBestVersionForData(segments2, errorCorrectionLevel2);
+  if (!bestVersion) {
+    throw new Error("The amount of data is too big to be stored in a QR Code");
+  }
+  if (!version2) {
+    version2 = bestVersion;
+  } else if (version2 < bestVersion) {
+    throw new Error(
+      "\nThe chosen QR Code version cannot contain this amount of data.\nMinimum version required to store current data is: " + bestVersion + ".\n"
+    );
+  }
+  const dataBits = createData(version2, errorCorrectionLevel2, segments2);
+  const moduleCount = Utils.getSymbolSize(version2);
+  const modules = new BitMatrix(moduleCount);
+  setupFinderPattern(modules, version2);
+  setupTimingPattern(modules);
+  setupAlignmentPattern(modules, version2);
+  setupFormatInfo(modules, errorCorrectionLevel2, 0);
+  if (version2 >= 7) {
+    setupVersionInfo(modules, version2);
+  }
+  setupData(modules, dataBits);
+  if (isNaN(maskPattern2)) {
+    maskPattern2 = MaskPattern.getBestMask(
+      modules,
+      setupFormatInfo.bind(null, modules, errorCorrectionLevel2)
+    );
+  }
+  MaskPattern.applyMask(maskPattern2, modules);
+  setupFormatInfo(modules, errorCorrectionLevel2, maskPattern2);
+  return {
+    modules,
+    version: version2,
+    errorCorrectionLevel: errorCorrectionLevel2,
+    maskPattern: maskPattern2,
+    segments: segments2
+  };
+}
+qrcode.__exports.create = function create(data, options) {
+  if (typeof data === "undefined" || data === "") {
+    throw new Error("No input text");
+  }
+  let errorCorrectionLevel2 = ECLevel.M;
+  let version2;
+  let mask;
+  if (typeof options !== "undefined") {
+    errorCorrectionLevel2 = ECLevel.from(options.errorCorrectionLevel, ECLevel.M);
+    version2 = Version.from(options.version);
+    mask = MaskPattern.from(options.maskPattern);
+    if (options.toSJISFunc) {
+      Utils.setToSJISFunction(options.toSJISFunc);
+    }
+  }
+  return createSymbol(data, version2, errorCorrectionLevel2, mask);
+};
+exports.default = qrcode.__exports;
+//# sourceMappingURL=qrcode.cjs.map

package/dist/node_modules/qrcode/lib/core/qrcode.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"qrcode.cjs","sources":["../../../../../../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":["require$$0","require$$1","require$$2","require$$3","require$$4","require$$5","require$$6","require$$7","require$$8","require$$9","require$$10","require$$11","require$$12","version","errorCorrectionLevel","maskPattern","segments","bitBuffer","qrcode"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,MAAM,QAAQA,MAAkB;AAChC,MAAM,UAAUC,qBAAmC;AACnD,MAAM,YAAYC,UAAuB;AACzC,MAAM,YAAYC,UAAuB;AACzC,MAAM,mBAAmBC,iBAA8B;AACvD,MAAM,gBAAgBC,cAA2B;AACjD,MAAM,cAAcC,YAAyB;AAC7C,MAAM,SAASC,oBAAkC;AACjD,MAAM,qBAAqBC,mBAAiC;AAC5D,MAAM,UAAUC,QAAoB;AACpC,MAAM,aAAaC,WAAwB;AAC3C,MAAM,OAAOC,KAAiB;AAC9B,MAAM,WAAWC,SAAqB;AAkCtC,SAAS,mBAAoB,QAAQC,UAAS;AAC5C,QAAM,OAAO,OAAO;AACpB,QAAM,MAAM,cAAc,aAAaA,QAAO;AAE9C,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,UAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,KAAK,MAAM,QAAQ,MAAM,EAAG;AAEtC,YAAK,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACxC,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,MAAM,MACtC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAI;AACxC,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AASA,SAAS,mBAAoB,QAAQ;AACnC,QAAM,OAAO,OAAO;AAEpB,WAAS,IAAI,GAAG,IAAI,OAAO,GAAG,KAAK;AACjC,UAAM,QAAQ,IAAI,MAAM;AACxB,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAC5B,WAAO,IAAI,GAAG,GAAG,OAAO,IAAI;AAAA,EAC7B;AACH;AAUA,SAAS,sBAAuB,QAAQA,UAAS;AAC/C,QAAM,MAAM,iBAAiB,aAAaA,QAAO;AAEjD,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AACpB,UAAM,MAAM,IAAI,CAAC,EAAE,CAAC;AAEpB,aAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,eAAS,IAAI,IAAI,KAAK,GAAG,KAAK;AAC5B,YAAI,MAAM,MAAM,MAAM,KAAK,MAAM,MAAM,MAAM,KAC1C,MAAM,KAAK,MAAM,GAAI;AACtB,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI;AAAA,QACjD,OAAe;AACL,iBAAO,IAAI,MAAM,GAAG,MAAM,GAAG,OAAO,IAAI;AAAA,QACzC;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACH;AAQA,SAAS,iBAAkB,QAAQA,UAAS;AAC1C,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,QAAQ,eAAeA,QAAO;AAC3C,MAAI,KAAK,KAAK;AAEd,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAM,KAAK,MAAM,IAAI,CAAC;AACtB,UAAM,IAAI,IAAI,OAAO,IAAI;AACzB,WAAQ,QAAQ,IAAK,OAAO;AAE5B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAC9B,WAAO,IAAI,KAAK,KAAK,KAAK,IAAI;AAAA,EAC/B;AACH;AASA,SAAS,gBAAiB,QAAQC,uBAAsBC,cAAa;AACnE,QAAM,OAAO,OAAO;AACpB,QAAM,OAAO,WAAW,eAAeD,uBAAsBC,YAAW;AACxE,MAAI,GAAG;AAEP,OAAK,IAAI,GAAG,IAAI,IAAI,KAAK;AACvB,WAAQ,QAAQ,IAAK,OAAO;AAG5B,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IAChC,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,IAAI,GAAG,GAAG,KAAK,IAAI;AAAA,IACpC,OAAW;AACL,aAAO,IAAI,OAAO,KAAK,GAAG,GAAG,KAAK,IAAI;AAAA,IACvC;AAGD,QAAI,IAAI,GAAG;AACT,aAAO,IAAI,GAAG,OAAO,IAAI,GAAG,KAAK,IAAI;AAAA,IAC3C,WAAe,IAAI,GAAG;AAChB,aAAO,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,KAAK,IAAI;AAAA,IAC7C,OAAW;AACL,aAAO,IAAI,GAAG,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,IACpC;AAAA,EACF;AAGD,SAAO,IAAI,OAAO,GAAG,GAAG,GAAG,IAAI;AACjC;AAQA,SAAS,UAAW,QAAQ,MAAM;AAChC,QAAM,OAAO,OAAO;AACpB,MAAI,MAAM;AACV,MAAI,MAAM,OAAO;AACjB,MAAI,WAAW;AACf,MAAI,YAAY;AAEhB,WAAS,MAAM,OAAO,GAAG,MAAM,GAAG,OAAO,GAAG;AAC1C,QAAI,QAAQ,EAAG;AAEf,WAAO,MAAM;AACX,eAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAI,CAAC,OAAO,WAAW,KAAK,MAAM,CAAC,GAAG;AACpC,cAAI,OAAO;AAEX,cAAI,YAAY,KAAK,QAAQ;AAC3B,oBAAU,KAAK,SAAS,MAAM,WAAY,OAAO;AAAA,UAClD;AAED,iBAAO,IAAI,KAAK,MAAM,GAAG,IAAI;AAC7B;AAEA,cAAI,aAAa,IAAI;AACnB;AACA,uBAAW;AAAA,UACZ;AAAA,QACF;AAAA,MACF;AAED,aAAO;AAEP,UAAI,MAAM,KAAK,QAAQ,KAAK;AAC1B,eAAO;AACP,cAAM,CAAC;AACP;AAAA,MACD;AAAA,IACF;AAAA,EACF;AACH;AAUA,SAAS,WAAYF,UAASC,uBAAsBE,WAAU;AAE5D,QAAM,SAAS,IAAI,UAAW;AAE9B,EAAAA,UAAS,QAAQ,SAAU,MAAM;AAE/B,WAAO,IAAI,KAAK,KAAK,KAAK,CAAC;AAS3B,WAAO,IAAI,KAAK,UAAW,GAAE,KAAK,sBAAsB,KAAK,MAAMH,QAAO,CAAC;AAG3E,SAAK,MAAM,MAAM;AAAA,EACrB,CAAG;AAGD,QAAM,iBAAiB,MAAM,wBAAwBA,QAAO;AAC5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AACpF,QAAM,0BAA0B,iBAAiB,oBAAoB;AAOrE,MAAI,OAAO,oBAAoB,KAAK,wBAAwB;AAC1D,WAAO,IAAI,GAAG,CAAC;AAAA,EAChB;AAOD,SAAO,OAAO,oBAAoB,MAAM,GAAG;AACzC,WAAO,OAAO,CAAC;AAAA,EAChB;AAMD,QAAM,iBAAiB,yBAAyB,OAAO,gBAAiB,KAAI;AAC5E,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,WAAO,IAAI,IAAI,IAAI,KAAO,KAAM,CAAC;AAAA,EAClC;AAED,SAAO,gBAAgB,QAAQD,UAASC,qBAAoB;AAC9D;AAWA,SAAS,gBAAiBG,YAAWJ,UAASC,uBAAsB;AAElE,QAAM,iBAAiB,MAAM,wBAAwBD,QAAO;AAG5D,QAAM,mBAAmB,OAAO,uBAAuBA,UAASC,qBAAoB;AAGpF,QAAM,qBAAqB,iBAAiB;AAG5C,QAAM,gBAAgB,OAAO,eAAeD,UAASC,qBAAoB;AAGzE,QAAM,iBAAiB,iBAAiB;AACxC,QAAM,iBAAiB,gBAAgB;AAEvC,QAAM,yBAAyB,KAAK,MAAM,iBAAiB,aAAa;AAExE,QAAM,wBAAwB,KAAK,MAAM,qBAAqB,aAAa;AAC3E,QAAM,wBAAwB,wBAAwB;AAGtD,QAAM,UAAU,yBAAyB;AAGzC,QAAM,KAAK,IAAI,mBAAmB,OAAO;AAEzC,MAAI,SAAS;AACb,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,QAAM,SAAS,IAAI,MAAM,aAAa;AACtC,MAAI,cAAc;AAClB,QAAM,SAAS,IAAI,WAAWG,WAAU,MAAM;AAG9C,WAAS,IAAI,GAAG,IAAI,eAAe,KAAK;AACtC,UAAM,WAAW,IAAI,iBAAiB,wBAAwB;AAG9D,WAAO,CAAC,IAAI,OAAO,MAAM,QAAQ,SAAS,QAAQ;AAGlD,WAAO,CAAC,IAAI,GAAG,OAAO,OAAO,CAAC,CAAC;AAE/B,cAAU;AACV,kBAAc,KAAK,IAAI,aAAa,QAAQ;AAAA,EAC7C;AAID,QAAM,OAAO,IAAI,WAAW,cAAc;AAC1C,MAAI,QAAQ;AACZ,MAAI,GAAG;AAGP,OAAK,IAAI,GAAG,IAAI,aAAa,KAAK;AAChC,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,UAAI,IAAI,OAAO,CAAC,EAAE,QAAQ;AACxB,aAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,MAC5B;AAAA,IACF;AAAA,EACF;AAGD,OAAK,IAAI,GAAG,IAAI,SAAS,KAAK;AAC5B,SAAK,IAAI,GAAG,IAAI,eAAe,KAAK;AAClC,WAAK,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAED,SAAO;AACT;AAWA,SAAS,aAAc,MAAMJ,UAASC,uBAAsBC,cAAa;AACvE,MAAIC;AAEJ,MAAI,MAAM,QAAQ,IAAI,GAAG;AACvB,IAAAA,YAAW,SAAS,UAAU,IAAI;AAAA,EACtC,WAAa,OAAO,SAAS,UAAU;AACnC,QAAI,mBAAmBH;AAEvB,QAAI,CAAC,kBAAkB;AACrB,YAAM,cAAc,SAAS,SAAS,IAAI;AAG1C,yBAAmB,QAAQ,sBAAsB,aAAaC,qBAAoB;AAAA,IACnF;AAID,IAAAE,YAAW,SAAS,WAAW,MAAM,oBAAoB,EAAE;AAAA,EAC/D,OAAS;AACL,UAAM,IAAI,MAAM,cAAc;AAAA,EAC/B;AAGD,QAAM,cAAc,QAAQ,sBAAsBA,WAAUF,qBAAoB;AAGhF,MAAI,CAAC,aAAa;AAChB,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC1E;AAGD,MAAI,CAACD,UAAS;AACZ,IAAAA,WAAU;AAAA,EAGd,WAAaA,WAAU,aAAa;AAChC,UAAM,IAAI;AAAA,MAAM,0HAE0C,cAAc;AAAA,IACvE;AAAA,EACF;AAED,QAAM,WAAW,WAAWA,UAASC,uBAAsBE,SAAQ;AAGnE,QAAM,cAAc,MAAM,cAAcH,QAAO;AAC/C,QAAM,UAAU,IAAI,UAAU,WAAW;AAGzC,qBAAmB,SAASA,QAAO;AACnC,qBAAmB,OAAO;AAC1B,wBAAsB,SAASA,QAAO;AAMtC,kBAAgB,SAASC,uBAAsB,CAAC;AAEhD,MAAID,YAAW,GAAG;AAChB,qBAAiB,SAASA,QAAO;AAAA,EAClC;AAGD,YAAU,SAAS,QAAQ;AAE3B,MAAI,MAAME,YAAW,GAAG;AAEtB,IAAAA,eAAc,YAAY;AAAA,MAAY;AAAA,MACpC,gBAAgB,KAAK,MAAM,SAASD,qBAAoB;AAAA,IAAC;AAAA,EAC5D;AAGD,cAAY,UAAUC,cAAa,OAAO;AAG1C,kBAAgB,SAASD,uBAAsBC,YAAW;AAE1D,SAAO;AAAA,IACL;AAAA,IACA,SAASF;AAAA,IACT,sBAAsBC;AAAA,IACtB,aAAaC;AAAA,IACb,UAAUC;AAAA,EACX;AACH;AAWAE,OAAA,UAAA,SAAiB,SAAS,OAAQ,MAAM,SAAS;AAC/C,MAAI,OAAO,SAAS,eAAe,SAAS,IAAI;AAC9C,UAAM,IAAI,MAAM,eAAe;AAAA,EAChC;AAED,MAAIJ,wBAAuB,QAAQ;AACnC,MAAID;AACJ,MAAI;AAEJ,MAAI,OAAO,YAAY,aAAa;AAElC,IAAAC,wBAAuB,QAAQ,KAAK,QAAQ,sBAAsB,QAAQ,CAAC;AAC3E,IAAAD,WAAU,QAAQ,KAAK,QAAQ,OAAO;AACtC,WAAO,YAAY,KAAK,QAAQ,WAAW;AAE3C,QAAI,QAAQ,YAAY;AACtB,YAAM,kBAAkB,QAAQ,UAAU;AAAA,IAC3C;AAAA,EACF;AAED,SAAO,aAAa,MAAMA,UAASC,uBAAsB,IAAI;AAC/D;;","x_google_ignoreList":[0]}