package x4;

import java.util.Arrays;
import java.util.Iterator;
import java.util.RandomAccess;

/* JADX INFO: renamed from: x4.I, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes3.dex */
public final class C3232I extends AbstractC3239e implements RandomAccess {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public final Object[] f26042a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public final int f26043b;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public int f26044c;

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    public int f26045d;

    public C3232I(Object[] objArr, int i6) {
        this.f26042a = objArr;
        if (i6 < 0) {
            throw new IllegalArgumentException(Z0.o.l("ring buffer filled size should not be negative but it is ", i6).toString());
        }
        if (i6 <= objArr.length) {
            this.f26043b = objArr.length;
            this.f26045d = i6;
        } else {
            StringBuilder sbR = com.google.android.recaptcha.internal.a.r(i6, "ring buffer filled size: ", " cannot be larger than the buffer size: ");
            sbR.append(objArr.length);
            throw new IllegalArgumentException(sbR.toString().toString());
        }
    }

    public final void g(int i6) {
        if (i6 < 0) {
            throw new IllegalArgumentException(Z0.o.l("n shouldn't be negative but it is ", i6).toString());
        }
        if (i6 > size()) {
            StringBuilder sbR = com.google.android.recaptcha.internal.a.r(i6, "n shouldn't be greater than the buffer size: n = ", ", size = ");
            sbR.append(size());
            throw new IllegalArgumentException(sbR.toString().toString());
        }
        if (i6 > 0) {
            int i7 = this.f26044c;
            int i8 = this.f26043b;
            int i9 = (i7 + i6) % i8;
            Object[] objArr = this.f26042a;
            if (i7 > i9) {
                Arrays.fill(objArr, i7, i8, (Object) null);
                Arrays.fill(objArr, 0, i9, (Object) null);
            } else {
                Arrays.fill(objArr, i7, i9, (Object) null);
            }
            this.f26044c = i9;
            this.f26045d = size() - i6;
        }
    }

    @Override // x4.AbstractC3239e, java.util.List
    public final Object get(int i6) {
        C3236b c3236b = AbstractC3239e.Companion;
        int size = size();
        c3236b.getClass();
        C3236b.b(i6, size);
        return this.f26042a[(this.f26044c + i6) % this.f26043b];
    }

    @Override // x4.AbstractC3239e, x4.AbstractC3235a
    public final int getSize() {
        return this.f26045d;
    }

    @Override // x4.AbstractC3239e, java.util.Collection, java.lang.Iterable, java.util.List
    public final Iterator iterator() {
        return new C3231H(this);
    }

    @Override // x4.AbstractC3235a, java.util.Collection, java.util.List
    public final Object[] toArray(Object[] array) {
        Object[] objArr;
        kotlin.jvm.internal.o.h(array, "array");
        if (array.length < size()) {
            array = Arrays.copyOf(array, size());
            kotlin.jvm.internal.o.g(array, "copyOf(...)");
        }
        int size = size();
        int i6 = this.f26044c;
        int i7 = 0;
        int i8 = 0;
        while (true) {
            objArr = this.f26042a;
            if (i8 >= size || i6 >= this.f26043b) {
                break;
            }
            array[i8] = objArr[i6];
            i8++;
            i6++;
        }
        while (i8 < size) {
            array[i8] = objArr[i7];
            i8++;
            i7++;
        }
        if (size < array.length) {
            array[size] = null;
        }
        return array;
    }

    @Override // x4.AbstractC3235a, java.util.Collection, java.util.List
    public final Object[] toArray() {
        return toArray(new Object[size()]);
    }
}