package kotlin.collections; import g.a.a.a.a; import g.h.a.i; import java.lang.reflect.Array; import java.util.Collection; import java.util.Iterator; import java.util.NoSuchElementException; import kotlin.Metadata; import kotlin.jvm.internal.o; /* JADX INFO: renamed from: r.z.g, reason: from Kotlin metadata */ /* JADX INFO: loaded from: classes.dex */ @Metadata(d1 = {"\u0000L\n\u0002\u0018\u0002\n\u0000\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\b\n\u0002\b\u0003\n\u0002\u0010\u001e\n\u0002\b\u0002\n\u0002\u0010\u0011\n\u0002\u0010\u0000\n\u0002\b\u0007\n\u0002\u0010\u000b\n\u0002\b\u0002\n\u0002\u0010\u0002\n\u0002\b\u0011\n\u0002\u0018\u0002\n\u0002\b\u000b\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\b\u001b\b\u0007\u0018\u0000 P*\u0004\b\u0000\u0010\u00012\b\u0012\u0004\u0012\u0002H\u00010\u0002:\u0001PB\u000f\b\u0016\u0012\u0006\u0010\u0003\u001a\u00020\u0004¢\u0006\u0002\u0010\u0005B\u0007\b\u0016¢\u0006\u0002\u0010\u0006B\u0015\b\u0016\u0012\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\b¢\u0006\u0002\u0010\tJ\u0015\u0010\u0013\u001a\u00020\u00142\u0006\u0010\u0015\u001a\u00028\u0000H\u0016¢\u0006\u0002\u0010\u0016J\u001d\u0010\u0013\u001a\u00020\u00172\u0006\u0010\u0018\u001a\u00020\u00042\u0006\u0010\u0015\u001a\u00028\u0000H\u0016¢\u0006\u0002\u0010\u0019J\u001e\u0010\u001a\u001a\u00020\u00142\u0006\u0010\u0018\u001a\u00020\u00042\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\bH\u0016J\u0016\u0010\u001a\u001a\u00020\u00142\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\bH\u0016J\u0013\u0010\u001b\u001a\u00020\u00172\u0006\u0010\u0015\u001a\u00028\u0000¢\u0006\u0002\u0010\u001cJ\u0013\u0010\u001d\u001a\u00020\u00172\u0006\u0010\u0015\u001a\u00028\u0000¢\u0006\u0002\u0010\u001cJ\b\u0010\u001e\u001a\u00020\u0017H\u0016J\u0016\u0010\u001f\u001a\u00020\u00142\u0006\u0010\u0015\u001a\u00028\u0000H\u0096\u0002¢\u0006\u0002\u0010\u0016J\u001e\u0010 \u001a\u00020\u00172\u0006\u0010!\u001a\u00020\u00042\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\bH\u0002J\u0010\u0010\"\u001a\u00020\u00172\u0006\u0010#\u001a\u00020\u0004H\u0002J\u0010\u0010$\u001a\u00020\u00042\u0006\u0010\u0018\u001a\u00020\u0004H\u0002J\u0010\u0010%\u001a\u00020\u00172\u0006\u0010&\u001a\u00020\u0004H\u0002J\u001d\u0010'\u001a\u00020\u00142\u0012\u0010(\u001a\u000e\u0012\u0004\u0012\u00028\u0000\u0012\u0004\u0012\u00020\u00140)H\u0082\bJ\u000b\u0010*\u001a\u00028\u0000¢\u0006\u0002\u0010+J\r\u0010,\u001a\u0004\u0018\u00018\u0000¢\u0006\u0002\u0010+J\u0016\u0010-\u001a\u00028\u00002\u0006\u0010\u0018\u001a\u00020\u0004H\u0096\u0002¢\u0006\u0002\u0010.J\u0010\u0010/\u001a\u00020\u00042\u0006\u0010\u0018\u001a\u00020\u0004H\u0002J\u0015\u00100\u001a\u00020\u00042\u0006\u0010\u0015\u001a\u00028\u0000H\u0016¢\u0006\u0002\u00101J\u0016\u00102\u001a\u00028\u00002\u0006\u0010!\u001a\u00020\u0004H\u0083\b¢\u0006\u0002\u0010.J\u0011\u0010!\u001a\u00020\u00042\u0006\u0010\u0018\u001a\u00020\u0004H\u0083\bJM\u00103\u001a\u00020\u00172>\u00104\u001a:\u0012\u0013\u0012\u00110\u0004¢\u0006\f\b6\u0012\b\b7\u0012\u0004\b\b(\u000e\u0012\u001b\u0012\u0019\u0012\u0006\u0012\u0004\u0018\u00010\f0\u000b¢\u0006\f\b6\u0012\b\b7\u0012\u0004\b\b(\u0007\u0012\u0004\u0012\u00020\u001705H\u0000¢\u0006\u0002\b8J\b\u00109\u001a\u00020\u0014H\u0016J\u000b\u0010:\u001a\u00028\u0000¢\u0006\u0002\u0010+J\u0015\u0010;\u001a\u00020\u00042\u0006\u0010\u0015\u001a\u00028\u0000H\u0016¢\u0006\u0002\u00101J\r\u0010<\u001a\u0004\u0018\u00018\u0000¢\u0006\u0002\u0010+J\u0010\u0010=\u001a\u00020\u00042\u0006\u0010\u0018\u001a\u00020\u0004H\u0002J\u0010\u0010>\u001a\u00020\u00042\u0006\u0010\u0018\u001a\u00020\u0004H\u0002J\u0015\u0010?\u001a\u00020\u00142\u0006\u0010\u0015\u001a\u00028\u0000H\u0016¢\u0006\u0002\u0010\u0016J\u0016\u0010@\u001a\u00020\u00142\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\bH\u0016J\u0015\u0010A\u001a\u00028\u00002\u0006\u0010\u0018\u001a\u00020\u0004H\u0016¢\u0006\u0002\u0010.J\u000b\u0010B\u001a\u00028\u0000¢\u0006\u0002\u0010+J\r\u0010C\u001a\u0004\u0018\u00018\u0000¢\u0006\u0002\u0010+J\u000b\u0010D\u001a\u00028\u0000¢\u0006\u0002\u0010+J\r\u0010E\u001a\u0004\u0018\u00018\u0000¢\u0006\u0002\u0010+J\u0016\u0010F\u001a\u00020\u00142\f\u0010\u0007\u001a\b\u0012\u0004\u0012\u00028\u00000\bH\u0016J\u001e\u0010G\u001a\u00028\u00002\u0006\u0010\u0018\u001a\u00020\u00042\u0006\u0010\u0015\u001a\u00028\u0000H\u0096\u0002¢\u0006\u0002\u0010HJ\u0017\u0010I\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\f0\u000bH\u0000¢\u0006\u0004\bJ\u0010KJ)\u0010I\u001a\b\u0012\u0004\u0012\u0002HL0\u000b\"\u0004\b\u0001\u0010L2\f\u0010M\u001a\b\u0012\u0004\u0012\u0002HL0\u000bH\u0000¢\u0006\u0004\bJ\u0010NJ\u0015\u0010O\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\f0\u000bH\u0016¢\u0006\u0002\u0010KJ'\u0010O\u001a\b\u0012\u0004\u0012\u0002HL0\u000b\"\u0004\b\u0001\u0010L2\f\u0010M\u001a\b\u0012\u0004\u0012\u0002HL0\u000bH\u0016¢\u0006\u0002\u0010NR\u0018\u0010\n\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\f0\u000bX\u0082\u000e¢\u0006\u0004\n\u0002\u0010\rR\u000e\u0010\u000e\u001a\u00020\u0004X\u0082\u000e¢\u0006\u0002\n\u0000R\u001e\u0010\u0010\u001a\u00020\u00042\u0006\u0010\u000f\u001a\u00020\u0004@RX\u0096\u000e¢\u0006\b\n\u0000\u001a\u0004\b\u0011\u0010\u0012¨\u0006Q"}, d2 = {"Lkotlin/collections/ArrayDeque;", "E", "Lkotlin/collections/AbstractMutableList;", "initialCapacity", "", "(I)V", "()V", "elements", "", "(Ljava/util/Collection;)V", "elementData", "", "", "[Ljava/lang/Object;", "head", "", "size", "getSize", "()I", "add", "", "element", "(Ljava/lang/Object;)Z", "", "index", "(ILjava/lang/Object;)V", "addAll", "addFirst", "(Ljava/lang/Object;)V", "addLast", "clear", "contains", "copyCollectionElements", "internalIndex", "copyElements", "newCapacity", "decremented", "ensureCapacity", "minCapacity", "filterInPlace", "predicate", "Lkotlin/Function1;", "first", "()Ljava/lang/Object;", "firstOrNull", "get", "(I)Ljava/lang/Object;", "incremented", "indexOf", "(Ljava/lang/Object;)I", "internalGet", "internalStructure", "structure", "Lkotlin/Function2;", "Lkotlin/ParameterName;", "name", "internalStructure$kotlin_stdlib", "isEmpty", "last", "lastIndexOf", "lastOrNull", "negativeMod", "positiveMod", "remove", "removeAll", "removeAt", "removeFirst", "removeFirstOrNull", "removeLast", "removeLastOrNull", "retainAll", "set", "(ILjava/lang/Object;)Ljava/lang/Object;", "testToArray", "testToArray$kotlin_stdlib", "()[Ljava/lang/Object;", "T", "array", "([Ljava/lang/Object;)[Ljava/lang/Object;", "toArray", "Companion", "kotlin-stdlib"}, k = 1, mv = {1, 7, 1}, xi = 48) public final class ArrayDeque extends AbstractMutableList { /* JADX INFO: renamed from: f, reason: collision with root package name */ public static final Object[] f9298f = new Object[0]; /* JADX INFO: renamed from: m, reason: collision with root package name */ public int f9299m; /* JADX INFO: renamed from: n, reason: collision with root package name */ public Object[] f9300n = f9298f; /* JADX INFO: renamed from: o, reason: collision with root package name */ public int f9301o; @Override // kotlin.collections.AbstractMutableList /* JADX INFO: renamed from: a, reason: from getter */ public int getF9267n() { return this.f9301o; } @Override // java.util.AbstractList, java.util.List public void add(int index, E element) { int f9301o = getF9267n(); if (index < 0 || index > f9301o) { throw new IndexOutOfBoundsException(a.o("index: ", index, ", size: ", f9301o)); } if (index == getF9267n()) { addLast(element); return; } if (index == 0) { f(getF9267n() + 1); int iE = e(this.f9299m); this.f9299m = iE; this.f9300n[iE] = element; this.f9301o = getF9267n() + 1; return; } f(getF9267n() + 1); int iK = k(this.f9299m + index); if (index < ((getF9267n() + 1) >> 1)) { int iE2 = e(iK); int iE3 = e(this.f9299m); int i2 = this.f9299m; if (iE2 >= i2) { Object[] objArr = this.f9300n; objArr[iE3] = objArr[i2]; j.h(objArr, objArr, i2, i2 + 1, iE2 + 1); } else { Object[] objArr2 = this.f9300n; j.h(objArr2, objArr2, i2 - 1, i2, objArr2.length); Object[] objArr3 = this.f9300n; objArr3[objArr3.length - 1] = objArr3[0]; j.h(objArr3, objArr3, 0, 1, iE2 + 1); } this.f9300n[iE2] = element; this.f9299m = iE3; } else { int iK2 = k(getF9267n() + this.f9299m); Object[] objArr4 = this.f9300n; if (iK < iK2) { j.h(objArr4, objArr4, iK + 1, iK, iK2); } else { j.h(objArr4, objArr4, 1, 0, iK2); Object[] objArr5 = this.f9300n; objArr5[0] = objArr5[objArr5.length - 1]; j.h(objArr5, objArr5, iK + 1, iK, objArr5.length - 1); } this.f9300n[iK] = element; } this.f9301o = getF9267n() + 1; } @Override // java.util.AbstractList, java.util.AbstractCollection, java.util.Collection, java.util.List public boolean add(E element) { addLast(element); return true; } @Override // java.util.AbstractList, java.util.List public boolean addAll(int index, Collection elements) { o.f(elements, "elements"); int f9301o = getF9267n(); if (index < 0 || index > f9301o) { throw new IndexOutOfBoundsException(a.o("index: ", index, ", size: ", f9301o)); } if (elements.isEmpty()) { return false; } if (index == getF9267n()) { return addAll(elements); } f(elements.size() + getF9267n()); int iK = k(getF9267n() + this.f9299m); int iK2 = k(this.f9299m + index); int size = elements.size(); if (index < ((getF9267n() + 1) >> 1)) { int i2 = this.f9299m; int length = i2 - size; if (iK2 < i2) { Object[] objArr = this.f9300n; j.h(objArr, objArr, length, i2, objArr.length); Object[] objArr2 = this.f9300n; int length2 = objArr2.length - size; if (size >= iK2) { j.h(objArr2, objArr2, length2, 0, iK2); } else { j.h(objArr2, objArr2, length2, 0, size); Object[] objArr3 = this.f9300n; j.h(objArr3, objArr3, 0, size, iK2); } } else if (length >= 0) { Object[] objArr4 = this.f9300n; j.h(objArr4, objArr4, length, i2, iK2); } else { Object[] objArr5 = this.f9300n; length += objArr5.length; int i3 = iK2 - i2; int length3 = objArr5.length - length; if (length3 >= i3) { j.h(objArr5, objArr5, length, i2, iK2); } else { j.h(objArr5, objArr5, length, i2, i2 + length3); Object[] objArr6 = this.f9300n; j.h(objArr6, objArr6, 0, this.f9299m + length3, iK2); } } this.f9299m = length; d(i(iK2 - size), elements); } else { int length4 = iK2 + size; if (iK2 < iK) { int i4 = size + iK; Object[] objArr7 = this.f9300n; if (i4 <= objArr7.length) { j.h(objArr7, objArr7, length4, iK2, iK); } else if (length4 >= objArr7.length) { length4 -= objArr7.length; j.h(objArr7, objArr7, length4, iK2, iK); } else { int length5 = iK - (i4 - objArr7.length); j.h(objArr7, objArr7, 0, length5, iK); Object[] objArr8 = this.f9300n; j.h(objArr8, objArr8, length4, iK2, length5); } } else { Object[] objArr9 = this.f9300n; j.h(objArr9, objArr9, size, 0, iK); Object[] objArr10 = this.f9300n; if (length4 >= objArr10.length) { j.h(objArr10, objArr10, length4 - objArr10.length, iK2, objArr10.length); } else { j.h(objArr10, objArr10, 0, objArr10.length - size, objArr10.length); Object[] objArr11 = this.f9300n; j.h(objArr11, objArr11, length4, iK2, objArr11.length - size); } } d(iK2, elements); } return true; } public final void addLast(E element) { f(getF9267n() + 1); this.f9300n[k(this.f9299m + getF9267n())] = element; this.f9301o = getF9267n() + 1; } @Override // kotlin.collections.AbstractMutableList public E c(int i2) { int f9301o = getF9267n(); if (i2 < 0 || i2 >= f9301o) { throw new IndexOutOfBoundsException(a.o("index: ", i2, ", size: ", f9301o)); } if (i2 == j.x(this)) { return removeLast(); } if (i2 == 0) { if (isEmpty()) { throw new NoSuchElementException("ArrayDeque is empty."); } Object[] objArr = this.f9300n; int i3 = this.f9299m; E e2 = (E) objArr[i3]; objArr[i3] = null; this.f9299m = h(i3); this.f9301o = getF9267n() - 1; return e2; } int iK = k(this.f9299m + i2); E e3 = (E) this.f9300n[iK]; if (i2 < (getF9267n() >> 1)) { int i4 = this.f9299m; if (iK >= i4) { Object[] objArr2 = this.f9300n; j.h(objArr2, objArr2, i4 + 1, i4, iK); } else { Object[] objArr3 = this.f9300n; j.h(objArr3, objArr3, 1, 0, iK); Object[] objArr4 = this.f9300n; objArr4[0] = objArr4[objArr4.length - 1]; int i5 = this.f9299m; j.h(objArr4, objArr4, i5 + 1, i5, objArr4.length - 1); } Object[] objArr5 = this.f9300n; int i6 = this.f9299m; objArr5[i6] = null; this.f9299m = h(i6); } else { int iK2 = k(j.x(this) + this.f9299m); Object[] objArr6 = this.f9300n; if (iK <= iK2) { j.h(objArr6, objArr6, iK, iK + 1, iK2 + 1); } else { j.h(objArr6, objArr6, iK, iK + 1, objArr6.length); Object[] objArr7 = this.f9300n; objArr7[objArr7.length - 1] = objArr7[0]; j.h(objArr7, objArr7, 0, 1, iK2 + 1); } this.f9300n[iK2] = null; } this.f9301o = getF9267n() - 1; return e3; } @Override // java.util.AbstractList, java.util.AbstractCollection, java.util.Collection, java.util.List public void clear() { int iK = k(this.f9299m + getF9267n()); int i2 = this.f9299m; if (i2 < iK) { j.p(this.f9300n, null, i2, iK); } else if (!isEmpty()) { Object[] objArr = this.f9300n; j.p(objArr, null, this.f9299m, objArr.length); j.p(this.f9300n, null, 0, iK); } this.f9299m = 0; this.f9301o = 0; } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean contains(Object element) { return indexOf(element) != -1; } public final void d(int i2, Collection collection) { Iterator it = collection.iterator(); int length = this.f9300n.length; while (i2 < length && it.hasNext()) { this.f9300n[i2] = it.next(); i2++; } int i3 = this.f9299m; for (int i4 = 0; i4 < i3 && it.hasNext(); i4++) { this.f9300n[i4] = it.next(); } this.f9301o = collection.size() + this.f9301o; } public final int e(int i2) { return i2 == 0 ? i.u1(this.f9300n) : i2 - 1; } public final void f(int i2) { if (i2 < 0) { throw new IllegalStateException("Deque is too big."); } Object[] objArr = this.f9300n; if (i2 <= objArr.length) { return; } if (objArr == f9298f) { if (i2 < 10) { i2 = 10; } this.f9300n = new Object[i2]; return; } int length = objArr.length; int i3 = length + (length >> 1); if (i3 - i2 < 0) { i3 = i2; } if (i3 - 2147483639 > 0) { i3 = i2 > 2147483639 ? Integer.MAX_VALUE : 2147483639; } Object[] objArr2 = new Object[i3]; Object[] objArr3 = this.f9300n; j.h(objArr3, objArr2, 0, this.f9299m, objArr3.length); Object[] objArr4 = this.f9300n; int length2 = objArr4.length; int i4 = this.f9299m; j.h(objArr4, objArr2, length2 - i4, 0, i4); this.f9299m = 0; this.f9300n = objArr2; } @Override // java.util.AbstractList, java.util.List public E get(int index) { int f9301o = getF9267n(); if (index < 0 || index >= f9301o) { throw new IndexOutOfBoundsException(a.o("index: ", index, ", size: ", f9301o)); } return (E) this.f9300n[k(this.f9299m + index)]; } public final int h(int i2) { if (i2 == i.u1(this.f9300n)) { return 0; } return i2 + 1; } public final int i(int i2) { return i2 < 0 ? i2 + this.f9300n.length : i2; } @Override // java.util.AbstractList, java.util.List public int indexOf(Object element) { int iK = k(this.f9299m + getF9267n()); int length = this.f9299m; if (length < iK) { while (length < iK) { if (!o.a(element, this.f9300n[length])) { length++; } } return -1; } if (length < iK) { return -1; } int length2 = this.f9300n.length; while (true) { if (length >= length2) { for (int i2 = 0; i2 < iK; i2++) { if (o.a(element, this.f9300n[i2])) { length = i2 + this.f9300n.length; } } return -1; } if (o.a(element, this.f9300n[length])) { break; } length++; } return length - this.f9299m; } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean isEmpty() { return getF9267n() == 0; } public final int k(int i2) { Object[] objArr = this.f9300n; return i2 >= objArr.length ? i2 - objArr.length : i2; } @Override // java.util.AbstractList, java.util.List public int lastIndexOf(Object element) { int iU1; int iK = k(this.f9299m + getF9267n()); int i2 = this.f9299m; if (i2 < iK) { iU1 = iK - 1; if (i2 <= iU1) { while (!o.a(element, this.f9300n[iU1])) { if (iU1 != i2) { iU1--; } } return iU1 - this.f9299m; } return -1; } if (i2 > iK) { int i3 = iK - 1; while (true) { if (-1 >= i3) { iU1 = i.u1(this.f9300n); int i4 = this.f9299m; if (i4 <= iU1) { while (!o.a(element, this.f9300n[iU1])) { if (iU1 != i4) { iU1--; } } } } else { if (o.a(element, this.f9300n[i3])) { iU1 = i3 + this.f9300n.length; break; } i3--; } } } return -1; } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean remove(Object element) { int iIndexOf = indexOf(element); if (iIndexOf == -1) { return false; } c(iIndexOf); return true; } /* JADX WARN: Multi-variable type inference failed */ @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean removeAll(Collection elements) { int iK; o.f(elements, "elements"); boolean z2 = false; z2 = false; z2 = false; if (!isEmpty()) { if ((this.f9300n.length == 0) == false) { int iK2 = k(this.f9299m + getF9267n()); int i2 = this.f9299m; if (i2 < iK2) { iK = i2; while (i2 < iK2) { Object obj = this.f9300n[i2]; if (!elements.contains(obj)) { this.f9300n[iK] = obj; iK++; } else { z2 = true; } i2++; } j.p(this.f9300n, null, iK, iK2); } else { int length = this.f9300n.length; boolean z3 = false; int i3 = i2; while (i2 < length) { Object[] objArr = this.f9300n; Object obj2 = objArr[i2]; objArr[i2] = null; if (!elements.contains(obj2)) { this.f9300n[i3] = obj2; i3++; } else { z3 = true; } i2++; } iK = k(i3); for (int i4 = 0; i4 < iK2; i4++) { Object[] objArr2 = this.f9300n; Object obj3 = objArr2[i4]; objArr2[i4] = null; if (!elements.contains(obj3)) { this.f9300n[iK] = obj3; iK = h(iK); } else { z3 = true; } } z2 = z3; } if (z2) { this.f9301o = i(iK - this.f9299m); } } } return z2; } public final E removeLast() { if (isEmpty()) { throw new NoSuchElementException("ArrayDeque is empty."); } int iK = k(j.x(this) + this.f9299m); Object[] objArr = this.f9300n; E e2 = (E) objArr[iK]; objArr[iK] = null; this.f9301o = getF9267n() - 1; return e2; } /* JADX WARN: Multi-variable type inference failed */ @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean retainAll(Collection elements) { int iK; o.f(elements, "elements"); boolean z2 = false; z2 = false; z2 = false; if (!isEmpty()) { if ((this.f9300n.length == 0) == false) { int iK2 = k(this.f9299m + getF9267n()); int i2 = this.f9299m; if (i2 < iK2) { iK = i2; while (i2 < iK2) { Object obj = this.f9300n[i2]; if (elements.contains(obj)) { this.f9300n[iK] = obj; iK++; } else { z2 = true; } i2++; } j.p(this.f9300n, null, iK, iK2); } else { int length = this.f9300n.length; boolean z3 = false; int i3 = i2; while (i2 < length) { Object[] objArr = this.f9300n; Object obj2 = objArr[i2]; objArr[i2] = null; if (elements.contains(obj2)) { this.f9300n[i3] = obj2; i3++; } else { z3 = true; } i2++; } iK = k(i3); for (int i4 = 0; i4 < iK2; i4++) { Object[] objArr2 = this.f9300n; Object obj3 = objArr2[i4]; objArr2[i4] = null; if (elements.contains(obj3)) { this.f9300n[iK] = obj3; iK = h(iK); } else { z3 = true; } } z2 = z3; } if (z2) { this.f9301o = i(iK - this.f9299m); } } } return z2; } @Override // java.util.AbstractList, java.util.List public E set(int index, E element) { int f9301o = getF9267n(); if (index < 0 || index >= f9301o) { throw new IndexOutOfBoundsException(a.o("index: ", index, ", size: ", f9301o)); } int iK = k(this.f9299m + index); Object[] objArr = this.f9300n; E e2 = (E) objArr[iK]; objArr[iK] = element; return e2; } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public Object[] toArray() { return toArray(new Object[getF9267n()]); } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public T[] toArray(T[] array) { o.f(array, "array"); if (array.length < getF9267n()) { int f9301o = getF9267n(); o.f(array, "reference"); Object objNewInstance = Array.newInstance(array.getClass().getComponentType(), f9301o); o.d(objNewInstance, "null cannot be cast to non-null type kotlin.Array"); array = (T[]) ((Object[]) objNewInstance); } o.d(array, "null cannot be cast to non-null type kotlin.Array"); int iK = k(this.f9299m + getF9267n()); int i2 = this.f9299m; if (i2 < iK) { j.j(this.f9300n, array, 0, i2, iK, 2); } else if (!isEmpty()) { Object[] objArr = this.f9300n; j.h(objArr, array, 0, this.f9299m, objArr.length); Object[] objArr2 = this.f9300n; j.h(objArr2, array, objArr2.length - this.f9299m, 0, iK); } if (array.length > getF9267n()) { array[getF9267n()] = null; } return array; } @Override // java.util.AbstractCollection, java.util.Collection, java.util.List public boolean addAll(Collection elements) { o.f(elements, "elements"); if (elements.isEmpty()) { return false; } f(elements.size() + getF9267n()); d(k(this.f9299m + getF9267n()), elements); return true; } }