package a.b.c.f;

import java.util.ConcurrentModificationException;
import java.util.Map;

/* JADX INFO: compiled from: SimpleArrayMap.java */
/* JADX INFO: loaded from: classes.dex */
public class k<K, V> {

    /* JADX INFO: renamed from: e, reason: collision with root package name */
    static Object[] f214e;

    /* JADX INFO: renamed from: f, reason: collision with root package name */
    static int f215f;
    static Object[] g;
    static int h;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    int[] f216b;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    Object[] f217c;

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    int f218d;

    public k() {
        this.f216b = c.f183a;
        this.f217c = c.f185c;
        this.f218d = 0;
    }

    private void a(int i) {
        if (i == 8) {
            synchronized (a.class) {
                if (g != null) {
                    Object[] objArr = g;
                    this.f217c = objArr;
                    g = (Object[]) objArr[0];
                    this.f216b = (int[]) objArr[1];
                    objArr[1] = null;
                    objArr[0] = null;
                    h--;
                    return;
                }
            }
        } else if (i == 4) {
            synchronized (a.class) {
                if (f214e != null) {
                    Object[] objArr2 = f214e;
                    this.f217c = objArr2;
                    f214e = (Object[]) objArr2[0];
                    this.f216b = (int[]) objArr2[1];
                    objArr2[1] = null;
                    objArr2[0] = null;
                    f215f--;
                    return;
                }
            }
        }
        this.f216b = new int[i];
        this.f217c = new Object[i << 1];
    }

    private static int b(int[] iArr, int i, int i2) {
        try {
            return c.a(iArr, i, i2);
        } catch (ArrayIndexOutOfBoundsException unused) {
            throw new ConcurrentModificationException();
        }
    }

    private static void d(int[] iArr, Object[] objArr, int i) {
        if (iArr.length == 8) {
            synchronized (a.class) {
                if (h < 10) {
                    objArr[0] = g;
                    objArr[1] = iArr;
                    for (int i2 = (i << 1) - 1; i2 >= 2; i2--) {
                        objArr[i2] = null;
                    }
                    g = objArr;
                    h++;
                }
            }
            return;
        }
        if (iArr.length == 4) {
            synchronized (a.class) {
                if (f215f < 10) {
                    objArr[0] = f214e;
                    objArr[1] = iArr;
                    for (int i3 = (i << 1) - 1; i3 >= 2; i3--) {
                        objArr[i3] = null;
                    }
                    f214e = objArr;
                    f215f++;
                }
            }
        }
    }

    public void c(int i) {
        int i2 = this.f218d;
        int[] iArr = this.f216b;
        if (iArr.length < i) {
            Object[] objArr = this.f217c;
            a(i);
            if (this.f218d > 0) {
                System.arraycopy(iArr, 0, this.f216b, 0, i2);
                System.arraycopy(objArr, 0, this.f217c, 0, i2 << 1);
            }
            d(iArr, objArr, i2);
        }
        if (this.f218d != i2) {
            throw new ConcurrentModificationException();
        }
    }

    public void clear() {
        int i = this.f218d;
        if (i > 0) {
            int[] iArr = this.f216b;
            Object[] objArr = this.f217c;
            this.f216b = c.f183a;
            this.f217c = c.f185c;
            this.f218d = 0;
            d(iArr, objArr, i);
        }
        if (this.f218d > 0) {
            throw new ConcurrentModificationException();
        }
    }

    public boolean containsKey(Object obj) {
        return f(obj) >= 0;
    }

    public boolean containsValue(Object obj) {
        return h(obj) >= 0;
    }

    int e(Object obj, int i) {
        int i2 = this.f218d;
        if (i2 == 0) {
            return -1;
        }
        int iB = b(this.f216b, i2, i);
        if (iB < 0 || obj.equals(this.f217c[iB << 1])) {
            return iB;
        }
        int i3 = iB + 1;
        while (i3 < i2 && this.f216b[i3] == i) {
            if (obj.equals(this.f217c[i3 << 1])) {
                return i3;
            }
            i3++;
        }
        for (int i4 = iB - 1; i4 >= 0 && this.f216b[i4] == i; i4--) {
            if (obj.equals(this.f217c[i4 << 1])) {
                return i4;
            }
        }
        return ~i3;
    }

    public boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }
        if (obj instanceof k) {
            k kVar = (k) obj;
            if (size() != kVar.size()) {
                return false;
            }
            for (int i = 0; i < this.f218d; i++) {
                try {
                    K kI = i(i);
                    V vL = l(i);
                    Object obj2 = kVar.get(kI);
                    if (vL == null) {
                        if (obj2 != null || !kVar.containsKey(kI)) {
                            return false;
                        }
                    } else if (!vL.equals(obj2)) {
                        return false;
                    }
                } catch (ClassCastException | NullPointerException unused) {
                    return false;
                }
            }
            return true;
        }
        if (obj instanceof Map) {
            Map map = (Map) obj;
            if (size() != map.size()) {
                return false;
            }
            for (int i2 = 0; i2 < this.f218d; i2++) {
                try {
                    K kI2 = i(i2);
                    V vL2 = l(i2);
                    Object obj3 = map.get(kI2);
                    if (vL2 == null) {
                        if (obj3 != null || !map.containsKey(kI2)) {
                            return false;
                        }
                    } else if (!vL2.equals(obj3)) {
                        return false;
                    }
                } catch (ClassCastException | NullPointerException unused2) {
                }
            }
            return true;
        }
        return false;
    }

    public int f(Object obj) {
        return obj == null ? g() : e(obj, obj.hashCode());
    }

    int g() {
        int i = this.f218d;
        if (i == 0) {
            return -1;
        }
        int iB = b(this.f216b, i, 0);
        if (iB < 0 || this.f217c[iB << 1] == null) {
            return iB;
        }
        int i2 = iB + 1;
        while (i2 < i && this.f216b[i2] == 0) {
            if (this.f217c[i2 << 1] == null) {
                return i2;
            }
            i2++;
        }
        for (int i3 = iB - 1; i3 >= 0 && this.f216b[i3] == 0; i3--) {
            if (this.f217c[i3 << 1] == null) {
                return i3;
            }
        }
        return ~i2;
    }

    public V get(Object obj) {
        int iF = f(obj);
        if (iF >= 0) {
            return (V) this.f217c[(iF << 1) + 1];
        }
        return null;
    }

    int h(Object obj) {
        int i = this.f218d * 2;
        Object[] objArr = this.f217c;
        if (obj == null) {
            for (int i2 = 1; i2 < i; i2 += 2) {
                if (objArr[i2] == null) {
                    return i2 >> 1;
                }
            }
            return -1;
        }
        for (int i3 = 1; i3 < i; i3 += 2) {
            if (obj.equals(objArr[i3])) {
                return i3 >> 1;
            }
        }
        return -1;
    }

    public int hashCode() {
        int[] iArr = this.f216b;
        Object[] objArr = this.f217c;
        int i = this.f218d;
        int i2 = 1;
        int i3 = 0;
        int iHashCode = 0;
        while (i3 < i) {
            Object obj = objArr[i2];
            iHashCode += (obj == null ? 0 : obj.hashCode()) ^ iArr[i3];
            i3++;
            i2 += 2;
        }
        return iHashCode;
    }

    public K i(int i) {
        return (K) this.f217c[i << 1];
    }

    public boolean isEmpty() {
        return this.f218d <= 0;
    }

    public V j(int i) {
        Object[] objArr = this.f217c;
        int i2 = i << 1;
        V v = (V) objArr[i2 + 1];
        int i3 = this.f218d;
        int i4 = 0;
        if (i3 <= 1) {
            d(this.f216b, objArr, i3);
            this.f216b = c.f183a;
            this.f217c = c.f185c;
        } else {
            int i5 = i3 - 1;
            int[] iArr = this.f216b;
            if (iArr.length <= 8 || i3 >= iArr.length / 3) {
                if (i < i5) {
                    int[] iArr2 = this.f216b;
                    int i6 = i + 1;
                    int i7 = i5 - i;
                    System.arraycopy(iArr2, i6, iArr2, i, i7);
                    Object[] objArr2 = this.f217c;
                    System.arraycopy(objArr2, i6 << 1, objArr2, i2, i7 << 1);
                }
                Object[] objArr3 = this.f217c;
                int i8 = i5 << 1;
                objArr3[i8] = null;
                objArr3[i8 + 1] = null;
            } else {
                int i9 = i3 > 8 ? i3 + (i3 >> 1) : 8;
                int[] iArr3 = this.f216b;
                Object[] objArr4 = this.f217c;
                a(i9);
                if (i3 != this.f218d) {
                    throw new ConcurrentModificationException();
                }
                if (i > 0) {
                    System.arraycopy(iArr3, 0, this.f216b, 0, i);
                    System.arraycopy(objArr4, 0, this.f217c, 0, i2);
                }
                if (i < i5) {
                    int i10 = i + 1;
                    int i11 = i5 - i;
                    System.arraycopy(iArr3, i10, this.f216b, i, i11);
                    System.arraycopy(objArr4, i10 << 1, this.f217c, i2, i11 << 1);
                }
            }
            i4 = i5;
        }
        if (i3 != this.f218d) {
            throw new ConcurrentModificationException();
        }
        this.f218d = i4;
        return v;
    }

    public V k(int i, V v) {
        int i2 = (i << 1) + 1;
        Object[] objArr = this.f217c;
        V v2 = (V) objArr[i2];
        objArr[i2] = v;
        return v2;
    }

    public V l(int i) {
        return (V) this.f217c[(i << 1) + 1];
    }

    public V put(K k, V v) {
        int i;
        int iE;
        int i2 = this.f218d;
        if (k == null) {
            iE = g();
            i = 0;
        } else {
            int iHashCode = k.hashCode();
            i = iHashCode;
            iE = e(k, iHashCode);
        }
        if (iE >= 0) {
            int i3 = (iE << 1) + 1;
            Object[] objArr = this.f217c;
            V v2 = (V) objArr[i3];
            objArr[i3] = v;
            return v2;
        }
        int i4 = ~iE;
        if (i2 >= this.f216b.length) {
            int i5 = 4;
            if (i2 >= 8) {
                i5 = (i2 >> 1) + i2;
            } else if (i2 >= 4) {
                i5 = 8;
            }
            int[] iArr = this.f216b;
            Object[] objArr2 = this.f217c;
            a(i5);
            if (i2 != this.f218d) {
                throw new ConcurrentModificationException();
            }
            int[] iArr2 = this.f216b;
            if (iArr2.length > 0) {
                System.arraycopy(iArr, 0, iArr2, 0, iArr.length);
                System.arraycopy(objArr2, 0, this.f217c, 0, objArr2.length);
            }
            d(iArr, objArr2, i2);
        }
        if (i4 < i2) {
            int[] iArr3 = this.f216b;
            int i6 = i4 + 1;
            System.arraycopy(iArr3, i4, iArr3, i6, i2 - i4);
            Object[] objArr3 = this.f217c;
            System.arraycopy(objArr3, i4 << 1, objArr3, i6 << 1, (this.f218d - i4) << 1);
        }
        int i7 = this.f218d;
        if (i2 == i7) {
            int[] iArr4 = this.f216b;
            if (i4 < iArr4.length) {
                iArr4[i4] = i;
                Object[] objArr4 = this.f217c;
                int i8 = i4 << 1;
                objArr4[i8] = k;
                objArr4[i8 + 1] = v;
                this.f218d = i7 + 1;
                return null;
            }
        }
        throw new ConcurrentModificationException();
    }

    public V remove(Object obj) {
        int iF = f(obj);
        if (iF >= 0) {
            return j(iF);
        }
        return null;
    }

    public int size() {
        return this.f218d;
    }

    public String toString() {
        if (isEmpty()) {
            return "{}";
        }
        StringBuilder sb = new StringBuilder(this.f218d * 28);
        sb.append('{');
        for (int i = 0; i < this.f218d; i++) {
            if (i > 0) {
                sb.append(", ");
            }
            K kI = i(i);
            if (kI != this) {
                sb.append(kI);
            } else {
                sb.append("(this Map)");
            }
            sb.append('=');
            V vL = l(i);
            if (vL != this) {
                sb.append(vL);
            } else {
                sb.append("(this Map)");
            }
        }
        sb.append('}');
        return sb.toString();
    }

    public k(int i) {
        if (i == 0) {
            this.f216b = c.f183a;
            this.f217c = c.f185c;
        } else {
            a(i);
        }
        this.f218d = 0;
    }
}