var QRMath = require('./QRMath'); function QRPolynomial(num, shift) { if (num.length === undefined) { throw new Error(num.length + "/" + shift); } var offset = 0; while (offset < num.length && num[offset] === 0) { offset++; } this.num = new Array(num.length - offset + shift); for (var i = 0; i < num.length - offset; i++) { this.num[i] = num[i + offset]; } } QRPolynomial.prototype = { get : function(index) { return this.num[index]; }, getLength : function() { return this.num.length; }, multiply : function(e) { var num = new Array(this.getLength() + e.getLength() - 1); for (var i = 0; i < this.getLength(); i++) { for (var j = 0; j < e.getLength(); j++) { num[i + j] ^= QRMath.gexp(QRMath.glog(this.get(i) ) + QRMath.glog(e.get(j) ) ); } } return new QRPolynomial(num, 0); }, mod : function(e) { if (this.getLength() - e.getLength() < 0) { return this; } var ratio = QRMath.glog(this.get(0) ) - QRMath.glog(e.get(0) ); var num = new Array(this.getLength() ); for (var i = 0; i < this.getLength(); i++) { num[i] = this.get(i); } for (var x = 0; x < e.getLength(); x++) { num[x] ^= QRMath.gexp(QRMath.glog(e.get(x) ) + ratio); } // recursive call return new QRPolynomial(num, 0).mod(e); } }; module.exports = QRPolynomial;
Name | Type | Size | Permission | Actions |
---|---|---|---|---|
QR8bitByte.js | File | 382 B | 0644 |
|
QRBitBuffer.js | File | 702 B | 0644 |
|
QRErrorCorrectLevel.js | File | 54 B | 0644 |
|
QRMaskPattern.js | File | 157 B | 0644 |
|
QRMath.js | File | 673 B | 0644 |
|
QRMode.js | File | 149 B | 0644 |
|
QRPolynomial.js | File | 1.3 KB | 0644 |
|
QRRSBlock.js | File | 5.43 KB | 0644 |
|
QRUtil.js | File | 8.03 KB | 0644 |
|
index.js | File | 10.42 KB | 0644 |
|