mirror of
https://github.com/Pinball3D/Rabbit-R1.git
synced 2025-01-09 13:43:22 +00:00
49 lines
2.1 KiB
Java
49 lines
2.1 KiB
Java
package kotlin.ranges;
|
|
|
|
import java.util.NoSuchElementException;
|
|
import kotlin.Metadata;
|
|
import kotlin.collections.IntIterator;
|
|
|
|
/* compiled from: ProgressionIterators.kt */
|
|
@Metadata(d1 = {"\u0000\u001a\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\b\n\u0002\b\u0005\n\u0002\u0010\u000b\n\u0002\b\u0005\b\u0000\u0018\u00002\u00020\u0001B\u001d\u0012\u0006\u0010\u0002\u001a\u00020\u0003\u0012\u0006\u0010\u0004\u001a\u00020\u0003\u0012\u0006\u0010\u0005\u001a\u00020\u0003¢\u0006\u0002\u0010\u0006J\t\u0010\b\u001a\u00020\tH\u0096\u0002J\b\u0010\r\u001a\u00020\u0003H\u0016R\u000e\u0010\u0007\u001a\u00020\u0003X\u0082\u0004¢\u0006\u0002\n\u0000R\u000e\u0010\b\u001a\u00020\tX\u0082\u000e¢\u0006\u0002\n\u0000R\u000e\u0010\n\u001a\u00020\u0003X\u0082\u000e¢\u0006\u0002\n\u0000R\u0011\u0010\u0005\u001a\u00020\u0003¢\u0006\b\n\u0000\u001a\u0004\b\u000b\u0010\f¨\u0006\u000e"}, d2 = {"Lkotlin/ranges/IntProgressionIterator;", "Lkotlin/collections/IntIterator;", "first", "", "last", "step", "(III)V", "finalElement", "hasNext", "", "next", "getStep", "()I", "nextInt", "kotlin-stdlib"}, k = 1, mv = {1, 9, 0}, xi = 48)
|
|
/* loaded from: classes3.dex */
|
|
public final class IntProgressionIterator extends IntIterator {
|
|
private final int finalElement;
|
|
private boolean hasNext;
|
|
private int next;
|
|
private final int step;
|
|
|
|
public final int getStep() {
|
|
return this.step;
|
|
}
|
|
|
|
@Override // java.util.Iterator
|
|
public boolean hasNext() {
|
|
return this.hasNext;
|
|
}
|
|
|
|
public IntProgressionIterator(int i, int i2, int i3) {
|
|
this.step = i3;
|
|
this.finalElement = i2;
|
|
boolean z = true;
|
|
if (i3 <= 0 ? i < i2 : i > i2) {
|
|
z = false;
|
|
}
|
|
this.hasNext = z;
|
|
this.next = z ? i : i2;
|
|
}
|
|
|
|
@Override // kotlin.collections.IntIterator
|
|
public int nextInt() {
|
|
int i = this.next;
|
|
if (i != this.finalElement) {
|
|
this.next = this.step + i;
|
|
} else {
|
|
if (!this.hasNext) {
|
|
throw new NoSuchElementException();
|
|
}
|
|
this.hasNext = false;
|
|
}
|
|
return i;
|
|
}
|
|
}
|