package i.a.n.h;

/* JADX INFO: compiled from: OpenHashSet.java */
/* JADX INFO: loaded from: classes.dex */
public final class e<T> {
    final float a;
    int b;
    int c;
    int d;
    T[] e;

    public e() {
        this(16, 0.75f);
    }

    static int c(int i2) {
        int i3 = i2 * (-1640531527);
        return i3 ^ (i3 >>> 16);
    }

    public boolean a(T t) {
        T t2;
        T[] tArr = this.e;
        int i2 = this.b;
        int iC = c(t.hashCode()) & i2;
        T t3 = tArr[iC];
        if (t3 != null) {
            if (t3.equals(t)) {
                return false;
            }
            do {
                iC = (iC + 1) & i2;
                t2 = tArr[iC];
                if (t2 == null) {
                }
            } while (!t2.equals(t));
            return false;
        }
        tArr[iC] = t;
        int i3 = this.c + 1;
        this.c = i3;
        if (i3 >= this.d) {
            d();
        }
        return true;
    }

    public Object[] b() {
        return this.e;
    }

    void d() {
        T[] tArr = this.e;
        int length = tArr.length;
        int i2 = length << 1;
        int i3 = i2 - 1;
        T[] tArr2 = (T[]) new Object[i2];
        int i4 = this.c;
        while (true) {
            int i5 = i4 - 1;
            if (i4 == 0) {
                this.b = i3;
                this.d = (int) (i2 * this.a);
                this.e = tArr2;
                return;
            }
            do {
                length--;
            } while (tArr[length] == null);
            int iC = c(tArr[length].hashCode()) & i3;
            if (tArr2[iC] != null) {
                do {
                    iC = (iC + 1) & i3;
                } while (tArr2[iC] != null);
            }
            tArr2[iC] = tArr[length];
            i4 = i5;
        }
    }

    public boolean e(T t) {
        T t2;
        T[] tArr = this.e;
        int i2 = this.b;
        int iC = c(t.hashCode()) & i2;
        T t3 = tArr[iC];
        if (t3 == null) {
            return false;
        }
        if (t3.equals(t)) {
            return f(iC, tArr, i2);
        }
        do {
            iC = (iC + 1) & i2;
            t2 = tArr[iC];
            if (t2 == null) {
                return false;
            }
        } while (!t2.equals(t));
        return f(iC, tArr, i2);
    }

    boolean f(int i2, T[] tArr, int i3) {
        int i4;
        T t;
        this.c--;
        while (true) {
            int i5 = i2 + 1;
            while (true) {
                i4 = i5 & i3;
                t = tArr[i4];
                if (t == null) {
                    tArr[i2] = null;
                    return true;
                }
                int iC = c(t.hashCode()) & i3;
                if (i2 <= i4) {
                    if (i2 >= iC || iC > i4) {
                        break;
                    }
                    i5 = i4 + 1;
                } else if (i2 < iC || iC <= i4) {
                    i5 = i4 + 1;
                }
            }
            tArr[i2] = t;
            i2 = i4;
        }
    }

    public e(int i2, float f) {
        this.a = f;
        int iA = f.a(i2);
        this.b = iA - 1;
        this.d = (int) (f * iA);
        this.e = (T[]) new Object[iA];
    }
}