package defpackage;

import java.util.AbstractMap;
import java.util.AbstractSet;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.SortedMap;
import java.util.TreeMap;

/* JADX INFO: renamed from: ᵿˁᵴ, reason: contains not printable characters */
/* JADX INFO: loaded from: classes3.dex */
public final class C5489 extends AbstractMap {

    /* JADX INFO: renamed from: ᵶˇᵱ, reason: contains not printable characters */
    public static final /* synthetic */ int f20747 = 0;

    /* JADX INFO: renamed from: ˌᴵ, reason: contains not printable characters */
    public List f20748;

    /* JADX INFO: renamed from: ᵔᵖᵹᵫ, reason: contains not printable characters */
    public boolean f20749;

    /* JADX INFO: renamed from: ᵜᵪʾ, reason: contains not printable characters */
    public Map f20750;

    /* JADX INFO: renamed from: ᵨᵼⁱ, reason: contains not printable characters */
    public volatile C2528 f20751;

    /* JADX INFO: renamed from: ᵯᵷʽ, reason: contains not printable characters */
    public Map f20752;

    /* JADX INFO: renamed from: ᵻˈᵦʼ, reason: contains not printable characters */
    public static C5489 m11114() {
        C5489 c5489 = new C5489();
        c5489.f20748 = Collections.EMPTY_LIST;
        Map map = Collections.EMPTY_MAP;
        c5489.f20750 = map;
        c5489.f20752 = map;
        return c5489;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final void clear() {
        m11115();
        if (!this.f20748.isEmpty()) {
            this.f20748.clear();
        }
        if (this.f20750.isEmpty()) {
            return;
        }
        this.f20750.clear();
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean containsKey(Object obj) {
        Comparable comparable = (Comparable) obj;
        return m11119(comparable) >= 0 || this.f20750.containsKey(comparable);
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Set entrySet() {
        if (this.f20751 == null) {
            this.f20751 = new C2528(1, this);
        }
        return this.f20751;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final boolean equals(Object obj) {
        if (this == obj) {
            return true;
        }
        if (!(obj instanceof C5489)) {
            return super.equals(obj);
        }
        C5489 c5489 = (C5489) obj;
        int size = size();
        if (size == c5489.size()) {
            int size2 = this.f20748.size();
            if (size2 != c5489.f20748.size()) {
                return ((AbstractSet) entrySet()).equals(c5489.entrySet());
            }
            for (int i = 0; i < size2; i++) {
                if (m11117(i).equals(c5489.m11117(i))) {
                }
            }
            if (size2 != size) {
                return this.f20750.equals(c5489.f20750);
            }
            return true;
        }
        return false;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object get(Object obj) {
        Comparable comparable = (Comparable) obj;
        int iM11119 = m11119(comparable);
        return iM11119 >= 0 ? ((C3225) this.f20748.get(iM11119)).f12284 : this.f20750.get(comparable);
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final int hashCode() {
        int size = this.f20748.size();
        int iHashCode = 0;
        for (int i = 0; i < size; i++) {
            iHashCode += ((C3225) this.f20748.get(i)).hashCode();
        }
        return this.f20750.size() > 0 ? this.f20750.hashCode() + iHashCode : iHashCode;
    }

    @Override // java.util.AbstractMap, java.util.Map
    public final Object remove(Object obj) {
        m11115();
        Comparable comparable = (Comparable) obj;
        int iM11119 = m11119(comparable);
        if (iM11119 >= 0) {
            return m11116(iM11119);
        }
        if (this.f20750.isEmpty()) {
            return null;
        }
        return this.f20750.remove(comparable);
    }

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

    /* JADX INFO: renamed from: ʽˈˋ, reason: contains not printable characters */
    public final void m11115() {
        if (this.f20749) {
            C1390.m3978();
        }
    }

    /* JADX INFO: renamed from: ˊᵫᵗ, reason: contains not printable characters */
    public final Object m11116(int i) {
        m11115();
        Object obj = ((C3225) this.f20748.remove(i)).f12284;
        if (!this.f20750.isEmpty()) {
            Iterator it = m11118().entrySet().iterator();
            List list = this.f20748;
            Map.Entry entry = (Map.Entry) it.next();
            list.add(new C3225(this, (Comparable) entry.getKey(), entry.getValue()));
            it.remove();
        }
        return obj;
    }

    /* JADX INFO: renamed from: ːˏᵟᵯ, reason: contains not printable characters */
    public final Map.Entry m11117(int i) {
        return (Map.Entry) this.f20748.get(i);
    }

    /* JADX INFO: renamed from: ᵨᵣ, reason: contains not printable characters */
    public final SortedMap m11118() {
        m11115();
        if (this.f20750.isEmpty() && !(this.f20750 instanceof TreeMap)) {
            TreeMap treeMap = new TreeMap();
            this.f20750 = treeMap;
            this.f20752 = treeMap.descendingMap();
        }
        return (SortedMap) this.f20750;
    }

    /* JADX WARN: Removed duplicated region for block: B:13:0x0024  */
    /* JADX INFO: renamed from: ᵲᵶᵳˈ, reason: contains not printable characters */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final int m11119(Comparable comparable) {
        int i;
        int i2;
        int size = this.f20748.size();
        int i3 = size - 1;
        if (i3 < 0) {
            i = 0;
            while (i <= i3) {
                int i4 = (i + i3) / 2;
                int iCompareTo = comparable.compareTo(((C3225) this.f20748.get(i4)).f12282);
                if (iCompareTo < 0) {
                    i3 = i4 - 1;
                } else {
                    if (iCompareTo <= 0) {
                        return i4;
                    }
                    i = i4 + 1;
                }
            }
            i2 = i + 1;
        } else {
            int iCompareTo2 = comparable.compareTo(((C3225) this.f20748.get(i3)).f12282);
            if (iCompareTo2 > 0) {
                i2 = size + 1;
            } else {
                if (iCompareTo2 == 0) {
                    return i3;
                }
                i = 0;
                while (i <= i3) {
                }
                i2 = i + 1;
            }
        }
        return -i2;
    }

    @Override // java.util.AbstractMap, java.util.Map
    /* JADX INFO: renamed from: ᵵᵽ, reason: contains not printable characters and merged with bridge method [inline-methods] */
    public final Object put(Comparable comparable, Object obj) {
        m11115();
        int iM11119 = m11119(comparable);
        if (iM11119 >= 0) {
            return ((C3225) this.f20748.get(iM11119)).setValue(obj);
        }
        m11115();
        if (this.f20748.isEmpty() && !(this.f20748 instanceof ArrayList)) {
            this.f20748 = new ArrayList(16);
        }
        int i = -(iM11119 + 1);
        if (i >= 16) {
            return m11118().put(comparable, obj);
        }
        if (this.f20748.size() == 16) {
            C3225 c3225 = (C3225) this.f20748.remove(15);
            m11118().put(c3225.f12282, c3225.f12284);
        }
        this.f20748.add(i, new C3225(this, comparable, obj));
        return null;
    }

    /* JADX INFO: renamed from: ᵷᵺʾᵖ, reason: contains not printable characters */
    public final Set m11121() {
        return this.f20750.isEmpty() ? Collections.EMPTY_SET : this.f20750.entrySet();
    }
}