package c.i.e.q.r; import c.i.e.q.k; import com.google.zxing.NotFoundException; /* compiled from: AbstractRSSReader */ public abstract class a extends k { public final int[] a = new int[4]; public final int[] b; /* renamed from: c reason: collision with root package name */ public final float[] f1425c; public final float[] d; public final int[] e; public final int[] f; public a() { int[] iArr = new int[8]; this.b = iArr; this.f1425c = new float[4]; this.d = new float[4]; this.e = new int[(iArr.length / 2)]; this.f = new int[(iArr.length / 2)]; } public static void g(int[] iArr, float[] fArr) { int i = 0; float f = fArr[0]; for (int i2 = 1; i2 < iArr.length; i2++) { if (fArr[i2] < f) { f = fArr[i2]; i = i2; } } iArr[i] = iArr[i] - 1; } public static void h(int[] iArr, float[] fArr) { int i = 0; float f = fArr[0]; for (int i2 = 1; i2 < iArr.length; i2++) { if (fArr[i2] > f) { f = fArr[i2]; i = i2; } } iArr[i] = iArr[i] + 1; } public static boolean i(int[] iArr) { int i = iArr[0] + iArr[1]; float f = ((float) i) / ((float) ((iArr[2] + i) + iArr[3])); if (f >= 0.7916667f && f <= 0.89285713f) { int i2 = Integer.MAX_VALUE; int i3 = Integer.MIN_VALUE; for (int i4 : iArr) { if (i4 > i3) { i3 = i4; } if (i4 < i2) { i2 = i4; } } if (i3 < i2 * 10) { return true; } } return false; } public static int j(int[] iArr, int[][] iArr2) throws NotFoundException { for (int i = 0; i < iArr2.length; i++) { if (k.d(iArr, iArr2[i], 0.45f) < 0.2f) { return i; } } throw NotFoundException.k; } }