74 lines
1.8 KiB
Java
74 lines
1.8 KiB
Java
package c.i.e.n;
|
|
|
|
import c.i.e.b;
|
|
import c.i.e.f;
|
|
import com.google.zxing.NotFoundException;
|
|
/* compiled from: HybridBinarizer */
|
|
public final class h extends b {
|
|
public static final byte[] b = new byte[0];
|
|
|
|
/* renamed from: c reason: collision with root package name */
|
|
public byte[] f1410c = b;
|
|
public final int[] d = new int[32];
|
|
public b e;
|
|
|
|
public h(f fVar) {
|
|
super(fVar);
|
|
}
|
|
|
|
public static int a(int[] iArr) throws NotFoundException {
|
|
int length = iArr.length;
|
|
int i = 0;
|
|
int i2 = 0;
|
|
int i3 = 0;
|
|
for (int i4 = 0; i4 < length; i4++) {
|
|
if (iArr[i4] > i) {
|
|
i = iArr[i4];
|
|
i3 = i4;
|
|
}
|
|
if (iArr[i4] > i2) {
|
|
i2 = iArr[i4];
|
|
}
|
|
}
|
|
int i5 = 0;
|
|
int i6 = 0;
|
|
for (int i7 = 0; i7 < length; i7++) {
|
|
int i8 = i7 - i3;
|
|
int i9 = iArr[i7] * i8 * i8;
|
|
if (i9 > i6) {
|
|
i5 = i7;
|
|
i6 = i9;
|
|
}
|
|
}
|
|
if (i3 <= i5) {
|
|
i3 = i5;
|
|
i5 = i3;
|
|
}
|
|
if (i3 - i5 > length / 16) {
|
|
int i10 = i3 - 1;
|
|
int i11 = i10;
|
|
int i12 = -1;
|
|
while (i10 > i5) {
|
|
int i13 = i10 - i5;
|
|
int i14 = (i2 - iArr[i10]) * (i3 - i10) * i13 * i13;
|
|
if (i14 > i12) {
|
|
i11 = i10;
|
|
i12 = i14;
|
|
}
|
|
i10--;
|
|
}
|
|
return i11 << 3;
|
|
}
|
|
throw NotFoundException.k;
|
|
}
|
|
|
|
public final void b(int i) {
|
|
if (this.f1410c.length < i) {
|
|
this.f1410c = new byte[i];
|
|
}
|
|
for (int i2 = 0; i2 < 32; i2++) {
|
|
this.d[i2] = 0;
|
|
}
|
|
}
|
|
}
|