ADD week 5
This commit is contained in:
161
02-Easy5/E5/sources/kotlin/collections/RingBuffer.java
Normal file
161
02-Easy5/E5/sources/kotlin/collections/RingBuffer.java
Normal file
@@ -0,0 +1,161 @@
|
||||
package kotlin.collections;
|
||||
|
||||
import java.util.Arrays;
|
||||
import java.util.Iterator;
|
||||
import java.util.RandomAccess;
|
||||
import kotlin.Metadata;
|
||||
import kotlin.jvm.internal.Intrinsics;
|
||||
import kotlin.ranges.RangesKt;
|
||||
|
||||
/* compiled from: SlidingWindow.kt */
|
||||
@Metadata(d1 = {"\u0000>\n\u0002\u0018\u0002\n\u0000\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\b\n\u0002\b\u0002\n\u0002\u0010\u0011\n\u0002\u0010\u0000\n\u0002\b\t\n\u0002\u0010\u0002\n\u0002\b\b\n\u0002\u0010\u000b\n\u0000\n\u0002\u0010(\n\u0002\b\b\b\u0002\u0018\u0000*\u0004\b\u0000\u0010\u00012\b\u0012\u0004\u0012\u0002H\u00010\u00022\u00060\u0003j\u0002`\u0004B\u000f\b\u0016\u0012\u0006\u0010\u0005\u001a\u00020\u0006¢\u0006\u0002\u0010\u0007B\u001d\u0012\u000e\u0010\b\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\n0\t\u0012\u0006\u0010\u000b\u001a\u00020\u0006¢\u0006\u0002\u0010\fJ\u0013\u0010\u0013\u001a\u00020\u00142\u0006\u0010\u0015\u001a\u00028\u0000¢\u0006\u0002\u0010\u0016J\u0014\u0010\u0017\u001a\b\u0012\u0004\u0012\u00028\u00000\u00002\u0006\u0010\u0018\u001a\u00020\u0006J\u0016\u0010\u0019\u001a\u00028\u00002\u0006\u0010\u001a\u001a\u00020\u0006H\u0096\u0002¢\u0006\u0002\u0010\u001bJ\u0006\u0010\u001c\u001a\u00020\u001dJ\u000f\u0010\u001e\u001a\b\u0012\u0004\u0012\u00028\u00000\u001fH\u0096\u0002J\u000e\u0010 \u001a\u00020\u00142\u0006\u0010!\u001a\u00020\u0006J\u0015\u0010\"\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\n0\tH\u0014¢\u0006\u0002\u0010#J'\u0010\"\u001a\b\u0012\u0004\u0012\u0002H\u00010\t\"\u0004\b\u0001\u0010\u00012\f\u0010$\u001a\b\u0012\u0004\u0012\u0002H\u00010\tH\u0014¢\u0006\u0002\u0010%J\u0015\u0010&\u001a\u00020\u0006*\u00020\u00062\u0006\u0010!\u001a\u00020\u0006H\u0082\bR\u0018\u0010\b\u001a\n\u0012\u0006\u0012\u0004\u0018\u00010\n0\tX\u0082\u0004¢\u0006\u0004\n\u0002\u0010\rR\u000e\u0010\u0005\u001a\u00020\u0006X\u0082\u0004¢\u0006\u0002\n\u0000R\u001e\u0010\u000f\u001a\u00020\u00062\u0006\u0010\u000e\u001a\u00020\u0006@RX\u0096\u000e¢\u0006\b\n\u0000\u001a\u0004\b\u0010\u0010\u0011R\u000e\u0010\u0012\u001a\u00020\u0006X\u0082\u000e¢\u0006\u0002\n\u0000¨\u0006'"}, d2 = {"Lkotlin/collections/RingBuffer;", "T", "Lkotlin/collections/AbstractList;", "Ljava/util/RandomAccess;", "Lkotlin/collections/RandomAccess;", "capacity", "", "(I)V", "buffer", "", "", "filledSize", "([Ljava/lang/Object;I)V", "[Ljava/lang/Object;", "<set-?>", "size", "getSize", "()I", "startIndex", "add", "", "element", "(Ljava/lang/Object;)V", "expanded", "maxCapacity", "get", "index", "(I)Ljava/lang/Object;", "isFull", "", "iterator", "", "removeFirst", "n", "toArray", "()[Ljava/lang/Object;", "array", "([Ljava/lang/Object;)[Ljava/lang/Object;", "forward", "kotlin-stdlib"}, k = 1, mv = {1, 8, 0}, xi = 48)
|
||||
/* loaded from: classes.dex */
|
||||
final class RingBuffer<T> extends AbstractList<T> implements RandomAccess {
|
||||
private final Object[] buffer;
|
||||
private final int capacity;
|
||||
private int size;
|
||||
private int startIndex;
|
||||
|
||||
@Override // kotlin.collections.AbstractList, kotlin.collections.AbstractCollection
|
||||
/* renamed from: getSize, reason: from getter */
|
||||
public int get_size() {
|
||||
return this.size;
|
||||
}
|
||||
|
||||
public RingBuffer(Object[] buffer, int i) {
|
||||
Intrinsics.checkNotNullParameter(buffer, "buffer");
|
||||
this.buffer = buffer;
|
||||
if (i < 0) {
|
||||
throw new IllegalArgumentException(("ring buffer filled size should not be negative but it is " + i).toString());
|
||||
}
|
||||
if (i > buffer.length) {
|
||||
throw new IllegalArgumentException(("ring buffer filled size: " + i + " cannot be larger than the buffer size: " + buffer.length).toString());
|
||||
}
|
||||
this.capacity = buffer.length;
|
||||
this.size = i;
|
||||
}
|
||||
|
||||
public RingBuffer(int i) {
|
||||
this(new Object[i], 0);
|
||||
}
|
||||
|
||||
@Override // kotlin.collections.AbstractList, java.util.List
|
||||
public T get(int index) {
|
||||
AbstractList.INSTANCE.checkElementIndex$kotlin_stdlib(index, size());
|
||||
return (T) this.buffer[(this.startIndex + index) % this.capacity];
|
||||
}
|
||||
|
||||
public final boolean isFull() {
|
||||
return size() == this.capacity;
|
||||
}
|
||||
|
||||
@Override // kotlin.collections.AbstractList, kotlin.collections.AbstractCollection, java.util.Collection, java.lang.Iterable
|
||||
public Iterator<T> iterator() {
|
||||
return new AbstractIterator<T>(this) { // from class: kotlin.collections.RingBuffer$iterator$1
|
||||
private int count;
|
||||
private int index;
|
||||
final /* synthetic */ RingBuffer<T> this$0;
|
||||
|
||||
{
|
||||
int i;
|
||||
this.this$0 = this;
|
||||
this.count = this.size();
|
||||
i = ((RingBuffer) this).startIndex;
|
||||
this.index = i;
|
||||
}
|
||||
|
||||
/* JADX WARN: Multi-variable type inference failed */
|
||||
@Override // kotlin.collections.AbstractIterator
|
||||
protected void computeNext() {
|
||||
Object[] objArr;
|
||||
if (this.count != 0) {
|
||||
objArr = ((RingBuffer) this.this$0).buffer;
|
||||
setNext(objArr[this.index]);
|
||||
this.index = (this.index + 1) % ((RingBuffer) this.this$0).capacity;
|
||||
this.count--;
|
||||
return;
|
||||
}
|
||||
done();
|
||||
}
|
||||
};
|
||||
}
|
||||
|
||||
@Override // kotlin.collections.AbstractCollection, java.util.Collection
|
||||
public <T> T[] toArray(T[] array) {
|
||||
Intrinsics.checkNotNullParameter(array, "array");
|
||||
if (array.length < size()) {
|
||||
array = (T[]) Arrays.copyOf(array, size());
|
||||
Intrinsics.checkNotNullExpressionValue(array, "copyOf(this, newSize)");
|
||||
}
|
||||
int size = size();
|
||||
int i = 0;
|
||||
int i2 = 0;
|
||||
for (int i3 = this.startIndex; i2 < size && i3 < this.capacity; i3++) {
|
||||
array[i2] = this.buffer[i3];
|
||||
i2++;
|
||||
}
|
||||
while (i2 < size) {
|
||||
array[i2] = this.buffer[i];
|
||||
i2++;
|
||||
i++;
|
||||
}
|
||||
if (array.length > size()) {
|
||||
array[size()] = null;
|
||||
}
|
||||
return array;
|
||||
}
|
||||
|
||||
/* JADX WARN: Multi-variable type inference failed */
|
||||
@Override // kotlin.collections.AbstractCollection, java.util.Collection
|
||||
public Object[] toArray() {
|
||||
return toArray(new Object[size()]);
|
||||
}
|
||||
|
||||
/* JADX WARN: Multi-variable type inference failed */
|
||||
public final RingBuffer<T> expanded(int maxCapacity) {
|
||||
Object[] array;
|
||||
int i = this.capacity;
|
||||
int coerceAtMost = RangesKt.coerceAtMost(i + (i >> 1) + 1, maxCapacity);
|
||||
if (this.startIndex == 0) {
|
||||
array = Arrays.copyOf(this.buffer, coerceAtMost);
|
||||
Intrinsics.checkNotNullExpressionValue(array, "copyOf(this, newSize)");
|
||||
} else {
|
||||
array = toArray(new Object[coerceAtMost]);
|
||||
}
|
||||
return new RingBuffer<>(array, size());
|
||||
}
|
||||
|
||||
@Override // java.util.Collection, java.util.List
|
||||
public final void add(T element) {
|
||||
if (isFull()) {
|
||||
throw new IllegalStateException("ring buffer is full");
|
||||
}
|
||||
this.buffer[(this.startIndex + size()) % this.capacity] = element;
|
||||
this.size = size() + 1;
|
||||
}
|
||||
|
||||
public final void removeFirst(int n) {
|
||||
if (n < 0) {
|
||||
throw new IllegalArgumentException(("n shouldn't be negative but it is " + n).toString());
|
||||
}
|
||||
if (n > size()) {
|
||||
throw new IllegalArgumentException(("n shouldn't be greater than the buffer size: n = " + n + ", size = " + size()).toString());
|
||||
}
|
||||
if (n > 0) {
|
||||
int i = this.startIndex;
|
||||
int i2 = (i + n) % this.capacity;
|
||||
if (i > i2) {
|
||||
ArraysKt.fill(this.buffer, (Object) null, i, this.capacity);
|
||||
ArraysKt.fill(this.buffer, (Object) null, 0, i2);
|
||||
} else {
|
||||
ArraysKt.fill(this.buffer, (Object) null, i, i2);
|
||||
}
|
||||
this.startIndex = i2;
|
||||
this.size = size() - n;
|
||||
}
|
||||
}
|
||||
|
||||
private final int forward(int i, int i2) {
|
||||
return (i + i2) % this.capacity;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user