package com.google.common.collect;

import com.google.common.annotations.GwtCompatible;
import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.io.Serializable;
import java.util.AbstractMap;
import java.util.Arrays;
import java.util.Collection;
import java.util.Map;
import java.util.Set;

/* JADX INFO: loaded from: classes2.dex */
@GwtCompatible
@ElementTypesAreNonnullByDefault
public final class HashBiMap<K, V> extends AbstractMap<K, V> implements v, Serializable {
    public transient g0 Q;
    public transient g0 R;
    public transient v S;

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

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

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

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

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

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

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

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

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

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

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

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

    /* JADX INFO: renamed from: m, reason: collision with root package name */
    public transient g0 f23596m;

    public static class Inverse<K, V> extends AbstractMap<V, K> implements v, Serializable {

        /* JADX INFO: renamed from: a, reason: collision with root package name */
        public transient h0 f23597a;
        private final HashBiMap<K, V> forward;

        public Inverse(HashBiMap hashBiMap) {
            this.forward = hashBiMap;
        }

        @GwtIncompatible("serialization")
        private void readObject(ObjectInputStream objectInputStream) throws ClassNotFoundException, IOException {
            objectInputStream.defaultReadObject();
            this.forward.S = this;
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final void clear() {
            this.forward.clear();
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final boolean containsKey(Object obj) {
            return this.forward.containsValue(obj);
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final boolean containsValue(Object obj) {
            return this.forward.containsKey(obj);
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Set entrySet() {
            h0 h0Var = this.f23597a;
            if (h0Var != null) {
                return h0Var;
            }
            h0 h0Var2 = new h0(this.forward);
            this.f23597a = h0Var2;
            return h0Var2;
        }

        @Override // com.google.common.collect.v
        public final Object f(Object obj, Object obj2) {
            return this.forward.p(obj, obj2, true);
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Object get(Object obj) {
            HashBiMap<K, V> hashBiMap = this.forward;
            hashBiMap.getClass();
            int iK = hashBiMap.k(z0.x(obj), obj);
            if (iK == -1) {
                return null;
            }
            return hashBiMap.f23584a[iK];
        }

        @Override // com.google.common.collect.v
        public final v h() {
            return this.forward;
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Set keySet() {
            HashBiMap<K, V> hashBiMap = this.forward;
            g0 g0Var = hashBiMap.Q;
            if (g0Var != null) {
                return g0Var;
            }
            g0 g0Var2 = new g0(hashBiMap, 2);
            hashBiMap.Q = g0Var2;
            return g0Var2;
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Object put(Object obj, Object obj2) {
            return this.forward.p(obj, obj2, false);
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Object remove(Object obj) {
            HashBiMap<K, V> hashBiMap = this.forward;
            hashBiMap.getClass();
            int iX = z0.x(obj);
            int iK = hashBiMap.k(iX, obj);
            if (iK == -1) {
                return null;
            }
            Object obj2 = hashBiMap.f23584a[iK];
            hashBiMap.s(iK, iX);
            return obj2;
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final int size() {
            return this.forward.f23586c;
        }

        @Override // java.util.AbstractMap, java.util.Map
        public final Collection values() {
            return this.forward.keySet();
        }
    }

    public static HashBiMap b() {
        HashBiMap hashBiMap = new HashBiMap();
        hashBiMap.l();
        return hashBiMap;
    }

    public static int[] d(int i10) {
        int[] iArr = new int[i10];
        Arrays.fill(iArr, -1);
        return iArr;
    }

    @J2ktIncompatible
    @GwtIncompatible
    private void readObject(ObjectInputStream objectInputStream) throws ClassNotFoundException, IOException {
        objectInputStream.defaultReadObject();
        int i10 = objectInputStream.readInt();
        l();
        for (int i11 = 0; i11 < i10; i11++) {
            o(objectInputStream.readObject(), objectInputStream.readObject(), false);
        }
    }

    @J2ktIncompatible
    @GwtIncompatible
    private void writeObject(ObjectOutputStream objectOutputStream) throws IOException {
        objectOutputStream.defaultWriteObject();
        objectOutputStream.writeInt(size());
        for (Map.Entry entry : entrySet()) {
            objectOutputStream.writeObject(entry.getKey());
            objectOutputStream.writeObject(entry.getValue());
        }
    }

    public final int a(int i10) {
        return i10 & (this.f23588e.length - 1);
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final void clear() {
        Arrays.fill(this.f23584a, 0, this.f23586c, (Object) null);
        Arrays.fill(this.f23585b, 0, this.f23586c, (Object) null);
        Arrays.fill(this.f23588e, -1);
        Arrays.fill(this.f23589f, -1);
        Arrays.fill(this.f23590g, 0, this.f23586c, -1);
        Arrays.fill(this.f23591h, 0, this.f23586c, -1);
        Arrays.fill(this.f23594k, 0, this.f23586c, -1);
        Arrays.fill(this.f23595l, 0, this.f23586c, -1);
        this.f23586c = 0;
        this.f23592i = -2;
        this.f23593j = -2;
        this.f23587d++;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean containsKey(Object obj) {
        return j(z0.x(obj), obj) != -1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean containsValue(Object obj) {
        return k(z0.x(obj), obj) != -1;
    }

    public final void e(int i10, int i11) {
        com.google.common.base.h.d(i10 != -1);
        int iA = a(i11);
        int[] iArr = this.f23588e;
        int i12 = iArr[iA];
        if (i12 == i10) {
            int[] iArr2 = this.f23590g;
            iArr[iA] = iArr2[i10];
            iArr2[i10] = -1;
            return;
        }
        int i13 = this.f23590g[i12];
        while (true) {
            int i14 = i12;
            i12 = i13;
            if (i12 == -1) {
                throw new AssertionError("Expected to find entry with key " + this.f23584a[i10]);
            }
            if (i12 == i10) {
                int[] iArr3 = this.f23590g;
                iArr3[i14] = iArr3[i10];
                iArr3[i10] = -1;
                return;
            }
            i13 = this.f23590g[i12];
        }
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Set entrySet() {
        g0 g0Var = this.R;
        if (g0Var != null) {
            return g0Var;
        }
        g0 g0Var2 = new g0(this, 0);
        this.R = g0Var2;
        return g0Var2;
    }

    @Override // com.google.common.collect.v
    public final Object f(Object obj, Object obj2) {
        return o(obj, obj2, true);
    }

    public final void g(int i10, int i11) {
        com.google.common.base.h.d(i10 != -1);
        int iA = a(i11);
        int[] iArr = this.f23589f;
        int i12 = iArr[iA];
        if (i12 == i10) {
            int[] iArr2 = this.f23591h;
            iArr[iA] = iArr2[i10];
            iArr2[i10] = -1;
            return;
        }
        int i13 = this.f23591h[i12];
        while (true) {
            int i14 = i12;
            i12 = i13;
            if (i12 == -1) {
                throw new AssertionError("Expected to find entry with value " + this.f23585b[i10]);
            }
            if (i12 == i10) {
                int[] iArr3 = this.f23591h;
                iArr3[i14] = iArr3[i10];
                iArr3[i10] = -1;
                return;
            }
            i13 = this.f23591h[i12];
        }
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object get(Object obj) {
        int iJ = j(z0.x(obj), obj);
        if (iJ == -1) {
            return null;
        }
        return this.f23585b[iJ];
    }

    @Override // com.google.common.collect.v
    public final v h() {
        v vVar = this.S;
        if (vVar != null) {
            return vVar;
        }
        Inverse inverse = new Inverse(this);
        this.S = inverse;
        return inverse;
    }

    public final void i(int i10) {
        int[] iArr = this.f23590g;
        if (iArr.length < i10) {
            int iB = l0.b(iArr.length, i10);
            this.f23584a = Arrays.copyOf(this.f23584a, iB);
            this.f23585b = Arrays.copyOf(this.f23585b, iB);
            int[] iArr2 = this.f23590g;
            int length = iArr2.length;
            int[] iArrCopyOf = Arrays.copyOf(iArr2, iB);
            Arrays.fill(iArrCopyOf, length, iB, -1);
            this.f23590g = iArrCopyOf;
            int[] iArr3 = this.f23591h;
            int length2 = iArr3.length;
            int[] iArrCopyOf2 = Arrays.copyOf(iArr3, iB);
            Arrays.fill(iArrCopyOf2, length2, iB, -1);
            this.f23591h = iArrCopyOf2;
            int[] iArr4 = this.f23594k;
            int length3 = iArr4.length;
            int[] iArrCopyOf3 = Arrays.copyOf(iArr4, iB);
            Arrays.fill(iArrCopyOf3, length3, iB, -1);
            this.f23594k = iArrCopyOf3;
            int[] iArr5 = this.f23595l;
            int length4 = iArr5.length;
            int[] iArrCopyOf4 = Arrays.copyOf(iArr5, iB);
            Arrays.fill(iArrCopyOf4, length4, iB, -1);
            this.f23595l = iArrCopyOf4;
        }
        if (this.f23588e.length < i10) {
            int iF = z0.f(i10);
            this.f23588e = d(iF);
            this.f23589f = d(iF);
            for (int i11 = 0; i11 < this.f23586c; i11++) {
                int iA = a(z0.x(this.f23584a[i11]));
                int[] iArr6 = this.f23590g;
                int[] iArr7 = this.f23588e;
                iArr6[i11] = iArr7[iA];
                iArr7[iA] = i11;
                int iA2 = a(z0.x(this.f23585b[i11]));
                int[] iArr8 = this.f23591h;
                int[] iArr9 = this.f23589f;
                iArr8[i11] = iArr9[iA2];
                iArr9[iA2] = i11;
            }
        }
    }

    public final int j(int i10, Object obj) {
        int[] iArr = this.f23588e;
        int[] iArr2 = this.f23590g;
        Object[] objArr = this.f23584a;
        for (int i11 = iArr[a(i10)]; i11 != -1; i11 = iArr2[i11]) {
            if (com.google.common.base.h.j(objArr[i11], obj)) {
                return i11;
            }
        }
        return -1;
    }

    public final int k(int i10, Object obj) {
        int[] iArr = this.f23589f;
        int[] iArr2 = this.f23591h;
        Object[] objArr = this.f23585b;
        for (int i11 = iArr[a(i10)]; i11 != -1; i11 = iArr2[i11]) {
            if (com.google.common.base.h.j(objArr[i11], obj)) {
                return i11;
            }
        }
        return -1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Set keySet() {
        g0 g0Var = this.f23596m;
        if (g0Var != null) {
            return g0Var;
        }
        g0 g0Var2 = new g0(this, 1);
        this.f23596m = g0Var2;
        return g0Var2;
    }

    public final void l() {
        z0.d(16, "expectedSize");
        int iF = z0.f(16);
        this.f23586c = 0;
        this.f23584a = new Object[16];
        this.f23585b = new Object[16];
        this.f23588e = d(iF);
        this.f23589f = d(iF);
        this.f23590g = d(16);
        this.f23591h = d(16);
        this.f23592i = -2;
        this.f23593j = -2;
        this.f23594k = d(16);
        this.f23595l = d(16);
    }

    public final void m(int i10, int i11) {
        com.google.common.base.h.d(i10 != -1);
        int iA = a(i11);
        int[] iArr = this.f23590g;
        int[] iArr2 = this.f23588e;
        iArr[i10] = iArr2[iA];
        iArr2[iA] = i10;
    }

    public final void n(int i10, int i11) {
        com.google.common.base.h.d(i10 != -1);
        int iA = a(i11);
        int[] iArr = this.f23591h;
        int[] iArr2 = this.f23589f;
        iArr[i10] = iArr2[iA];
        iArr2[iA] = i10;
    }

    public final Object o(Object obj, Object obj2, boolean z10) {
        int iX = z0.x(obj);
        int iJ = j(iX, obj);
        if (iJ != -1) {
            Object obj3 = this.f23585b[iJ];
            if (com.google.common.base.h.j(obj3, obj2)) {
                return obj2;
            }
            u(iJ, obj2, z10);
            return obj3;
        }
        int iX2 = z0.x(obj2);
        int iK = k(iX2, obj2);
        if (!z10) {
            if (!(iK == -1)) {
                throw new IllegalArgumentException(com.google.common.base.h.m("Value already present: %s", obj2));
            }
        } else if (iK != -1) {
            s(iK, iX2);
        }
        i(this.f23586c + 1);
        Object[] objArr = this.f23584a;
        int i10 = this.f23586c;
        objArr[i10] = obj;
        this.f23585b[i10] = obj2;
        m(i10, iX);
        n(this.f23586c, iX2);
        v(this.f23593j, this.f23586c);
        v(this.f23586c, -2);
        this.f23586c++;
        this.f23587d++;
        return null;
    }

    public final Object p(Object obj, Object obj2, boolean z10) {
        int iX = z0.x(obj);
        int iK = k(iX, obj);
        if (iK != -1) {
            Object obj3 = this.f23584a[iK];
            if (com.google.common.base.h.j(obj3, obj2)) {
                return obj2;
            }
            t(iK, obj2, z10);
            return obj3;
        }
        int i10 = this.f23593j;
        int iX2 = z0.x(obj2);
        int iJ = j(iX2, obj2);
        if (!z10) {
            if (!(iJ == -1)) {
                throw new IllegalArgumentException(com.google.common.base.h.m("Key already present: %s", obj2));
            }
        } else if (iJ != -1) {
            i10 = this.f23594k[iJ];
            r(iJ, iX2);
        }
        i(this.f23586c + 1);
        Object[] objArr = this.f23584a;
        int i11 = this.f23586c;
        objArr[i11] = obj2;
        this.f23585b[i11] = obj;
        m(i11, iX2);
        n(this.f23586c, iX);
        int i12 = i10 == -2 ? this.f23592i : this.f23595l[i10];
        v(i10, this.f23586c);
        v(this.f23586c, i12);
        this.f23586c++;
        this.f23587d++;
        return null;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object put(Object obj, Object obj2) {
        return o(obj, obj2, false);
    }

    public final void q(int i10, int i11, int i12) {
        int i13;
        int i14;
        com.google.common.base.h.d(i10 != -1);
        e(i10, i11);
        g(i10, i12);
        v(this.f23594k[i10], this.f23595l[i10]);
        int i15 = this.f23586c - 1;
        if (i15 != i10) {
            int i16 = this.f23594k[i15];
            int i17 = this.f23595l[i15];
            v(i16, i10);
            v(i10, i17);
            Object[] objArr = this.f23584a;
            Object obj = objArr[i15];
            Object[] objArr2 = this.f23585b;
            Object obj2 = objArr2[i15];
            objArr[i10] = obj;
            objArr2[i10] = obj2;
            int iA = a(z0.x(obj));
            int[] iArr = this.f23588e;
            int i18 = iArr[iA];
            if (i18 == i15) {
                iArr[iA] = i10;
            } else {
                int i19 = this.f23590g[i18];
                while (true) {
                    i13 = i18;
                    i18 = i19;
                    if (i18 == i15) {
                        break;
                    } else {
                        i19 = this.f23590g[i18];
                    }
                }
                this.f23590g[i13] = i10;
            }
            int[] iArr2 = this.f23590g;
            iArr2[i10] = iArr2[i15];
            iArr2[i15] = -1;
            int iA2 = a(z0.x(obj2));
            int[] iArr3 = this.f23589f;
            int i20 = iArr3[iA2];
            if (i20 == i15) {
                iArr3[iA2] = i10;
            } else {
                int i21 = this.f23591h[i20];
                while (true) {
                    i14 = i20;
                    i20 = i21;
                    if (i20 == i15) {
                        break;
                    } else {
                        i21 = this.f23591h[i20];
                    }
                }
                this.f23591h[i14] = i10;
            }
            int[] iArr4 = this.f23591h;
            iArr4[i10] = iArr4[i15];
            iArr4[i15] = -1;
        }
        Object[] objArr3 = this.f23584a;
        int i22 = this.f23586c;
        objArr3[i22 - 1] = null;
        this.f23585b[i22 - 1] = null;
        this.f23586c = i22 - 1;
        this.f23587d++;
    }

    public final void r(int i10, int i11) {
        q(i10, i11, z0.x(this.f23585b[i10]));
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object remove(Object obj) {
        int iX = z0.x(obj);
        int iJ = j(iX, obj);
        if (iJ == -1) {
            return null;
        }
        Object obj2 = this.f23585b[iJ];
        r(iJ, iX);
        return obj2;
    }

    public final void s(int i10, int i11) {
        q(i10, z0.x(this.f23584a[i10]), i11);
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final int size() {
        return this.f23586c;
    }

    public final void t(int i10, Object obj, boolean z10) {
        int i11;
        com.google.common.base.h.d(i10 != -1);
        int iX = z0.x(obj);
        int iJ = j(iX, obj);
        int i12 = this.f23593j;
        if (iJ == -1) {
            i11 = -2;
        } else {
            if (!z10) {
                throw new IllegalArgumentException("Key already present in map: " + obj);
            }
            i12 = this.f23594k[iJ];
            i11 = this.f23595l[iJ];
            r(iJ, iX);
            if (i10 == this.f23586c) {
                i10 = iJ;
            }
        }
        if (i12 == i10) {
            i12 = this.f23594k[i10];
        } else if (i12 == this.f23586c) {
            i12 = iJ;
        }
        if (i11 == i10) {
            iJ = this.f23595l[i10];
        } else if (i11 != this.f23586c) {
            iJ = i11;
        }
        v(this.f23594k[i10], this.f23595l[i10]);
        e(i10, z0.x(this.f23584a[i10]));
        this.f23584a[i10] = obj;
        m(i10, z0.x(obj));
        v(i12, i10);
        v(i10, iJ);
    }

    public final void u(int i10, Object obj, boolean z10) {
        com.google.common.base.h.d(i10 != -1);
        int iX = z0.x(obj);
        int iK = k(iX, obj);
        if (iK != -1) {
            if (!z10) {
                throw new IllegalArgumentException("Value already present in map: " + obj);
            }
            s(iK, iX);
            if (i10 == this.f23586c) {
                i10 = iK;
            }
        }
        g(i10, z0.x(this.f23585b[i10]));
        this.f23585b[i10] = obj;
        n(i10, iX);
    }

    public final void v(int i10, int i11) {
        if (i10 == -2) {
            this.f23592i = i11;
        } else {
            this.f23595l[i10] = i11;
        }
        if (i11 == -2) {
            this.f23593j = i10;
        } else {
            this.f23594k[i11] = i10;
        }
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Collection values() {
        g0 g0Var = this.Q;
        if (g0Var != null) {
            return g0Var;
        }
        g0 g0Var2 = new g0(this, 2);
        this.Q = g0Var2;
        return g0Var2;
    }
}