package defpackage;

import defpackage.od6;
import java.util.Arrays;

/* JADX INFO: loaded from: classes2.dex */
@az3
@li2
class cs6<K> {
    public transient Object[] a;
    public transient int[] b;
    public transient int c;
    public transient int d;
    public transient int[] e;
    public transient long[] f;
    public transient float g;
    public transient int h;

    public class a extends od6.a<K> {
        public final Object a;
        public int b;

        public a(int i) {
            this.a = cs6.this.a[i];
            this.b = i;
        }

        @Override // dd6.a
        public final int getCount() {
            int i = this.b;
            Object obj = this.a;
            cs6 cs6Var = cs6.this;
            if (i == -1 || i >= cs6Var.c || !ts6.a(obj, cs6Var.a[i])) {
                this.b = cs6Var.g(obj);
            }
            int i2 = this.b;
            if (i2 == -1) {
                return 0;
            }
            return cs6Var.b[i2];
        }

        @Override // dd6.a
        public final Object getElement() {
            return this.a;
        }
    }

    public void a() {
        this.d++;
        Arrays.fill(this.a, 0, this.c, (Object) null);
        Arrays.fill(this.b, 0, this.c, 0);
        Arrays.fill(this.e, -1);
        Arrays.fill(this.f, -1L);
        this.c = 0;
    }

    public final void b(int i) {
        if (i > this.f.length) {
            o(i);
        }
        if (i >= this.h) {
            p(Math.max(2, Integer.highestOneBit(i - 1) << 1));
        }
    }

    public int c() {
        return this.c == 0 ? -1 : 0;
    }

    public final int d(Object obj) {
        int iG = g(obj);
        if (iG == -1) {
            return 0;
        }
        return this.b[iG];
    }

    public final Object e(int i) {
        if7.j(i, this.c);
        return this.a[i];
    }

    public final int f(int i) {
        if7.j(i, this.c);
        return this.b[i];
    }

    public final int g(Object obj) {
        int iC = v04.c(obj);
        int i = this.e[(r1.length - 1) & iC];
        while (i != -1) {
            long j = this.f[i];
            if (((int) (j >>> 32)) == iC && ts6.a(obj, this.a[i])) {
                return i;
            }
            i = (int) j;
        }
        return -1;
    }

    public void h(int i) {
        if7.f(i >= 0, "Initial capacity must be non-negative");
        int iA = v04.a(i, 1.0f);
        int[] iArr = new int[iA];
        Arrays.fill(iArr, -1);
        this.e = iArr;
        this.g = 1.0f;
        this.a = new Object[i];
        this.b = new int[i];
        long[] jArr = new long[i];
        Arrays.fill(jArr, -1L);
        this.f = jArr;
        this.h = Math.max(1, (int) (iA * 1.0f));
    }

    public void i(int i, int i2, int i3, Object obj) {
        this.f[i] = (((long) i3) << 32) | 4294967295L;
        this.a[i] = obj;
        this.b[i] = i2;
    }

    public void j(int i) {
        int i2 = this.c - 1;
        if (i >= i2) {
            this.a[i] = null;
            this.b[i] = 0;
            this.f[i] = -1;
            return;
        }
        Object[] objArr = this.a;
        objArr[i] = objArr[i2];
        int[] iArr = this.b;
        iArr[i] = iArr[i2];
        objArr[i2] = null;
        iArr[i2] = 0;
        long[] jArr = this.f;
        long j = jArr[i2];
        jArr[i] = j;
        jArr[i2] = -1;
        int[] iArr2 = this.e;
        int length = ((int) (j >>> 32)) & (iArr2.length - 1);
        int i3 = iArr2[length];
        if (i3 == i2) {
            iArr2[length] = i;
            return;
        }
        while (true) {
            long[] jArr2 = this.f;
            long j2 = jArr2[i3];
            int i4 = (int) j2;
            if (i4 == i2) {
                jArr2[i3] = (j2 & (-4294967296L)) | (4294967295L & ((long) i));
                return;
            }
            i3 = i4;
        }
    }

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

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

    public final int m(int i, Object obj) {
        k41.c(i, "count");
        long[] jArr = this.f;
        Object[] objArr = this.a;
        int[] iArr = this.b;
        int iC = v04.c(obj);
        int[] iArr2 = this.e;
        int length = (iArr2.length - 1) & iC;
        int i2 = this.c;
        int i3 = iArr2[length];
        if (i3 == -1) {
            iArr2[length] = i2;
        } else {
            while (true) {
                long j = jArr[i3];
                if (((int) (j >>> 32)) == iC && ts6.a(obj, objArr[i3])) {
                    int i4 = iArr[i3];
                    iArr[i3] = i;
                    return i4;
                }
                int i5 = (int) j;
                if (i5 == -1) {
                    jArr[i3] = ((-4294967296L) & j) | (4294967295L & ((long) i2));
                    break;
                }
                i3 = i5;
            }
        }
        if (i2 == Integer.MAX_VALUE) {
            throw new IllegalStateException("Cannot contain more than Integer.MAX_VALUE elements!");
        }
        int i6 = i2 + 1;
        int length2 = this.f.length;
        if (i6 > length2) {
            int iMax = Math.max(1, length2 >>> 1) + length2;
            int i7 = iMax >= 0 ? iMax : Integer.MAX_VALUE;
            if (i7 != length2) {
                o(i7);
            }
        }
        i(i2, i, iC, obj);
        this.c = i6;
        if (i2 >= this.h) {
            p(this.e.length * 2);
        }
        this.d++;
        return 0;
    }

    public final int n(int i) {
        Object obj = this.a[i];
        int i2 = (int) (this.f[i] >>> 32);
        int length = (r1.length - 1) & i2;
        int i3 = this.e[length];
        if (i3 != -1) {
            int i4 = -1;
            while (true) {
                if (((int) (this.f[i3] >>> 32)) == i2 && ts6.a(obj, this.a[i3])) {
                    int i5 = this.b[i3];
                    if (i4 == -1) {
                        this.e[length] = (int) this.f[i3];
                    } else {
                        long[] jArr = this.f;
                        jArr[i4] = (jArr[i4] & (-4294967296L)) | (((long) ((int) jArr[i3])) & 4294967295L);
                    }
                    j(i3);
                    this.c--;
                    this.d++;
                    return i5;
                }
                int i6 = (int) this.f[i3];
                if (i6 == -1) {
                    break;
                }
                i4 = i3;
                i3 = i6;
            }
        }
        return 0;
    }

    public void o(int i) {
        this.a = Arrays.copyOf(this.a, i);
        this.b = Arrays.copyOf(this.b, i);
        long[] jArr = this.f;
        int length = jArr.length;
        long[] jArrCopyOf = Arrays.copyOf(jArr, i);
        if (i > length) {
            Arrays.fill(jArrCopyOf, length, i, -1L);
        }
        this.f = jArrCopyOf;
    }

    public final void p(int i) {
        if (this.e.length >= 1073741824) {
            this.h = Integer.MAX_VALUE;
            return;
        }
        int i2 = ((int) (i * this.g)) + 1;
        int[] iArr = new int[i];
        Arrays.fill(iArr, -1);
        long[] jArr = this.f;
        int i3 = i - 1;
        for (int i4 = 0; i4 < this.c; i4++) {
            int i5 = (int) (jArr[i4] >>> 32);
            int i6 = i5 & i3;
            int i7 = iArr[i6];
            iArr[i6] = i4;
            jArr[i4] = (((long) i5) << 32) | (((long) i7) & 4294967295L);
        }
        this.h = i2;
        this.e = iArr;
    }
}