package C3;

import d5.AbstractC0844a;
import java.util.AbstractList;
import java.util.Arrays;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import java.util.SortedSet;
import v0.AbstractC1664c;

/* JADX INFO: renamed from: C3.q, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes.dex */
public abstract class AbstractC0055q {
    public static void a(int i, Object[] objArr) {
        for (int i5 = 0; i5 < i; i5++) {
            if (objArr[i5] == null) {
                throw new NullPointerException(AbstractC0844a.j("at index ", i5));
            }
        }
    }

    public static void b(Object obj, Object obj2) {
        if (obj == null) {
            throw new NullPointerException(I1.a.n(obj2, "null key in entry: null="));
        }
        if (obj2 != null) {
            return;
        }
        throw new NullPointerException("null value in entry: " + obj + "=null");
    }

    public static void c(int i, String str) {
        if (i >= 0) {
            return;
        }
        throw new IllegalArgumentException(str + " cannot be negative but was: " + i);
    }

    public static Object d(int i) {
        if (i < 2 || i > 1073741824 || Integer.highestOneBit(i) != i) {
            throw new IllegalArgumentException(AbstractC0844a.j("must be power of 2 between 2^1 and 2^30: ", i));
        }
        return i <= 256 ? new byte[i] : i <= 65536 ? new short[i] : new int[i];
    }

    public static boolean e(Map map, Object obj) {
        if (map == obj) {
            return true;
        }
        if (obj instanceof Map) {
            return map.entrySet().equals(((Map) obj).entrySet());
        }
        return false;
    }

    public static boolean f(Set set, Object obj) {
        if (set == obj) {
            return true;
        }
        if (!(obj instanceof Set)) {
            return false;
        }
        Set set2 = (Set) obj;
        try {
            if (set.size() == set2.size()) {
                return set.containsAll(set2);
            }
            return false;
        } catch (ClassCastException | NullPointerException unused) {
            return false;
        }
    }

    public static f0 g(Set set, B3.h hVar) {
        if (!(set instanceof SortedSet)) {
            if (!(set instanceof f0)) {
                set.getClass();
                return new f0(set, hVar);
            }
            f0 f0Var = (f0) set;
            B3.h hVar2 = f0Var.f1272r;
            hVar2.getClass();
            return new f0(f0Var.f1271q, new B3.i(Arrays.asList(hVar2, hVar)));
        }
        Set set2 = (SortedSet) set;
        if (!(set2 instanceof f0)) {
            set2.getClass();
            return new g0(set2, hVar);
        }
        f0 f0Var2 = (f0) set2;
        B3.h hVar3 = f0Var2.f1272r;
        hVar3.getClass();
        return new g0((SortedSet) f0Var2.f1271q, new B3.i(Arrays.asList(hVar3, hVar)));
    }

    public static Object h(Iterable iterable) {
        Object next;
        if (iterable instanceof List) {
            List list = (List) iterable;
            if (list.isEmpty()) {
                throw new NoSuchElementException();
            }
            return list.get(list.size() - 1);
        }
        Iterator it = iterable.iterator();
        do {
            next = it.next();
        } while (it.hasNext());
        return next;
    }

    public static int i(Set set) {
        Iterator it = set.iterator();
        int i = 0;
        while (it.hasNext()) {
            Object next = it.next();
            i = ~(~(i + (next != null ? next.hashCode() : 0)));
        }
        return i;
    }

    public static e0 j(J j8, J j9) {
        AbstractC1664c.g(j8, "set1");
        AbstractC1664c.g(j9, "set2");
        return new e0(j8, j9);
    }

    public static int k(int i, int i5, int i8) {
        return (i & (~i8)) | (i5 & i8);
    }

    public static int l(Object obj, Object obj2, int i, Object obj3, int[] iArr, Object[] objArr, Object[] objArr2) {
        int i5;
        int i8;
        int iO = o(obj);
        int i9 = iO & i;
        int iP = p(i9, obj3);
        if (iP != 0) {
            int i10 = ~i;
            int i11 = iO & i10;
            int i12 = -1;
            while (true) {
                i5 = iP - 1;
                i8 = iArr[i5];
                if ((i8 & i10) == i11 && s7.l.h(obj, objArr[i5]) && (objArr2 == null || s7.l.h(obj2, objArr2[i5]))) {
                    break;
                }
                int i13 = i8 & i;
                if (i13 == 0) {
                    break;
                }
                i12 = i5;
                iP = i13;
            }
            int i14 = i8 & i;
            if (i12 == -1) {
                q(i9, i14, obj3);
                return i5;
            }
            iArr[i12] = k(iArr[i12], i14, i);
            return i5;
        }
        return -1;
    }

    public static void m(List list, B3.h hVar, int i, int i5) {
        for (int size = list.size() - 1; size > i5; size--) {
            if (hVar.apply(list.get(size))) {
                list.remove(size);
            }
        }
        for (int i8 = i5 - 1; i8 >= i; i8--) {
            list.remove(i8);
        }
    }

    public static int n(int i) {
        return (int) (((long) Integer.rotateLeft((int) (((long) i) * (-862048943)), 15)) * 461845907);
    }

    public static int o(Object obj) {
        return n(obj == null ? 0 : obj.hashCode());
    }

    public static int p(int i, Object obj) {
        return obj instanceof byte[] ? ((byte[]) obj)[i] & 255 : obj instanceof short[] ? ((short[]) obj)[i] & 65535 : ((int[]) obj)[i];
    }

    public static void q(int i, int i5, Object obj) {
        if (obj instanceof byte[]) {
            ((byte[]) obj)[i] = (byte) i5;
        } else if (obj instanceof short[]) {
            ((short[]) obj)[i] = (short) i5;
        } else {
            ((int[]) obj)[i] = i5;
        }
    }

    public static AbstractList r(List list, B3.e eVar) {
        return AbstractC0844a.w(list) ? new O(list, eVar) : new P(list, eVar);
    }
}