package defpackage;

import java.util.AbstractQueue;
import java.util.Collection;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.Objects;

/* JADX INFO: loaded from: classes2.dex */
@az3
@li2
public final class hx5<E> extends AbstractQueue<E> {
    public Object[] a;
    public int b;
    public int c;

    public static final class b<B> {
    }

    public class c {
    }

    public static class d<E> {
    }

    public class e implements Iterator<E> {
        public int a = -1;
        public int b = -1;
        public int c;
        public boolean d;

        public e() {
            this.c = hx5.this.c;
        }

        @Override // java.util.Iterator
        public final boolean hasNext() {
            hx5 hx5Var = hx5.this;
            if (hx5Var.c != this.c) {
                throw new ConcurrentModificationException();
            }
            int i = this.a + 1;
            if (this.b < i) {
                this.b = i;
            }
            return this.b < hx5Var.b;
        }

        @Override // java.util.Iterator
        public final Object next() {
            hx5 hx5Var = hx5.this;
            if (hx5Var.c != this.c) {
                throw new ConcurrentModificationException();
            }
            int i = this.a + 1;
            if (this.b < i) {
                this.b = i;
            }
            int i2 = this.b;
            if (i2 >= hx5Var.b) {
                throw new NoSuchElementException("iterator moved past last element in queue.");
            }
            this.a = i2;
            this.d = true;
            Object obj = hx5Var.a[i2];
            Objects.requireNonNull(obj);
            return obj;
        }

        @Override // java.util.Iterator
        public final void remove() {
            k41.d(this.d);
            hx5 hx5Var = hx5.this;
            int i = hx5Var.c;
            int i2 = this.c;
            if (i != i2) {
                throw new ConcurrentModificationException();
            }
            this.d = false;
            this.c = i2 + 1;
            int i3 = this.a;
            if (i3 >= hx5Var.b) {
                throw null;
            }
            hx5Var.a(i3);
            this.a--;
            this.b--;
        }
    }

    public final void a(int i) {
        if7.m(i, this.b);
        this.c++;
        int i2 = this.b - 1;
        this.b = i2;
        if (i2 == i) {
            this.a[i2] = null;
        } else {
            Objects.requireNonNull(this.a[i2]);
            if7.p((~(~(this.b + 1))) > 0, "negative index");
            throw null;
        }
    }

    @Override // java.util.AbstractQueue, java.util.AbstractCollection, java.util.Collection, java.util.Queue
    public final boolean add(Object obj) {
        offer(obj);
        throw null;
    }

    @Override // java.util.AbstractQueue, java.util.AbstractCollection, java.util.Collection
    public final boolean addAll(Collection collection) {
        Iterator<E> it = collection.iterator();
        if (!it.hasNext()) {
            return false;
        }
        offer(it.next());
        throw null;
    }

    @Override // java.util.AbstractQueue, java.util.AbstractCollection, java.util.Collection
    public final void clear() {
        for (int i = 0; i < this.b; i++) {
            this.a[i] = null;
        }
        this.b = 0;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable
    public final Iterator iterator() {
        return new e();
    }

    @Override // java.util.Queue
    public final boolean offer(Object obj) {
        int i;
        obj.getClass();
        this.c++;
        int i2 = this.b + 1;
        this.b = i2;
        Object[] objArr = this.a;
        if (i2 > objArr.length) {
            int length = objArr.length;
            if (length < 64) {
                i = (length + 1) * 2;
            } else {
                int i3 = length / 2;
                long j = ((long) i3) * ((long) 3);
                int i4 = (int) j;
                lq5.a("checkedMultiply", i3, 3, j == ((long) i4));
                i = i4;
            }
            Object[] objArr2 = new Object[Math.min(i - 1, 0) + 1];
            Object[] objArr3 = this.a;
            System.arraycopy(objArr3, 0, objArr2, 0, objArr3.length);
            this.a = objArr2;
        }
        if7.p((~(~i2)) > 0, "negative index");
        throw null;
    }

    @Override // java.util.Queue
    public final Object peek() {
        if (isEmpty()) {
            return null;
        }
        Object obj = this.a[0];
        Objects.requireNonNull(obj);
        return obj;
    }

    @Override // java.util.Queue
    public final Object poll() {
        if (isEmpty()) {
            return null;
        }
        Object obj = this.a[0];
        Objects.requireNonNull(obj);
        a(0);
        return obj;
    }

    @Override // java.util.AbstractCollection, java.util.Collection
    public final int size() {
        return this.b;
    }

    @Override // java.util.AbstractCollection, java.util.Collection
    public final Object[] toArray() {
        int i = this.b;
        Object[] objArr = new Object[i];
        System.arraycopy(this.a, 0, objArr, 0, i);
        return objArr;
    }
}