package androidx.leanback.widget;

import androidx.leanback.widget.i0;

/* JADX INFO: loaded from: classes.dex */
final class j0 extends i0 {
    @Override // androidx.leanback.widget.am
    public final int f(int[] iArr, int i, boolean z) {
        int i2;
        int iD = this.b.d(i);
        i0.a aVarK = k(i);
        int i3 = aVarK.a;
        if (this.c) {
            i2 = i3;
            int i4 = i2;
            int i5 = 1;
            int i6 = iD;
            for (int i7 = i + 1; i5 < this.e && i7 <= this.g; i7++) {
                i0.a aVarK2 = k(i7);
                i6 += aVarK2.b;
                int i8 = aVarK2.a;
                if (i8 != i4) {
                    i5++;
                    if (!z ? i6 >= iD : i6 <= iD) {
                        i4 = i8;
                    } else {
                        iD = i6;
                        i = i7;
                        i2 = i8;
                        i4 = i2;
                    }
                }
            }
        } else {
            int i9 = 1;
            int i10 = i3;
            i0.a aVarK3 = aVarK;
            int i11 = iD;
            iD = this.b.e(i) + iD;
            i2 = i10;
            for (int i12 = i - 1; i9 < this.e && i12 >= this.f; i12--) {
                i11 -= aVarK3.b;
                aVarK3 = k(i12);
                int i13 = aVarK3.a;
                if (i13 != i10) {
                    i9++;
                    int iE = this.b.e(i12) + i11;
                    if (!z ? iE >= iD : iE <= iD) {
                        i10 = i13;
                    } else {
                        iD = iE;
                        i = i12;
                        i2 = i13;
                        i10 = i2;
                    }
                }
            }
        }
        if (iArr != null) {
            iArr[0] = i2;
            iArr[1] = i;
        }
        return iD;
    }

    @Override // androidx.leanback.widget.am
    public final int h(int[] iArr, int i, boolean z) {
        int iE;
        int iD = this.b.d(i);
        i0.a aVarK = k(i);
        int i2 = aVarK.a;
        if (this.c) {
            int i3 = 1;
            iE = iD - this.b.e(i);
            int i4 = i2;
            for (int i5 = i - 1; i3 < this.e && i5 >= this.f; i5--) {
                iD -= aVarK.b;
                aVarK = k(i5);
                int i6 = aVarK.a;
                if (i6 != i4) {
                    i3++;
                    int iE2 = iD - this.b.e(i5);
                    if (!z ? iE2 >= iE : iE2 <= iE) {
                        i4 = i6;
                    } else {
                        iE = iE2;
                        i = i5;
                        i2 = i6;
                        i4 = i2;
                    }
                }
            }
        } else {
            int i7 = i2;
            int i8 = i7;
            int i9 = 1;
            int i10 = iD;
            for (int i11 = i + 1; i9 < this.e && i11 <= this.g; i11++) {
                i0.a aVarK2 = k(i11);
                i10 += aVarK2.b;
                int i12 = aVarK2.a;
                if (i12 != i8) {
                    i9++;
                    if (!z ? i10 >= iD : i10 <= iD) {
                        i8 = i12;
                    } else {
                        iD = i10;
                        i = i11;
                        i7 = i12;
                        i8 = i7;
                    }
                }
            }
            iE = iD;
            i2 = i7;
        }
        if (iArr != null) {
            iArr[0] = i2;
            iArr[1] = i;
        }
        return iE;
    }

    /* JADX WARN: Code restructure failed: missing block: B:105:0x0136, code lost:
    
        return true;
     */
    /* JADX WARN: Removed duplicated region for block: B:107:0x0139  */
    /* JADX WARN: Removed duplicated region for block: B:88:0x0107 A[LOOP:2: B:88:0x0107->B:104:0x012b, LOOP_START, PHI: r6 r9 r10
      0x0107: PHI (r6v12 int) = (r6v6 int), (r6v16 int) binds: [B:87:0x0105, B:104:0x012b] A[DONT_GENERATE, DONT_INLINE]
      0x0107: PHI (r9v20 int) = (r9v18 int), (r9v21 int) binds: [B:87:0x0105, B:104:0x012b] A[DONT_GENERATE, DONT_INLINE]
      0x0107: PHI (r10v7 int) = (r10v5 int), (r10v9 int) binds: [B:87:0x0105, B:104:0x012b] A[DONT_GENERATE, DONT_INLINE]] */
    @Override // androidx.leanback.widget.i0
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean q(int i, boolean z) {
        int i2;
        int i3;
        boolean z2;
        int iY;
        int i4;
        int i5;
        int iC = this.b.c();
        int i6 = this.g;
        if (i6 < 0) {
            int i7 = this.i;
            i2 = i7 != -1 ? i7 : 0;
            i3 = (this.j.d() > 0 ? k(r()).a + 1 : i2) % this.e;
            z2 = false;
            iY = 0;
        } else {
            if (i6 < r()) {
                return false;
            }
            int i8 = this.g;
            i2 = i8 + 1;
            i3 = k(i8).a;
            int iW = w(true);
            if (iW < 0) {
                iY = Integer.MIN_VALUE;
                for (int i9 = 0; i9 < this.e; i9++) {
                    iY = this.c ? y(i9) : x(i9);
                    if (iY != Integer.MIN_VALUE) {
                        break;
                    }
                }
            } else {
                iY = this.c ? h(null, iW, false) : f(null, iW, true);
            }
            if (!this.c ? x(i3) >= iY : y(i3) <= iY) {
                i3++;
                if (i3 == this.e) {
                    iY = this.c ? i(null, false) : g(null, true);
                    i3 = 0;
                }
            }
            z2 = true;
        }
        boolean z3 = false;
        loop1: while (true) {
            if (i3 < this.e) {
                if (i2 == iC || (!z && c(i))) {
                    break;
                }
                int iY2 = this.c ? y(i3) : x(i3);
                if (iY2 == Integer.MAX_VALUE || iY2 == Integer.MIN_VALUE) {
                    if (i3 == 0) {
                        iY2 = this.c ? y(this.e - 1) : x(this.e - 1);
                        if (iY2 != Integer.MAX_VALUE && iY2 != Integer.MIN_VALUE) {
                            if (this.c) {
                                i5 = this.d;
                                i4 = -i5;
                                iY2 += i4;
                            } else {
                                i4 = this.d;
                                iY2 += i4;
                            }
                        }
                    } else {
                        iY2 = this.c ? x(i3 - 1) : y(i3 - 1);
                    }
                    int i10 = i2 + 1;
                    int iP = p(i2, i3, iY2);
                    if (z2) {
                        while (true) {
                            if (!this.c) {
                                if (iY2 + iP >= iY) {
                                    break;
                                }
                                if (i10 == iC) {
                                    break loop1;
                                }
                                break loop1;
                                break loop1;
                            }
                            if (iY2 - iP <= iY) {
                                break;
                            }
                            if (i10 == iC || (!z && c(i))) {
                                break loop1;
                            }
                            iY2 += this.c ? (-iP) - this.d : iP + this.d;
                            int i11 = i10 + 1;
                            int iP2 = p(i10, i3, iY2);
                            i10 = i11;
                            iP = iP2;
                        }
                    } else {
                        z2 = true;
                        iY = this.c ? y(i3) : x(i3);
                    }
                    i2 = i10;
                    i3++;
                    z3 = true;
                } else if (this.c) {
                    i5 = this.d;
                    i4 = -i5;
                    iY2 += i4;
                    int i102 = i2 + 1;
                    int iP3 = p(i2, i3, iY2);
                    if (z2) {
                    }
                    i2 = i102;
                    i3++;
                    z3 = true;
                } else {
                    i4 = this.d;
                    iY2 += i4;
                    int i1022 = i2 + 1;
                    int iP32 = p(i2, i3, iY2);
                    if (z2) {
                    }
                    i2 = i1022;
                    i3++;
                    z3 = true;
                }
            } else {
                if (z) {
                    break;
                }
                iY = this.c ? i(null, false) : g(null, true);
                i3 = 0;
            }
        }
        return z3;
    }

    /* JADX WARN: Code restructure failed: missing block: B:103:0x012a, code lost:
    
        return true;
     */
    /* JADX WARN: Removed duplicated region for block: B:105:0x012d  */
    /* JADX WARN: Removed duplicated region for block: B:86:0x00fb A[LOOP:2: B:86:0x00fb->B:102:0x011f, LOOP_START, PHI: r5 r8 r9
      0x00fb: PHI (r5v12 int) = (r5v6 int), (r5v17 int) binds: [B:85:0x00f9, B:102:0x011f] A[DONT_GENERATE, DONT_INLINE]
      0x00fb: PHI (r8v19 int) = (r8v17 int), (r8v20 int) binds: [B:85:0x00f9, B:102:0x011f] A[DONT_GENERATE, DONT_INLINE]
      0x00fb: PHI (r9v8 int) = (r9v6 int), (r9v10 int) binds: [B:85:0x00f9, B:102:0x011f] A[DONT_GENERATE, DONT_INLINE]] */
    @Override // androidx.leanback.widget.i0
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean v(int i, boolean z) {
        int i2;
        int i3;
        boolean z2;
        int iX;
        int i4;
        int i5;
        int i6 = this.f;
        if (i6 < 0) {
            int i7 = this.i;
            i2 = i7 != -1 ? i7 : 0;
            i3 = (this.j.d() > 0 ? (k(this.k).a + this.e) - 1 : i2) % this.e;
            z2 = false;
            iX = 0;
        } else {
            if (i6 > this.k) {
                return false;
            }
            i2 = i6 - 1;
            i3 = k(i6).a;
            int iW = w(false);
            if (iW < 0) {
                i3--;
                iX = Integer.MAX_VALUE;
                for (int i8 = this.e - 1; i8 >= 0; i8--) {
                    iX = this.c ? x(i8) : y(i8);
                    if (iX != Integer.MAX_VALUE) {
                        break;
                    }
                }
            } else {
                iX = this.c ? f(null, iW, true) : h(null, iW, false);
            }
            if (!this.c ? y(i3) <= iX : x(i3) >= iX) {
                i3--;
                if (i3 < 0) {
                    i3 = this.e - 1;
                    iX = this.c ? g(null, true) : i(null, false);
                }
            }
            z2 = true;
        }
        boolean z3 = false;
        loop1: while (true) {
            if (i3 >= 0) {
                if (i2 < 0 || (!z && d(i))) {
                    break;
                }
                int iX2 = this.c ? x(i3) : y(i3);
                if (iX2 == Integer.MAX_VALUE || iX2 == Integer.MIN_VALUE) {
                    if (i3 == this.e - 1) {
                        iX2 = this.c ? x(0) : y(0);
                        if (iX2 != Integer.MAX_VALUE && iX2 != Integer.MIN_VALUE) {
                            if (this.c) {
                                i5 = this.d;
                                iX2 += i5;
                            } else {
                                i4 = this.d;
                                i5 = -i4;
                                iX2 += i5;
                            }
                        }
                    } else {
                        iX2 = this.c ? y(i3 + 1) : x(i3 + 1);
                    }
                    int i9 = i2 - 1;
                    int iU = u(i2, i3, iX2);
                    if (z2) {
                        while (true) {
                            if (!this.c) {
                                if (iX2 - iU <= iX) {
                                    break;
                                }
                                if (i9 < 0) {
                                    break loop1;
                                }
                                break loop1;
                                break loop1;
                            }
                            if (iX2 + iU >= iX) {
                                break;
                            }
                            if (i9 < 0 || (!z && d(i))) {
                                break loop1;
                            }
                            iX2 += this.c ? iU + this.d : (-iU) - this.d;
                            int i10 = i9 - 1;
                            int iU2 = u(i9, i3, iX2);
                            i9 = i10;
                            iU = iU2;
                        }
                    } else {
                        z2 = true;
                        iX = this.c ? x(i3) : y(i3);
                    }
                    i2 = i9;
                    i3--;
                    z3 = true;
                } else if (this.c) {
                    i5 = this.d;
                    iX2 += i5;
                    int i92 = i2 - 1;
                    int iU3 = u(i2, i3, iX2);
                    if (z2) {
                    }
                    i2 = i92;
                    i3--;
                    z3 = true;
                } else {
                    i4 = this.d;
                    i5 = -i4;
                    iX2 += i5;
                    int i922 = i2 - 1;
                    int iU32 = u(i2, i3, iX2);
                    if (z2) {
                    }
                    i2 = i922;
                    i3--;
                    z3 = true;
                }
            } else {
                if (z) {
                    break;
                }
                iX = this.c ? g(null, true) : i(null, false);
                i3 = this.e - 1;
            }
        }
        return z3;
    }

    public final int w(boolean z) {
        boolean z2 = false;
        if (z) {
            for (int i = this.g; i >= this.f; i--) {
                int i2 = k(i).a;
                if (i2 == 0) {
                    z2 = true;
                } else if (z2 && i2 == this.e - 1) {
                    return i;
                }
            }
            return -1;
        }
        for (int i3 = this.f; i3 <= this.g; i3++) {
            int i4 = k(i3).a;
            if (i4 == this.e - 1) {
                z2 = true;
            } else if (z2 && i4 == 0) {
                return i3;
            }
        }
        return -1;
    }

    public final int x(int i) {
        int i2;
        i0.a aVarK;
        int i3 = this.f;
        if (i3 < 0) {
            return Integer.MIN_VALUE;
        }
        if (this.c) {
            int iD = this.b.d(i3);
            if (k(this.f).a == i) {
                return iD;
            }
            int i4 = this.f;
            do {
                i4++;
                if (i4 > r()) {
                    return Integer.MIN_VALUE;
                }
                aVarK = k(i4);
                iD += aVarK.b;
            } while (aVarK.a != i);
            return iD;
        }
        int iD2 = this.b.d(this.g);
        i0.a aVarK2 = k(this.g);
        if (aVarK2.a == i) {
            i2 = aVarK2.c;
        } else {
            int i5 = this.g;
            do {
                i5--;
                if (i5 < this.k) {
                    return Integer.MIN_VALUE;
                }
                iD2 -= aVarK2.b;
                aVarK2 = k(i5);
            } while (aVarK2.a != i);
            i2 = aVarK2.c;
        }
        return iD2 + i2;
    }

    public final int y(int i) {
        i0.a aVarK;
        int i2;
        int i3 = this.f;
        if (i3 < 0) {
            return Integer.MAX_VALUE;
        }
        if (!this.c) {
            int iD = this.b.d(i3);
            if (k(this.f).a == i) {
                return iD;
            }
            int i4 = this.f;
            do {
                i4++;
                if (i4 > r()) {
                    return Integer.MAX_VALUE;
                }
                aVarK = k(i4);
                iD += aVarK.b;
            } while (aVarK.a != i);
            return iD;
        }
        int iD2 = this.b.d(this.g);
        i0.a aVarK2 = k(this.g);
        if (aVarK2.a == i) {
            i2 = aVarK2.c;
        } else {
            int i5 = this.g;
            do {
                i5--;
                if (i5 < this.k) {
                    return Integer.MAX_VALUE;
                }
                iD2 -= aVarK2.b;
                aVarK2 = k(i5);
            } while (aVarK2.a != i);
            i2 = aVarK2.c;
        }
        return iD2 - i2;
    }
}