package C3;

import d5.AbstractC0844a;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.RandomAccess;
import v0.AbstractC1664c;

/* JADX INFO: loaded from: classes.dex */
public abstract class G extends B implements List, RandomAccess {

    /* JADX INFO: renamed from: r, reason: collision with root package name */
    public static final E f1197r = new E(W.f1225u, 0);

    public static W i(int i, Object[] objArr) {
        return i == 0 ? W.f1225u : new W(i, objArr);
    }

    public static D j() {
        return new D(4);
    }

    public static G k(Collection collection) {
        if (!(collection instanceof B)) {
            Object[] array = collection.toArray();
            AbstractC0055q.a(array.length, array);
            return i(array.length, array);
        }
        G gA = ((B) collection).a();
        if (!gA.h()) {
            return gA;
        }
        Object[] array2 = gA.toArray(B.f1188q);
        return i(array2.length, array2);
    }

    public static W l(Object[] objArr) {
        if (objArr.length == 0) {
            return W.f1225u;
        }
        Object[] objArr2 = (Object[]) objArr.clone();
        AbstractC0055q.a(objArr2.length, objArr2);
        return i(objArr2.length, objArr2);
    }

    public static W o(Long l8, Long l9, Long l10, Long l11, Long l12) {
        Object[] objArr = {l8, l9, l10, l11, l12};
        AbstractC0055q.a(5, objArr);
        return i(5, objArr);
    }

    public static W p(Object obj) {
        Object[] objArr = {obj};
        AbstractC0055q.a(1, objArr);
        return i(1, objArr);
    }

    public static W s(Object obj, Object obj2) {
        Object[] objArr = {obj, obj2};
        AbstractC0055q.a(2, objArr);
        return i(2, objArr);
    }

    public static W t(String str, String str2, String str3, String str4, String str5, String str6, String str7, String str8, String str9, String str10, String str11, String str12, Object... objArr) {
        AbstractC1664c.e("the total number of elements must fit in an int", objArr.length <= 2147483635);
        int length = objArr.length + 12;
        Object[] objArr2 = new Object[length];
        objArr2[0] = str;
        objArr2[1] = str2;
        objArr2[2] = str3;
        objArr2[3] = str4;
        objArr2[4] = str5;
        objArr2[5] = str6;
        objArr2[6] = str7;
        objArr2[7] = str8;
        objArr2[8] = str9;
        objArr2[9] = str10;
        objArr2[10] = str11;
        objArr2[11] = str12;
        System.arraycopy(objArr, 0, objArr2, 12, objArr.length);
        AbstractC0055q.a(length, objArr2);
        return i(length, objArr2);
    }

    public static W u(V v7, List list) {
        v7.getClass();
        if (!AbstractC0844a.w(list)) {
            Iterator it = list.iterator();
            ArrayList arrayList = new ArrayList();
            it.getClass();
            while (it.hasNext()) {
                arrayList.add(it.next());
            }
            list = arrayList;
        }
        Object[] array = list.toArray();
        AbstractC0055q.a(array.length, array);
        Arrays.sort(array, v7);
        return i(array.length, array);
    }

    @Override // java.util.List
    public final void add(int i, Object obj) {
        throw new UnsupportedOperationException();
    }

    @Override // java.util.List
    public final boolean addAll(int i, Collection collection) {
        throw new UnsupportedOperationException();
    }

    @Override // C3.B
    public int b(int i, Object[] objArr) {
        int size = size();
        for (int i5 = 0; i5 < size; i5++) {
            objArr[i + i5] = get(i5);
        }
        return i + size;
    }

    @Override // C3.B, java.util.AbstractCollection, java.util.Collection
    public final boolean contains(Object obj) {
        return indexOf(obj) >= 0;
    }

    @Override // java.util.Collection, java.util.List
    public final boolean equals(Object obj) {
        if (obj != this) {
            if (obj instanceof List) {
                List list = (List) obj;
                int size = size();
                if (size == list.size()) {
                    if (!(list instanceof RandomAccess)) {
                        Iterator it = iterator();
                        Iterator it2 = list.iterator();
                        while (it.hasNext()) {
                            if (it2.hasNext() && s7.l.h(it.next(), it2.next())) {
                            }
                        }
                        return !it2.hasNext();
                    }
                    for (int i = 0; i < size; i++) {
                        if (s7.l.h(get(i), list.get(i))) {
                        }
                    }
                }
            }
            return false;
        }
        return true;
    }

    @Override // java.util.Collection, java.util.List
    public final int hashCode() {
        int size = size();
        int i = 1;
        for (int i5 = 0; i5 < size; i5++) {
            i = ~(~(get(i5).hashCode() + (i * 31)));
        }
        return i;
    }

    @Override // java.util.List
    public final int indexOf(Object obj) {
        if (obj == null) {
            return -1;
        }
        int size = size();
        for (int i = 0; i < size; i++) {
            if (obj.equals(get(i))) {
                return i;
            }
        }
        return -1;
    }

    @Override // java.util.AbstractCollection, java.util.Collection, java.lang.Iterable, java.util.List
    public Iterator iterator() {
        return listIterator(0);
    }

    @Override // java.util.List
    public final int lastIndexOf(Object obj) {
        if (obj == null) {
            return -1;
        }
        for (int size = size() - 1; size >= 0; size--) {
            if (obj.equals(get(size))) {
                return size;
            }
        }
        return -1;
    }

    @Override // java.util.List
    /* JADX INFO: renamed from: n, reason: merged with bridge method [inline-methods] */
    public final E listIterator(int i) {
        AbstractC1664c.h(i, size());
        return isEmpty() ? f1197r : new E(this, i);
    }

    @Override // java.util.List
    public final Object remove(int i) {
        throw new UnsupportedOperationException();
    }

    @Override // java.util.List
    public final Object set(int i, Object obj) {
        throw new UnsupportedOperationException();
    }

    @Override // java.util.List
    /* JADX INFO: renamed from: v, reason: merged with bridge method [inline-methods] */
    public G subList(int i, int i5) {
        AbstractC1664c.i(i, i5, size());
        int i8 = i5 - i;
        return i8 == size() ? this : i8 == 0 ? W.f1225u : new F(this, i, i8);
    }

    public ListIterator listIterator() {
        return listIterator(0);
    }

    @Override // C3.B
    public final G a() {
        return this;
    }
}