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
java/src/main/java/io/nayuki/qrcodegen/QrCode.java
+1 -1
View File
@@ -768,7 +768,7 @@ public final class QrCode {
// Returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and result
// are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
private static int reedSolomonMultiply(int x, int y) {
assert x >>> 8 == 0 && y >>> 8 == 0;
assert x >> 8 == 0 && y >> 8 == 0;
// Russian peasant multiplication
int z = 0;
for (int i = 7; i >= 0; i--) {