asterui 0.11.0 → 0.12.1

package/dist/index120.js

@@ -1,147 +1,363 @@
-import { __exports as N } from "./index136.js";
-import { __require as T } from "./index119.js";
-import { __require as Y } from "./index137.js";
-import { __require as L } from "./index138.js";
-import { __require as y } from "./index139.js";
-import { __require as D } from "./index140.js";
-import { __require as j } from "./index135.js";
-import { __require as k } from "./index108.js";
-import { __require as J } from "./index141.js";
-var b;
-function V() {
-  return b ? N : (b = 1, (function(m) {
-    const r = T(), I = Y(), B = L(), _ = y(), q = D(), c = j(), p = k(), R = J();
-    function C(n) {
-      return unescape(encodeURIComponent(n)).length;
+import { __exports as u } from "./index135.js";
+import { __require as a } from "./index114.js";
+var c;
+function i() {
+  if (c) return u;
+  c = 1;
+  const e = a(), t = [
+    // L  M  Q  H
+    1,
+    1,
+    1,
+    1,
+    1,
+    1,
+    1,
+    1,
+    1,
+    1,
+    2,
+    2,
+    1,
+    2,
+    2,
+    4,
+    1,
+    2,
+    4,
+    4,
+    2,
+    4,
+    4,
+    4,
+    2,
+    4,
+    6,
+    5,
+    2,
+    4,
+    6,
+    6,
+    2,
+    5,
+    8,
+    8,
+    4,
+    5,
+    8,
+    8,
+    4,
+    5,
+    8,
+    11,
+    4,
+    8,
+    10,
+    11,
+    4,
+    9,
+    12,
+    16,
+    4,
+    9,
+    16,
+    16,
+    6,
+    10,
+    12,
+    18,
+    6,
+    10,
+    17,
+    16,
+    6,
+    11,
+    16,
+    19,
+    6,
+    13,
+    18,
+    21,
+    7,
+    14,
+    21,
+    25,
+    8,
+    16,
+    20,
+    25,
+    8,
+    17,
+    23,
+    25,
+    9,
+    17,
+    23,
+    34,
+    9,
+    18,
+    25,
+    30,
+    10,
+    20,
+    27,
+    32,
+    12,
+    21,
+    29,
+    35,
+    12,
+    23,
+    34,
+    37,
+    12,
+    25,
+    34,
+    40,
+    13,
+    26,
+    35,
+    42,
+    14,
+    28,
+    38,
+    45,
+    15,
+    29,
+    40,
+    48,
+    16,
+    31,
+    43,
+    51,
+    17,
+    33,
+    45,
+    54,
+    18,
+    35,
+    48,
+    57,
+    19,
+    37,
+    51,
+    60,
+    19,
+    38,
+    53,
+    63,
+    20,
+    40,
+    56,
+    66,
+    21,
+    43,
+    59,
+    70,
+    22,
+    45,
+    62,
+    74,
+    24,
+    47,
+    65,
+    77,
+    25,
+    49,
+    68,
+    81
+  ], o = [
+    // L  M  Q  H
+    7,
+    10,
+    13,
+    17,
+    10,
+    16,
+    22,
+    28,
+    15,
+    26,
+    36,
+    44,
+    20,
+    36,
+    52,
+    64,
+    26,
+    48,
+    72,
+    88,
+    36,
+    64,
+    96,
+    112,
+    40,
+    72,
+    108,
+    130,
+    48,
+    88,
+    132,
+    156,
+    60,
+    110,
+    160,
+    192,
+    72,
+    130,
+    192,
+    224,
+    80,
+    150,
+    224,
+    264,
+    96,
+    176,
+    260,
+    308,
+    104,
+    198,
+    288,
+    352,
+    120,
+    216,
+    320,
+    384,
+    132,
+    240,
+    360,
+    432,
+    144,
+    280,
+    408,
+    480,
+    168,
+    308,
+    448,
+    532,
+    180,
+    338,
+    504,
+    588,
+    196,
+    364,
+    546,
+    650,
+    224,
+    416,
+    600,
+    700,
+    224,
+    442,
+    644,
+    750,
+    252,
+    476,
+    690,
+    816,
+    270,
+    504,
+    750,
+    900,
+    300,
+    560,
+    810,
+    960,
+    312,
+    588,
+    870,
+    1050,
+    336,
+    644,
+    952,
+    1110,
+    360,
+    700,
+    1020,
+    1200,
+    390,
+    728,
+    1050,
+    1260,
+    420,
+    784,
+    1140,
+    1350,
+    450,
+    812,
+    1200,
+    1440,
+    480,
+    868,
+    1290,
+    1530,
+    510,
+    924,
+    1350,
+    1620,
+    540,
+    980,
+    1440,
+    1710,
+    570,
+    1036,
+    1530,
+    1800,
+    570,
+    1064,
+    1590,
+    1890,
+    600,
+    1120,
+    1680,
+    1980,
+    630,
+    1204,
+    1770,
+    2100,
+    660,
+    1260,
+    1860,
+    2220,
+    720,
+    1316,
+    1950,
+    2310,
+    750,
+    1372,
+    2040,
+    2430
+  ];
+  return u.getBlocksCount = function(r, n) {
+    switch (n) {
+      case e.L:
+        return t[(r - 1) * 4 + 0];
+      case e.M:
+        return t[(r - 1) * 4 + 1];
+      case e.Q:
+        return t[(r - 1) * 4 + 2];
+      case e.H:
+        return t[(r - 1) * 4 + 3];
+      default:
+        return;
     }
-    function h(n, o, t) {
-      const e = [];
-      let s;
-      for (; (s = n.exec(t)) !== null; )
-        e.push({
-          data: s[0],
-          index: s.index,
-          mode: o,
-          length: s[0].length
-        });
-      return e;
+  }, u.getTotalCodewordsCount = function(r, n) {
+    switch (n) {
+      case e.L:
+        return o[(r - 1) * 4 + 0];
+      case e.M:
+        return o[(r - 1) * 4 + 1];
+      case e.Q:
+        return o[(r - 1) * 4 + 2];
+      case e.H:
+        return o[(r - 1) * 4 + 3];
+      default:
+        return;
     }
-    function M(n) {
-      const o = h(c.NUMERIC, r.NUMERIC, n), t = h(c.ALPHANUMERIC, r.ALPHANUMERIC, n);
-      let e, s;
-      return p.isKanjiModeEnabled() ? (e = h(c.BYTE, r.BYTE, n), s = h(c.KANJI, r.KANJI, n)) : (e = h(c.BYTE_KANJI, r.BYTE, n), s = []), o.concat(t, e, s).sort(function(a, l) {
-        return a.index - l.index;
-      }).map(function(a) {
-        return {
-          data: a.data,
-          mode: a.mode,
-          length: a.length
-        };
-      });
-    }
-    function E(n, o) {
-      switch (o) {
-        case r.NUMERIC:
-          return I.getBitsLength(n);
-        case r.ALPHANUMERIC:
-          return B.getBitsLength(n);
-        case r.KANJI:
-          return q.getBitsLength(n);
-        case r.BYTE:
-          return _.getBitsLength(n);
-      }
-    }
-    function U(n) {
-      return n.reduce(function(o, t) {
-        const e = o.length - 1 >= 0 ? o[o.length - 1] : null;
-        return e && e.mode === t.mode ? (o[o.length - 1].data += t.data, o) : (o.push(t), o);
-      }, []);
-    }
-    function w(n) {
-      const o = [];
-      for (let t = 0; t < n.length; t++) {
-        const e = n[t];
-        switch (e.mode) {
-          case r.NUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.ALPHANUMERIC, length: e.length },
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.ALPHANUMERIC:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: e.length }
-            ]);
-            break;
-          case r.KANJI:
-            o.push([
-              e,
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-            break;
-          case r.BYTE:
-            o.push([
-              { data: e.data, mode: r.BYTE, length: C(e.data) }
-            ]);
-        }
-      }
-      return o;
-    }
-    function K(n, o) {
-      const t = {}, e = { start: {} };
-      let s = ["start"];
-      for (let i = 0; i < n.length; i++) {
-        const a = n[i], l = [];
-        for (let g = 0; g < a.length; g++) {
-          const u = a[g], f = "" + i + g;
-          l.push(f), t[f] = { node: u, lastCount: 0 }, e[f] = {};
-          for (let A = 0; A < s.length; A++) {
-            const d = s[A];
-            t[d] && t[d].node.mode === u.mode ? (e[d][f] = E(t[d].lastCount + u.length, u.mode) - E(t[d].lastCount, u.mode), t[d].lastCount += u.length) : (t[d] && (t[d].lastCount = u.length), e[d][f] = E(u.length, u.mode) + 4 + r.getCharCountIndicator(u.mode, o));
-          }
-        }
-        s = l;
-      }
-      for (let i = 0; i < s.length; i++)
-        e[s[i]].end = 0;
-      return { map: e, table: t };
-    }
-    function S(n, o) {
-      let t;
-      const e = r.getBestModeForData(n);
-      if (t = r.from(o, e), t !== r.BYTE && t.bit < e.bit)
-        throw new Error('"' + n + '" cannot be encoded with mode ' + r.toString(t) + `.
- Suggested mode is: ` + r.toString(e));
-      switch (t === r.KANJI && !p.isKanjiModeEnabled() && (t = r.BYTE), t) {
-        case r.NUMERIC:
-          return new I(n);
-        case r.ALPHANUMERIC:
-          return new B(n);
-        case r.KANJI:
-          return new q(n);
-        case r.BYTE:
-          return new _(n);
-      }
-    }
-    m.fromArray = function(o) {
-      return o.reduce(function(t, e) {
-        return typeof e == "string" ? t.push(S(e, null)) : e.data && t.push(S(e.data, e.mode)), t;
-      }, []);
-    }, m.fromString = function(o, t) {
-      const e = M(o, p.isKanjiModeEnabled()), s = w(e), i = K(s, t), a = R.find_path(i.map, "start", "end"), l = [];
-      for (let g = 1; g < a.length - 1; g++)
-        l.push(i.table[a[g]].node);
-      return m.fromArray(U(l));
-    }, m.rawSplit = function(o) {
-      return m.fromArray(
-        M(o, p.isKanjiModeEnabled())
-      );
-    };
-  })(N), N);
+  }, u;
 }
 export {
-  V as __require
+  i as __require
 };
 //# sourceMappingURL=index120.js.map

package/dist/index120.js.map

@@ -1 +1 @@
-{"version":3,"file":"index120.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/segments.js"],"sourcesContent":["const Mode = require('./mode')\nconst NumericData = require('./numeric-data')\nconst AlphanumericData = require('./alphanumeric-data')\nconst ByteData = require('./byte-data')\nconst KanjiData = require('./kanji-data')\nconst Regex = require('./regex')\nconst Utils = require('./utils')\nconst dijkstra = require('dijkstrajs')\n\n/**\n * Returns UTF8 byte length\n *\n * @param  {String} str Input string\n * @return {Number}     Number of byte\n */\nfunction getStringByteLength (str) {\n  return unescape(encodeURIComponent(str)).length\n}\n\n/**\n * Get a list of segments of the specified mode\n * from a string\n *\n * @param  {Mode}   mode Segment mode\n * @param  {String} str  String to process\n * @return {Array}       Array of object with segments data\n */\nfunction getSegments (regex, mode, str) {\n  const segments = []\n  let result\n\n  while ((result = regex.exec(str)) !== null) {\n    segments.push({\n      data: result[0],\n      index: result.index,\n      mode: mode,\n      length: result[0].length\n    })\n  }\n\n  return segments\n}\n\n/**\n * Extracts a series of segments with the appropriate\n * modes from a string\n *\n * @param  {String} dataStr Input string\n * @return {Array}          Array of object with segments data\n */\nfunction getSegmentsFromString (dataStr) {\n  const numSegs = getSegments(Regex.NUMERIC, Mode.NUMERIC, dataStr)\n  const alphaNumSegs = getSegments(Regex.ALPHANUMERIC, Mode.ALPHANUMERIC, dataStr)\n  let byteSegs\n  let kanjiSegs\n\n  if (Utils.isKanjiModeEnabled()) {\n    byteSegs = getSegments(Regex.BYTE, Mode.BYTE, dataStr)\n    kanjiSegs = getSegments(Regex.KANJI, Mode.KANJI, dataStr)\n  } else {\n    byteSegs = getSegments(Regex.BYTE_KANJI, Mode.BYTE, dataStr)\n    kanjiSegs = []\n  }\n\n  const segs = numSegs.concat(alphaNumSegs, byteSegs, kanjiSegs)\n\n  return segs\n    .sort(function (s1, s2) {\n      return s1.index - s2.index\n    })\n    .map(function (obj) {\n      return {\n        data: obj.data,\n        mode: obj.mode,\n        length: obj.length\n      }\n    })\n}\n\n/**\n * Returns how many bits are needed to encode a string of\n * specified length with the specified mode\n *\n * @param  {Number} length String length\n * @param  {Mode} mode     Segment mode\n * @return {Number}        Bit length\n */\nfunction getSegmentBitsLength (length, mode) {\n  switch (mode) {\n    case Mode.NUMERIC:\n      return NumericData.getBitsLength(length)\n    case Mode.ALPHANUMERIC:\n      return AlphanumericData.getBitsLength(length)\n    case Mode.KANJI:\n      return KanjiData.getBitsLength(length)\n    case Mode.BYTE:\n      return ByteData.getBitsLength(length)\n  }\n}\n\n/**\n * Merges adjacent segments which have the same mode\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction mergeSegments (segs) {\n  return segs.reduce(function (acc, curr) {\n    const prevSeg = acc.length - 1 >= 0 ? acc[acc.length - 1] : null\n    if (prevSeg && prevSeg.mode === curr.mode) {\n      acc[acc.length - 1].data += curr.data\n      return acc\n    }\n\n    acc.push(curr)\n    return acc\n  }, [])\n}\n\n/**\n * Generates a list of all possible nodes combination which\n * will be used to build a segments graph.\n *\n * Nodes are divided by groups. Each group will contain a list of all the modes\n * in which is possible to encode the given text.\n *\n * For example the text '12345' can be encoded as Numeric, Alphanumeric or Byte.\n * The group for '12345' will contain then 3 objects, one for each\n * possible encoding mode.\n *\n * Each node represents a possible segment.\n *\n * @param  {Array} segs Array of object with segments data\n * @return {Array}      Array of object with segments data\n */\nfunction buildNodes (segs) {\n  const nodes = []\n  for (let i = 0; i < segs.length; i++) {\n    const seg = segs[i]\n\n    switch (seg.mode) {\n      case Mode.NUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.ALPHANUMERIC, length: seg.length },\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.ALPHANUMERIC:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: seg.length }\n        ])\n        break\n      case Mode.KANJI:\n        nodes.push([seg,\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n        break\n      case Mode.BYTE:\n        nodes.push([\n          { data: seg.data, mode: Mode.BYTE, length: getStringByteLength(seg.data) }\n        ])\n    }\n  }\n\n  return nodes\n}\n\n/**\n * Builds a graph from a list of nodes.\n * All segments in each node group will be connected with all the segments of\n * the next group and so on.\n *\n * At each connection will be assigned a weight depending on the\n * segment's byte length.\n *\n * @param  {Array} nodes    Array of object with segments data\n * @param  {Number} version QR Code version\n * @return {Object}         Graph of all possible segments\n */\nfunction buildGraph (nodes, version) {\n  const table = {}\n  const graph = { start: {} }\n  let prevNodeIds = ['start']\n\n  for (let i = 0; i < nodes.length; i++) {\n    const nodeGroup = nodes[i]\n    const currentNodeIds = []\n\n    for (let j = 0; j < nodeGroup.length; j++) {\n      const node = nodeGroup[j]\n      const key = '' + i + j\n\n      currentNodeIds.push(key)\n      table[key] = { node: node, lastCount: 0 }\n      graph[key] = {}\n\n      for (let n = 0; n < prevNodeIds.length; n++) {\n        const prevNodeId = prevNodeIds[n]\n\n        if (table[prevNodeId] && table[prevNodeId].node.mode === node.mode) {\n          graph[prevNodeId][key] =\n            getSegmentBitsLength(table[prevNodeId].lastCount + node.length, node.mode) -\n            getSegmentBitsLength(table[prevNodeId].lastCount, node.mode)\n\n          table[prevNodeId].lastCount += node.length\n        } else {\n          if (table[prevNodeId]) table[prevNodeId].lastCount = node.length\n\n          graph[prevNodeId][key] = getSegmentBitsLength(node.length, node.mode) +\n            4 + Mode.getCharCountIndicator(node.mode, version) // switch cost\n        }\n      }\n    }\n\n    prevNodeIds = currentNodeIds\n  }\n\n  for (let n = 0; n < prevNodeIds.length; n++) {\n    graph[prevNodeIds[n]].end = 0\n  }\n\n  return { map: graph, table: table }\n}\n\n/**\n * Builds a segment from a specified data and mode.\n * If a mode is not specified, the more suitable will be used.\n *\n * @param  {String} data             Input data\n * @param  {Mode | String} modesHint Data mode\n * @return {Segment}                 Segment\n */\nfunction buildSingleSegment (data, modesHint) {\n  let mode\n  const bestMode = Mode.getBestModeForData(data)\n\n  mode = Mode.from(modesHint, bestMode)\n\n  // Make sure data can be encoded\n  if (mode !== Mode.BYTE && mode.bit < bestMode.bit) {\n    throw new Error('\"' + data + '\"' +\n      ' cannot be encoded with mode ' + Mode.toString(mode) +\n      '.\\n Suggested mode is: ' + Mode.toString(bestMode))\n  }\n\n  // Use Mode.BYTE if Kanji support is disabled\n  if (mode === Mode.KANJI && !Utils.isKanjiModeEnabled()) {\n    mode = Mode.BYTE\n  }\n\n  switch (mode) {\n    case Mode.NUMERIC:\n      return new NumericData(data)\n\n    case Mode.ALPHANUMERIC:\n      return new AlphanumericData(data)\n\n    case Mode.KANJI:\n      return new KanjiData(data)\n\n    case Mode.BYTE:\n      return new ByteData(data)\n  }\n}\n\n/**\n * Builds a list of segments from an array.\n * Array can contain Strings or Objects with segment's info.\n *\n * For each item which is a string, will be generated a segment with the given\n * string and the more appropriate encoding mode.\n *\n * For each item which is an object, will be generated a segment with the given\n * data and mode.\n * Objects must contain at least the property \"data\".\n * If property \"mode\" is not present, the more suitable mode will be used.\n *\n * @param  {Array} array Array of objects with segments data\n * @return {Array}       Array of Segments\n */\nexports.fromArray = function fromArray (array) {\n  return array.reduce(function (acc, seg) {\n    if (typeof seg === 'string') {\n      acc.push(buildSingleSegment(seg, null))\n    } else if (seg.data) {\n      acc.push(buildSingleSegment(seg.data, seg.mode))\n    }\n\n    return acc\n  }, [])\n}\n\n/**\n * Builds an optimized sequence of segments from a string,\n * which will produce the shortest possible bitstream.\n *\n * @param  {String} data    Input string\n * @param  {Number} version QR Code version\n * @return {Array}          Array of segments\n */\nexports.fromString = function fromString (data, version) {\n  const segs = getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n\n  const nodes = buildNodes(segs)\n  const graph = buildGraph(nodes, version)\n  const path = dijkstra.find_path(graph.map, 'start', 'end')\n\n  const optimizedSegs = []\n  for (let i = 1; i < path.length - 1; i++) {\n    optimizedSegs.push(graph.table[path[i]].node)\n  }\n\n  return exports.fromArray(mergeSegments(optimizedSegs))\n}\n\n/**\n * Splits a string in various segments with the modes which\n * best represent their content.\n * The produced segments are far from being optimized.\n * The output of this function is only used to estimate a QR Code version\n * which may contain the data.\n *\n * @param  {string} data Input string\n * @return {Array}       Array of segments\n */\nexports.rawSplit = function rawSplit (data) {\n  return exports.fromArray(\n    getSegmentsFromString(data, Utils.isKanjiModeEnabled())\n  )\n}\n"],"names":["Mode","require$$0","NumericData","require$$1","AlphanumericData","require$$2","ByteData","require$$3","KanjiData","require$$4","Regex","require$$5","Utils","require$$6","dijkstra","require$$7","getStringByteLength","str","getSegments","regex","mode","segments","result","getSegmentsFromString","dataStr","numSegs","alphaNumSegs","byteSegs","kanjiSegs","s1","s2","obj","getSegmentBitsLength","length","mergeSegments","segs","acc","curr","prevSeg","buildNodes","nodes","i","seg","buildGraph","version","table","graph","prevNodeIds","nodeGroup","currentNodeIds","j","node","key","n","prevNodeId","buildSingleSegment","data","modesHint","bestMode","exports","array","path","optimizedSegs"],"mappings":";;;;;;;;;;;;AAAA,UAAMA,IAAOC,EAAA,GACPC,IAAcC,EAAA,GACdC,IAAmBC,EAAA,GACnBC,IAAWC,EAAA,GACXC,IAAYC,EAAA,GACZC,IAAQC,EAAA,GACRC,IAAQC,EAAA,GACRC,IAAWC,EAAA;AAQjB,aAASC,EAAqBC,GAAK;AACjC,aAAO,SAAS,mBAAmBA,CAAG,CAAC,EAAE;AAAA,IAC3C;AAUA,aAASC,EAAaC,GAAOC,GAAMH,GAAK;AACtC,YAAMI,IAAW,CAAA;AACjB,UAAIC;AAEJ,cAAQA,IAASH,EAAM,KAAKF,CAAG,OAAO;AACpC,QAAAI,EAAS,KAAK;AAAA,UACZ,MAAMC,EAAO,CAAC;AAAA,UACd,OAAOA,EAAO;AAAA,UACd,MAAMF;AAAA,UACN,QAAQE,EAAO,CAAC,EAAE;AAAA,SACnB;AAGH,aAAOD;AAAA,IACT;AASA,aAASE,EAAuBC,GAAS;AACvC,YAAMC,IAAUP,EAAYR,EAAM,SAASV,EAAK,SAASwB,CAAO,GAC1DE,IAAeR,EAAYR,EAAM,cAAcV,EAAK,cAAcwB,CAAO;AAC/E,UAAIG,GACAC;AAEJ,aAAIhB,EAAM,wBACRe,IAAWT,EAAYR,EAAM,MAAMV,EAAK,MAAMwB,CAAO,GACrDI,IAAYV,EAAYR,EAAM,OAAOV,EAAK,OAAOwB,CAAO,MAExDG,IAAWT,EAAYR,EAAM,YAAYV,EAAK,MAAMwB,CAAO,GAC3DI,IAAY,CAAA,IAGDH,EAAQ,OAAOC,GAAcC,GAAUC,CAAS,EAG1D,KAAK,SAAUC,GAAIC,GAAI;AACtB,eAAOD,EAAG,QAAQC,EAAG;AAAA,MAC3B,CAAK,EACA,IAAI,SAAUC,GAAK;AAClB,eAAO;AAAA,UACL,MAAMA,EAAI;AAAA,UACV,MAAMA,EAAI;AAAA,UACV,QAAQA,EAAI;AAAA,QACpB;AAAA,MACA,CAAK;AAAA,IACL;AAUA,aAASC,EAAsBC,GAAQb,GAAM;AAC3C,cAAQA,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAOE,EAAY,cAAc+B,CAAM;AAAA,QACzC,KAAKjC,EAAK;AACR,iBAAOI,EAAiB,cAAc6B,CAAM;AAAA,QAC9C,KAAKjC,EAAK;AACR,iBAAOQ,EAAU,cAAcyB,CAAM;AAAA,QACvC,KAAKjC,EAAK;AACR,iBAAOM,EAAS,cAAc2B,CAAM;AAAA,MAC1C;AAAA,IACA;AAQA,aAASC,EAAeC,GAAM;AAC5B,aAAOA,EAAK,OAAO,SAAUC,GAAKC,GAAM;AACtC,cAAMC,IAAUF,EAAI,SAAS,KAAK,IAAIA,EAAIA,EAAI,SAAS,CAAC,IAAI;AAC5D,eAAIE,KAAWA,EAAQ,SAASD,EAAK,QACnCD,EAAIA,EAAI,SAAS,CAAC,EAAE,QAAQC,EAAK,MAC1BD,MAGTA,EAAI,KAAKC,CAAI,GACND;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP;AAkBA,aAASG,EAAYJ,GAAM;AACzB,YAAMK,IAAQ,CAAA;AACd,eAASC,IAAI,GAAGA,IAAIN,EAAK,QAAQM,KAAK;AACpC,cAAMC,IAAMP,EAAKM,CAAC;AAElB,gBAAQC,EAAI,MAAI;AAAA,UACd,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,cAAc,QAAQ0C,EAAI,OAAM;AAAA,cAC7D,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQ0C,EAAI,OAAM;AAAA,aACtD;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cAACE;AAAA,cACV,EAAE,MAAMA,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AACD;AAAA,UACF,KAAK1C,EAAK;AACR,YAAAwC,EAAM,KAAK;AAAA,cACT,EAAE,MAAME,EAAI,MAAM,MAAM1C,EAAK,MAAM,QAAQgB,EAAoB0B,EAAI,IAAI,EAAC;AAAA,aACzE;AAAA,QACT;AAAA,MACA;AAEE,aAAOF;AAAA,IACT;AAcA,aAASG,EAAYH,GAAOI,GAAS;AACnC,YAAMC,IAAQ,CAAA,GACRC,IAAQ,EAAE,OAAO,CAAA,EAAE;AACzB,UAAIC,IAAc,CAAC,OAAO;AAE1B,eAAS,IAAI,GAAG,IAAIP,EAAM,QAAQ,KAAK;AACrC,cAAMQ,IAAYR,EAAM,CAAC,GACnBS,IAAiB,CAAA;AAEvB,iBAASC,IAAI,GAAGA,IAAIF,EAAU,QAAQE,KAAK;AACzC,gBAAMC,IAAOH,EAAUE,CAAC,GAClBE,IAAM,KAAK,IAAIF;AAErB,UAAAD,EAAe,KAAKG,CAAG,GACvBP,EAAMO,CAAG,IAAI,EAAE,MAAMD,GAAM,WAAW,EAAC,GACvCL,EAAMM,CAAG,IAAI,CAAA;AAEb,mBAASC,IAAI,GAAGA,IAAIN,EAAY,QAAQM,KAAK;AAC3C,kBAAMC,IAAaP,EAAYM,CAAC;AAEhC,YAAIR,EAAMS,CAAU,KAAKT,EAAMS,CAAU,EAAE,KAAK,SAASH,EAAK,QAC5DL,EAAMQ,CAAU,EAAEF,CAAG,IACnBpB,EAAqBa,EAAMS,CAAU,EAAE,YAAYH,EAAK,QAAQA,EAAK,IAAI,IACzEnB,EAAqBa,EAAMS,CAAU,EAAE,WAAWH,EAAK,IAAI,GAE7DN,EAAMS,CAAU,EAAE,aAAaH,EAAK,WAEhCN,EAAMS,CAAU,MAAGT,EAAMS,CAAU,EAAE,YAAYH,EAAK,SAE1DL,EAAMQ,CAAU,EAAEF,CAAG,IAAIpB,EAAqBmB,EAAK,QAAQA,EAAK,IAAI,IAClE,IAAInD,EAAK,sBAAsBmD,EAAK,MAAMP,CAAO;AAAA,UAE7D;AAAA,QACA;AAEI,QAAAG,IAAcE;AAAA,MAClB;AAEE,eAASI,IAAI,GAAGA,IAAIN,EAAY,QAAQM;AACtC,QAAAP,EAAMC,EAAYM,CAAC,CAAC,EAAE,MAAM;AAG9B,aAAO,EAAE,KAAKP,GAAO,OAAOD,EAAK;AAAA,IACnC;AAUA,aAASU,EAAoBC,GAAMC,GAAW;AAC5C,UAAIrC;AACJ,YAAMsC,IAAW1D,EAAK,mBAAmBwD,CAAI;AAK7C,UAHApC,IAAOpB,EAAK,KAAKyD,GAAWC,CAAQ,GAGhCtC,MAASpB,EAAK,QAAQoB,EAAK,MAAMsC,EAAS;AAC5C,cAAM,IAAI,MAAM,MAAMF,IAAO,mCACOxD,EAAK,SAASoB,CAAI,IACpD;AAAA,wBAA4BpB,EAAK,SAAS0D,CAAQ,CAAC;AAQvD,cAJItC,MAASpB,EAAK,SAAS,CAACY,EAAM,mBAAkB,MAClDQ,IAAOpB,EAAK,OAGNoB,GAAI;AAAA,QACV,KAAKpB,EAAK;AACR,iBAAO,IAAIE,EAAYsD,CAAI;AAAA,QAE7B,KAAKxD,EAAK;AACR,iBAAO,IAAII,EAAiBoD,CAAI;AAAA,QAElC,KAAKxD,EAAK;AACR,iBAAO,IAAIQ,EAAUgD,CAAI;AAAA,QAE3B,KAAKxD,EAAK;AACR,iBAAO,IAAIM,EAASkD,CAAI;AAAA,MAC9B;AAAA,IACA;AAiBAG,IAAAA,EAAA,YAAoB,SAAoBC,GAAO;AAC7C,aAAOA,EAAM,OAAO,SAAUxB,GAAKM,GAAK;AACtC,eAAI,OAAOA,KAAQ,WACjBN,EAAI,KAAKmB,EAAmBb,GAAK,IAAI,CAAC,IAC7BA,EAAI,QACbN,EAAI,KAAKmB,EAAmBb,EAAI,MAAMA,EAAI,IAAI,CAAC,GAG1CN;AAAA,MACX,GAAK,CAAA,CAAE;AAAA,IACP,GAUAuB,EAAA,aAAqB,SAAqBH,GAAMZ,GAAS;AACvD,YAAMT,IAAOZ,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE,GAE7D4B,IAAQD,EAAWJ,CAAI,GACvBW,IAAQH,EAAWH,GAAOI,CAAO,GACjCiB,IAAO/C,EAAS,UAAUgC,EAAM,KAAK,SAAS,KAAK,GAEnDgB,IAAgB,CAAA;AACtB,eAASrB,IAAI,GAAGA,IAAIoB,EAAK,SAAS,GAAGpB;AACnC,QAAAqB,EAAc,KAAKhB,EAAM,MAAMe,EAAKpB,CAAC,CAAC,EAAE,IAAI;AAG9C,aAAOkB,EAAQ,UAAUzB,EAAc4B,CAAa,CAAC;AAAA,IACvD,GAYAH,EAAA,WAAmB,SAAmBH,GAAM;AAC1C,aAAOG,EAAQ;AAAA,QACbpC,EAAsBiC,GAAM5C,EAAM,mBAAkB,CAAE;AAAA,MAC1D;AAAA,IACA;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index120.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/error-correction-code.js"],"sourcesContent":["const ECLevel = require('./error-correction-level')\r\n\r\nconst EC_BLOCKS_TABLE = [\r\n// L  M  Q  H\r\n  1, 1, 1, 1,\r\n  1, 1, 1, 1,\r\n  1, 1, 2, 2,\r\n  1, 2, 2, 4,\r\n  1, 2, 4, 4,\r\n  2, 4, 4, 4,\r\n  2, 4, 6, 5,\r\n  2, 4, 6, 6,\r\n  2, 5, 8, 8,\r\n  4, 5, 8, 8,\r\n  4, 5, 8, 11,\r\n  4, 8, 10, 11,\r\n  4, 9, 12, 16,\r\n  4, 9, 16, 16,\r\n  6, 10, 12, 18,\r\n  6, 10, 17, 16,\r\n  6, 11, 16, 19,\r\n  6, 13, 18, 21,\r\n  7, 14, 21, 25,\r\n  8, 16, 20, 25,\r\n  8, 17, 23, 25,\r\n  9, 17, 23, 34,\r\n  9, 18, 25, 30,\r\n  10, 20, 27, 32,\r\n  12, 21, 29, 35,\r\n  12, 23, 34, 37,\r\n  12, 25, 34, 40,\r\n  13, 26, 35, 42,\r\n  14, 28, 38, 45,\r\n  15, 29, 40, 48,\r\n  16, 31, 43, 51,\r\n  17, 33, 45, 54,\r\n  18, 35, 48, 57,\r\n  19, 37, 51, 60,\r\n  19, 38, 53, 63,\r\n  20, 40, 56, 66,\r\n  21, 43, 59, 70,\r\n  22, 45, 62, 74,\r\n  24, 47, 65, 77,\r\n  25, 49, 68, 81\r\n]\r\n\r\nconst EC_CODEWORDS_TABLE = [\r\n// L  M  Q  H\r\n  7, 10, 13, 17,\r\n  10, 16, 22, 28,\r\n  15, 26, 36, 44,\r\n  20, 36, 52, 64,\r\n  26, 48, 72, 88,\r\n  36, 64, 96, 112,\r\n  40, 72, 108, 130,\r\n  48, 88, 132, 156,\r\n  60, 110, 160, 192,\r\n  72, 130, 192, 224,\r\n  80, 150, 224, 264,\r\n  96, 176, 260, 308,\r\n  104, 198, 288, 352,\r\n  120, 216, 320, 384,\r\n  132, 240, 360, 432,\r\n  144, 280, 408, 480,\r\n  168, 308, 448, 532,\r\n  180, 338, 504, 588,\r\n  196, 364, 546, 650,\r\n  224, 416, 600, 700,\r\n  224, 442, 644, 750,\r\n  252, 476, 690, 816,\r\n  270, 504, 750, 900,\r\n  300, 560, 810, 960,\r\n  312, 588, 870, 1050,\r\n  336, 644, 952, 1110,\r\n  360, 700, 1020, 1200,\r\n  390, 728, 1050, 1260,\r\n  420, 784, 1140, 1350,\r\n  450, 812, 1200, 1440,\r\n  480, 868, 1290, 1530,\r\n  510, 924, 1350, 1620,\r\n  540, 980, 1440, 1710,\r\n  570, 1036, 1530, 1800,\r\n  570, 1064, 1590, 1890,\r\n  600, 1120, 1680, 1980,\r\n  630, 1204, 1770, 2100,\r\n  660, 1260, 1860, 2220,\r\n  720, 1316, 1950, 2310,\r\n  750, 1372, 2040, 2430\r\n]\r\n\r\n/**\r\n * Returns the number of error correction block that the QR Code should contain\r\n * for the specified version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction blocks\r\n */\r\nexports.getBlocksCount = function getBlocksCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_BLOCKS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n\r\n/**\r\n * Returns the number of error correction codewords to use for the specified\r\n * version and error correction level.\r\n *\r\n * @param  {Number} version              QR Code version\r\n * @param  {Number} errorCorrectionLevel Error correction level\r\n * @return {Number}                      Number of error correction codewords\r\n */\r\nexports.getTotalCodewordsCount = function getTotalCodewordsCount (version, errorCorrectionLevel) {\r\n  switch (errorCorrectionLevel) {\r\n    case ECLevel.L:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 0]\r\n    case ECLevel.M:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 1]\r\n    case ECLevel.Q:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 2]\r\n    case ECLevel.H:\r\n      return EC_CODEWORDS_TABLE[(version - 1) * 4 + 3]\r\n    default:\r\n      return undefined\r\n  }\r\n}\r\n"],"names":["ECLevel","require$$0","EC_BLOCKS_TABLE","EC_CODEWORDS_TABLE","errorCorrectionCode","version","errorCorrectionLevel"],"mappings":";;;;;;AAAA,QAAMA,IAAUC,EAAA,GAEVC,IAAkB;AAAA;AAAA,IAEtB;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAG;AAAA,IACT;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAG;AAAA,IAAI;AAAA,IACV;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,KAGRC,IAAqB;AAAA;AAAA,IAEzB;AAAA,IAAG;AAAA,IAAI;AAAA,IAAI;AAAA,IACX;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAI;AAAA,IACZ;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAI;AAAA,IAAK;AAAA,IACb;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAI;AAAA,IAAK;AAAA,IAAK;AAAA,IACd;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAK;AAAA,IACf;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAK;AAAA,IAAM;AAAA,IAChB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA,IACjB;AAAA,IAAK;AAAA,IAAM;AAAA,IAAM;AAAA;AAWnB,SAAAC,EAAA,iBAAyB,SAAyBC,GAASC,GAAsB;AAC/E,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C,KAAKL,EAAQ;AACX,eAAOE,GAAiBG,IAAU,KAAK,IAAI,CAAC;AAAA,MAC9C;AACE;AAAA;EAEN,GAUAD,EAAA,yBAAiC,SAAiCC,GAASC,GAAsB;AAC/F,YAAQA,GAAoB;AAAA,MAC1B,KAAKN,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD,KAAKL,EAAQ;AACX,eAAOG,GAAoBE,IAAU,KAAK,IAAI,CAAC;AAAA,MACjD;AACE;AAAA;EAEN;;","x_google_ignoreList":[0]}

package/dist/index121.js

@@ -1,5 +1,28 @@
-var a = {};
+import { __require as h } from "./index136.js";
+var o, a;
+function g() {
+  if (a) return o;
+  a = 1;
+  const t = h();
+  function n(i) {
+    this.genPoly = void 0, this.degree = i, this.degree && this.initialize(this.degree);
+  }
+  return n.prototype.initialize = function(e) {
+    this.degree = e, this.genPoly = t.generateECPolynomial(this.degree);
+  }, n.prototype.encode = function(e) {
+    if (!this.genPoly)
+      throw new Error("Encoder not initialized");
+    const d = new Uint8Array(e.length + this.degree);
+    d.set(e);
+    const r = t.mod(d, this.genPoly), s = this.degree - r.length;
+    if (s > 0) {
+      const l = new Uint8Array(this.degree);
+      return l.set(r, s), l;
+    }
+    return r;
+  }, o = n, o;
+}
 export {
-  a as __exports
+  g as __require
 };
 //# sourceMappingURL=index121.js.map

package/dist/index121.js.map

@@ -1 +1 @@
-{"version":3,"file":"index121.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index121.js","sources":["../../../node_modules/.pnpm/qrcode@1.5.4/node_modules/qrcode/lib/core/reed-solomon-encoder.js"],"sourcesContent":["const Polynomial = require('./polynomial')\n\nfunction ReedSolomonEncoder (degree) {\n  this.genPoly = undefined\n  this.degree = degree\n\n  if (this.degree) this.initialize(this.degree)\n}\n\n/**\n * Initialize the encoder.\n * The input param should correspond to the number of error correction codewords.\n *\n * @param  {Number} degree\n */\nReedSolomonEncoder.prototype.initialize = function initialize (degree) {\n  // create an irreducible generator polynomial\n  this.degree = degree\n  this.genPoly = Polynomial.generateECPolynomial(this.degree)\n}\n\n/**\n * Encodes a chunk of data\n *\n * @param  {Uint8Array} data Buffer containing input data\n * @return {Uint8Array}      Buffer containing encoded data\n */\nReedSolomonEncoder.prototype.encode = function encode (data) {\n  if (!this.genPoly) {\n    throw new Error('Encoder not initialized')\n  }\n\n  // Calculate EC for this data block\n  // extends data size to data+genPoly size\n  const paddedData = new Uint8Array(data.length + this.degree)\n  paddedData.set(data)\n\n  // The error correction codewords are the remainder after dividing the data codewords\n  // by a generator polynomial\n  const remainder = Polynomial.mod(paddedData, this.genPoly)\n\n  // return EC data blocks (last n byte, where n is the degree of genPoly)\n  // If coefficients number in remainder are less than genPoly degree,\n  // pad with 0s to the left to reach the needed number of coefficients\n  const start = this.degree - remainder.length\n  if (start > 0) {\n    const buff = new Uint8Array(this.degree)\n    buff.set(remainder, start)\n\n    return buff\n  }\n\n  return remainder\n}\n\nmodule.exports = ReedSolomonEncoder\n"],"names":["Polynomial","require$$0","ReedSolomonEncoder","degree","data","paddedData","remainder","start","buff","reedSolomonEncoder"],"mappings":";;;;;AAAA,QAAMA,IAAaC,EAAA;AAEnB,WAASC,EAAoBC,GAAQ;AACnC,SAAK,UAAU,QACf,KAAK,SAASA,GAEV,KAAK,UAAQ,KAAK,WAAW,KAAK,MAAM;AAAA,EAC9C;AAQA,SAAAD,EAAmB,UAAU,aAAa,SAAqBC,GAAQ;AAErE,SAAK,SAASA,GACd,KAAK,UAAUH,EAAW,qBAAqB,KAAK,MAAM;AAAA,EAC5D,GAQAE,EAAmB,UAAU,SAAS,SAAiBE,GAAM;AAC3D,QAAI,CAAC,KAAK;AACR,YAAM,IAAI,MAAM,yBAAyB;AAK3C,UAAMC,IAAa,IAAI,WAAWD,EAAK,SAAS,KAAK,MAAM;AAC3D,IAAAC,EAAW,IAAID,CAAI;AAInB,UAAME,IAAYN,EAAW,IAAIK,GAAY,KAAK,OAAO,GAKnDE,IAAQ,KAAK,SAASD,EAAU;AACtC,QAAIC,IAAQ,GAAG;AACb,YAAMC,IAAO,IAAI,WAAW,KAAK,MAAM;AACvC,aAAAA,EAAK,IAAIF,GAAWC,CAAK,GAElBC;AAAA,IACX;AAEE,WAAOF;AAAA,EACT,GAEAG,IAAiBP;;","x_google_ignoreList":[0]}