package R4;

import D.C0135f;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import n2.AbstractC2612c;
import x4.y;

/* JADX INFO: loaded from: classes3.dex */
public abstract class n extends o {
    public static k X(Iterator it) {
        kotlin.jvm.internal.o.h(it, "<this>");
        return new a(new H4.f(it, 3));
    }

    public static int Y(k kVar) {
        kotlin.jvm.internal.o.h(kVar, "<this>");
        Iterator it = kVar.iterator();
        int i6 = 0;
        while (it.hasNext()) {
            it.next();
            i6++;
            if (i6 < 0) {
                throw new ArithmeticException("Count overflow has happened.");
            }
        }
        return i6;
    }

    public static k Z(k kVar, int i6) {
        if (i6 >= 0) {
            return i6 == 0 ? kVar : kVar instanceof d ? ((d) kVar).b(i6) : new c(kVar, i6, 0);
        }
        throw new IllegalArgumentException(Z0.o.j(i6, "Requested element count ", " is less than zero.").toString());
    }

    public static k a0(J4.c cVar, Object obj) {
        if (obj == null) {
            return e.f6091a;
        }
        return new j(0, new C0135f(obj, 12), cVar);
    }

    public static h b0(k kVar, J4.c transform) {
        kotlin.jvm.internal.o.h(kVar, "<this>");
        kotlin.jvm.internal.o.h(transform, "transform");
        return new h(kVar, transform, 1);
    }

    public static k c0(k kVar, int i6) {
        if (i6 >= 0) {
            return i6 == 0 ? e.f6091a : kVar instanceof d ? ((d) kVar).a(i6) : new c(kVar, i6, 1);
        }
        throw new IllegalArgumentException(Z0.o.j(i6, "Requested element count ", " is less than zero.").toString());
    }

    public static List d0(k kVar) {
        kotlin.jvm.internal.o.h(kVar, "<this>");
        Iterator it = kVar.iterator();
        if (!it.hasNext()) {
            return y.f26065a;
        }
        Object next = it.next();
        if (!it.hasNext()) {
            return AbstractC2612c.q(next);
        }
        ArrayList arrayList = new ArrayList();
        arrayList.add(next);
        while (it.hasNext()) {
            arrayList.add(it.next());
        }
        return arrayList;
    }
}