From fa7a0926729a297cce99e670e12fc1b1449fb26f Mon Sep 17 00:00:00 2001 From: Project Nayuki Date: Sat, 20 Jul 2019 19:13:19 +0000 Subject: [PATCH] Deleted some section comments. --- src/io/nayuki/fastqrcodegen/QrTemplate.java | 3 --- src/io/nayuki/fastqrcodegen/ReedSolomonGenerator.java | 6 ------ 2 files changed, 9 deletions(-) diff --git a/src/io/nayuki/fastqrcodegen/QrTemplate.java b/src/io/nayuki/fastqrcodegen/QrTemplate.java index b2e435a..c8da8d9 100644 --- a/src/io/nayuki/fastqrcodegen/QrTemplate.java +++ b/src/io/nayuki/fastqrcodegen/QrTemplate.java @@ -33,9 +33,6 @@ final class QrTemplate { = new Memoizer<>(QrTemplate::new); - - /*---- Instance members ----*/ - private final int version; private final int size; diff --git a/src/io/nayuki/fastqrcodegen/ReedSolomonGenerator.java b/src/io/nayuki/fastqrcodegen/ReedSolomonGenerator.java index 697bc81..971aa02 100644 --- a/src/io/nayuki/fastqrcodegen/ReedSolomonGenerator.java +++ b/src/io/nayuki/fastqrcodegen/ReedSolomonGenerator.java @@ -33,9 +33,6 @@ final class ReedSolomonGenerator { = new Memoizer<>(ReedSolomonGenerator::new); - - /*---- Instance members ----*/ - // A table of size 256 * degree, where polynomialMultiply[i][j] = multiply(i, coefficients[j]). // 'coefficients' is the temporary array representing the coefficients of the divisor polynomial, // stored from highest to lowest power, excluding the leading term which is always 1. @@ -90,9 +87,6 @@ final class ReedSolomonGenerator { } - - /*---- Constant members ----*/ - // 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 multiply(int x, int y) {