package q;

import java.util.Arrays;
import n.C2566A;
import n.C2598z;
import o.AbstractC2628a;
import x4.AbstractC3250p;

/* JADX INFO: loaded from: classes.dex */
public final class O implements InterfaceC2806x {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public final N f23207a;

    public O(N n6) {
        this.f23207a = n6;
    }

    @Override // q.InterfaceC2752C, q.InterfaceC2787m
    /* JADX INFO: renamed from: f, reason: merged with bridge method [inline-methods] */
    public final P0 a(G0 g0) {
        int[] iArr;
        Object[] objArr;
        int[] iArr2;
        Object[] objArr2;
        int i6;
        N n6 = this.f23207a;
        C2566A c2566a = n6.f23202b;
        C2598z c2598z = new C2598z(c2566a.f21460e + 2);
        C2566A c2566a2 = new C2566A(c2566a.f21460e);
        int[] iArr3 = c2566a.f21457b;
        Object[] objArr3 = c2566a.f21458c;
        long[] jArr = c2566a.f21456a;
        int length = jArr.length - 2;
        if (length >= 0) {
            int i7 = 0;
            while (true) {
                long j4 = jArr[i7];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i8 = 8;
                    int i9 = 8 - ((~(i7 - length)) >>> 31);
                    int i10 = 0;
                    while (i10 < i9) {
                        if ((j4 & 255) < 128) {
                            int i11 = (i7 << 3) + i10;
                            int i12 = iArr3[i11];
                            i6 = i8;
                            C2762M c2762m = (C2762M) objArr3[i11];
                            c2598z.c(i12);
                            iArr2 = iArr3;
                            objArr2 = objArr3;
                            c2566a2.i(i12, new O0((AbstractC2798s) g0.f23171a.invoke(c2762m.f23195a), c2762m.f23196b));
                        } else {
                            iArr2 = iArr3;
                            objArr2 = objArr3;
                            i6 = i8;
                        }
                        j4 >>= i6;
                        i10++;
                        iArr3 = iArr2;
                        i8 = i6;
                        objArr3 = objArr2;
                    }
                    iArr = iArr3;
                    objArr = objArr3;
                    if (i9 != i8) {
                        break;
                    }
                } else {
                    iArr = iArr3;
                    objArr = objArr3;
                }
                if (i7 == length) {
                    break;
                }
                i7++;
                iArr3 = iArr;
                objArr3 = objArr;
            }
        }
        if (!c2566a.a(0)) {
            int i13 = c2598z.f21454b;
            if (i13 < 0) {
                AbstractC2628a.d("Index must be between 0 and size");
                throw null;
            }
            c2598z.d(i13 + 1);
            int[] iArr4 = c2598z.f21453a;
            int i14 = c2598z.f21454b;
            if (i14 != 0) {
                AbstractC3250p.x(1, 0, i14, iArr4, iArr4);
            }
            iArr4[0] = 0;
            c2598z.f21454b++;
        }
        if (!c2566a.a(n6.f23201a)) {
            c2598z.c(n6.f23201a);
        }
        int i15 = c2598z.f21454b;
        if (i15 != 0) {
            int[] iArr5 = c2598z.f21453a;
            kotlin.jvm.internal.o.h(iArr5, "<this>");
            Arrays.sort(iArr5, 0, i15);
        }
        return new P0(c2598z, c2566a2, n6.f23201a, AbstractC2751B.f23148d);
    }
}