package x4;

import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import n2.AbstractC2613d;

/* JADX INFO: renamed from: x4.F, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes3.dex */
public abstract class AbstractC3229F extends AbstractC2613d {
    public static Map A(w4.k kVar, Map map) {
        kotlin.jvm.internal.o.h(map, "<this>");
        if (map.isEmpty()) {
            return v(kVar);
        }
        LinkedHashMap linkedHashMap = new LinkedHashMap(map);
        linkedHashMap.put(kVar.f25469a, kVar.f25470b);
        return linkedHashMap;
    }

    public static void B(Map map, R4.k pairs) {
        kotlin.jvm.internal.o.h(map, "<this>");
        kotlin.jvm.internal.o.h(pairs, "pairs");
        Iterator it = pairs.iterator();
        while (it.hasNext()) {
            w4.k kVar = (w4.k) it.next();
            map.put(kVar.f25469a, kVar.f25470b);
        }
    }

    public static void C(Map map, Iterable pairs) {
        kotlin.jvm.internal.o.h(map, "<this>");
        kotlin.jvm.internal.o.h(pairs, "pairs");
        Iterator it = pairs.iterator();
        while (it.hasNext()) {
            w4.k kVar = (w4.k) it.next();
            map.put(kVar.f25469a, kVar.f25470b);
        }
    }

    public static void D(Map map, w4.k[] pairs) {
        kotlin.jvm.internal.o.h(map, "<this>");
        kotlin.jvm.internal.o.h(pairs, "pairs");
        for (w4.k kVar : pairs) {
            map.put(kVar.f25469a, kVar.f25470b);
        }
    }

    public static Map E(R4.h hVar) {
        LinkedHashMap linkedHashMap = new LinkedHashMap();
        B(linkedHashMap, hVar);
        return y(linkedHashMap);
    }

    public static Map F(Iterable iterable) {
        kotlin.jvm.internal.o.h(iterable, "<this>");
        if (!(iterable instanceof Collection)) {
            LinkedHashMap linkedHashMap = new LinkedHashMap();
            C(linkedHashMap, iterable);
            return y(linkedHashMap);
        }
        Collection collection = (Collection) iterable;
        int size = collection.size();
        if (size == 0) {
            return z.f26066a;
        }
        if (size == 1) {
            return v((w4.k) (iterable instanceof List ? ((List) iterable).get(0) : collection.iterator().next()));
        }
        LinkedHashMap linkedHashMap2 = new LinkedHashMap(u(collection.size()));
        C(linkedHashMap2, iterable);
        return linkedHashMap2;
    }

    public static Map G(Map map) {
        kotlin.jvm.internal.o.h(map, "<this>");
        int size = map.size();
        return size != 0 ? size != 1 ? I(map) : J(map) : z.f26066a;
    }

    public static Map H(w4.k[] kVarArr) {
        kotlin.jvm.internal.o.h(kVarArr, "<this>");
        int length = kVarArr.length;
        if (length == 0) {
            return z.f26066a;
        }
        if (length == 1) {
            return v(kVarArr[0]);
        }
        LinkedHashMap linkedHashMap = new LinkedHashMap(u(kVarArr.length));
        D(linkedHashMap, kVarArr);
        return linkedHashMap;
    }

    public static LinkedHashMap I(Map map) {
        kotlin.jvm.internal.o.h(map, "<this>");
        return new LinkedHashMap(map);
    }

    public static final Map J(Map map) {
        kotlin.jvm.internal.o.h(map, "<this>");
        Map.Entry entry = (Map.Entry) map.entrySet().iterator().next();
        Map mapSingletonMap = Collections.singletonMap(entry.getKey(), entry.getValue());
        kotlin.jvm.internal.o.g(mapSingletonMap, "with(...)");
        return mapSingletonMap;
    }

    public static Object t(Object obj, Map map) {
        kotlin.jvm.internal.o.h(map, "<this>");
        if (map instanceof InterfaceC3228E) {
            return ((InterfaceC3228E) map).e();
        }
        Object obj2 = map.get(obj);
        if (obj2 != null || map.containsKey(obj)) {
            return obj2;
        }
        throw new NoSuchElementException("Key " + obj + " is missing in the map.");
    }

    public static int u(int i6) {
        if (i6 < 0) {
            return i6;
        }
        if (i6 < 3) {
            return i6 + 1;
        }
        if (i6 < 1073741824) {
            return (int) ((i6 / 0.75f) + 1.0f);
        }
        return Integer.MAX_VALUE;
    }

    public static Map v(w4.k pair) {
        kotlin.jvm.internal.o.h(pair, "pair");
        Map mapSingletonMap = Collections.singletonMap(pair.f25469a, pair.f25470b);
        kotlin.jvm.internal.o.g(mapSingletonMap, "singletonMap(...)");
        return mapSingletonMap;
    }

    public static Map w(w4.k... kVarArr) {
        if (kVarArr.length <= 0) {
            return z.f26066a;
        }
        LinkedHashMap linkedHashMap = new LinkedHashMap(u(kVarArr.length));
        D(linkedHashMap, kVarArr);
        return linkedHashMap;
    }

    public static LinkedHashMap x(w4.k... kVarArr) {
        LinkedHashMap linkedHashMap = new LinkedHashMap(u(kVarArr.length));
        D(linkedHashMap, kVarArr);
        return linkedHashMap;
    }

    public static final Map y(LinkedHashMap linkedHashMap) {
        int size = linkedHashMap.size();
        return size != 0 ? size != 1 ? linkedHashMap : J(linkedHashMap) : z.f26066a;
    }

    public static LinkedHashMap z(Map map, Map map2) {
        kotlin.jvm.internal.o.h(map, "<this>");
        kotlin.jvm.internal.o.h(map2, "map");
        LinkedHashMap linkedHashMap = new LinkedHashMap(map);
        linkedHashMap.putAll(map2);
        return linkedHashMap;
    }
}