status-im
/
QR-Code-generator
mirror of https://github.com/status-im/QR-Code-generator.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Simplified small bits of Python and JavaScript code, without changing behavior.

This commit is contained in:
Project Nayuki 2017-08-27 00:05:52 +00:00
parent 6dfb842afa
commit 3d0863717a
2 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
javascript/qrcodegen.js
View File

@ -958,8 +958,7 @@ var qrcodegen = new function() {
// Compute the remainder by performing polynomial division
var result = coefficients.map(function() { return 0; });
data.forEach(function(b) {
var factor = b ^ result[0];
result.shift();
var factor = b ^ result.shift();
result.push(0);
for (var i = 0; i < result.length; i++)
result[i] ^= ReedSolomonGenerator.multiply(coefficients[i], factor);

7
python/qrcodegen.py
View File

@ -331,10 +331,10 @@ class QrCode(object):
"""Draws a 9*9 finder pattern including the border separator, with the center module at (x, y)."""
for i in range(-4, 5):
for j in range(-4, 5):
dist = max(abs(i), abs(j)) # Chebyshev/infinity norm
xx, yy = x + j, y + i
if (0 <= xx < self._size) and (0 <= yy < self._size):
self._set_function_module(xx, yy, dist not in (2, 4))
# Chebyshev/infinity norm
self._set_function_module(xx, yy, max(abs(i), abs(j)) not in (2, 4))
def _draw_alignment_pattern(self, x, y):
@ -805,8 +805,7 @@ class _ReedSolomonGenerator(object):
# Compute the remainder by performing polynomial division
result = [0] * len(self.coefficients)
for b in data:
factor = (b ^ result[0])
del result[0]
factor = b ^ result.pop(0)
result.append(0)
for i in range(len(result)):
result[i] ^= _ReedSolomonGenerator._multiply(self.coefficients[i], factor)