openharmony/third_party_qrcodegen
1
0
Fork 0
mirror of https://github.com/openharmony/third_party_qrcodegen.git synced 2026-07-19 20:23:35 -04:00
Code Issues Packages 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
Download Patch File Download Diff File Expand all files Collapse all files
python/qrcodegen.py
+1 -1
View File
@@ -570,7 +570,7 @@ class QrCode(object):
if degree < 1 or degree > 255:
raise ValueError("Degree out of range")
# 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
# Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),