package c.b.a.u;

import java.io.Serializable;
import java.util.AbstractMap;
import java.util.AbstractSet;
import java.util.Comparator;
import java.util.ConcurrentModificationException;
import java.util.Iterator;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;

/* JADX INFO: loaded from: classes.dex */
public final class r<K, V> extends AbstractMap<K, V> implements Serializable {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public static final Comparator<Comparable> f1350a = new a();

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public Comparator<? super K> f1351b;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public e<K, V> f1352c;

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

    /* JADX INFO: renamed from: e, reason: collision with root package name */
    public int f1354e;

    /* JADX INFO: renamed from: f, reason: collision with root package name */
    public final e<K, V> f1355f;
    public r<K, V>.b g;
    public r<K, V>.c h;

    public class a implements Comparator<Comparable> {
        @Override // java.util.Comparator
        public int compare(Comparable comparable, Comparable comparable2) {
            return comparable.compareTo(comparable2);
        }
    }

    public class b extends AbstractSet<Map.Entry<K, V>> {

        public class a extends r<K, V>.d<Map.Entry<K, V>> {
            public a(b bVar) {
                super();
            }

            @Override // java.util.Iterator
            public Object next() {
                return a();
            }
        }

        public b() {
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public void clear() {
            r.this.clear();
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public boolean contains(Object obj) {
            return (obj instanceof Map.Entry) && r.this.b((Map.Entry) obj) != null;
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable, java.util.Set
        public Iterator<Map.Entry<K, V>> iterator() {
            return new a(this);
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public boolean remove(Object obj) {
            e<K, V> eVarB;
            if (!(obj instanceof Map.Entry) || (eVarB = r.this.b((Map.Entry) obj)) == null) {
                return false;
            }
            r.this.e(eVarB, true);
            return true;
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public int size() {
            return r.this.f1353d;
        }
    }

    public final class c extends AbstractSet<K> {

        public class a extends r<K, V>.d<K> {
            public a(c cVar) {
                super();
            }

            @Override // java.util.Iterator
            public K next() {
                return a().f1367f;
            }
        }

        public c() {
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public void clear() {
            r.this.clear();
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public boolean contains(Object obj) {
            return r.this.c(obj) != null;
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable, java.util.Set
        public Iterator<K> iterator() {
            return new a(this);
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public boolean remove(Object obj) {
            r rVar = r.this;
            e<K, V> eVarC = rVar.c(obj);
            if (eVarC != null) {
                rVar.e(eVarC, true);
            }
            return eVarC != null;
        }

        @Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
        public int size() {
            return r.this.f1353d;
        }
    }

    public abstract class d<T> implements Iterator<T> {

        /* JADX INFO: renamed from: a, reason: collision with root package name */
        public e<K, V> f1358a;

        /* JADX INFO: renamed from: b, reason: collision with root package name */
        public e<K, V> f1359b = null;

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

        public d() {
            this.f1358a = r.this.f1355f.f1365d;
            this.f1360c = r.this.f1354e;
        }

        public final e<K, V> a() {
            e<K, V> eVar = this.f1358a;
            r rVar = r.this;
            if (eVar == rVar.f1355f) {
                throw new NoSuchElementException();
            }
            if (rVar.f1354e != this.f1360c) {
                throw new ConcurrentModificationException();
            }
            this.f1358a = eVar.f1365d;
            this.f1359b = eVar;
            return eVar;
        }

        @Override // java.util.Iterator
        public final boolean hasNext() {
            return this.f1358a != r.this.f1355f;
        }

        @Override // java.util.Iterator
        public final void remove() {
            e<K, V> eVar = this.f1359b;
            if (eVar == null) {
                throw new IllegalStateException();
            }
            r.this.e(eVar, true);
            this.f1359b = null;
            this.f1360c = r.this.f1354e;
        }
    }

    public static final class e<K, V> implements Map.Entry<K, V> {

        /* JADX INFO: renamed from: a, reason: collision with root package name */
        public e<K, V> f1362a;

        /* JADX INFO: renamed from: b, reason: collision with root package name */
        public e<K, V> f1363b;

        /* JADX INFO: renamed from: c, reason: collision with root package name */
        public e<K, V> f1364c;

        /* JADX INFO: renamed from: d, reason: collision with root package name */
        public e<K, V> f1365d;

        /* JADX INFO: renamed from: e, reason: collision with root package name */
        public e<K, V> f1366e;

        /* JADX INFO: renamed from: f, reason: collision with root package name */
        public final K f1367f;
        public V g;
        public int h;

        public e() {
            this.f1367f = null;
            this.f1366e = this;
            this.f1365d = this;
        }

        public e(e<K, V> eVar, K k, e<K, V> eVar2, e<K, V> eVar3) {
            this.f1362a = eVar;
            this.f1367f = k;
            this.h = 1;
            this.f1365d = eVar2;
            this.f1366e = eVar3;
            eVar3.f1365d = this;
            eVar2.f1366e = this;
        }

        @Override // java.util.Map.Entry
        public boolean equals(Object obj) {
            if (!(obj instanceof Map.Entry)) {
                return false;
            }
            Map.Entry entry = (Map.Entry) obj;
            K k = this.f1367f;
            if (k == null) {
                if (entry.getKey() != null) {
                    return false;
                }
            } else if (!k.equals(entry.getKey())) {
                return false;
            }
            V v = this.g;
            if (v == null) {
                if (entry.getValue() != null) {
                    return false;
                }
            } else if (!v.equals(entry.getValue())) {
                return false;
            }
            return true;
        }

        @Override // java.util.Map.Entry
        public K getKey() {
            return this.f1367f;
        }

        @Override // java.util.Map.Entry
        public V getValue() {
            return this.g;
        }

        @Override // java.util.Map.Entry
        public int hashCode() {
            K k = this.f1367f;
            int iHashCode = k == null ? 0 : k.hashCode();
            V v = this.g;
            return iHashCode ^ (v != null ? v.hashCode() : 0);
        }

        @Override // java.util.Map.Entry
        public V setValue(V v) {
            V v2 = this.g;
            this.g = v;
            return v2;
        }

        public String toString() {
            return this.f1367f + "=" + this.g;
        }
    }

    public r() {
        Comparator<Comparable> comparator = f1350a;
        this.f1353d = 0;
        this.f1354e = 0;
        this.f1355f = new e<>();
        this.f1351b = comparator;
    }

    public e<K, V> a(K k, boolean z) {
        int iCompareTo;
        e<K, V> eVar;
        Comparator<? super K> comparator = this.f1351b;
        e<K, V> eVar2 = this.f1352c;
        if (eVar2 != null) {
            Comparable comparable = comparator == f1350a ? (Comparable) k : null;
            while (true) {
                K k2 = eVar2.f1367f;
                iCompareTo = comparable != null ? comparable.compareTo(k2) : comparator.compare(k, k2);
                if (iCompareTo == 0) {
                    return eVar2;
                }
                e<K, V> eVar3 = iCompareTo < 0 ? eVar2.f1363b : eVar2.f1364c;
                if (eVar3 == null) {
                    break;
                }
                eVar2 = eVar3;
            }
        } else {
            iCompareTo = 0;
        }
        if (!z) {
            return null;
        }
        e<K, V> eVar4 = this.f1355f;
        if (eVar2 != null) {
            eVar = new e<>(eVar2, k, eVar4, eVar4.f1366e);
            if (iCompareTo < 0) {
                eVar2.f1363b = eVar;
            } else {
                eVar2.f1364c = eVar;
            }
            d(eVar2, true);
        } else {
            if (comparator == f1350a && !(k instanceof Comparable)) {
                throw new ClassCastException(k.getClass().getName() + " is not Comparable");
            }
            eVar = new e<>(eVar2, k, eVar4, eVar4.f1366e);
            this.f1352c = eVar;
        }
        this.f1353d++;
        this.f1354e++;
        return eVar;
    }

    /* JADX WARN: Removed duplicated region for block: B:14:0x0023  */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
        To view partially-correct add '--show-bad-code' argument
    */
    public c.b.a.u.r.e<K, V> b(java.util.Map.Entry<?, ?> r4) {
        /*
            r3 = this;
            java.lang.Object r0 = r4.getKey()
            c.b.a.u.r$e r3 = r3.c(r0)
            r0 = 1
            r1 = 0
            if (r3 == 0) goto L23
            V r2 = r3.g
            java.lang.Object r4 = r4.getValue()
            if (r2 == r4) goto L1f
            if (r2 == 0) goto L1d
            boolean r4 = r2.equals(r4)
            if (r4 == 0) goto L1d
            goto L1f
        L1d:
            r4 = r1
            goto L20
        L1f:
            r4 = r0
        L20:
            if (r4 == 0) goto L23
            goto L24
        L23:
            r0 = r1
        L24:
            if (r0 == 0) goto L27
            goto L28
        L27:
            r3 = 0
        L28:
            return r3
        */
        throw new UnsupportedOperationException("Method not decompiled: c.b.a.u.r.b(java.util.Map$Entry):c.b.a.u.r$e");
    }

    /* JADX WARN: Multi-variable type inference failed */
    public e<K, V> c(Object obj) {
        if (obj == 0) {
            return null;
        }
        try {
            return a(obj, false);
        } catch (ClassCastException unused) {
            return null;
        }
    }

    @Override // java.util.AbstractMap, java.util.Map
    public void clear() {
        this.f1352c = null;
        this.f1353d = 0;
        this.f1354e++;
        e<K, V> eVar = this.f1355f;
        eVar.f1366e = eVar;
        eVar.f1365d = eVar;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public boolean containsKey(Object obj) {
        return c(obj) != null;
    }

    public final void d(e<K, V> eVar, boolean z) {
        while (eVar != null) {
            e<K, V> eVar2 = eVar.f1363b;
            e<K, V> eVar3 = eVar.f1364c;
            int i = eVar2 != null ? eVar2.h : 0;
            int i2 = eVar3 != null ? eVar3.h : 0;
            int i3 = i - i2;
            if (i3 == -2) {
                e<K, V> eVar4 = eVar3.f1363b;
                e<K, V> eVar5 = eVar3.f1364c;
                int i4 = (eVar4 != null ? eVar4.h : 0) - (eVar5 != null ? eVar5.h : 0);
                if (i4 != -1 && (i4 != 0 || z)) {
                    h(eVar3);
                }
                g(eVar);
                if (z) {
                    return;
                }
            } else if (i3 == 2) {
                e<K, V> eVar6 = eVar2.f1363b;
                e<K, V> eVar7 = eVar2.f1364c;
                int i5 = (eVar6 != null ? eVar6.h : 0) - (eVar7 != null ? eVar7.h : 0);
                if (i5 != 1 && (i5 != 0 || z)) {
                    g(eVar2);
                }
                h(eVar);
                if (z) {
                    return;
                }
            } else if (i3 == 0) {
                eVar.h = i + 1;
                if (z) {
                    return;
                }
            } else {
                eVar.h = Math.max(i, i2) + 1;
                if (!z) {
                    return;
                }
            }
            eVar = eVar.f1362a;
        }
    }

    public void e(e<K, V> eVar, boolean z) {
        int i;
        if (z) {
            e<K, V> eVar2 = eVar.f1366e;
            eVar2.f1365d = eVar.f1365d;
            eVar.f1365d.f1366e = eVar2;
        }
        e<K, V> eVar3 = eVar.f1363b;
        e<K, V> eVar4 = eVar.f1364c;
        e<K, V> eVar5 = eVar.f1362a;
        int i2 = 0;
        if (eVar3 == null || eVar4 == null) {
            if (eVar3 != null) {
                f(eVar, eVar3);
                eVar.f1363b = null;
            } else if (eVar4 != null) {
                f(eVar, eVar4);
                eVar.f1364c = null;
            } else {
                f(eVar, null);
            }
            d(eVar5, false);
            this.f1353d--;
            this.f1354e++;
            return;
        }
        if (eVar3.h > eVar4.h) {
            while (true) {
                e<K, V> eVar6 = eVar3.f1364c;
                if (eVar6 == null) {
                    break;
                } else {
                    eVar3 = eVar6;
                }
            }
        } else {
            while (true) {
                e<K, V> eVar7 = eVar4.f1363b;
                if (eVar7 == null) {
                    break;
                } else {
                    eVar4 = eVar7;
                }
            }
            eVar3 = eVar4;
        }
        e(eVar3, false);
        e<K, V> eVar8 = eVar.f1363b;
        if (eVar8 != null) {
            i = eVar8.h;
            eVar3.f1363b = eVar8;
            eVar8.f1362a = eVar3;
            eVar.f1363b = null;
        } else {
            i = 0;
        }
        e<K, V> eVar9 = eVar.f1364c;
        if (eVar9 != null) {
            i2 = eVar9.h;
            eVar3.f1364c = eVar9;
            eVar9.f1362a = eVar3;
            eVar.f1364c = null;
        }
        eVar3.h = Math.max(i, i2) + 1;
        f(eVar, eVar3);
    }

    @Override // java.util.AbstractMap, java.util.Map
    public Set<Map.Entry<K, V>> entrySet() {
        r<K, V>.b bVar = this.g;
        if (bVar != null) {
            return bVar;
        }
        r<K, V>.b bVar2 = new b();
        this.g = bVar2;
        return bVar2;
    }

    public final void f(e<K, V> eVar, e<K, V> eVar2) {
        e<K, V> eVar3 = eVar.f1362a;
        eVar.f1362a = null;
        if (eVar2 != null) {
            eVar2.f1362a = eVar3;
        }
        if (eVar3 == null) {
            this.f1352c = eVar2;
        } else if (eVar3.f1363b == eVar) {
            eVar3.f1363b = eVar2;
        } else {
            eVar3.f1364c = eVar2;
        }
    }

    public final void g(e<K, V> eVar) {
        e<K, V> eVar2 = eVar.f1363b;
        e<K, V> eVar3 = eVar.f1364c;
        e<K, V> eVar4 = eVar3.f1363b;
        e<K, V> eVar5 = eVar3.f1364c;
        eVar.f1364c = eVar4;
        if (eVar4 != null) {
            eVar4.f1362a = eVar;
        }
        f(eVar, eVar3);
        eVar3.f1363b = eVar;
        eVar.f1362a = eVar3;
        int iMax = Math.max(eVar2 != null ? eVar2.h : 0, eVar4 != null ? eVar4.h : 0) + 1;
        eVar.h = iMax;
        eVar3.h = Math.max(iMax, eVar5 != null ? eVar5.h : 0) + 1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public V get(Object obj) {
        e<K, V> eVarC = c(obj);
        if (eVarC != null) {
            return eVarC.g;
        }
        return null;
    }

    public final void h(e<K, V> eVar) {
        e<K, V> eVar2 = eVar.f1363b;
        e<K, V> eVar3 = eVar.f1364c;
        e<K, V> eVar4 = eVar2.f1363b;
        e<K, V> eVar5 = eVar2.f1364c;
        eVar.f1363b = eVar5;
        if (eVar5 != null) {
            eVar5.f1362a = eVar;
        }
        f(eVar, eVar2);
        eVar2.f1364c = eVar;
        eVar.f1362a = eVar2;
        int iMax = Math.max(eVar3 != null ? eVar3.h : 0, eVar5 != null ? eVar5.h : 0) + 1;
        eVar.h = iMax;
        eVar2.h = Math.max(iMax, eVar4 != null ? eVar4.h : 0) + 1;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public Set<K> keySet() {
        r<K, V>.c cVar = this.h;
        if (cVar != null) {
            return cVar;
        }
        r<K, V>.c cVar2 = new c();
        this.h = cVar2;
        return cVar2;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public V put(K k, V v) {
        Objects.requireNonNull(k, "key == null");
        e<K, V> eVarA = a(k, true);
        V v2 = eVarA.g;
        eVarA.g = v;
        return v2;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public V remove(Object obj) {
        e<K, V> eVarC = c(obj);
        if (eVarC != null) {
            e(eVarC, true);
        }
        if (eVarC != null) {
            return eVarC.g;
        }
        return null;
    }

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