openharmony/third_party_qrcodegen
1
0
Fork 0
mirror of https://github.com/openharmony/third_party_qrcodegen.git synced 2026-07-18 17:55:48 -04:00
Code Issues Packages Projects Releases Wiki Activity

Simplified and clarified a few bits of code, without changing behavior.

Browse Source
This commit is contained in:
Project Nayuki
2019-07-14 17:11:28 +00:00
parent ee5e4ca121
commit b7c9ccfff9
3 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
@@ -567,7 +567,7 @@ class QrCode(object):
def _reed_solomon_compute_divisor(degree):
"""Returns a Reed-Solomon ECC generator polynomial for the given degree. This could be
implemented as a lookup table over all possible parameter values, instead of as an algorithm."""
if degree < 1 or degree > 255:
if not (1 <= 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].