status-im/QR-Code-generator
2
0
Fork 0
mirror of https://github.com/status-im/QR-Code-generator.git synced 2025-02-23 18:08:20 +00:00
Code Issues Projects Releases Wiki Activity

Tweaked a comment in QrCode.reedSolomonComputeDivisor() in 4 language versions.

Browse Source
This commit is contained in:
Project Nayuki 2019-07-14 17:10:36 +00:00
parent 76127b8bfe
commit b6aa563812
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
javascript/qrcodegen.js
View File

@ -693,7 +693,7 @@ var qrcodegen = new function() {
if (degree < 1 || degree > 255) if (degree < 1 || degree > 255)
throw "Degree out of range"; throw "Degree out of range";
// Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1. // Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.
// For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. // For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].
var result = []; var result = [];
for (var i = 0; i < degree - 1; i++) for (var i = 0; i < degree - 1; i++)
result.push(0); result.push(0);

2
python/qrcodegen.py
View File

@ -570,7 +570,7 @@ class QrCode(object):
if degree < 1 or degree > 255: if degree < 1 or degree > 255:
raise ValueError("Degree out of range") raise ValueError("Degree out of range")
# Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1. # Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.
# For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. # For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].
result = [0] * (degree - 1) + [1] # Start off with the monomial x^0 result = [0] * (degree - 1) + [1] # Start off with the monomial x^0
# Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}), # Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),

2
rust/src/lib.rs
View File

@ -778,7 +778,7 @@ impl QrCode {
fn reed_solomon_compute_divisor(degree: usize) -> Vec<u8> { fn reed_solomon_compute_divisor(degree: usize) -> Vec<u8> {
assert!(1 <= degree && degree <= 255, "Degree out of range"); assert!(1 <= degree && degree <= 255, "Degree out of range");
// Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1. // Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.
// For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. // For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].
let mut result = vec![0u8; degree - 1]; let mut result = vec![0u8; degree - 1];
result.push(1); // Start off with the monomial x^0 result.push(1); // Start off with the monomial x^0

2
typescript/qrcodegen.ts
View File

@ -639,7 +639,7 @@ namespace qrcodegen {
if (degree < 1 || degree > 255) if (degree < 1 || degree > 255)
throw "Degree out of range"; throw "Degree out of range";
// Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1. // Polynomial coefficients are stored from highest to lowest power, excluding the leading term which is always 1.
// For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}. // For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array [255, 8, 93].
let result: Array<byte> = []; let result: Array<byte> = [];
for (let i = 0; i < degree - 1; i++) for (let i = 0; i < degree - 1; i++)
result.push(0); result.push(0);