package defpackage;

import java.io.Serializable;
import java.util.AbstractSet;
import java.util.Arrays;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.Objects;
import java.util.Set;

/* JADX INFO: loaded from: classes2.dex */
@dz3
@li2
class j71<E> extends AbstractSet<E> implements Serializable {
    public transient Object a;
    public transient int[] b;
    public transient Object[] c;
    public transient int d;
    public transient int e;

    public j71(int i) {
        g(i);
    }

    public int a(int i, int i2) {
        return i - 1;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public final boolean add(Object obj) {
        int iMin;
        if (j()) {
            b();
        }
        Set setD = d();
        if (setD != null) {
            return setD.add(obj);
        }
        int[] iArrL = l();
        Object[] objArrK = k();
        int i = this.e;
        int i2 = i + 1;
        int iC = v04.c(obj);
        int iO = (1 << (this.d & 31)) - 1;
        int i3 = iC & iO;
        Object obj2 = this.a;
        Objects.requireNonNull(obj2);
        int iE = k71.e(i3, obj2);
        if (iE != 0) {
            int i4 = ~iO;
            int i5 = iC & i4;
            int i6 = 0;
            while (true) {
                int i7 = iE - 1;
                int i8 = iArrL[i7];
                if ((i8 & i4) == i5 && ts6.a(obj, objArrK[i7])) {
                    return false;
                }
                int i9 = i8 & iO;
                i6++;
                if (i9 != 0) {
                    iE = i9;
                } else {
                    if (i6 >= 9) {
                        return c().add(obj);
                    }
                    if (i2 > iO) {
                        iO = o(iO, k71.c(iO), iC, i);
                    } else {
                        iArrL[i7] = k71.b(i8, i2, iO);
                    }
                }
            }
        } else if (i2 > iO) {
            iO = o(iO, k71.c(iO), iC, i);
        } else {
            Object obj3 = this.a;
            Objects.requireNonNull(obj3);
            k71.f(i3, i2, obj3);
        }
        int length = l().length;
        if (i2 > length && (iMin = Math.min(1073741823, (Math.max(1, length >>> 1) + length) | 1)) != length) {
            m(iMin);
        }
        h(i, iC, iO, obj);
        this.e = i2;
        this.d += 32;
        return true;
    }

    public int b() {
        if7.p(j(), "Arrays already allocated");
        int i = this.d;
        int iMax = Math.max(4, v04.a(i + 1, 1.0d));
        this.a = k71.a(iMax);
        this.d = k71.b(this.d, 32 - Integer.numberOfLeadingZeros(iMax - 1), 31);
        this.b = new int[i];
        this.c = new Object[i];
        return i;
    }

    /* JADX WARN: Multi-variable type inference failed */
    public LinkedHashSet c() {
        LinkedHashSet linkedHashSet = new LinkedHashSet(1 << (this.d & 31), 1.0f);
        int iE = e();
        while (iE >= 0) {
            linkedHashSet.add(k()[iE]);
            iE = f(iE);
        }
        this.a = linkedHashSet;
        this.b = null;
        this.c = null;
        this.d += 32;
        return linkedHashSet;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public void clear() {
        if (j()) {
            return;
        }
        this.d += 32;
        Set setD = d();
        if (setD != null) {
            this.d = pr4.c(size(), 3);
            setD.clear();
            this.a = null;
            this.e = 0;
            return;
        }
        Arrays.fill(k(), 0, this.e, (Object) null);
        Object obj = this.a;
        Objects.requireNonNull(obj);
        if (obj instanceof byte[]) {
            Arrays.fill((byte[]) obj, (byte) 0);
        } else if (obj instanceof short[]) {
            Arrays.fill((short[]) obj, (short) 0);
        } else {
            Arrays.fill((int[]) obj, 0);
        }
        Arrays.fill(l(), 0, this.e, 0);
        this.e = 0;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public final boolean contains(Object obj) {
        if (j()) {
            return false;
        }
        Set setD = d();
        if (setD != null) {
            return setD.contains(obj);
        }
        int iC = v04.c(obj);
        int i = (1 << (this.d & 31)) - 1;
        Object obj2 = this.a;
        Objects.requireNonNull(obj2);
        int iE = k71.e(iC & i, obj2);
        if (iE == 0) {
            return false;
        }
        int i2 = ~i;
        int i3 = iC & i2;
        do {
            int i4 = iE - 1;
            int i5 = l()[i4];
            if ((i5 & i2) == i3 && ts6.a(obj, k()[i4])) {
                return true;
            }
            iE = i5 & i;
        } while (iE != 0);
        return false;
    }

    public final Set d() {
        Object obj = this.a;
        if (obj instanceof Set) {
            return (Set) obj;
        }
        return null;
    }

    public int e() {
        return isEmpty() ? -1 : 0;
    }

    public int f(int i) {
        int i2 = i + 1;
        if (i2 < this.e) {
            return i2;
        }
        return -1;
    }

    public void g(int i) {
        if7.f(i >= 0, "Expected size must be >= 0");
        this.d = pr4.c(i, 1);
    }

    public void h(int i, int i2, int i3, Object obj) {
        l()[i] = k71.b(i2, 0, i3);
        k()[i] = obj;
    }

    public void i(int i, int i2) {
        Object obj = this.a;
        Objects.requireNonNull(obj);
        int[] iArrL = l();
        Object[] objArrK = k();
        int size = size();
        int i3 = size - 1;
        if (i >= i3) {
            objArrK[i] = null;
            iArrL[i] = 0;
            return;
        }
        Object obj2 = objArrK[i3];
        objArrK[i] = obj2;
        objArrK[i3] = null;
        iArrL[i] = iArrL[i3];
        iArrL[i3] = 0;
        int iC = v04.c(obj2) & i2;
        int iE = k71.e(iC, obj);
        if (iE == size) {
            k71.f(iC, i + 1, obj);
            return;
        }
        while (true) {
            int i4 = iE - 1;
            int i5 = iArrL[i4];
            int i6 = i5 & i2;
            if (i6 == size) {
                iArrL[i4] = k71.b(i5, i + 1, i2);
                return;
            }
            iE = i6;
        }
    }

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

    @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable, java.util.Set
    public final Iterator iterator() {
        Set setD = d();
        return setD != null ? setD.iterator() : new i71(this);
    }

    public final boolean j() {
        return this.a == null;
    }

    public final Object[] k() {
        Object[] objArr = this.c;
        Objects.requireNonNull(objArr);
        return objArr;
    }

    public final int[] l() {
        int[] iArr = this.b;
        Objects.requireNonNull(iArr);
        return iArr;
    }

    public void m(int i) {
        this.b = Arrays.copyOf(l(), i);
        this.c = Arrays.copyOf(k(), i);
    }

    public final int o(int i, int i2, int i3, int i4) {
        Object objA = k71.a(i2);
        int i5 = i2 - 1;
        if (i4 != 0) {
            k71.f(i3 & i5, i4 + 1, objA);
        }
        Object obj = this.a;
        Objects.requireNonNull(obj);
        int[] iArrL = l();
        for (int i6 = 0; i6 <= i; i6++) {
            int iE = k71.e(i6, obj);
            while (iE != 0) {
                int i7 = iE - 1;
                int i8 = iArrL[i7];
                int i9 = ((~i) & i8) | i6;
                int i10 = i9 & i5;
                int iE2 = k71.e(i10, objA);
                k71.f(i10, iE, objA);
                iArrL[i7] = k71.b(i9, iE2, i5);
                iE = i8 & i;
            }
        }
        this.a = objA;
        this.d = k71.b(this.d, 32 - Integer.numberOfLeadingZeros(i5), 31);
        return i5;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public final boolean remove(Object obj) {
        if (j()) {
            return false;
        }
        Set setD = d();
        if (setD != null) {
            return setD.remove(obj);
        }
        int i = (1 << (this.d & 31)) - 1;
        Object obj2 = this.a;
        Objects.requireNonNull(obj2);
        int iD = k71.d(obj, null, i, obj2, l(), k(), null);
        if (iD == -1) {
            return false;
        }
        i(iD, i);
        this.e--;
        this.d += 32;
        return true;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public final int size() {
        Set setD = d();
        return setD != null ? setD.size() : this.e;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public Object[] toArray() {
        if (j()) {
            return new Object[0];
        }
        Set setD = d();
        return setD != null ? setD.toArray() : Arrays.copyOf(k(), this.e);
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
    public Object[] toArray(Object[] objArr) {
        if (j()) {
            if (objArr.length > 0) {
                objArr[0] = null;
            }
            return objArr;
        }
        Set setD = d();
        if (setD != null) {
            return setD.toArray(objArr);
        }
        Object[] objArrK = k();
        int i = this.e;
        if7.n(0, i, objArrK.length);
        if (objArr.length < i) {
            if (objArr.length != 0) {
                objArr = Arrays.copyOf(objArr, 0);
            }
            objArr = Arrays.copyOf(objArr, i);
        } else if (objArr.length > i) {
            objArr[i] = null;
        }
        System.arraycopy(objArrK, 0, objArr, 0, i);
        return objArr;
    }
}