mirror of
https://github.com/zxing/zxing.git
synced 2024-11-10 04:54:04 -08:00
Move and slightly add to new GenericGFPoly tests
This commit is contained in:
parent
3778715156
commit
7ff131b3cc
|
@ -225,8 +225,8 @@ final class GenericGFPoly {
|
|||
|
||||
@Override
|
||||
public String toString() {
|
||||
if (isZero()) {
|
||||
return "0";
|
||||
if (getDegree() == 0) {
|
||||
return Integer.toString(getCoefficient(0));
|
||||
}
|
||||
StringBuilder result = new StringBuilder(8 * getDegree());
|
||||
for (int degree = getDegree(); degree >= 0; degree--) {
|
||||
|
|
|
@ -0,0 +1,45 @@
|
|||
/*
|
||||
* Copyright 2018 ZXing authors
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
package com.google.zxing.common.reedsolomon;
|
||||
|
||||
import org.junit.Assert;
|
||||
import org.junit.Test;
|
||||
|
||||
public final class GenericGFPolyTestCase extends Assert {
|
||||
|
||||
private static final GenericGF FIELD = GenericGF.QR_CODE_FIELD_256;
|
||||
|
||||
@Test
|
||||
public void testPolynomialString() {
|
||||
assertEquals("0", FIELD.getZero().toString());
|
||||
assertEquals("-1", FIELD.buildMonomial(0, -1).toString());
|
||||
GenericGFPoly p = new GenericGFPoly(FIELD, new int[] {3, 0, -2, 1, 1});
|
||||
assertEquals("a^25x^4 - ax^2 + x + 1", p.toString());
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testZero() {
|
||||
assertEquals(FIELD.getZero(),FIELD.buildMonomial(1, 0));
|
||||
assertEquals(FIELD.getZero(), FIELD.buildMonomial(1, 2).multiply(0));
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testEvaluate() {
|
||||
assertEquals(3, FIELD.buildMonomial(0, 3).evaluateAt(0));
|
||||
}
|
||||
|
||||
}
|
|
@ -393,13 +393,6 @@ public final class ReedSolomonTestCase extends Assert {
|
|||
testEncodeDecodeRandom(GenericGF.AZTEC_DATA_12, 3072, 1023);
|
||||
}
|
||||
|
||||
@Test
|
||||
public void testPolynomialString() {
|
||||
assertEquals("0", GenericGF.QR_CODE_FIELD_256.getZero().toString());
|
||||
GenericGFPoly p = new GenericGFPoly(GenericGF.QR_CODE_FIELD_256, new int[] {3, 0, -2, 1, 1});
|
||||
assertEquals("a^25x^4 - ax^2 + x + 1", p.toString());
|
||||
}
|
||||
|
||||
public static void corrupt(int[] received, int howMany, Random random, int max) {
|
||||
BitSet corrupted = new BitSet(received.length);
|
||||
for (int j = 0; j < howMany; j++) {
|
||||
|
|
Loading…
Reference in a new issue