diff --git a/README.md b/README.md
index 06a76ed..663afbe 100644
--- a/README.md
+++ b/README.md
@@ -1,4 +1,4 @@
-# qrcode-decode
+# qr-decode
解密/识别 QRCode码
说明: 主要的二维码识别代码整理自 [jsqrcode](https://github.com/LazarSoft/jsqrcode);
@@ -17,16 +17,16 @@
## install
```
-npm i qrcode-decode
+npm i qr-decode
```
## import
```js
-var qrDecode = require('qrcode-decode');
+var qrDecode = require('qr-decode');
//web
-var qr_web = require('qrcode-decode/browser')
+var qr_web = require('qr-decode/browser')
//node
-var qr_node = require('qrcode-decode/server')
+var qr_node = require('qr-decode/server')
var text = qrDecode(dataImage);
```
@@ -36,16 +36,16 @@ var text = qrDecode(dataImage);
### web
> web端最终是利用`Canvas`获取`ImageData`, 注意兼容及跨域问题
```js
-var qrcodeDecode = require('qrcode-decode/browser');
+var qrDecode = require('qr-decode/browser');
// 传入二维码图片URL/dataURL
-qrcodeDecode.decodeByUrl(src, function (err, txt) {
+qrDecode.decodeByUrl(src, function (err, txt) {
if (err) { return console.log(err);}
alert(txt);
})
// 传入DOM可以画到canvas的dom都可以 `img` `canvas` 'video' 等
var img = document.getElementById('img1');
-qrcodeDecode.decodeByDom(img, function (err, txt) {
+qrDecode.decodeByDom(img, function (err, txt) {
if (err) { return console.log(err);}
alert(txt);
})
@@ -55,15 +55,15 @@ qrcodeDecode.decodeByDom(img, function (err, txt) {
> 注意: 服务器端API是以 `promise` 返回结果, 你注意你的`node`版本;
```js
//解析文件
-var qrcodeDecode = require('qrcode-decode/server');
-qrcodeDecode.decodeByPath('xx/code.jpg').then(function(val){
+var qrDecode = require('qr-decode/server');
+qrDecode.decodeByPath('xx/code.jpg').then(function(val){
console.log(val);
},console.error.bind(console))
//解析Buffer
fs.readFile(path, function (err, buffer) {
if (err) { return rej(err) }
- resqrcodeDecode.decodeByBuffer(buffer);
+ qrDecode.decodeByBuffer(buffer);
})
```
diff --git a/browser.js b/browser.js
index bd4a4bc..5e55caa 100644
--- a/browser.js
+++ b/browser.js
@@ -1,5 +1,5 @@
-var qrDecode = require('./src/QRCodeDecode');
+var qrDecode = require('./src/QRDecode');
var decodeByDom = function (dom) {
var canvas = document.createElement("canvas")
var ctx = canvas.getContext('2d')
diff --git a/dist/index.html b/dist/index.html
new file mode 100644
index 0000000..5e5386c
--- /dev/null
+++ b/dist/index.html
@@ -0,0 +1,14 @@
+
+
+
+
+
+
+ qrcode-decode
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/dist/qr-decode.js b/dist/qr-decode.js
new file mode 100644
index 0000000..c1325b6
--- /dev/null
+++ b/dist/qr-decode.js
@@ -0,0 +1,3041 @@
+/*!
+ * qr-decode v0.0.1
+ * (c) 2018-present cnwhy
+ * Released under the ISC License.
+ */
+(function (global, factory) {
+ typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+ typeof define === 'function' && define.amd ? define(['exports'], factory) :
+ (factory((global.qrDecode = {})));
+}(this, (function (exports) { 'use strict';
+
+ function AlignmentPattern(posX, posY, estimatedModuleSize) {
+ this.x = posX;
+ this.y = posY;
+ this.count = 1;
+ this.estimatedModuleSize = estimatedModuleSize;
+
+ this.__defineGetter__("EstimatedModuleSize", function () {
+ return this.estimatedModuleSize;
+ });
+
+ this.__defineGetter__("Count", function () {
+ return this.count;
+ });
+
+ this.__defineGetter__("X", function () {
+ return Math.floor(this.x);
+ });
+
+ this.__defineGetter__("Y", function () {
+ return Math.floor(this.y);
+ });
+
+ this.incrementCount = function () {
+ this.count++;
+ };
+
+ this.aboutEquals = function (moduleSize, i, j) {
+ if (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize) {
+ var moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);
+ return moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;
+ }
+
+ return false;
+ };
+ }
+
+ function AlignmentPatternFinder(image, base, startX, startY, width, height, moduleSize, resultPointCallback) {
+ this.image = image;
+ this.possibleCenters = new Array();
+ this.startX = startX;
+ this.startY = startY;
+ this.width = width;
+ this.height = height;
+ this.moduleSize = moduleSize;
+ this.crossCheckStateCount = new Array(0, 0, 0);
+ this.resultPointCallback = resultPointCallback;
+
+ this.centerFromEnd = function (stateCount, end) {
+ return end - stateCount[2] - stateCount[1] / 2.0;
+ };
+
+ this.foundPatternCross = function (stateCount) {
+ var moduleSize = this.moduleSize;
+ var maxVariance = moduleSize / 2.0;
+
+ for (var i = 0; i < 3; i++) {
+ if (Math.abs(moduleSize - stateCount[i]) >= maxVariance) {
+ return false;
+ }
+ }
+
+ return true;
+ };
+
+ this.crossCheckVertical = function (startI, centerJ, maxCount, originalStateCountTotal) {
+ var image = this.image;
+ var maxI = base.height;
+ var stateCount = this.crossCheckStateCount;
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0; // Start counting up from center
+
+ var i = startI;
+
+ while (i >= 0 && image[centerJ + i * base.width] && stateCount[1] <= maxCount) {
+ stateCount[1]++;
+ i--;
+ } // If already too many modules in this state or ran off the edge:
+
+
+ if (i < 0 || stateCount[1] > maxCount) {
+ return NaN;
+ }
+
+ while (i >= 0 && !image[centerJ + i * base.width] && stateCount[0] <= maxCount) {
+ stateCount[0]++;
+ i--;
+ }
+
+ if (stateCount[0] > maxCount) {
+ return NaN;
+ } // Now also count down from center
+
+
+ i = startI + 1;
+
+ while (i < maxI && image[centerJ + i * base.width] && stateCount[1] <= maxCount) {
+ stateCount[1]++;
+ i++;
+ }
+
+ if (i == maxI || stateCount[1] > maxCount) {
+ return NaN;
+ }
+
+ while (i < maxI && !image[centerJ + i * base.width] && stateCount[2] <= maxCount) {
+ stateCount[2]++;
+ i++;
+ }
+
+ if (stateCount[2] > maxCount) {
+ return NaN;
+ }
+
+ var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+
+ if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+ return NaN;
+ }
+
+ return this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, i) : NaN;
+ };
+
+ this.handlePossibleCenter = function (stateCount, i, j) {
+ var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+ var centerJ = this.centerFromEnd(stateCount, j);
+ var centerI = this.crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal);
+
+ if (!isNaN(centerI)) {
+ var estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3.0;
+ var max = this.possibleCenters.length;
+
+ for (var index = 0; index < max; index++) {
+ var center = this.possibleCenters[index]; // Look for about the same center and module size:
+
+ if (center.aboutEquals(estimatedModuleSize, centerI, centerJ)) {
+ return new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+ }
+ } // Hadn't found this before; save it
+
+
+ var point = new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+ this.possibleCenters.push(point);
+
+ if (this.resultPointCallback != null) {
+ this.resultPointCallback.foundPossibleResultPoint(point);
+ }
+ }
+
+ return null;
+ };
+
+ this.find = function () {
+ var startX = this.startX;
+ var height = this.height;
+ var maxJ = startX + width;
+ var middleI = startY + (height >> 1); // We are looking for black/white/black modules in 1:1:1 ratio;
+ // this tracks the number of black/white/black modules seen so far
+
+ var stateCount = new Array(0, 0, 0);
+
+ for (var iGen = 0; iGen < height; iGen++) {
+ // Search from middle outwards
+ var i = middleI + ((iGen & 0x01) == 0 ? iGen + 1 >> 1 : -(iGen + 1 >> 1));
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ var j = startX; // Burn off leading white pixels before anything else; if we start in the middle of
+ // a white run, it doesn't make sense to count its length, since we don't know if the
+ // white run continued to the left of the start point
+
+ while (j < maxJ && !image[j + base.width * i]) {
+ j++;
+ }
+
+ var currentState = 0;
+
+ while (j < maxJ) {
+ if (image[j + i * base.width]) {
+ // Black pixel
+ if (currentState == 1) {
+ // Counting black pixels
+ stateCount[currentState]++;
+ } else {
+ // Counting white pixels
+ if (currentState == 2) {
+ // A winner?
+ if (this.foundPatternCross(stateCount)) {
+ // Yes
+ var confirmed = this.handlePossibleCenter(stateCount, i, j);
+
+ if (confirmed != null) {
+ return confirmed;
+ }
+ }
+
+ stateCount[0] = stateCount[2];
+ stateCount[1] = 1;
+ stateCount[2] = 0;
+ currentState = 1;
+ } else {
+ stateCount[++currentState]++;
+ }
+ }
+ } else {
+ // White pixel
+ if (currentState == 1) {
+ // Counting black pixels
+ currentState++;
+ }
+
+ stateCount[currentState]++;
+ }
+
+ j++;
+ }
+
+ if (this.foundPatternCross(stateCount)) {
+ var confirmed = this.handlePossibleCenter(stateCount, i, maxJ);
+
+ if (confirmed != null) {
+ return confirmed;
+ }
+ }
+ } // Hmm, nothing we saw was observed and confirmed twice. If we had
+ // any guess at all, return it.
+
+
+ if (!(this.possibleCenters.length == 0)) {
+ return this.possibleCenters[0];
+ }
+
+ throw "Couldn't find enough alignment patterns";
+ };
+ }
+
+ var Alignment = AlignmentPatternFinder;
+
+ /*
+ Ported to JavaScript by Lazar Laszlo 2011
+
+ lazarsoft@gmail.com, www.lazarsoft.info
+
+ */
+ var MIN_SKIP = 3;
+ var MAX_MODULES = 57;
+ var INTEGER_MATH_SHIFT = 8;
+ var CENTER_QUORUM = 2;
+
+ var orderBestPatterns = function orderBestPatterns(patterns) {
+ function distance(pattern1, pattern2) {
+ var xDiff = pattern1.X - pattern2.X;
+ var yDiff = pattern1.Y - pattern2.Y;
+ return Math.sqrt(xDiff * xDiff + yDiff * yDiff);
+ } /// Returns the z component of the cross product between vectors BC and BA.
+
+
+ function crossProductZ(pointA, pointB, pointC) {
+ var bX = pointB.x;
+ var bY = pointB.y;
+ return (pointC.x - bX) * (pointA.y - bY) - (pointC.y - bY) * (pointA.x - bX);
+ } // Find distances between pattern centers
+
+
+ var zeroOneDistance = distance(patterns[0], patterns[1]);
+ var oneTwoDistance = distance(patterns[1], patterns[2]);
+ var zeroTwoDistance = distance(patterns[0], patterns[2]);
+ var pointA, pointB, pointC; // Assume one closest to other two is B; A and C will just be guesses at first
+
+ if (oneTwoDistance >= zeroOneDistance && oneTwoDistance >= zeroTwoDistance) {
+ pointB = patterns[0];
+ pointA = patterns[1];
+ pointC = patterns[2];
+ } else if (zeroTwoDistance >= oneTwoDistance && zeroTwoDistance >= zeroOneDistance) {
+ pointB = patterns[1];
+ pointA = patterns[0];
+ pointC = patterns[2];
+ } else {
+ pointB = patterns[2];
+ pointA = patterns[0];
+ pointC = patterns[1];
+ } // Use cross product to figure out whether A and C are correct or flipped.
+ // This asks whether BC x BA has a positive z component, which is the arrangement
+ // we want for A, B, C. If it's negative, then we've got it flipped around and
+ // should swap A and C.
+
+
+ if (crossProductZ(pointA, pointB, pointC) < 0.0) {
+ var temp = pointA;
+ pointA = pointC;
+ pointC = temp;
+ }
+
+ patterns[0] = pointA;
+ patterns[1] = pointB;
+ patterns[2] = pointC;
+ };
+
+ function FinderPattern(posX, posY, estimatedModuleSize) {
+ this.x = posX;
+ this.y = posY;
+ this.count = 1;
+ this.estimatedModuleSize = estimatedModuleSize;
+
+ this.__defineGetter__("EstimatedModuleSize", function () {
+ return this.estimatedModuleSize;
+ });
+
+ this.__defineGetter__("Count", function () {
+ return this.count;
+ });
+
+ this.__defineGetter__("X", function () {
+ return this.x;
+ });
+
+ this.__defineGetter__("Y", function () {
+ return this.y;
+ });
+
+ this.incrementCount = function () {
+ this.count++;
+ };
+
+ this.aboutEquals = function (moduleSize, i, j) {
+ if (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize) {
+ var moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);
+ return moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;
+ }
+
+ return false;
+ };
+ }
+
+ function FinderPatternInfo(patternCenters) {
+ this.bottomLeft = patternCenters[0];
+ this.topLeft = patternCenters[1];
+ this.topRight = patternCenters[2];
+
+ this.__defineGetter__("BottomLeft", function () {
+ return this.bottomLeft;
+ });
+
+ this.__defineGetter__("TopLeft", function () {
+ return this.topLeft;
+ });
+
+ this.__defineGetter__("TopRight", function () {
+ return this.topRight;
+ });
+ }
+
+ function FinderPatternFinder(base) {
+ this.image = null;
+ this.possibleCenters = [];
+ this.hasSkipped = false;
+ this.crossCheckStateCount = new Array(0, 0, 0, 0, 0);
+ this.resultPointCallback = null;
+
+ this.__defineGetter__("CrossCheckStateCount", function () {
+ this.crossCheckStateCount[0] = 0;
+ this.crossCheckStateCount[1] = 0;
+ this.crossCheckStateCount[2] = 0;
+ this.crossCheckStateCount[3] = 0;
+ this.crossCheckStateCount[4] = 0;
+ return this.crossCheckStateCount;
+ });
+
+ this.foundPatternCross = function (stateCount) {
+ var totalModuleSize = 0;
+
+ for (var i = 0; i < 5; i++) {
+ var count = stateCount[i];
+
+ if (count == 0) {
+ return false;
+ }
+
+ totalModuleSize += count;
+ }
+
+ if (totalModuleSize < 7) {
+ return false;
+ }
+
+ var moduleSize = Math.floor((totalModuleSize << INTEGER_MATH_SHIFT) / 7);
+ var maxVariance = Math.floor(moduleSize / 2); // Allow less than 50% variance from 1-1-3-1-1 proportions
+
+ return Math.abs(moduleSize - (stateCount[0] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[1] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(3 * moduleSize - (stateCount[2] << INTEGER_MATH_SHIFT)) < 3 * maxVariance && Math.abs(moduleSize - (stateCount[3] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[4] << INTEGER_MATH_SHIFT)) < maxVariance;
+ };
+
+ this.centerFromEnd = function (stateCount, end) {
+ return end - stateCount[4] - stateCount[3] - stateCount[2] / 2.0;
+ };
+
+ this.crossCheckVertical = function (startI, centerJ, maxCount, originalStateCountTotal) {
+ var image = this.image;
+ var maxI = base.height;
+ var stateCount = this.CrossCheckStateCount; // Start counting up from center
+
+ var i = startI;
+
+ while (i >= 0 && image[centerJ + i * base.width]) {
+ stateCount[2]++;
+ i--;
+ }
+
+ if (i < 0) {
+ return NaN;
+ }
+
+ while (i >= 0 && !image[centerJ + i * base.width] && stateCount[1] <= maxCount) {
+ stateCount[1]++;
+ i--;
+ } // If already too many modules in this state or ran off the edge:
+
+
+ if (i < 0 || stateCount[1] > maxCount) {
+ return NaN;
+ }
+
+ while (i >= 0 && image[centerJ + i * base.width] && stateCount[0] <= maxCount) {
+ stateCount[0]++;
+ i--;
+ }
+
+ if (stateCount[0] > maxCount) {
+ return NaN;
+ } // Now also count down from center
+
+
+ i = startI + 1;
+
+ while (i < maxI && image[centerJ + i * base.width]) {
+ stateCount[2]++;
+ i++;
+ }
+
+ if (i == maxI) {
+ return NaN;
+ }
+
+ while (i < maxI && !image[centerJ + i * base.width] && stateCount[3] < maxCount) {
+ stateCount[3]++;
+ i++;
+ }
+
+ if (i == maxI || stateCount[3] >= maxCount) {
+ return NaN;
+ }
+
+ while (i < maxI && image[centerJ + i * base.width] && stateCount[4] < maxCount) {
+ stateCount[4]++;
+ i++;
+ }
+
+ if (stateCount[4] >= maxCount) {
+ return NaN;
+ } // If we found a finder-pattern-like section, but its size is more than 40% different than
+ // the original, assume it's a false positive
+
+
+ var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+
+ if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+ return NaN;
+ }
+
+ return this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, i) : NaN;
+ };
+
+ this.crossCheckHorizontal = function (startJ, centerI, maxCount, originalStateCountTotal) {
+ var image = this.image;
+ var maxJ = base.width;
+ var stateCount = this.CrossCheckStateCount;
+ var j = startJ;
+
+ while (j >= 0 && image[j + centerI * base.width]) {
+ stateCount[2]++;
+ j--;
+ }
+
+ if (j < 0) {
+ return NaN;
+ }
+
+ while (j >= 0 && !image[j + centerI * base.width] && stateCount[1] <= maxCount) {
+ stateCount[1]++;
+ j--;
+ }
+
+ if (j < 0 || stateCount[1] > maxCount) {
+ return NaN;
+ }
+
+ while (j >= 0 && image[j + centerI * base.width] && stateCount[0] <= maxCount) {
+ stateCount[0]++;
+ j--;
+ }
+
+ if (stateCount[0] > maxCount) {
+ return NaN;
+ }
+
+ j = startJ + 1;
+
+ while (j < maxJ && image[j + centerI * base.width]) {
+ stateCount[2]++;
+ j++;
+ }
+
+ if (j == maxJ) {
+ return NaN;
+ }
+
+ while (j < maxJ && !image[j + centerI * base.width] && stateCount[3] < maxCount) {
+ stateCount[3]++;
+ j++;
+ }
+
+ if (j == maxJ || stateCount[3] >= maxCount) {
+ return NaN;
+ }
+
+ while (j < maxJ && image[j + centerI * base.width] && stateCount[4] < maxCount) {
+ stateCount[4]++;
+ j++;
+ }
+
+ if (stateCount[4] >= maxCount) {
+ return NaN;
+ } // If we found a finder-pattern-like section, but its size is significantly different than
+ // the original, assume it's a false positive
+
+
+ var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+
+ if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal) {
+ return NaN;
+ }
+
+ return this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, j) : NaN;
+ };
+
+ this.handlePossibleCenter = function (stateCount, i, j) {
+ var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+ var centerJ = this.centerFromEnd(stateCount, j); //float
+
+ var centerI = this.crossCheckVertical(i, Math.floor(centerJ), stateCount[2], stateCountTotal); //float
+
+ if (!isNaN(centerI)) {
+ // Re-cross check
+ centerJ = this.crossCheckHorizontal(Math.floor(centerJ), Math.floor(centerI), stateCount[2], stateCountTotal);
+
+ if (!isNaN(centerJ)) {
+ var estimatedModuleSize = stateCountTotal / 7.0;
+ var found = false;
+ var max = this.possibleCenters.length;
+
+ for (var index = 0; index < max; index++) {
+ var center = this.possibleCenters[index]; // Look for about the same center and module size:
+
+ if (center.aboutEquals(estimatedModuleSize, centerI, centerJ)) {
+ center.incrementCount();
+ found = true;
+ break;
+ }
+ }
+
+ if (!found) {
+ var point = new FinderPattern(centerJ, centerI, estimatedModuleSize);
+ this.possibleCenters.push(point);
+
+ if (this.resultPointCallback != null) {
+ this.resultPointCallback.foundPossibleResultPoint(point);
+ }
+ }
+
+ return true;
+ }
+ }
+
+ return false;
+ };
+
+ this.selectBestPatterns = function () {
+ var startSize = this.possibleCenters.length;
+
+ if (startSize < 3) {
+ // Couldn't find enough finder patterns
+ throw "Couldn't find enough finder patterns (found " + startSize + ")";
+ } // Filter outlier possibilities whose module size is too different
+
+
+ if (startSize > 3) {
+ // But we can only afford to do so if we have at least 4 possibilities to choose from
+ var totalModuleSize = 0.0;
+ var square = 0.0;
+
+ for (var i = 0; i < startSize; i++) {
+ //totalModuleSize += this.possibleCenters[i].EstimatedModuleSize;
+ var centerValue = this.possibleCenters[i].EstimatedModuleSize;
+ totalModuleSize += centerValue;
+ square += centerValue * centerValue;
+ }
+
+ var average = totalModuleSize / startSize;
+ this.possibleCenters.sort(function (center1, center2) {
+ var dA = Math.abs(center2.EstimatedModuleSize - average);
+ var dB = Math.abs(center1.EstimatedModuleSize - average);
+
+ if (dA < dB) {
+ return -1;
+ } else if (dA == dB) {
+ return 0;
+ } else {
+ return 1;
+ }
+ });
+ var stdDev = Math.sqrt(square / startSize - average * average);
+ var limit = Math.max(0.2 * average, stdDev); //for (var i = 0; i < this.possibleCenters.length && this.possibleCenters.length > 3; i++)
+
+ for (var i = this.possibleCenters.length - 1; i >= 0; i--) {
+ var pattern = this.possibleCenters[i]; //if (Math.abs(pattern.EstimatedModuleSize - average) > 0.2 * average)
+
+ if (Math.abs(pattern.EstimatedModuleSize - average) > limit) {
+ //this.possibleCenters.remove(i);
+ this.possibleCenters.splice(i, 1); //i--;
+ }
+ }
+ }
+
+ if (this.possibleCenters.length > 3) {
+ // Throw away all but those first size candidate points we found.
+ this.possibleCenters.sort(function (a, b) {
+ if (a.count > b.count) {
+ return -1;
+ }
+
+ if (a.count < b.count) {
+ return 1;
+ }
+
+ return 0;
+ });
+ }
+
+ return new Array(this.possibleCenters[0], this.possibleCenters[1], this.possibleCenters[2]);
+ };
+
+ this.findRowSkip = function () {
+ var max = this.possibleCenters.length;
+
+ if (max <= 1) {
+ return 0;
+ }
+
+ var firstConfirmedCenter = null;
+
+ for (var i = 0; i < max; i++) {
+ var center = this.possibleCenters[i];
+
+ if (center.Count >= CENTER_QUORUM) {
+ if (firstConfirmedCenter == null) {
+ firstConfirmedCenter = center;
+ } else {
+ // We have two confirmed centers
+ // How far down can we skip before resuming looking for the next
+ // pattern? In the worst case, only the difference between the
+ // difference in the x / y coordinates of the two centers.
+ // This is the case where you find top left last.
+ this.hasSkipped = true;
+ return Math.floor((Math.abs(firstConfirmedCenter.X - center.X) - Math.abs(firstConfirmedCenter.Y - center.Y)) / 2);
+ }
+ }
+ }
+
+ return 0;
+ };
+
+ this.haveMultiplyConfirmedCenters = function () {
+ var confirmedCount = 0;
+ var totalModuleSize = 0.0;
+ var max = this.possibleCenters.length;
+
+ for (var i = 0; i < max; i++) {
+ var pattern = this.possibleCenters[i];
+
+ if (pattern.Count >= CENTER_QUORUM) {
+ confirmedCount++;
+ totalModuleSize += pattern.EstimatedModuleSize;
+ }
+ }
+
+ if (confirmedCount < 3) {
+ return false;
+ } // OK, we have at least 3 confirmed centers, but, it's possible that one is a "false positive"
+ // and that we need to keep looking. We detect this by asking if the estimated module sizes
+ // vary too much. We arbitrarily say that when the total deviation from average exceeds
+ // 5% of the total module size estimates, it's too much.
+
+
+ var average = totalModuleSize / max;
+ var totalDeviation = 0.0;
+
+ for (var i = 0; i < max; i++) {
+ pattern = this.possibleCenters[i];
+ totalDeviation += Math.abs(pattern.EstimatedModuleSize - average);
+ }
+
+ return totalDeviation <= 0.05 * totalModuleSize;
+ };
+
+ this.findFinderPattern = function (image) {
+ var tryHarder = false;
+ this.image = image;
+ var maxI = base.height;
+ var maxJ = base.width;
+ var iSkip = Math.floor(3 * maxI / (4 * MAX_MODULES));
+
+ if (iSkip < MIN_SKIP || tryHarder) {
+ iSkip = MIN_SKIP;
+ }
+
+ var done = false;
+ var stateCount = new Array(5);
+
+ for (var i = iSkip - 1; i < maxI && !done; i += iSkip) {
+ // Get a row of black/white values
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ stateCount[3] = 0;
+ stateCount[4] = 0;
+ var currentState = 0;
+
+ for (var j = 0; j < maxJ; j++) {
+ if (image[j + i * base.width]) {
+ // Black pixel
+ if ((currentState & 1) == 1) {
+ // Counting white pixels
+ currentState++;
+ }
+
+ stateCount[currentState]++;
+ } else {
+ // White pixel
+ if ((currentState & 1) == 0) {
+ // Counting black pixels
+ if (currentState == 4) {
+ // A winner?
+ if (this.foundPatternCross(stateCount)) {
+ // Yes
+ var confirmed = this.handlePossibleCenter(stateCount, i, j);
+
+ if (confirmed) {
+ // Start examining every other line. Checking each line turned out to be too
+ // expensive and didn't improve performance.
+ iSkip = 2;
+
+ if (this.hasSkipped) {
+ done = this.haveMultiplyConfirmedCenters();
+ } else {
+ var rowSkip = this.findRowSkip();
+
+ if (rowSkip > stateCount[2]) {
+ // Skip rows between row of lower confirmed center
+ // and top of presumed third confirmed center
+ // but back up a bit to get a full chance of detecting
+ // it, entire width of center of finder pattern
+ // Skip by rowSkip, but back off by stateCount[2] (size of last center
+ // of pattern we saw) to be conservative, and also back off by iSkip which
+ // is about to be re-added
+ i += rowSkip - stateCount[2] - iSkip;
+ j = maxJ - 1;
+ }
+ }
+ } else {
+ // Advance to next black pixel
+ do {
+ j++;
+ } while (j < maxJ && !image[j + i * base.width]);
+
+ j--; // back up to that last white pixel
+ } // Clear state to start looking again
+
+
+ currentState = 0;
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ stateCount[3] = 0;
+ stateCount[4] = 0;
+ } else {
+ // No, shift counts back by two
+ stateCount[0] = stateCount[2];
+ stateCount[1] = stateCount[3];
+ stateCount[2] = stateCount[4];
+ stateCount[3] = 1;
+ stateCount[4] = 0;
+ currentState = 3;
+ }
+ } else {
+ stateCount[++currentState]++;
+ }
+ } else {
+ // Counting white pixels
+ stateCount[currentState]++;
+ }
+ }
+ }
+
+ if (this.foundPatternCross(stateCount)) {
+ var confirmed = this.handlePossibleCenter(stateCount, i, maxJ);
+
+ if (confirmed) {
+ iSkip = stateCount[0];
+
+ if (this.hasSkipped) {
+ // Found a third one
+ done = this.haveMultiplyConfirmedCenters();
+ }
+ }
+ }
+ }
+
+ var patternInfo = this.selectBestPatterns();
+ orderBestPatterns(patternInfo);
+ return new FinderPatternInfo(patternInfo);
+ };
+ }
+
+ var Findpat = FinderPatternFinder;
+
+ var URShift = function URShift(number, bits) {
+ if (number >= 0) return number >> bits;else return (number >> bits) + (2 << ~bits);
+ };
+
+ var utils = {
+ URShift: URShift
+ };
+
+ function ErrorCorrectionLevel(ordinal, bits, name) {
+ this.ordinal_Renamed_Field = ordinal;
+ this.bits = bits;
+ this.name = name;
+
+ this.__defineGetter__("Bits", function () {
+ return this.bits;
+ });
+
+ this.__defineGetter__("Name", function () {
+ return this.name;
+ });
+
+ this.ordinal = function () {
+ return this.ordinal_Renamed_Field;
+ };
+ }
+
+ var L = new ErrorCorrectionLevel(0, 0x01, "L");
+ var M = new ErrorCorrectionLevel(1, 0x00, "M");
+ var Q = new ErrorCorrectionLevel(2, 0x03, "Q");
+ var H = new ErrorCorrectionLevel(3, 0x02, "H");
+ var FOR_BITS = new Array(M, L, H, Q);
+
+ var ErrorLevel = function (bits) {
+ if (bits < 0 || bits >= FOR_BITS.length) {
+ throw "ArgumentException";
+ }
+
+ return FOR_BITS[bits];
+ };
+
+ var URShift$1 = utils.URShift;
+ var FORMAT_INFO_MASK_QR = 0x5412;
+ var FORMAT_INFO_DECODE_LOOKUP = new Array(new Array(0x5412, 0x00), new Array(0x5125, 0x01), new Array(0x5E7C, 0x02), new Array(0x5B4B, 0x03), new Array(0x45F9, 0x04), new Array(0x40CE, 0x05), new Array(0x4F97, 0x06), new Array(0x4AA0, 0x07), new Array(0x77C4, 0x08), new Array(0x72F3, 0x09), new Array(0x7DAA, 0x0A), new Array(0x789D, 0x0B), new Array(0x662F, 0x0C), new Array(0x6318, 0x0D), new Array(0x6C41, 0x0E), new Array(0x6976, 0x0F), new Array(0x1689, 0x10), new Array(0x13BE, 0x11), new Array(0x1CE7, 0x12), new Array(0x19D0, 0x13), new Array(0x0762, 0x14), new Array(0x0255, 0x15), new Array(0x0D0C, 0x16), new Array(0x083B, 0x17), new Array(0x355F, 0x18), new Array(0x3068, 0x19), new Array(0x3F31, 0x1A), new Array(0x3A06, 0x1B), new Array(0x24B4, 0x1C), new Array(0x2183, 0x1D), new Array(0x2EDA, 0x1E), new Array(0x2BED, 0x1F));
+ var BITS_SET_IN_HALF_BYTE = new Array(0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4);
+
+ function FormatInformation(formatInfo) {
+ this.errorCorrectionLevel = ErrorLevel(formatInfo >> 3 & 0x03);
+ this.dataMask = formatInfo & 0x07;
+
+ this.__defineGetter__("ErrorCorrectionLevel", function () {
+ return this.errorCorrectionLevel;
+ });
+
+ this.__defineGetter__("DataMask", function () {
+ return this.dataMask;
+ });
+
+ this.GetHashCode = function () {
+ return this.errorCorrectionLevel.ordinal() << 3 | this.dataMask;
+ };
+
+ this.Equals = function (o) {
+ var other = o;
+ return this.errorCorrectionLevel == other.errorCorrectionLevel && this.dataMask == other.dataMask;
+ };
+ }
+
+ FormatInformation.numBitsDiffering = function (a, b) {
+ a ^= b; // a now has a 1 bit exactly where its bit differs with b's
+ // Count bits set quickly with a series of lookups:
+
+ return BITS_SET_IN_HALF_BYTE[a & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 4) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 8) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 12) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 16) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 20) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 24) & 0x0F] + BITS_SET_IN_HALF_BYTE[URShift$1(a, 28) & 0x0F];
+ };
+
+ FormatInformation.decodeFormatInformation = function (maskedFormatInfo) {
+ var formatInfo = FormatInformation.doDecodeFormatInformation(maskedFormatInfo);
+
+ if (formatInfo != null) {
+ return formatInfo;
+ } // Should return null, but, some QR codes apparently
+ // do not mask this info. Try again by actually masking the pattern
+ // first
+
+
+ return FormatInformation.doDecodeFormatInformation(maskedFormatInfo ^ FORMAT_INFO_MASK_QR);
+ };
+
+ FormatInformation.doDecodeFormatInformation = function (maskedFormatInfo) {
+ // Find the int in FORMAT_INFO_DECODE_LOOKUP with fewest bits differing
+ var bestDifference = 0xffffffff;
+ var bestFormatInfo = 0;
+
+ for (var i = 0; i < FORMAT_INFO_DECODE_LOOKUP.length; i++) {
+ var decodeInfo = FORMAT_INFO_DECODE_LOOKUP[i];
+ var targetInfo = decodeInfo[0];
+
+ if (targetInfo == maskedFormatInfo) {
+ // Found an exact match
+ return new FormatInformation(decodeInfo[1]);
+ }
+
+ var bitsDifference = this.numBitsDiffering(maskedFormatInfo, targetInfo);
+
+ if (bitsDifference < bestDifference) {
+ bestFormatInfo = decodeInfo[1];
+ bestDifference = bitsDifference;
+ }
+ } // Hamming distance of the 32 masked codes is 7, by construction, so <= 3 bits
+ // differing means we found a match
+
+
+ if (bestDifference <= 3) {
+ return new FormatInformation(bestFormatInfo);
+ }
+
+ return null;
+ };
+
+ var FormatInformation_1 = FormatInformation;
+
+ var URShift$2 = utils.URShift;
+
+ function BitMatrix(width, height) {
+ if (!height) height = width;
+
+ if (width < 1 || height < 1) {
+ throw "Both dimensions must be greater than 0";
+ }
+
+ this.width = width;
+ this.height = height;
+ var rowSize = width >> 5;
+
+ if ((width & 0x1f) != 0) {
+ rowSize++;
+ }
+
+ this.rowSize = rowSize;
+ this.bits = new Array(rowSize * height);
+
+ for (var i = 0; i < this.bits.length; i++) {
+ this.bits[i] = 0;
+ }
+
+ this.__defineGetter__("Width", function () {
+ return this.width;
+ });
+
+ this.__defineGetter__("Height", function () {
+ return this.height;
+ });
+
+ this.__defineGetter__("Dimension", function () {
+ if (this.width != this.height) {
+ throw "Can't call getDimension() on a non-square matrix";
+ }
+
+ return this.width;
+ });
+
+ this.get_Renamed = function (x, y) {
+ var offset = y * this.rowSize + (x >> 5);
+ return (URShift$2(this.bits[offset], x & 0x1f) & 1) != 0;
+ };
+
+ this.set_Renamed = function (x, y) {
+ var offset = y * this.rowSize + (x >> 5);
+ this.bits[offset] |= 1 << (x & 0x1f);
+ };
+
+ this.flip = function (x, y) {
+ var offset = y * this.rowSize + (x >> 5);
+ this.bits[offset] ^= 1 << (x & 0x1f);
+ };
+
+ this.clear = function () {
+ var max = this.bits.length;
+
+ for (var i = 0; i < max; i++) {
+ this.bits[i] = 0;
+ }
+ };
+
+ this.setRegion = function (left, top, width, height) {
+ if (top < 0 || left < 0) {
+ throw "Left and top must be nonnegative";
+ }
+
+ if (height < 1 || width < 1) {
+ throw "Height and width must be at least 1";
+ }
+
+ var right = left + width;
+ var bottom = top + height;
+
+ if (bottom > this.height || right > this.width) {
+ throw "The region must fit inside the matrix";
+ }
+
+ for (var y = top; y < bottom; y++) {
+ var offset = y * this.rowSize;
+
+ for (var x = left; x < right; x++) {
+ this.bits[offset + (x >> 5)] |= 1 << (x & 0x1f);
+ }
+ }
+ };
+ }
+
+ var BitMatix = BitMatrix;
+
+ function ECB(count, dataCodewords) {
+ this.count = count;
+ this.dataCodewords = dataCodewords;
+
+ this.__defineGetter__("Count", function () {
+ return this.count;
+ });
+
+ this.__defineGetter__("DataCodewords", function () {
+ return this.dataCodewords;
+ });
+ }
+
+ function ECBlocks(ecCodewordsPerBlock, ecBlocks1, ecBlocks2) {
+ this.ecCodewordsPerBlock = ecCodewordsPerBlock;
+ if (ecBlocks2) this.ecBlocks = new Array(ecBlocks1, ecBlocks2);else this.ecBlocks = new Array(ecBlocks1);
+
+ this.__defineGetter__("ECCodewordsPerBlock", function () {
+ return this.ecCodewordsPerBlock;
+ });
+
+ this.__defineGetter__("TotalECCodewords", function () {
+ return this.ecCodewordsPerBlock * this.NumBlocks;
+ });
+
+ this.__defineGetter__("NumBlocks", function () {
+ var total = 0;
+
+ for (var i = 0; i < this.ecBlocks.length; i++) {
+ total += this.ecBlocks[i].length;
+ }
+
+ return total;
+ });
+
+ this.getECBlocks = function () {
+ return this.ecBlocks;
+ };
+ }
+
+ function Version(versionNumber, alignmentPatternCenters, ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4) {
+ this.versionNumber = versionNumber;
+ this.alignmentPatternCenters = alignmentPatternCenters;
+ this.ecBlocks = new Array(ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4);
+ var total = 0;
+ var ecCodewords = ecBlocks1.ECCodewordsPerBlock;
+ var ecbArray = ecBlocks1.getECBlocks();
+
+ for (var i = 0; i < ecbArray.length; i++) {
+ var ecBlock = ecbArray[i];
+ total += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);
+ }
+
+ this.totalCodewords = total;
+
+ this.__defineGetter__("VersionNumber", function () {
+ return this.versionNumber;
+ });
+
+ this.__defineGetter__("AlignmentPatternCenters", function () {
+ return this.alignmentPatternCenters;
+ });
+
+ this.__defineGetter__("TotalCodewords", function () {
+ return this.totalCodewords;
+ });
+
+ this.__defineGetter__("DimensionForVersion", function () {
+ return 17 + 4 * this.versionNumber;
+ });
+
+ this.buildFunctionPattern = function () {
+ var dimension = this.DimensionForVersion;
+ var bitMatrix = new BitMatix(dimension); // Top left finder pattern + separator + format
+
+ bitMatrix.setRegion(0, 0, 9, 9); // Top right finder pattern + separator + format
+
+ bitMatrix.setRegion(dimension - 8, 0, 8, 9); // Bottom left finder pattern + separator + format
+
+ bitMatrix.setRegion(0, dimension - 8, 9, 8); // Alignment patterns
+
+ var max = this.alignmentPatternCenters.length;
+
+ for (var x = 0; x < max; x++) {
+ var i = this.alignmentPatternCenters[x] - 2;
+
+ for (var y = 0; y < max; y++) {
+ if (x == 0 && (y == 0 || y == max - 1) || x == max - 1 && y == 0) {
+ // No alignment patterns near the three finder paterns
+ continue;
+ }
+
+ bitMatrix.setRegion(this.alignmentPatternCenters[y] - 2, i, 5, 5);
+ }
+ } // Vertical timing pattern
+
+
+ bitMatrix.setRegion(6, 9, 1, dimension - 17); // Horizontal timing pattern
+
+ bitMatrix.setRegion(9, 6, dimension - 17, 1);
+
+ if (this.versionNumber > 6) {
+ // Version info, top right
+ bitMatrix.setRegion(dimension - 11, 0, 3, 6); // Version info, bottom left
+
+ bitMatrix.setRegion(0, dimension - 11, 6, 3);
+ }
+
+ return bitMatrix;
+ };
+
+ this.getECBlocksForLevel = function (ecLevel) {
+ return this.ecBlocks[ecLevel.ordinal()];
+ };
+ }
+
+ Version.VERSION_DECODE_INFO = new Array(0x07C94, 0x085BC, 0x09A99, 0x0A4D3, 0x0BBF6, 0x0C762, 0x0D847, 0x0E60D, 0x0F928, 0x10B78, 0x1145D, 0x12A17, 0x13532, 0x149A6, 0x15683, 0x168C9, 0x177EC, 0x18EC4, 0x191E1, 0x1AFAB, 0x1B08E, 0x1CC1A, 0x1D33F, 0x1ED75, 0x1F250, 0x209D5, 0x216F0, 0x228BA, 0x2379F, 0x24B0B, 0x2542E, 0x26A64, 0x27541, 0x28C69);
+ Version.VERSIONS = buildVersions();
+
+ Version.getVersionForNumber = function (versionNumber) {
+ if (versionNumber < 1 || versionNumber > 40) {
+ throw "ArgumentException";
+ }
+
+ return Version.VERSIONS[versionNumber - 1];
+ };
+
+ Version.getProvisionalVersionForDimension = function (dimension) {
+ if (dimension % 4 != 1) {
+ throw "Error getProvisionalVersionForDimension";
+ }
+
+ try {
+ return Version.getVersionForNumber(dimension - 17 >> 2);
+ } catch (iae) {
+ throw "Error getVersionForNumber";
+ }
+ };
+
+ Version.decodeVersionInformation = function (versionBits) {
+ var bestDifference = 0xffffffff;
+ var bestVersion = 0;
+
+ for (var i = 0; i < Version.VERSION_DECODE_INFO.length; i++) {
+ var targetVersion = Version.VERSION_DECODE_INFO[i]; // Do the version info bits match exactly? done.
+
+ if (targetVersion == versionBits) {
+ return this.getVersionForNumber(i + 7);
+ } // Otherwise see if this is the closest to a real version info bit string
+ // we have seen so far
+
+
+ var bitsDifference = FormatInformation_1.numBitsDiffering(versionBits, targetVersion);
+
+ if (bitsDifference < bestDifference) {
+ bestVersion = i + 7;
+ bestDifference = bitsDifference;
+ }
+ } // We can tolerate up to 3 bits of error since no two version info codewords will
+ // differ in less than 4 bits.
+
+
+ if (bestDifference <= 3) {
+ return this.getVersionForNumber(bestVersion);
+ } // If we didn't find a close enough match, fail
+
+
+ return null;
+ };
+
+ function buildVersions() {
+ return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))), new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))), new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))), new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))), new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))), new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))), new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))), new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))), new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))), new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))), new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))), new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))), new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))), new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))), new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))), new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))), new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))), new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))), new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))), new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))), new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))), new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))), new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))), new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))), new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))), new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))), new Version(27, new Array(6, 34, 62, 90, 118), new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15), new ECB(28, 16))), new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))), new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))), new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))), new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))), new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))), new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))), new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))), new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))), new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))), new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))), new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))), new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))), new Version(40, new Array(6, 30, 58, 86, 114, 142, 170), new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16))));
+ }
+
+ var Version_1 = Version;
+
+ // var PerspectiveTransform = require('./PerspectiveTransform')
+
+
+ var GridSampler = {};
+
+ GridSampler.checkAndNudgePoints = function (image, points, base) {
+ var width = base.width;
+ var height = base.height; // Check and nudge points from start until we see some that are OK:
+
+ var nudged = true;
+
+ for (var offset = 0; offset < points.length && nudged; offset += 2) {
+ var x = Math.floor(points[offset]);
+ var y = Math.floor(points[offset + 1]);
+
+ if (x < -1 || x > width || y < -1 || y > height) {
+ throw "Error.checkAndNudgePoints ";
+ }
+
+ nudged = false;
+
+ if (x == -1) {
+ points[offset] = 0.0;
+ nudged = true;
+ } else if (x == width) {
+ points[offset] = width - 1;
+ nudged = true;
+ }
+
+ if (y == -1) {
+ points[offset + 1] = 0.0;
+ nudged = true;
+ } else if (y == height) {
+ points[offset + 1] = height - 1;
+ nudged = true;
+ }
+ } // Check and nudge points from end:
+
+
+ nudged = true;
+
+ for (var offset = points.length - 2; offset >= 0 && nudged; offset -= 2) {
+ var x = Math.floor(points[offset]);
+ var y = Math.floor(points[offset + 1]);
+
+ if (x < -1 || x > width || y < -1 || y > height) {
+ throw "Error.checkAndNudgePoints ";
+ }
+
+ nudged = false;
+
+ if (x == -1) {
+ points[offset] = 0.0;
+ nudged = true;
+ } else if (x == width) {
+ points[offset] = width - 1;
+ nudged = true;
+ }
+
+ if (y == -1) {
+ points[offset + 1] = 0.0;
+ nudged = true;
+ } else if (y == height) {
+ points[offset + 1] = height - 1;
+ nudged = true;
+ }
+ }
+ };
+
+ GridSampler.sampleGrid3 = function (image, base, dimension, transform) {
+ var bits = new BitMatix(dimension);
+ var points = new Array(dimension << 1);
+
+ for (var y = 0; y < dimension; y++) {
+ var max = points.length;
+ var iValue = y + 0.5;
+
+ for (var x = 0; x < max; x += 2) {
+ points[x] = (x >> 1) + 0.5;
+ points[x + 1] = iValue;
+ }
+
+ transform.transformPoints1(points); // Quick check to see if points transformed to something inside the image;
+ // sufficient to check the endpoints
+
+ GridSampler.checkAndNudgePoints(image, points, base);
+
+ try {
+ for (var x = 0; x < max; x += 2) {
+ //var xpoint = (Math.floor( points[x]) * 4) + (Math.floor( points[x + 1]) * base.width * 4);
+ var bit = image[Math.floor(points[x]) + base.width * Math.floor(points[x + 1])]; //qrcode.imagedata.data[xpoint] = bit?255:0;
+ //qrcode.imagedata.data[xpoint+1] = bit?255:0;
+ //qrcode.imagedata.data[xpoint+2] = 0;
+ //qrcode.imagedata.data[xpoint+3] = 255;
+ //bits[x >> 1][ y]=bit;
+
+ if (bit) bits.set_Renamed(x >> 1, y);
+ }
+ } catch (aioobe) {
+ // This feels wrong, but, sometimes if the finder patterns are misidentified, the resulting
+ // transform gets "twisted" such that it maps a straight line of points to a set of points
+ // whose endpoints are in bounds, but others are not. There is probably some mathematical
+ // way to detect this about the transformation that I don't know yet.
+ // This results in an ugly runtime exception despite our clever checks above -- can't have
+ // that. We could check each point's coordinates but that feels duplicative. We settle for
+ // catching and wrapping ArrayIndexOutOfBoundsException.
+ throw "Error.checkAndNudgePoints";
+ }
+ }
+
+ return bits;
+ }; // GridSampler.sampleGridx = function (image, base, dimension, p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY) {
+ // var transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
+ // return GridSampler.sampleGrid3(image, base, dimension, transform);
+ // }
+
+
+ var GridSampler_1 = GridSampler;
+
+ function PerspectiveTransform(a11, a21, a31, a12, a22, a32, a13, a23, a33) {
+ this.a11 = a11;
+ this.a12 = a12;
+ this.a13 = a13;
+ this.a21 = a21;
+ this.a22 = a22;
+ this.a23 = a23;
+ this.a31 = a31;
+ this.a32 = a32;
+ this.a33 = a33;
+
+ this.transformPoints1 = function (points) {
+ var max = points.length;
+ var a11 = this.a11;
+ var a12 = this.a12;
+ var a13 = this.a13;
+ var a21 = this.a21;
+ var a22 = this.a22;
+ var a23 = this.a23;
+ var a31 = this.a31;
+ var a32 = this.a32;
+ var a33 = this.a33;
+
+ for (var i = 0; i < max; i += 2) {
+ var x = points[i];
+ var y = points[i + 1];
+ var denominator = a13 * x + a23 * y + a33;
+ points[i] = (a11 * x + a21 * y + a31) / denominator;
+ points[i + 1] = (a12 * x + a22 * y + a32) / denominator;
+ }
+ };
+
+ this.transformPoints2 = function (xValues, yValues) {
+ var n = xValues.length;
+
+ for (var i = 0; i < n; i++) {
+ var x = xValues[i];
+ var y = yValues[i];
+ var denominator = this.a13 * x + this.a23 * y + this.a33;
+ xValues[i] = (this.a11 * x + this.a21 * y + this.a31) / denominator;
+ yValues[i] = (this.a12 * x + this.a22 * y + this.a32) / denominator;
+ }
+ };
+
+ this.buildAdjoint = function () {
+ // Adjoint is the transpose of the cofactor matrix:
+ return new PerspectiveTransform(this.a22 * this.a33 - this.a23 * this.a32, this.a23 * this.a31 - this.a21 * this.a33, this.a21 * this.a32 - this.a22 * this.a31, this.a13 * this.a32 - this.a12 * this.a33, this.a11 * this.a33 - this.a13 * this.a31, this.a12 * this.a31 - this.a11 * this.a32, this.a12 * this.a23 - this.a13 * this.a22, this.a13 * this.a21 - this.a11 * this.a23, this.a11 * this.a22 - this.a12 * this.a21);
+ };
+
+ this.times = function (other) {
+ return new PerspectiveTransform(this.a11 * other.a11 + this.a21 * other.a12 + this.a31 * other.a13, this.a11 * other.a21 + this.a21 * other.a22 + this.a31 * other.a23, this.a11 * other.a31 + this.a21 * other.a32 + this.a31 * other.a33, this.a12 * other.a11 + this.a22 * other.a12 + this.a32 * other.a13, this.a12 * other.a21 + this.a22 * other.a22 + this.a32 * other.a23, this.a12 * other.a31 + this.a22 * other.a32 + this.a32 * other.a33, this.a13 * other.a11 + this.a23 * other.a12 + this.a33 * other.a13, this.a13 * other.a21 + this.a23 * other.a22 + this.a33 * other.a23, this.a13 * other.a31 + this.a23 * other.a32 + this.a33 * other.a33);
+ };
+ }
+
+ PerspectiveTransform.quadrilateralToQuadrilateral = function (x0, y0, x1, y1, x2, y2, x3, y3, x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p) {
+ var qToS = this.quadrilateralToSquare(x0, y0, x1, y1, x2, y2, x3, y3);
+ var sToQ = this.squareToQuadrilateral(x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p);
+ return sToQ.times(qToS);
+ };
+
+ PerspectiveTransform.squareToQuadrilateral = function (x0, y0, x1, y1, x2, y2, x3, y3) {
+ var dy2 = y3 - y2;
+ var dy3 = y0 - y1 + y2 - y3;
+
+ if (dy2 == 0.0 && dy3 == 0.0) {
+ return new PerspectiveTransform(x1 - x0, x2 - x1, x0, y1 - y0, y2 - y1, y0, 0.0, 0.0, 1.0);
+ } else {
+ var dx1 = x1 - x2;
+ var dx2 = x3 - x2;
+ var dx3 = x0 - x1 + x2 - x3;
+ var dy1 = y1 - y2;
+ var denominator = dx1 * dy2 - dx2 * dy1;
+ var a13 = (dx3 * dy2 - dx2 * dy3) / denominator;
+ var a23 = (dx1 * dy3 - dx3 * dy1) / denominator;
+ return new PerspectiveTransform(x1 - x0 + a13 * x1, x3 - x0 + a23 * x3, x0, y1 - y0 + a13 * y1, y3 - y0 + a23 * y3, y0, a13, a23, 1.0);
+ }
+ };
+
+ PerspectiveTransform.quadrilateralToSquare = function (x0, y0, x1, y1, x2, y2, x3, y3) {
+ // Here, the adjoint serves as the inverse:
+ return this.squareToQuadrilateral(x0, y0, x1, y1, x2, y2, x3, y3).buildAdjoint();
+ };
+
+ var PerspectiveTransform_1 = PerspectiveTransform;
+
+ function DetectorResult(bits, points) {
+ this.bits = bits;
+ this.points = points;
+ }
+
+ function Detector(imageArray, base) {
+ this.image = imageArray;
+ this.resultPointCallback = null;
+
+ this.sizeOfBlackWhiteBlackRun = function (fromX, fromY, toX, toY) {
+ // Mild variant of Bresenham's algorithm;
+ // see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm
+ var steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);
+
+ if (steep) {
+ var temp = fromX;
+ fromX = fromY;
+ fromY = temp;
+ temp = toX;
+ toX = toY;
+ toY = temp;
+ }
+
+ var dx = Math.abs(toX - fromX);
+ var dy = Math.abs(toY - fromY);
+ var error = -dx >> 1;
+ var ystep = fromY < toY ? 1 : -1;
+ var xstep = fromX < toX ? 1 : -1;
+ var state = 0; // In black pixels, looking for white, first or second time
+
+ for (var x = fromX, y = fromY; x != toX; x += xstep) {
+ var realX = steep ? y : x;
+ var realY = steep ? x : y;
+
+ if (state == 1) {
+ // In white pixels, looking for black
+ if (this.image[realX + realY * base.width]) {
+ state++;
+ }
+ } else {
+ if (!this.image[realX + realY * base.width]) {
+ state++;
+ }
+ }
+
+ if (state == 3) {
+ // Found black, white, black, and stumbled back onto white; done
+ var diffX = x - fromX;
+ var diffY = y - fromY;
+ return Math.sqrt(diffX * diffX + diffY * diffY);
+ }
+
+ error += dy;
+
+ if (error > 0) {
+ if (y == toY) {
+ break;
+ }
+
+ y += ystep;
+ error -= dx;
+ }
+ }
+
+ var diffX2 = toX - fromX;
+ var diffY2 = toY - fromY;
+ return Math.sqrt(diffX2 * diffX2 + diffY2 * diffY2);
+ };
+
+ this.sizeOfBlackWhiteBlackRunBothWays = function (fromX, fromY, toX, toY) {
+ var result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY); // Now count other way -- don't run off image though of course
+
+ var scale = 1.0;
+ var otherToX = fromX - (toX - fromX);
+
+ if (otherToX < 0) {
+ scale = fromX / (fromX - otherToX);
+ otherToX = 0;
+ } else if (otherToX >= base.width) {
+ scale = (base.width - 1 - fromX) / (otherToX - fromX);
+ otherToX = base.width - 1;
+ }
+
+ var otherToY = Math.floor(fromY - (toY - fromY) * scale);
+ scale = 1.0;
+
+ if (otherToY < 0) {
+ scale = fromY / (fromY - otherToY);
+ otherToY = 0;
+ } else if (otherToY >= base.height) {
+ scale = (base.height - 1 - fromY) / (otherToY - fromY);
+ otherToY = base.height - 1;
+ }
+
+ otherToX = Math.floor(fromX + (otherToX - fromX) * scale);
+ result += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
+ return result - 1.0; // -1 because we counted the middle pixel twice
+ };
+
+ this.calculateModuleSizeOneWay = function (pattern, otherPattern) {
+ var moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(pattern.X), Math.floor(pattern.Y), Math.floor(otherPattern.X), Math.floor(otherPattern.Y));
+ var moduleSizeEst2 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(otherPattern.X), Math.floor(otherPattern.Y), Math.floor(pattern.X), Math.floor(pattern.Y));
+
+ if (isNaN(moduleSizeEst1)) {
+ return moduleSizeEst2 / 7.0;
+ }
+
+ if (isNaN(moduleSizeEst2)) {
+ return moduleSizeEst1 / 7.0;
+ } // Average them, and divide by 7 since we've counted the width of 3 black modules,
+ // and 1 white and 1 black module on either side. Ergo, divide sum by 14.
+
+
+ return (moduleSizeEst1 + moduleSizeEst2) / 14.0;
+ };
+
+ this.calculateModuleSize = function (topLeft, topRight, bottomLeft) {
+ // Take the average
+ return (this.calculateModuleSizeOneWay(topLeft, topRight) + this.calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0;
+ };
+
+ this.distance = function (pattern1, pattern2) {
+ var xDiff = pattern1.X - pattern2.X;
+ var yDiff = pattern1.Y - pattern2.Y;
+ return Math.sqrt(xDiff * xDiff + yDiff * yDiff);
+ };
+
+ this.computeDimension = function (topLeft, topRight, bottomLeft, moduleSize) {
+ var tltrCentersDimension = Math.round(this.distance(topLeft, topRight) / moduleSize);
+ var tlblCentersDimension = Math.round(this.distance(topLeft, bottomLeft) / moduleSize);
+ var dimension = (tltrCentersDimension + tlblCentersDimension >> 1) + 7;
+
+ switch (dimension & 0x03) {
+ // mod 4
+ case 0:
+ dimension++;
+ break;
+ // 1? do nothing
+
+ case 2:
+ dimension--;
+ break;
+
+ case 3:
+ throw "Error";
+ }
+
+ return dimension;
+ };
+
+ this.findAlignmentInRegion = function (overallEstModuleSize, estAlignmentX, estAlignmentY, allowanceFactor) {
+ // Look for an alignment pattern (3 modules in size) around where it
+ // should be
+ var allowance = Math.floor(allowanceFactor * overallEstModuleSize);
+ var alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);
+ var alignmentAreaRightX = Math.min(base.width - 1, estAlignmentX + allowance);
+
+ if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3) {
+ throw "Error";
+ }
+
+ var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);
+ var alignmentAreaBottomY = Math.min(base.height - 1, estAlignmentY + allowance);
+ var alignmentFinder = new Alignment(this.image, base, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);
+ return alignmentFinder.find();
+ };
+
+ this.createTransform = function (topLeft, topRight, bottomLeft, alignmentPattern, dimension) {
+ var dimMinusThree = dimension - 3.5;
+ var bottomRightX;
+ var bottomRightY;
+ var sourceBottomRightX;
+ var sourceBottomRightY;
+
+ if (alignmentPattern != null) {
+ bottomRightX = alignmentPattern.X;
+ bottomRightY = alignmentPattern.Y;
+ sourceBottomRightX = sourceBottomRightY = dimMinusThree - 3.0;
+ } else {
+ // Don't have an alignment pattern, just make up the bottom-right point
+ bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
+ bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;
+ sourceBottomRightX = sourceBottomRightY = dimMinusThree;
+ }
+
+ var transform = PerspectiveTransform_1.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.X, topLeft.Y, topRight.X, topRight.Y, bottomRightX, bottomRightY, bottomLeft.X, bottomLeft.Y);
+ return transform;
+ };
+
+ this.sampleGrid = function (image, transform, dimension) {
+ return GridSampler_1.sampleGrid3(image, base, dimension, transform);
+ };
+
+ this.processFinderPatternInfo = function (info) {
+ var topLeft = info.TopLeft;
+ var topRight = info.TopRight;
+ var bottomLeft = info.BottomLeft;
+ var moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);
+
+ if (moduleSize < 1.0) {
+ throw "Error";
+ }
+
+ var dimension = this.computeDimension(topLeft, topRight, bottomLeft, moduleSize);
+ var provisionalVersion = Version_1.getProvisionalVersionForDimension(dimension);
+ var modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;
+ var alignmentPattern = null; // Anything above version 1 has an alignment pattern
+
+ if (provisionalVersion.AlignmentPatternCenters.length > 0) {
+ // Guess where a "bottom right" finder pattern would have been
+ var bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
+ var bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y; // Estimate that alignment pattern is closer by 3 modules
+ // from "bottom right" to known top left location
+
+ var correctionToTopLeft = 1.0 - 3.0 / modulesBetweenFPCenters;
+ var estAlignmentX = Math.floor(topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));
+ var estAlignmentY = Math.floor(topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y)); // Kind of arbitrary -- expand search radius before giving up
+
+ for (var i = 4; i <= 16; i <<= 1) {
+ //try
+ //{
+ alignmentPattern = this.findAlignmentInRegion(moduleSize, estAlignmentX, estAlignmentY, i);
+ break; //}
+ //catch (re)
+ //{
+ // try next round
+ //}
+ } // If we didn't find alignment pattern... well try anyway without it
+
+ }
+
+ var transform = this.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
+ var bits = this.sampleGrid(this.image, transform, dimension);
+ var points;
+
+ if (alignmentPattern == null) {
+ points = new Array(bottomLeft, topLeft, topRight);
+ } else {
+ points = new Array(bottomLeft, topLeft, topRight, alignmentPattern);
+ }
+
+ return new DetectorResult(bits, points);
+ };
+
+ this.detect = function () {
+ var info = new Findpat(base).findFinderPattern(this.image);
+ return this.processFinderPatternInfo(info);
+ };
+ }
+
+ var Detector_1 = Detector;
+
+ var addOrSubtract = function addOrSubtract(a, b) {
+ return a ^ b;
+ };
+
+ function GF256Poly(field, coefficients) {
+ if (coefficients == null || coefficients.length == 0) {
+ throw "System.ArgumentException";
+ }
+
+ this.field = field;
+ var coefficientsLength = coefficients.length;
+
+ if (coefficientsLength > 1 && coefficients[0] == 0) {
+ // Leading term must be non-zero for anything except the constant polynomial "0"
+ var firstNonZero = 1;
+
+ while (firstNonZero < coefficientsLength && coefficients[firstNonZero] == 0) {
+ firstNonZero++;
+ }
+
+ if (firstNonZero == coefficientsLength) {
+ this.coefficients = field.Zero.coefficients;
+ } else {
+ this.coefficients = new Array(coefficientsLength - firstNonZero);
+
+ for (var i = 0; i < this.coefficients.length; i++) {
+ this.coefficients[i] = 0;
+ } //Array.Copy(coefficients, firstNonZero, this.coefficients, 0, this.coefficients.length);
+
+
+ for (var ci = 0; ci < this.coefficients.length; ci++) {
+ this.coefficients[ci] = coefficients[firstNonZero + ci];
+ }
+ }
+ } else {
+ this.coefficients = coefficients;
+ }
+
+ this.__defineGetter__("Zero", function () {
+ return this.coefficients[0] == 0;
+ });
+
+ this.__defineGetter__("Degree", function () {
+ return this.coefficients.length - 1;
+ });
+
+ this.__defineGetter__("Coefficients", function () {
+ return this.coefficients;
+ });
+
+ this.getCoefficient = function (degree) {
+ return this.coefficients[this.coefficients.length - 1 - degree];
+ };
+
+ this.evaluateAt = function (a) {
+ if (a == 0) {
+ // Just return the x^0 coefficient
+ return this.getCoefficient(0);
+ }
+
+ var size = this.coefficients.length;
+
+ if (a == 1) {
+ // Just the sum of the coefficients
+ var result = 0;
+
+ for (var i = 0; i < size; i++) {
+ result = addOrSubtract(result, this.coefficients[i]);
+ }
+
+ return result;
+ }
+
+ var result2 = this.coefficients[0];
+
+ for (var i = 1; i < size; i++) {
+ result2 = addOrSubtract(this.field.multiply(a, result2), this.coefficients[i]);
+ }
+
+ return result2;
+ };
+
+ this.addOrSubtract = function (other) {
+ if (this.field != other.field) {
+ throw "GF256Polys do not have same GF256 field";
+ }
+
+ if (this.Zero) {
+ return other;
+ }
+
+ if (other.Zero) {
+ return this;
+ }
+
+ var smallerCoefficients = this.coefficients;
+ var largerCoefficients = other.coefficients;
+
+ if (smallerCoefficients.length > largerCoefficients.length) {
+ var temp = smallerCoefficients;
+ smallerCoefficients = largerCoefficients;
+ largerCoefficients = temp;
+ }
+
+ var sumDiff = new Array(largerCoefficients.length);
+ var lengthDiff = largerCoefficients.length - smallerCoefficients.length; // Copy high-order terms only found in higher-degree polynomial's coefficients
+ //Array.Copy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
+
+ for (var ci = 0; ci < lengthDiff; ci++) {
+ sumDiff[ci] = largerCoefficients[ci];
+ }
+
+ for (var i = lengthDiff; i < largerCoefficients.length; i++) {
+ sumDiff[i] = addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
+ }
+
+ return new GF256Poly(field, sumDiff);
+ };
+
+ this.multiply1 = function (other) {
+ if (this.field != other.field) {
+ throw "GF256Polys do not have same GF256 field";
+ }
+
+ if (this.Zero || other.Zero) {
+ return this.field.Zero;
+ }
+
+ var aCoefficients = this.coefficients;
+ var aLength = aCoefficients.length;
+ var bCoefficients = other.coefficients;
+ var bLength = bCoefficients.length;
+ var product = new Array(aLength + bLength - 1);
+
+ for (var i = 0; i < aLength; i++) {
+ var aCoeff = aCoefficients[i];
+
+ for (var j = 0; j < bLength; j++) {
+ product[i + j] = addOrSubtract(product[i + j], this.field.multiply(aCoeff, bCoefficients[j]));
+ }
+ }
+
+ return new GF256Poly(this.field, product);
+ };
+
+ this.multiply2 = function (scalar) {
+ if (scalar == 0) {
+ return this.field.Zero;
+ }
+
+ if (scalar == 1) {
+ return this;
+ }
+
+ var size = this.coefficients.length;
+ var product = new Array(size);
+
+ for (var i = 0; i < size; i++) {
+ product[i] = this.field.multiply(this.coefficients[i], scalar);
+ }
+
+ return new GF256Poly(this.field, product);
+ };
+
+ this.multiplyByMonomial = function (degree, coefficient) {
+ if (degree < 0) {
+ throw "System.ArgumentException";
+ }
+
+ if (coefficient == 0) {
+ return this.field.Zero;
+ }
+
+ var size = this.coefficients.length;
+ var product = new Array(size + degree);
+
+ for (var i = 0; i < product.length; i++) {
+ product[i] = 0;
+ }
+
+ for (var i = 0; i < size; i++) {
+ product[i] = this.field.multiply(this.coefficients[i], coefficient);
+ }
+
+ return new GF256Poly(this.field, product);
+ };
+
+ this.divide = function (other) {
+ if (this.field != other.field) {
+ throw "GF256Polys do not have same GF256 field";
+ }
+
+ if (other.Zero) {
+ throw "Divide by 0";
+ }
+
+ var quotient = this.field.Zero;
+ var remainder = this;
+ var denominatorLeadingTerm = other.getCoefficient(other.Degree);
+ var inverseDenominatorLeadingTerm = this.field.inverse(denominatorLeadingTerm);
+
+ while (remainder.Degree >= other.Degree && !remainder.Zero) {
+ var degreeDifference = remainder.Degree - other.Degree;
+ var scale = this.field.multiply(remainder.getCoefficient(remainder.Degree), inverseDenominatorLeadingTerm);
+ var term = other.multiplyByMonomial(degreeDifference, scale);
+ var iterationQuotient = this.field.buildMonomial(degreeDifference, scale);
+ quotient = quotient.addOrSubtract(iterationQuotient);
+ remainder = remainder.addOrSubtract(term);
+ }
+
+ return new Array(quotient, remainder);
+ };
+ }
+
+ var GF256Poly_1 = GF256Poly;
+
+ function GF256(primitive) {
+ this.expTable = new Array(256);
+ this.logTable = new Array(256);
+ var x = 1;
+
+ for (var i = 0; i < 256; i++) {
+ this.expTable[i] = x;
+ x <<= 1; // x = x * 2; we're assuming the generator alpha is 2
+
+ if (x >= 0x100) {
+ x ^= primitive;
+ }
+ }
+
+ for (var i = 0; i < 255; i++) {
+ this.logTable[this.expTable[i]] = i;
+ } // logTable[0] == 0 but this should never be used
+
+
+ var at0 = new Array(1);
+ at0[0] = 0;
+ this.zero = new GF256Poly_1(this, new Array(at0));
+ var at1 = new Array(1);
+ at1[0] = 1;
+ this.one = new GF256Poly_1(this, new Array(at1));
+
+ this.__defineGetter__("Zero", function () {
+ return this.zero;
+ });
+
+ this.__defineGetter__("One", function () {
+ return this.one;
+ });
+
+ this.buildMonomial = function (degree, coefficient) {
+ if (degree < 0) {
+ throw "System.ArgumentException";
+ }
+
+ if (coefficient == 0) {
+ return this.zero;
+ }
+
+ var coefficients = new Array(degree + 1);
+
+ for (var i = 0; i < coefficients.length; i++) {
+ coefficients[i] = 0;
+ }
+
+ coefficients[0] = coefficient;
+ return new GF256Poly_1(this, coefficients);
+ };
+
+ this.exp = function (a) {
+ return this.expTable[a];
+ };
+
+ this.log = function (a) {
+ if (a == 0) {
+ throw "System.ArgumentException";
+ }
+
+ return this.logTable[a];
+ };
+
+ this.inverse = function (a) {
+ if (a == 0) {
+ throw "System.ArithmeticException";
+ }
+
+ return this.expTable[255 - this.logTable[a]];
+ };
+
+ this.multiply = function (a, b) {
+ if (a == 0 || b == 0) {
+ return 0;
+ }
+
+ if (a == 1) {
+ return b;
+ }
+
+ if (b == 1) {
+ return a;
+ }
+
+ return this.expTable[(this.logTable[a] + this.logTable[b]) % 255];
+ };
+ }
+
+ GF256.QR_CODE_FIELD = new GF256(0x011D);
+ GF256.DATA_MATRIX_FIELD = new GF256(0x012D);
+
+ GF256.addOrSubtract = function (a, b) {
+ return a ^ b;
+ };
+
+ var GF256_1 = GF256;
+
+ var URShift$3 = utils.URShift;
+ var DataMask = {};
+
+ DataMask.forReference = function (reference) {
+ if (reference < 0 || reference > 7) {
+ throw "System.ArgumentException";
+ }
+
+ return DataMask.DATA_MASKS[reference];
+ };
+
+ function DataMask000() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return (i + j & 0x01) == 0;
+ };
+ }
+
+ function DataMask001() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return (i & 0x01) == 0;
+ };
+ }
+
+ function DataMask010() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return j % 3 == 0;
+ };
+ }
+
+ function DataMask011() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return (i + j) % 3 == 0;
+ };
+ }
+
+ function DataMask100() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return (URShift$3(i, 1) + j / 3 & 0x01) == 0;
+ };
+ }
+
+ function DataMask101() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ var temp = i * j;
+ return (temp & 0x01) + temp % 3 == 0;
+ };
+ }
+
+ function DataMask110() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ var temp = i * j;
+ return ((temp & 0x01) + temp % 3 & 0x01) == 0;
+ };
+ }
+
+ function DataMask111() {
+ this.unmaskBitMatrix = function (bits, dimension) {
+ for (var i = 0; i < dimension; i++) {
+ for (var j = 0; j < dimension; j++) {
+ if (this.isMasked(i, j)) {
+ bits.flip(j, i);
+ }
+ }
+ }
+ };
+
+ this.isMasked = function (i, j) {
+ return ((i + j & 0x01) + i * j % 3 & 0x01) == 0;
+ };
+ }
+
+ DataMask.DATA_MASKS = new Array(new DataMask000(), new DataMask001(), new DataMask010(), new DataMask011(), new DataMask100(), new DataMask101(), new DataMask110(), new DataMask111());
+ var DataMask_1 = DataMask;
+
+ var BitMatrixParser = function BitMatrixParser(bitMatrix) {
+ var dimension = bitMatrix.Dimension;
+
+ if (dimension < 21 || (dimension & 0x03) != 1) {
+ throw "Error BitMatrixParser";
+ }
+
+ this.bitMatrix = bitMatrix;
+ this.parsedVersion = null;
+ this.parsedFormatInfo = null;
+
+ this.copyBit = function (i, j, versionBits) {
+ return this.bitMatrix.get_Renamed(i, j) ? versionBits << 1 | 0x1 : versionBits << 1;
+ };
+
+ this.readFormatInformation = function () {
+ if (this.parsedFormatInfo != null) {
+ return this.parsedFormatInfo;
+ } // Read top-left format info bits
+
+
+ var formatInfoBits = 0;
+
+ for (var i = 0; i < 6; i++) {
+ formatInfoBits = this.copyBit(i, 8, formatInfoBits);
+ } // .. and skip a bit in the timing pattern ...
+
+
+ formatInfoBits = this.copyBit(7, 8, formatInfoBits);
+ formatInfoBits = this.copyBit(8, 8, formatInfoBits);
+ formatInfoBits = this.copyBit(8, 7, formatInfoBits); // .. and skip a bit in the timing pattern ...
+
+ for (var j = 5; j >= 0; j--) {
+ formatInfoBits = this.copyBit(8, j, formatInfoBits);
+ }
+
+ this.parsedFormatInfo = FormatInformation_1.decodeFormatInformation(formatInfoBits);
+
+ if (this.parsedFormatInfo != null) {
+ return this.parsedFormatInfo;
+ } // Hmm, failed. Try the top-right/bottom-left pattern
+
+
+ var dimension = this.bitMatrix.Dimension;
+ formatInfoBits = 0;
+ var iMin = dimension - 8;
+
+ for (var i = dimension - 1; i >= iMin; i--) {
+ formatInfoBits = this.copyBit(i, 8, formatInfoBits);
+ }
+
+ for (var j = dimension - 7; j < dimension; j++) {
+ formatInfoBits = this.copyBit(8, j, formatInfoBits);
+ }
+
+ this.parsedFormatInfo = FormatInformation_1.decodeFormatInformation(formatInfoBits);
+
+ if (this.parsedFormatInfo != null) {
+ return this.parsedFormatInfo;
+ }
+
+ throw "Error readFormatInformation";
+ };
+
+ this.readVersion = function () {
+ if (this.parsedVersion != null) {
+ return this.parsedVersion;
+ }
+
+ var dimension = this.bitMatrix.Dimension;
+ var provisionalVersion = dimension - 17 >> 2;
+
+ if (provisionalVersion <= 6) {
+ return Version_1.getVersionForNumber(provisionalVersion);
+ } // Read top-right version info: 3 wide by 6 tall
+
+
+ var versionBits = 0;
+ var ijMin = dimension - 11;
+
+ for (var j = 5; j >= 0; j--) {
+ for (var i = dimension - 9; i >= ijMin; i--) {
+ versionBits = this.copyBit(i, j, versionBits);
+ }
+ }
+
+ this.parsedVersion = Version_1.decodeVersionInformation(versionBits);
+
+ if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension) {
+ return this.parsedVersion;
+ } // Hmm, failed. Try bottom left: 6 wide by 3 tall
+
+
+ versionBits = 0;
+
+ for (var i = 5; i >= 0; i--) {
+ for (var j = dimension - 9; j >= ijMin; j--) {
+ versionBits = this.copyBit(i, j, versionBits);
+ }
+ }
+
+ this.parsedVersion = Version_1.decodeVersionInformation(versionBits);
+
+ if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension) {
+ return this.parsedVersion;
+ }
+
+ throw "Error readVersion";
+ };
+
+ this.readCodewords = function () {
+ var formatInfo = this.readFormatInformation();
+ var version = this.readVersion(); // Get the data mask for the format used in this QR Code. This will exclude
+ // some bits from reading as we wind through the bit matrix.
+
+ var dataMask = DataMask_1.forReference(formatInfo.DataMask);
+ var dimension = this.bitMatrix.Dimension;
+ dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
+ var functionPattern = version.buildFunctionPattern();
+ var readingUp = true;
+ var result = new Array(version.TotalCodewords);
+ var resultOffset = 0;
+ var currentByte = 0;
+ var bitsRead = 0; // Read columns in pairs, from right to left
+
+ for (var j = dimension - 1; j > 0; j -= 2) {
+ if (j == 6) {
+ // Skip whole column with vertical alignment pattern;
+ // saves time and makes the other code proceed more cleanly
+ j--;
+ } // Read alternatingly from bottom to top then top to bottom
+
+
+ for (var count = 0; count < dimension; count++) {
+ var i = readingUp ? dimension - 1 - count : count;
+
+ for (var col = 0; col < 2; col++) {
+ // Ignore bits covered by the function pattern
+ if (!functionPattern.get_Renamed(j - col, i)) {
+ // Read a bit
+ bitsRead++;
+ currentByte <<= 1;
+
+ if (this.bitMatrix.get_Renamed(j - col, i)) {
+ currentByte |= 1;
+ } // If we've made a whole byte, save it off
+
+
+ if (bitsRead == 8) {
+ result[resultOffset++] = currentByte;
+ bitsRead = 0;
+ currentByte = 0;
+ }
+ }
+ }
+ }
+
+ readingUp ^= true; // readingUp = !readingUp; // switch directions
+ }
+
+ if (resultOffset != version.TotalCodewords) {
+ throw "Error readCodewords";
+ }
+
+ return result;
+ };
+ };
+
+ /*
+ Ported to JavaScript by Lazar Laszlo 2011
+
+ lazarsoft@gmail.com, www.lazarsoft.info
+
+ */
+
+ /*
+ *
+ * Copyright 2007 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+ function DataBlock(numDataCodewords, codewords) {
+ this.numDataCodewords = numDataCodewords;
+ this.codewords = codewords;
+
+ this.__defineGetter__("NumDataCodewords", function () {
+ return this.numDataCodewords;
+ });
+
+ this.__defineGetter__("Codewords", function () {
+ return this.codewords;
+ });
+ }
+
+ DataBlock.getDataBlocks = function (rawCodewords, version, ecLevel) {
+ if (rawCodewords.length != version.TotalCodewords) {
+ throw "ArgumentException";
+ } // Figure out the number and size of data blocks used by this version and
+ // error correction level
+
+
+ var ecBlocks = version.getECBlocksForLevel(ecLevel); // First count the total number of data blocks
+
+ var totalBlocks = 0;
+ var ecBlockArray = ecBlocks.getECBlocks();
+
+ for (var i = 0; i < ecBlockArray.length; i++) {
+ totalBlocks += ecBlockArray[i].Count;
+ } // Now establish DataBlocks of the appropriate size and number of data codewords
+
+
+ var result = new Array(totalBlocks);
+ var numResultBlocks = 0;
+
+ for (var j = 0; j < ecBlockArray.length; j++) {
+ var ecBlock = ecBlockArray[j];
+
+ for (var i = 0; i < ecBlock.Count; i++) {
+ var numDataCodewords = ecBlock.DataCodewords;
+ var numBlockCodewords = ecBlocks.ECCodewordsPerBlock + numDataCodewords;
+ result[numResultBlocks++] = new DataBlock(numDataCodewords, new Array(numBlockCodewords));
+ }
+ } // All blocks have the same amount of data, except that the last n
+ // (where n may be 0) have 1 more byte. Figure out where these start.
+
+
+ var shorterBlocksTotalCodewords = result[0].codewords.length;
+ var longerBlocksStartAt = result.length - 1;
+
+ while (longerBlocksStartAt >= 0) {
+ var numCodewords = result[longerBlocksStartAt].codewords.length;
+
+ if (numCodewords == shorterBlocksTotalCodewords) {
+ break;
+ }
+
+ longerBlocksStartAt--;
+ }
+
+ longerBlocksStartAt++;
+ var shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock; // The last elements of result may be 1 element longer;
+ // first fill out as many elements as all of them have
+
+ var rawCodewordsOffset = 0;
+
+ for (var i = 0; i < shorterBlocksNumDataCodewords; i++) {
+ for (var j = 0; j < numResultBlocks; j++) {
+ result[j].codewords[i] = rawCodewords[rawCodewordsOffset++];
+ }
+ } // Fill out the last data block in the longer ones
+
+
+ for (var j = longerBlocksStartAt; j < numResultBlocks; j++) {
+ result[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];
+ } // Now add in error correction blocks
+
+
+ var max = result[0].codewords.length;
+
+ for (var i = shorterBlocksNumDataCodewords; i < max; i++) {
+ for (var j = 0; j < numResultBlocks; j++) {
+ var iOffset = j < longerBlocksStartAt ? i : i + 1;
+ result[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];
+ }
+ }
+
+ return result;
+ };
+
+ var DataBlock_1 = DataBlock;
+
+ var sizeOfDataLengthInfo = [[10, 9, 8, 8], [12, 11, 16, 10], [14, 13, 16, 12]];
+
+ function QRCodeDataBlockReader(blocks, version, numErrorCorrectionCode) {
+ this.blockPointer = 0;
+ this.bitPointer = 7;
+ this.dataLength = 0;
+ this.blocks = blocks;
+ this.numErrorCorrectionCode = numErrorCorrectionCode;
+ if (version <= 9) this.dataLengthMode = 0;else if (version >= 10 && version <= 26) this.dataLengthMode = 1;else if (version >= 27 && version <= 40) this.dataLengthMode = 2;
+
+ this.getNextBits = function (numBits) {
+ var bits = 0;
+
+ if (numBits < this.bitPointer + 1) {
+ // next word fits into current data block
+ var mask = 0;
+
+ for (var i = 0; i < numBits; i++) {
+ mask += 1 << i;
+ }
+
+ mask <<= this.bitPointer - numBits + 1;
+ bits = (this.blocks[this.blockPointer] & mask) >> this.bitPointer - numBits + 1;
+ this.bitPointer -= numBits;
+ return bits;
+ } else if (numBits < this.bitPointer + 1 + 8) {
+ // next word crosses 2 data blocks
+ var mask1 = 0;
+
+ for (var i = 0; i < this.bitPointer + 1; i++) {
+ mask1 += 1 << i;
+ }
+
+ bits = (this.blocks[this.blockPointer] & mask1) << numBits - (this.bitPointer + 1);
+ this.blockPointer++;
+ bits += this.blocks[this.blockPointer] >> 8 - (numBits - (this.bitPointer + 1));
+ this.bitPointer = this.bitPointer - numBits % 8;
+
+ if (this.bitPointer < 0) {
+ this.bitPointer = 8 + this.bitPointer;
+ }
+
+ return bits;
+ } else if (numBits < this.bitPointer + 1 + 16) {
+ // next word crosses 3 data blocks
+ var mask1 = 0; // mask of first block
+
+ var mask3 = 0; // mask of 3rd block
+ //bitPointer + 1 : number of bits of the 1st block
+ //8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)
+ //numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block
+
+ for (var i = 0; i < this.bitPointer + 1; i++) {
+ mask1 += 1 << i;
+ }
+
+ var bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << numBits - (this.bitPointer + 1);
+ this.blockPointer++;
+ var bitsSecondBlock = this.blocks[this.blockPointer] << numBits - (this.bitPointer + 1 + 8);
+ this.blockPointer++;
+
+ for (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++) {
+ mask3 += 1 << i;
+ }
+
+ mask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));
+ var bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> 8 - (numBits - (this.bitPointer + 1 + 8));
+ bits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;
+ this.bitPointer = this.bitPointer - (numBits - 8) % 8;
+
+ if (this.bitPointer < 0) {
+ this.bitPointer = 8 + this.bitPointer;
+ }
+
+ return bits;
+ } else {
+ return 0;
+ }
+ };
+
+ this.NextMode = function () {
+ if (this.blockPointer > this.blocks.length - this.numErrorCorrectionCode - 2) return 0;else return this.getNextBits(4);
+ };
+
+ this.getDataLength = function (modeIndicator) {
+ var index = 0;
+
+ while (true) {
+ if (modeIndicator >> index == 1) break;
+ index++;
+ }
+
+ return this.getNextBits(sizeOfDataLengthInfo[this.dataLengthMode][index]);
+ };
+
+ this.getRomanAndFigureString = function (dataLength) {
+ var length = dataLength;
+ var intData = 0;
+ var strData = "";
+ var tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', '$', '%', '*', '+', '-', '.', '/', ':');
+
+ do {
+ if (length > 1) {
+ intData = this.getNextBits(11);
+ var firstLetter = Math.floor(intData / 45);
+ var secondLetter = intData % 45;
+ strData += tableRomanAndFigure[firstLetter];
+ strData += tableRomanAndFigure[secondLetter];
+ length -= 2;
+ } else if (length == 1) {
+ intData = this.getNextBits(6);
+ strData += tableRomanAndFigure[intData];
+ length -= 1;
+ }
+ } while (length > 0);
+
+ return strData;
+ };
+
+ this.getFigureString = function (dataLength) {
+ var length = dataLength;
+ var intData = 0;
+ var strData = "";
+
+ do {
+ if (length >= 3) {
+ intData = this.getNextBits(10);
+ if (intData < 100) strData += "0";
+ if (intData < 10) strData += "0";
+ length -= 3;
+ } else if (length == 2) {
+ intData = this.getNextBits(7);
+ if (intData < 10) strData += "0";
+ length -= 2;
+ } else if (length == 1) {
+ intData = this.getNextBits(4);
+ length -= 1;
+ }
+
+ strData += intData;
+ } while (length > 0);
+
+ return strData;
+ };
+
+ this.get8bitByteArray = function (dataLength) {
+ var length = dataLength;
+ var intData = 0;
+ var output = new Array();
+
+ do {
+ intData = this.getNextBits(8);
+ output.push(intData);
+ length--;
+ } while (length > 0);
+
+ return output;
+ };
+
+ this.getKanjiString = function (dataLength) {
+ var length = dataLength;
+ var intData = 0;
+ var unicodeString = "";
+
+ do {
+ intData = this.getNextBits(13);
+ var lowerByte = intData % 0xC0;
+ var higherByte = intData / 0xC0;
+ var tempWord = (higherByte << 8) + lowerByte;
+ var shiftjisWord = 0;
+
+ if (tempWord + 0x8140 <= 0x9FFC) {
+ // between 8140 - 9FFC on Shift_JIS character set
+ shiftjisWord = tempWord + 0x8140;
+ } else {
+ // between E040 - EBBF on Shift_JIS character set
+ shiftjisWord = tempWord + 0xC140;
+ } //var tempByte = new Array(0,0);
+ //tempByte[0] = (sbyte) (shiftjisWord >> 8);
+ //tempByte[1] = (sbyte) (shiftjisWord & 0xFF);
+ //unicodeString += new String(SystemUtils.ToCharArray(SystemUtils.ToByteArray(tempByte)));
+
+
+ unicodeString += String.fromCharCode(shiftjisWord);
+ length--;
+ } while (length > 0);
+
+ return unicodeString;
+ };
+
+ this.parseECIValue = function () {
+ var intData = 0;
+ var firstByte = this.getNextBits(8);
+
+ if ((firstByte & 0x80) == 0) {
+ intData = firstByte & 0x7F;
+ }
+
+ if ((firstByte & 0xC0) == 0x80) {
+ // two bytes
+ var secondByte = this.getNextBits(8);
+ intData = (firstByte & 0x3F) << 8 | secondByte;
+ }
+
+ if ((firstByte & 0xE0) == 0xC0) {
+ // three bytes
+ var secondThirdBytes = this.getNextBits(8);
+ intData = (firstByte & 0x1F) << 16 | secondThirdBytes;
+ }
+
+ return intData;
+ };
+
+ this.__defineGetter__("DataByte", function () {
+ var output = new Array();
+ var MODE_NUMBER = 1;
+ var MODE_ROMAN_AND_NUMBER = 2;
+ var MODE_8BIT_BYTE = 4;
+ var MODE_ECI = 7;
+ var MODE_KANJI = 8;
+
+ do {
+ var mode = this.NextMode(); //canvas.println("mode: " + mode);
+
+ if (mode == 0) {
+ if (output.length > 0) break;else throw "Empty data block";
+ }
+
+ if (mode != MODE_NUMBER && mode != MODE_ROMAN_AND_NUMBER && mode != MODE_8BIT_BYTE && mode != MODE_KANJI && mode != MODE_ECI) {
+ throw "Invalid mode: " + mode + " in (block:" + this.blockPointer + " bit:" + this.bitPointer + ")";
+ }
+
+ if (mode == MODE_ECI) {
+ var temp_sbyteArray3 = this.parseECIValue(); //output.push(temp_sbyteArray3);
+ } else {
+ var dataLength = this.getDataLength(mode);
+ if (dataLength < 1) throw "Invalid data length: " + dataLength;
+
+ switch (mode) {
+ case MODE_NUMBER:
+ var temp_str = this.getFigureString(dataLength);
+ var ta = new Array(temp_str.length);
+
+ for (var j = 0; j < temp_str.length; j++) {
+ ta[j] = temp_str.charCodeAt(j);
+ }
+
+ output.push(ta);
+ break;
+
+ case MODE_ROMAN_AND_NUMBER:
+ var temp_str = this.getRomanAndFigureString(dataLength);
+ var ta = new Array(temp_str.length);
+
+ for (var j = 0; j < temp_str.length; j++) {
+ ta[j] = temp_str.charCodeAt(j);
+ }
+
+ output.push(ta);
+ break;
+
+ case MODE_8BIT_BYTE:
+ var temp_sbyteArray3 = this.get8bitByteArray(dataLength);
+ output.push(temp_sbyteArray3);
+ break;
+
+ case MODE_KANJI:
+ var temp_str = this.getKanjiString(dataLength);
+ output.push(temp_str);
+ break;
+ }
+ }
+ } while (true);
+
+ return output;
+ });
+ }
+
+ var QRCodeDataBlockReader_1 = QRCodeDataBlockReader;
+
+ var ReedSolomonDecoder = function ReedSolomonDecoder(field) {
+ this.field = field;
+
+ this.decode = function (received, twoS) {
+ var poly = new GF256Poly_1(this.field, received);
+ var syndromeCoefficients = new Array(twoS);
+
+ for (var i = 0; i < syndromeCoefficients.length; i++) {
+ syndromeCoefficients[i] = 0;
+ }
+
+ var dataMatrix = false; //this.field.Equals(GF256.DATA_MATRIX_FIELD);
+
+ var noError = true;
+
+ for (var i = 0; i < twoS; i++) {
+ // Thanks to sanfordsquires for this fix:
+ var evalu = poly.evaluateAt(this.field.exp(dataMatrix ? i + 1 : i));
+ syndromeCoefficients[syndromeCoefficients.length - 1 - i] = evalu;
+
+ if (evalu != 0) {
+ noError = false;
+ }
+ }
+
+ if (noError) {
+ return;
+ }
+
+ var syndrome = new GF256Poly_1(this.field, syndromeCoefficients);
+ var sigmaOmega = this.runEuclideanAlgorithm(this.field.buildMonomial(twoS, 1), syndrome, twoS);
+ var sigma = sigmaOmega[0];
+ var omega = sigmaOmega[1];
+ var errorLocations = this.findErrorLocations(sigma);
+ var errorMagnitudes = this.findErrorMagnitudes(omega, errorLocations, dataMatrix);
+
+ for (var i = 0; i < errorLocations.length; i++) {
+ var position = received.length - 1 - this.field.log(errorLocations[i]);
+
+ if (position < 0) {
+ throw "ReedSolomonException Bad error location";
+ }
+
+ received[position] = GF256_1.addOrSubtract(received[position], errorMagnitudes[i]);
+ }
+ };
+
+ this.runEuclideanAlgorithm = function (a, b, R) {
+ // Assume a's degree is >= b's
+ if (a.Degree < b.Degree) {
+ var temp = a;
+ a = b;
+ b = temp;
+ }
+
+ var rLast = a;
+ var r = b;
+ var sLast = this.field.One;
+ var s = this.field.Zero;
+ var tLast = this.field.Zero;
+ var t = this.field.One; // Run Euclidean algorithm until r's degree is less than R/2
+
+ while (r.Degree >= Math.floor(R / 2)) {
+ var rLastLast = rLast;
+ var sLastLast = sLast;
+ var tLastLast = tLast;
+ rLast = r;
+ sLast = s;
+ tLast = t; // Divide rLastLast by rLast, with quotient in q and remainder in r
+
+ if (rLast.Zero) {
+ // Oops, Euclidean algorithm already terminated?
+ throw "r_{i-1} was zero";
+ }
+
+ r = rLastLast;
+ var q = this.field.Zero;
+ var denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);
+ var dltInverse = this.field.inverse(denominatorLeadingTerm);
+
+ while (r.Degree >= rLast.Degree && !r.Zero) {
+ var degreeDiff = r.Degree - rLast.Degree;
+ var scale = this.field.multiply(r.getCoefficient(r.Degree), dltInverse);
+ q = q.addOrSubtract(this.field.buildMonomial(degreeDiff, scale));
+ r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale)); //r.EXE();
+ }
+
+ s = q.multiply1(sLast).addOrSubtract(sLastLast);
+ t = q.multiply1(tLast).addOrSubtract(tLastLast);
+ }
+
+ var sigmaTildeAtZero = t.getCoefficient(0);
+
+ if (sigmaTildeAtZero == 0) {
+ throw "ReedSolomonException sigmaTilde(0) was zero";
+ }
+
+ var inverse = this.field.inverse(sigmaTildeAtZero);
+ var sigma = t.multiply2(inverse);
+ var omega = r.multiply2(inverse);
+ return new Array(sigma, omega);
+ };
+
+ this.findErrorLocations = function (errorLocator) {
+ // This is a direct application of Chien's search
+ var numErrors = errorLocator.Degree;
+
+ if (numErrors == 1) {
+ // shortcut
+ return new Array(errorLocator.getCoefficient(1));
+ }
+
+ var result = new Array(numErrors);
+ var e = 0;
+
+ for (var i = 1; i < 256 && e < numErrors; i++) {
+ if (errorLocator.evaluateAt(i) == 0) {
+ result[e] = this.field.inverse(i);
+ e++;
+ }
+ }
+
+ if (e != numErrors) {
+ throw "Error locator degree does not match number of roots";
+ }
+
+ return result;
+ };
+
+ this.findErrorMagnitudes = function (errorEvaluator, errorLocations, dataMatrix) {
+ // This is directly applying Forney's Formula
+ var s = errorLocations.length;
+ var result = new Array(s);
+
+ for (var i = 0; i < s; i++) {
+ var xiInverse = this.field.inverse(errorLocations[i]);
+ var denominator = 1;
+
+ for (var j = 0; j < s; j++) {
+ if (i != j) {
+ denominator = this.field.multiply(denominator, GF256_1.addOrSubtract(1, this.field.multiply(errorLocations[j], xiInverse)));
+ }
+ }
+
+ result[i] = this.field.multiply(errorEvaluator.evaluateAt(xiInverse), this.field.inverse(denominator)); // Thanks to sanfordsquires for this fix:
+
+ if (dataMatrix) {
+ result[i] = this.field.multiply(result[i], xiInverse);
+ }
+ }
+
+ return result;
+ };
+ };
+
+ var Decoder = {};
+ Decoder.rsDecoder = new ReedSolomonDecoder(GF256_1.QR_CODE_FIELD);
+
+ Decoder.correctErrors = function (codewordBytes, numDataCodewords) {
+ var numCodewords = codewordBytes.length; // First read into an array of ints
+
+ var codewordsInts = new Array(numCodewords);
+
+ for (var i = 0; i < numCodewords; i++) {
+ codewordsInts[i] = codewordBytes[i] & 0xFF;
+ }
+
+ var numECCodewords = codewordBytes.length - numDataCodewords;
+
+ try {
+ Decoder.rsDecoder.decode(codewordsInts, numECCodewords); //var corrector = new ReedSolomon(codewordsInts, numECCodewords);
+ //corrector.correct();
+ } catch (rse) {
+ throw rse;
+ } // Copy back into array of bytes -- only need to worry about the bytes that were data
+ // We don't care about errors in the error-correction codewords
+
+
+ for (var i = 0; i < numDataCodewords; i++) {
+ codewordBytes[i] = codewordsInts[i];
+ }
+ };
+
+ Decoder.decode = function (bits) {
+ var parser = new BitMatrixParser(bits);
+ var version = parser.readVersion();
+ var ecLevel = parser.readFormatInformation().ErrorCorrectionLevel; // Read codewords
+
+ var codewords = parser.readCodewords(); // Separate into data blocks
+
+ var dataBlocks = DataBlock_1.getDataBlocks(codewords, version, ecLevel); // Count total number of data bytes
+
+ var totalBytes = 0;
+
+ for (var i = 0; i < dataBlocks.length; i++) {
+ totalBytes += dataBlocks[i].NumDataCodewords;
+ }
+
+ var resultBytes = new Array(totalBytes);
+ var resultOffset = 0; // Error-correct and copy data blocks together into a stream of bytes
+
+ for (var j = 0; j < dataBlocks.length; j++) {
+ var dataBlock = dataBlocks[j];
+ var codewordBytes = dataBlock.Codewords;
+ var numDataCodewords = dataBlock.NumDataCodewords;
+ Decoder.correctErrors(codewordBytes, numDataCodewords);
+
+ for (var i = 0; i < numDataCodewords; i++) {
+ resultBytes[resultOffset++] = codewordBytes[i];
+ }
+ } // Decode the contents of that stream of bytes
+
+
+ var reader = new QRCodeDataBlockReader_1(resultBytes, version.VersionNumber, ecLevel.Bits);
+ return reader; //return DecodedBitStreamParser.decode(resultBytes, version, ecLevel);
+ };
+
+ var Decoder_1 = Decoder;
+
+ var debug = false; // 获取指定位置的灰度
+
+ var Pixel = function Pixel(data, base) {
+ return function (x, y) {
+ if (base.width < x || base.height < y) {
+ throw "point error";
+ }
+
+ var point = x * 4 + y * base.width * 4;
+ return (data[point] * 33.33 + data[point + 1] * 33.33 + data[point + 2] * 33.33) / 100;
+ };
+ };
+
+ var binarize = function binarize(data, base, th) {
+ var ret = new Array(base.width * base.height);
+ var getPixel = Pixel(data, base);
+
+ for (var y = 0; y < base.height; y++) {
+ for (var x = 0; x < base.width; x++) {
+ var gray = getPixel(x, y);
+ ret[x + y * base.width] = gray <= th ? true : false;
+ }
+ }
+
+ return ret;
+ };
+
+ function decode(imageDate, debugfn) {
+ var base = {
+ width: imageDate.width,
+ height: imageDate.height,
+ debugfn: debugfn
+ };
+ return process(imageDate.data, base);
+ }
+
+ var process = function process(data, base) {
+ // var start = new Date().getTime();
+ // var image = grayScaleToBitmap(grayscale(),base);
+ // var image = binarize(128);
+ var image = binarize(data, base, 153); //转为位图;
+
+ debug && base.debugfn && base.debugfn(image, base.width); // 位图转为QR矩阵
+
+ var detector = new Detector_1(image, base);
+ var qRCodeMatrix = detector.detect();
+
+ if (base.debugfn) {
+ var _imgdata = [];
+
+ for (var y = 0; y < qRCodeMatrix.bits.Height; y++) {
+ for (var x = 0; x < qRCodeMatrix.bits.Width; x++) {
+ _imgdata.push(qRCodeMatrix.bits.get_Renamed(x, y) ? true : 0);
+ }
+ }
+
+ debugfn(_imgdata, qRCodeMatrix.bits.Width);
+ } // 解析QR矩阵
+
+
+ var reader = Decoder_1.decode(qRCodeMatrix.bits); // console.log(reader);
+
+ var data = reader.DataByte;
+ var str = "";
+
+ for (var i = 0; i < data.length; i++) {
+ for (var j = 0; j < data[i].length; j++) {
+ str += String.fromCharCode(data[i][j]);
+ }
+ } // var end = new Date().getTime();
+ // var time = end - start;
+ // console.log("Time:" + time + " Code: "+str);
+
+
+ return str;
+ };
+
+ var QRDecode = decode;
+
+ var decodeByDom = function decodeByDom(dom) {
+ var canvas = document.createElement("canvas");
+ var ctx = canvas.getContext('2d');
+ canvas.width = dom.width;
+ canvas.height = dom.height;
+ ctx.drawImage(dom, 0, 0, canvas.width, canvas.height);
+ var data = ctx.getImageData(0, 0, canvas.width, canvas.height);
+ return QRDecode(data);
+ };
+
+ var decodeByUrl = function decodeByUrl(src, cb) {
+ var img = new Image();
+ img.crossOrigin = "anonymous";
+ img.src = src;
+
+ img.onload = function () {
+ try {
+ cb(null, decodeByDom(img));
+ } catch (e) {
+ cb(e);
+ }
+ };
+
+ img.onerror = cb;
+ };
+
+ QRDecode.decodeByDom = decodeByDom;
+ QRDecode.decodeByUrl = decodeByUrl;
+ var browser = QRDecode;
+
+ exports.default = browser;
+
+ Object.defineProperty(exports, '__esModule', { value: true });
+
+})));
diff --git a/dist/qr-decode.min.js b/dist/qr-decode.min.js
new file mode 100644
index 0000000..816ff8c
--- /dev/null
+++ b/dist/qr-decode.min.js
@@ -0,0 +1,7 @@
+/*!
+ * qr-decode v0.0.1
+ * (c) 2018-present cnwhy
+ * Released under the ISC License.
+ */
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t(e.qrDecode={})}(this,function(e){"use strict";function t(e,t,n){this.x=e,this.y=t,this.count=1,this.estimatedModuleSize=n,this.__defineGetter__("EstimatedModuleSize",function(){return this.estimatedModuleSize}),this.__defineGetter__("Count",function(){return this.count}),this.__defineGetter__("X",function(){return Math.floor(this.x)}),this.__defineGetter__("Y",function(){return Math.floor(this.y)}),this.incrementCount=function(){this.count++},this.aboutEquals=function(e,t,n){if(Math.abs(t-this.y)<=e&&Math.abs(n-this.x)<=e){var i=Math.abs(e-this.estimatedModuleSize);return i<=1||i/this.estimatedModuleSize<=1}return!1}}var n=function(e,n,i,r,s,o,a,h){this.image=e,this.possibleCenters=new Array,this.startX=i,this.startY=r,this.width=s,this.height=o,this.moduleSize=a,this.crossCheckStateCount=new Array(0,0,0),this.resultPointCallback=h,this.centerFromEnd=function(e,t){return t-e[2]-e[1]/2},this.foundPatternCross=function(e){for(var t=this.moduleSize,n=t/2,i=0;i<3;i++)if(Math.abs(t-e[i])>=n)return!1;return!0},this.crossCheckVertical=function(e,t,i,r){var s=this.image,o=n.height,a=this.crossCheckStateCount;a[0]=0,a[1]=0,a[2]=0;for(var h=e;h>=0&&s[t+h*n.width]&&a[1]<=i;)a[1]++,h--;if(h<0||a[1]>i)return NaN;for(;h>=0&&!s[t+h*n.width]&&a[0]<=i;)a[0]++,h--;if(a[0]>i)return NaN;for(h=e+1;hi)return NaN;for(;hi)return NaN;var w=a[0]+a[1]+a[2];return 5*Math.abs(w-r)>=2*r?NaN:this.foundPatternCross(a)?this.centerFromEnd(a,h):NaN},this.handlePossibleCenter=function(e,n,i){var r=e[0]+e[1]+e[2],s=this.centerFromEnd(e,i),o=this.crossCheckVertical(n,Math.floor(s),2*e[1],r);if(!isNaN(o)){for(var a=(e[0]+e[1]+e[2])/3,h=this.possibleCenters.length,w=0;w>1),h=new Array(0,0,0),w=0;w>1:-(w+1>>1));h[0]=0,h[1]=0,h[2]=0;for(var u=t;u=s&&o>=a?(i=e[0],n=e[1],r=e[2]):a>=o&&a>=s?(i=e[1],n=e[0],r=e[2]):(i=e[2],n=e[0],r=e[1]),function(e,t,n){var i=t.x,r=t.y;return(n.x-i)*(e.y-r)-(n.y-r)*(e.x-i)}(n,i,r)<0){var h=n;n=r,r=h}e[0]=n,e[1]=i,e[2]=r};var h=function(e){this.image=null,this.possibleCenters=[],this.hasSkipped=!1,this.crossCheckStateCount=new Array(0,0,0,0,0),this.resultPointCallback=null,this.__defineGetter__("CrossCheckStateCount",function(){return this.crossCheckStateCount[0]=0,this.crossCheckStateCount[1]=0,this.crossCheckStateCount[2]=0,this.crossCheckStateCount[3]=0,this.crossCheckStateCount[4]=0,this.crossCheckStateCount}),this.foundPatternCross=function(e){for(var t=0,n=0;n<5;n++){var i=e[n];if(0==i)return!1;t+=i}if(t<7)return!1;var r=Math.floor((t<=0&&s[n+h*e.width];)a[2]++,h--;if(h<0)return NaN;for(;h>=0&&!s[n+h*e.width]&&a[1]<=i;)a[1]++,h--;if(h<0||a[1]>i)return NaN;for(;h>=0&&s[n+h*e.width]&&a[0]<=i;)a[0]++,h--;if(a[0]>i)return NaN;for(h=t+1;h=i)return NaN;for(;h=i)return NaN;var w=a[0]+a[1]+a[2]+a[3]+a[4];return 5*Math.abs(w-r)>=2*r?NaN:this.foundPatternCross(a)?this.centerFromEnd(a,h):NaN},this.crossCheckHorizontal=function(t,n,i,r){for(var s=this.image,o=e.width,a=this.CrossCheckStateCount,h=t;h>=0&&s[h+n*e.width];)a[2]++,h--;if(h<0)return NaN;for(;h>=0&&!s[h+n*e.width]&&a[1]<=i;)a[1]++,h--;if(h<0||a[1]>i)return NaN;for(;h>=0&&s[h+n*e.width]&&a[0]<=i;)a[0]++,h--;if(a[0]>i)return NaN;for(h=t+1;h=i)return NaN;for(;h=i)return NaN;var w=a[0]+a[1]+a[2]+a[3]+a[4];return 5*Math.abs(w-r)>=r?NaN:this.foundPatternCross(a)?this.centerFromEnd(a,h):NaN},this.handlePossibleCenter=function(e,t,n){var i=e[0]+e[1]+e[2]+e[3]+e[4],r=this.centerFromEnd(e,n),s=this.crossCheckVertical(t,Math.floor(r),e[2],i);if(!isNaN(s)&&(r=this.crossCheckHorizontal(Math.floor(r),Math.floor(s),e[2],i),!isNaN(r))){for(var o=i/7,a=!1,h=this.possibleCenters.length,w=0;w3){for(var t=0,n=0,i=0;i=0;i--){var h=this.possibleCenters[i];Math.abs(h.EstimatedModuleSize-s)>a&&this.possibleCenters.splice(i,1)}}return this.possibleCenters.length>3&&this.possibleCenters.sort(function(e,t){return e.count>t.count?-1:e.count=o){if(null!=t)return this.hasSkipped=!0,Math.floor((Math.abs(t.X-i.X)-Math.abs(t.Y-i.Y))/2);t=i}}return 0},this.haveMultiplyConfirmedCenters=function(){for(var e=0,t=0,n=this.possibleCenters.length,i=0;i=o&&(e++,t+=r.EstimatedModuleSize)}if(e<3)return!1;var s=t/n,a=0;for(i=0;iw[2]&&(f+=d-w[2]-o,l=s-1)}else{do{l++}while(l=0?e>>t:(e>>t)+(2<<~t)};function f(e,t,n){this.ordinal_Renamed_Field=e,this.bits=t,this.name=n,this.__defineGetter__("Bits",function(){return this.bits}),this.__defineGetter__("Name",function(){return this.name}),this.ordinal=function(){return this.ordinal_Renamed_Field}}var u=new f(0,1,"L"),l=new f(1,0,"M"),d=new f(2,3,"Q"),c=new f(3,2,"H"),v=new Array(l,u,c,d),g=function(e){if(e<0||e>=v.length)throw"ArgumentException";return v[e]},m=w,b=new Array(new Array(21522,0),new Array(20773,1),new Array(24188,2),new Array(23371,3),new Array(17913,4),new Array(16590,5),new Array(20375,6),new Array(19104,7),new Array(30660,8),new Array(29427,9),new Array(32170,10),new Array(30877,11),new Array(26159,12),new Array(25368,13),new Array(27713,14),new Array(26998,15),new Array(5769,16),new Array(5054,17),new Array(7399,18),new Array(6608,19),new Array(1890,20),new Array(597,21),new Array(3340,22),new Array(2107,23),new Array(13663,24),new Array(12392,25),new Array(16177,26),new Array(14854,27),new Array(9396,28),new Array(8579,29),new Array(11994,30),new Array(11245,31)),y=new Array(0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4);function C(e){this.errorCorrectionLevel=g(e>>3&3),this.dataMask=7&e,this.__defineGetter__("ErrorCorrectionLevel",function(){return this.errorCorrectionLevel}),this.__defineGetter__("DataMask",function(){return this.dataMask}),this.GetHashCode=function(){return this.errorCorrectionLevel.ordinal()<<3|this.dataMask},this.Equals=function(e){var t=e;return this.errorCorrectionLevel==t.errorCorrectionLevel&&this.dataMask==t.dataMask}}C.numBitsDiffering=function(e,t){return y[15&(e^=t)]+y[15&m(e,4)]+y[15&m(e,8)]+y[15&m(e,12)]+y[15&m(e,16)]+y[15&m(e,20)]+y[15&m(e,24)]+y[15&m(e,28)]},C.decodeFormatInformation=function(e){var t=C.doDecodeFormatInformation(e);return null!=t?t:C.doDecodeFormatInformation(21522^e)},C.doDecodeFormatInformation=function(e){for(var t=4294967295,n=0,i=0;i>5;0!=(31&e)&&n++,this.rowSize=n,this.bits=new Array(n*t);for(var i=0;i>5);return 0!=(1&A(this.bits[n],31&e))},this.set_Renamed=function(e,t){var n=t*this.rowSize+(e>>5);this.bits[n]|=1<<(31&e)},this.flip=function(e,t){var n=t*this.rowSize+(e>>5);this.bits[n]^=1<<(31&e)},this.clear=function(){for(var e=this.bits.length,t=0;tthis.height||r>this.width)throw"The region must fit inside the matrix";for(var o=t;o>5)]|=1<<(31&h)}};function M(e,t){this.count=e,this.dataCodewords=t,this.__defineGetter__("Count",function(){return this.count}),this.__defineGetter__("DataCodewords",function(){return this.dataCodewords})}function k(e,t,n){this.ecCodewordsPerBlock=e,this.ecBlocks=n?new Array(t,n):new Array(t),this.__defineGetter__("ECCodewordsPerBlock",function(){return this.ecCodewordsPerBlock}),this.__defineGetter__("TotalECCodewords",function(){return this.ecCodewordsPerBlock*this.NumBlocks}),this.__defineGetter__("NumBlocks",function(){for(var e=0,t=0;t6&&(t.setRegion(e-11,0,3,6),t.setRegion(0,e-11,6,3)),t},this.getECBlocksForLevel=function(e){return this.ecBlocks[e.ordinal()]}}P.VERSION_DECODE_INFO=new Array(31892,34236,39577,42195,48118,51042,55367,58893,63784,68472,70749,76311,79154,84390,87683,92361,96236,102084,102881,110507,110734,117786,119615,126325,127568,133589,136944,141498,145311,150283,152622,158308,161089,167017),P.VERSIONS=new Array(new P(1,new Array,new k(7,new M(1,19)),new k(10,new M(1,16)),new k(13,new M(1,13)),new k(17,new M(1,9))),new P(2,new Array(6,18),new k(10,new M(1,34)),new k(16,new M(1,28)),new k(22,new M(1,22)),new k(28,new M(1,16))),new P(3,new Array(6,22),new k(15,new M(1,55)),new k(26,new M(1,44)),new k(18,new M(2,17)),new k(22,new M(2,13))),new P(4,new Array(6,26),new k(20,new M(1,80)),new k(18,new M(2,32)),new k(26,new M(2,24)),new k(16,new M(4,9))),new P(5,new Array(6,30),new k(26,new M(1,108)),new k(24,new M(2,43)),new k(18,new M(2,15),new M(2,16)),new k(22,new M(2,11),new M(2,12))),new P(6,new Array(6,34),new k(18,new M(2,68)),new k(16,new M(4,27)),new k(24,new M(4,19)),new k(28,new M(4,15))),new P(7,new Array(6,22,38),new k(20,new M(2,78)),new k(18,new M(4,31)),new k(18,new M(2,14),new M(4,15)),new k(26,new M(4,13),new M(1,14))),new P(8,new Array(6,24,42),new k(24,new M(2,97)),new k(22,new M(2,38),new M(2,39)),new k(22,new M(4,18),new M(2,19)),new k(26,new M(4,14),new M(2,15))),new P(9,new Array(6,26,46),new k(30,new M(2,116)),new k(22,new M(3,36),new M(2,37)),new k(20,new M(4,16),new M(4,17)),new k(24,new M(4,12),new M(4,13))),new P(10,new Array(6,28,50),new k(18,new M(2,68),new M(2,69)),new k(26,new M(4,43),new M(1,44)),new k(24,new M(6,19),new M(2,20)),new k(28,new M(6,15),new M(2,16))),new P(11,new Array(6,30,54),new k(20,new M(4,81)),new k(30,new M(1,50),new M(4,51)),new k(28,new M(4,22),new M(4,23)),new k(24,new M(3,12),new M(8,13))),new P(12,new Array(6,32,58),new k(24,new M(2,92),new M(2,93)),new k(22,new M(6,36),new M(2,37)),new k(26,new M(4,20),new M(6,21)),new k(28,new M(7,14),new M(4,15))),new P(13,new Array(6,34,62),new k(26,new M(4,107)),new k(22,new M(8,37),new M(1,38)),new k(24,new M(8,20),new M(4,21)),new k(22,new M(12,11),new M(4,12))),new P(14,new Array(6,26,46,66),new k(30,new M(3,115),new M(1,116)),new k(24,new M(4,40),new M(5,41)),new k(20,new M(11,16),new M(5,17)),new k(24,new M(11,12),new M(5,13))),new P(15,new Array(6,26,48,70),new k(22,new M(5,87),new M(1,88)),new k(24,new M(5,41),new M(5,42)),new k(30,new M(5,24),new M(7,25)),new k(24,new M(11,12),new M(7,13))),new P(16,new Array(6,26,50,74),new k(24,new M(5,98),new M(1,99)),new k(28,new M(7,45),new M(3,46)),new k(24,new M(15,19),new M(2,20)),new k(30,new M(3,15),new M(13,16))),new P(17,new Array(6,30,54,78),new k(28,new M(1,107),new M(5,108)),new k(28,new M(10,46),new M(1,47)),new k(28,new M(1,22),new M(15,23)),new k(28,new M(2,14),new M(17,15))),new P(18,new Array(6,30,56,82),new k(30,new M(5,120),new M(1,121)),new k(26,new M(9,43),new M(4,44)),new k(28,new M(17,22),new M(1,23)),new k(28,new M(2,14),new M(19,15))),new P(19,new Array(6,30,58,86),new k(28,new M(3,113),new M(4,114)),new k(26,new M(3,44),new M(11,45)),new k(26,new M(17,21),new M(4,22)),new k(26,new M(9,13),new M(16,14))),new P(20,new Array(6,34,62,90),new k(28,new M(3,107),new M(5,108)),new k(26,new M(3,41),new M(13,42)),new k(30,new M(15,24),new M(5,25)),new k(28,new M(15,15),new M(10,16))),new P(21,new Array(6,28,50,72,94),new k(28,new M(4,116),new M(4,117)),new k(26,new M(17,42)),new k(28,new M(17,22),new M(6,23)),new k(30,new M(19,16),new M(6,17))),new P(22,new Array(6,26,50,74,98),new k(28,new M(2,111),new M(7,112)),new k(28,new M(17,46)),new k(30,new M(7,24),new M(16,25)),new k(24,new M(34,13))),new P(23,new Array(6,30,54,74,102),new k(30,new M(4,121),new M(5,122)),new k(28,new M(4,47),new M(14,48)),new k(30,new M(11,24),new M(14,25)),new k(30,new M(16,15),new M(14,16))),new P(24,new Array(6,28,54,80,106),new k(30,new M(6,117),new M(4,118)),new k(28,new M(6,45),new M(14,46)),new k(30,new M(11,24),new M(16,25)),new k(30,new M(30,16),new M(2,17))),new P(25,new Array(6,32,58,84,110),new k(26,new M(8,106),new M(4,107)),new k(28,new M(8,47),new M(13,48)),new k(30,new M(7,24),new M(22,25)),new k(30,new M(22,15),new M(13,16))),new P(26,new Array(6,30,58,86,114),new k(28,new M(10,114),new M(2,115)),new k(28,new M(19,46),new M(4,47)),new k(28,new M(28,22),new M(6,23)),new k(30,new M(33,16),new M(4,17))),new P(27,new Array(6,34,62,90,118),new k(30,new M(8,122),new M(4,123)),new k(28,new M(22,45),new M(3,46)),new k(30,new M(8,23),new M(26,24)),new k(30,new M(12,15),new M(28,16))),new P(28,new Array(6,26,50,74,98,122),new k(30,new M(3,117),new M(10,118)),new k(28,new M(3,45),new M(23,46)),new k(30,new M(4,24),new M(31,25)),new k(30,new M(11,15),new M(31,16))),new P(29,new Array(6,30,54,78,102,126),new k(30,new M(7,116),new M(7,117)),new k(28,new M(21,45),new M(7,46)),new k(30,new M(1,23),new M(37,24)),new k(30,new M(19,15),new M(26,16))),new P(30,new Array(6,26,52,78,104,130),new k(30,new M(5,115),new M(10,116)),new k(28,new M(19,47),new M(10,48)),new k(30,new M(15,24),new M(25,25)),new k(30,new M(23,15),new M(25,16))),new P(31,new Array(6,30,56,82,108,134),new k(30,new M(13,115),new M(3,116)),new k(28,new M(2,46),new M(29,47)),new k(30,new M(42,24),new M(1,25)),new k(30,new M(23,15),new M(28,16))),new P(32,new Array(6,34,60,86,112,138),new k(30,new M(17,115)),new k(28,new M(10,46),new M(23,47)),new k(30,new M(10,24),new M(35,25)),new k(30,new M(19,15),new M(35,16))),new P(33,new Array(6,30,58,86,114,142),new k(30,new M(17,115),new M(1,116)),new k(28,new M(14,46),new M(21,47)),new k(30,new M(29,24),new M(19,25)),new k(30,new M(11,15),new M(46,16))),new P(34,new Array(6,34,62,90,118,146),new k(30,new M(13,115),new M(6,116)),new k(28,new M(14,46),new M(23,47)),new k(30,new M(44,24),new M(7,25)),new k(30,new M(59,16),new M(1,17))),new P(35,new Array(6,30,54,78,102,126,150),new k(30,new M(12,121),new M(7,122)),new k(28,new M(12,47),new M(26,48)),new k(30,new M(39,24),new M(14,25)),new k(30,new M(22,15),new M(41,16))),new P(36,new Array(6,24,50,76,102,128,154),new k(30,new M(6,121),new M(14,122)),new k(28,new M(6,47),new M(34,48)),new k(30,new M(46,24),new M(10,25)),new k(30,new M(2,15),new M(64,16))),new P(37,new Array(6,28,54,80,106,132,158),new k(30,new M(17,122),new M(4,123)),new k(28,new M(29,46),new M(14,47)),new k(30,new M(49,24),new M(10,25)),new k(30,new M(24,15),new M(46,16))),new P(38,new Array(6,32,58,84,110,136,162),new k(30,new M(4,122),new M(18,123)),new k(28,new M(13,46),new M(32,47)),new k(30,new M(48,24),new M(14,25)),new k(30,new M(42,15),new M(32,16))),new P(39,new Array(6,26,54,82,110,138,166),new k(30,new M(20,117),new M(4,118)),new k(28,new M(40,47),new M(7,48)),new k(30,new M(43,24),new M(22,25)),new k(30,new M(10,15),new M(67,16))),new P(40,new Array(6,30,58,86,114,142,170),new k(30,new M(19,118),new M(6,119)),new k(28,new M(18,47),new M(31,48)),new k(30,new M(34,24),new M(34,25)),new k(30,new M(20,15),new M(61,16)))),P.getVersionForNumber=function(e){if(e<1||e>40)throw"ArgumentException";return P.VERSIONS[e-1]},P.getProvisionalVersionForDimension=function(e){if(e%4!=1)throw"Error getProvisionalVersionForDimension";try{return P.getVersionForNumber(e-17>>2)}catch(e){throw"Error getVersionForNumber"}},P.decodeVersionInformation=function(e){for(var t=4294967295,n=0,i=0;ii||h<-1||h>r)throw"Error.checkAndNudgePoints ";s=!1,-1==a?(t[o]=0,s=!0):a==i&&(t[o]=i-1,s=!0),-1==h?(t[o+1]=0,s=!0):h==r&&(t[o+1]=r-1,s=!0)}s=!0;for(o=t.length-2;o>=0&&s;o-=2){a=Math.floor(t[o]),h=Math.floor(t[o+1]);if(a<-1||a>i||h<-1||h>r)throw"Error.checkAndNudgePoints ";s=!1,-1==a?(t[o]=0,s=!0):a==i&&(t[o]=i-1,s=!0),-1==h?(t[o+1]=0,s=!0):h==r&&(t[o+1]=r-1,s=!0)}},sampleGrid3:function(e,t,n,i){for(var r=new p(n),s=new Array(n<<1),o=0;o>1),s[w+1]=h;i.transformPoints1(s),B.checkAndNudgePoints(e,s,t);try{for(w=0;w>1,o)}}catch(e){throw"Error.checkAndNudgePoints"}}return r}},E=B;function S(e,t,n,i,r,s,o,a,h){this.a11=e,this.a12=i,this.a13=o,this.a21=t,this.a22=r,this.a23=a,this.a31=n,this.a32=s,this.a33=h,this.transformPoints1=function(e){for(var t=e.length,n=this.a11,i=this.a12,r=this.a13,s=this.a21,o=this.a22,a=this.a23,h=this.a31,w=this.a32,f=this.a33,u=0;uMath.abs(i-e);if(s){var o=e;e=n,n=o,o=i,i=r,r=o}for(var a=Math.abs(i-e),h=Math.abs(r-n),w=-a>>1,f=n0){if(c==r)break;c+=f,w-=a}}var y=i-e,C=r-n;return Math.sqrt(y*y+C*C)},this.sizeOfBlackWhiteBlackRunBothWays=function(e,n,i,r){var s=this.sizeOfBlackWhiteBlackRun(e,n,i,r),o=1,a=e-(i-e);a<0?(o=e/(e-a),a=0):a>=t.width&&(o=(t.width-1-e)/(a-e),a=t.width-1);var h=Math.floor(n-(r-n)*o);return o=1,h<0?(o=n/(n-h),h=0):h>=t.height&&(o=(t.height-1-n)/(h-n),h=t.height-1),a=Math.floor(e+(a-e)*o),(s+=this.sizeOfBlackWhiteBlackRun(e,n,a,h))-1},this.calculateModuleSizeOneWay=function(e,t){var n=this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(e.X),Math.floor(e.Y),Math.floor(t.X),Math.floor(t.Y)),i=this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(t.X),Math.floor(t.Y),Math.floor(e.X),Math.floor(e.Y));return isNaN(n)?i/7:isNaN(i)?n/7:(n+i)/14},this.calculateModuleSize=function(e,t,n){return(this.calculateModuleSizeOneWay(e,t)+this.calculateModuleSizeOneWay(e,n))/2},this.distance=function(e,t){var n=e.X-t.X,i=e.Y-t.Y;return Math.sqrt(n*n+i*i)},this.computeDimension=function(e,t,n,i){var r=7+(Math.round(this.distance(e,t)/i)+Math.round(this.distance(e,n)/i)>>1);switch(3&r){case 0:r++;break;case 2:r--;break;case 3:throw"Error"}return r},this.findAlignmentInRegion=function(e,i,r,s){var o=Math.floor(s*e),a=Math.max(0,i-o),h=Math.min(t.width-1,i+o);if(h-a<3*e)throw"Error";var w=Math.max(0,r-o),f=Math.min(t.height-1,r+o);return new n(this.image,t,a,w,h-a,f-w,e,this.resultPointCallback).find()},this.createTransform=function(e,t,n,i,r){var s,o,a,h,w=r-3.5;return null!=i?(s=i.X,o=i.Y,a=h=w-3):(s=t.X-e.X+n.X,o=t.Y-e.Y+n.Y,a=h=w),D.quadrilateralToQuadrilateral(3.5,3.5,w,3.5,a,h,3.5,w,e.X,e.Y,t.X,t.Y,s,o,n.X,n.Y)},this.sampleGrid=function(e,n,i){return E.sampleGrid3(e,t,i,n)},this.processFinderPatternInfo=function(e){var t=e.TopLeft,n=e.TopRight,i=e.BottomLeft,r=this.calculateModuleSize(t,n,i);if(r<1)throw"Error";var s=this.computeDimension(t,n,i,r),o=N.getProvisionalVersionForDimension(s),a=o.DimensionForVersion-7,h=null;if(o.AlignmentPatternCenters.length>0)for(var w=n.X-t.X+i.X,f=n.Y-t.Y+i.Y,u=1-3/a,l=Math.floor(t.X+u*(w-t.X)),d=Math.floor(t.Y+u*(f-t.Y)),c=4;c<=16;c<<=1){h=this.findAlignmentInRegion(r,l,d,c);break}var v=this.createTransform(t,n,i,h,s);return new function(e,t){this.bits=e,this.points=t}(this.sampleGrid(this.image,v,s),null==h?new Array(i,t,n):new Array(i,t,n,h))},this.detect=function(){var e=new h(t).findFinderPattern(this.image);return this.processFinderPatternInfo(e)}},F=function(e,t){return e^t};var R=function e(t,n){if(null==n||0==n.length)throw"System.ArgumentException";this.field=t;var i=n.length;if(i>1&&0==n[0]){for(var r=1;rr.length){var s=i;i=r,r=s}for(var o=new Array(r.length),a=r.length-i.length,h=0;h=e.Degree&&!n.Zero;){var s=n.Degree-e.Degree,o=this.field.multiply(n.getCoefficient(n.Degree),r),a=e.multiplyByMonomial(s,o),h=this.field.buildMonomial(s,o);t=t.addOrSubtract(h),n=n.addOrSubtract(a)}return new Array(t,n)}};function G(e){this.expTable=new Array(256),this.logTable=new Array(256);for(var t=1,n=0;n<256;n++)this.expTable[n]=t,(t<<=1)>=256&&(t^=e);for(n=0;n<255;n++)this.logTable[this.expTable[n]]=n;var i=new Array(1);i[0]=0,this.zero=new R(this,new Array(i));var r=new Array(1);r[0]=1,this.one=new R(this,new Array(r)),this.__defineGetter__("Zero",function(){return this.zero}),this.__defineGetter__("One",function(){return this.one}),this.buildMonomial=function(e,t){if(e<0)throw"System.ArgumentException";if(0==t)return this.zero;for(var n=new Array(e+1),i=0;i7)throw"System.ArgumentException";return z.DATA_MASKS[e]},z.DATA_MASKS=new Array(new function(){this.unmaskBitMatrix=function(e,t){for(var n=0;n=0;){if(a[c].codewords.length==d)break;c--}c++;var v=d-i.ECCodewordsPerBlock,g=0;for(o=0;o=10&&t<=26?this.dataLengthMode=1:t>=27&&t<=40&&(this.dataLengthMode=2),this.getNextBits=function(e){var t=0;if(e>this.bitPointer-e+1,this.bitPointer-=e,t}if(e>8-(e-(this.bitPointer+1)),this.bitPointer=this.bitPointer-e%8,this.bitPointer<0&&(this.bitPointer=8+this.bitPointer),t}if(e>8-(e-(this.bitPointer+1+8))),this.bitPointer=this.bitPointer-(e-8)%8,this.bitPointer<0&&(this.bitPointer=8+this.bitPointer),t}return 0},this.NextMode=function(){return this.blockPointer>this.blocks.length-this.numErrorCorrectionCode-2?0:this.getNextBits(4)},this.getDataLength=function(e){for(var t=0;e>>t!=1;)t++;return this.getNextBits(X[this.dataLengthMode][t])},this.getRomanAndFigureString=function(e){var t=e,n=0,i="",r=new Array("0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"," ","$","%","*","+","-",".","/",":");do{if(t>1){var s=(n=this.getNextBits(11))%45;i+=r[Math.floor(n/45)],i+=r[s],t-=2}else 1==t&&(i+=r[n=this.getNextBits(6)],t-=1)}while(t>0);return i},this.getFigureString=function(e){var t=e,n=0,i="";do{t>=3?((n=this.getNextBits(10))<100&&(i+="0"),n<10&&(i+="0"),t-=3):2==t?((n=this.getNextBits(7))<10&&(i+="0"),t-=2):1==t&&(n=this.getNextBits(4),t-=1),i+=n}while(t>0);return i},this.get8bitByteArray=function(e){var t=e,n=0,i=new Array;do{n=this.getNextBits(8),i.push(n),t--}while(t>0);return i},this.getKanjiString=function(e){var t=e,n=0,i="";do{var r=((n=this.getNextBits(13))/192<<8)+n%192,s=0;s=r+33088<=40956?r+33088:r+49472,i+=String.fromCharCode(s),t--}while(t>0);return i},this.parseECIValue=function(){var e=0,t=this.getNextBits(8);return 0==(128&t)&&(e=127&t),128==(192&t)&&(e=(63&t)<<8|this.getNextBits(8)),192==(224&t)&&(e=(31&t)<<16|this.getNextBits(8)),e},this.__defineGetter__("DataByte",function(){for(var e=new Array;;){var t=this.NextMode();if(0==t){if(e.length>0)break;throw"Empty data block"}if(1!=t&&2!=t&&4!=t&&8!=t&&7!=t)throw"Invalid mode: "+t+" in (block:"+this.blockPointer+" bit:"+this.bitPointer+")";if(7==t)var n=this.parseECIValue();else{var i=this.getDataLength(t);if(i<1)throw"Invalid data length: "+i;switch(t){case 1:for(var r=this.getFigureString(i),s=new Array(r.length),o=0;o=Math.floor(n/2);){var f=r,u=o,l=h;if(o=a,h=w,(r=s).Zero)throw"r_{i-1} was zero";s=f;for(var d=this.field.Zero,c=r.getCoefficient(r.Degree),v=this.field.inverse(c);s.Degree>=r.Degree&&!s.Zero;){var g=s.Degree-r.Degree,m=this.field.multiply(s.getCoefficient(s.Degree),v);d=d.addOrSubtract(this.field.buildMonomial(g,m)),s=s.addOrSubtract(r.multiplyByMonomial(g,m))}a=d.multiply1(o).addOrSubtract(u),w=d.multiply1(h).addOrSubtract(l)}var b=w.getCoefficient(0);if(0==b)throw"ReedSolomonException sigmaTilde(0) was zero";var y=this.field.inverse(b),C=w.multiply2(y),_=s.multiply2(y);return new Array(C,_)},this.findErrorLocations=function(e){var t=e.Degree;if(1==t)return new Array(e.getCoefficient(1));for(var n=new Array(t),i=0,r=1;r<256&&i=0;n--)e=this.copyBit(8,n,e);if(this.parsedFormatInfo=_.decodeFormatInformation(e),null!=this.parsedFormatInfo)return this.parsedFormatInfo;var i=this.bitMatrix.Dimension;e=0;var r=i-8;for(t=i-1;t>=r;t--)e=this.copyBit(t,8,e);for(n=i-7;n>2;if(t<=6)return N.getVersionForNumber(t);for(var n=0,i=e-11,r=5;r>=0;r--)for(var s=e-9;s>=i;s--)n=this.copyBit(s,r,n);if(this.parsedVersion=N.decodeVersionInformation(n),null!=this.parsedVersion&&this.parsedVersion.DimensionForVersion==e)return this.parsedVersion;for(n=0,s=5;s>=0;s--)for(r=e-9;r>=i;r--)n=this.copyBit(s,r,n);if(this.parsedVersion=N.decodeVersionInformation(n),null!=this.parsedVersion&&this.parsedVersion.DimensionForVersion==e)return this.parsedVersion;throw"Error readVersion"},this.readCodewords=function(){var e=this.readFormatInformation(),t=this.readVersion(),n=O.forReference(e.DataMask),i=this.bitMatrix.Dimension;n.unmaskBitMatrix(this.bitMatrix,i);for(var r=t.buildFunctionPattern(),s=!0,o=new Array(t.TotalCodewords),a=0,h=0,w=0,f=i-1;f>0;f-=2){6==f&&f--;for(var u=0;u= maxVariance) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}\r\n\r\n\tthis.crossCheckVertical = function (startI, centerJ, maxCount, originalStateCountTotal) {\r\n\t\tvar image = this.image;\r\n\r\n\t\tvar maxI = base.height;\r\n\t\tvar stateCount = this.crossCheckStateCount;\r\n\t\tstateCount[0] = 0;\r\n\t\tstateCount[1] = 0;\r\n\t\tstateCount[2] = 0;\r\n\r\n\t\t// Start counting up from center\r\n\t\tvar i = startI;\r\n\t\twhile (i >= 0 && image[centerJ + i * base.width] && stateCount[1] <= maxCount) {\r\n\t\t\tstateCount[1]++;\r\n\t\t\ti--;\r\n\t\t}\r\n\t\t// If already too many modules in this state or ran off the edge:\r\n\t\tif (i < 0 || stateCount[1] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i >= 0 && !image[centerJ + i * base.width] && stateCount[0] <= maxCount) {\r\n\t\t\tstateCount[0]++;\r\n\t\t\ti--;\r\n\t\t}\r\n\t\tif (stateCount[0] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\t// Now also count down from center\r\n\t\ti = startI + 1;\r\n\t\twhile (i < maxI && image[centerJ + i * base.width] && stateCount[1] <= maxCount) {\r\n\t\t\tstateCount[1]++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tif (i == maxI || stateCount[1] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i < maxI && !image[centerJ + i * base.width] && stateCount[2] <= maxCount) {\r\n\t\t\tstateCount[2]++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tif (stateCount[2] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\tvar stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\tif (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\treturn this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, i) : NaN;\r\n\t}\r\n\r\n\tthis.handlePossibleCenter = function (stateCount, i, j) {\r\n\t\tvar stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];\r\n\t\tvar centerJ = this.centerFromEnd(stateCount, j);\r\n\t\tvar centerI = this.crossCheckVertical(i, Math.floor(centerJ), 2 * stateCount[1], stateCountTotal);\r\n\t\tif (!isNaN(centerI)) {\r\n\t\t\tvar estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3.0;\r\n\t\t\tvar max = this.possibleCenters.length;\r\n\t\t\tfor (var index = 0; index < max; index++) {\r\n\t\t\t\tvar center = this.possibleCenters[index];\r\n\t\t\t\t// Look for about the same center and module size:\r\n\t\t\t\tif (center.aboutEquals(estimatedModuleSize, centerI, centerJ)) {\r\n\t\t\t\t\treturn new AlignmentPattern(centerJ, centerI, estimatedModuleSize);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t// Hadn't found this before; save it\r\n\t\t\tvar point = new AlignmentPattern(centerJ, centerI, estimatedModuleSize);\r\n\t\t\tthis.possibleCenters.push(point);\r\n\t\t\tif (this.resultPointCallback != null) {\r\n\t\t\t\tthis.resultPointCallback.foundPossibleResultPoint(point);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn null;\r\n\t}\r\n\r\n\tthis.find = function () {\r\n\t\tvar startX = this.startX;\r\n\t\tvar height = this.height;\r\n\t\tvar maxJ = startX + width;\r\n\t\tvar middleI = startY + (height >> 1);\r\n\t\t// We are looking for black/white/black modules in 1:1:1 ratio;\r\n\t\t// this tracks the number of black/white/black modules seen so far\r\n\t\tvar stateCount = new Array(0, 0, 0);\r\n\t\tfor (var iGen = 0; iGen < height; iGen++) {\r\n\t\t\t// Search from middle outwards\r\n\t\t\tvar i = middleI + ((iGen & 0x01) == 0 ? ((iGen + 1) >> 1) : - ((iGen + 1) >> 1));\r\n\t\t\tstateCount[0] = 0;\r\n\t\t\tstateCount[1] = 0;\r\n\t\t\tstateCount[2] = 0;\r\n\t\t\tvar j = startX;\r\n\t\t\t// Burn off leading white pixels before anything else; if we start in the middle of\r\n\t\t\t// a white run, it doesn't make sense to count its length, since we don't know if the\r\n\t\t\t// white run continued to the left of the start point\r\n\t\t\twhile (j < maxJ && !image[j + base.width * i]) {\r\n\t\t\t\tj++;\r\n\t\t\t}\r\n\t\t\tvar currentState = 0;\r\n\t\t\twhile (j < maxJ) {\r\n\t\t\t\tif (image[j + i * base.width]) {\r\n\t\t\t\t\t// Black pixel\r\n\t\t\t\t\tif (currentState == 1) {\r\n\t\t\t\t\t\t// Counting black pixels\r\n\t\t\t\t\t\tstateCount[currentState]++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse {\r\n\t\t\t\t\t\t// Counting white pixels\r\n\t\t\t\t\t\tif (currentState == 2) {\r\n\t\t\t\t\t\t\t// A winner?\r\n\t\t\t\t\t\t\tif (this.foundPatternCross(stateCount)) {\r\n\t\t\t\t\t\t\t\t// Yes\r\n\t\t\t\t\t\t\t\tvar confirmed = this.handlePossibleCenter(stateCount, i, j);\r\n\t\t\t\t\t\t\t\tif (confirmed != null) {\r\n\t\t\t\t\t\t\t\t\treturn confirmed;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tstateCount[0] = stateCount[2];\r\n\t\t\t\t\t\t\tstateCount[1] = 1;\r\n\t\t\t\t\t\t\tstateCount[2] = 0;\r\n\t\t\t\t\t\t\tcurrentState = 1;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\tstateCount[++currentState]++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t// White pixel\r\n\t\t\t\t\tif (currentState == 1) {\r\n\t\t\t\t\t\t// Counting black pixels\r\n\t\t\t\t\t\tcurrentState++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tstateCount[currentState]++;\r\n\t\t\t\t}\r\n\t\t\t\tj++;\r\n\t\t\t}\r\n\t\t\tif (this.foundPatternCross(stateCount)) {\r\n\t\t\t\tvar confirmed = this.handlePossibleCenter(stateCount, i, maxJ);\r\n\t\t\t\tif (confirmed != null) {\r\n\t\t\t\t\treturn confirmed;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// Hmm, nothing we saw was observed and confirmed twice. If we had\r\n\t\t// any guess at all, return it.\r\n\t\tif (!(this.possibleCenters.length == 0)) {\r\n\t\t\treturn this.possibleCenters[0];\r\n\t\t}\r\n\r\n\t\tthrow \"Couldn't find enough alignment patterns\";\r\n\t}\r\n\r\n}\r\n\r\nmodule.exports = AlignmentPatternFinder;","/*\r\n Ported to JavaScript by Lazar Laszlo 2011 \r\n \r\n lazarsoft@gmail.com, www.lazarsoft.info\r\n \r\n*/\r\n\r\nvar MIN_SKIP = 3;\r\nvar MAX_MODULES = 57;\r\nvar INTEGER_MATH_SHIFT = 8;\r\nvar CENTER_QUORUM = 2;\r\n\r\nvar orderBestPatterns = function (patterns) {\r\n\r\n\tfunction distance(pattern1, pattern2) {\r\n\t\tvar xDiff = pattern1.X - pattern2.X;\r\n\t\tvar yDiff = pattern1.Y - pattern2.Y;\r\n\t\treturn Math.sqrt((xDiff * xDiff + yDiff * yDiff));\r\n\t}\r\n\r\n\t/// Returns the z component of the cross product between vectors BC and BA.\r\n\tfunction crossProductZ(pointA, pointB, pointC) {\r\n\t\tvar bX = pointB.x;\r\n\t\tvar bY = pointB.y;\r\n\t\treturn ((pointC.x - bX) * (pointA.y - bY)) - ((pointC.y - bY) * (pointA.x - bX));\r\n\t}\r\n\r\n\r\n\t// Find distances between pattern centers\r\n\tvar zeroOneDistance = distance(patterns[0], patterns[1]);\r\n\tvar oneTwoDistance = distance(patterns[1], patterns[2]);\r\n\tvar zeroTwoDistance = distance(patterns[0], patterns[2]);\r\n\r\n\tvar pointA, pointB, pointC;\r\n\t// Assume one closest to other two is B; A and C will just be guesses at first\r\n\tif (oneTwoDistance >= zeroOneDistance && oneTwoDistance >= zeroTwoDistance) {\r\n\t\tpointB = patterns[0];\r\n\t\tpointA = patterns[1];\r\n\t\tpointC = patterns[2];\r\n\t}\r\n\telse if (zeroTwoDistance >= oneTwoDistance && zeroTwoDistance >= zeroOneDistance) {\r\n\t\tpointB = patterns[1];\r\n\t\tpointA = patterns[0];\r\n\t\tpointC = patterns[2];\r\n\t}\r\n\telse {\r\n\t\tpointB = patterns[2];\r\n\t\tpointA = patterns[0];\r\n\t\tpointC = patterns[1];\r\n\t}\r\n\r\n\t// Use cross product to figure out whether A and C are correct or flipped.\r\n\t// This asks whether BC x BA has a positive z component, which is the arrangement\r\n\t// we want for A, B, C. If it's negative, then we've got it flipped around and\r\n\t// should swap A and C.\r\n\tif (crossProductZ(pointA, pointB, pointC) < 0.0) {\r\n\t\tvar temp = pointA;\r\n\t\tpointA = pointC;\r\n\t\tpointC = temp;\r\n\t}\r\n\r\n\tpatterns[0] = pointA;\r\n\tpatterns[1] = pointB;\r\n\tpatterns[2] = pointC;\r\n}\r\n\r\n\r\nfunction FinderPattern(posX, posY, estimatedModuleSize) {\r\n\tthis.x = posX;\r\n\tthis.y = posY;\r\n\tthis.count = 1;\r\n\tthis.estimatedModuleSize = estimatedModuleSize;\r\n\r\n\tthis.__defineGetter__(\"EstimatedModuleSize\", function () {\r\n\t\treturn this.estimatedModuleSize;\r\n\t});\r\n\tthis.__defineGetter__(\"Count\", function () {\r\n\t\treturn this.count;\r\n\t});\r\n\tthis.__defineGetter__(\"X\", function () {\r\n\t\treturn this.x;\r\n\t});\r\n\tthis.__defineGetter__(\"Y\", function () {\r\n\t\treturn this.y;\r\n\t});\r\n\tthis.incrementCount = function () {\r\n\t\tthis.count++;\r\n\t}\r\n\tthis.aboutEquals = function (moduleSize, i, j) {\r\n\t\tif (Math.abs(i - this.y) <= moduleSize && Math.abs(j - this.x) <= moduleSize) {\r\n\t\t\tvar moduleSizeDiff = Math.abs(moduleSize - this.estimatedModuleSize);\r\n\t\t\treturn moduleSizeDiff <= 1.0 || moduleSizeDiff / this.estimatedModuleSize <= 1.0;\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n}\r\n\r\nfunction FinderPatternInfo(patternCenters) {\r\n\tthis.bottomLeft = patternCenters[0];\r\n\tthis.topLeft = patternCenters[1];\r\n\tthis.topRight = patternCenters[2];\r\n\tthis.__defineGetter__(\"BottomLeft\", function () {\r\n\t\treturn this.bottomLeft;\r\n\t});\r\n\tthis.__defineGetter__(\"TopLeft\", function () {\r\n\t\treturn this.topLeft;\r\n\t});\r\n\tthis.__defineGetter__(\"TopRight\", function () {\r\n\t\treturn this.topRight;\r\n\t});\r\n}\r\n\r\nfunction FinderPatternFinder(base) {\r\n\tthis.image = null;\r\n\tthis.possibleCenters = [];\r\n\tthis.hasSkipped = false;\r\n\tthis.crossCheckStateCount = new Array(0, 0, 0, 0, 0);\r\n\tthis.resultPointCallback = null;\r\n\r\n\tthis.__defineGetter__(\"CrossCheckStateCount\", function () {\r\n\t\tthis.crossCheckStateCount[0] = 0;\r\n\t\tthis.crossCheckStateCount[1] = 0;\r\n\t\tthis.crossCheckStateCount[2] = 0;\r\n\t\tthis.crossCheckStateCount[3] = 0;\r\n\t\tthis.crossCheckStateCount[4] = 0;\r\n\t\treturn this.crossCheckStateCount;\r\n\t});\r\n\r\n\tthis.foundPatternCross = function (stateCount) {\r\n\t\tvar totalModuleSize = 0;\r\n\t\tfor (var i = 0; i < 5; i++) {\r\n\t\t\tvar count = stateCount[i];\r\n\t\t\tif (count == 0) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t\ttotalModuleSize += count;\r\n\t\t}\r\n\t\tif (totalModuleSize < 7) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tvar moduleSize = Math.floor((totalModuleSize << INTEGER_MATH_SHIFT) / 7);\r\n\t\tvar maxVariance = Math.floor(moduleSize / 2);\r\n\t\t// Allow less than 50% variance from 1-1-3-1-1 proportions\r\n\t\treturn Math.abs(moduleSize - (stateCount[0] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[1] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(3 * moduleSize - (stateCount[2] << INTEGER_MATH_SHIFT)) < 3 * maxVariance && Math.abs(moduleSize - (stateCount[3] << INTEGER_MATH_SHIFT)) < maxVariance && Math.abs(moduleSize - (stateCount[4] << INTEGER_MATH_SHIFT)) < maxVariance;\r\n\t}\r\n\tthis.centerFromEnd = function (stateCount, end) {\r\n\t\treturn (end - stateCount[4] - stateCount[3]) - stateCount[2] / 2.0;\r\n\t}\r\n\tthis.crossCheckVertical = function (startI, centerJ, maxCount, originalStateCountTotal) {\r\n\t\tvar image = this.image;\r\n\r\n\t\tvar maxI = base.height;\r\n\t\tvar stateCount = this.CrossCheckStateCount;\r\n\r\n\t\t// Start counting up from center\r\n\t\tvar i = startI;\r\n\t\twhile (i >= 0 && image[centerJ + i * base.width]) {\r\n\t\t\tstateCount[2]++;\r\n\t\t\ti--;\r\n\t\t}\r\n\t\tif (i < 0) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i >= 0 && !image[centerJ + i * base.width] && stateCount[1] <= maxCount) {\r\n\t\t\tstateCount[1]++;\r\n\t\t\ti--;\r\n\t\t}\r\n\t\t// If already too many modules in this state or ran off the edge:\r\n\t\tif (i < 0 || stateCount[1] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i >= 0 && image[centerJ + i * base.width] && stateCount[0] <= maxCount) {\r\n\t\t\tstateCount[0]++;\r\n\t\t\ti--;\r\n\t\t}\r\n\t\tif (stateCount[0] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\t// Now also count down from center\r\n\t\ti = startI + 1;\r\n\t\twhile (i < maxI && image[centerJ + i * base.width]) {\r\n\t\t\tstateCount[2]++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tif (i == maxI) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i < maxI && !image[centerJ + i * base.width] && stateCount[3] < maxCount) {\r\n\t\t\tstateCount[3]++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tif (i == maxI || stateCount[3] >= maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (i < maxI && image[centerJ + i * base.width] && stateCount[4] < maxCount) {\r\n\t\t\tstateCount[4]++;\r\n\t\t\ti++;\r\n\t\t}\r\n\t\tif (stateCount[4] >= maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\t// If we found a finder-pattern-like section, but its size is more than 40% different than\r\n\t\t// the original, assume it's a false positive\r\n\t\tvar stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];\r\n\t\tif (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\treturn this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, i) : NaN;\r\n\t}\r\n\tthis.crossCheckHorizontal = function (startJ, centerI, maxCount, originalStateCountTotal) {\r\n\t\tvar image = this.image;\r\n\r\n\t\tvar maxJ = base.width;\r\n\t\tvar stateCount = this.CrossCheckStateCount;\r\n\r\n\t\tvar j = startJ;\r\n\t\twhile (j >= 0 && image[j + centerI * base.width]) {\r\n\t\t\tstateCount[2]++;\r\n\t\t\tj--;\r\n\t\t}\r\n\t\tif (j < 0) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (j >= 0 && !image[j + centerI * base.width] && stateCount[1] <= maxCount) {\r\n\t\t\tstateCount[1]++;\r\n\t\t\tj--;\r\n\t\t}\r\n\t\tif (j < 0 || stateCount[1] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (j >= 0 && image[j + centerI * base.width] && stateCount[0] <= maxCount) {\r\n\t\t\tstateCount[0]++;\r\n\t\t\tj--;\r\n\t\t}\r\n\t\tif (stateCount[0] > maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\tj = startJ + 1;\r\n\t\twhile (j < maxJ && image[j + centerI * base.width]) {\r\n\t\t\tstateCount[2]++;\r\n\t\t\tj++;\r\n\t\t}\r\n\t\tif (j == maxJ) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (j < maxJ && !image[j + centerI * base.width] && stateCount[3] < maxCount) {\r\n\t\t\tstateCount[3]++;\r\n\t\t\tj++;\r\n\t\t}\r\n\t\tif (j == maxJ || stateCount[3] >= maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\t\twhile (j < maxJ && image[j + centerI * base.width] && stateCount[4] < maxCount) {\r\n\t\t\tstateCount[4]++;\r\n\t\t\tj++;\r\n\t\t}\r\n\t\tif (stateCount[4] >= maxCount) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\t// If we found a finder-pattern-like section, but its size is significantly different than\r\n\t\t// the original, assume it's a false positive\r\n\t\tvar stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];\r\n\t\tif (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal) {\r\n\t\t\treturn NaN;\r\n\t\t}\r\n\r\n\t\treturn this.foundPatternCross(stateCount) ? this.centerFromEnd(stateCount, j) : NaN;\r\n\t}\r\n\tthis.handlePossibleCenter = function (stateCount, i, j) {\r\n\t\tvar stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];\r\n\t\tvar centerJ = this.centerFromEnd(stateCount, j); //float\r\n\t\tvar centerI = this.crossCheckVertical(i, Math.floor(centerJ), stateCount[2], stateCountTotal); //float\r\n\t\tif (!isNaN(centerI)) {\r\n\t\t\t// Re-cross check\r\n\t\t\tcenterJ = this.crossCheckHorizontal(Math.floor(centerJ), Math.floor(centerI), stateCount[2], stateCountTotal);\r\n\t\t\tif (!isNaN(centerJ)) {\r\n\t\t\t\tvar estimatedModuleSize = stateCountTotal / 7.0;\r\n\t\t\t\tvar found = false;\r\n\t\t\t\tvar max = this.possibleCenters.length;\r\n\t\t\t\tfor (var index = 0; index < max; index++) {\r\n\t\t\t\t\tvar center = this.possibleCenters[index];\r\n\t\t\t\t\t// Look for about the same center and module size:\r\n\t\t\t\t\tif (center.aboutEquals(estimatedModuleSize, centerI, centerJ)) {\r\n\t\t\t\t\t\tcenter.incrementCount();\r\n\t\t\t\t\t\tfound = true;\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif (!found) {\r\n\t\t\t\t\tvar point = new FinderPattern(centerJ, centerI, estimatedModuleSize);\r\n\t\t\t\t\tthis.possibleCenters.push(point);\r\n\t\t\t\t\tif (this.resultPointCallback != null) {\r\n\t\t\t\t\t\tthis.resultPointCallback.foundPossibleResultPoint(point);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}\r\n\r\n\tthis.selectBestPatterns = function () {\r\n\r\n\t\tvar startSize = this.possibleCenters.length;\r\n\t\tif (startSize < 3) {\r\n\t\t\t// Couldn't find enough finder patterns\r\n\t\t\tthrow \"Couldn't find enough finder patterns (found \" + startSize + \")\"\r\n\t\t}\r\n\r\n\t\t// Filter outlier possibilities whose module size is too different\r\n\t\tif (startSize > 3) {\r\n\t\t\t// But we can only afford to do so if we have at least 4 possibilities to choose from\r\n\t\t\tvar totalModuleSize = 0.0;\r\n\t\t\tvar square = 0.0;\r\n\t\t\tfor (var i = 0; i < startSize; i++) {\r\n\t\t\t\t//totalModuleSize += this.possibleCenters[i].EstimatedModuleSize;\r\n\t\t\t\tvar centerValue = this.possibleCenters[i].EstimatedModuleSize;\r\n\t\t\t\ttotalModuleSize += centerValue;\r\n\t\t\t\tsquare += (centerValue * centerValue);\r\n\t\t\t}\r\n\t\t\tvar average = totalModuleSize / startSize;\r\n\t\t\tthis.possibleCenters.sort(function (center1, center2) {\r\n\t\t\t\tvar dA = Math.abs(center2.EstimatedModuleSize - average);\r\n\t\t\t\tvar dB = Math.abs(center1.EstimatedModuleSize - average);\r\n\t\t\t\tif (dA < dB) {\r\n\t\t\t\t\treturn (-1);\r\n\t\t\t\t} else if (dA == dB) {\r\n\t\t\t\t\treturn 0;\r\n\t\t\t\t} else {\r\n\t\t\t\t\treturn 1;\r\n\t\t\t\t}\r\n\t\t\t});\r\n\r\n\t\t\tvar stdDev = Math.sqrt(square / startSize - average * average);\r\n\t\t\tvar limit = Math.max(0.2 * average, stdDev);\r\n\t\t\t//for (var i = 0; i < this.possibleCenters.length && this.possibleCenters.length > 3; i++)\r\n\t\t\tfor (var i = this.possibleCenters.length - 1; i >= 0; i--) {\r\n\t\t\t\tvar pattern = this.possibleCenters[i];\r\n\t\t\t\t//if (Math.abs(pattern.EstimatedModuleSize - average) > 0.2 * average)\r\n\t\t\t\tif (Math.abs(pattern.EstimatedModuleSize - average) > limit) {\r\n\t\t\t\t\t//this.possibleCenters.remove(i);\r\n\t\t\t\t\tthis.possibleCenters.splice(i, 1);\r\n\t\t\t\t\t//i--;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (this.possibleCenters.length > 3) {\r\n\t\t\t// Throw away all but those first size candidate points we found.\r\n\t\t\tthis.possibleCenters.sort(function (a, b) {\r\n\t\t\t\tif (a.count > b.count) { return -1; }\r\n\t\t\t\tif (a.count < b.count) { return 1; }\r\n\t\t\t\treturn 0;\r\n\t\t\t});\r\n\t\t}\r\n\r\n\t\treturn new Array(this.possibleCenters[0], this.possibleCenters[1], this.possibleCenters[2]);\r\n\t}\r\n\r\n\tthis.findRowSkip = function () {\r\n\t\tvar max = this.possibleCenters.length;\r\n\t\tif (max <= 1) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tvar firstConfirmedCenter = null;\r\n\t\tfor (var i = 0; i < max; i++) {\r\n\t\t\tvar center = this.possibleCenters[i];\r\n\t\t\tif (center.Count >= CENTER_QUORUM) {\r\n\t\t\t\tif (firstConfirmedCenter == null) {\r\n\t\t\t\t\tfirstConfirmedCenter = center;\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t// We have two confirmed centers\r\n\t\t\t\t\t// How far down can we skip before resuming looking for the next\r\n\t\t\t\t\t// pattern? In the worst case, only the difference between the\r\n\t\t\t\t\t// difference in the x / y coordinates of the two centers.\r\n\t\t\t\t\t// This is the case where you find top left last.\r\n\t\t\t\t\tthis.hasSkipped = true;\r\n\t\t\t\t\treturn Math.floor((Math.abs(firstConfirmedCenter.X - center.X) - Math.abs(firstConfirmedCenter.Y - center.Y)) / 2);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn 0;\r\n\t}\r\n\r\n\tthis.haveMultiplyConfirmedCenters = function () {\r\n\t\tvar confirmedCount = 0;\r\n\t\tvar totalModuleSize = 0.0;\r\n\t\tvar max = this.possibleCenters.length;\r\n\t\tfor (var i = 0; i < max; i++) {\r\n\t\t\tvar pattern = this.possibleCenters[i];\r\n\t\t\tif (pattern.Count >= CENTER_QUORUM) {\r\n\t\t\t\tconfirmedCount++;\r\n\t\t\t\ttotalModuleSize += pattern.EstimatedModuleSize;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (confirmedCount < 3) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\t// OK, we have at least 3 confirmed centers, but, it's possible that one is a \"false positive\"\r\n\t\t// and that we need to keep looking. We detect this by asking if the estimated module sizes\r\n\t\t// vary too much. We arbitrarily say that when the total deviation from average exceeds\r\n\t\t// 5% of the total module size estimates, it's too much.\r\n\t\tvar average = totalModuleSize / max;\r\n\t\tvar totalDeviation = 0.0;\r\n\t\tfor (var i = 0; i < max; i++) {\r\n\t\t\tpattern = this.possibleCenters[i];\r\n\t\t\ttotalDeviation += Math.abs(pattern.EstimatedModuleSize - average);\r\n\t\t}\r\n\t\treturn totalDeviation <= 0.05 * totalModuleSize;\r\n\t}\r\n\r\n\tthis.findFinderPattern = function (image) {\r\n\t\tvar tryHarder = false;\r\n\t\tthis.image = image;\r\n\t\tvar maxI = base.height;\r\n\t\tvar maxJ = base.width;\r\n\t\tvar iSkip = Math.floor((3 * maxI) / (4 * MAX_MODULES));\r\n\t\tif (iSkip < MIN_SKIP || tryHarder) {\r\n\t\t\tiSkip = MIN_SKIP;\r\n\t\t}\r\n\r\n\t\tvar done = false;\r\n\t\tvar stateCount = new Array(5);\r\n\t\tfor (var i = iSkip - 1; i < maxI && !done; i += iSkip) {\r\n\t\t\t// Get a row of black/white values\r\n\t\t\tstateCount[0] = 0;\r\n\t\t\tstateCount[1] = 0;\r\n\t\t\tstateCount[2] = 0;\r\n\t\t\tstateCount[3] = 0;\r\n\t\t\tstateCount[4] = 0;\r\n\t\t\tvar currentState = 0;\r\n\t\t\tfor (var j = 0; j < maxJ; j++) {\r\n\t\t\t\tif (image[j + i * base.width]) {\r\n\t\t\t\t\t// Black pixel\r\n\t\t\t\t\tif ((currentState & 1) == 1) {\r\n\t\t\t\t\t\t// Counting white pixels\r\n\t\t\t\t\t\tcurrentState++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\tstateCount[currentState]++;\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t// White pixel\r\n\t\t\t\t\tif ((currentState & 1) == 0) {\r\n\t\t\t\t\t\t// Counting black pixels\r\n\t\t\t\t\t\tif (currentState == 4) {\r\n\t\t\t\t\t\t\t// A winner?\r\n\t\t\t\t\t\t\tif (this.foundPatternCross(stateCount)) {\r\n\t\t\t\t\t\t\t\t// Yes\r\n\t\t\t\t\t\t\t\tvar confirmed = this.handlePossibleCenter(stateCount, i, j);\r\n\t\t\t\t\t\t\t\tif (confirmed) {\r\n\t\t\t\t\t\t\t\t\t// Start examining every other line. Checking each line turned out to be too\r\n\t\t\t\t\t\t\t\t\t// expensive and didn't improve performance.\r\n\t\t\t\t\t\t\t\t\tiSkip = 2;\r\n\t\t\t\t\t\t\t\t\tif (this.hasSkipped) {\r\n\t\t\t\t\t\t\t\t\t\tdone = this.haveMultiplyConfirmedCenters();\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\t\tvar rowSkip = this.findRowSkip();\r\n\t\t\t\t\t\t\t\t\t\tif (rowSkip > stateCount[2]) {\r\n\t\t\t\t\t\t\t\t\t\t\t// Skip rows between row of lower confirmed center\r\n\t\t\t\t\t\t\t\t\t\t\t// and top of presumed third confirmed center\r\n\t\t\t\t\t\t\t\t\t\t\t// but back up a bit to get a full chance of detecting\r\n\t\t\t\t\t\t\t\t\t\t\t// it, entire width of center of finder pattern\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t// Skip by rowSkip, but back off by stateCount[2] (size of last center\r\n\t\t\t\t\t\t\t\t\t\t\t// of pattern we saw) to be conservative, and also back off by iSkip which\r\n\t\t\t\t\t\t\t\t\t\t\t// is about to be re-added\r\n\t\t\t\t\t\t\t\t\t\t\ti += rowSkip - stateCount[2] - iSkip;\r\n\t\t\t\t\t\t\t\t\t\t\tj = maxJ - 1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\t// Advance to next black pixel\r\n\t\t\t\t\t\t\t\t\tdo {\r\n\t\t\t\t\t\t\t\t\t\tj++;\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\twhile (j < maxJ && !image[j + i * base.width]);\r\n\t\t\t\t\t\t\t\t\tj--; // back up to that last white pixel\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t// Clear state to start looking again\r\n\t\t\t\t\t\t\t\tcurrentState = 0;\r\n\t\t\t\t\t\t\t\tstateCount[0] = 0;\r\n\t\t\t\t\t\t\t\tstateCount[1] = 0;\r\n\t\t\t\t\t\t\t\tstateCount[2] = 0;\r\n\t\t\t\t\t\t\t\tstateCount[3] = 0;\r\n\t\t\t\t\t\t\t\tstateCount[4] = 0;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t// No, shift counts back by two\r\n\t\t\t\t\t\t\t\tstateCount[0] = stateCount[2];\r\n\t\t\t\t\t\t\t\tstateCount[1] = stateCount[3];\r\n\t\t\t\t\t\t\t\tstateCount[2] = stateCount[4];\r\n\t\t\t\t\t\t\t\tstateCount[3] = 1;\r\n\t\t\t\t\t\t\t\tstateCount[4] = 0;\r\n\t\t\t\t\t\t\t\tcurrentState = 3;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\tstateCount[++currentState]++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse {\r\n\t\t\t\t\t\t// Counting white pixels\r\n\t\t\t\t\t\tstateCount[currentState]++;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (this.foundPatternCross(stateCount)) {\r\n\t\t\t\tvar confirmed = this.handlePossibleCenter(stateCount, i, maxJ);\r\n\t\t\t\tif (confirmed) {\r\n\t\t\t\t\tiSkip = stateCount[0];\r\n\t\t\t\t\tif (this.hasSkipped) {\r\n\t\t\t\t\t\t// Found a third one\r\n\t\t\t\t\t\tdone = this.haveMultiplyConfirmedCenters();\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tvar patternInfo = this.selectBestPatterns();\r\n\t\torderBestPatterns(patternInfo);\r\n\r\n\t\treturn new FinderPatternInfo(patternInfo);\r\n\t};\r\n}\r\n\r\nmodule.exports = FinderPatternFinder;","exports.URShift = function URShift(number, bits) {\n if (number >= 0)\n return number >> bits;\n else\n return (number >> bits) + (2 << ~bits);\n}\n","function ErrorCorrectionLevel(ordinal, bits, name) {\r\n\tthis.ordinal_Renamed_Field = ordinal;\r\n\tthis.bits = bits;\r\n\tthis.name = name;\r\n\tthis.__defineGetter__(\"Bits\", function () {\r\n\t\treturn this.bits;\r\n\t});\r\n\tthis.__defineGetter__(\"Name\", function () {\r\n\t\treturn this.name;\r\n\t});\r\n\tthis.ordinal = function () {\r\n\t\treturn this.ordinal_Renamed_Field;\r\n\t}\r\n}\r\n\r\nvar L = new ErrorCorrectionLevel(0, 0x01, \"L\");\r\nvar M = new ErrorCorrectionLevel(1, 0x00, \"M\");\r\nvar Q = new ErrorCorrectionLevel(2, 0x03, \"Q\");\r\nvar H = new ErrorCorrectionLevel(3, 0x02, \"H\");\r\nvar FOR_BITS = new Array(M, L, H, Q);\r\n\r\nmodule.exports = function (bits) {\r\n\tif (bits < 0 || bits >= FOR_BITS.length) {\r\n\t\tthrow \"ArgumentException\";\r\n\t}\r\n\treturn FOR_BITS[bits];\r\n}","var utils = require('../utils')\r\nvar getErrorCorrectionLevel = require('./ErrorLevel')\r\nvar URShift = utils.URShift;\r\n\r\nvar FORMAT_INFO_MASK_QR = 0x5412;\r\nvar FORMAT_INFO_DECODE_LOOKUP = new Array(new Array(0x5412, 0x00), new Array(0x5125, 0x01), new Array(0x5E7C, 0x02), new Array(0x5B4B, 0x03), new Array(0x45F9, 0x04), new Array(0x40CE, 0x05), new Array(0x4F97, 0x06), new Array(0x4AA0, 0x07), new Array(0x77C4, 0x08), new Array(0x72F3, 0x09), new Array(0x7DAA, 0x0A), new Array(0x789D, 0x0B), new Array(0x662F, 0x0C), new Array(0x6318, 0x0D), new Array(0x6C41, 0x0E), new Array(0x6976, 0x0F), new Array(0x1689, 0x10), new Array(0x13BE, 0x11), new Array(0x1CE7, 0x12), new Array(0x19D0, 0x13), new Array(0x0762, 0x14), new Array(0x0255, 0x15), new Array(0x0D0C, 0x16), new Array(0x083B, 0x17), new Array(0x355F, 0x18), new Array(0x3068, 0x19), new Array(0x3F31, 0x1A), new Array(0x3A06, 0x1B), new Array(0x24B4, 0x1C), new Array(0x2183, 0x1D), new Array(0x2EDA, 0x1E), new Array(0x2BED, 0x1F));\r\nvar BITS_SET_IN_HALF_BYTE = new Array(0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4);\r\n\r\n\r\nfunction FormatInformation(formatInfo) {\r\n\tthis.errorCorrectionLevel = getErrorCorrectionLevel((formatInfo >> 3) & 0x03);\r\n\tthis.dataMask = (formatInfo & 0x07);\r\n\r\n\tthis.__defineGetter__(\"ErrorCorrectionLevel\", function () {\r\n\t\treturn this.errorCorrectionLevel;\r\n\t});\r\n\tthis.__defineGetter__(\"DataMask\", function () {\r\n\t\treturn this.dataMask;\r\n\t});\r\n\tthis.GetHashCode = function () {\r\n\t\treturn (this.errorCorrectionLevel.ordinal() << 3) | this.dataMask;\r\n\t}\r\n\tthis.Equals = function (o) {\r\n\t\tvar other = o;\r\n\t\treturn this.errorCorrectionLevel == other.errorCorrectionLevel && this.dataMask == other.dataMask;\r\n\t}\r\n}\r\n\r\nFormatInformation.numBitsDiffering = function (a, b) {\r\n\ta ^= b; // a now has a 1 bit exactly where its bit differs with b's\r\n\t// Count bits set quickly with a series of lookups:\r\n\treturn BITS_SET_IN_HALF_BYTE[a & 0x0F] + BITS_SET_IN_HALF_BYTE[(URShift(a, 4) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 8) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 12) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 16) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 20) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 24) & 0x0F)] + BITS_SET_IN_HALF_BYTE[(URShift(a, 28) & 0x0F)];\r\n}\r\n\r\nFormatInformation.decodeFormatInformation = function (maskedFormatInfo) {\r\n\tvar formatInfo = FormatInformation.doDecodeFormatInformation(maskedFormatInfo);\r\n\tif (formatInfo != null) {\r\n\t\treturn formatInfo;\r\n\t}\r\n\t// Should return null, but, some QR codes apparently\r\n\t// do not mask this info. Try again by actually masking the pattern\r\n\t// first\r\n\treturn FormatInformation.doDecodeFormatInformation(maskedFormatInfo ^ FORMAT_INFO_MASK_QR);\r\n}\r\n\r\nFormatInformation.doDecodeFormatInformation = function (maskedFormatInfo) {\r\n\t// Find the int in FORMAT_INFO_DECODE_LOOKUP with fewest bits differing\r\n\tvar bestDifference = 0xffffffff;\r\n\tvar bestFormatInfo = 0;\r\n\tfor (var i = 0; i < FORMAT_INFO_DECODE_LOOKUP.length; i++) {\r\n\t\tvar decodeInfo = FORMAT_INFO_DECODE_LOOKUP[i];\r\n\t\tvar targetInfo = decodeInfo[0];\r\n\t\tif (targetInfo == maskedFormatInfo) {\r\n\t\t\t// Found an exact match\r\n\t\t\treturn new FormatInformation(decodeInfo[1]);\r\n\t\t}\r\n\t\tvar bitsDifference = this.numBitsDiffering(maskedFormatInfo, targetInfo);\r\n\t\tif (bitsDifference < bestDifference) {\r\n\t\t\tbestFormatInfo = decodeInfo[1];\r\n\t\t\tbestDifference = bitsDifference;\r\n\t\t}\r\n\t}\r\n\t// Hamming distance of the 32 masked codes is 7, by construction, so <= 3 bits\r\n\t// differing means we found a match\r\n\tif (bestDifference <= 3) {\r\n\t\treturn new FormatInformation(bestFormatInfo);\r\n\t}\r\n\treturn null;\r\n}\r\n\r\nmodule.exports = FormatInformation;\r\n","var utils = require('../utils');\r\nvar URShift = utils.URShift;\r\n\r\nfunction BitMatrix(width, height) {\r\n\tif (!height)\r\n\t\theight = width;\r\n\tif (width < 1 || height < 1) {\r\n\t\tthrow \"Both dimensions must be greater than 0\";\r\n\t}\r\n\tthis.width = width;\r\n\tthis.height = height;\r\n\tvar rowSize = width >> 5;\r\n\tif ((width & 0x1f) != 0) {\r\n\t\trowSize++;\r\n\t}\r\n\tthis.rowSize = rowSize;\r\n\tthis.bits = new Array(rowSize * height);\r\n\tfor (var i = 0; i < this.bits.length; i++)\r\n\t\tthis.bits[i] = 0;\r\n\r\n\tthis.__defineGetter__(\"Width\", function () {\r\n\t\treturn this.width;\r\n\t});\r\n\tthis.__defineGetter__(\"Height\", function () {\r\n\t\treturn this.height;\r\n\t});\r\n\tthis.__defineGetter__(\"Dimension\", function () {\r\n\t\tif (this.width != this.height) {\r\n\t\t\tthrow \"Can't call getDimension() on a non-square matrix\";\r\n\t\t}\r\n\t\treturn this.width;\r\n\t});\r\n\r\n\tthis.get_Renamed = function (x, y) {\r\n\t\tvar offset = y * this.rowSize + (x >> 5);\r\n\t\treturn ((URShift(this.bits[offset], (x & 0x1f))) & 1) != 0;\r\n\t}\r\n\tthis.set_Renamed = function (x, y) {\r\n\t\tvar offset = y * this.rowSize + (x >> 5);\r\n\t\tthis.bits[offset] |= 1 << (x & 0x1f);\r\n\t}\r\n\tthis.flip = function (x, y) {\r\n\t\tvar offset = y * this.rowSize + (x >> 5);\r\n\t\tthis.bits[offset] ^= 1 << (x & 0x1f);\r\n\t}\r\n\tthis.clear = function () {\r\n\t\tvar max = this.bits.length;\r\n\t\tfor (var i = 0; i < max; i++) {\r\n\t\t\tthis.bits[i] = 0;\r\n\t\t}\r\n\t}\r\n\tthis.setRegion = function (left, top, width, height) {\r\n\t\tif (top < 0 || left < 0) {\r\n\t\t\tthrow \"Left and top must be nonnegative\";\r\n\t\t}\r\n\t\tif (height < 1 || width < 1) {\r\n\t\t\tthrow \"Height and width must be at least 1\";\r\n\t\t}\r\n\t\tvar right = left + width;\r\n\t\tvar bottom = top + height;\r\n\t\tif (bottom > this.height || right > this.width) {\r\n\t\t\tthrow \"The region must fit inside the matrix\";\r\n\t\t}\r\n\t\tfor (var y = top; y < bottom; y++) {\r\n\t\t\tvar offset = y * this.rowSize;\r\n\t\t\tfor (var x = left; x < right; x++) {\r\n\t\t\t\tthis.bits[offset + (x >> 5)] |= 1 << (x & 0x1f);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\nmodule.exports = BitMatrix;","var FormatInformation = require('./FormatInformation')\r\nvar BitMatrix = require('./BitMatix')\r\n\r\nfunction ECB(count, dataCodewords) {\r\n\tthis.count = count;\r\n\tthis.dataCodewords = dataCodewords;\r\n\r\n\tthis.__defineGetter__(\"Count\", function () {\r\n\t\treturn this.count;\r\n\t});\r\n\tthis.__defineGetter__(\"DataCodewords\", function () {\r\n\t\treturn this.dataCodewords;\r\n\t});\r\n}\r\n\r\nfunction ECBlocks(ecCodewordsPerBlock, ecBlocks1, ecBlocks2) {\r\n\tthis.ecCodewordsPerBlock = ecCodewordsPerBlock;\r\n\tif (ecBlocks2)\r\n\t\tthis.ecBlocks = new Array(ecBlocks1, ecBlocks2);\r\n\telse\r\n\t\tthis.ecBlocks = new Array(ecBlocks1);\r\n\r\n\tthis.__defineGetter__(\"ECCodewordsPerBlock\", function () {\r\n\t\treturn this.ecCodewordsPerBlock;\r\n\t});\r\n\r\n\tthis.__defineGetter__(\"TotalECCodewords\", function () {\r\n\t\treturn this.ecCodewordsPerBlock * this.NumBlocks;\r\n\t});\r\n\r\n\tthis.__defineGetter__(\"NumBlocks\", function () {\r\n\t\tvar total = 0;\r\n\t\tfor (var i = 0; i < this.ecBlocks.length; i++) {\r\n\t\t\ttotal += this.ecBlocks[i].length;\r\n\t\t}\r\n\t\treturn total;\r\n\t});\r\n\r\n\tthis.getECBlocks = function () {\r\n\t\treturn this.ecBlocks;\r\n\t}\r\n}\r\n\r\nfunction Version(versionNumber, alignmentPatternCenters, ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4) {\r\n\tthis.versionNumber = versionNumber;\r\n\tthis.alignmentPatternCenters = alignmentPatternCenters;\r\n\tthis.ecBlocks = new Array(ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4);\r\n\r\n\tvar total = 0;\r\n\tvar ecCodewords = ecBlocks1.ECCodewordsPerBlock;\r\n\tvar ecbArray = ecBlocks1.getECBlocks();\r\n\tfor (var i = 0; i < ecbArray.length; i++) {\r\n\t\tvar ecBlock = ecbArray[i];\r\n\t\ttotal += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);\r\n\t}\r\n\tthis.totalCodewords = total;\r\n\r\n\tthis.__defineGetter__(\"VersionNumber\", function () {\r\n\t\treturn this.versionNumber;\r\n\t});\r\n\r\n\tthis.__defineGetter__(\"AlignmentPatternCenters\", function () {\r\n\t\treturn this.alignmentPatternCenters;\r\n\t});\r\n\tthis.__defineGetter__(\"TotalCodewords\", function () {\r\n\t\treturn this.totalCodewords;\r\n\t});\r\n\tthis.__defineGetter__(\"DimensionForVersion\", function () {\r\n\t\treturn 17 + 4 * this.versionNumber;\r\n\t});\r\n\r\n\tthis.buildFunctionPattern = function () {\r\n\t\tvar dimension = this.DimensionForVersion;\r\n\t\tvar bitMatrix = new BitMatrix(dimension);\r\n\r\n\t\t// Top left finder pattern + separator + format\r\n\t\tbitMatrix.setRegion(0, 0, 9, 9);\r\n\t\t// Top right finder pattern + separator + format\r\n\t\tbitMatrix.setRegion(dimension - 8, 0, 8, 9);\r\n\t\t// Bottom left finder pattern + separator + format\r\n\t\tbitMatrix.setRegion(0, dimension - 8, 9, 8);\r\n\r\n\t\t// Alignment patterns\r\n\t\tvar max = this.alignmentPatternCenters.length;\r\n\t\tfor (var x = 0; x < max; x++) {\r\n\t\t\tvar i = this.alignmentPatternCenters[x] - 2;\r\n\t\t\tfor (var y = 0; y < max; y++) {\r\n\t\t\t\tif ((x == 0 && (y == 0 || y == max - 1)) || (x == max - 1 && y == 0)) {\r\n\t\t\t\t\t// No alignment patterns near the three finder paterns\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\tbitMatrix.setRegion(this.alignmentPatternCenters[y] - 2, i, 5, 5);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// Vertical timing pattern\r\n\t\tbitMatrix.setRegion(6, 9, 1, dimension - 17);\r\n\t\t// Horizontal timing pattern\r\n\t\tbitMatrix.setRegion(9, 6, dimension - 17, 1);\r\n\r\n\t\tif (this.versionNumber > 6) {\r\n\t\t\t// Version info, top right\r\n\t\t\tbitMatrix.setRegion(dimension - 11, 0, 3, 6);\r\n\t\t\t// Version info, bottom left\r\n\t\t\tbitMatrix.setRegion(0, dimension - 11, 6, 3);\r\n\t\t}\r\n\r\n\t\treturn bitMatrix;\r\n\t}\r\n\tthis.getECBlocksForLevel = function (ecLevel) {\r\n\t\treturn this.ecBlocks[ecLevel.ordinal()];\r\n\t}\r\n}\r\n\r\nVersion.VERSION_DECODE_INFO = new Array(0x07C94, 0x085BC, 0x09A99, 0x0A4D3, 0x0BBF6, 0x0C762, 0x0D847, 0x0E60D, 0x0F928, 0x10B78, 0x1145D, 0x12A17, 0x13532, 0x149A6, 0x15683, 0x168C9, 0x177EC, 0x18EC4, 0x191E1, 0x1AFAB, 0x1B08E, 0x1CC1A, 0x1D33F, 0x1ED75, 0x1F250, 0x209D5, 0x216F0, 0x228BA, 0x2379F, 0x24B0B, 0x2542E, 0x26A64, 0x27541, 0x28C69);\r\n\r\nVersion.VERSIONS = buildVersions();\r\n\r\nVersion.getVersionForNumber = function (versionNumber) {\r\n\tif (versionNumber < 1 || versionNumber > 40) {\r\n\t\tthrow \"ArgumentException\";\r\n\t}\r\n\treturn Version.VERSIONS[versionNumber - 1];\r\n}\r\n\r\nVersion.getProvisionalVersionForDimension = function (dimension) {\r\n\tif (dimension % 4 != 1) {\r\n\t\tthrow \"Error getProvisionalVersionForDimension\";\r\n\t}\r\n\ttry {\r\n\t\treturn Version.getVersionForNumber((dimension - 17) >> 2);\r\n\t}\r\n\tcatch (iae) {\r\n\t\tthrow \"Error getVersionForNumber\";\r\n\t}\r\n}\r\n\r\nVersion.decodeVersionInformation = function (versionBits) {\r\n\tvar bestDifference = 0xffffffff;\r\n\tvar bestVersion = 0;\r\n\tfor (var i = 0; i < Version.VERSION_DECODE_INFO.length; i++) {\r\n\t\tvar targetVersion = Version.VERSION_DECODE_INFO[i];\r\n\t\t// Do the version info bits match exactly? done.\r\n\t\tif (targetVersion == versionBits) {\r\n\t\t\treturn this.getVersionForNumber(i + 7);\r\n\t\t}\r\n\t\t// Otherwise see if this is the closest to a real version info bit string\r\n\t\t// we have seen so far\r\n\t\tvar bitsDifference = FormatInformation.numBitsDiffering(versionBits, targetVersion);\r\n\t\tif (bitsDifference < bestDifference) {\r\n\t\t\tbestVersion = i + 7;\r\n\t\t\tbestDifference = bitsDifference;\r\n\t\t}\r\n\t}\r\n\t// We can tolerate up to 3 bits of error since no two version info codewords will\r\n\t// differ in less than 4 bits.\r\n\tif (bestDifference <= 3) {\r\n\t\treturn this.getVersionForNumber(bestVersion);\r\n\t}\r\n\t// If we didn't find a close enough match, fail\r\n\treturn null;\r\n}\r\n\r\nfunction buildVersions() {\r\n\treturn new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))),\r\n\t\tnew Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))),\r\n\t\tnew Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))),\r\n\t\tnew Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))),\r\n\t\tnew Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))),\r\n\t\tnew Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))),\r\n\t\tnew Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))),\r\n\t\tnew Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))),\r\n\t\tnew Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))),\r\n\t\tnew Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))),\r\n\t\tnew Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))),\r\n\t\tnew Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))),\r\n\t\tnew Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))),\r\n\t\tnew Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))),\r\n\t\tnew Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))),\r\n\t\tnew Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))),\r\n\t\tnew Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))),\r\n\t\tnew Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))),\r\n\t\tnew Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))),\r\n\t\tnew Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))),\r\n\t\tnew Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))),\r\n\t\tnew Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))),\r\n\t\tnew Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))),\r\n\t\tnew Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))),\r\n\t\tnew Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))),\r\n\t\tnew Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))),\r\n\t\tnew Version(27, new Array(6, 34, 62, 90, 118), new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15), new ECB(28, 16))),\r\n\t\tnew Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))),\r\n\t\tnew Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))),\r\n\t\tnew Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))),\r\n\t\tnew Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))),\r\n\t\tnew Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))),\r\n\t\tnew Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))),\r\n\t\tnew Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))),\r\n\t\tnew Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))),\r\n\t\tnew Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))),\r\n\t\tnew Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))),\r\n\t\tnew Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))),\r\n\t\tnew Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))),\r\n\t\tnew Version(40, new Array(6, 30, 58, 86, 114, 142, 170), new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16))));\r\n}\r\n\r\nmodule.exports = Version;","// var PerspectiveTransform = require('./PerspectiveTransform')\nvar BitMatrix = require('./BitMatix')\n\nvar GridSampler = {};\n\nGridSampler.checkAndNudgePoints = function (image, points, base) {\n\tvar width = base.width;\n\tvar height = base.height;\n\t// Check and nudge points from start until we see some that are OK:\n\tvar nudged = true;\n\tfor (var offset = 0; offset < points.length && nudged; offset += 2) {\n\t\tvar x = Math.floor(points[offset]);\n\t\tvar y = Math.floor(points[offset + 1]);\n\t\tif (x < - 1 || x > width || y < - 1 || y > height) {\n\t\t\tthrow \"Error.checkAndNudgePoints \";\n\t\t}\n\t\tnudged = false;\n\t\tif (x == - 1) {\n\t\t\tpoints[offset] = 0.0;\n\t\t\tnudged = true;\n\t\t}\n\t\telse if (x == width) {\n\t\t\tpoints[offset] = width - 1;\n\t\t\tnudged = true;\n\t\t}\n\t\tif (y == - 1) {\n\t\t\tpoints[offset + 1] = 0.0;\n\t\t\tnudged = true;\n\t\t}\n\t\telse if (y == height) {\n\t\t\tpoints[offset + 1] = height - 1;\n\t\t\tnudged = true;\n\t\t}\n\t}\n\t// Check and nudge points from end:\n\tnudged = true;\n\tfor (var offset = points.length - 2; offset >= 0 && nudged; offset -= 2) {\n\t\tvar x = Math.floor(points[offset]);\n\t\tvar y = Math.floor(points[offset + 1]);\n\t\tif (x < - 1 || x > width || y < - 1 || y > height) {\n\t\t\tthrow \"Error.checkAndNudgePoints \";\n\t\t}\n\t\tnudged = false;\n\t\tif (x == - 1) {\n\t\t\tpoints[offset] = 0.0;\n\t\t\tnudged = true;\n\t\t}\n\t\telse if (x == width) {\n\t\t\tpoints[offset] = width - 1;\n\t\t\tnudged = true;\n\t\t}\n\t\tif (y == - 1) {\n\t\t\tpoints[offset + 1] = 0.0;\n\t\t\tnudged = true;\n\t\t}\n\t\telse if (y == height) {\n\t\t\tpoints[offset + 1] = height - 1;\n\t\t\tnudged = true;\n\t\t}\n\t}\n}\n\nGridSampler.sampleGrid3 = function (image, base, dimension, transform) {\n\tvar bits = new BitMatrix(dimension);\n\tvar points = new Array(dimension << 1);\n\tfor (var y = 0; y < dimension; y++) {\n\t\tvar max = points.length;\n\t\tvar iValue = y + 0.5;\n\t\tfor (var x = 0; x < max; x += 2) {\n\t\t\tpoints[x] = (x >> 1) + 0.5;\n\t\t\tpoints[x + 1] = iValue;\n\t\t}\n\t\ttransform.transformPoints1(points);\n\t\t// Quick check to see if points transformed to something inside the image;\n\t\t// sufficient to check the endpoints\n\t\tGridSampler.checkAndNudgePoints(image, points, base);\n\t\ttry {\n\t\t\tfor (var x = 0; x < max; x += 2) {\n\t\t\t\t//var xpoint = (Math.floor( points[x]) * 4) + (Math.floor( points[x + 1]) * base.width * 4);\n\t\t\t\tvar bit = image[Math.floor(points[x]) + base.width * Math.floor(points[x + 1])];\n\t\t\t\t//qrcode.imagedata.data[xpoint] = bit?255:0;\n\t\t\t\t//qrcode.imagedata.data[xpoint+1] = bit?255:0;\n\t\t\t\t//qrcode.imagedata.data[xpoint+2] = 0;\n\t\t\t\t//qrcode.imagedata.data[xpoint+3] = 255;\n\t\t\t\t//bits[x >> 1][ y]=bit;\n\t\t\t\tif (bit)\n\t\t\t\t\tbits.set_Renamed(x >> 1, y);\n\t\t\t}\n\t\t}\n\t\tcatch (aioobe) {\n\t\t\t// This feels wrong, but, sometimes if the finder patterns are misidentified, the resulting\n\t\t\t// transform gets \"twisted\" such that it maps a straight line of points to a set of points\n\t\t\t// whose endpoints are in bounds, but others are not. There is probably some mathematical\n\t\t\t// way to detect this about the transformation that I don't know yet.\n\t\t\t// This results in an ugly runtime exception despite our clever checks above -- can't have\n\t\t\t// that. We could check each point's coordinates but that feels duplicative. We settle for\n\t\t\t// catching and wrapping ArrayIndexOutOfBoundsException.\n\t\t\tthrow \"Error.checkAndNudgePoints\";\n\t\t}\n\t}\n\treturn bits;\n}\n\n// GridSampler.sampleGridx = function (image, base, dimension, p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY) {\n// \tvar transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);\n\n// \treturn GridSampler.sampleGrid3(image, base, dimension, transform);\n// }\n\nmodule.exports = GridSampler;","function PerspectiveTransform(a11, a21, a31, a12, a22, a32, a13, a23, a33) {\n\tthis.a11 = a11;\n\tthis.a12 = a12;\n\tthis.a13 = a13;\n\tthis.a21 = a21;\n\tthis.a22 = a22;\n\tthis.a23 = a23;\n\tthis.a31 = a31;\n\tthis.a32 = a32;\n\tthis.a33 = a33;\n\tthis.transformPoints1 = function (points) {\n\t\tvar max = points.length;\n\t\tvar a11 = this.a11;\n\t\tvar a12 = this.a12;\n\t\tvar a13 = this.a13;\n\t\tvar a21 = this.a21;\n\t\tvar a22 = this.a22;\n\t\tvar a23 = this.a23;\n\t\tvar a31 = this.a31;\n\t\tvar a32 = this.a32;\n\t\tvar a33 = this.a33;\n\t\tfor (var i = 0; i < max; i += 2) {\n\t\t\tvar x = points[i];\n\t\t\tvar y = points[i + 1];\n\t\t\tvar denominator = a13 * x + a23 * y + a33;\n\t\t\tpoints[i] = (a11 * x + a21 * y + a31) / denominator;\n\t\t\tpoints[i + 1] = (a12 * x + a22 * y + a32) / denominator;\n\t\t}\n\t}\n\tthis.transformPoints2 = function (xValues, yValues) {\n\t\tvar n = xValues.length;\n\t\tfor (var i = 0; i < n; i++) {\n\t\t\tvar x = xValues[i];\n\t\t\tvar y = yValues[i];\n\t\t\tvar denominator = this.a13 * x + this.a23 * y + this.a33;\n\t\t\txValues[i] = (this.a11 * x + this.a21 * y + this.a31) / denominator;\n\t\t\tyValues[i] = (this.a12 * x + this.a22 * y + this.a32) / denominator;\n\t\t}\n\t}\n\n\tthis.buildAdjoint = function () {\n\t\t// Adjoint is the transpose of the cofactor matrix:\n\t\treturn new PerspectiveTransform(this.a22 * this.a33 - this.a23 * this.a32, this.a23 * this.a31 - this.a21 * this.a33, this.a21 * this.a32 - this.a22 * this.a31, this.a13 * this.a32 - this.a12 * this.a33, this.a11 * this.a33 - this.a13 * this.a31, this.a12 * this.a31 - this.a11 * this.a32, this.a12 * this.a23 - this.a13 * this.a22, this.a13 * this.a21 - this.a11 * this.a23, this.a11 * this.a22 - this.a12 * this.a21);\n\t}\n\tthis.times = function (other) {\n\t\treturn new PerspectiveTransform(this.a11 * other.a11 + this.a21 * other.a12 + this.a31 * other.a13, this.a11 * other.a21 + this.a21 * other.a22 + this.a31 * other.a23, this.a11 * other.a31 + this.a21 * other.a32 + this.a31 * other.a33, this.a12 * other.a11 + this.a22 * other.a12 + this.a32 * other.a13, this.a12 * other.a21 + this.a22 * other.a22 + this.a32 * other.a23, this.a12 * other.a31 + this.a22 * other.a32 + this.a32 * other.a33, this.a13 * other.a11 + this.a23 * other.a12 + this.a33 * other.a13, this.a13 * other.a21 + this.a23 * other.a22 + this.a33 * other.a23, this.a13 * other.a31 + this.a23 * other.a32 + this.a33 * other.a33);\n\t}\n\n}\n\nPerspectiveTransform.quadrilateralToQuadrilateral = function (x0, y0, x1, y1, x2, y2, x3, y3, x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p) {\n\n\tvar qToS = this.quadrilateralToSquare(x0, y0, x1, y1, x2, y2, x3, y3);\n\tvar sToQ = this.squareToQuadrilateral(x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p);\n\treturn sToQ.times(qToS);\n}\n\nPerspectiveTransform.squareToQuadrilateral = function (x0, y0, x1, y1, x2, y2, x3, y3) {\n\tvar dy2 = y3 - y2;\n\tvar dy3 = y0 - y1 + y2 - y3;\n\tif (dy2 == 0.0 && dy3 == 0.0) {\n\t\treturn new PerspectiveTransform(x1 - x0, x2 - x1, x0, y1 - y0, y2 - y1, y0, 0.0, 0.0, 1.0);\n\t}\n\telse {\n\t\tvar dx1 = x1 - x2;\n\t\tvar dx2 = x3 - x2;\n\t\tvar dx3 = x0 - x1 + x2 - x3;\n\t\tvar dy1 = y1 - y2;\n\t\tvar denominator = dx1 * dy2 - dx2 * dy1;\n\t\tvar a13 = (dx3 * dy2 - dx2 * dy3) / denominator;\n\t\tvar a23 = (dx1 * dy3 - dx3 * dy1) / denominator;\n\t\treturn new PerspectiveTransform(x1 - x0 + a13 * x1, x3 - x0 + a23 * x3, x0, y1 - y0 + a13 * y1, y3 - y0 + a23 * y3, y0, a13, a23, 1.0);\n\t}\n}\n\nPerspectiveTransform.quadrilateralToSquare = function (x0, y0, x1, y1, x2, y2, x3, y3) {\n\t// Here, the adjoint serves as the inverse:\n\treturn this.squareToQuadrilateral(x0, y0, x1, y1, x2, y2, x3, y3).buildAdjoint();\n}\n\nmodule.exports = PerspectiveTransform;","var AlignmentPatternFinder = require('./Alignment')\nvar FinderPatternFinder = require('./Findpat')\nvar Version = require('./Version')\nvar GridSampler = require('./GridSampler')\nvar PerspectiveTransform = require('./PerspectiveTransform')\n\nfunction DetectorResult(bits, points) {\n\tthis.bits = bits;\n\tthis.points = points;\n}\n\n\nfunction Detector(imageArray,base) {\n\tthis.image = imageArray;\n\tthis.resultPointCallback = null;\n\n\tthis.sizeOfBlackWhiteBlackRun = function (fromX, fromY, toX, toY) {\n\t\t// Mild variant of Bresenham's algorithm;\n\t\t// see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm\n\t\tvar steep = Math.abs(toY - fromY) > Math.abs(toX - fromX);\n\t\tif (steep) {\n\t\t\tvar temp = fromX;\n\t\t\tfromX = fromY;\n\t\t\tfromY = temp;\n\t\t\ttemp = toX;\n\t\t\ttoX = toY;\n\t\t\ttoY = temp;\n\t\t}\n\n\t\tvar dx = Math.abs(toX - fromX);\n\t\tvar dy = Math.abs(toY - fromY);\n\t\tvar error = - dx >> 1;\n\t\tvar ystep = fromY < toY ? 1 : - 1;\n\t\tvar xstep = fromX < toX ? 1 : - 1;\n\t\tvar state = 0; // In black pixels, looking for white, first or second time\n\t\tfor (var x = fromX, y = fromY; x != toX; x += xstep) {\n\n\t\t\tvar realX = steep ? y : x;\n\t\t\tvar realY = steep ? x : y;\n\t\t\tif (state == 1) {\n\t\t\t\t// In white pixels, looking for black\n\t\t\t\tif (this.image[realX + realY * base.width]) {\n\t\t\t\t\tstate++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (!this.image[realX + realY * base.width]) {\n\t\t\t\t\tstate++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (state == 3) {\n\t\t\t\t// Found black, white, black, and stumbled back onto white; done\n\t\t\t\tvar diffX = x - fromX;\n\t\t\t\tvar diffY = y - fromY;\n\t\t\t\treturn Math.sqrt((diffX * diffX + diffY * diffY));\n\t\t\t}\n\t\t\terror += dy;\n\t\t\tif (error > 0) {\n\t\t\t\tif (y == toY) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\ty += ystep;\n\t\t\t\terror -= dx;\n\t\t\t}\n\t\t}\n\t\tvar diffX2 = toX - fromX;\n\t\tvar diffY2 = toY - fromY;\n\t\treturn Math.sqrt((diffX2 * diffX2 + diffY2 * diffY2));\n\t}\n\n\n\tthis.sizeOfBlackWhiteBlackRunBothWays = function (fromX, fromY, toX, toY) {\n\n\t\tvar result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);\n\n\t\t// Now count other way -- don't run off image though of course\n\t\tvar scale = 1.0;\n\t\tvar otherToX = fromX - (toX - fromX);\n\t\tif (otherToX < 0) {\n\t\t\tscale = fromX / (fromX - otherToX);\n\t\t\totherToX = 0;\n\t\t}\n\t\telse if (otherToX >= base.width) {\n\t\t\tscale = (base.width - 1 - fromX) / (otherToX - fromX);\n\t\t\totherToX = base.width - 1;\n\t\t}\n\t\tvar otherToY = Math.floor(fromY - (toY - fromY) * scale);\n\n\t\tscale = 1.0;\n\t\tif (otherToY < 0) {\n\t\t\tscale = fromY / (fromY - otherToY);\n\t\t\totherToY = 0;\n\t\t}\n\t\telse if (otherToY >= base.height) {\n\t\t\tscale = (base.height - 1 - fromY) / (otherToY - fromY);\n\t\t\totherToY = base.height - 1;\n\t\t}\n\t\totherToX = Math.floor(fromX + (otherToX - fromX) * scale);\n\n\t\tresult += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);\n\t\treturn result - 1.0; // -1 because we counted the middle pixel twice\n\t}\n\n\n\n\tthis.calculateModuleSizeOneWay = function (pattern, otherPattern) {\n\t\tvar moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(pattern.X), Math.floor(pattern.Y), Math.floor(otherPattern.X), Math.floor(otherPattern.Y));\n\t\tvar moduleSizeEst2 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor(otherPattern.X), Math.floor(otherPattern.Y), Math.floor(pattern.X), Math.floor(pattern.Y));\n\t\tif (isNaN(moduleSizeEst1)) {\n\t\t\treturn moduleSizeEst2 / 7.0;\n\t\t}\n\t\tif (isNaN(moduleSizeEst2)) {\n\t\t\treturn moduleSizeEst1 / 7.0;\n\t\t}\n\t\t// Average them, and divide by 7 since we've counted the width of 3 black modules,\n\t\t// and 1 white and 1 black module on either side. Ergo, divide sum by 14.\n\t\treturn (moduleSizeEst1 + moduleSizeEst2) / 14.0;\n\t}\n\n\n\tthis.calculateModuleSize = function (topLeft, topRight, bottomLeft) {\n\t\t// Take the average\n\t\treturn (this.calculateModuleSizeOneWay(topLeft, topRight) + this.calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0;\n\t}\n\n\tthis.distance = function (pattern1, pattern2) {\n\t\tvar xDiff = pattern1.X - pattern2.X;\n\t\tvar yDiff = pattern1.Y - pattern2.Y;\n\t\treturn Math.sqrt((xDiff * xDiff + yDiff * yDiff));\n\t}\n\tthis.computeDimension = function (topLeft, topRight, bottomLeft, moduleSize) {\n\n\t\tvar tltrCentersDimension = Math.round(this.distance(topLeft, topRight) / moduleSize);\n\t\tvar tlblCentersDimension = Math.round(this.distance(topLeft, bottomLeft) / moduleSize);\n\t\tvar dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;\n\t\tswitch (dimension & 0x03) {\n\n\t\t\t// mod 4\n\t\t\tcase 0:\n\t\t\t\tdimension++;\n\t\t\t\tbreak;\n\t\t\t// 1? do nothing\n\n\t\t\tcase 2:\n\t\t\t\tdimension--;\n\t\t\t\tbreak;\n\n\t\t\tcase 3:\n\t\t\t\tthrow \"Error\";\n\t\t}\n\t\treturn dimension;\n\t}\n\n\tthis.findAlignmentInRegion = function (overallEstModuleSize, estAlignmentX, estAlignmentY, allowanceFactor) {\n\t\t// Look for an alignment pattern (3 modules in size) around where it\n\t\t// should be\n\t\tvar allowance = Math.floor(allowanceFactor * overallEstModuleSize);\n\t\tvar alignmentAreaLeftX = Math.max(0, estAlignmentX - allowance);\n\t\tvar alignmentAreaRightX = Math.min(base.width - 1, estAlignmentX + allowance);\n\t\tif (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3) {\n\t\t\tthrow \"Error\";\n\t\t}\n\n\t\tvar alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);\n\t\tvar alignmentAreaBottomY = Math.min(base.height - 1, estAlignmentY + allowance);\n\n\t\tvar alignmentFinder = new AlignmentPatternFinder(this.image, base, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);\n\t\treturn alignmentFinder.find();\n\t}\n\n\tthis.createTransform = function (topLeft, topRight, bottomLeft, alignmentPattern, dimension) {\n\t\tvar dimMinusThree = dimension - 3.5;\n\t\tvar bottomRightX;\n\t\tvar bottomRightY;\n\t\tvar sourceBottomRightX;\n\t\tvar sourceBottomRightY;\n\t\tif (alignmentPattern != null) {\n\t\t\tbottomRightX = alignmentPattern.X;\n\t\t\tbottomRightY = alignmentPattern.Y;\n\t\t\tsourceBottomRightX = sourceBottomRightY = dimMinusThree - 3.0;\n\t\t}\n\t\telse {\n\t\t\t// Don't have an alignment pattern, just make up the bottom-right point\n\t\t\tbottomRightX = (topRight.X - topLeft.X) + bottomLeft.X;\n\t\t\tbottomRightY = (topRight.Y - topLeft.Y) + bottomLeft.Y;\n\t\t\tsourceBottomRightX = sourceBottomRightY = dimMinusThree;\n\t\t}\n\n\t\tvar transform = PerspectiveTransform.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.X, topLeft.Y, topRight.X, topRight.Y, bottomRightX, bottomRightY, bottomLeft.X, bottomLeft.Y);\n\n\t\treturn transform;\n\t}\n\n\tthis.sampleGrid = function (image, transform, dimension) {\n\n\t\treturn GridSampler.sampleGrid3(image, base, dimension, transform);\n\t}\n\n\tthis.processFinderPatternInfo = function (info) {\n\n\t\tvar topLeft = info.TopLeft;\n\t\tvar topRight = info.TopRight;\n\t\tvar bottomLeft = info.BottomLeft;\n\n\t\tvar moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);\n\t\tif (moduleSize < 1.0) {\n\t\t\tthrow \"Error\";\n\t\t}\n\t\tvar dimension = this.computeDimension(topLeft, topRight, bottomLeft, moduleSize);\n\t\tvar provisionalVersion = Version.getProvisionalVersionForDimension(dimension);\n\t\tvar modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;\n\n\t\tvar alignmentPattern = null;\n\t\t// Anything above version 1 has an alignment pattern\n\t\tif (provisionalVersion.AlignmentPatternCenters.length > 0) {\n\n\t\t\t// Guess where a \"bottom right\" finder pattern would have been\n\t\t\tvar bottomRightX = topRight.X - topLeft.X + bottomLeft.X;\n\t\t\tvar bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;\n\n\t\t\t// Estimate that alignment pattern is closer by 3 modules\n\t\t\t// from \"bottom right\" to known top left location\n\t\t\tvar correctionToTopLeft = 1.0 - 3.0 / modulesBetweenFPCenters;\n\t\t\tvar estAlignmentX = Math.floor(topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));\n\t\t\tvar estAlignmentY = Math.floor(topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y));\n\n\t\t\t// Kind of arbitrary -- expand search radius before giving up\n\t\t\tfor (var i = 4; i <= 16; i <<= 1) {\n\t\t\t\t//try\n\t\t\t\t//{\n\t\t\t\talignmentPattern = this.findAlignmentInRegion(moduleSize, estAlignmentX, estAlignmentY, i);\n\t\t\t\tbreak;\n\t\t\t\t//}\n\t\t\t\t//catch (re)\n\t\t\t\t//{\n\t\t\t\t// try next round\n\t\t\t\t//}\n\t\t\t}\n\t\t\t// If we didn't find alignment pattern... well try anyway without it\n\t\t}\n\n\t\tvar transform = this.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);\n\n\t\tvar bits = this.sampleGrid(this.image, transform, dimension);\n\n\t\tvar points;\n\t\tif (alignmentPattern == null) {\n\t\t\tpoints = new Array(bottomLeft, topLeft, topRight);\n\t\t}else {\n\t\t\tpoints = new Array(bottomLeft, topLeft, topRight, alignmentPattern);\n\t\t}\n\t\treturn new DetectorResult(bits, points);\n\t}\n\n\n\n\tthis.detect = function () {\n\t\tvar info = new FinderPatternFinder(base).findFinderPattern(this.image);\n\n\t\treturn this.processFinderPatternInfo(info);\n\t}\n}\n\nmodule.exports = Detector;\n","var addOrSubtract = function (a, b) {\r\n\treturn a ^ b;\r\n}\r\n\r\nfunction GF256Poly(field, coefficients) {\r\n\tif (coefficients == null || coefficients.length == 0) {\r\n\t\tthrow \"System.ArgumentException\";\r\n\t}\r\n\tthis.field = field;\r\n\tvar coefficientsLength = coefficients.length;\r\n\tif (coefficientsLength > 1 && coefficients[0] == 0) {\r\n\t\t// Leading term must be non-zero for anything except the constant polynomial \"0\"\r\n\t\tvar firstNonZero = 1;\r\n\t\twhile (firstNonZero < coefficientsLength && coefficients[firstNonZero] == 0) {\r\n\t\t\tfirstNonZero++;\r\n\t\t}\r\n\t\tif (firstNonZero == coefficientsLength) {\r\n\t\t\tthis.coefficients = field.Zero.coefficients;\r\n\t\t}\r\n\t\telse {\r\n\t\t\tthis.coefficients = new Array(coefficientsLength - firstNonZero);\r\n\t\t\tfor (var i = 0; i < this.coefficients.length; i++)this.coefficients[i] = 0;\r\n\t\t\t//Array.Copy(coefficients, firstNonZero, this.coefficients, 0, this.coefficients.length);\r\n\t\t\tfor (var ci = 0; ci < this.coefficients.length; ci++)this.coefficients[ci] = coefficients[firstNonZero + ci];\r\n\t\t}\r\n\t}\r\n\telse {\r\n\t\tthis.coefficients = coefficients;\r\n\t}\r\n\r\n\tthis.__defineGetter__(\"Zero\", function () {\r\n\t\treturn this.coefficients[0] == 0;\r\n\t});\r\n\tthis.__defineGetter__(\"Degree\", function () {\r\n\t\treturn this.coefficients.length - 1;\r\n\t});\r\n\tthis.__defineGetter__(\"Coefficients\", function () {\r\n\t\treturn this.coefficients;\r\n\t});\r\n\r\n\tthis.getCoefficient = function (degree) {\r\n\t\treturn this.coefficients[this.coefficients.length - 1 - degree];\r\n\t}\r\n\r\n\tthis.evaluateAt = function (a) {\r\n\t\tif (a == 0) {\r\n\t\t\t// Just return the x^0 coefficient\r\n\t\t\treturn this.getCoefficient(0);\r\n\t\t}\r\n\t\tvar size = this.coefficients.length;\r\n\t\tif (a == 1) {\r\n\t\t\t// Just the sum of the coefficients\r\n\t\t\tvar result = 0;\r\n\t\t\tfor (var i = 0; i < size; i++) {\r\n\t\t\t\tresult = addOrSubtract(result, this.coefficients[i]);\r\n\t\t\t}\r\n\t\t\treturn result;\r\n\t\t}\r\n\t\tvar result2 = this.coefficients[0];\r\n\t\tfor (var i = 1; i < size; i++) {\r\n\t\t\tresult2 = addOrSubtract(this.field.multiply(a, result2), this.coefficients[i]);\r\n\t\t}\r\n\t\treturn result2;\r\n\t}\r\n\r\n\tthis.addOrSubtract = function (other) {\r\n\t\tif (this.field != other.field) {\r\n\t\t\tthrow \"GF256Polys do not have same GF256 field\";\r\n\t\t}\r\n\t\tif (this.Zero) {\r\n\t\t\treturn other;\r\n\t\t}\r\n\t\tif (other.Zero) {\r\n\t\t\treturn this;\r\n\t\t}\r\n\r\n\t\tvar smallerCoefficients = this.coefficients;\r\n\t\tvar largerCoefficients = other.coefficients;\r\n\t\tif (smallerCoefficients.length > largerCoefficients.length) {\r\n\t\t\tvar temp = smallerCoefficients;\r\n\t\t\tsmallerCoefficients = largerCoefficients;\r\n\t\t\tlargerCoefficients = temp;\r\n\t\t}\r\n\t\tvar sumDiff = new Array(largerCoefficients.length);\r\n\t\tvar lengthDiff = largerCoefficients.length - smallerCoefficients.length;\r\n\t\t// Copy high-order terms only found in higher-degree polynomial's coefficients\r\n\t\t//Array.Copy(largerCoefficients, 0, sumDiff, 0, lengthDiff);\r\n\t\tfor (var ci = 0; ci < lengthDiff; ci++)sumDiff[ci] = largerCoefficients[ci];\r\n\r\n\t\tfor (var i = lengthDiff; i < largerCoefficients.length; i++) {\r\n\t\t\tsumDiff[i] = addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);\r\n\t\t}\r\n\r\n\t\treturn new GF256Poly(field, sumDiff);\r\n\t}\r\n\tthis.multiply1 = function (other) {\r\n\t\tif (this.field != other.field) {\r\n\t\t\tthrow \"GF256Polys do not have same GF256 field\";\r\n\t\t}\r\n\t\tif (this.Zero || other.Zero) {\r\n\t\t\treturn this.field.Zero;\r\n\t\t}\r\n\t\tvar aCoefficients = this.coefficients;\r\n\t\tvar aLength = aCoefficients.length;\r\n\t\tvar bCoefficients = other.coefficients;\r\n\t\tvar bLength = bCoefficients.length;\r\n\t\tvar product = new Array(aLength + bLength - 1);\r\n\t\tfor (var i = 0; i < aLength; i++) {\r\n\t\t\tvar aCoeff = aCoefficients[i];\r\n\t\t\tfor (var j = 0; j < bLength; j++) {\r\n\t\t\t\tproduct[i + j] = addOrSubtract(product[i + j], this.field.multiply(aCoeff, bCoefficients[j]));\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn new GF256Poly(this.field, product);\r\n\t}\r\n\tthis.multiply2 = function (scalar) {\r\n\t\tif (scalar == 0) {\r\n\t\t\treturn this.field.Zero;\r\n\t\t}\r\n\t\tif (scalar == 1) {\r\n\t\t\treturn this;\r\n\t\t}\r\n\t\tvar size = this.coefficients.length;\r\n\t\tvar product = new Array(size);\r\n\t\tfor (var i = 0; i < size; i++) {\r\n\t\t\tproduct[i] = this.field.multiply(this.coefficients[i], scalar);\r\n\t\t}\r\n\t\treturn new GF256Poly(this.field, product);\r\n\t}\r\n\tthis.multiplyByMonomial = function (degree, coefficient) {\r\n\t\tif (degree < 0) {\r\n\t\t\tthrow \"System.ArgumentException\";\r\n\t\t}\r\n\t\tif (coefficient == 0) {\r\n\t\t\treturn this.field.Zero;\r\n\t\t}\r\n\t\tvar size = this.coefficients.length;\r\n\t\tvar product = new Array(size + degree);\r\n\t\tfor (var i = 0; i < product.length; i++)product[i] = 0;\r\n\t\tfor (var i = 0; i < size; i++) {\r\n\t\t\tproduct[i] = this.field.multiply(this.coefficients[i], coefficient);\r\n\t\t}\r\n\t\treturn new GF256Poly(this.field, product);\r\n\t}\r\n\tthis.divide = function (other) {\r\n\t\tif (this.field != other.field) {\r\n\t\t\tthrow \"GF256Polys do not have same GF256 field\";\r\n\t\t}\r\n\t\tif (other.Zero) {\r\n\t\t\tthrow \"Divide by 0\";\r\n\t\t}\r\n\r\n\t\tvar quotient = this.field.Zero;\r\n\t\tvar remainder = this;\r\n\r\n\t\tvar denominatorLeadingTerm = other.getCoefficient(other.Degree);\r\n\t\tvar inverseDenominatorLeadingTerm = this.field.inverse(denominatorLeadingTerm);\r\n\r\n\t\twhile (remainder.Degree >= other.Degree && !remainder.Zero) {\r\n\t\t\tvar degreeDifference = remainder.Degree - other.Degree;\r\n\t\t\tvar scale = this.field.multiply(remainder.getCoefficient(remainder.Degree), inverseDenominatorLeadingTerm);\r\n\t\t\tvar term = other.multiplyByMonomial(degreeDifference, scale);\r\n\t\t\tvar iterationQuotient = this.field.buildMonomial(degreeDifference, scale);\r\n\t\t\tquotient = quotient.addOrSubtract(iterationQuotient);\r\n\t\t\tremainder = remainder.addOrSubtract(term);\r\n\t\t}\r\n\r\n\t\treturn new Array(quotient, remainder);\r\n\t}\r\n}\r\n\r\nmodule.exports = GF256Poly;","var GF256Poly = require('./GF256Poly')\r\n\r\nfunction GF256(primitive) {\r\n\tthis.expTable = new Array(256);\r\n\tthis.logTable = new Array(256);\r\n\tvar x = 1;\r\n\tfor (var i = 0; i < 256; i++) {\r\n\t\tthis.expTable[i] = x;\r\n\t\tx <<= 1; // x = x * 2; we're assuming the generator alpha is 2\r\n\t\tif (x >= 0x100) {\r\n\t\t\tx ^= primitive;\r\n\t\t}\r\n\t}\r\n\tfor (var i = 0; i < 255; i++) {\r\n\t\tthis.logTable[this.expTable[i]] = i;\r\n\t}\r\n\t// logTable[0] == 0 but this should never be used\r\n\tvar at0 = new Array(1); at0[0] = 0;\r\n\tthis.zero = new GF256Poly(this, new Array(at0));\r\n\tvar at1 = new Array(1); at1[0] = 1;\r\n\tthis.one = new GF256Poly(this, new Array(at1));\r\n\r\n\tthis.__defineGetter__(\"Zero\", function () {\r\n\t\treturn this.zero;\r\n\t});\r\n\tthis.__defineGetter__(\"One\", function () {\r\n\t\treturn this.one;\r\n\t});\r\n\tthis.buildMonomial = function (degree, coefficient) {\r\n\t\tif (degree < 0) {\r\n\t\t\tthrow \"System.ArgumentException\";\r\n\t\t}\r\n\t\tif (coefficient == 0) {\r\n\t\t\treturn this.zero;\r\n\t\t}\r\n\t\tvar coefficients = new Array(degree + 1);\r\n\t\tfor (var i = 0; i < coefficients.length; i++)coefficients[i] = 0;\r\n\t\tcoefficients[0] = coefficient;\r\n\t\treturn new GF256Poly(this, coefficients);\r\n\t}\r\n\tthis.exp = function (a) {\r\n\t\treturn this.expTable[a];\r\n\t}\r\n\tthis.log = function (a) {\r\n\t\tif (a == 0) {\r\n\t\t\tthrow \"System.ArgumentException\";\r\n\t\t}\r\n\t\treturn this.logTable[a];\r\n\t}\r\n\tthis.inverse = function (a) {\r\n\t\tif (a == 0) {\r\n\t\t\tthrow \"System.ArithmeticException\";\r\n\t\t}\r\n\t\treturn this.expTable[255 - this.logTable[a]];\r\n\t}\r\n\tthis.multiply = function (a, b) {\r\n\t\tif (a == 0 || b == 0) {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\tif (a == 1) {\r\n\t\t\treturn b;\r\n\t\t}\r\n\t\tif (b == 1) {\r\n\t\t\treturn a;\r\n\t\t}\r\n\t\treturn this.expTable[(this.logTable[a] + this.logTable[b]) % 255];\r\n\t}\r\n}\r\n\r\nGF256.QR_CODE_FIELD = new GF256(0x011D);\r\nGF256.DATA_MATRIX_FIELD = new GF256(0x012D);\r\n\r\nGF256.addOrSubtract = function (a, b) {\r\n\treturn a ^ b;\r\n}\r\n\r\nmodule.exports = GF256;","\nvar utils = require('../utils');\nvar URShift = utils.URShift;\n\nvar DataMask = {};\n\nDataMask.forReference = function (reference) {\n\tif (reference < 0 || reference > 7) {\n\t\tthrow \"System.ArgumentException\";\n\t}\n\treturn DataMask.DATA_MASKS[reference];\n}\n\nfunction DataMask000() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn ((i + j) & 0x01) == 0;\n\t}\n}\n\nfunction DataMask001() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn (i & 0x01) == 0;\n\t}\n}\n\nfunction DataMask010() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn j % 3 == 0;\n\t}\n}\n\nfunction DataMask011() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn (i + j) % 3 == 0;\n\t}\n}\n\nfunction DataMask100() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn (((URShift(i, 1)) + (j / 3)) & 0x01) == 0;\n\t}\n}\n\nfunction DataMask101() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\tvar temp = i * j;\n\t\treturn (temp & 0x01) + (temp % 3) == 0;\n\t}\n}\n\nfunction DataMask110() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\tvar temp = i * j;\n\t\treturn (((temp & 0x01) + (temp % 3)) & 0x01) == 0;\n\t}\n}\n\nfunction DataMask111() {\n\tthis.unmaskBitMatrix = function (bits, dimension) {\n\t\tfor (var i = 0; i < dimension; i++) {\n\t\t\tfor (var j = 0; j < dimension; j++) {\n\t\t\t\tif (this.isMasked(i, j)) {\n\t\t\t\t\tbits.flip(j, i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tthis.isMasked = function (i, j) {\n\t\treturn ((((i + j) & 0x01) + ((i * j) % 3)) & 0x01) == 0;\n\t}\n}\n\nDataMask.DATA_MASKS = new Array(new DataMask000(), new DataMask001(), new DataMask010(), new DataMask011(), new DataMask100(), new DataMask101(), new DataMask110(), new DataMask111());\n\nmodule.exports = DataMask;","/*\r\n Ported to JavaScript by Lazar Laszlo 2011 \r\n \r\n lazarsoft@gmail.com, www.lazarsoft.info\r\n \r\n*/\r\n\r\n/*\r\n*\r\n* Copyright 2007 ZXing authors\r\n*\r\n* Licensed under the Apache License, Version 2.0 (the \"License\");\r\n* you may not use this file except in compliance with the License.\r\n* You may obtain a copy of the License at\r\n*\r\n* http://www.apache.org/licenses/LICENSE-2.0\r\n*\r\n* Unless required by applicable law or agreed to in writing, software\r\n* distributed under the License is distributed on an \"AS IS\" BASIS,\r\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\r\n* See the License for the specific language governing permissions and\r\n* limitations under the License.\r\n*/\r\n\r\n\r\nfunction DataBlock(numDataCodewords, codewords) {\r\n\tthis.numDataCodewords = numDataCodewords;\r\n\tthis.codewords = codewords;\r\n\r\n\tthis.__defineGetter__(\"NumDataCodewords\", function () {\r\n\t\treturn this.numDataCodewords;\r\n\t});\r\n\tthis.__defineGetter__(\"Codewords\", function () {\r\n\t\treturn this.codewords;\r\n\t});\r\n}\r\n\r\nDataBlock.getDataBlocks = function (rawCodewords, version, ecLevel) {\r\n\r\n\tif (rawCodewords.length != version.TotalCodewords) {\r\n\t\tthrow \"ArgumentException\";\r\n\t}\r\n\r\n\t// Figure out the number and size of data blocks used by this version and\r\n\t// error correction level\r\n\tvar ecBlocks = version.getECBlocksForLevel(ecLevel);\r\n\r\n\t// First count the total number of data blocks\r\n\tvar totalBlocks = 0;\r\n\tvar ecBlockArray = ecBlocks.getECBlocks();\r\n\tfor (var i = 0; i < ecBlockArray.length; i++) {\r\n\t\ttotalBlocks += ecBlockArray[i].Count;\r\n\t}\r\n\r\n\t// Now establish DataBlocks of the appropriate size and number of data codewords\r\n\tvar result = new Array(totalBlocks);\r\n\tvar numResultBlocks = 0;\r\n\tfor (var j = 0; j < ecBlockArray.length; j++) {\r\n\t\tvar ecBlock = ecBlockArray[j];\r\n\t\tfor (var i = 0; i < ecBlock.Count; i++) {\r\n\t\t\tvar numDataCodewords = ecBlock.DataCodewords;\r\n\t\t\tvar numBlockCodewords = ecBlocks.ECCodewordsPerBlock + numDataCodewords;\r\n\t\t\tresult[numResultBlocks++] = new DataBlock(numDataCodewords, new Array(numBlockCodewords));\r\n\t\t}\r\n\t}\r\n\r\n\t// All blocks have the same amount of data, except that the last n\r\n\t// (where n may be 0) have 1 more byte. Figure out where these start.\r\n\tvar shorterBlocksTotalCodewords = result[0].codewords.length;\r\n\tvar longerBlocksStartAt = result.length - 1;\r\n\twhile (longerBlocksStartAt >= 0) {\r\n\t\tvar numCodewords = result[longerBlocksStartAt].codewords.length;\r\n\t\tif (numCodewords == shorterBlocksTotalCodewords) {\r\n\t\t\tbreak;\r\n\t\t}\r\n\t\tlongerBlocksStartAt--;\r\n\t}\r\n\tlongerBlocksStartAt++;\r\n\r\n\tvar shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;\r\n\t// The last elements of result may be 1 element longer;\r\n\t// first fill out as many elements as all of them have\r\n\tvar rawCodewordsOffset = 0;\r\n\tfor (var i = 0; i < shorterBlocksNumDataCodewords; i++) {\r\n\t\tfor (var j = 0; j < numResultBlocks; j++) {\r\n\t\t\tresult[j].codewords[i] = rawCodewords[rawCodewordsOffset++];\r\n\t\t}\r\n\t}\r\n\t// Fill out the last data block in the longer ones\r\n\tfor (var j = longerBlocksStartAt; j < numResultBlocks; j++) {\r\n\t\tresult[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];\r\n\t}\r\n\t// Now add in error correction blocks\r\n\tvar max = result[0].codewords.length;\r\n\tfor (var i = shorterBlocksNumDataCodewords; i < max; i++) {\r\n\t\tfor (var j = 0; j < numResultBlocks; j++) {\r\n\t\t\tvar iOffset = j < longerBlocksStartAt ? i : i + 1;\r\n\t\t\tresult[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];\r\n\t\t}\r\n\t}\r\n\treturn result;\r\n}\r\n\r\nmodule.exports = DataBlock;","var sizeOfDataLengthInfo = [\r\n\t[10, 9, 8, 8], \r\n\t[12, 11, 16, 10], \r\n\t[14, 13, 16, 12]\r\n];\r\n\r\nfunction QRCodeDataBlockReader(blocks, version, numErrorCorrectionCode) {\r\n\tthis.blockPointer = 0;\r\n\tthis.bitPointer = 7;\r\n\tthis.dataLength = 0;\r\n\tthis.blocks = blocks;\r\n\tthis.numErrorCorrectionCode = numErrorCorrectionCode;\r\n\tif (version <= 9)\r\n\t\tthis.dataLengthMode = 0;\r\n\telse if (version >= 10 && version <= 26)\r\n\t\tthis.dataLengthMode = 1;\r\n\telse if (version >= 27 && version <= 40)\r\n\t\tthis.dataLengthMode = 2;\r\n\r\n\tthis.getNextBits = function (numBits) {\r\n\t\tvar bits = 0;\r\n\t\tif (numBits < this.bitPointer + 1) {\r\n\t\t\t// next word fits into current data block\r\n\t\t\tvar mask = 0;\r\n\t\t\tfor (var i = 0; i < numBits; i++) {\r\n\t\t\t\tmask += (1 << i);\r\n\t\t\t}\r\n\t\t\tmask <<= (this.bitPointer - numBits + 1);\r\n\r\n\t\t\tbits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);\r\n\t\t\tthis.bitPointer -= numBits;\r\n\t\t\treturn bits;\r\n\t\t}\r\n\t\telse if (numBits < this.bitPointer + 1 + 8) {\r\n\t\t\t// next word crosses 2 data blocks\r\n\t\t\tvar mask1 = 0;\r\n\t\t\tfor (var i = 0; i < this.bitPointer + 1; i++) {\r\n\t\t\t\tmask1 += (1 << i);\r\n\t\t\t}\r\n\t\t\tbits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\r\n\t\t\tthis.blockPointer++;\r\n\t\t\tbits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));\r\n\r\n\t\t\tthis.bitPointer = this.bitPointer - numBits % 8;\r\n\t\t\tif (this.bitPointer < 0) {\r\n\t\t\t\tthis.bitPointer = 8 + this.bitPointer;\r\n\t\t\t}\r\n\t\t\treturn bits;\r\n\t\t}\r\n\t\telse if (numBits < this.bitPointer + 1 + 16) {\r\n\t\t\t// next word crosses 3 data blocks\r\n\t\t\tvar mask1 = 0; // mask of first block\r\n\t\t\tvar mask3 = 0; // mask of 3rd block\r\n\t\t\t//bitPointer + 1 : number of bits of the 1st block\r\n\t\t\t//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)\r\n\t\t\t//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block \r\n\t\t\tfor (var i = 0; i < this.bitPointer + 1; i++) {\r\n\t\t\t\tmask1 += (1 << i);\r\n\t\t\t}\r\n\t\t\tvar bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));\r\n\t\t\tthis.blockPointer++;\r\n\r\n\t\t\tvar bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));\r\n\t\t\tthis.blockPointer++;\r\n\r\n\t\t\tfor (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++) {\r\n\t\t\t\tmask3 += (1 << i);\r\n\t\t\t}\r\n\t\t\tmask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));\r\n\t\t\tvar bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));\r\n\r\n\t\t\tbits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;\r\n\t\t\tthis.bitPointer = this.bitPointer - (numBits - 8) % 8;\r\n\t\t\tif (this.bitPointer < 0) {\r\n\t\t\t\tthis.bitPointer = 8 + this.bitPointer;\r\n\t\t\t}\r\n\t\t\treturn bits;\r\n\t\t}\r\n\t\telse {\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t}\r\n\tthis.NextMode = function () {\r\n\t\tif ((this.blockPointer > this.blocks.length - this.numErrorCorrectionCode - 2))\r\n\t\t\treturn 0;\r\n\t\telse\r\n\t\t\treturn this.getNextBits(4);\r\n\t}\r\n\tthis.getDataLength = function (modeIndicator) {\r\n\t\tvar index = 0;\r\n\t\twhile (true) {\r\n\t\t\tif ((modeIndicator >> index) == 1)\r\n\t\t\t\tbreak;\r\n\t\t\tindex++;\r\n\t\t}\r\n\r\n\t\treturn this.getNextBits(sizeOfDataLengthInfo[this.dataLengthMode][index]);\r\n\t}\r\n\tthis.getRomanAndFigureString = function (dataLength) {\r\n\t\tvar length = dataLength;\r\n\t\tvar intData = 0;\r\n\t\tvar strData = \"\";\r\n\t\tvar tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', '$', '%', '*', '+', '-', '.', '/', ':');\r\n\t\tdo {\r\n\t\t\tif (length > 1) {\r\n\t\t\t\tintData = this.getNextBits(11);\r\n\t\t\t\tvar firstLetter = Math.floor(intData / 45);\r\n\t\t\t\tvar secondLetter = intData % 45;\r\n\t\t\t\tstrData += tableRomanAndFigure[firstLetter];\r\n\t\t\t\tstrData += tableRomanAndFigure[secondLetter];\r\n\t\t\t\tlength -= 2;\r\n\t\t\t}\r\n\t\t\telse if (length == 1) {\r\n\t\t\t\tintData = this.getNextBits(6);\r\n\t\t\t\tstrData += tableRomanAndFigure[intData];\r\n\t\t\t\tlength -= 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (length > 0);\r\n\r\n\t\treturn strData;\r\n\t}\r\n\tthis.getFigureString = function (dataLength) {\r\n\t\tvar length = dataLength;\r\n\t\tvar intData = 0;\r\n\t\tvar strData = \"\";\r\n\t\tdo {\r\n\t\t\tif (length >= 3) {\r\n\t\t\t\tintData = this.getNextBits(10);\r\n\t\t\t\tif (intData < 100)\r\n\t\t\t\t\tstrData += \"0\";\r\n\t\t\t\tif (intData < 10)\r\n\t\t\t\t\tstrData += \"0\";\r\n\t\t\t\tlength -= 3;\r\n\t\t\t}\r\n\t\t\telse if (length == 2) {\r\n\t\t\t\tintData = this.getNextBits(7);\r\n\t\t\t\tif (intData < 10)\r\n\t\t\t\t\tstrData += \"0\";\r\n\t\t\t\tlength -= 2;\r\n\t\t\t}\r\n\t\t\telse if (length == 1) {\r\n\t\t\t\tintData = this.getNextBits(4);\r\n\t\t\t\tlength -= 1;\r\n\t\t\t}\r\n\t\t\tstrData += intData;\r\n\t\t}\r\n\t\twhile (length > 0);\r\n\r\n\t\treturn strData;\r\n\t}\r\n\tthis.get8bitByteArray = function (dataLength) {\r\n\t\tvar length = dataLength;\r\n\t\tvar intData = 0;\r\n\t\tvar output = new Array();\r\n\r\n\t\tdo {\r\n\t\t\tintData = this.getNextBits(8);\r\n\t\t\toutput.push(intData);\r\n\t\t\tlength--;\r\n\t\t}\r\n\t\twhile (length > 0);\r\n\t\treturn output;\r\n\t}\r\n\tthis.getKanjiString = function (dataLength) {\r\n\t\tvar length = dataLength;\r\n\t\tvar intData = 0;\r\n\t\tvar unicodeString = \"\";\r\n\t\tdo {\r\n\t\t\tintData = this.getNextBits(13);\r\n\t\t\tvar lowerByte = intData % 0xC0;\r\n\t\t\tvar higherByte = intData / 0xC0;\r\n\r\n\t\t\tvar tempWord = (higherByte << 8) + lowerByte;\r\n\t\t\tvar shiftjisWord = 0;\r\n\t\t\tif (tempWord + 0x8140 <= 0x9FFC) {\r\n\t\t\t\t// between 8140 - 9FFC on Shift_JIS character set\r\n\t\t\t\tshiftjisWord = tempWord + 0x8140;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t// between E040 - EBBF on Shift_JIS character set\r\n\t\t\t\tshiftjisWord = tempWord + 0xC140;\r\n\t\t\t}\r\n\r\n\t\t\t//var tempByte = new Array(0,0);\r\n\t\t\t//tempByte[0] = (sbyte) (shiftjisWord >> 8);\r\n\t\t\t//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);\r\n\t\t\t//unicodeString += new String(SystemUtils.ToCharArray(SystemUtils.ToByteArray(tempByte)));\r\n\t\t\tunicodeString += String.fromCharCode(shiftjisWord);\r\n\t\t\tlength--;\r\n\t\t}\r\n\t\twhile (length > 0);\r\n\r\n\r\n\t\treturn unicodeString;\r\n\t}\r\n\r\n\tthis.parseECIValue = function () {\r\n\t\tvar intData = 0;\r\n\t\tvar firstByte = this.getNextBits(8);\r\n\t\tif ((firstByte & 0x80) == 0) {\r\n\t\t\tintData = firstByte & 0x7F;\r\n\t\t}\r\n\t\tif ((firstByte & 0xC0) == 0x80) {\r\n\t\t\t// two bytes\r\n\t\t\tvar secondByte = this.getNextBits(8);\r\n\t\t\tintData = ((firstByte & 0x3F) << 8) | secondByte;\r\n\t\t}\r\n\t\tif ((firstByte & 0xE0) == 0xC0) {\r\n\t\t\t// three bytes\r\n\t\t\tvar secondThirdBytes = this.getNextBits(8);;\r\n\t\t\tintData = ((firstByte & 0x1F) << 16) | secondThirdBytes;\r\n\t\t}\r\n\t\treturn intData;\r\n\t}\r\n\r\n\tthis.__defineGetter__(\"DataByte\", function () {\r\n\t\tvar output = new Array();\r\n\t\tvar MODE_NUMBER = 1;\r\n\t\tvar MODE_ROMAN_AND_NUMBER = 2;\r\n\t\tvar MODE_8BIT_BYTE = 4;\r\n\t\tvar MODE_ECI = 7;\r\n\t\tvar MODE_KANJI = 8;\r\n\t\tdo {\r\n\t\t\tvar mode = this.NextMode();\r\n\t\t\t//canvas.println(\"mode: \" + mode);\r\n\t\t\tif (mode == 0) {\r\n\t\t\t\tif (output.length > 0)\r\n\t\t\t\t\tbreak;\r\n\t\t\t\telse\r\n\t\t\t\t\tthrow \"Empty data block\";\r\n\t\t\t}\r\n\t\t\tif (mode != MODE_NUMBER && mode != MODE_ROMAN_AND_NUMBER && mode != MODE_8BIT_BYTE && mode != MODE_KANJI && mode != MODE_ECI) {\r\n\t\t\t\tthrow \"Invalid mode: \" + mode + \" in (block:\" + this.blockPointer + \" bit:\" + this.bitPointer + \")\";\r\n\t\t\t}\r\n\r\n\t\t\tif (mode == MODE_ECI) {\r\n\t\t\t\tvar temp_sbyteArray3 = this.parseECIValue();\r\n\t\t\t\t//output.push(temp_sbyteArray3);\r\n\t\t\t}\r\n\t\t\telse {\r\n\r\n\t\t\t\tvar dataLength = this.getDataLength(mode);\r\n\t\t\t\tif (dataLength < 1)\r\n\t\t\t\t\tthrow \"Invalid data length: \" + dataLength;\r\n\t\t\t\tswitch (mode) {\r\n\r\n\t\t\t\t\tcase MODE_NUMBER:\r\n\t\t\t\t\t\tvar temp_str = this.getFigureString(dataLength);\r\n\t\t\t\t\t\tvar ta = new Array(temp_str.length);\r\n\t\t\t\t\t\tfor (var j = 0; j < temp_str.length; j++)\r\n\t\t\t\t\t\t\tta[j] = temp_str.charCodeAt(j);\r\n\t\t\t\t\t\toutput.push(ta);\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tcase MODE_ROMAN_AND_NUMBER:\r\n\t\t\t\t\t\tvar temp_str = this.getRomanAndFigureString(dataLength);\r\n\t\t\t\t\t\tvar ta = new Array(temp_str.length);\r\n\t\t\t\t\t\tfor (var j = 0; j < temp_str.length; j++)\r\n\t\t\t\t\t\t\tta[j] = temp_str.charCodeAt(j);\r\n\t\t\t\t\t\toutput.push(ta);\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tcase MODE_8BIT_BYTE:\r\n\t\t\t\t\t\tvar temp_sbyteArray3 = this.get8bitByteArray(dataLength);\r\n\t\t\t\t\t\toutput.push(temp_sbyteArray3);\r\n\t\t\t\t\t\tbreak;\r\n\r\n\t\t\t\t\tcase MODE_KANJI:\r\n\t\t\t\t\t\tvar temp_str = this.getKanjiString(dataLength);\r\n\t\t\t\t\t\toutput.push(temp_str);\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (true);\r\n\t\treturn output;\r\n\t});\r\n}\r\n\r\nmodule.exports = QRCodeDataBlockReader;\r\n","var GF256 = require('./GF256')\r\nvar BitMatrixParser = require('./BitMatrixParser')\r\nvar DataBlock = require('./DataBlock')\r\nvar QRCodeDataBlockReader = require('./QRCodeDataBlockReader')\r\nvar ReedSolomonDecoder = require('./ReedSolomonDecoder')\r\n\r\nvar Decoder = {};\r\nDecoder.rsDecoder = new ReedSolomonDecoder(GF256.QR_CODE_FIELD);\r\n\r\nDecoder.correctErrors = function (codewordBytes, numDataCodewords) {\r\n\tvar numCodewords = codewordBytes.length;\r\n\t// First read into an array of ints\r\n\tvar codewordsInts = new Array(numCodewords);\r\n\tfor (var i = 0; i < numCodewords; i++) {\r\n\t\tcodewordsInts[i] = codewordBytes[i] & 0xFF;\r\n\t}\r\n\tvar numECCodewords = codewordBytes.length - numDataCodewords;\r\n\ttry {\r\n\t\tDecoder.rsDecoder.decode(codewordsInts, numECCodewords);\r\n\t\t//var corrector = new ReedSolomon(codewordsInts, numECCodewords);\r\n\t\t//corrector.correct();\r\n\t}\r\n\tcatch (rse) {\r\n\t\tthrow rse;\r\n\t}\r\n\t// Copy back into array of bytes -- only need to worry about the bytes that were data\r\n\t// We don't care about errors in the error-correction codewords\r\n\tfor (var i = 0; i < numDataCodewords; i++) {\r\n\t\tcodewordBytes[i] = codewordsInts[i];\r\n\t}\r\n}\r\n\r\nDecoder.decode = function (bits) {\r\n\tvar parser = new BitMatrixParser(bits);\r\n\tvar version = parser.readVersion();\r\n\tvar ecLevel = parser.readFormatInformation().ErrorCorrectionLevel;\r\n\r\n\t// Read codewords\r\n\tvar codewords = parser.readCodewords();\r\n\r\n\t// Separate into data blocks\r\n\tvar dataBlocks = DataBlock.getDataBlocks(codewords, version, ecLevel);\r\n\r\n\t// Count total number of data bytes\r\n\tvar totalBytes = 0;\r\n\tfor (var i = 0; i < dataBlocks.length; i++) {\r\n\t\ttotalBytes += dataBlocks[i].NumDataCodewords;\r\n\t}\r\n\tvar resultBytes = new Array(totalBytes);\r\n\tvar resultOffset = 0;\r\n\r\n\t// Error-correct and copy data blocks together into a stream of bytes\r\n\tfor (var j = 0; j < dataBlocks.length; j++) {\r\n\t\tvar dataBlock = dataBlocks[j];\r\n\t\tvar codewordBytes = dataBlock.Codewords;\r\n\t\tvar numDataCodewords = dataBlock.NumDataCodewords;\r\n\t\tDecoder.correctErrors(codewordBytes, numDataCodewords);\r\n\t\tfor (var i = 0; i < numDataCodewords; i++) {\r\n\t\t\tresultBytes[resultOffset++] = codewordBytes[i];\r\n\t\t}\r\n\t}\r\n\r\n\t// Decode the contents of that stream of bytes\r\n\tvar reader = new QRCodeDataBlockReader(resultBytes, version.VersionNumber, ecLevel.Bits);\r\n\treturn reader;\r\n\t//return DecodedBitStreamParser.decode(resultBytes, version, ecLevel);\r\n}\r\n\r\nmodule.exports = Decoder;","var GF256 = require('./GF256')\r\nvar GF256Poly = require('./GF256Poly')\r\n\r\nmodule.exports = function ReedSolomonDecoder(field) {\r\n\tthis.field = field;\r\n\tthis.decode = function (received, twoS) {\r\n\t\tvar poly = new GF256Poly(this.field, received);\r\n\t\tvar syndromeCoefficients = new Array(twoS);\r\n\t\tfor (var i = 0; i < syndromeCoefficients.length; i++)syndromeCoefficients[i] = 0;\r\n\t\tvar dataMatrix = false;//this.field.Equals(GF256.DATA_MATRIX_FIELD);\r\n\t\tvar noError = true;\r\n\t\tfor (var i = 0; i < twoS; i++) {\r\n\t\t\t// Thanks to sanfordsquires for this fix:\r\n\t\t\tvar evalu = poly.evaluateAt(this.field.exp(dataMatrix ? i + 1 : i));\r\n\t\t\tsyndromeCoefficients[syndromeCoefficients.length - 1 - i] = evalu;\r\n\t\t\tif (evalu != 0) {\r\n\t\t\t\tnoError = false;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (noError) {\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tvar syndrome = new GF256Poly(this.field, syndromeCoefficients);\r\n\t\tvar sigmaOmega = this.runEuclideanAlgorithm(this.field.buildMonomial(twoS, 1), syndrome, twoS);\r\n\t\tvar sigma = sigmaOmega[0];\r\n\t\tvar omega = sigmaOmega[1];\r\n\t\tvar errorLocations = this.findErrorLocations(sigma);\r\n\t\tvar errorMagnitudes = this.findErrorMagnitudes(omega, errorLocations, dataMatrix);\r\n\t\tfor (var i = 0; i < errorLocations.length; i++) {\r\n\t\t\tvar position = received.length - 1 - this.field.log(errorLocations[i]);\r\n\t\t\tif (position < 0) {\r\n\t\t\t\tthrow \"ReedSolomonException Bad error location\";\r\n\t\t\t}\r\n\t\t\treceived[position] = GF256.addOrSubtract(received[position], errorMagnitudes[i]);\r\n\t\t}\r\n\t}\r\n\r\n\tthis.runEuclideanAlgorithm = function (a, b, R) {\r\n\t\t// Assume a's degree is >= b's\r\n\t\tif (a.Degree < b.Degree) {\r\n\t\t\tvar temp = a;\r\n\t\t\ta = b;\r\n\t\t\tb = temp;\r\n\t\t}\r\n\r\n\t\tvar rLast = a;\r\n\t\tvar r = b;\r\n\t\tvar sLast = this.field.One;\r\n\t\tvar s = this.field.Zero;\r\n\t\tvar tLast = this.field.Zero;\r\n\t\tvar t = this.field.One;\r\n\r\n\t\t// Run Euclidean algorithm until r's degree is less than R/2\r\n\t\twhile (r.Degree >= Math.floor(R / 2)) {\r\n\t\t\tvar rLastLast = rLast;\r\n\t\t\tvar sLastLast = sLast;\r\n\t\t\tvar tLastLast = tLast;\r\n\t\t\trLast = r;\r\n\t\t\tsLast = s;\r\n\t\t\ttLast = t;\r\n\r\n\t\t\t// Divide rLastLast by rLast, with quotient in q and remainder in r\r\n\t\t\tif (rLast.Zero) {\r\n\t\t\t\t// Oops, Euclidean algorithm already terminated?\r\n\t\t\t\tthrow \"r_{i-1} was zero\";\r\n\t\t\t}\r\n\t\t\tr = rLastLast;\r\n\t\t\tvar q = this.field.Zero;\r\n\t\t\tvar denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);\r\n\t\t\tvar dltInverse = this.field.inverse(denominatorLeadingTerm);\r\n\t\t\twhile (r.Degree >= rLast.Degree && !r.Zero) {\r\n\t\t\t\tvar degreeDiff = r.Degree - rLast.Degree;\r\n\t\t\t\tvar scale = this.field.multiply(r.getCoefficient(r.Degree), dltInverse);\r\n\t\t\t\tq = q.addOrSubtract(this.field.buildMonomial(degreeDiff, scale));\r\n\t\t\t\tr = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));\r\n\t\t\t\t//r.EXE();\r\n\t\t\t}\r\n\r\n\t\t\ts = q.multiply1(sLast).addOrSubtract(sLastLast);\r\n\t\t\tt = q.multiply1(tLast).addOrSubtract(tLastLast);\r\n\t\t}\r\n\r\n\t\tvar sigmaTildeAtZero = t.getCoefficient(0);\r\n\t\tif (sigmaTildeAtZero == 0) {\r\n\t\t\tthrow \"ReedSolomonException sigmaTilde(0) was zero\";\r\n\t\t}\r\n\r\n\t\tvar inverse = this.field.inverse(sigmaTildeAtZero);\r\n\t\tvar sigma = t.multiply2(inverse);\r\n\t\tvar omega = r.multiply2(inverse);\r\n\t\treturn new Array(sigma, omega);\r\n\t}\r\n\tthis.findErrorLocations = function (errorLocator) {\r\n\t\t// This is a direct application of Chien's search\r\n\t\tvar numErrors = errorLocator.Degree;\r\n\t\tif (numErrors == 1) {\r\n\t\t\t// shortcut\r\n\t\t\treturn new Array(errorLocator.getCoefficient(1));\r\n\t\t}\r\n\t\tvar result = new Array(numErrors);\r\n\t\tvar e = 0;\r\n\t\tfor (var i = 1; i < 256 && e < numErrors; i++) {\r\n\t\t\tif (errorLocator.evaluateAt(i) == 0) {\r\n\t\t\t\tresult[e] = this.field.inverse(i);\r\n\t\t\t\te++;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (e != numErrors) {\r\n\t\t\tthrow \"Error locator degree does not match number of roots\";\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n\tthis.findErrorMagnitudes = function (errorEvaluator, errorLocations, dataMatrix) {\r\n\t\t// This is directly applying Forney's Formula\r\n\t\tvar s = errorLocations.length;\r\n\t\tvar result = new Array(s);\r\n\t\tfor (var i = 0; i < s; i++) {\r\n\t\t\tvar xiInverse = this.field.inverse(errorLocations[i]);\r\n\t\t\tvar denominator = 1;\r\n\t\t\tfor (var j = 0; j < s; j++) {\r\n\t\t\t\tif (i != j) {\r\n\t\t\t\t\tdenominator = this.field.multiply(denominator, GF256.addOrSubtract(1, this.field.multiply(errorLocations[j], xiInverse)));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tresult[i] = this.field.multiply(errorEvaluator.evaluateAt(xiInverse), this.field.inverse(denominator));\r\n\t\t\t// Thanks to sanfordsquires for this fix:\r\n\t\t\tif (dataMatrix) {\r\n\t\t\t\tresult[i] = this.field.multiply(result[i], xiInverse);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n}","var DataMask = require('./DataMask')\r\nvar FormatInformation = require('./FormatInformation')\r\nvar Version = require('./Version')\r\n\r\nmodule.exports = function BitMatrixParser(bitMatrix) {\r\n\tvar dimension = bitMatrix.Dimension;\r\n\tif (dimension < 21 || (dimension & 0x03) != 1) {\r\n\t\tthrow \"Error BitMatrixParser\";\r\n\t}\r\n\tthis.bitMatrix = bitMatrix;\r\n\tthis.parsedVersion = null;\r\n\tthis.parsedFormatInfo = null;\r\n\r\n\tthis.copyBit = function (i, j, versionBits) {\r\n\t\treturn this.bitMatrix.get_Renamed(i, j) ? (versionBits << 1) | 0x1 : versionBits << 1;\r\n\t}\r\n\r\n\tthis.readFormatInformation = function () {\r\n\t\tif (this.parsedFormatInfo != null) {\r\n\t\t\treturn this.parsedFormatInfo;\r\n\t\t}\r\n\r\n\t\t// Read top-left format info bits\r\n\t\tvar formatInfoBits = 0;\r\n\t\tfor (var i = 0; i < 6; i++) {\r\n\t\t\tformatInfoBits = this.copyBit(i, 8, formatInfoBits);\r\n\t\t}\r\n\t\t// .. and skip a bit in the timing pattern ...\r\n\t\tformatInfoBits = this.copyBit(7, 8, formatInfoBits);\r\n\t\tformatInfoBits = this.copyBit(8, 8, formatInfoBits);\r\n\t\tformatInfoBits = this.copyBit(8, 7, formatInfoBits);\r\n\t\t// .. and skip a bit in the timing pattern ...\r\n\t\tfor (var j = 5; j >= 0; j--) {\r\n\t\t\tformatInfoBits = this.copyBit(8, j, formatInfoBits);\r\n\t\t}\r\n\r\n\t\tthis.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);\r\n\t\tif (this.parsedFormatInfo != null) {\r\n\t\t\treturn this.parsedFormatInfo;\r\n\t\t}\r\n\r\n\t\t// Hmm, failed. Try the top-right/bottom-left pattern\r\n\t\tvar dimension = this.bitMatrix.Dimension;\r\n\t\tformatInfoBits = 0;\r\n\t\tvar iMin = dimension - 8;\r\n\t\tfor (var i = dimension - 1; i >= iMin; i--) {\r\n\t\t\tformatInfoBits = this.copyBit(i, 8, formatInfoBits);\r\n\t\t}\r\n\t\tfor (var j = dimension - 7; j < dimension; j++) {\r\n\t\t\tformatInfoBits = this.copyBit(8, j, formatInfoBits);\r\n\t\t}\r\n\r\n\t\tthis.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);\r\n\t\tif (this.parsedFormatInfo != null) {\r\n\t\t\treturn this.parsedFormatInfo;\r\n\t\t}\r\n\t\tthrow \"Error readFormatInformation\";\r\n\t}\r\n\tthis.readVersion = function () {\r\n\r\n\t\tif (this.parsedVersion != null) {\r\n\t\t\treturn this.parsedVersion;\r\n\t\t}\r\n\r\n\t\tvar dimension = this.bitMatrix.Dimension;\r\n\r\n\t\tvar provisionalVersion = (dimension - 17) >> 2;\r\n\t\tif (provisionalVersion <= 6) {\r\n\t\t\treturn Version.getVersionForNumber(provisionalVersion);\r\n\t\t}\r\n\r\n\t\t// Read top-right version info: 3 wide by 6 tall\r\n\t\tvar versionBits = 0;\r\n\t\tvar ijMin = dimension - 11;\r\n\t\tfor (var j = 5; j >= 0; j--) {\r\n\t\t\tfor (var i = dimension - 9; i >= ijMin; i--) {\r\n\t\t\t\tversionBits = this.copyBit(i, j, versionBits);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tthis.parsedVersion = Version.decodeVersionInformation(versionBits);\r\n\t\tif (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension) {\r\n\t\t\treturn this.parsedVersion;\r\n\t\t}\r\n\r\n\t\t// Hmm, failed. Try bottom left: 6 wide by 3 tall\r\n\t\tversionBits = 0;\r\n\t\tfor (var i = 5; i >= 0; i--) {\r\n\t\t\tfor (var j = dimension - 9; j >= ijMin; j--) {\r\n\t\t\t\tversionBits = this.copyBit(i, j, versionBits);\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tthis.parsedVersion = Version.decodeVersionInformation(versionBits);\r\n\t\tif (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension) {\r\n\t\t\treturn this.parsedVersion;\r\n\t\t}\r\n\t\tthrow \"Error readVersion\";\r\n\t}\r\n\tthis.readCodewords = function () {\r\n\r\n\t\tvar formatInfo = this.readFormatInformation();\r\n\t\tvar version = this.readVersion();\r\n\r\n\t\t// Get the data mask for the format used in this QR Code. This will exclude\r\n\t\t// some bits from reading as we wind through the bit matrix.\r\n\t\tvar dataMask = DataMask.forReference(formatInfo.DataMask);\r\n\t\tvar dimension = this.bitMatrix.Dimension;\r\n\t\tdataMask.unmaskBitMatrix(this.bitMatrix, dimension);\r\n\r\n\t\tvar functionPattern = version.buildFunctionPattern();\r\n\r\n\t\tvar readingUp = true;\r\n\t\tvar result = new Array(version.TotalCodewords);\r\n\t\tvar resultOffset = 0;\r\n\t\tvar currentByte = 0;\r\n\t\tvar bitsRead = 0;\r\n\t\t// Read columns in pairs, from right to left\r\n\t\tfor (var j = dimension - 1; j > 0; j -= 2) {\r\n\t\t\tif (j == 6) {\r\n\t\t\t\t// Skip whole column with vertical alignment pattern;\r\n\t\t\t\t// saves time and makes the other code proceed more cleanly\r\n\t\t\t\tj--;\r\n\t\t\t}\r\n\t\t\t// Read alternatingly from bottom to top then top to bottom\r\n\t\t\tfor (var count = 0; count < dimension; count++) {\r\n\t\t\t\tvar i = readingUp ? dimension - 1 - count : count;\r\n\t\t\t\tfor (var col = 0; col < 2; col++) {\r\n\t\t\t\t\t// Ignore bits covered by the function pattern\r\n\t\t\t\t\tif (!functionPattern.get_Renamed(j - col, i)) {\r\n\t\t\t\t\t\t// Read a bit\r\n\t\t\t\t\t\tbitsRead++;\r\n\t\t\t\t\t\tcurrentByte <<= 1;\r\n\t\t\t\t\t\tif (this.bitMatrix.get_Renamed(j - col, i)) {\r\n\t\t\t\t\t\t\tcurrentByte |= 1;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t// If we've made a whole byte, save it off\r\n\t\t\t\t\t\tif (bitsRead == 8) {\r\n\t\t\t\t\t\t\tresult[resultOffset++] = currentByte;\r\n\t\t\t\t\t\t\tbitsRead = 0;\r\n\t\t\t\t\t\t\tcurrentByte = 0;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treadingUp ^= true; // readingUp = !readingUp; // switch directions\r\n\t\t}\r\n\t\tif (resultOffset != version.TotalCodewords) {\r\n\t\t\tthrow \"Error readCodewords\";\r\n\t\t}\r\n\t\treturn result;\r\n\t}\r\n}","var Detector = require('./lib/Detector');\nvar Decoder = require('./lib/Decoder');\nvar debug = false;\n\n\n// 获取指定位置的灰度\nvar Pixel = function (data,base) {\n\treturn function(x,y){\n\t\tif (base.width < x || base.height < y) {\n\t\t\tthrow \"point error\";\n\t\t}\n\t\tvar point = (x * 4) + (y * base.width * 4)\n\t\treturn (data[point] * 33.33 + data[point + 1] * 33.33 + data[point + 2] * 33.33) / 100;\n\t}\n}\n\nvar binarize = function(data,base,th){\n\tvar ret = new Array(base.width * base.height);\n\tvar getPixel = Pixel(data,base);\n for (var y = 0; y < base.height; y++) {\n for (var x = 0; x < base.width; x++) {\n var gray = getPixel(x, y);\n ret[x + y * base.width] = gray <= th ? true : false;\n }\n }\n return ret;\n}\n\nvar grayscale = function(data,base) {\n var buff = new ArrayBuffer(base.width * base.height);\n var ret = new Uint8Array(buff);\n //var ret = new Array(base.width*base.height);\n\tvar getPixel = Pixel(data,base);\n for (var y = 0; y < base.height; y++) {\n for (var x = 0; x < base.width; x++) {\n var gray = getPixel(x, y);\n ret[x + y * base.width] = gray;\n }\n }\n return ret;\n}\n\nvar getMiddleBrightnessPerArea = function (image,base) {\n var numSqrtArea = 4;\n //obtain middle brightness((min + max) / 2) per area\n var areaWidth = Math.floor(base.width / numSqrtArea);\n var areaHeight = Math.floor(base.height / numSqrtArea);\n var minmax = new Array(numSqrtArea);\n for (var i = 0; i < numSqrtArea; i++) {\n minmax[i] = new Array(numSqrtArea);\n for (var i2 = 0; i2 < numSqrtArea; i2++) {\n minmax[i][i2] = new Array(0, 0);\n }\n }\n for (var ay = 0; ay < numSqrtArea; ay++) {\n for (var ax = 0; ax < numSqrtArea; ax++) {\n minmax[ax][ay][0] = 0xFF;\n for (var dy = 0; dy < areaHeight; dy++) {\n for (var dx = 0; dx < areaWidth; dx++) {\n var target = image[areaWidth * ax + dx + (areaHeight * ay + dy) * base.width];\n if (target < minmax[ax][ay][0])\n minmax[ax][ay][0] = target;\n if (target > minmax[ax][ay][1])\n minmax[ax][ay][1] = target;\n }\n }\n //minmax[ax][ay][0] = (minmax[ax][ay][0] + minmax[ax][ay][1]) / 2;\n }\n }\n var middle = new Array(numSqrtArea);\n for (var i3 = 0; i3 < numSqrtArea; i3++) {\n middle[i3] = new Array(numSqrtArea);\n }\n for (var ay = 0; ay < numSqrtArea; ay++) {\n for (var ax = 0; ax < numSqrtArea; ax++) {\n middle[ax][ay] = Math.floor((minmax[ax][ay][0] + minmax[ax][ay][1]) / 2);\n //Console.out.print(middle[ax][ay] + \",\");\n }\n //Console.out.println(\"\");\n }\n //Console.out.println(\"\");\n\n return middle;\n}\n\nvar grayScaleToBitmap = function (image,base) {\n var middle = getMiddleBrightnessPerArea(image,base);\n var sqrtNumArea = middle.length;\n var areaWidth = Math.floor(base.width / sqrtNumArea);\n var areaHeight = Math.floor(base.height / sqrtNumArea);\n\n var buff = new ArrayBuffer(base.width * base.height);\n var bitmap = new Uint8Array(buff);\n\n //var bitmap = new Array(base.height*base.width);\n\n for (var ay = 0; ay < sqrtNumArea; ay++) {\n for (var ax = 0; ax < sqrtNumArea; ax++) {\n for (var dy = 0; dy < areaHeight; dy++) {\n for (var dx = 0; dx < areaWidth; dx++) {\n bitmap[areaWidth * ax + dx + (areaHeight * ay + dy) * base.width] = (image[areaWidth * ax + dx + (areaHeight * ay + dy) * base.width] < middle[ax][ay]) ? true : false;\n }\n }\n }\n }\n return bitmap;\n}\n\nfunction decode(imageDate,debugfn){\n\tvar base = {\n\t\twidth: imageDate.width,\n\t\theight: imageDate.height,\n\t\tdebugfn: debugfn\n\t}\n\treturn process(imageDate.data,base)\n}\n\nvar process = function (data,base) {\n // var start = new Date().getTime();\n // var image = grayScaleToBitmap(grayscale(),base);\n // var image = binarize(128);\n\tvar image = binarize(data,base,153); //转为位图;\n\t\n\tdebug && base.debugfn && base.debugfn(image,base.width);\n\n\t// 位图转为QR矩阵\n var detector = new Detector(image,base);\n var qRCodeMatrix = detector.detect();\n\n if (debug, base.debugfn) {\n\t\tvar _imgdata = [];\n for (var y = 0; y < qRCodeMatrix.bits.Height; y++) {\n for (var x = 0; x < qRCodeMatrix.bits.Width; x++) {\n\t\t\t\t_imgdata.push(qRCodeMatrix.bits.get_Renamed(x, y) ? true : 0)\n }\n\t\t}\n\t\tdebugfn(_imgdata,qRCodeMatrix.bits.Width);\n }\n\n\t// 解析QR矩阵\n var reader = Decoder.decode(qRCodeMatrix.bits);\n // console.log(reader);\n var data = reader.DataByte;\n var str = \"\";\n for (var i = 0; i < data.length; i++) {\n for (var j = 0; j < data[i].length; j++)\n str += String.fromCharCode(data[i][j]);\n }\n\n // var end = new Date().getTime();\n // var time = end - start;\n // console.log(\"Time:\" + time + \" Code: \"+str);\n return str;\n}\n\nmodule.exports = decode;","\nvar qrDecode = require('./src/QRDecode');\nvar decodeByDom = function (dom) {\n\tvar canvas = document.createElement(\"canvas\")\n\tvar ctx = canvas.getContext('2d')\n\tcanvas.width = dom.width;\n\tcanvas.height = dom.height;\n\tctx.drawImage(dom, 0, 0, canvas.width, canvas.height);\n\tvar data = ctx.getImageData(0, 0, canvas.width, canvas.height);\n\treturn qrDecode(data)\n}\n\nvar decodeByUrl = (src, cb) => {\n\tvar img = new Image();\n\timg.crossOrigin=\"anonymous\";\n\timg.src = src;\n\timg.onload = function () {\n\t\ttry {\n\t\t\tcb(null, decodeByDom(img));\n\t\t} catch (e) {\n\t\t\tcb(e);\n\t\t}\n\t}\n\timg.onerror = cb;\n}\n\nqrDecode.decodeByDom = decodeByDom;\nqrDecode.decodeByUrl = decodeByUrl;\nmodule.exports = qrDecode;"],"names":["AlignmentPattern","posX","posY","estimatedModuleSize","x","y","count","__defineGetter__","this","Math","floor","incrementCount","aboutEquals","moduleSize","i","j","abs","moduleSizeDiff","module","image","base","startX","startY","width","height","resultPointCallback","possibleCenters","Array","crossCheckStateCount","centerFromEnd","stateCount","end","foundPatternCross","maxVariance","crossCheckVertical","startI","centerJ","maxCount","originalStateCountTotal","maxI","NaN","stateCountTotal","handlePossibleCenter","centerI","isNaN","max","length","index","point","push","foundPossibleResultPoint","find","maxJ","middleI","iGen","currentState","confirmed","MIN_SKIP","MAX_MODULES","INTEGER_MATH_SHIFT","CENTER_QUORUM","orderBestPatterns","patterns","distance","pattern1","pattern2","xDiff","X","yDiff","Y","sqrt","pointA","pointB","pointC","zeroOneDistance","oneTwoDistance","zeroTwoDistance","bX","bY","crossProductZ","temp","hasSkipped","totalModuleSize","CrossCheckStateCount","crossCheckHorizontal","startJ","found","center","selectBestPatterns","startSize","square","centerValue","EstimatedModuleSize","average","sort","center1","center2","dA","dB","stdDev","limit","pattern","splice","a","b","findRowSkip","firstConfirmedCenter","Count","haveMultiplyConfirmedCenters","confirmedCount","totalDeviation","findFinderPattern","iSkip","done","rowSkip","patternInfo","patternCenters","bottomLeft","topLeft","topRight","number","bits","ErrorCorrectionLevel","ordinal","name","ordinal_Renamed_Field","L","M","Q","H","FOR_BITS","URShift","utils","FORMAT_INFO_DECODE_LOOKUP","BITS_SET_IN_HALF_BYTE","FormatInformation","formatInfo","errorCorrectionLevel","getErrorCorrectionLevel","dataMask","GetHashCode","Equals","o","other","numBitsDiffering","decodeFormatInformation","maskedFormatInfo","doDecodeFormatInformation","bestDifference","bestFormatInfo","decodeInfo","targetInfo","bitsDifference","rowSize","get_Renamed","offset","set_Renamed","flip","clear","setRegion","left","top","right","bottom","ECB","dataCodewords","ECBlocks","ecCodewordsPerBlock","ecBlocks1","ecBlocks2","ecBlocks","NumBlocks","total","getECBlocks","Version","versionNumber","alignmentPatternCenters","ecBlocks3","ecBlocks4","ecCodewords","ECCodewordsPerBlock","ecbArray","ecBlock","DataCodewords","totalCodewords","buildFunctionPattern","dimension","DimensionForVersion","bitMatrix","BitMatrix","getECBlocksForLevel","ecLevel","VERSION_DECODE_INFO","VERSIONS","getVersionForNumber","getProvisionalVersionForDimension","iae","decodeVersionInformation","versionBits","bestVersion","targetVersion","GridSampler","points","nudged","transform","iValue","transformPoints1","checkAndNudgePoints","aioobe","PerspectiveTransform","a11","a21","a31","a12","a22","a32","a13","a23","a33","denominator","transformPoints2","xValues","yValues","n","buildAdjoint","times","quadrilateralToQuadrilateral","x0","y0","x1","y1","x2","y2","x3","y3","x0p","y0p","x1p","y1p","x2p","y2p","x3p","y3p","qToS","quadrilateralToSquare","squareToQuadrilateral","dy2","dy3","dx1","dx2","dx3","dy1","imageArray","sizeOfBlackWhiteBlackRun","fromX","fromY","toX","toY","steep","dx","dy","error","ystep","xstep","state","realX","realY","diffX","diffY","diffX2","diffY2","sizeOfBlackWhiteBlackRunBothWays","result","scale","otherToX","otherToY","calculateModuleSizeOneWay","otherPattern","moduleSizeEst1","moduleSizeEst2","calculateModuleSize","computeDimension","round","findAlignmentInRegion","overallEstModuleSize","estAlignmentX","estAlignmentY","allowanceFactor","allowance","alignmentAreaLeftX","alignmentAreaRightX","min","alignmentAreaTopY","alignmentAreaBottomY","AlignmentPatternFinder","createTransform","alignmentPattern","bottomRightX","bottomRightY","sourceBottomRightX","sourceBottomRightY","dimMinusThree","sampleGrid","sampleGrid3","processFinderPatternInfo","info","TopLeft","TopRight","BottomLeft","provisionalVersion","modulesBetweenFPCenters","AlignmentPatternCenters","correctionToTopLeft","detect","FinderPatternFinder","addOrSubtract","GF256Poly","field","coefficients","coefficientsLength","firstNonZero","Zero","ci","getCoefficient","degree","evaluateAt","size","result2","multiply","smallerCoefficients","largerCoefficients","sumDiff","lengthDiff","multiply1","aCoefficients","aLength","bCoefficients","bLength","product","aCoeff","multiply2","scalar","multiplyByMonomial","coefficient","divide","quotient","remainder","denominatorLeadingTerm","Degree","inverseDenominatorLeadingTerm","inverse","degreeDifference","term","iterationQuotient","buildMonomial","GF256","primitive","expTable","logTable","at0","zero","at1","one","exp","log","QR_CODE_FIELD","DATA_MATRIX_FIELD","DataMask","forReference","reference","DATA_MASKS","unmaskBitMatrix","isMasked","DataBlock","numDataCodewords","codewords","getDataBlocks","rawCodewords","version","TotalCodewords","totalBlocks","ecBlockArray","numResultBlocks","numBlockCodewords","shorterBlocksTotalCodewords","longerBlocksStartAt","shorterBlocksNumDataCodewords","rawCodewordsOffset","iOffset","sizeOfDataLengthInfo","blocks","numErrorCorrectionCode","blockPointer","bitPointer","dataLength","dataLengthMode","getNextBits","numBits","mask","mask1","mask3","bitsFirstBlock","bitsSecondBlock","NextMode","getDataLength","modeIndicator","getRomanAndFigureString","intData","strData","tableRomanAndFigure","secondLetter","getFigureString","get8bitByteArray","output","getKanjiString","unicodeString","tempWord","shiftjisWord","String","fromCharCode","parseECIValue","firstByte","mode","temp_sbyteArray3","temp_str","ta","charCodeAt","Decoder","rsDecoder","decode","received","twoS","poly","syndromeCoefficients","noError","evalu","syndrome","sigmaOmega","runEuclideanAlgorithm","sigma","omega","errorLocations","findErrorLocations","errorMagnitudes","findErrorMagnitudes","position","R","rLast","r","sLast","One","s","tLast","t","rLastLast","sLastLast","tLastLast","q","dltInverse","degreeDiff","sigmaTildeAtZero","errorLocator","numErrors","e","errorEvaluator","dataMatrix","xiInverse","correctErrors","codewordBytes","numCodewords","codewordsInts","numECCodewords","rse","parser","Dimension","parsedVersion","parsedFormatInfo","copyBit","readFormatInformation","formatInfoBits","iMin","readVersion","ijMin","readCodewords","functionPattern","readingUp","resultOffset","currentByte","bitsRead","col","dataBlocks","totalBytes","NumDataCodewords","resultBytes","dataBlock","Codewords","QRCodeDataBlockReader","VersionNumber","Bits","process","data","th","ret","getPixel","Pixel","gray","binarize","qRCodeMatrix","Detector","debug","debugfn","_imgdata","Height","Width","DataByte","str","imageDate","decodeByDom","dom","canvas","document","createElement","ctx","getContext","drawImage","getImageData","qrDecode","decodeByUrl","src","cb","img","Image","crossOrigin","onload","onerror"],"mappings":";;;;;2LAAA,SAASA,EAAiBC,EAAMC,EAAMC,QAChCC,EAAIH,OACJI,EAAIH,OACJI,MAAQ,OACRH,oBAAsBA,OAEtBI,iBAAiB,sBAAuB,kBACrCC,KAAKL,2BAERI,iBAAiB,QAAS,kBACvBC,KAAKF,aAERC,iBAAiB,IAAK,kBACnBE,KAAKC,MAAMF,KAAKJ,UAEnBG,iBAAiB,IAAK,kBACnBE,KAAKC,MAAMF,KAAKH,UAEnBM,eAAiB,gBAChBL,cAEDM,YAAc,SAAUC,EAAYC,EAAGC,MACvCN,KAAKO,IAAIF,EAAIN,KAAKH,IAAMQ,GAAcJ,KAAKO,IAAID,EAAIP,KAAKJ,IAAMS,EAAY,KACzEI,EAAiBR,KAAKO,IAAIH,EAAaL,KAAKL,4BACzCc,GAAkB,GAAOA,EAAiBT,KAAKL,qBAAuB,SAEvE,GAyLTe,MApLA,SAAgCC,EAAOC,EAAMC,EAAQC,EAAQC,EAAOC,EAAQX,EAAYY,QAClFN,MAAQA,OACRO,gBAAkB,IAAIC,WACtBN,OAASA,OACTC,OAASA,OACTC,MAAQA,OACRC,OAASA,OACTX,WAAaA,OACbe,qBAAuB,IAAID,MAAM,EAAG,EAAG,QACvCF,oBAAsBA,OAEtBI,cAAgB,SAAUC,EAAYC,UAClCA,EAAMD,EAAW,GAAMA,EAAW,GAAK,QAE3CE,kBAAoB,SAAUF,WAC9BjB,EAAaL,KAAKK,WAClBoB,EAAcpB,EAAa,EACtBC,EAAI,EAAGA,EAAI,EAAGA,OAClBL,KAAKO,IAAIH,EAAaiB,EAAWhB,KAAOmB,SACpC,SAGF,QAGHC,mBAAqB,SAAUC,EAAQC,EAASC,EAAUC,OAC1DnB,EAAQX,KAAKW,MAEboB,EAAOnB,EAAKI,OACZM,EAAatB,KAAKoB,uBACX,GAAK,IACL,GAAK,IACL,GAAK,UAGZd,EAAIqB,EACDrB,GAAK,GAAKK,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KACzD,YAIRvB,EAAI,GAAKgB,EAAW,GAAKO,SACrBG,SAED1B,GAAK,IAAMK,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KAC1D,YAGRP,EAAW,GAAKO,SACZG,UAIJL,EAAS,EACNrB,EAAIyB,GAAQpB,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KAC3D,YAGRvB,GAAKyB,GAAQT,EAAW,GAAKO,SACzBG,SAED1B,EAAIyB,IAASpB,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KAC5D,YAGRP,EAAW,GAAKO,SACZG,QAGJC,EAAkBX,EAAW,GAAKA,EAAW,GAAKA,EAAW,UAC7D,EAAIrB,KAAKO,IAAIyB,EAAkBH,IAA4B,EAAIA,EAC3DE,IAGDhC,KAAKwB,kBAAkBF,GAActB,KAAKqB,cAAcC,EAAYhB,GAAK0B,UAG5EE,qBAAuB,SAAUZ,EAAYhB,EAAGC,OAChD0B,EAAkBX,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAC7DM,EAAU5B,KAAKqB,cAAcC,EAAYf,GACzC4B,EAAUnC,KAAK0B,mBAAmBpB,EAAGL,KAAKC,MAAM0B,GAAU,EAAIN,EAAW,GAAIW,OAC5EG,MAAMD,GAAU,SAChBxC,GAAuB2B,EAAW,GAAKA,EAAW,GAAKA,EAAW,IAAM,EACxEe,EAAMrC,KAAKkB,gBAAgBoB,OACtBC,EAAQ,EAAGA,EAAQF,EAAKE,OACnBvC,KAAKkB,gBAAgBqB,GAEvBnC,YAAYT,EAAqBwC,EAASP,UAC7C,IAAIpC,EAAiBoC,EAASO,EAASxC,OAI5C6C,EAAQ,IAAIhD,EAAiBoC,EAASO,EAASxC,QAC9CuB,gBAAgBuB,KAAKD,GACM,MAA5BxC,KAAKiB,0BACHA,oBAAoByB,yBAAyBF,UAG7C,WAGHG,KAAO,mBACP9B,EAASb,KAAKa,OACdG,EAAShB,KAAKgB,OACd4B,EAAO/B,EAASE,EAChB8B,EAAU/B,GAAUE,GAAU,GAG9BM,EAAa,IAAIH,MAAM,EAAG,EAAG,GACxB2B,EAAO,EAAGA,EAAO9B,EAAQ8B,IAAQ,KAErCxC,EAAIuC,GAA4B,IAAT,EAAPC,GAAsBA,EAAO,GAAM,IAASA,EAAO,GAAM,MAClE,GAAK,IACL,GAAK,IACL,GAAK,UACZvC,EAAIM,EAIDN,EAAIqC,IAASjC,EAAMJ,EAAIK,EAAKG,MAAQT,gBAGvCyC,EAAe,EACZxC,EAAIqC,GAAM,IACZjC,EAAMJ,EAAID,EAAIM,EAAKG,UAEF,GAAhBgC,IAEQA,aAIS,GAAhBA,EAAmB,KAIjBC,KAFDhD,KAAKwB,kBAAkBF,IAGT,OADb0B,EAAYhD,KAAKkC,qBAAqBZ,EAAYhB,EAAGC,WAEjDyC,IAGE,GAAK1B,EAAW,KAChB,GAAK,IACL,GAAK,IACD,WAGFyB,UAMK,GAAhBA,SAIOA,YAIT/C,KAAKwB,kBAAkBF,IAET,OADb0B,EAAYhD,KAAKkC,qBAAqBZ,EAAYhB,EAAGsC,WAEjDI,KAO2B,GAA/BhD,KAAKkB,gBAAgBoB,cACnBtC,KAAKkB,gBAAgB,QAGvB,4CCvMJ+B,EAAW,EACXC,EAAc,GACdC,EAAqB,EACrBC,EAAgB,EAEhBC,EAAoB,SAAUC,YAExBC,EAASC,EAAUC,OACvBC,EAAQF,EAASG,EAAIF,EAASE,EAC9BC,EAAQJ,EAASK,EAAIJ,EAASI,SAC3B5D,KAAK6D,KAAMJ,EAAQA,EAAQE,EAAQA,OAgBvCG,EAAQC,EAAQC,EAJhBC,EAAkBX,EAASD,EAAS,GAAIA,EAAS,IACjDa,EAAiBZ,EAASD,EAAS,GAAIA,EAAS,IAChDc,EAAkBb,EAASD,EAAS,GAAIA,EAAS,OAIjDa,GAAkBD,GAAmBC,GAAkBC,KACjDd,EAAS,KACTA,EAAS,KACTA,EAAS,IAEVc,GAAmBD,GAAkBC,GAAmBF,KACvDZ,EAAS,KACTA,EAAS,KACTA,EAAS,OAGTA,EAAS,KACTA,EAAS,KACTA,EAAS,aA3BIS,EAAQC,EAAQC,OAClCI,EAAKL,EAAOpE,EACZ0E,EAAKN,EAAOnE,SACPoE,EAAOrE,EAAIyE,IAAON,EAAOlE,EAAIyE,IAASL,EAAOpE,EAAIyE,IAAOP,EAAOnE,EAAIyE,GA+BzEE,CAAcR,EAAQC,EAAQC,GAAU,EAAK,KAC5CO,EAAOT,IACFE,IACAO,IAGD,GAAKT,IACL,GAAKC,IACL,GAAKC,GAudfvD,MAraA,SAA6BE,QACvBD,MAAQ,UACRO,wBACAuD,YAAa,OACbrD,qBAAuB,IAAID,MAAM,EAAG,EAAG,EAAG,EAAG,QAC7CF,oBAAsB,UAEtBlB,iBAAiB,uBAAwB,uBACxCqB,qBAAqB,GAAK,OAC1BA,qBAAqB,GAAK,OAC1BA,qBAAqB,GAAK,OAC1BA,qBAAqB,GAAK,OAC1BA,qBAAqB,GAAK,EACxBpB,KAAKoB,4BAGRI,kBAAoB,SAAUF,WAC9BoD,EAAkB,EACbpE,EAAI,EAAGA,EAAI,EAAGA,IAAK,KACvBR,EAAQwB,EAAWhB,MACV,GAATR,SACI,KAEWA,KAEhB4E,EAAkB,SACd,MAEJrE,EAAaJ,KAAKC,OAAOwE,GAAmBvB,GAAsB,GAClE1B,EAAcxB,KAAKC,MAAMG,EAAa,UAEnCJ,KAAKO,IAAIH,GAAciB,EAAW,IAAM6B,IAAuB1B,GAAexB,KAAKO,IAAIH,GAAciB,EAAW,IAAM6B,IAAuB1B,GAAexB,KAAKO,IAAI,EAAIH,GAAciB,EAAW,IAAM6B,IAAuB,EAAI1B,GAAexB,KAAKO,IAAIH,GAAciB,EAAW,IAAM6B,IAAuB1B,GAAexB,KAAKO,IAAIH,GAAciB,EAAW,IAAM6B,IAAuB1B,QAElYJ,cAAgB,SAAUC,EAAYC,UAClCA,EAAMD,EAAW,GAAKA,EAAW,GAAMA,EAAW,GAAK,QAE3DI,mBAAqB,SAAUC,EAAQC,EAASC,EAAUC,WAC1DnB,EAAQX,KAAKW,MAEboB,EAAOnB,EAAKI,OACZM,EAAatB,KAAK2E,qBAGlBrE,EAAIqB,EACDrB,GAAK,GAAKK,EAAMiB,EAAUtB,EAAIM,EAAKG,UAC9B,YAGRT,EAAI,SACA0B,SAED1B,GAAK,IAAMK,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KAC1D,YAIRvB,EAAI,GAAKgB,EAAW,GAAKO,SACrBG,SAED1B,GAAK,GAAKK,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,IAAMO,KACzD,YAGRP,EAAW,GAAKO,SACZG,UAIJL,EAAS,EACNrB,EAAIyB,GAAQpB,EAAMiB,EAAUtB,EAAIM,EAAKG,UAChC,YAGRT,GAAKyB,SACDC,SAED1B,EAAIyB,IAASpB,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,GAAKO,KAC3D,YAGRvB,GAAKyB,GAAQT,EAAW,IAAMO,SAC1BG,SAED1B,EAAIyB,GAAQpB,EAAMiB,EAAUtB,EAAIM,EAAKG,QAAUO,EAAW,GAAKO,KAC1D,YAGRP,EAAW,IAAMO,SACbG,QAKJC,EAAkBX,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,UAC7F,EAAIrB,KAAKO,IAAIyB,EAAkBH,IAA4B,EAAIA,EAC3DE,IAGDhC,KAAKwB,kBAAkBF,GAActB,KAAKqB,cAAcC,EAAYhB,GAAK0B,UAE5E4C,qBAAuB,SAAUC,EAAQ1C,EAASN,EAAUC,WAC5DnB,EAAQX,KAAKW,MAEbiC,EAAOhC,EAAKG,MACZO,EAAatB,KAAK2E,qBAElBpE,EAAIsE,EACDtE,GAAK,GAAKI,EAAMJ,EAAI4B,EAAUvB,EAAKG,UAC9B,YAGRR,EAAI,SACAyB,SAEDzB,GAAK,IAAMI,EAAMJ,EAAI4B,EAAUvB,EAAKG,QAAUO,EAAW,IAAMO,KAC1D,YAGRtB,EAAI,GAAKe,EAAW,GAAKO,SACrBG,SAEDzB,GAAK,GAAKI,EAAMJ,EAAI4B,EAAUvB,EAAKG,QAAUO,EAAW,IAAMO,KACzD,YAGRP,EAAW,GAAKO,SACZG,UAGJ6C,EAAS,EACNtE,EAAIqC,GAAQjC,EAAMJ,EAAI4B,EAAUvB,EAAKG,UAChC,YAGRR,GAAKqC,SACDZ,SAEDzB,EAAIqC,IAASjC,EAAMJ,EAAI4B,EAAUvB,EAAKG,QAAUO,EAAW,GAAKO,KAC3D,YAGRtB,GAAKqC,GAAQtB,EAAW,IAAMO,SAC1BG,SAEDzB,EAAIqC,GAAQjC,EAAMJ,EAAI4B,EAAUvB,EAAKG,QAAUO,EAAW,GAAKO,KAC1D,YAGRP,EAAW,IAAMO,SACbG,QAKJC,EAAkBX,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,UAC7F,EAAIrB,KAAKO,IAAIyB,EAAkBH,IAA4BA,EACvDE,IAGDhC,KAAKwB,kBAAkBF,GAActB,KAAKqB,cAAcC,EAAYf,GAAKyB,UAE5EE,qBAAuB,SAAUZ,EAAYhB,EAAGC,OAChD0B,EAAkBX,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAAKA,EAAW,GAC7FM,EAAU5B,KAAKqB,cAAcC,EAAYf,GACzC4B,EAAUnC,KAAK0B,mBAAmBpB,EAAGL,KAAKC,MAAM0B,GAAUN,EAAW,GAAIW,OACxEG,MAAMD,OAEAnC,KAAK4E,qBAAqB3E,KAAKC,MAAM0B,GAAU3B,KAAKC,MAAMiC,GAAUb,EAAW,GAAIW,IACxFG,MAAMR,IAAU,SAChBjC,EAAsBsC,EAAkB,EACxC6C,GAAQ,EACRzC,EAAMrC,KAAKkB,gBAAgBoB,OACtBC,EAAQ,EAAGA,EAAQF,EAAKE,IAAS,KACrCwC,EAAS/E,KAAKkB,gBAAgBqB,MAE9BwC,EAAO3E,YAAYT,EAAqBwC,EAASP,GAAU,GACvDzB,oBACC,aAIL2E,EAAO,KACPtC,EAAQ,IApOjB,SAAuB/C,EAAMC,EAAMC,QAC7BC,EAAIH,OACJI,EAAIH,OACJI,MAAQ,OACRH,oBAAsBA,OAEtBI,iBAAiB,sBAAuB,kBACrCC,KAAKL,2BAERI,iBAAiB,QAAS,kBACvBC,KAAKF,aAERC,iBAAiB,IAAK,kBACnBC,KAAKJ,SAERG,iBAAiB,IAAK,kBACnBC,KAAKH,SAERM,eAAiB,gBAChBL,cAEDM,YAAc,SAAUC,EAAYC,EAAGC,MACvCN,KAAKO,IAAIF,EAAIN,KAAKH,IAAMQ,GAAcJ,KAAKO,IAAID,EAAIP,KAAKJ,IAAMS,EAAY,KACzEI,EAAiBR,KAAKO,IAAIH,EAAaL,KAAKL,4BACzCc,GAAkB,GAAOA,EAAiBT,KAAKL,qBAAuB,SAEvE,GA0MQ,CAAkBiC,EAASO,EAASxC,QAC3CuB,gBAAgBuB,KAAKD,GACM,MAA5BxC,KAAKiB,0BACHA,oBAAoByB,yBAAyBF,UAG7C,SAGF,QAGHwC,mBAAqB,eAErBC,EAAYjF,KAAKkB,gBAAgBoB,UACjC2C,EAAY,OAET,+CAAiDA,EAAY,OAIhEA,EAAY,EAAG,SAEdP,EAAkB,EAClBQ,EAAS,EACJ5E,EAAI,EAAGA,EAAI2E,EAAW3E,IAAK,KAE/B6E,EAAcnF,KAAKkB,gBAAgBZ,GAAG8E,uBACvBD,KACRA,EAAcA,MAEtBE,EAAUX,EAAkBO,OAC3B/D,gBAAgBoE,KAAK,SAAUC,EAASC,OACxCC,EAAKxF,KAAKO,IAAIgF,EAAQJ,oBAAsBC,GAC5CK,EAAKzF,KAAKO,IAAI+E,EAAQH,oBAAsBC,UAC5CI,EAAKC,GACC,EACCD,GAAMC,EACT,EAEA,QAILC,EAAS1F,KAAK6D,KAAKoB,EAASD,EAAYI,EAAUA,GAClDO,EAAQ3F,KAAKoC,IAAI,GAAMgD,EAASM,OAE3BrF,EAAIN,KAAKkB,gBAAgBoB,OAAS,EAAGhC,GAAK,EAAGA,IAAK,KACtDuF,EAAU7F,KAAKkB,gBAAgBZ,GAE/BL,KAAKO,IAAIqF,EAAQT,oBAAsBC,GAAWO,QAEhD1E,gBAAgB4E,OAAOxF,EAAG,WAM9BN,KAAKkB,gBAAgBoB,OAAS,QAE5BpB,gBAAgBoE,KAAK,SAAUS,EAAGC,UAClCD,EAAEjG,MAAQkG,EAAElG,OAAiB,EAC7BiG,EAAEjG,MAAQkG,EAAElG,MAAgB,EACzB,IAIF,IAAIqB,MAAMnB,KAAKkB,gBAAgB,GAAIlB,KAAKkB,gBAAgB,GAAIlB,KAAKkB,gBAAgB,UAGpF+E,YAAc,eACd5D,EAAMrC,KAAKkB,gBAAgBoB,UAC3BD,GAAO,SACH,UAEJ6D,EAAuB,KAClB5F,EAAI,EAAGA,EAAI+B,EAAK/B,IAAK,KACzByE,EAAS/E,KAAKkB,gBAAgBZ,MAC9ByE,EAAOoB,OAAS/C,EAAe,IACN,MAAxB8C,cASEzB,YAAa,EACXxE,KAAKC,OAAOD,KAAKO,IAAI0F,EAAqBvC,EAAIoB,EAAOpB,GAAK1D,KAAKO,IAAI0F,EAAqBrC,EAAIkB,EAAOlB,IAAM,KATzFkB,UAanB,QAGHqB,6BAA+B,mBAC/BC,EAAiB,EACjB3B,EAAkB,EAClBrC,EAAMrC,KAAKkB,gBAAgBoB,OACtBhC,EAAI,EAAGA,EAAI+B,EAAK/B,IAAK,KACzBuF,EAAU7F,KAAKkB,gBAAgBZ,GAC/BuF,EAAQM,OAAS/C,WAEDyC,EAAQT,wBAGzBiB,EAAiB,SACb,MAMJhB,EAAUX,EAAkBrC,EAC5BiE,EAAiB,MACZhG,EAAI,EAAGA,EAAI+B,EAAK/B,MACdN,KAAKkB,gBAAgBZ,MACbL,KAAKO,IAAIqF,EAAQT,oBAAsBC,UAEnDiB,GAAkB,IAAO5B,QAG5B6B,kBAAoB,SAAU5F,QAE7BA,MAAQA,MACToB,EAAOnB,EAAKI,OACZ4B,EAAOhC,EAAKG,MACZyF,EAAQvG,KAAKC,MAAO,EAAI6B,GAAS,EAAImB,IACrCsD,EAAQvD,MACHA,WAGLwD,GAAO,EACPnF,EAAa,IAAIH,MAAM,GAClBb,EAAIkG,EAAQ,EAAGlG,EAAIyB,IAAS0E,EAAMnG,GAAKkG,EAAO,GAE3C,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAK,UACZzD,EAAe,EACVxC,EAAI,EAAGA,EAAIqC,EAAMrC,OACrBI,EAAMJ,EAAID,EAAIM,EAAKG,OAEI,IAAN,EAAfgC,UAIMA,aAIe,IAAN,EAAfA,MAEgB,GAAhBA,KAEC/C,KAAKwB,kBAAkBF,GAAa,IAEvBtB,KAAKkC,qBAAqBZ,EAAYhB,EAAGC,QAIhD,EACJP,KAAKyE,aACDzE,KAAKoG,mCAER,KACAM,EAAU1G,KAAKiG,cACfS,EAAUpF,EAAW,QASnBoF,EAAUpF,EAAW,GAAKkF,IAC3B5D,EAAO,OAIT,cAKGrC,EAAIqC,IAASjC,EAAMJ,EAAID,EAAIM,EAAKG,cAIzB,IACJ,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAK,SAIL,GAAKO,EAAW,KAChB,GAAKA,EAAW,KAChB,GAAKA,EAAW,KAChB,GAAK,IACL,GAAK,IACD,WAIHyB,YAKHA,KAIV/C,KAAKwB,kBAAkBF,IACVtB,KAAKkC,qBAAqBZ,EAAYhB,EAAGsC,OAEhDtB,EAAW,GACftB,KAAKyE,eAEDzE,KAAKoG,qCAMZO,EAAc3G,KAAKgF,8BACL2B,GAEX,IAhbT,SAA2BC,QACrBC,WAAaD,EAAe,QAC5BE,QAAUF,EAAe,QACzBG,SAAWH,EAAe,QAC1B7G,iBAAiB,aAAc,kBAC5BC,KAAK6G,kBAER9G,iBAAiB,UAAW,kBACzBC,KAAK8G,eAER/G,iBAAiB,WAAY,kBAC1BC,KAAK+G,WAqaL,CAAsBJ,OClhBb,SAAiBK,EAAQC,UACnCD,GAAU,EACHA,GAAUC,GAETD,GAAUC,IAAS,IAAMA,ICJzC,SAASC,EAAqBC,EAASF,EAAMG,QACvCC,sBAAwBF,OACxBF,KAAOA,OACPG,KAAOA,OACPrH,iBAAiB,OAAQ,kBACtBC,KAAKiH,YAERlH,iBAAiB,OAAQ,kBACtBC,KAAKoH,YAERD,QAAU,kBACPnH,KAAKqH,uBAId,IAAIC,EAAI,IAAIJ,EAAqB,EAAG,EAAM,KACtCK,EAAI,IAAIL,EAAqB,EAAG,EAAM,KACtCM,EAAI,IAAIN,EAAqB,EAAG,EAAM,KACtCO,EAAI,IAAIP,EAAqB,EAAG,EAAM,KACtCQ,EAAW,IAAIvG,MAAMoG,EAAGD,EAAGG,EAAGD,KAEjB,SAAUP,MACtBA,EAAO,GAAKA,GAAQS,EAASpF,YAC1B,2BAEAoF,EAAST,ICvBbU,EAAUC,EAGVC,EAA4B,IAAI1G,MAAM,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,GAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,IAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,KAAQ,IAAO,IAAIA,MAAM,MAAQ,IAAO,IAAIA,MAAM,MAAQ,KAC/zB2G,EAAwB,IAAI3G,MAAM,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGnF,SAAS4G,EAAkBC,QACrBC,qBAAuBC,EAAyBF,GAAc,EAAK,QACnEG,SAAyB,EAAbH,OAEZjI,iBAAiB,uBAAwB,kBACtCC,KAAKiI,4BAERlI,iBAAiB,WAAY,kBAC1BC,KAAKmI,gBAERC,YAAc,kBACVpI,KAAKiI,qBAAqBd,WAAa,EAAKnH,KAAKmI,eAErDE,OAAS,SAAUC,OACnBC,EAAQD,SACLtI,KAAKiI,sBAAwBM,EAAMN,sBAAwBjI,KAAKmI,UAAYI,EAAMJ,UAI3FJ,EAAkBS,iBAAmB,SAAUzC,EAAGC,UAG1C8B,EAA0B,OAF5B9B,IAEoC8B,EAAuC,GAAhBH,EAAQ5B,EAAG,IAAc+B,EAAuC,GAAhBH,EAAQ5B,EAAG,IAAc+B,EAAwC,GAAjBH,EAAQ5B,EAAG,KAAe+B,EAAwC,GAAjBH,EAAQ5B,EAAG,KAAe+B,EAAwC,GAAjBH,EAAQ5B,EAAG,KAAe+B,EAAwC,GAAjBH,EAAQ5B,EAAG,KAAe+B,EAAwC,GAAjBH,EAAQ5B,EAAG,MAGhXgC,EAAkBU,wBAA0B,SAAUC,OACjDV,EAAaD,EAAkBY,0BAA0BD,UAC3C,MAAdV,EACIA,EAKDD,EAAkBY,0BAtCA,MAsC0BD,IAGpDX,EAAkBY,0BAA4B,SAAUD,WAEnDE,EAAiB,WACjBC,EAAiB,EACZvI,EAAI,EAAGA,EAAIuH,EAA0BvF,OAAQhC,IAAK,KACtDwI,EAAajB,EAA0BvH,GACvCyI,EAAaD,EAAW,MACxBC,GAAcL,SAEV,IAAIX,EAAkBe,EAAW,QAErCE,EAAiBhJ,KAAKwI,iBAAiBE,EAAkBK,GACzDC,EAAiBJ,MACHE,EAAW,KACXE,UAKfJ,GAAkB,EACd,IAAIb,EAAkBc,GAEvB,MAGRnI,MAAiBqH,ECrEbJ,EAAUC,EAuEdlH,MArEA,SAAmBK,EAAOC,MACpBA,IACJA,EAASD,GACNA,EAAQ,GAAKC,EAAS,OACnB,8CAEFD,MAAQA,OACRC,OAASA,MACViI,EAAUlI,GAAS,EACD,IAAT,GAARA,aAGAkI,QAAUA,OACVhC,KAAO,IAAI9F,MAAM8H,EAAUjI,OAC3B,IAAIV,EAAI,EAAGA,EAAIN,KAAKiH,KAAK3E,OAAQhC,SAChC2G,KAAK3G,GAAK,OAEXP,iBAAiB,QAAS,kBACvBC,KAAKe,aAERhB,iBAAiB,SAAU,kBACxBC,KAAKgB,cAERjB,iBAAiB,YAAa,cAC9BC,KAAKe,OAASf,KAAKgB,YAChB,0DAEAhB,KAAKe,aAGRmI,YAAc,SAAUtJ,EAAGC,OAC3BsJ,EAAStJ,EAAIG,KAAKiJ,SAAWrJ,GAAK,UACmB,IAAN,EAA1C+H,EAAQ3H,KAAKiH,KAAKkC,GAAc,GAAJvJ,UAEjCwJ,YAAc,SAAUxJ,EAAGC,OAC3BsJ,EAAStJ,EAAIG,KAAKiJ,SAAWrJ,GAAK,QACjCqH,KAAKkC,IAAW,IAAU,GAAJvJ,SAEvByJ,KAAO,SAAUzJ,EAAGC,OACpBsJ,EAAStJ,EAAIG,KAAKiJ,SAAWrJ,GAAK,QACjCqH,KAAKkC,IAAW,IAAU,GAAJvJ,SAEvB0J,MAAQ,mBACRjH,EAAMrC,KAAKiH,KAAK3E,OACXhC,EAAI,EAAGA,EAAI+B,EAAK/B,SACnB2G,KAAK3G,GAAK,QAGZiJ,UAAY,SAAUC,EAAMC,EAAK1I,EAAOC,MACxCyI,EAAM,GAAKD,EAAO,OACf,sCAEHxI,EAAS,GAAKD,EAAQ,OACnB,0CAEH2I,EAAQF,EAAOzI,EACf4I,EAASF,EAAMzI,KACf2I,EAAS3J,KAAKgB,QAAU0I,EAAQ1J,KAAKe,WAClC,4CAEF,IAAIlB,EAAI4J,EAAK5J,EAAI8J,EAAQ9J,YACzBsJ,EAAStJ,EAAIG,KAAKiJ,QACbrJ,EAAI4J,EAAM5J,EAAI8J,EAAO9J,SACxBqH,KAAKkC,GAAUvJ,GAAK,KAAO,IAAU,GAAJA,KC/D1C,SAASgK,EAAI9J,EAAO+J,QACd/J,MAAQA,OACR+J,cAAgBA,OAEhB9J,iBAAiB,QAAS,kBACvBC,KAAKF,aAERC,iBAAiB,gBAAiB,kBAC/BC,KAAK6J,gBAId,SAASC,EAASC,EAAqBC,EAAWC,QAC5CF,oBAAsBA,EAE1B/J,KAAKkK,SADFD,EACa,IAAI9I,MAAM6I,EAAWC,GAErB,IAAI9I,MAAM6I,QAEtBjK,iBAAiB,sBAAuB,kBACrCC,KAAK+J,2BAGRhK,iBAAiB,mBAAoB,kBAClCC,KAAK+J,oBAAsB/J,KAAKmK,iBAGnCpK,iBAAiB,YAAa,mBAC9BqK,EAAQ,EACH9J,EAAI,EAAGA,EAAIN,KAAKkK,SAAS5H,OAAQhC,OAChCN,KAAKkK,SAAS5J,GAAGgC,cAEpB8H,SAGHC,YAAc,kBACXrK,KAAKkK,UAId,SAASI,EAAQC,EAAeC,EAAyBR,EAAWC,EAAWQ,EAAWC,QACpFH,cAAgBA,OAChBC,wBAA0BA,OAC1BN,SAAW,IAAI/I,MAAM6I,EAAWC,EAAWQ,EAAWC,WAEvDN,EAAQ,EACRO,EAAcX,EAAUY,oBACxBC,EAAWb,EAAUK,cAChB/J,EAAI,EAAGA,EAAIuK,EAASvI,OAAQhC,IAAK,KACrCwK,EAAUD,EAASvK,MACdwK,EAAQ3E,OAAS2E,EAAQC,cAAgBJ,QAE9CK,eAAiBZ,OAEjBrK,iBAAiB,gBAAiB,kBAC/BC,KAAKuK,qBAGRxK,iBAAiB,0BAA2B,kBACzCC,KAAKwK,+BAERzK,iBAAiB,iBAAkB,kBAChCC,KAAKgL,sBAERjL,iBAAiB,sBAAuB,kBACrC,GAAK,EAAIC,KAAKuK,qBAGjBU,qBAAuB,eACvBC,EAAYlL,KAAKmL,oBACjBC,EAAY,IAAIC,EAAUH,KAGpB3B,UAAU,EAAG,EAAG,EAAG,KAEnBA,UAAU2B,EAAY,EAAG,EAAG,EAAG,KAE/B3B,UAAU,EAAG2B,EAAY,EAAG,EAAG,WAGrC7I,EAAMrC,KAAKwK,wBAAwBlI,OAC9B1C,EAAI,EAAGA,EAAIyC,EAAKzC,YACpBU,EAAIN,KAAKwK,wBAAwB5K,GAAK,EACjCC,EAAI,EAAGA,EAAIwC,EAAKxC,IACd,GAALD,IAAgB,GAALC,GAAUA,GAAKwC,EAAM,IAAQzC,GAAKyC,EAAM,GAAU,GAALxC,KAInD0J,UAAUvJ,KAAKwK,wBAAwB3K,GAAK,EAAGS,EAAG,EAAG,YAKvDiJ,UAAU,EAAG,EAAG,EAAG2B,EAAY,MAE/B3B,UAAU,EAAG,EAAG2B,EAAY,GAAI,GAEtClL,KAAKuK,cAAgB,MAEdhB,UAAU2B,EAAY,GAAI,EAAG,EAAG,KAEhC3B,UAAU,EAAG2B,EAAY,GAAI,EAAG,IAGpCE,QAEHE,oBAAsB,SAAUC,UAC7BvL,KAAKkK,SAASqB,EAAQpE,YAI/BmD,EAAQkB,oBAAsB,IAAIrK,MAAM,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,MAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,OAAS,QAEjVmJ,EAAQmB,SAgDA,IAAItK,MAAM,IAAImJ,EAAQ,EAAG,IAAInJ,MAAS,IAAI2I,EAAS,EAAG,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAC7K,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,MACnK,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,MACnK,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KACnK,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACpM,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,MACnK,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACvM,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACvN,IAAIU,EAAQ,EAAG,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACxN,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACxO,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACxN,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,MACxO,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MAC1N,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MAChP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MAC7O,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,MAC9O,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,MACjP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,MAChP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,MACjP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAClP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MACrO,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,MACrN,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACxP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MACvP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACvP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MACvP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACvP,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,GAAI,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,GAAI,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC5P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC5P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,GAAI,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC/P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC7P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC9O,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MAC/P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,MAC7P,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACpQ,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,GAAI,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,EAAG,IAAK,IAAIA,EAAI,GAAI,MAClQ,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACpQ,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,EAAG,KAAM,IAAIA,EAAI,GAAI,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACpQ,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,EAAG,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,MACnQ,IAAIU,EAAQ,GAAI,IAAInJ,MAAM,EAAG,GAAI,GAAI,GAAI,IAAK,IAAK,KAAM,IAAI2I,EAAS,GAAI,IAAIF,EAAI,GAAI,KAAM,IAAIA,EAAI,EAAG,MAAO,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,KAAM,IAAIE,EAAS,GAAI,IAAIF,EAAI,GAAI,IAAK,IAAIA,EAAI,GAAI,OArFtQU,EAAQoB,oBAAsB,SAAUnB,MACnCA,EAAgB,GAAKA,EAAgB,QAClC,2BAEAD,EAAQmB,SAASlB,EAAgB,IAGzCD,EAAQqB,kCAAoC,SAAUT,MACjDA,EAAY,GAAK,OACd,qDAGCZ,EAAQoB,oBAAqBR,EAAY,IAAO,GAExD,MAAOU,QACA,8BAIRtB,EAAQuB,yBAA2B,SAAUC,WACxClD,EAAiB,WACjBmD,EAAc,EACTzL,EAAI,EAAGA,EAAIgK,EAAQkB,oBAAoBlJ,OAAQhC,IAAK,KACxD0L,EAAgB1B,EAAQkB,oBAAoBlL,MAE5C0L,GAAiBF,SACb9L,KAAK0L,oBAAoBpL,EAAI,OAIjC0I,EAAiBjB,EAAkBS,iBAAiBsD,EAAaE,GACjEhD,EAAiBJ,MACNtI,EAAI,IACD0I,UAKfJ,GAAkB,EACd5I,KAAK0L,oBAAoBK,GAG1B,MA8CRrL,MAAiB4J,EC3Mb2B,GAEJA,oBAAkC,SAAUtL,EAAOuL,EAAQtL,WACtDG,EAAQH,EAAKG,MACbC,EAASJ,EAAKI,OAEdmL,GAAS,EACJhD,EAAS,EAAGA,EAAS+C,EAAO5J,QAAU6J,EAAQhD,GAAU,EAAG,KAC/DvJ,EAAIK,KAAKC,MAAMgM,EAAO/C,IACtBtJ,EAAII,KAAKC,MAAMgM,EAAO/C,EAAS,OAC/BvJ,GAAM,GAAKA,EAAImB,GAASlB,GAAM,GAAKA,EAAImB,OACpC,gCAEE,GACE,GAAPpB,KACIuJ,GAAU,KACR,GAEDvJ,GAAKmB,MACNoI,GAAUpI,EAAQ,KAChB,IAEC,GAAPlB,KACIsJ,EAAS,GAAK,KACZ,GAEDtJ,GAAKmB,MACNmI,EAAS,GAAKnI,EAAS,KACrB,MAIF,MACAmI,EAAS+C,EAAO5J,OAAS,EAAG6G,GAAU,GAAKgD,EAAQhD,GAAU,EAAG,CACpEvJ,EAAIK,KAAKC,MAAMgM,EAAO/C,IACtBtJ,EAAII,KAAKC,MAAMgM,EAAO/C,EAAS,OAC/BvJ,GAAM,GAAKA,EAAImB,GAASlB,GAAM,GAAKA,EAAImB,OACpC,gCAEE,GACE,GAAPpB,KACIuJ,GAAU,KACR,GAEDvJ,GAAKmB,MACNoI,GAAUpI,EAAQ,KAChB,IAEC,GAAPlB,KACIsJ,EAAS,GAAK,KACZ,GAEDtJ,GAAKmB,MACNmI,EAAS,GAAKnI,EAAS,KACrB,KAKZiL,YAA0B,SAAUtL,EAAOC,EAAMsK,EAAWkB,WACvDnF,EAAO,IAAIoE,EAAUH,GACrBgB,EAAS,IAAI/K,MAAM+J,GAAa,GAC3BrL,EAAI,EAAGA,EAAIqL,EAAWrL,IAAK,SAC/BwC,EAAM6J,EAAO5J,OACb+J,EAASxM,EAAI,GACRD,EAAI,EAAGA,EAAIyC,EAAKzC,GAAK,IACtBA,GAAgB,IAAVA,GAAK,KACXA,EAAI,GAAKyM,IAEPC,iBAAiBJ,KAGfK,oBAAoB5L,EAAOuL,EAAQtL,WAErChB,EAAI,EAAGA,EAAIyC,EAAKzC,GAAK,EAAG,CAEtBe,EAAMV,KAAKC,MAAMgM,EAAOtM,IAAMgB,EAAKG,MAAQd,KAAKC,MAAMgM,EAAOtM,EAAI,MAO1EqH,EAAKmC,YAAYxJ,GAAK,EAAGC,IAG5B,MAAO2M,QAQA,oCAGDvF,MASSgF,EC7GjB,SAASQ,EAAqBC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,QAChER,IAAMA,OACNG,IAAMA,OACNG,IAAMA,OACNL,IAAMA,OACNG,IAAMA,OACNG,IAAMA,OACNL,IAAMA,OACNG,IAAMA,OACNG,IAAMA,OACNZ,iBAAmB,SAAUJ,WAC7B7J,EAAM6J,EAAO5J,OACboK,EAAM1M,KAAK0M,IACXG,EAAM7M,KAAK6M,IACXG,EAAMhN,KAAKgN,IACXL,EAAM3M,KAAK2M,IACXG,EAAM9M,KAAK8M,IACXG,EAAMjN,KAAKiN,IACXL,EAAM5M,KAAK4M,IACXG,EAAM/M,KAAK+M,IACXG,EAAMlN,KAAKkN,IACN5M,EAAI,EAAGA,EAAI+B,EAAK/B,GAAK,EAAG,KAC5BV,EAAIsM,EAAO5L,GACXT,EAAIqM,EAAO5L,EAAI,GACf6M,EAAcH,EAAMpN,EAAIqN,EAAMpN,EAAIqN,IAC/B5M,IAAMoM,EAAM9M,EAAI+M,EAAM9M,EAAI+M,GAAOO,IACjC7M,EAAI,IAAMuM,EAAMjN,EAAIkN,EAAMjN,EAAIkN,GAAOI,SAGzCC,iBAAmB,SAAUC,EAASC,WACtCC,EAAIF,EAAQ/K,OACPhC,EAAI,EAAGA,EAAIiN,EAAGjN,IAAK,KACvBV,EAAIyN,EAAQ/M,GACZT,EAAIyN,EAAQhN,GACZ6M,EAAcnN,KAAKgN,IAAMpN,EAAII,KAAKiN,IAAMpN,EAAIG,KAAKkN,MAC7C5M,IAAMN,KAAK0M,IAAM9M,EAAII,KAAK2M,IAAM9M,EAAIG,KAAK4M,KAAOO,IAChD7M,IAAMN,KAAK6M,IAAMjN,EAAII,KAAK8M,IAAMjN,EAAIG,KAAK+M,KAAOI,SAIrDK,aAAe,kBAEZ,IAAIf,EAAqBzM,KAAK8M,IAAM9M,KAAKkN,IAAMlN,KAAKiN,IAAMjN,KAAK+M,IAAK/M,KAAKiN,IAAMjN,KAAK4M,IAAM5M,KAAK2M,IAAM3M,KAAKkN,IAAKlN,KAAK2M,IAAM3M,KAAK+M,IAAM/M,KAAK8M,IAAM9M,KAAK4M,IAAK5M,KAAKgN,IAAMhN,KAAK+M,IAAM/M,KAAK6M,IAAM7M,KAAKkN,IAAKlN,KAAK0M,IAAM1M,KAAKkN,IAAMlN,KAAKgN,IAAMhN,KAAK4M,IAAK5M,KAAK6M,IAAM7M,KAAK4M,IAAM5M,KAAK0M,IAAM1M,KAAK+M,IAAK/M,KAAK6M,IAAM7M,KAAKiN,IAAMjN,KAAKgN,IAAMhN,KAAK8M,IAAK9M,KAAKgN,IAAMhN,KAAK2M,IAAM3M,KAAK0M,IAAM1M,KAAKiN,IAAKjN,KAAK0M,IAAM1M,KAAK8M,IAAM9M,KAAK6M,IAAM7M,KAAK2M,WAE1Zc,MAAQ,SAAUlF,UACf,IAAIkE,EAAqBzM,KAAK0M,IAAMnE,EAAMmE,IAAM1M,KAAK2M,IAAMpE,EAAMsE,IAAM7M,KAAK4M,IAAMrE,EAAMyE,IAAKhN,KAAK0M,IAAMnE,EAAMoE,IAAM3M,KAAK2M,IAAMpE,EAAMuE,IAAM9M,KAAK4M,IAAMrE,EAAM0E,IAAKjN,KAAK0M,IAAMnE,EAAMqE,IAAM5M,KAAK2M,IAAMpE,EAAMwE,IAAM/M,KAAK4M,IAAMrE,EAAM2E,IAAKlN,KAAK6M,IAAMtE,EAAMmE,IAAM1M,KAAK8M,IAAMvE,EAAMsE,IAAM7M,KAAK+M,IAAMxE,EAAMyE,IAAKhN,KAAK6M,IAAMtE,EAAMoE,IAAM3M,KAAK8M,IAAMvE,EAAMuE,IAAM9M,KAAK+M,IAAMxE,EAAM0E,IAAKjN,KAAK6M,IAAMtE,EAAMqE,IAAM5M,KAAK8M,IAAMvE,EAAMwE,IAAM/M,KAAK+M,IAAMxE,EAAM2E,IAAKlN,KAAKgN,IAAMzE,EAAMmE,IAAM1M,KAAKiN,IAAM1E,EAAMsE,IAAM7M,KAAKkN,IAAM3E,EAAMyE,IAAKhN,KAAKgN,IAAMzE,EAAMoE,IAAM3M,KAAKiN,IAAM1E,EAAMuE,IAAM9M,KAAKkN,IAAM3E,EAAM0E,IAAKjN,KAAKgN,IAAMzE,EAAMqE,IAAM5M,KAAKiN,IAAM1E,EAAMwE,IAAM/M,KAAKkN,IAAM3E,EAAM2E,MAKjoBT,EAAqBiB,6BAA+B,SAAUC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,OAE5HC,EAAO3O,KAAK4O,sBAAsBjB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,UACvDlO,KAAK6O,sBAAsBV,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,EAAKC,GAC7DjB,MAAMkB,IAGnBlC,EAAqBoC,sBAAwB,SAAUlB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,OAC9EY,EAAMZ,EAAKF,EACXe,EAAMnB,EAAKE,EAAKE,EAAKE,KACd,GAAPY,GAAqB,GAAPC,SACV,IAAItC,EAAqBoB,EAAKF,EAAII,EAAKF,EAAIF,EAAIG,EAAKF,EAAII,EAAKF,EAAIF,EAAI,EAAK,EAAK,OAGlFoB,EAAMnB,EAAKE,EACXkB,EAAMhB,EAAKF,EACXmB,EAAMvB,EAAKE,EAAKE,EAAKE,EACrBkB,EAAMrB,EAAKE,EACXb,EAAc6B,EAAMF,EAAMG,EAAME,EAChCnC,GAAOkC,EAAMJ,EAAMG,EAAMF,GAAO5B,EAChCF,GAAO+B,EAAMD,EAAMG,EAAMC,GAAOhC,SAC7B,IAAIV,EAAqBoB,EAAKF,EAAKX,EAAMa,EAAII,EAAKN,EAAKV,EAAMgB,EAAIN,EAAIG,EAAKF,EAAKZ,EAAMc,EAAII,EAAKN,EAAKX,EAAMiB,EAAIN,EAAIZ,EAAKC,EAAK,IAIpIR,EAAqBmC,sBAAwB,SAAUjB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,UAE3ElO,KAAK6O,sBAAsBlB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAAIV,gBAGnE9M,MAAiB+L,ECwLjB/L,MA5PA,SAAkB0O,EAAWxO,QACvBD,MAAQyO,OACRnO,oBAAsB,UAEtBoO,yBAA2B,SAAUC,EAAOC,EAAOC,EAAKC,OAGxDC,EAAQzP,KAAKO,IAAIiP,EAAMF,GAAStP,KAAKO,IAAIgP,EAAMF,MAC/CI,EAAO,KACNlL,EAAO8K,IACHC,IACA/K,IACDgL,IACDC,IACAjL,UAGHmL,EAAK1P,KAAKO,IAAIgP,EAAMF,GACpBM,EAAK3P,KAAKO,IAAIiP,EAAMF,GACpBM,GAAUF,GAAM,EAChBG,EAAQP,EAAQE,EAAM,GAAM,EAC5BM,EAAQT,EAAQE,EAAM,GAAM,EAC5BQ,EAAQ,EACHpQ,EAAI0P,EAAOzP,EAAI0P,EAAO3P,GAAK4P,EAAK5P,GAAKmQ,EAAO,KAEhDE,EAAQP,EAAQ7P,EAAID,EACpBsQ,EAAQR,EAAQ9P,EAAIC,KACX,GAATmQ,EAEChQ,KAAKW,MAAMsP,EAAQC,EAAQtP,EAAKG,YAK/Bf,KAAKW,MAAMsP,EAAQC,EAAQtP,EAAKG,YAKzB,GAATiP,EAAY,KAEXG,EAAQvQ,EAAI0P,EACZc,EAAQvQ,EAAI0P,SACTtP,KAAK6D,KAAMqM,EAAQA,EAAQC,EAAQA,UAElCR,GACG,EAAG,IACV/P,GAAK4P,WAGJK,KACIH,OAGPU,EAASb,EAAMF,EACfgB,EAASb,EAAMF,SACZtP,KAAK6D,KAAMuM,EAASA,EAASC,EAASA,SAIzCC,iCAAmC,SAAUjB,EAAOC,EAAOC,EAAKC,OAEhEe,EAASxQ,KAAKqP,yBAAyBC,EAAOC,EAAOC,EAAKC,GAG1DgB,EAAQ,EACRC,EAAWpB,GAASE,EAAMF,GAC1BoB,EAAW,KACNpB,GAASA,EAAQoB,KACd,GAEHA,GAAY9P,EAAKG,WAChBH,EAAKG,MAAQ,EAAIuO,IAAUoB,EAAWpB,KACpC1O,EAAKG,MAAQ,OAErB4P,EAAW1Q,KAAKC,MAAMqP,GAASE,EAAMF,GAASkB,YAE1C,EACJE,EAAW,KACNpB,GAASA,EAAQoB,KACd,GAEHA,GAAY/P,EAAKI,YAChBJ,EAAKI,OAAS,EAAIuO,IAAUoB,EAAWpB,KACrC3O,EAAKI,OAAS,KAEff,KAAKC,MAAMoP,GAASoB,EAAWpB,GAASmB,OAEzCzQ,KAAKqP,yBAAyBC,EAAOC,EAAOmB,EAAUC,IAChD,QAKZC,0BAA4B,SAAU/K,EAASgL,OAC/CC,EAAiB9Q,KAAKuQ,iCAAiCtQ,KAAKC,MAAM2F,EAAQlC,GAAI1D,KAAKC,MAAM2F,EAAQhC,GAAI5D,KAAKC,MAAM2Q,EAAalN,GAAI1D,KAAKC,MAAM2Q,EAAahN,IACzJkN,EAAiB/Q,KAAKuQ,iCAAiCtQ,KAAKC,MAAM2Q,EAAalN,GAAI1D,KAAKC,MAAM2Q,EAAahN,GAAI5D,KAAKC,MAAM2F,EAAQlC,GAAI1D,KAAKC,MAAM2F,EAAQhC,WACzJzB,MAAM0O,GACFC,EAAiB,EAErB3O,MAAM2O,GACFD,EAAiB,GAIjBA,EAAiBC,GAAkB,SAIvCC,oBAAsB,SAAUlK,EAASC,EAAUF,UAE/C7G,KAAK4Q,0BAA0B9J,EAASC,GAAY/G,KAAK4Q,0BAA0B9J,EAASD,IAAe,QAG/GtD,SAAW,SAAUC,EAAUC,OAC/BC,EAAQF,EAASG,EAAIF,EAASE,EAC9BC,EAAQJ,EAASK,EAAIJ,EAASI,SAC3B5D,KAAK6D,KAAMJ,EAAQA,EAAQE,EAAQA,SAEtCqN,iBAAmB,SAAUnK,EAASC,EAAUF,EAAYxG,OAI5D6K,EAAmE,GAF5CjL,KAAKiR,MAAMlR,KAAKuD,SAASuD,EAASC,GAAY1G,GAC9CJ,KAAKiR,MAAMlR,KAAKuD,SAASuD,EAASD,GAAcxG,IACT,UAC9C,EAAZ6K,QAGF,iBAKA,iBAIA,OACE,eAEDA,QAGHiG,sBAAwB,SAAUC,EAAsBC,EAAeC,EAAeC,OAGtFC,EAAYvR,KAAKC,MAAMqR,EAAkBH,GACzCK,EAAqBxR,KAAKoC,IAAI,EAAGgP,EAAgBG,GACjDE,EAAsBzR,KAAK0R,IAAI/Q,EAAKG,MAAQ,EAAGsQ,EAAgBG,MAC/DE,EAAsBD,EAA4C,EAAvBL,OACxC,YAGHQ,EAAoB3R,KAAKoC,IAAI,EAAGiP,EAAgBE,GAChDK,EAAuB5R,KAAK0R,IAAI/Q,EAAKI,OAAS,EAAGsQ,EAAgBE,UAE/C,IAAIM,EAAuB9R,KAAKW,MAAOC,EAAM6Q,EAAoBG,EAAmBF,EAAsBD,EAAoBI,EAAuBD,EAAmBR,EAAsBpR,KAAKiB,qBAClM0B,aAGnBoP,gBAAkB,SAAUjL,EAASC,EAAUF,EAAYmL,EAAkB9G,OAE7E+G,EACAC,EACAC,EACAC,EAJAC,EAAgBnH,EAAY,WAKR,MAApB8G,KACYA,EAAiBrO,IACjBqO,EAAiBnO,IACXuO,EAAqBC,EAAgB,MAI1CtL,EAASpD,EAAImD,EAAQnD,EAAKkD,EAAWlD,IACrCoD,EAASlD,EAAIiD,EAAQjD,EAAKgD,EAAWhD,IAChCuO,EAAqBC,GAG3B5F,EAAqBiB,6BAA6B,IAAK,IAAK2E,EAAe,IAAKF,EAAoBC,EAAoB,IAAKC,EAAevL,EAAQnD,EAAGmD,EAAQjD,EAAGkD,EAASpD,EAAGoD,EAASlD,EAAGoO,EAAcC,EAAcrL,EAAWlD,EAAGkD,EAAWhD,SAK3PyO,WAAa,SAAU3R,EAAOyL,EAAWlB,UAEtCe,EAAYsG,YAAY5R,EAAOC,EAAMsK,EAAWkB,SAGnDoG,yBAA2B,SAAUC,OAErC3L,EAAU2L,EAAKC,QACf3L,EAAW0L,EAAKE,SAChB9L,EAAa4L,EAAKG,WAElBvS,EAAaL,KAAKgR,oBAAoBlK,EAASC,EAAUF,MACzDxG,EAAa,OACV,YAEH6K,EAAYlL,KAAKiR,iBAAiBnK,EAASC,EAAUF,EAAYxG,GACjEwS,EAAqBvI,EAAQqB,kCAAkCT,GAC/D4H,EAA0BD,EAAmB1H,oBAAsB,EAEnE6G,EAAmB,QAEnBa,EAAmBE,wBAAwBzQ,OAAS,UAGnD2P,EAAelL,EAASpD,EAAImD,EAAQnD,EAAIkD,EAAWlD,EACnDuO,EAAenL,EAASlD,EAAIiD,EAAQjD,EAAIgD,EAAWhD,EAInDmP,EAAsB,EAAM,EAAMF,EAClCzB,EAAgBpR,KAAKC,MAAM4G,EAAQnD,EAAIqP,GAAuBf,EAAenL,EAAQnD,IACrF2N,EAAgBrR,KAAKC,MAAM4G,EAAQjD,EAAImP,GAAuBd,EAAepL,EAAQjD,IAGhFvD,EAAI,EAAGA,GAAK,GAAIA,IAAM,EAAG,GAGdN,KAAKmR,sBAAsB9Q,EAAYgR,EAAeC,EAAehR,aAWtF8L,EAAYpM,KAAK+R,gBAAgBjL,EAASC,EAAUF,EAAYmL,EAAkB9G,UAU/E,IAtPT,SAAwBjE,EAAMiF,QACxBjF,KAAOA,OACPiF,OAASA,EAoPN,CARIlM,KAAKsS,WAAWtS,KAAKW,MAAOyL,EAAWlB,GAG1B,MAApB8G,EACM,IAAI7Q,MAAM0F,EAAYC,EAASC,GAE/B,IAAI5F,MAAM0F,EAAYC,EAASC,EAAUiL,UAO/CiB,OAAS,eACTR,EAAO,IAAIS,EAAoBtS,GAAM2F,kBAAkBvG,KAAKW,cAEzDX,KAAKwS,yBAAyBC,KCpQnCU,EAAgB,SAAUpN,EAAGC,UACzBD,EAAIC,GA0KZtF,MAvKA,SAAS0S,EAAUC,EAAOC,MACL,MAAhBA,GAA+C,GAAvBA,EAAahR,YAClC,gCAEF+Q,MAAQA,MACTE,EAAqBD,EAAahR,UAClCiR,EAAqB,GAAwB,GAAnBD,EAAa,GAAS,SAE/CE,EAAe,EACZA,EAAeD,GAAoD,GAA9BD,EAAaE,WAGrDA,GAAgBD,OACdD,aAAeD,EAAMI,KAAKH,iBAE3B,MACCA,aAAe,IAAInS,MAAMoS,EAAqBC,OAC9C,IAAIlT,EAAI,EAAGA,EAAIN,KAAKsT,aAAahR,OAAQhC,SAASgT,aAAahT,GAAK,MAEpE,IAAIoT,EAAK,EAAGA,EAAK1T,KAAKsT,aAAahR,OAAQoR,SAAUJ,aAAaI,GAAMJ,EAAaE,EAAeE,cAIrGJ,aAAeA,OAGhBvT,iBAAiB,OAAQ,kBACE,GAAxBC,KAAKsT,aAAa,UAErBvT,iBAAiB,SAAU,kBACxBC,KAAKsT,aAAahR,OAAS,SAE9BvC,iBAAiB,eAAgB,kBAC9BC,KAAKsT,oBAGRK,eAAiB,SAAUC,UACxB5T,KAAKsT,aAAatT,KAAKsT,aAAahR,OAAS,EAAIsR,SAGpDC,WAAa,SAAU9N,MAClB,GAALA,SAEI/F,KAAK2T,eAAe,OAExBG,EAAO9T,KAAKsT,aAAahR,UACpB,GAALyD,EAAQ,SAEPyK,EAAS,EACJlQ,EAAI,EAAGA,EAAIwT,EAAMxT,MAChB6S,EAAc3C,EAAQxQ,KAAKsT,aAAahT,WAE3CkQ,MAEJuD,EAAU/T,KAAKsT,aAAa,OACvBhT,EAAI,EAAGA,EAAIwT,EAAMxT,MACf6S,EAAcnT,KAAKqT,MAAMW,SAASjO,EAAGgO,GAAU/T,KAAKsT,aAAahT,WAErEyT,QAGHZ,cAAgB,SAAU5K,MAC1BvI,KAAKqT,OAAS9K,EAAM8K,WACjB,6CAEHrT,KAAKyT,YACDlL,KAEJA,EAAMkL,YACFzT,SAGJiU,EAAsBjU,KAAKsT,aAC3BY,EAAqB3L,EAAM+K,gBAC3BW,EAAoB3R,OAAS4R,EAAmB5R,OAAQ,KACvDkC,EAAOyP,IACWC,IACD1P,UAElB2P,EAAU,IAAIhT,MAAM+S,EAAmB5R,QACvC8R,EAAaF,EAAmB5R,OAAS2R,EAAoB3R,OAGxDoR,EAAK,EAAGA,EAAKU,EAAYV,MAAaA,GAAMQ,EAAmBR,OAEnE,IAAIpT,EAAI8T,EAAY9T,EAAI4T,EAAmB5R,OAAQhC,MAC/CA,GAAK6S,EAAcc,EAAoB3T,EAAI8T,GAAaF,EAAmB5T,WAG7E,IAAI8S,EAAUC,EAAOc,SAExBE,UAAY,SAAU9L,MACtBvI,KAAKqT,OAAS9K,EAAM8K,WACjB,6CAEHrT,KAAKyT,MAAQlL,EAAMkL,YACfzT,KAAKqT,MAAMI,aAEfa,EAAgBtU,KAAKsT,aACrBiB,EAAUD,EAAchS,OACxBkS,EAAgBjM,EAAM+K,aACtBmB,EAAUD,EAAclS,OACxBoS,EAAU,IAAIvT,MAAMoT,EAAUE,EAAU,GACnCnU,EAAI,EAAGA,EAAIiU,EAASjU,YACxBqU,EAASL,EAAchU,GAClBC,EAAI,EAAGA,EAAIkU,EAASlU,MACpBD,EAAIC,GAAK4S,EAAcuB,EAAQpU,EAAIC,GAAIP,KAAKqT,MAAMW,SAASW,EAAQH,EAAcjU,YAGpF,IAAI6S,EAAUpT,KAAKqT,MAAOqB,SAE7BE,UAAY,SAAUC,MACZ,GAAVA,SACI7U,KAAKqT,MAAMI,QAEL,GAAVoB,SACI7U,aAEJ8T,EAAO9T,KAAKsT,aAAahR,OACzBoS,EAAU,IAAIvT,MAAM2S,GACfxT,EAAI,EAAGA,EAAIwT,EAAMxT,MACjBA,GAAKN,KAAKqT,MAAMW,SAAShU,KAAKsT,aAAahT,GAAIuU,UAEjD,IAAIzB,EAAUpT,KAAKqT,MAAOqB,SAE7BI,mBAAqB,SAAUlB,EAAQmB,MACvCnB,EAAS,OACN,8BAEY,GAAfmB,SACI/U,KAAKqT,MAAMI,aAEfK,EAAO9T,KAAKsT,aAAahR,OACzBoS,EAAU,IAAIvT,MAAM2S,EAAOF,GACtBtT,EAAI,EAAGA,EAAIoU,EAAQpS,OAAQhC,MAAYA,GAAK,MAC5CA,EAAI,EAAGA,EAAIwT,EAAMxT,MACjBA,GAAKN,KAAKqT,MAAMW,SAAShU,KAAKsT,aAAahT,GAAIyU,UAEjD,IAAI3B,EAAUpT,KAAKqT,MAAOqB,SAE7BM,OAAS,SAAUzM,MACnBvI,KAAKqT,OAAS9K,EAAM8K,WACjB,6CAEH9K,EAAMkL,UACH,sBAGHwB,EAAWjV,KAAKqT,MAAMI,KACtByB,EAAYlV,KAEZmV,EAAyB5M,EAAMoL,eAAepL,EAAM6M,QACpDC,EAAgCrV,KAAKqT,MAAMiC,QAAQH,GAEhDD,EAAUE,QAAU7M,EAAM6M,SAAWF,EAAUzB,MAAM,KACvD8B,EAAmBL,EAAUE,OAAS7M,EAAM6M,OAC5C3E,EAAQzQ,KAAKqT,MAAMW,SAASkB,EAAUvB,eAAeuB,EAAUE,QAASC,GACxEG,EAAOjN,EAAMuM,mBAAmBS,EAAkB9E,GAClDgF,EAAoBzV,KAAKqT,MAAMqC,cAAcH,EAAkB9E,KACxDwE,EAAS9B,cAAcsC,KACtBP,EAAU/B,cAAcqC,UAG9B,IAAIrU,MAAM8T,EAAUC,KCrK7B,SAASS,EAAMC,QACTC,SAAW,IAAI1U,MAAM,UACrB2U,SAAW,IAAI3U,MAAM,aACtBvB,EAAI,EACCU,EAAI,EAAGA,EAAI,IAAKA,SACnBuV,SAASvV,GAAKV,OACb,IACG,SACHgW,OAGEtV,EAAI,EAAGA,EAAI,IAAKA,SACnBwV,SAAS9V,KAAK6V,SAASvV,IAAMA,MAG/ByV,EAAM,IAAI5U,MAAM,KAAQ,GAAK,OAC5B6U,KAAO,IAAI5C,EAAUpT,KAAM,IAAImB,MAAM4U,QACtCE,EAAM,IAAI9U,MAAM,KAAQ,GAAK,OAC5B+U,IAAM,IAAI9C,EAAUpT,KAAM,IAAImB,MAAM8U,SAEpClW,iBAAiB,OAAQ,kBACtBC,KAAKgW,YAERjW,iBAAiB,MAAO,kBACrBC,KAAKkW,WAERR,cAAgB,SAAU9B,EAAQmB,MAClCnB,EAAS,OACN,8BAEY,GAAfmB,SACI/U,KAAKgW,aAET1C,EAAe,IAAInS,MAAMyS,EAAS,GAC7BtT,EAAI,EAAGA,EAAIgT,EAAahR,OAAQhC,MAAiBA,GAAK,WAClD,GAAKyU,EACX,IAAI3B,EAAUpT,KAAMsT,SAEvB6C,IAAM,SAAUpQ,UACb/F,KAAK6V,SAAS9P,SAEjBqQ,IAAM,SAAUrQ,MACX,GAALA,OACG,kCAEA/F,KAAK8V,SAAS/P,SAEjBuP,QAAU,SAAUvP,MACf,GAALA,OACG,oCAEA/F,KAAK6V,SAAS,IAAM7V,KAAK8V,SAAS/P,UAErCiO,SAAW,SAAUjO,EAAGC,UACnB,GAALD,GAAe,GAALC,EACN,EAEC,GAALD,EACIC,EAEC,GAALA,EACID,EAED/F,KAAK6V,UAAU7V,KAAK8V,SAAS/P,GAAK/F,KAAK8V,SAAS9P,IAAM,MAI/D2P,EAAMU,cAAgB,IAAIV,EAAM,KAChCA,EAAMW,kBAAoB,IAAIX,EAAM,KAEpCA,EAAMxC,cAAgB,SAAUpN,EAAGC,UAC3BD,EAAIC,GAGZtF,MAAiBiV,EC1EbhO,EAAUC,EAEV2O,KAEJA,EAASC,aAAe,SAAUC,MAC7BA,EAAY,GAAKA,EAAY,OAC1B,kCAEAF,EAASG,WAAWD,IA6H5BF,EAASG,WAAa,IAAIvV,MAAM,IA1HhC,gBACMwV,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UACD,IAAlBD,EAAIC,EAAK,KA+G+B,IA3GnD,gBACMoW,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UACP,IAAT,EAAJD,KAgG4D,IA5FtE,gBACMqW,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UACrBA,EAAI,GAAK,IAiFuE,IA7EzF,gBACMoW,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UACpBD,EAAIC,GAAK,GAAK,IAkEoF,IA9D5G,gBACMoW,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UACmB,IAArCoH,EAAQrH,EAAG,GAAOC,EAAI,EAAM,KAmDuF,IA/C/H,gBACMoW,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,OACxBiE,EAAOlE,EAAIC,SACA,EAAPiE,GAAgBA,EAAO,GAAM,IAmC2G,IA/BlJ,gBACMmS,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,OACxBiE,EAAOlE,EAAIC,SACiC,KAA/B,EAAPiE,GAAgBA,EAAO,EAAM,KAmB4H,IAfrK,gBACMmS,gBAAkB,SAAU1P,EAAMiE,OACjC,IAAI5K,EAAI,EAAGA,EAAI4K,EAAW5K,QACzB,IAAIC,EAAI,EAAGA,EAAI2K,EAAW3K,IAC1BP,KAAK4W,SAAStW,EAAGC,MACf8I,KAAK9I,EAAGD,SAKZsW,SAAW,SAAUtW,EAAGC,UAC0B,KAA3CD,EAAIC,EAAK,GAAUD,EAAIC,EAAK,EAAM,MAM/CG,MAAiB6V,EChHjB,SAASM,EAAUC,EAAkBC,QAC/BD,iBAAmBA,OACnBC,UAAYA,OAEZhX,iBAAiB,mBAAoB,kBAClCC,KAAK8W,wBAER/W,iBAAiB,YAAa,kBAC3BC,KAAK+W,YAIdF,EAAUG,cAAgB,SAAUC,EAAcC,EAAS3L,MAEtD0L,EAAa3U,QAAU4U,EAAQC,oBAC5B,4BAKHjN,EAAWgN,EAAQ5L,oBAAoBC,GAGvC6L,EAAc,EACdC,EAAenN,EAASG,cACnB/J,EAAI,EAAGA,EAAI+W,EAAa/U,OAAQhC,OACzB+W,EAAa/W,GAAG6F,cAI5BqK,EAAS,IAAIrP,MAAMiW,GACnBE,EAAkB,EACb/W,EAAI,EAAGA,EAAI8W,EAAa/U,OAAQ/B,SACpCuK,EAAUuM,EAAa9W,OAClBD,EAAI,EAAGA,EAAIwK,EAAQ3E,MAAO7F,IAAK,KACnCwW,EAAmBhM,EAAQC,cAC3BwM,EAAoBrN,EAASU,oBAAsBkM,IAChDQ,KAAqB,IAAIT,EAAUC,EAAkB,IAAI3V,MAAMoW,aAMpEC,EAA8BhH,EAAO,GAAGuG,UAAUzU,OAClDmV,EAAsBjH,EAAOlO,OAAS,EACnCmV,GAAuB,GAAG,IACbjH,EAAOiH,GAAqBV,UAAUzU,QACrCkV,oBAOjBE,EAAgCF,EAA8BtN,EAASU,oBAGvE+M,EAAqB,MAChBrX,EAAI,EAAGA,EAAIoX,EAA+BpX,QACzCC,EAAI,EAAGA,EAAI+W,EAAiB/W,MAC7BA,GAAGwW,UAAUzW,GAAK2W,EAAaU,SAI/BpX,EAAIkX,EAAqBlX,EAAI+W,EAAiB/W,MAC/CA,GAAGwW,UAAUW,GAAiCT,EAAaU,SAG/DtV,EAAMmO,EAAO,GAAGuG,UAAUzU,WACrBhC,EAAIoX,EAA+BpX,EAAI+B,EAAK/B,QAC3CC,EAAI,EAAGA,EAAI+W,EAAiB/W,IAAK,KACrCqX,EAAUrX,EAAIkX,EAAsBnX,EAAIA,EAAI,IACzCC,GAAGwW,UAAUa,GAAWX,EAAaU,YAGvCnH,GAGR9P,MAAiBmW,ECvGbgB,IACF,GAAI,EAAG,EAAG,IACV,GAAI,GAAI,GAAI,KACZ,GAAI,GAAI,GAAI,KAqRdnX,MAlRA,SAA+BoX,EAAQZ,EAASa,QAC1CC,aAAe,OACfC,WAAa,OACbC,WAAa,OACbJ,OAASA,OACTC,uBAAyBA,EAC1Bb,GAAW,EACdlX,KAAKmY,eAAiB,EACdjB,GAAW,IAAMA,GAAW,GACpClX,KAAKmY,eAAiB,EACdjB,GAAW,IAAMA,GAAW,KACpClX,KAAKmY,eAAiB,QAElBC,YAAc,SAAUC,OACxBpR,EAAO,KACPoR,EAAUrY,KAAKiY,WAAa,EAAG,SAE9BK,EAAO,EACFhY,EAAI,EAAGA,EAAI+X,EAAS/X,OACnB,GAAKA,aAELN,KAAKiY,WAAaI,EAAU,KAE9BrY,KAAK8X,OAAO9X,KAAKgY,cAAgBM,IAAUtY,KAAKiY,WAAaI,EAAU,OAC1EJ,YAAcI,EACZpR,EAEH,GAAIoR,EAAUrY,KAAKiY,WAAa,EAAI,EAAG,KAEvCM,EAAQ,MACHjY,EAAI,EAAGA,EAAIN,KAAKiY,WAAa,EAAG3X,OAC9B,GAAKA,YAERN,KAAK8X,OAAO9X,KAAKgY,cAAgBO,IAAWF,GAAWrY,KAAKiY,WAAa,QAC5ED,kBACKhY,KAAK8X,OAAO9X,KAAKgY,eAAmB,GAAKK,GAAWrY,KAAKiY,WAAa,SAE3EA,WAAajY,KAAKiY,WAAaI,EAAU,EAC1CrY,KAAKiY,WAAa,SAChBA,WAAa,EAAIjY,KAAKiY,YAErBhR,EAEH,GAAIoR,EAAUrY,KAAKiY,WAAa,EAAI,GAAI,CAExCM,EAAQ,MACRC,EAAQ,MAIHlY,EAAI,EAAGA,EAAIN,KAAKiY,WAAa,EAAG3X,OAC9B,GAAKA,MAEZmY,GAAkBzY,KAAK8X,OAAO9X,KAAKgY,cAAgBO,IAAWF,GAAWrY,KAAKiY,WAAa,QAC1FD,mBAEDU,EAAkB1Y,KAAK8X,OAAO9X,KAAKgY,eAAkBK,GAAWrY,KAAKiY,WAAa,EAAI,YACrFD,eAEI1X,EAAI,EAAGA,EAAI+X,GAAWrY,KAAKiY,WAAa,EAAI,GAAI3X,OAC9C,GAAKA,aAEN,GAAK+X,GAAWrY,KAAKiY,WAAa,EAAI,MAGzCQ,EAAiBC,IAFF1Y,KAAK8X,OAAO9X,KAAKgY,cAAgBQ,IAAW,GAAKH,GAAWrY,KAAKiY,WAAa,EAAI,UAGnGA,WAAajY,KAAKiY,YAAcI,EAAU,GAAK,EAChDrY,KAAKiY,WAAa,SAChBA,WAAa,EAAIjY,KAAKiY,YAErBhR,SAGA,QAGJ0R,SAAW,kBACV3Y,KAAKgY,aAAehY,KAAK8X,OAAOxV,OAAStC,KAAK+X,uBAAyB,EACpE,EAEA/X,KAAKoY,YAAY,SAErBQ,cAAgB,SAAUC,WAC1BtW,EAAQ,EAENsW,GAAiBtW,GAAU,cAK1BvC,KAAKoY,YAAYP,EAAqB7X,KAAKmY,gBAAgB5V,UAE9DuW,wBAA0B,SAAUZ,OACpC5V,EAAS4V,EACTa,EAAU,EACVC,EAAU,GACVC,EAAsB,IAAI9X,MAAM,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,WAE3PmB,EAAS,EAAG,KAGX4W,KAFMlZ,KAAKoY,YAAY,KAEE,MAClBa,EAFOhZ,KAAKC,MAAM6Y,EAAU,QAG5BE,EAAoBC,MACrB,OAEQ,GAAV5W,OAEG2W,IADDjZ,KAAKoY,YAAY,OAEjB,SAGL9V,EAAS,UAET0W,QAEHG,gBAAkB,SAAUjB,OAC5B5V,EAAS4V,EACTa,EAAU,EACVC,EAAU,MAET1W,GAAU,MACHtC,KAAKoY,YAAY,KACb,MACbY,GAAW,KACRD,EAAU,KACbC,GAAW,QACF,GAEQ,GAAV1W,MACEtC,KAAKoY,YAAY,IACb,KACbY,GAAW,QACF,GAEQ,GAAV1W,MACEtC,KAAKoY,YAAY,MACjB,MAEAW,QAELzW,EAAS,UAET0W,QAEHI,iBAAmB,SAAUlB,OAC7B5V,EAAS4V,EACTa,EAAU,EACVM,EAAS,IAAIlY,WAGNnB,KAAKoY,YAAY,KACpB3V,KAAKsW,aAGNzW,EAAS,UACT+W,QAEHC,eAAiB,SAAUpB,OAC3B5V,EAAS4V,EACTa,EAAU,EACVQ,EAAgB,KACjB,KAKEC,MAJMxZ,KAAKoY,YAAY,KAEA,KAEG,GAHdW,EAAU,IAItBU,EAAe,IACfD,EAAW,OAAU,MAETA,EAAW,MAIXA,EAAW,SAOVE,OAAOC,aAAaF,aAG/BnX,EAAS,UAGTiX,QAGHK,cAAgB,eAChBb,EAAU,EACVc,EAAY7Z,KAAKoY,YAAY,UACP,IAAT,IAAZyB,OACkB,IAAZA,GAEe,MAAT,IAAZA,QAGoB,GAAZA,IAAqB,EADhB7Z,KAAKoY,YAAY,IAGT,MAAT,IAAZyB,QAGoB,GAAZA,IAAqB,GADV7Z,KAAKoY,YAAY,IAGlCW,QAGHhZ,iBAAiB,WAAY,mBAC7BsZ,EAAS,IAAIlY,QAMd,KACE2Y,EAAO9Z,KAAK2Y,cAEJ,GAARmB,EAAW,IACVT,EAAO/W,OAAS,EACnB,MAEA,KAAM,sBAZS,GAcbwX,GAbuB,GAaAA,GAZP,GAYwCA,GAV5C,GAUsEA,GAXxE,GAW8FA,OACrG,iBAAmBA,EAAO,cAAgB9Z,KAAKgY,aAAe,QAAUhY,KAAKiY,WAAa,OAZnF,GAeV6B,MACCC,EAAmB/Z,KAAK4Z,oBAGxB,KAEA1B,EAAalY,KAAK4Y,cAAckB,MAChC5B,EAAa,EAChB,KAAM,wBAA0BA,SACzB4B,QA3BQ,UA8BVE,EAAWha,KAAKmZ,gBAAgBjB,GAChC+B,EAAK,IAAI9Y,MAAM6Y,EAAS1X,QACnB/B,EAAI,EAAGA,EAAIyZ,EAAS1X,OAAQ/B,MACjCA,GAAKyZ,EAASE,WAAW3Z,KACtBkC,KAAKwX,cAjCY,MAqCpBD,EAAWha,KAAK8Y,wBAAwBZ,GACxC+B,EAAK,IAAI9Y,MAAM6Y,EAAS1X,QACnB/B,EAAI,EAAGA,EAAIyZ,EAAS1X,OAAQ/B,MACjCA,GAAKyZ,EAASE,WAAW3Z,KACtBkC,KAAKwX,cAxCK,EA4CbF,EAAmB/Z,KAAKoZ,iBAAiBlB,KACtCzV,KAAKsX,cA3CC,EA+CTC,EAAWha,KAAKsZ,eAAepB,KAC5BzV,KAAKuX,YAMTX,KC9QLc,KACJA,EAAQC,UAAY,ICJH,SAA4B/G,QACvCA,MAAQA,OACRgH,OAAS,SAAUC,EAAUC,WAC7BC,EAAO,IAAIpH,EAAUpT,KAAKqT,MAAOiH,GACjCG,EAAuB,IAAItZ,MAAMoZ,GAC5Bja,EAAI,EAAGA,EAAIma,EAAqBnY,OAAQhC,MAAyBA,GAAK,MAE3Eoa,GAAU,MACLpa,EAAI,EAAGA,EAAIia,EAAMja,IAAK,KAE1Bqa,EAAQH,EAAK3G,WAAW7T,KAAKqT,MAAM8C,IAAyB7V,MAC3Cma,EAAqBnY,OAAS,EAAIhC,GAAKqa,EAC/C,GAATA,OACO,OAGRD,OAGAE,EAAW,IAAIxH,EAAUpT,KAAKqT,MAAOoH,GACrCI,EAAa7a,KAAK8a,sBAAsB9a,KAAKqT,MAAMqC,cAAc6E,EAAM,GAAIK,EAAUL,GACrFQ,EAAQF,EAAW,GACnBG,EAAQH,EAAW,GACnBI,EAAiBjb,KAAKkb,mBAAmBH,GACzCI,EAAkBnb,KAAKob,oBAAoBJ,EAAOC,GAlBrC,OAmBR3a,EAAI,EAAGA,EAAI2a,EAAe3Y,OAAQhC,IAAK,KAC3C+a,EAAWf,EAAShY,OAAS,EAAItC,KAAKqT,MAAM+C,IAAI6E,EAAe3a,OAC/D+a,EAAW,OACR,4CAEEA,GAAY1F,EAAMxC,cAAcmH,EAASe,GAAWF,EAAgB7a,YAI1Ewa,sBAAwB,SAAU/U,EAAGC,EAAGsV,MAExCvV,EAAEqP,OAASpP,EAAEoP,OAAQ,KACpB5Q,EAAOuB,IACPC,IACAxB,UAGD+W,EAAQxV,EACRyV,EAAIxV,EACJyV,EAAQzb,KAAKqT,MAAMqI,IACnBC,EAAI3b,KAAKqT,MAAMI,KACfmI,EAAQ5b,KAAKqT,MAAMI,KACnBoI,EAAI7b,KAAKqT,MAAMqI,IAGZF,EAAEpG,QAAUnV,KAAKC,MAAMob,EAAI,IAAI,KACjCQ,EAAYP,EACZQ,EAAYN,EACZO,EAAYJ,OAERD,IACAE,KAFAL,GAKE/H,UAEH,qBAEHqI,UACAG,EAAIjc,KAAKqT,MAAMI,KACf0B,EAAyBoG,EAAM5H,eAAe4H,EAAMnG,QACpD8G,EAAalc,KAAKqT,MAAMiC,QAAQH,GAC7BqG,EAAEpG,QAAUmG,EAAMnG,SAAWoG,EAAE/H,MAAM,KACvC0I,EAAaX,EAAEpG,OAASmG,EAAMnG,OAC9B3E,EAAQzQ,KAAKqT,MAAMW,SAASwH,EAAE7H,eAAe6H,EAAEpG,QAAS8G,KACxDD,EAAE9I,cAAcnT,KAAKqT,MAAMqC,cAAcyG,EAAY1L,MACrD+K,EAAErI,cAAcoI,EAAMzG,mBAAmBqH,EAAY1L,MAItDwL,EAAE5H,UAAUoH,GAAOtI,cAAc4I,KACjCE,EAAE5H,UAAUuH,GAAOzI,cAAc6I,OAGlCI,EAAmBP,EAAElI,eAAe,MAChB,GAApByI,OACG,kDAGH9G,EAAUtV,KAAKqT,MAAMiC,QAAQ8G,GAC7BrB,EAAQc,EAAEjH,UAAUU,GACpB0F,EAAQQ,EAAE5G,UAAUU,UACjB,IAAInU,MAAM4Z,EAAOC,SAEpBE,mBAAqB,SAAUmB,OAE/BC,EAAYD,EAAajH,UACZ,GAAbkH,SAEI,IAAInb,MAAMkb,EAAa1I,eAAe,YAE1CnD,EAAS,IAAIrP,MAAMmb,GACnBC,EAAI,EACCjc,EAAI,EAAGA,EAAI,KAAOic,EAAID,EAAWhc,IACP,GAA9B+b,EAAaxI,WAAWvT,OACpBic,GAAKvc,KAAKqT,MAAMiC,QAAQhV,WAI7Bic,GAAKD,OACF,6DAEA9L,QAEH4K,oBAAsB,SAAUoB,EAAgBvB,EAAgBwB,WAEhEd,EAAIV,EAAe3Y,OACnBkO,EAAS,IAAIrP,MAAMwa,GACdrb,EAAI,EAAGA,EAAIqb,EAAGrb,IAAK,SACvBoc,EAAY1c,KAAKqT,MAAMiC,QAAQ2F,EAAe3a,IAC9C6M,EAAc,EACT5M,EAAI,EAAGA,EAAIob,EAAGpb,IAClBD,GAAKC,MACMP,KAAKqT,MAAMW,SAAS7G,EAAawI,EAAMxC,cAAc,EAAGnT,KAAKqT,MAAMW,SAASiH,EAAe1a,GAAImc,QAGxGpc,GAAKN,KAAKqT,MAAMW,SAASwI,EAAe3I,WAAW6I,GAAY1c,KAAKqT,MAAMiC,QAAQnI,IAErFsP,MACInc,GAAKN,KAAKqT,MAAMW,SAASxD,EAAOlQ,GAAIoc,WAGtClM,GD3HW,CAAuBmF,EAAMU,eAEjD8D,EAAQwC,cAAgB,SAAUC,EAAe9F,WAC5C+F,EAAeD,EAActa,OAE7Bwa,EAAgB,IAAI3b,MAAM0b,GACrBvc,EAAI,EAAGA,EAAIuc,EAAcvc,MACnBA,GAAwB,IAAnBsc,EAActc,OAE9Byc,EAAiBH,EAActa,OAASwU,QAEnCsD,UAAUC,OAAOyC,EAAeC,GAIzC,MAAOC,SACAA,MAIE1c,EAAI,EAAGA,EAAIwW,EAAkBxW,MACvBA,GAAKwc,EAAcxc,IAInC6Z,EAAQE,OAAS,SAAUpT,WACtBgW,EAAS,IE7BG,SAAyB7R,OACrCF,EAAYE,EAAU8R,aACtBhS,EAAY,IAA4B,IAAT,EAAZA,QAChB,6BAEFE,UAAYA,OACZ+R,cAAgB,UAChBC,iBAAmB,UAEnBC,QAAU,SAAU/c,EAAGC,EAAGuL,UACvB9L,KAAKoL,UAAUlC,YAAY5I,EAAGC,GAAMuL,GAAe,EAAK,EAAMA,GAAe,QAGhFwR,sBAAwB,cACC,MAAzBtd,KAAKod,wBACDpd,KAAKod,yBAITG,EAAiB,EACZjd,EAAI,EAAGA,EAAI,EAAGA,MACLN,KAAKqd,QAAQ/c,EAAG,EAAGid,KAGpBvd,KAAKqd,QAAQ,EAAG,EAAGE,KACnBvd,KAAKqd,QAAQ,EAAG,EAAGE,KACnBvd,KAAKqd,QAAQ,EAAG,EAAGE,OAE/B,IAAIhd,EAAI,EAAGA,GAAK,EAAGA,MACNP,KAAKqd,QAAQ,EAAG9c,EAAGgd,WAGhCH,iBAAmBrV,EAAkBU,wBAAwB8U,GACrC,MAAzBvd,KAAKod,wBACDpd,KAAKod,qBAITlS,EAAYlL,KAAKoL,UAAU8R,YACd,MACbM,EAAOtS,EAAY,MACd5K,EAAI4K,EAAY,EAAG5K,GAAKkd,EAAMld,MACrBN,KAAKqd,QAAQ/c,EAAG,EAAGid,OAE5Bhd,EAAI2K,EAAY,EAAG3K,EAAI2K,EAAW3K,MACzBP,KAAKqd,QAAQ,EAAG9c,EAAGgd,WAGhCH,iBAAmBrV,EAAkBU,wBAAwB8U,GACrC,MAAzBvd,KAAKod,wBACDpd,KAAKod,sBAEP,oCAEFK,YAAc,cAEQ,MAAtBzd,KAAKmd,qBACDnd,KAAKmd,kBAGTjS,EAAYlL,KAAKoL,UAAU8R,UAE3BrK,EAAsB3H,EAAY,IAAO,KACzC2H,GAAsB,SAClBvI,EAAQoB,oBAAoBmH,WAIhC/G,EAAc,EACd4R,EAAQxS,EAAY,GACf3K,EAAI,EAAGA,GAAK,EAAGA,QAClB,IAAID,EAAI4K,EAAY,EAAG5K,GAAKod,EAAOpd,MACzBN,KAAKqd,QAAQ/c,EAAGC,EAAGuL,WAI9BqR,cAAgB7S,EAAQuB,yBAAyBC,GAC5B,MAAtB9L,KAAKmd,eAAyBnd,KAAKmd,cAAchS,qBAAuBD,SACpElL,KAAKmd,oBAIC,EACL7c,EAAI,EAAGA,GAAK,EAAGA,QACdC,EAAI2K,EAAY,EAAG3K,GAAKmd,EAAOnd,MACzBP,KAAKqd,QAAQ/c,EAAGC,EAAGuL,WAI9BqR,cAAgB7S,EAAQuB,yBAAyBC,GAC5B,MAAtB9L,KAAKmd,eAAyBnd,KAAKmd,cAAchS,qBAAuBD,SACpElL,KAAKmd,mBAEP,0BAEFQ,cAAgB,eAEhB3V,EAAahI,KAAKsd,wBAClBpG,EAAUlX,KAAKyd,cAIftV,EAAWoO,EAASC,aAAaxO,EAAWuO,UAC5CrL,EAAYlL,KAAKoL,UAAU8R,YACtBvG,gBAAgB3W,KAAKoL,UAAWF,WAErC0S,EAAkB1G,EAAQjM,uBAE1B4S,GAAY,EACZrN,EAAS,IAAIrP,MAAM+V,EAAQC,gBAC3B2G,EAAe,EACfC,EAAc,EACdC,EAAW,EAENzd,EAAI2K,EAAY,EAAG3K,EAAI,EAAGA,GAAK,EAAG,CACjC,GAALA,WAMC,IAAIT,EAAQ,EAAGA,EAAQoL,EAAWpL,YAClCQ,EAAIud,EAAY3S,EAAY,EAAIpL,EAAQA,EACnCme,EAAM,EAAGA,EAAM,EAAGA,IAErBL,EAAgB1U,YAAY3I,EAAI0d,EAAK3d,aAGzB,EACZN,KAAKoL,UAAUlC,YAAY3I,EAAI0d,EAAK3d,QACxB,GAGA,GAAZ0d,MACIF,KAAkBC,IACd,IACG,QAKL,KAEVD,GAAgB5G,EAAQC,oBACrB,6BAEA3G,GFrHK,CAAoBvJ,GAC7BiQ,EAAU+F,EAAOQ,cACjBlS,EAAU0R,EAAOK,wBAAwBpW,qBAGzC6P,EAAYkG,EAAOU,gBAGnBO,EAAarH,EAAUG,cAAcD,EAAWG,EAAS3L,GAGzD4S,EAAa,EACR7d,EAAI,EAAGA,EAAI4d,EAAW5b,OAAQhC,OACxB4d,EAAW5d,GAAG8d,yBAEzBC,EAAc,IAAIld,MAAMgd,GACxBL,EAAe,EAGVvd,EAAI,EAAGA,EAAI2d,EAAW5b,OAAQ/B,IAAK,KACvC+d,EAAYJ,EAAW3d,GACvBqc,EAAgB0B,EAAUC,UAC1BzH,EAAmBwH,EAAUF,mBACzBzB,cAAcC,EAAe9F,OAC5BxW,EAAI,EAAGA,EAAIwW,EAAkBxW,MACzBwd,KAAkBlB,EAActc,UAKjC,IAAIke,EAAsBH,EAAanH,EAAQuH,cAAelT,EAAQmT,OAKpFhe,MAAiByZ,EGiDjB,IAAIwE,EAAU,SAAUC,EAAKhe,OAIxBD,EAzGU,SAASie,EAAKhe,EAAKie,WAC7BC,EAAM,IAAI3d,MAAMP,EAAKG,MAAQH,EAAKI,QAClC+d,EAZO,SAAUH,EAAKhe,UACnB,SAAShB,EAAEC,MACbe,EAAKG,MAAQnB,GAAKgB,EAAKI,OAASnB,OAC7B,kBAEH2C,EAAa,EAAJ5C,EAAUC,EAAIe,EAAKG,MAAQ,SAClB,MAAd6d,EAAKpc,GAAmC,MAAlBoc,EAAKpc,EAAQ,GAA+B,MAAlBoc,EAAKpc,EAAQ,IAAc,KAMrEwc,CAAMJ,EAAKhe,GACdf,EAAI,EAAGA,EAAIe,EAAKI,OAAQnB,QACxB,IAAID,EAAI,EAAGA,EAAIgB,EAAKG,MAAOnB,IAAK,KAC7Bqf,EAAOF,EAASnf,EAAGC,KACnBD,EAAIC,EAAIe,EAAKG,OAASke,GAAQJ,SAGnCC,EAgGEI,CAASN,EAAKhe,EAAK,KAMxBue,EADW,IAAIC,EAASze,EAAMC,GACNqS,YAExBoM,EAAYC,QAAS,SACvBC,KACW1f,EAAI,EAAGA,EAAIsf,EAAalY,KAAKuY,OAAQ3f,QACrC,IAAID,EAAI,EAAGA,EAAIuf,EAAalY,KAAKwY,MAAO7f,MAC5C6C,OAAK0c,EAAalY,KAAKiC,YAAYtJ,EAAGC,IAAY,WAGrD0f,EAASJ,EAAalY,KAAKwY,OAM7Bb,EAFSzE,EAAQE,OAAO8E,EAAalY,MAEvByY,iBACdC,EAAM,GACDrf,EAAI,EAAGA,EAAIse,EAAKtc,OAAQhC,QACxB,IAAIC,EAAI,EAAGA,EAAIqe,EAAKte,GAAGgC,OAAQ/B,OACzBmZ,OAAOC,aAAaiF,EAAKte,GAAGC,WAMpCof,KA5CX,SAAgBC,EAAUN,OACrB1e,SACIgf,EAAU7e,aACT6e,EAAU5e,eACTse,UAEHX,EAAQiB,EAAUhB,KAAKhe,IChH3Bif,EAAc,SAAUC,OACvBC,EAASC,SAASC,cAAc,UAChCC,EAAMH,EAAOI,WAAW,QACrBpf,MAAQ+e,EAAI/e,QACZC,OAAS8e,EAAI9e,SAChBof,UAAUN,EAAK,EAAG,EAAGC,EAAOhf,MAAOgf,EAAO/e,YAC1C4d,EAAOsB,EAAIG,aAAa,EAAG,EAAGN,EAAOhf,MAAOgf,EAAO/e,eAChDsf,EAAS1B,MAiBRiB,YAAcA,IACdU,YAfS,SAACC,EAAKC,OACnBC,EAAM,IAAIC,QACVC,YAAY,cACZJ,IAAMA,IACNK,OAAS,iBAER,KAAMhB,EAAYa,IACpB,MAAOnE,KACLA,OAGDuE,QAAUL,GAKf/f,MAAiB4f"}
\ No newline at end of file
diff --git a/dist/test.b0eca09c.js b/dist/test.b0eca09c.js
new file mode 100644
index 0000000..35c3189
--- /dev/null
+++ b/dist/test.b0eca09c.js
@@ -0,0 +1,3302 @@
+// modules are defined as an array
+// [ module function, map of requires ]
+//
+// map of requires is short require name -> numeric require
+//
+// anything defined in a previous bundle is accessed via the
+// orig method which is the require for previous bundles
+
+// eslint-disable-next-line no-global-assign
+parcelRequire = (function (modules, cache, entry, globalName) {
+ // Save the require from previous bundle to this closure if any
+ var previousRequire = typeof parcelRequire === 'function' && parcelRequire;
+ var nodeRequire = typeof require === 'function' && require;
+
+ function newRequire(name, jumped) {
+ if (!cache[name]) {
+ if (!modules[name]) {
+ // if we cannot find the module within our internal map or
+ // cache jump to the current global require ie. the last bundle
+ // that was added to the page.
+ var currentRequire = typeof parcelRequire === 'function' && parcelRequire;
+ if (!jumped && currentRequire) {
+ return currentRequire(name, true);
+ }
+
+ // If there are other bundles on this page the require from the
+ // previous one is saved to 'previousRequire'. Repeat this as
+ // many times as there are bundles until the module is found or
+ // we exhaust the require chain.
+ if (previousRequire) {
+ return previousRequire(name, true);
+ }
+
+ // Try the node require function if it exists.
+ if (nodeRequire && typeof name === 'string') {
+ return nodeRequire(name);
+ }
+
+ var err = new Error('Cannot find module \'' + name + '\'');
+ err.code = 'MODULE_NOT_FOUND';
+ throw err;
+ }
+
+ localRequire.resolve = resolve;
+
+ var module = cache[name] = new newRequire.Module(name);
+
+ modules[name][0].call(module.exports, localRequire, module, module.exports, this);
+ }
+
+ return cache[name].exports;
+
+ function localRequire(x){
+ return newRequire(localRequire.resolve(x));
+ }
+
+ function resolve(x){
+ return modules[name][1][x] || x;
+ }
+ }
+
+ function Module(moduleName) {
+ this.id = moduleName;
+ this.bundle = newRequire;
+ this.exports = {};
+ }
+
+ newRequire.isParcelRequire = true;
+ newRequire.Module = Module;
+ newRequire.modules = modules;
+ newRequire.cache = cache;
+ newRequire.parent = previousRequire;
+ newRequire.register = function (id, exports) {
+ modules[id] = [function (require, module) {
+ module.exports = exports;
+ }, {}];
+ };
+
+ for (var i = 0; i < entry.length; i++) {
+ newRequire(entry[i]);
+ }
+
+ if (entry.length) {
+ // Expose entry point to Node, AMD or browser globals
+ // Based on https://github.com/ForbesLindesay/umd/blob/master/template.js
+ var mainExports = newRequire(entry[entry.length - 1]);
+
+ // CommonJS
+ if (typeof exports === "object" && typeof module !== "undefined") {
+ module.exports = mainExports;
+
+ // RequireJS
+ } else if (typeof define === "function" && define.amd) {
+ define(function () {
+ return mainExports;
+ });
+
+ //