package d.j0;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;

/* JADX INFO: Access modifiers changed from: package-private */
/* JADX INFO: compiled from: _Arrays.kt */
/* JADX INFO: loaded from: classes.dex */
@d.n
public class j extends i {

    /* JADX INFO: Add missing generic type declarations: [T] */
    /* JADX INFO: compiled from: _Arrays.kt */
    @d.n
    static final class a<T> extends d.n0.c.t implements d.n0.b.a<Iterator<? extends T>> {

        /* JADX INFO: renamed from: d, reason: collision with root package name */
        final /* synthetic */ T[] f2596d;

        /* JADX WARN: 'super' call moved to the top of the method (can break code semantics) */
        a(T[] tArr) {
            super(0);
            this.f2596d = tArr;
        }

        @Override // d.n0.b.a
        /* JADX INFO: renamed from: c, reason: merged with bridge method [inline-methods] */
        public final Iterator<T> a() {
            return d.n0.c.c.a(this.f2596d);
        }
    }

    /* JADX INFO: compiled from: _Arrays.kt */
    @d.n
    static final class b extends d.n0.c.t implements d.n0.b.a<Iterator<? extends Byte>> {

        /* JADX INFO: renamed from: d, reason: collision with root package name */
        final /* synthetic */ byte[] f2597d;

        /* JADX WARN: 'super' call moved to the top of the method (can break code semantics) */
        b(byte[] bArr) {
            super(0);
            this.f2597d = bArr;
        }

        @Override // d.n0.b.a
        /* JADX INFO: renamed from: c, reason: merged with bridge method [inline-methods] */
        public final Iterator<Byte> a() {
            return d.n0.c.d.a(this.f2597d);
        }
    }

    public static boolean f(byte[] bArr, byte b2) {
        d.n0.c.s.e(bArr, "<this>");
        return n(bArr, b2) >= 0;
    }

    public static boolean g(int[] iArr, int i) {
        d.n0.c.s.e(iArr, "<this>");
        return o(iArr, i) >= 0;
    }

    public static boolean h(long[] jArr, long j) {
        d.n0.c.s.e(jArr, "<this>");
        return p(jArr, j) >= 0;
    }

    public static final <T> boolean i(T[] tArr, T t) {
        d.n0.c.s.e(tArr, "<this>");
        return q(tArr, t) >= 0;
    }

    public static boolean j(short[] sArr, short s) {
        d.n0.c.s.e(sArr, "<this>");
        return r(sArr, s) >= 0;
    }

    public static <T> T k(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        if (tArr.length == 0) {
            throw new NoSuchElementException("Array is empty.");
        }
        return tArr[0];
    }

    public static int l(long[] jArr) {
        d.n0.c.s.e(jArr, "<this>");
        return jArr.length - 1;
    }

    public static final <T> int m(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        return tArr.length - 1;
    }

    public static final int n(byte[] bArr, byte b2) {
        d.n0.c.s.e(bArr, "<this>");
        int length = bArr.length;
        for (int i = 0; i < length; i++) {
            if (b2 == bArr[i]) {
                return i;
            }
        }
        return -1;
    }

    public static final int o(int[] iArr, int i) {
        d.n0.c.s.e(iArr, "<this>");
        int length = iArr.length;
        for (int i2 = 0; i2 < length; i2++) {
            if (i == iArr[i2]) {
                return i2;
            }
        }
        return -1;
    }

    public static final int p(long[] jArr, long j) {
        d.n0.c.s.e(jArr, "<this>");
        int length = jArr.length;
        for (int i = 0; i < length; i++) {
            if (j == jArr[i]) {
                return i;
            }
        }
        return -1;
    }

    public static <T> int q(T[] tArr, T t) {
        d.n0.c.s.e(tArr, "<this>");
        int i = 0;
        if (t == null) {
            int length = tArr.length;
            while (i < length) {
                if (tArr[i] == null) {
                    return i;
                }
                i++;
            }
            return -1;
        }
        int length2 = tArr.length;
        while (i < length2) {
            if (d.n0.c.s.a(t, tArr[i])) {
                return i;
            }
            i++;
        }
        return -1;
    }

    public static final int r(short[] sArr, short s) {
        d.n0.c.s.e(sArr, "<this>");
        int length = sArr.length;
        for (int i = 0; i < length; i++) {
            if (s == sArr[i]) {
                return i;
            }
        }
        return -1;
    }

    public static char s(char[] cArr) {
        d.n0.c.s.e(cArr, "<this>");
        int length = cArr.length;
        if (length == 0) {
            throw new NoSuchElementException("Array is empty.");
        }
        if (length == 1) {
            return cArr[0];
        }
        throw new IllegalArgumentException("Array has more than one element.");
    }

    public static <T> T t(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        if (tArr.length == 1) {
            return tArr[0];
        }
        return null;
    }

    public static final <T, C extends Collection<? super T>> C u(T[] tArr, C c2) {
        d.n0.c.s.e(tArr, "<this>");
        d.n0.c.s.e(c2, "destination");
        for (T t : tArr) {
            c2.add(t);
        }
        return c2;
    }

    public static <T> List<T> v(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        int length = tArr.length;
        return length != 0 ? length != 1 ? w(tArr) : o.b(tArr[0]) : p.d();
    }

    public static final <T> List<T> w(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        return new ArrayList(p.c(tArr));
    }

    public static final <T> Set<T> x(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        int length = tArr.length;
        return length != 0 ? length != 1 ? (Set) u(tArr, new LinkedHashSet(k0.b(tArr.length))) : p0.a(tArr[0]) : q0.b();
    }

    public static Iterable<c0<Byte>> y(byte[] bArr) {
        d.n0.c.s.e(bArr, "<this>");
        return new d0(new b(bArr));
    }

    public static <T> Iterable<c0<T>> z(T[] tArr) {
        d.n0.c.s.e(tArr, "<this>");
        return new d0(new a(tArr));
    }
}