package C3;

import java.io.Serializable;
import java.util.AbstractMap;
import java.util.Arrays;
import java.util.Collection;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Objects;
import java.util.Set;
import v0.AbstractC1664c;

/* JADX INFO: renamed from: C3.u, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes.dex */
public final class C0058u extends AbstractMap implements Serializable {

    /* JADX INFO: renamed from: z, reason: collision with root package name */
    public static final Object f1304z = new Object();

    /* JADX INFO: renamed from: q, reason: collision with root package name */
    public transient Object f1305q;

    /* JADX INFO: renamed from: r, reason: collision with root package name */
    public transient int[] f1306r;

    /* JADX INFO: renamed from: s, reason: collision with root package name */
    public transient Object[] f1307s;

    /* JADX INFO: renamed from: t, reason: collision with root package name */
    public transient Object[] f1308t;

    /* JADX INFO: renamed from: u, reason: collision with root package name */
    public transient int f1309u;

    /* JADX INFO: renamed from: v, reason: collision with root package name */
    public transient int f1310v;

    /* JADX INFO: renamed from: w, reason: collision with root package name */
    public transient C0056s f1311w;

    /* JADX INFO: renamed from: x, reason: collision with root package name */
    public transient C0056s f1312x;

    /* JADX INFO: renamed from: y, reason: collision with root package name */
    public transient C0052n f1313y;

    public static C0058u a(int i) {
        C0058u c0058u = new C0058u();
        AbstractC1664c.e("Expected size must be >= 0", i >= 0);
        c0058u.f1309u = Math.min(Math.max(i, 1), 1073741823);
        return c0058u;
    }

    public final Map b() {
        Object obj = this.f1305q;
        if (obj instanceof Map) {
            return (Map) obj;
        }
        return null;
    }

    public final int c() {
        return (1 << (this.f1309u & 31)) - 1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final void clear() {
        if (f()) {
            return;
        }
        this.f1309u += 32;
        Map mapB = b();
        if (mapB != null) {
            this.f1309u = Math.min(Math.max(size(), 3), 1073741823);
            mapB.clear();
            this.f1305q = null;
            this.f1310v = 0;
            return;
        }
        Arrays.fill(i(), 0, this.f1310v, (Object) null);
        Arrays.fill(j(), 0, this.f1310v, (Object) null);
        Object obj = this.f1305q;
        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(h(), 0, this.f1310v, 0);
        this.f1310v = 0;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean containsKey(Object obj) {
        Map mapB = b();
        return mapB != null ? mapB.containsKey(obj) : d(obj) != -1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean containsValue(Object obj) {
        Map mapB = b();
        if (mapB != null) {
            return mapB.containsValue(obj);
        }
        for (int i = 0; i < this.f1310v; i++) {
            if (s7.l.h(obj, j()[i])) {
                return true;
            }
        }
        return false;
    }

    public final int d(Object obj) {
        if (f()) {
            return -1;
        }
        int iO = AbstractC0055q.o(obj);
        int iC = c();
        Object obj2 = this.f1305q;
        Objects.requireNonNull(obj2);
        int iP = AbstractC0055q.p(iO & iC, obj2);
        if (iP == 0) {
            return -1;
        }
        int i = ~iC;
        int i5 = iO & i;
        do {
            int i8 = iP - 1;
            int i9 = h()[i8];
            if ((i9 & i) == i5 && s7.l.h(obj, i()[i8])) {
                return i8;
            }
            iP = i9 & iC;
        } while (iP != 0);
        return -1;
    }

    public final void e(int i, int i5) {
        Object obj = this.f1305q;
        Objects.requireNonNull(obj);
        int[] iArrH = h();
        Object[] objArrI = i();
        Object[] objArrJ = j();
        int size = size();
        int i8 = size - 1;
        if (i >= i8) {
            objArrI[i] = null;
            objArrJ[i] = null;
            iArrH[i] = 0;
            return;
        }
        Object obj2 = objArrI[i8];
        objArrI[i] = obj2;
        objArrJ[i] = objArrJ[i8];
        objArrI[i8] = null;
        objArrJ[i8] = null;
        iArrH[i] = iArrH[i8];
        iArrH[i8] = 0;
        int iO = AbstractC0055q.o(obj2) & i5;
        int iP = AbstractC0055q.p(iO, obj);
        if (iP == size) {
            AbstractC0055q.q(iO, i + 1, obj);
            return;
        }
        while (true) {
            int i9 = iP - 1;
            int i10 = iArrH[i9];
            int i11 = i10 & i5;
            if (i11 == size) {
                iArrH[i9] = AbstractC0055q.k(i10, i + 1, i5);
                return;
            }
            iP = i11;
        }
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Set entrySet() {
        C0056s c0056s = this.f1312x;
        if (c0056s != null) {
            return c0056s;
        }
        C0056s c0056s2 = new C0056s(this, 0);
        this.f1312x = c0056s2;
        return c0056s2;
    }

    public final boolean f() {
        return this.f1305q == null;
    }

    public final Object g(Object obj) {
        boolean zF = f();
        Object obj2 = f1304z;
        if (!zF) {
            int iC = c();
            Object obj3 = this.f1305q;
            Objects.requireNonNull(obj3);
            int iL = AbstractC0055q.l(obj, null, iC, obj3, h(), i(), null);
            if (iL != -1) {
                Object obj4 = j()[iL];
                e(iL, iC);
                this.f1310v--;
                this.f1309u += 32;
                return obj4;
            }
        }
        return obj2;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object get(Object obj) {
        Map mapB = b();
        if (mapB != null) {
            return mapB.get(obj);
        }
        int iD = d(obj);
        if (iD == -1) {
            return null;
        }
        return j()[iD];
    }

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

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

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

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

    public final int k(int i, int i5, int i8, int i9) {
        Object objD = AbstractC0055q.d(i5);
        int i10 = i5 - 1;
        if (i9 != 0) {
            AbstractC0055q.q(i8 & i10, i9 + 1, objD);
        }
        Object obj = this.f1305q;
        Objects.requireNonNull(obj);
        int[] iArrH = h();
        for (int i11 = 0; i11 <= i; i11++) {
            int iP = AbstractC0055q.p(i11, obj);
            while (iP != 0) {
                int i12 = iP - 1;
                int i13 = iArrH[i12];
                int i14 = ((~i) & i13) | i11;
                int i15 = i14 & i10;
                int iP2 = AbstractC0055q.p(i15, objD);
                AbstractC0055q.q(i15, iP, objD);
                iArrH[i12] = AbstractC0055q.k(i14, iP2, i10);
                iP = i13 & i;
            }
        }
        this.f1305q = objD;
        this.f1309u = AbstractC0055q.k(this.f1309u, 32 - Integer.numberOfLeadingZeros(i10), 31);
        return i10;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Set keySet() {
        C0056s c0056s = this.f1311w;
        if (c0056s != null) {
            return c0056s;
        }
        C0056s c0056s2 = new C0056s(this, 1);
        this.f1311w = c0056s2;
        return c0056s2;
    }

    /* JADX WARN: Removed duplicated region for block: B:40:0x00eb  */
    /* JADX WARN: Unsupported multi-entry loop pattern (BACK_EDGE: B:41:0x00fe -> B:37:0x00e4). Please report as a decompilation issue!!! */
    @Override // java.util.AbstractMap, java.util.Map
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final Object put(Object obj, Object obj2) {
        int i;
        int i5 = 32;
        int i8 = 1;
        if (f()) {
            AbstractC1664c.j("Arrays already allocated", f());
            int i9 = this.f1309u;
            int iMax = Math.max(i9 + 1, 2);
            int iHighestOneBit = Integer.highestOneBit(iMax);
            if (iMax > ((int) (1.0d * ((double) iHighestOneBit))) && (iHighestOneBit = iHighestOneBit << 1) <= 0) {
                iHighestOneBit = 1073741824;
            }
            int iMax2 = Math.max(4, iHighestOneBit);
            this.f1305q = AbstractC0055q.d(iMax2);
            this.f1309u = AbstractC0055q.k(this.f1309u, 32 - Integer.numberOfLeadingZeros(iMax2 - 1), 31);
            this.f1306r = new int[i9];
            this.f1307s = new Object[i9];
            this.f1308t = new Object[i9];
        }
        Map mapB = b();
        if (mapB != null) {
            return mapB.put(obj, obj2);
        }
        int[] iArrH = h();
        Object[] objArrI = i();
        Object[] objArrJ = j();
        int i10 = this.f1310v;
        int i11 = i10 + 1;
        int iO = AbstractC0055q.o(obj);
        int iC = c();
        int i12 = iO & iC;
        Object obj3 = this.f1305q;
        Objects.requireNonNull(obj3);
        int iP = AbstractC0055q.p(i12, obj3);
        if (iP == 0) {
            if (i11 > iC) {
                iC = k(iC, (iC + 1) * (iC < 32 ? 4 : 2), iO, i10);
            } else {
                Object obj4 = this.f1305q;
                Objects.requireNonNull(obj4);
                AbstractC0055q.q(i12, i11, obj4);
            }
            i = 1;
        } else {
            int i13 = ~iC;
            int i14 = iO & i13;
            int i15 = 0;
            while (true) {
                int i16 = iP - i8;
                i = i8;
                int i17 = iArrH[i16];
                int i18 = i5;
                if ((i17 & i13) == i14 && s7.l.h(obj, objArrI[i16])) {
                    Object obj5 = objArrJ[i16];
                    objArrJ[i16] = obj2;
                    return obj5;
                }
                int i19 = i17 & iC;
                int i20 = i15 + 1;
                if (i19 != 0) {
                    i15 = i20;
                    iP = i19;
                    i8 = i;
                    i5 = i18;
                } else {
                    if (i20 >= 9) {
                        LinkedHashMap linkedHashMap = new LinkedHashMap(c() + 1, 1.0f);
                        int i21 = isEmpty() ? -1 : 0;
                        while (i21 >= 0) {
                            linkedHashMap.put(i()[i21], j()[i21]);
                            int i22 = i21 + 1;
                            if (i22 < this.f1310v) {
                                i21 = i22;
                            } else {
                                while (i21 >= 0) {
                                }
                            }
                        }
                        this.f1305q = linkedHashMap;
                        this.f1306r = null;
                        this.f1307s = null;
                        this.f1308t = null;
                        this.f1309u += 32;
                        return linkedHashMap.put(obj, obj2);
                    }
                    if (i11 > iC) {
                        iC = k(iC, (iC + 1) * (iC < i18 ? 4 : 2), iO, i10);
                    } else {
                        iArrH[i16] = AbstractC0055q.k(i17, i11, iC);
                    }
                }
            }
        }
        int length = h().length;
        if (i11 > length) {
            int i23 = i;
            int iMin = Math.min(1073741823, (Math.max(i23, length >>> 1) + length) | i23);
            if (iMin != length) {
                this.f1306r = Arrays.copyOf(h(), iMin);
                this.f1307s = Arrays.copyOf(i(), iMin);
                this.f1308t = Arrays.copyOf(j(), iMin);
            }
        }
        h()[i10] = AbstractC0055q.k(iO, 0, iC);
        i()[i10] = obj;
        j()[i10] = obj2;
        this.f1310v = i11;
        this.f1309u += 32;
        return null;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object remove(Object obj) {
        Map mapB = b();
        if (mapB != null) {
            return mapB.remove(obj);
        }
        Object objG = g(obj);
        if (objG == f1304z) {
            return null;
        }
        return objG;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final int size() {
        Map mapB = b();
        return mapB != null ? mapB.size() : this.f1310v;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Collection values() {
        C0052n c0052n = this.f1313y;
        if (c0052n != null) {
            return c0052n;
        }
        C0052n c0052n2 = new C0052n(1, this);
        this.f1313y = c0052n2;
        return c0052n2;
    }
}