98 lines
2.4 KiB
Java
98 lines
2.4 KiB
Java
package com.google.zxing.oned.rss;
|
|
|
|
import com.google.zxing.NotFoundException;
|
|
import com.google.zxing.oned.OneDReader;
|
|
|
|
/* loaded from: classes.dex */
|
|
public abstract class AbstractRSSReader extends OneDReader {
|
|
private final int[] a = new int[4];
|
|
private final int[] b = new int[8];
|
|
private final float[] c = new float[4];
|
|
private final float[] d = new float[4];
|
|
private final int[] e;
|
|
private final int[] f;
|
|
|
|
protected AbstractRSSReader() {
|
|
int[] iArr = this.b;
|
|
this.e = new int[iArr.length / 2];
|
|
this.f = new int[iArr.length / 2];
|
|
}
|
|
|
|
protected final int[] a() {
|
|
return this.b;
|
|
}
|
|
|
|
protected final int[] b() {
|
|
return this.a;
|
|
}
|
|
|
|
protected final int[] c() {
|
|
return this.f;
|
|
}
|
|
|
|
protected final float[] d() {
|
|
return this.d;
|
|
}
|
|
|
|
protected final int[] e() {
|
|
return this.e;
|
|
}
|
|
|
|
protected final float[] f() {
|
|
return this.c;
|
|
}
|
|
|
|
protected static int a(int[] iArr, int[][] iArr2) throws NotFoundException {
|
|
for (int i = 0; i < iArr2.length; i++) {
|
|
if (OneDReader.a(iArr, iArr2[i], 0.45f) < 0.2f) {
|
|
return i;
|
|
}
|
|
}
|
|
throw NotFoundException.getNotFoundInstance();
|
|
}
|
|
|
|
protected static void b(int[] iArr, float[] fArr) {
|
|
float f = fArr[0];
|
|
int i = 0;
|
|
for (int i2 = 1; i2 < iArr.length; i2++) {
|
|
if (fArr[i2] > f) {
|
|
f = fArr[i2];
|
|
i = i2;
|
|
}
|
|
}
|
|
iArr[i] = iArr[i] + 1;
|
|
}
|
|
|
|
protected static void a(int[] iArr, float[] fArr) {
|
|
float f = fArr[0];
|
|
int i = 0;
|
|
for (int i2 = 1; i2 < iArr.length; i2++) {
|
|
if (fArr[i2] < f) {
|
|
f = fArr[i2];
|
|
i = i2;
|
|
}
|
|
}
|
|
iArr[i] = iArr[i] - 1;
|
|
}
|
|
|
|
protected static boolean a(int[] iArr) {
|
|
float f = (iArr[0] + iArr[1]) / ((iArr[2] + r1) + iArr[3]);
|
|
if (f >= 0.7916667f && f <= 0.89285713f) {
|
|
int i = Integer.MIN_VALUE;
|
|
int i2 = Integer.MAX_VALUE;
|
|
for (int i3 : iArr) {
|
|
if (i3 > i) {
|
|
i = i3;
|
|
}
|
|
if (i3 < i2) {
|
|
i2 = i3;
|
|
}
|
|
}
|
|
if (i < i2 * 10) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
}
|