package J;

/* JADX INFO: loaded from: classes.dex */
abstract class a {
    public static int a(int i2, int i3, int i4, int i5, boolean z2) {
        double d2;
        double d3;
        double d4;
        double d5;
        int[] iArr = new int[3];
        if (i2 == 0) {
            i5 = 255;
        }
        int i6 = i3 - 128;
        int i7 = i4 - 128;
        double d6 = ((double) (i2 - 16)) * 1.164383562d;
        if (z2) {
            double d7 = i7;
            d2 = (1.596026317d * d7) + d6;
            d3 = i6;
            d4 = (d6 - (d7 * 0.8129674985d)) - (0.3917615979d * d3);
            d5 = 2.017232218d;
        } else {
            double d8 = i7;
            d2 = (1.792741071d * d8) + d6;
            d3 = i6;
            d4 = (d6 - (d8 * 0.5329093286d)) - (0.2132486143d * d3);
            d5 = 2.112401786d;
        }
        double d9 = d6 + (d3 * d5);
        iArr[0] = (int) (d2 + 0.5d);
        iArr[1] = (int) (d4 + 0.5d);
        iArr[2] = (int) (d9 + 0.5d);
        for (int i8 = 0; i8 < 3; i8++) {
            int i9 = iArr[i8];
            if (i9 < 0) {
                iArr[i8] = 0;
            } else if (i9 > 255) {
                iArr[i8] = 255;
            }
        }
        return ((255 - i5) << 24) + (iArr[0] << 16) + (iArr[1] << 8) + iArr[2];
    }
}
