package B6;

import d5.AbstractC0844a;
import java.lang.reflect.Array;
import java.util.AbstractList;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;

/* JADX INFO: loaded from: classes.dex */
public final class i extends f {

    /* JADX INFO: renamed from: t, reason: collision with root package name */
    public static final Object[] f1025t = new Object[0];

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

    /* JADX INFO: renamed from: r, reason: collision with root package name */
    public Object[] f1027r;

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

    public i() {
        this.f1027r = f1025t;
    }

    @Override // B6.f
    public final int a() {
        return this.f1028s;
    }

    @Override // java.util.AbstractList, java.util.List
    public final void add(int i, Object obj) {
        int length;
        int i5 = this.f1028s;
        if (i < 0 || i > i5) {
            throw new IndexOutOfBoundsException(I1.a.o("index: ", i, i5, ", size: "));
        }
        if (i == i5) {
            addLast(obj);
            return;
        }
        if (i == 0) {
            addFirst(obj);
            return;
        }
        l();
        f(this.f1028s + 1);
        int iK = k(this.f1026q + i);
        int i8 = this.f1028s;
        if (i < ((i8 + 1) >> 1)) {
            if (iK == 0) {
                Object[] objArr = this.f1027r;
                P6.g.e(objArr, "<this>");
                iK = objArr.length;
            }
            int i9 = iK - 1;
            int i10 = this.f1026q;
            if (i10 == 0) {
                Object[] objArr2 = this.f1027r;
                P6.g.e(objArr2, "<this>");
                length = objArr2.length - 1;
            } else {
                length = i10 - 1;
            }
            int i11 = this.f1026q;
            if (i9 >= i11) {
                Object[] objArr3 = this.f1027r;
                objArr3[length] = objArr3[i11];
                j.H(i11, i11 + 1, i9 + 1, objArr3, objArr3);
            } else {
                Object[] objArr4 = this.f1027r;
                j.H(i11 - 1, i11, objArr4.length, objArr4, objArr4);
                Object[] objArr5 = this.f1027r;
                objArr5[objArr5.length - 1] = objArr5[0];
                j.H(0, 1, i9 + 1, objArr5, objArr5);
            }
            this.f1027r[i9] = obj;
            this.f1026q = length;
        } else {
            int iK2 = k(i8 + this.f1026q);
            if (iK < iK2) {
                Object[] objArr6 = this.f1027r;
                j.H(iK + 1, iK, iK2, objArr6, objArr6);
            } else {
                Object[] objArr7 = this.f1027r;
                j.H(1, 0, iK2, objArr7, objArr7);
                Object[] objArr8 = this.f1027r;
                objArr8[0] = objArr8[objArr8.length - 1];
                j.H(iK + 1, iK, objArr8.length - 1, objArr8, objArr8);
            }
            this.f1027r[iK] = obj;
        }
        this.f1028s++;
    }

    @Override // java.util.AbstractList, java.util.List
    public final boolean addAll(int i, Collection collection) {
        P6.g.e(collection, "elements");
        int i5 = this.f1028s;
        if (i < 0 || i > i5) {
            throw new IndexOutOfBoundsException(I1.a.o("index: ", i, i5, ", size: "));
        }
        if (collection.isEmpty()) {
            return false;
        }
        if (i == this.f1028s) {
            return addAll(collection);
        }
        l();
        f(collection.size() + this.f1028s);
        int iK = k(this.f1028s + this.f1026q);
        int iK2 = k(this.f1026q + i);
        int size = collection.size();
        if (i >= ((this.f1028s + 1) >> 1)) {
            int i8 = iK2 + size;
            if (iK2 < iK) {
                int i9 = size + iK;
                Object[] objArr = this.f1027r;
                if (i9 <= objArr.length) {
                    j.H(i8, iK2, iK, objArr, objArr);
                } else if (i8 >= objArr.length) {
                    j.H(i8 - objArr.length, iK2, iK, objArr, objArr);
                } else {
                    int length = iK - (i9 - objArr.length);
                    j.H(0, length, iK, objArr, objArr);
                    Object[] objArr2 = this.f1027r;
                    j.H(i8, iK2, length, objArr2, objArr2);
                }
            } else {
                Object[] objArr3 = this.f1027r;
                j.H(size, 0, iK, objArr3, objArr3);
                Object[] objArr4 = this.f1027r;
                if (i8 >= objArr4.length) {
                    j.H(i8 - objArr4.length, iK2, objArr4.length, objArr4, objArr4);
                } else {
                    j.H(0, objArr4.length - size, objArr4.length, objArr4, objArr4);
                    Object[] objArr5 = this.f1027r;
                    j.H(i8, iK2, objArr5.length - size, objArr5, objArr5);
                }
            }
            c(iK2, collection);
            return true;
        }
        int i10 = this.f1026q;
        int length2 = i10 - size;
        if (iK2 < i10) {
            Object[] objArr6 = this.f1027r;
            j.H(length2, i10, objArr6.length, objArr6, objArr6);
            if (size >= iK2) {
                Object[] objArr7 = this.f1027r;
                j.H(objArr7.length - size, 0, iK2, objArr7, objArr7);
            } else {
                Object[] objArr8 = this.f1027r;
                j.H(objArr8.length - size, 0, size, objArr8, objArr8);
                Object[] objArr9 = this.f1027r;
                j.H(0, size, iK2, objArr9, objArr9);
            }
        } else if (length2 >= 0) {
            Object[] objArr10 = this.f1027r;
            j.H(length2, i10, iK2, objArr10, objArr10);
        } else {
            Object[] objArr11 = this.f1027r;
            length2 += objArr11.length;
            int i11 = iK2 - i10;
            int length3 = objArr11.length - length2;
            if (length3 >= i11) {
                j.H(length2, i10, iK2, objArr11, objArr11);
            } else {
                j.H(length2, i10, i10 + length3, objArr11, objArr11);
                Object[] objArr12 = this.f1027r;
                j.H(0, this.f1026q + length3, iK2, objArr12, objArr12);
            }
        }
        this.f1026q = length2;
        c(i(iK2 - size), collection);
        return true;
    }

    public final void addFirst(Object obj) {
        l();
        f(this.f1028s + 1);
        int length = this.f1026q;
        if (length == 0) {
            Object[] objArr = this.f1027r;
            P6.g.e(objArr, "<this>");
            length = objArr.length;
        }
        int i = length - 1;
        this.f1026q = i;
        this.f1027r[i] = obj;
        this.f1028s++;
    }

    public final void addLast(Object obj) {
        l();
        f(a() + 1);
        this.f1027r[k(a() + this.f1026q)] = obj;
        this.f1028s = a() + 1;
    }

    @Override // B6.f
    public final Object b(int i) {
        int i5 = this.f1028s;
        if (i < 0 || i >= i5) {
            throw new IndexOutOfBoundsException(I1.a.o("index: ", i, i5, ", size: "));
        }
        if (i == l.V(this)) {
            return removeLast();
        }
        if (i == 0) {
            return removeFirst();
        }
        l();
        int iK = k(this.f1026q + i);
        Object[] objArr = this.f1027r;
        Object obj = objArr[iK];
        if (i < (this.f1028s >> 1)) {
            int i8 = this.f1026q;
            if (iK >= i8) {
                j.H(i8 + 1, i8, iK, objArr, objArr);
            } else {
                j.H(1, 0, iK, objArr, objArr);
                Object[] objArr2 = this.f1027r;
                objArr2[0] = objArr2[objArr2.length - 1];
                int i9 = this.f1026q;
                j.H(i9 + 1, i9, objArr2.length - 1, objArr2, objArr2);
            }
            Object[] objArr3 = this.f1027r;
            int i10 = this.f1026q;
            objArr3[i10] = null;
            this.f1026q = g(i10);
        } else {
            int iK2 = k(l.V(this) + this.f1026q);
            if (iK <= iK2) {
                Object[] objArr4 = this.f1027r;
                j.H(iK, iK + 1, iK2 + 1, objArr4, objArr4);
            } else {
                Object[] objArr5 = this.f1027r;
                j.H(iK, iK + 1, objArr5.length, objArr5, objArr5);
                Object[] objArr6 = this.f1027r;
                objArr6[objArr6.length - 1] = objArr6[0];
                j.H(0, 1, iK2 + 1, objArr6, objArr6);
            }
            this.f1027r[iK2] = null;
        }
        this.f1028s--;
        return obj;
    }

    public final void c(int i, Collection collection) {
        Iterator it = collection.iterator();
        int length = this.f1027r.length;
        while (i < length && it.hasNext()) {
            this.f1027r[i] = it.next();
            i++;
        }
        int i5 = this.f1026q;
        for (int i8 = 0; i8 < i5 && it.hasNext(); i8++) {
            this.f1027r[i8] = it.next();
        }
        this.f1028s = collection.size() + this.f1028s;
    }

    @Override // java.util.AbstractList, java.util.AbstractCollection, java.util.Collection, java.util.List
    public final void clear() {
        if (!isEmpty()) {
            l();
            j(this.f1026q, k(a() + this.f1026q));
        }
        this.f1026q = 0;
        this.f1028s = 0;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean contains(Object obj) {
        return indexOf(obj) != -1;
    }

    public final void f(int i) {
        if (i < 0) {
            throw new IllegalStateException("Deque is too big.");
        }
        Object[] objArr = this.f1027r;
        if (i <= objArr.length) {
            return;
        }
        if (objArr == f1025t) {
            if (i < 10) {
                i = 10;
            }
            this.f1027r = new Object[i];
            return;
        }
        int length = objArr.length;
        int i5 = length + (length >> 1);
        if (i5 - i < 0) {
            i5 = i;
        }
        if (i5 - 2147483639 > 0) {
            i5 = i > 2147483639 ? Integer.MAX_VALUE : 2147483639;
        }
        Object[] objArr2 = new Object[i5];
        j.H(0, this.f1026q, objArr.length, objArr, objArr2);
        Object[] objArr3 = this.f1027r;
        int length2 = objArr3.length;
        int i8 = this.f1026q;
        j.H(length2 - i8, 0, i8, objArr3, objArr2);
        this.f1026q = 0;
        this.f1027r = objArr2;
    }

    public final Object first() {
        if (isEmpty()) {
            throw new NoSuchElementException("ArrayDeque is empty.");
        }
        return this.f1027r[this.f1026q];
    }

    public final int g(int i) {
        P6.g.e(this.f1027r, "<this>");
        if (i == r0.length - 1) {
            return 0;
        }
        return i + 1;
    }

    @Override // java.util.AbstractList, java.util.List
    public final Object get(int i) {
        int iA = a();
        if (i < 0 || i >= iA) {
            throw new IndexOutOfBoundsException(I1.a.o("index: ", i, iA, ", size: "));
        }
        return this.f1027r[k(this.f1026q + i)];
    }

    public final Object h() {
        if (isEmpty()) {
            return null;
        }
        return this.f1027r[k(l.V(this) + this.f1026q)];
    }

    public final int i(int i) {
        return i < 0 ? i + this.f1027r.length : i;
    }

    @Override // java.util.AbstractList, java.util.List
    public final int indexOf(Object obj) {
        int i;
        int iK = k(a() + this.f1026q);
        int length = this.f1026q;
        if (length < iK) {
            while (length < iK) {
                if (P6.g.a(obj, this.f1027r[length])) {
                    i = this.f1026q;
                } else {
                    length++;
                }
            }
            return -1;
        }
        if (length < iK) {
            return -1;
        }
        int length2 = this.f1027r.length;
        while (true) {
            if (length >= length2) {
                for (int i5 = 0; i5 < iK; i5++) {
                    if (P6.g.a(obj, this.f1027r[i5])) {
                        length = i5 + this.f1027r.length;
                        i = this.f1026q;
                    }
                }
                return -1;
            }
            if (P6.g.a(obj, this.f1027r[length])) {
                i = this.f1026q;
                break;
            }
            length++;
        }
        return length - i;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean isEmpty() {
        return a() == 0;
    }

    public final void j(int i, int i5) {
        if (i < i5) {
            j.L(this.f1027r, i, i5);
            return;
        }
        Object[] objArr = this.f1027r;
        j.L(objArr, i, objArr.length);
        j.L(this.f1027r, 0, i5);
    }

    public final int k(int i) {
        Object[] objArr = this.f1027r;
        return i >= objArr.length ? i - objArr.length : i;
    }

    public final void l() {
        ((AbstractList) this).modCount++;
    }

    public final Object last() {
        if (isEmpty()) {
            throw new NoSuchElementException("ArrayDeque is empty.");
        }
        return this.f1027r[k(l.V(this) + this.f1026q)];
    }

    @Override // java.util.AbstractList, java.util.List
    public final int lastIndexOf(Object obj) {
        int length;
        int i;
        int iK = k(this.f1028s + this.f1026q);
        int i5 = this.f1026q;
        if (i5 < iK) {
            length = iK - 1;
            if (i5 <= length) {
                while (!P6.g.a(obj, this.f1027r[length])) {
                    if (length != i5) {
                        length--;
                    }
                }
                i = this.f1026q;
                return length - i;
            }
            return -1;
        }
        if (i5 > iK) {
            int i8 = iK - 1;
            while (true) {
                if (-1 >= i8) {
                    Object[] objArr = this.f1027r;
                    P6.g.e(objArr, "<this>");
                    length = objArr.length - 1;
                    int i9 = this.f1026q;
                    if (i9 <= length) {
                        while (!P6.g.a(obj, this.f1027r[length])) {
                            if (length != i9) {
                                length--;
                            }
                        }
                        i = this.f1026q;
                    }
                } else {
                    if (P6.g.a(obj, this.f1027r[i8])) {
                        length = i8 + this.f1027r.length;
                        i = this.f1026q;
                        break;
                    }
                    i8--;
                }
            }
        }
        return -1;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean remove(Object obj) {
        int iIndexOf = indexOf(obj);
        if (iIndexOf == -1) {
            return false;
        }
        b(iIndexOf);
        return true;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean removeAll(Collection collection) {
        int iK;
        P6.g.e(collection, "elements");
        boolean z8 = false;
        z8 = false;
        z8 = false;
        if (!isEmpty() && this.f1027r.length != 0) {
            int iK2 = k(this.f1028s + this.f1026q);
            int i = this.f1026q;
            if (i < iK2) {
                iK = i;
                while (i < iK2) {
                    Object obj = this.f1027r[i];
                    if (collection.contains(obj)) {
                        z8 = true;
                    } else {
                        this.f1027r[iK] = obj;
                        iK++;
                    }
                    i++;
                }
                j.L(this.f1027r, iK, iK2);
            } else {
                int length = this.f1027r.length;
                boolean z9 = false;
                int i5 = i;
                while (i < length) {
                    Object[] objArr = this.f1027r;
                    Object obj2 = objArr[i];
                    objArr[i] = null;
                    if (collection.contains(obj2)) {
                        z9 = true;
                    } else {
                        this.f1027r[i5] = obj2;
                        i5++;
                    }
                    i++;
                }
                iK = k(i5);
                for (int i8 = 0; i8 < iK2; i8++) {
                    Object[] objArr2 = this.f1027r;
                    Object obj3 = objArr2[i8];
                    objArr2[i8] = null;
                    if (collection.contains(obj3)) {
                        z9 = true;
                    } else {
                        this.f1027r[iK] = obj3;
                        iK = g(iK);
                    }
                }
                z8 = z9;
            }
            if (z8) {
                l();
                this.f1028s = i(iK - this.f1026q);
            }
        }
        return z8;
    }

    public final Object removeFirst() {
        if (isEmpty()) {
            throw new NoSuchElementException("ArrayDeque is empty.");
        }
        l();
        Object[] objArr = this.f1027r;
        int i = this.f1026q;
        Object obj = objArr[i];
        objArr[i] = null;
        this.f1026q = g(i);
        this.f1028s = a() - 1;
        return obj;
    }

    public final Object removeLast() {
        if (isEmpty()) {
            throw new NoSuchElementException("ArrayDeque is empty.");
        }
        l();
        int iK = k(l.V(this) + this.f1026q);
        Object[] objArr = this.f1027r;
        Object obj = objArr[iK];
        objArr[iK] = null;
        this.f1028s = a() - 1;
        return obj;
    }

    @Override // java.util.AbstractList
    public final void removeRange(int i, int i5) {
        android.support.v4.media.session.a.c(i, i5, this.f1028s);
        int i8 = i5 - i;
        if (i8 == 0) {
            return;
        }
        if (i8 == this.f1028s) {
            clear();
            return;
        }
        if (i8 == 1) {
            b(i);
            return;
        }
        l();
        if (i < this.f1028s - i5) {
            int iK = k((i - 1) + this.f1026q);
            int iK2 = k((i5 - 1) + this.f1026q);
            while (i > 0) {
                int i9 = iK + 1;
                int iMin = Math.min(i, Math.min(i9, iK2 + 1));
                Object[] objArr = this.f1027r;
                int i10 = iK2 - iMin;
                int i11 = iK - iMin;
                j.H(i10 + 1, i11 + 1, i9, objArr, objArr);
                iK = i(i11);
                iK2 = i(i10);
                i -= iMin;
            }
            int iK3 = k(this.f1026q + i8);
            j(this.f1026q, iK3);
            this.f1026q = iK3;
        } else {
            int iK4 = k(this.f1026q + i5);
            int iK5 = k(this.f1026q + i);
            int i12 = this.f1028s;
            while (true) {
                i12 -= i5;
                if (i12 <= 0) {
                    break;
                }
                Object[] objArr2 = this.f1027r;
                i5 = Math.min(i12, Math.min(objArr2.length - iK4, objArr2.length - iK5));
                Object[] objArr3 = this.f1027r;
                int i13 = iK4 + i5;
                j.H(iK5, iK4, i13, objArr3, objArr3);
                iK4 = k(i13);
                iK5 = k(iK5 + i5);
            }
            int iK6 = k(this.f1028s + this.f1026q);
            j(i(iK6 - i8), iK6);
        }
        this.f1028s -= i8;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean retainAll(Collection collection) {
        int iK;
        P6.g.e(collection, "elements");
        boolean z8 = false;
        z8 = false;
        z8 = false;
        if (!isEmpty() && this.f1027r.length != 0) {
            int iK2 = k(this.f1028s + this.f1026q);
            int i = this.f1026q;
            if (i < iK2) {
                iK = i;
                while (i < iK2) {
                    Object obj = this.f1027r[i];
                    if (collection.contains(obj)) {
                        this.f1027r[iK] = obj;
                        iK++;
                    } else {
                        z8 = true;
                    }
                    i++;
                }
                j.L(this.f1027r, iK, iK2);
            } else {
                int length = this.f1027r.length;
                boolean z9 = false;
                int i5 = i;
                while (i < length) {
                    Object[] objArr = this.f1027r;
                    Object obj2 = objArr[i];
                    objArr[i] = null;
                    if (collection.contains(obj2)) {
                        this.f1027r[i5] = obj2;
                        i5++;
                    } else {
                        z9 = true;
                    }
                    i++;
                }
                iK = k(i5);
                for (int i8 = 0; i8 < iK2; i8++) {
                    Object[] objArr2 = this.f1027r;
                    Object obj3 = objArr2[i8];
                    objArr2[i8] = null;
                    if (collection.contains(obj3)) {
                        this.f1027r[iK] = obj3;
                        iK = g(iK);
                    } else {
                        z9 = true;
                    }
                }
                z8 = z9;
            }
            if (z8) {
                l();
                this.f1028s = i(iK - this.f1026q);
            }
        }
        return z8;
    }

    @Override // java.util.AbstractList, java.util.List
    public final Object set(int i, Object obj) {
        int iA = a();
        if (i < 0 || i >= iA) {
            throw new IndexOutOfBoundsException(I1.a.o("index: ", i, iA, ", size: "));
        }
        int iK = k(this.f1026q + i);
        Object[] objArr = this.f1027r;
        Object obj2 = objArr[iK];
        objArr[iK] = obj;
        return obj2;
    }

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

    public i(int i) {
        Object[] objArr;
        if (i == 0) {
            objArr = f1025t;
        } else if (i > 0) {
            objArr = new Object[i];
        } else {
            throw new IllegalArgumentException(AbstractC0844a.j("Illegal Capacity: ", i));
        }
        this.f1027r = objArr;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final Object[] toArray(Object[] objArr) {
        P6.g.e(objArr, "array");
        int length = objArr.length;
        int i = this.f1028s;
        if (length < i) {
            Object objNewInstance = Array.newInstance(objArr.getClass().getComponentType(), i);
            P6.g.c(objNewInstance, "null cannot be cast to non-null type kotlin.Array<T of kotlin.collections.ArraysKt__ArraysJVMKt.arrayOfNulls>");
            objArr = (Object[]) objNewInstance;
        }
        int iK = k(this.f1028s + this.f1026q);
        int i5 = this.f1026q;
        if (i5 < iK) {
            j.I(i5, iK, 2, this.f1027r, objArr);
        } else if (!isEmpty()) {
            Object[] objArr2 = this.f1027r;
            j.H(0, this.f1026q, objArr2.length, objArr2, objArr);
            Object[] objArr3 = this.f1027r;
            j.H(objArr3.length - this.f1026q, 0, iK, objArr3, objArr);
        }
        int i8 = this.f1028s;
        if (i8 < objArr.length) {
            objArr[i8] = null;
        }
        return objArr;
    }

    @Override // java.util.AbstractList, java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean add(Object obj) {
        addLast(obj);
        return true;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.List
    public final boolean addAll(Collection collection) {
        P6.g.e(collection, "elements");
        if (collection.isEmpty()) {
            return false;
        }
        l();
        f(collection.size() + a());
        c(k(a() + this.f1026q), collection);
        return true;
    }
}