142 lines
3.7 KiB
Java
142 lines
3.7 KiB
Java
package androidx.collection;
|
|
|
|
/* loaded from: classes.dex */
|
|
public final class CircularIntArray {
|
|
private int mCapacityBitmask;
|
|
private int[] mElements;
|
|
private int mHead;
|
|
private int mTail;
|
|
|
|
public void clear() {
|
|
this.mTail = this.mHead;
|
|
}
|
|
|
|
public boolean isEmpty() {
|
|
return this.mHead == this.mTail;
|
|
}
|
|
|
|
public int size() {
|
|
return (this.mTail - this.mHead) & this.mCapacityBitmask;
|
|
}
|
|
|
|
private void doubleCapacity() {
|
|
int[] iArr = this.mElements;
|
|
int length = iArr.length;
|
|
int i = this.mHead;
|
|
int i2 = length - i;
|
|
int i3 = length << 1;
|
|
if (i3 < 0) {
|
|
throw new RuntimeException("Max array capacity exceeded");
|
|
}
|
|
int[] iArr2 = new int[i3];
|
|
System.arraycopy(iArr, i, iArr2, 0, i2);
|
|
System.arraycopy(this.mElements, 0, iArr2, i2, this.mHead);
|
|
this.mElements = iArr2;
|
|
this.mHead = 0;
|
|
this.mTail = length;
|
|
this.mCapacityBitmask = i3 - 1;
|
|
}
|
|
|
|
public CircularIntArray() {
|
|
this(8);
|
|
}
|
|
|
|
public CircularIntArray(int i) {
|
|
if (i < 1) {
|
|
throw new IllegalArgumentException("capacity must be >= 1");
|
|
}
|
|
if (i > 1073741824) {
|
|
throw new IllegalArgumentException("capacity must be <= 2^30");
|
|
}
|
|
i = Integer.bitCount(i) != 1 ? Integer.highestOneBit(i - 1) << 1 : i;
|
|
this.mCapacityBitmask = i - 1;
|
|
this.mElements = new int[i];
|
|
}
|
|
|
|
public void addFirst(int i) {
|
|
int i2 = (this.mHead - 1) & this.mCapacityBitmask;
|
|
this.mHead = i2;
|
|
this.mElements[i2] = i;
|
|
if (i2 == this.mTail) {
|
|
doubleCapacity();
|
|
}
|
|
}
|
|
|
|
public void addLast(int i) {
|
|
int[] iArr = this.mElements;
|
|
int i2 = this.mTail;
|
|
iArr[i2] = i;
|
|
int i3 = this.mCapacityBitmask & (i2 + 1);
|
|
this.mTail = i3;
|
|
if (i3 == this.mHead) {
|
|
doubleCapacity();
|
|
}
|
|
}
|
|
|
|
public int popFirst() {
|
|
int i = this.mHead;
|
|
if (i == this.mTail) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
int i2 = this.mElements[i];
|
|
this.mHead = (i + 1) & this.mCapacityBitmask;
|
|
return i2;
|
|
}
|
|
|
|
public int popLast() {
|
|
int i = this.mHead;
|
|
int i2 = this.mTail;
|
|
if (i == i2) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
int i3 = this.mCapacityBitmask & (i2 - 1);
|
|
int i4 = this.mElements[i3];
|
|
this.mTail = i3;
|
|
return i4;
|
|
}
|
|
|
|
public void removeFromStart(int i) {
|
|
if (i <= 0) {
|
|
return;
|
|
}
|
|
if (i > size()) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
this.mHead = this.mCapacityBitmask & (this.mHead + i);
|
|
}
|
|
|
|
public void removeFromEnd(int i) {
|
|
if (i <= 0) {
|
|
return;
|
|
}
|
|
if (i > size()) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
this.mTail = this.mCapacityBitmask & (this.mTail - i);
|
|
}
|
|
|
|
public int getFirst() {
|
|
int i = this.mHead;
|
|
if (i == this.mTail) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
return this.mElements[i];
|
|
}
|
|
|
|
public int getLast() {
|
|
int i = this.mHead;
|
|
int i2 = this.mTail;
|
|
if (i == i2) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
return this.mElements[(i2 - 1) & this.mCapacityBitmask];
|
|
}
|
|
|
|
public int get(int i) {
|
|
if (i < 0 || i >= size()) {
|
|
throw new ArrayIndexOutOfBoundsException();
|
|
}
|
|
return this.mElements[this.mCapacityBitmask & (this.mHead + i)];
|
|
}
|
|
}
|