1
0

qrcode.js 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006
  1. //---------------------------------------------------------------------
  2. // QRCode for JavaScript
  3. //
  4. // Copyright (c) 2009 Kazuhiko Arase
  5. // Re-written in TypeScript by Makito <sumimakito@hotmail.com>
  6. //
  7. // URL: http://www.d-project.com/
  8. //
  9. // Licensed under the MIT license:
  10. // http://www.opensource.org/licenses/mit-license.php
  11. //
  12. // The word "QR Code" is registered trademark of
  13. // DENSO WAVE INCORPORATED
  14. // http://www.denso-wave.com/qrcode/faqpatent-e.html
  15. //
  16. //---------------------------------------------------------------------
  17. function checkQRVersion(version, sText, nCorrectLevel) {
  18. const length = _getUTF8Length(sText);
  19. const i = version - 1;
  20. let nLimit = 0;
  21. switch (nCorrectLevel) {
  22. case QRErrorCorrectLevel.L:
  23. nLimit = QRCodeLimitLength[i][0];
  24. break;
  25. case QRErrorCorrectLevel.M:
  26. nLimit = QRCodeLimitLength[i][1];
  27. break;
  28. case QRErrorCorrectLevel.Q:
  29. nLimit = QRCodeLimitLength[i][2];
  30. break;
  31. case QRErrorCorrectLevel.H:
  32. nLimit = QRCodeLimitLength[i][3];
  33. break;
  34. }
  35. return length <= nLimit;
  36. }
  37. function _getTypeNumber(sText, nCorrectLevel) {
  38. var nType = 1;
  39. var length = _getUTF8Length(sText);
  40. for (var i = 0, len = QRCodeLimitLength.length; i < len; i++) {
  41. var nLimit = 0;
  42. switch (nCorrectLevel) {
  43. case QRErrorCorrectLevel.L:
  44. nLimit = QRCodeLimitLength[i][0];
  45. break;
  46. case QRErrorCorrectLevel.M:
  47. nLimit = QRCodeLimitLength[i][1];
  48. break;
  49. case QRErrorCorrectLevel.Q:
  50. nLimit = QRCodeLimitLength[i][2];
  51. break;
  52. case QRErrorCorrectLevel.H:
  53. nLimit = QRCodeLimitLength[i][3];
  54. break;
  55. }
  56. if (length <= nLimit) {
  57. break;
  58. }
  59. else {
  60. nType++;
  61. }
  62. }
  63. if (nType > QRCodeLimitLength.length) {
  64. throw new Error("Too long data");
  65. }
  66. return nType;
  67. }
  68. function _getUTF8Length(sText) {
  69. var replacedText = encodeURI(sText)
  70. .toString()
  71. .replace(/\%[0-9a-fA-F]{2}/g, "a");
  72. return replacedText.length + (replacedText.length != Number(sText) ? 3 : 0);
  73. }
  74. class QR8bitByte {
  75. mode = QRMode.MODE_8BIT_BYTE;
  76. data;
  77. parsedData = [];
  78. constructor(data) {
  79. this.data = data;
  80. const byteArrays = [];
  81. // Added to support UTF-8 Characters
  82. for (let i = 0, l = this.data.length; i < l; i++) {
  83. const byteArray = [];
  84. const code = this.data.charCodeAt(i);
  85. if (code > 0x10000) {
  86. byteArray[0] = 0xf0 | ((code & 0x1c0000) >>> 18);
  87. byteArray[1] = 0x80 | ((code & 0x3f000) >>> 12);
  88. byteArray[2] = 0x80 | ((code & 0xfc0) >>> 6);
  89. byteArray[3] = 0x80 | (code & 0x3f);
  90. }
  91. else if (code > 0x800) {
  92. byteArray[0] = 0xe0 | ((code & 0xf000) >>> 12);
  93. byteArray[1] = 0x80 | ((code & 0xfc0) >>> 6);
  94. byteArray[2] = 0x80 | (code & 0x3f);
  95. }
  96. else if (code > 0x80) {
  97. byteArray[0] = 0xc0 | ((code & 0x7c0) >>> 6);
  98. byteArray[1] = 0x80 | (code & 0x3f);
  99. }
  100. else {
  101. byteArray[0] = code;
  102. }
  103. byteArrays.push(byteArray);
  104. }
  105. this.parsedData = Array.prototype.concat.apply([], byteArrays);
  106. if (this.parsedData.length != this.data.length) {
  107. this.parsedData.unshift(191);
  108. this.parsedData.unshift(187);
  109. this.parsedData.unshift(239);
  110. }
  111. }
  112. getLength() {
  113. return this.parsedData.length;
  114. }
  115. write(buffer) {
  116. for (let i = 0, l = this.parsedData.length; i < l; i++) {
  117. buffer.put(this.parsedData[i], 8);
  118. }
  119. }
  120. }
  121. export class QRCodeModel {
  122. typeNumber;
  123. errorCorrectLevel;
  124. modules;
  125. moduleCount = 0;
  126. dataCache;
  127. dataList = [];
  128. maskPattern;
  129. constructor(typeNumber = -1, errorCorrectLevel = QRErrorCorrectLevel.L) {
  130. this.typeNumber = typeNumber;
  131. this.errorCorrectLevel = errorCorrectLevel;
  132. this.moduleCount = 0;
  133. this.dataList = [];
  134. }
  135. addData(data) {
  136. if (this.typeNumber <= 0) {
  137. this.typeNumber = _getTypeNumber(data, this.errorCorrectLevel);
  138. }
  139. else if (this.typeNumber > 40) {
  140. throw new Error(`Invalid QR version: ${this.typeNumber}`);
  141. }
  142. else {
  143. if (!checkQRVersion(this.typeNumber, data, this.errorCorrectLevel)) {
  144. throw new Error(`Data is too long for QR version: ${this.typeNumber}`);
  145. }
  146. }
  147. const newData = new QR8bitByte(data);
  148. this.dataList.push(newData);
  149. this.dataCache = undefined;
  150. }
  151. isDark(row, col) {
  152. if (row < 0 || this.moduleCount <= row || col < 0 || this.moduleCount <= col) {
  153. throw new Error(`${row},${col}`);
  154. }
  155. return this.modules[row][col];
  156. }
  157. getModuleCount() {
  158. return this.moduleCount;
  159. }
  160. make() {
  161. this.makeImpl(false, this.getBestMaskPattern());
  162. }
  163. makeImpl(test, maskPattern) {
  164. this.moduleCount = this.typeNumber * 4 + 17;
  165. this.modules = new Array(this.moduleCount);
  166. for (let row = 0; row < this.moduleCount; row++) {
  167. this.modules[row] = new Array(this.moduleCount);
  168. for (let col = 0; col < this.moduleCount; col++) {
  169. this.modules[row][col] = null;
  170. }
  171. }
  172. this.setupPositionProbePattern(0, 0);
  173. this.setupPositionProbePattern(this.moduleCount - 7, 0);
  174. this.setupPositionProbePattern(0, this.moduleCount - 7);
  175. this.setupPositionAdjustPattern();
  176. this.setupTimingPattern();
  177. this.setupTypeInfo(test, maskPattern);
  178. if (this.typeNumber >= 7) {
  179. this.setupTypeNumber(test);
  180. }
  181. if (this.dataCache == null) {
  182. this.dataCache = QRCodeModel.createData(this.typeNumber, this.errorCorrectLevel, this.dataList);
  183. }
  184. this.mapData(this.dataCache, maskPattern);
  185. }
  186. setupPositionProbePattern(row, col) {
  187. for (let r = -1; r <= 7; r++) {
  188. if (row + r <= -1 || this.moduleCount <= row + r)
  189. continue;
  190. for (let c = -1; c <= 7; c++) {
  191. if (col + c <= -1 || this.moduleCount <= col + c)
  192. continue;
  193. if ((0 <= r && r <= 6 && (c == 0 || c == 6)) ||
  194. (0 <= c && c <= 6 && (r == 0 || r == 6)) ||
  195. (2 <= r && r <= 4 && 2 <= c && c <= 4)) {
  196. this.modules[row + r][col + c] = true;
  197. }
  198. else {
  199. this.modules[row + r][col + c] = false;
  200. }
  201. }
  202. }
  203. }
  204. getBestMaskPattern() {
  205. if (Number.isInteger(this.maskPattern) && Object.values(QRMaskPattern).includes(this.maskPattern)) {
  206. return this.maskPattern;
  207. }
  208. let minLostPoint = 0;
  209. let pattern = 0;
  210. for (let i = 0; i < 8; i++) {
  211. this.makeImpl(true, i);
  212. const lostPoint = QRUtil.getLostPoint(this);
  213. if (i == 0 || minLostPoint > lostPoint) {
  214. minLostPoint = lostPoint;
  215. pattern = i;
  216. }
  217. }
  218. return pattern;
  219. }
  220. setupTimingPattern() {
  221. for (let r = 8; r < this.moduleCount - 8; r++) {
  222. if (this.modules[r][6] != null) {
  223. continue;
  224. }
  225. this.modules[r][6] = r % 2 == 0;
  226. }
  227. for (let c = 8; c < this.moduleCount - 8; c++) {
  228. if (this.modules[6][c] != null) {
  229. continue;
  230. }
  231. this.modules[6][c] = c % 2 == 0;
  232. }
  233. }
  234. setupPositionAdjustPattern() {
  235. const pos = QRUtil.getPatternPosition(this.typeNumber);
  236. for (let i = 0; i < pos.length; i++) {
  237. for (let j = 0; j < pos.length; j++) {
  238. const row = pos[i];
  239. const col = pos[j];
  240. if (this.modules[row][col] != null) {
  241. continue;
  242. }
  243. for (let r = -2; r <= 2; r++) {
  244. for (let c = -2; c <= 2; c++) {
  245. if (r == -2 || r == 2 || c == -2 || c == 2 || (r == 0 && c == 0)) {
  246. this.modules[row + r][col + c] = true;
  247. }
  248. else {
  249. this.modules[row + r][col + c] = false;
  250. }
  251. }
  252. }
  253. }
  254. }
  255. }
  256. setupTypeNumber(test) {
  257. const bits = QRUtil.getBCHTypeNumber(this.typeNumber);
  258. for (var i = 0; i < 18; i++) {
  259. var mod = !test && ((bits >> i) & 1) == 1;
  260. this.modules[Math.floor(i / 3)][(i % 3) + this.moduleCount - 8 - 3] = mod;
  261. }
  262. for (var i = 0; i < 18; i++) {
  263. var mod = !test && ((bits >> i) & 1) == 1;
  264. this.modules[(i % 3) + this.moduleCount - 8 - 3][Math.floor(i / 3)] = mod;
  265. }
  266. }
  267. setupTypeInfo(test, maskPattern) {
  268. const data = (this.errorCorrectLevel << 3) | maskPattern;
  269. const bits = QRUtil.getBCHTypeInfo(data);
  270. for (var i = 0; i < 15; i++) {
  271. var mod = !test && ((bits >> i) & 1) == 1;
  272. if (i < 6) {
  273. this.modules[i][8] = mod;
  274. }
  275. else if (i < 8) {
  276. this.modules[i + 1][8] = mod;
  277. }
  278. else {
  279. this.modules[this.moduleCount - 15 + i][8] = mod;
  280. }
  281. }
  282. for (var i = 0; i < 15; i++) {
  283. var mod = !test && ((bits >> i) & 1) == 1;
  284. if (i < 8) {
  285. this.modules[8][this.moduleCount - i - 1] = mod;
  286. }
  287. else if (i < 9) {
  288. this.modules[8][15 - i - 1 + 1] = mod;
  289. }
  290. else {
  291. this.modules[8][15 - i - 1] = mod;
  292. }
  293. }
  294. this.modules[this.moduleCount - 8][8] = !test;
  295. }
  296. mapData(data, maskPattern) {
  297. let inc = -1;
  298. let row = this.moduleCount - 1;
  299. let bitIndex = 7;
  300. let byteIndex = 0;
  301. for (let col = this.moduleCount - 1; col > 0; col -= 2) {
  302. if (col == 6)
  303. col--;
  304. while (true) {
  305. for (let c = 0; c < 2; c++) {
  306. if (this.modules[row][col - c] == null) {
  307. let dark = false;
  308. if (byteIndex < data.length) {
  309. dark = ((data[byteIndex] >>> bitIndex) & 1) == 1;
  310. }
  311. const mask = QRUtil.getMask(maskPattern, row, col - c);
  312. if (mask) {
  313. dark = !dark;
  314. }
  315. this.modules[row][col - c] = dark;
  316. bitIndex--;
  317. if (bitIndex == -1) {
  318. byteIndex++;
  319. bitIndex = 7;
  320. }
  321. }
  322. }
  323. row += inc;
  324. if (row < 0 || this.moduleCount <= row) {
  325. row -= inc;
  326. inc = -inc;
  327. break;
  328. }
  329. }
  330. }
  331. }
  332. static PAD0 = 0xec;
  333. static PAD1 = 0x11;
  334. static createData(typeNumber, errorCorrectLevel, dataList) {
  335. const rsBlocks = QRRSBlock.getRSBlocks(typeNumber, errorCorrectLevel);
  336. const buffer = new QRBitBuffer();
  337. for (var i = 0; i < dataList.length; i++) {
  338. const data = dataList[i];
  339. buffer.put(data.mode, 4);
  340. buffer.put(data.getLength(), QRUtil.getLengthInBits(data.mode, typeNumber));
  341. data.write(buffer);
  342. }
  343. let totalDataCount = 0;
  344. for (var i = 0; i < rsBlocks.length; i++) {
  345. totalDataCount += rsBlocks[i].dataCount;
  346. }
  347. if (buffer.getLengthInBits() > totalDataCount * 8) {
  348. throw new Error(`code length overflow. (${buffer.getLengthInBits()}>${totalDataCount * 8})`);
  349. }
  350. if (buffer.getLengthInBits() + 4 <= totalDataCount * 8) {
  351. buffer.put(0, 4);
  352. }
  353. while (buffer.getLengthInBits() % 8 != 0) {
  354. buffer.putBit(false);
  355. }
  356. while (true) {
  357. if (buffer.getLengthInBits() >= totalDataCount * 8) {
  358. break;
  359. }
  360. buffer.put(QRCodeModel.PAD0, 8);
  361. if (buffer.getLengthInBits() >= totalDataCount * 8) {
  362. break;
  363. }
  364. buffer.put(QRCodeModel.PAD1, 8);
  365. }
  366. return QRCodeModel.createBytes(buffer, rsBlocks);
  367. }
  368. static createBytes(buffer, rsBlocks) {
  369. let offset = 0;
  370. let maxDcCount = 0;
  371. let maxEcCount = 0;
  372. const dcdata = new Array(rsBlocks.length);
  373. const ecdata = new Array(rsBlocks.length);
  374. for (var r = 0; r < rsBlocks.length; r++) {
  375. const dcCount = rsBlocks[r].dataCount;
  376. const ecCount = rsBlocks[r].totalCount - dcCount;
  377. maxDcCount = Math.max(maxDcCount, dcCount);
  378. maxEcCount = Math.max(maxEcCount, ecCount);
  379. dcdata[r] = new Array(dcCount);
  380. for (var i = 0; i < dcdata[r].length; i++) {
  381. dcdata[r][i] = 0xff & buffer.buffer[i + offset];
  382. }
  383. offset += dcCount;
  384. const rsPoly = QRUtil.getErrorCorrectPolynomial(ecCount);
  385. const rawPoly = new QRPolynomial(dcdata[r], rsPoly.getLength() - 1);
  386. const modPoly = rawPoly.mod(rsPoly);
  387. ecdata[r] = new Array(rsPoly.getLength() - 1);
  388. for (var i = 0; i < ecdata[r].length; i++) {
  389. const modIndex = i + modPoly.getLength() - ecdata[r].length;
  390. ecdata[r][i] = modIndex >= 0 ? modPoly.get(modIndex) : 0;
  391. }
  392. }
  393. let totalCodeCount = 0;
  394. for (var i = 0; i < rsBlocks.length; i++) {
  395. totalCodeCount += rsBlocks[i].totalCount;
  396. }
  397. const data = new Array(totalCodeCount);
  398. let index = 0;
  399. for (var i = 0; i < maxDcCount; i++) {
  400. for (var r = 0; r < rsBlocks.length; r++) {
  401. if (i < dcdata[r].length) {
  402. data[index++] = dcdata[r][i];
  403. }
  404. }
  405. }
  406. for (var i = 0; i < maxEcCount; i++) {
  407. for (var r = 0; r < rsBlocks.length; r++) {
  408. if (i < ecdata[r].length) {
  409. data[index++] = ecdata[r][i];
  410. }
  411. }
  412. }
  413. return data;
  414. }
  415. }
  416. export const QRErrorCorrectLevel = { L: 1, M: 0, Q: 3, H: 2 };
  417. const QRMode = { MODE_NUMBER: 1 << 0, MODE_ALPHA_NUM: 1 << 1, MODE_8BIT_BYTE: 1 << 2, MODE_KANJI: 1 << 3 };
  418. export const QRMaskPattern = {
  419. PATTERN000: 0,
  420. PATTERN001: 1,
  421. PATTERN010: 2,
  422. PATTERN011: 3,
  423. PATTERN100: 4,
  424. PATTERN101: 5,
  425. PATTERN110: 6,
  426. PATTERN111: 7,
  427. };
  428. export class QRUtil {
  429. static PATTERN_POSITION_TABLE = [
  430. [],
  431. [6, 18],
  432. [6, 22],
  433. [6, 26],
  434. [6, 30],
  435. [6, 34],
  436. [6, 22, 38],
  437. [6, 24, 42],
  438. [6, 26, 46],
  439. [6, 28, 50],
  440. [6, 30, 54],
  441. [6, 32, 58],
  442. [6, 34, 62],
  443. [6, 26, 46, 66],
  444. [6, 26, 48, 70],
  445. [6, 26, 50, 74],
  446. [6, 30, 54, 78],
  447. [6, 30, 56, 82],
  448. [6, 30, 58, 86],
  449. [6, 34, 62, 90],
  450. [6, 28, 50, 72, 94],
  451. [6, 26, 50, 74, 98],
  452. [6, 30, 54, 78, 102],
  453. [6, 28, 54, 80, 106],
  454. [6, 32, 58, 84, 110],
  455. [6, 30, 58, 86, 114],
  456. [6, 34, 62, 90, 118],
  457. [6, 26, 50, 74, 98, 122],
  458. [6, 30, 54, 78, 102, 126],
  459. [6, 26, 52, 78, 104, 130],
  460. [6, 30, 56, 82, 108, 134],
  461. [6, 34, 60, 86, 112, 138],
  462. [6, 30, 58, 86, 114, 142],
  463. [6, 34, 62, 90, 118, 146],
  464. [6, 30, 54, 78, 102, 126, 150],
  465. [6, 24, 50, 76, 102, 128, 154],
  466. [6, 28, 54, 80, 106, 132, 158],
  467. [6, 32, 58, 84, 110, 136, 162],
  468. [6, 26, 54, 82, 110, 138, 166],
  469. [6, 30, 58, 86, 114, 142, 170],
  470. ];
  471. static G15 = (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0);
  472. static G18 = (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0);
  473. static G15_MASK = (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1);
  474. static getBCHTypeInfo(data) {
  475. let d = data << 10;
  476. while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15) >= 0) {
  477. d ^= QRUtil.G15 << (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G15));
  478. }
  479. return ((data << 10) | d) ^ QRUtil.G15_MASK;
  480. }
  481. static getBCHTypeNumber(data) {
  482. let d = data << 12;
  483. while (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18) >= 0) {
  484. d ^= QRUtil.G18 << (QRUtil.getBCHDigit(d) - QRUtil.getBCHDigit(QRUtil.G18));
  485. }
  486. return (data << 12) | d;
  487. }
  488. static getBCHDigit(data) {
  489. let digit = 0;
  490. while (data != 0) {
  491. digit++;
  492. data >>>= 1;
  493. }
  494. return digit;
  495. }
  496. static getPatternPosition(typeNumber) {
  497. return QRUtil.PATTERN_POSITION_TABLE[typeNumber - 1];
  498. }
  499. static getMask(maskPattern, i, j) {
  500. switch (maskPattern) {
  501. case QRMaskPattern.PATTERN000:
  502. return (i + j) % 2 == 0;
  503. case QRMaskPattern.PATTERN001:
  504. return i % 2 == 0;
  505. case QRMaskPattern.PATTERN010:
  506. return j % 3 == 0;
  507. case QRMaskPattern.PATTERN011:
  508. return (i + j) % 3 == 0;
  509. case QRMaskPattern.PATTERN100:
  510. return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 == 0;
  511. case QRMaskPattern.PATTERN101:
  512. return ((i * j) % 2) + ((i * j) % 3) == 0;
  513. case QRMaskPattern.PATTERN110:
  514. return (((i * j) % 2) + ((i * j) % 3)) % 2 == 0;
  515. case QRMaskPattern.PATTERN111:
  516. return (((i * j) % 3) + ((i + j) % 2)) % 2 == 0;
  517. default:
  518. throw new Error(`bad maskPattern:${maskPattern}`);
  519. }
  520. }
  521. static getErrorCorrectPolynomial(errorCorrectLength) {
  522. let a = new QRPolynomial([1], 0);
  523. for (let i = 0; i < errorCorrectLength; i++) {
  524. a = a.multiply(new QRPolynomial([1, QRMath.gexp(i)], 0));
  525. }
  526. return a;
  527. }
  528. static getLengthInBits(mode, type) {
  529. if (1 <= type && type < 10) {
  530. switch (mode) {
  531. case QRMode.MODE_NUMBER:
  532. return 10;
  533. case QRMode.MODE_ALPHA_NUM:
  534. return 9;
  535. case QRMode.MODE_8BIT_BYTE:
  536. return 8;
  537. case QRMode.MODE_KANJI:
  538. return 8;
  539. default:
  540. throw new Error(`mode:${mode}`);
  541. }
  542. }
  543. else if (type < 27) {
  544. switch (mode) {
  545. case QRMode.MODE_NUMBER:
  546. return 12;
  547. case QRMode.MODE_ALPHA_NUM:
  548. return 11;
  549. case QRMode.MODE_8BIT_BYTE:
  550. return 16;
  551. case QRMode.MODE_KANJI:
  552. return 10;
  553. default:
  554. throw new Error(`mode:${mode}`);
  555. }
  556. }
  557. else if (type < 41) {
  558. switch (mode) {
  559. case QRMode.MODE_NUMBER:
  560. return 14;
  561. case QRMode.MODE_ALPHA_NUM:
  562. return 13;
  563. case QRMode.MODE_8BIT_BYTE:
  564. return 16;
  565. case QRMode.MODE_KANJI:
  566. return 12;
  567. default:
  568. throw new Error(`mode:${mode}`);
  569. }
  570. }
  571. else {
  572. throw new Error(`type:${type}`);
  573. }
  574. }
  575. static getLostPoint(qrCode) {
  576. const moduleCount = qrCode.getModuleCount();
  577. let lostPoint = 0;
  578. for (var row = 0; row < moduleCount; row++) {
  579. for (var col = 0; col < moduleCount; col++) {
  580. let sameCount = 0;
  581. const dark = qrCode.isDark(row, col);
  582. for (let r = -1; r <= 1; r++) {
  583. if (row + r < 0 || moduleCount <= row + r) {
  584. continue;
  585. }
  586. for (let c = -1; c <= 1; c++) {
  587. if (col + c < 0 || moduleCount <= col + c) {
  588. continue;
  589. }
  590. if (r == 0 && c == 0) {
  591. continue;
  592. }
  593. if (dark == qrCode.isDark(row + r, col + c)) {
  594. sameCount++;
  595. }
  596. }
  597. }
  598. if (sameCount > 5) {
  599. lostPoint += 3 + sameCount - 5;
  600. }
  601. }
  602. }
  603. for (var row = 0; row < moduleCount - 1; row++) {
  604. for (var col = 0; col < moduleCount - 1; col++) {
  605. let count = 0;
  606. if (qrCode.isDark(row, col))
  607. count++;
  608. if (qrCode.isDark(row + 1, col))
  609. count++;
  610. if (qrCode.isDark(row, col + 1))
  611. count++;
  612. if (qrCode.isDark(row + 1, col + 1))
  613. count++;
  614. if (count == 0 || count == 4) {
  615. lostPoint += 3;
  616. }
  617. }
  618. }
  619. for (var row = 0; row < moduleCount; row++) {
  620. for (var col = 0; col < moduleCount - 6; col++) {
  621. if (qrCode.isDark(row, col) &&
  622. !qrCode.isDark(row, col + 1) &&
  623. qrCode.isDark(row, col + 2) &&
  624. qrCode.isDark(row, col + 3) &&
  625. qrCode.isDark(row, col + 4) &&
  626. !qrCode.isDark(row, col + 5) &&
  627. qrCode.isDark(row, col + 6)) {
  628. lostPoint += 40;
  629. }
  630. }
  631. }
  632. for (var col = 0; col < moduleCount; col++) {
  633. for (var row = 0; row < moduleCount - 6; row++) {
  634. if (qrCode.isDark(row, col) &&
  635. !qrCode.isDark(row + 1, col) &&
  636. qrCode.isDark(row + 2, col) &&
  637. qrCode.isDark(row + 3, col) &&
  638. qrCode.isDark(row + 4, col) &&
  639. !qrCode.isDark(row + 5, col) &&
  640. qrCode.isDark(row + 6, col)) {
  641. lostPoint += 40;
  642. }
  643. }
  644. }
  645. let darkCount = 0;
  646. for (var col = 0; col < moduleCount; col++) {
  647. for (var row = 0; row < moduleCount; row++) {
  648. if (qrCode.isDark(row, col)) {
  649. darkCount++;
  650. }
  651. }
  652. }
  653. const ratio = Math.abs((100 * darkCount) / moduleCount / moduleCount - 50) / 5;
  654. lostPoint += ratio * 10;
  655. return lostPoint;
  656. }
  657. }
  658. export class QRMath {
  659. static glog(n) {
  660. if (n < 1) {
  661. throw new Error(`glog(${n})`);
  662. }
  663. return QRMath.LOG_TABLE[n];
  664. }
  665. static gexp(n) {
  666. while (n < 0) {
  667. n += 255;
  668. }
  669. while (n >= 256) {
  670. n -= 255;
  671. }
  672. return QRMath.EXP_TABLE[n];
  673. }
  674. static EXP_TABLE = new Array(256);
  675. static LOG_TABLE = new Array(256);
  676. static _constructor = (function () {
  677. for (var i = 0; i < 8; i++) {
  678. QRMath.EXP_TABLE[i] = 1 << i;
  679. }
  680. for (var i = 8; i < 256; i++) {
  681. QRMath.EXP_TABLE[i] =
  682. QRMath.EXP_TABLE[i - 4] ^ QRMath.EXP_TABLE[i - 5] ^ QRMath.EXP_TABLE[i - 6] ^ QRMath.EXP_TABLE[i - 8];
  683. }
  684. for (var i = 0; i < 255; i++) {
  685. QRMath.LOG_TABLE[QRMath.EXP_TABLE[i]] = i;
  686. }
  687. })();
  688. }
  689. class QRPolynomial {
  690. num;
  691. constructor(num, shift) {
  692. if (num.length == undefined) {
  693. throw new Error(`${num.length}/${shift}`);
  694. }
  695. let offset = 0;
  696. while (offset < num.length && num[offset] == 0) {
  697. offset++;
  698. }
  699. this.num = new Array(num.length - offset + shift);
  700. for (let i = 0; i < num.length - offset; i++) {
  701. this.num[i] = num[i + offset];
  702. }
  703. }
  704. get(index) {
  705. return this.num[index];
  706. }
  707. getLength() {
  708. return this.num.length;
  709. }
  710. multiply(e) {
  711. const num = new Array(this.getLength() + e.getLength() - 1);
  712. for (let i = 0; i < this.getLength(); i++) {
  713. for (let j = 0; j < e.getLength(); j++) {
  714. num[i + j] ^= QRMath.gexp(QRMath.glog(this.get(i)) + QRMath.glog(e.get(j)));
  715. }
  716. }
  717. return new QRPolynomial(num, 0);
  718. }
  719. mod(e) {
  720. if (this.getLength() - e.getLength() < 0) {
  721. return this;
  722. }
  723. const ratio = QRMath.glog(this.get(0)) - QRMath.glog(e.get(0));
  724. const num = new Array(this.getLength());
  725. for (var i = 0; i < this.getLength(); i++) {
  726. num[i] = this.get(i);
  727. }
  728. for (var i = 0; i < e.getLength(); i++) {
  729. num[i] ^= QRMath.gexp(QRMath.glog(e.get(i)) + ratio);
  730. }
  731. return new QRPolynomial(num, 0).mod(e);
  732. }
  733. }
  734. class QRRSBlock {
  735. totalCount;
  736. dataCount;
  737. constructor(totalCount, dataCount) {
  738. this.totalCount = totalCount;
  739. this.dataCount = dataCount;
  740. }
  741. static RS_BLOCK_TABLE = [
  742. [1, 26, 19],
  743. [1, 26, 16],
  744. [1, 26, 13],
  745. [1, 26, 9],
  746. [1, 44, 34],
  747. [1, 44, 28],
  748. [1, 44, 22],
  749. [1, 44, 16],
  750. [1, 70, 55],
  751. [1, 70, 44],
  752. [2, 35, 17],
  753. [2, 35, 13],
  754. [1, 100, 80],
  755. [2, 50, 32],
  756. [2, 50, 24],
  757. [4, 25, 9],
  758. [1, 134, 108],
  759. [2, 67, 43],
  760. [2, 33, 15, 2, 34, 16],
  761. [2, 33, 11, 2, 34, 12],
  762. [2, 86, 68],
  763. [4, 43, 27],
  764. [4, 43, 19],
  765. [4, 43, 15],
  766. [2, 98, 78],
  767. [4, 49, 31],
  768. [2, 32, 14, 4, 33, 15],
  769. [4, 39, 13, 1, 40, 14],
  770. [2, 121, 97],
  771. [2, 60, 38, 2, 61, 39],
  772. [4, 40, 18, 2, 41, 19],
  773. [4, 40, 14, 2, 41, 15],
  774. [2, 146, 116],
  775. [3, 58, 36, 2, 59, 37],
  776. [4, 36, 16, 4, 37, 17],
  777. [4, 36, 12, 4, 37, 13],
  778. [2, 86, 68, 2, 87, 69],
  779. [4, 69, 43, 1, 70, 44],
  780. [6, 43, 19, 2, 44, 20],
  781. [6, 43, 15, 2, 44, 16],
  782. [4, 101, 81],
  783. [1, 80, 50, 4, 81, 51],
  784. [4, 50, 22, 4, 51, 23],
  785. [3, 36, 12, 8, 37, 13],
  786. [2, 116, 92, 2, 117, 93],
  787. [6, 58, 36, 2, 59, 37],
  788. [4, 46, 20, 6, 47, 21],
  789. [7, 42, 14, 4, 43, 15],
  790. [4, 133, 107],
  791. [8, 59, 37, 1, 60, 38],
  792. [8, 44, 20, 4, 45, 21],
  793. [12, 33, 11, 4, 34, 12],
  794. [3, 145, 115, 1, 146, 116],
  795. [4, 64, 40, 5, 65, 41],
  796. [11, 36, 16, 5, 37, 17],
  797. [11, 36, 12, 5, 37, 13],
  798. [5, 109, 87, 1, 110, 88],
  799. [5, 65, 41, 5, 66, 42],
  800. [5, 54, 24, 7, 55, 25],
  801. [11, 36, 12],
  802. [5, 122, 98, 1, 123, 99],
  803. [7, 73, 45, 3, 74, 46],
  804. [15, 43, 19, 2, 44, 20],
  805. [3, 45, 15, 13, 46, 16],
  806. [1, 135, 107, 5, 136, 108],
  807. [10, 74, 46, 1, 75, 47],
  808. [1, 50, 22, 15, 51, 23],
  809. [2, 42, 14, 17, 43, 15],
  810. [5, 150, 120, 1, 151, 121],
  811. [9, 69, 43, 4, 70, 44],
  812. [17, 50, 22, 1, 51, 23],
  813. [2, 42, 14, 19, 43, 15],
  814. [3, 141, 113, 4, 142, 114],
  815. [3, 70, 44, 11, 71, 45],
  816. [17, 47, 21, 4, 48, 22],
  817. [9, 39, 13, 16, 40, 14],
  818. [3, 135, 107, 5, 136, 108],
  819. [3, 67, 41, 13, 68, 42],
  820. [15, 54, 24, 5, 55, 25],
  821. [15, 43, 15, 10, 44, 16],
  822. [4, 144, 116, 4, 145, 117],
  823. [17, 68, 42],
  824. [17, 50, 22, 6, 51, 23],
  825. [19, 46, 16, 6, 47, 17],
  826. [2, 139, 111, 7, 140, 112],
  827. [17, 74, 46],
  828. [7, 54, 24, 16, 55, 25],
  829. [34, 37, 13],
  830. [4, 151, 121, 5, 152, 122],
  831. [4, 75, 47, 14, 76, 48],
  832. [11, 54, 24, 14, 55, 25],
  833. [16, 45, 15, 14, 46, 16],
  834. [6, 147, 117, 4, 148, 118],
  835. [6, 73, 45, 14, 74, 46],
  836. [11, 54, 24, 16, 55, 25],
  837. [30, 46, 16, 2, 47, 17],
  838. [8, 132, 106, 4, 133, 107],
  839. [8, 75, 47, 13, 76, 48],
  840. [7, 54, 24, 22, 55, 25],
  841. [22, 45, 15, 13, 46, 16],
  842. [10, 142, 114, 2, 143, 115],
  843. [19, 74, 46, 4, 75, 47],
  844. [28, 50, 22, 6, 51, 23],
  845. [33, 46, 16, 4, 47, 17],
  846. [8, 152, 122, 4, 153, 123],
  847. [22, 73, 45, 3, 74, 46],
  848. [8, 53, 23, 26, 54, 24],
  849. [12, 45, 15, 28, 46, 16],
  850. [3, 147, 117, 10, 148, 118],
  851. [3, 73, 45, 23, 74, 46],
  852. [4, 54, 24, 31, 55, 25],
  853. [11, 45, 15, 31, 46, 16],
  854. [7, 146, 116, 7, 147, 117],
  855. [21, 73, 45, 7, 74, 46],
  856. [1, 53, 23, 37, 54, 24],
  857. [19, 45, 15, 26, 46, 16],
  858. [5, 145, 115, 10, 146, 116],
  859. [19, 75, 47, 10, 76, 48],
  860. [15, 54, 24, 25, 55, 25],
  861. [23, 45, 15, 25, 46, 16],
  862. [13, 145, 115, 3, 146, 116],
  863. [2, 74, 46, 29, 75, 47],
  864. [42, 54, 24, 1, 55, 25],
  865. [23, 45, 15, 28, 46, 16],
  866. [17, 145, 115],
  867. [10, 74, 46, 23, 75, 47],
  868. [10, 54, 24, 35, 55, 25],
  869. [19, 45, 15, 35, 46, 16],
  870. [17, 145, 115, 1, 146, 116],
  871. [14, 74, 46, 21, 75, 47],
  872. [29, 54, 24, 19, 55, 25],
  873. [11, 45, 15, 46, 46, 16],
  874. [13, 145, 115, 6, 146, 116],
  875. [14, 74, 46, 23, 75, 47],
  876. [44, 54, 24, 7, 55, 25],
  877. [59, 46, 16, 1, 47, 17],
  878. [12, 151, 121, 7, 152, 122],
  879. [12, 75, 47, 26, 76, 48],
  880. [39, 54, 24, 14, 55, 25],
  881. [22, 45, 15, 41, 46, 16],
  882. [6, 151, 121, 14, 152, 122],
  883. [6, 75, 47, 34, 76, 48],
  884. [46, 54, 24, 10, 55, 25],
  885. [2, 45, 15, 64, 46, 16],
  886. [17, 152, 122, 4, 153, 123],
  887. [29, 74, 46, 14, 75, 47],
  888. [49, 54, 24, 10, 55, 25],
  889. [24, 45, 15, 46, 46, 16],
  890. [4, 152, 122, 18, 153, 123],
  891. [13, 74, 46, 32, 75, 47],
  892. [48, 54, 24, 14, 55, 25],
  893. [42, 45, 15, 32, 46, 16],
  894. [20, 147, 117, 4, 148, 118],
  895. [40, 75, 47, 7, 76, 48],
  896. [43, 54, 24, 22, 55, 25],
  897. [10, 45, 15, 67, 46, 16],
  898. [19, 148, 118, 6, 149, 119],
  899. [18, 75, 47, 31, 76, 48],
  900. [34, 54, 24, 34, 55, 25],
  901. [20, 45, 15, 61, 46, 16],
  902. ];
  903. static getRSBlocks(typeNumber, errorCorrectLevel) {
  904. const rsBlock = QRRSBlock.getRsBlockTable(typeNumber, errorCorrectLevel);
  905. if (rsBlock == undefined) {
  906. throw new Error(`bad rs block @ typeNumber:${typeNumber}/errorCorrectLevel:${errorCorrectLevel}`);
  907. }
  908. const length = rsBlock.length / 3;
  909. const list = [];
  910. for (let i = 0; i < length; i++) {
  911. const count = rsBlock[i * 3 + 0];
  912. const totalCount = rsBlock[i * 3 + 1];
  913. const dataCount = rsBlock[i * 3 + 2];
  914. for (let j = 0; j < count; j++) {
  915. list.push(new QRRSBlock(totalCount, dataCount));
  916. }
  917. }
  918. return list;
  919. }
  920. static getRsBlockTable(typeNumber, errorCorrectLevel) {
  921. switch (errorCorrectLevel) {
  922. case QRErrorCorrectLevel.L:
  923. return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 0];
  924. case QRErrorCorrectLevel.M:
  925. return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 1];
  926. case QRErrorCorrectLevel.Q:
  927. return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 2];
  928. case QRErrorCorrectLevel.H:
  929. return QRRSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 3];
  930. default:
  931. return undefined;
  932. }
  933. }
  934. }
  935. class QRBitBuffer {
  936. buffer;
  937. length;
  938. constructor() {
  939. this.buffer = [];
  940. this.length = 0;
  941. }
  942. get(index) {
  943. const bufIndex = Math.floor(index / 8);
  944. return ((this.buffer[bufIndex] >>> (7 - (index % 8))) & 1) == 1;
  945. }
  946. put(num, length) {
  947. for (let i = 0; i < length; i++) {
  948. this.putBit(((num >>> (length - i - 1)) & 1) == 1);
  949. }
  950. }
  951. getLengthInBits() {
  952. return this.length;
  953. }
  954. putBit(bit) {
  955. const bufIndex = Math.floor(this.length / 8);
  956. if (this.buffer.length <= bufIndex) {
  957. this.buffer.push(0);
  958. }
  959. if (bit) {
  960. this.buffer[bufIndex] |= 0x80 >>> this.length % 8;
  961. }
  962. this.length++;
  963. }
  964. }
  965. const QRCodeLimitLength = [
  966. [17, 14, 11, 7],
  967. [32, 26, 20, 14],
  968. [53, 42, 32, 24],
  969. [78, 62, 46, 34],
  970. [106, 84, 60, 44],
  971. [134, 106, 74, 58],
  972. [154, 122, 86, 64],
  973. [192, 152, 108, 84],
  974. [230, 180, 130, 98],
  975. [271, 213, 151, 119],
  976. [321, 251, 177, 137],
  977. [367, 287, 203, 155],
  978. [425, 331, 241, 177],
  979. [458, 362, 258, 194],
  980. [520, 412, 292, 220],
  981. [586, 450, 322, 250],
  982. [644, 504, 364, 280],
  983. [718, 560, 394, 310],
  984. [792, 624, 442, 338],
  985. [858, 666, 482, 382],
  986. [929, 711, 509, 403],
  987. [1003, 779, 565, 439],
  988. [1091, 857, 611, 461],
  989. [1171, 911, 661, 511],
  990. [1273, 997, 715, 535],
  991. [1367, 1059, 751, 593],
  992. [1465, 1125, 805, 625],
  993. [1528, 1190, 868, 658],
  994. [1628, 1264, 908, 698],
  995. [1732, 1370, 982, 742],
  996. [1840, 1452, 1030, 790],
  997. [1952, 1538, 1112, 842],
  998. [2068, 1628, 1168, 898],
  999. [2188, 1722, 1228, 958],
  1000. [2303, 1809, 1283, 983],
  1001. [2431, 1911, 1351, 1051],
  1002. [2563, 1989, 1423, 1093],
  1003. [2699, 2099, 1499, 1139],
  1004. [2809, 2213, 1579, 1219],
  1005. [2953, 2331, 1663, 1273],
  1006. ];