2 * Copyright 2008 ZXing authors
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 package com.google.zxing.common.reedsolomon;
19 import junit.framework.TestCase;
21 import java.util.BitSet;
22 import java.util.Random;
27 abstract class AbstractReedSolomonTestCase extends TestCase {
29 static void corrupt(int[] received, int howMany, Random random) {
30 BitSet corrupted = new BitSet(received.length);
31 for (int j = 0; j < howMany; j++) {
32 int location = random.nextInt(received.length);
33 if (corrupted.get(location)) {
36 corrupted.set(location);
37 received[location] = (received[location] + 1 + random.nextInt(255)) & 0xFF;
42 static void doTestQRCodeEncoding(int[] dataBytes, int[] expectedECBytes) {
43 int[] toEncode = new int[dataBytes.length + expectedECBytes.length];
44 System.arraycopy(dataBytes, 0, toEncode, 0, dataBytes.length);
45 new ReedSolomonEncoder(GF256.QR_CODE_FIELD).encode(toEncode, expectedECBytes.length);
46 assertArraysEqual(dataBytes, 0, toEncode, 0, dataBytes.length);
47 assertArraysEqual(expectedECBytes, 0, toEncode, dataBytes.length, expectedECBytes.length);
50 static Random getRandom() {
51 return new Random(0xDEADBEEF);
54 static void assertArraysEqual(int[] expected, int expectedOffset, int[] actual, int actualOffset, int length) {
55 for (int i = 0; i < length; i++) {
56 assertEquals(expected[expectedOffset + i], actual[actualOffset + i]);