mirror of
https://github.com/Pinball3D/Rabbit-R1.git
synced 2024-12-25 16:42:30 -06:00
230 lines
11 KiB
Java
230 lines
11 KiB
Java
|
package okio;
|
||
|
|
|
||
|
|
import java.util.List;
|
||
|
|
import java.util.RandomAccess;
|
||
|
|
import kotlin.Metadata;
|
||
|
|
import kotlin.collections.AbstractList;
|
||
|
|
import kotlin.jvm.JvmStatic;
|
||
|
|
import kotlin.jvm.internal.DefaultConstructorMarker;
|
||
|
|
|
||
|
|
/* compiled from: Options.kt */
|
||
|
|
@Metadata(bv = {1, 0, 3}, d1 = {"\u0000,\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0002\u0018\u0002\n\u0000\n\u0002\u0010\u0011\n\u0000\n\u0002\u0010\u0015\n\u0002\b\u0005\n\u0002\u0010\b\n\u0002\b\b\u0018\u0000 \u00152\b\u0012\u0004\u0012\u00020\u00020\u00012\u00060\u0003j\u0002`\u0004:\u0001\u0015B\u001f\b\u0002\u0012\u000e\u0010\u0005\u001a\n\u0012\u0006\b\u0001\u0012\u00020\u00020\u0006\u0012\u0006\u0010\u0007\u001a\u00020\b¢\u0006\u0002\u0010\tJ\u0011\u0010\u0013\u001a\u00020\u00022\u0006\u0010\u0014\u001a\u00020\u000eH\u0096\u0002R\u001e\u0010\u0005\u001a\n\u0012\u0006\b\u0001\u0012\u00020\u00020\u0006X\u0080\u0004¢\u0006\n\n\u0002\u0010\f\u001a\u0004\b\n\u0010\u000bR\u0014\u0010\r\u001a\u00020\u000e8VX\u0096\u0004¢\u0006\u0006\u001a\u0004\b\u000f\u0010\u0010R\u0014\u0010\u0007\u001a\u00020\bX\u0080\u0004¢\u0006\b\n\u0000\u001a\u0004\b\u0011\u0010\u0012¨\u0006\u0016"}, d2 = {"Lokio/Options;", "Lkotlin/collections/AbstractList;", "Lokio/ByteString;", "Ljava/util/RandomAccess;", "Lkotlin/collections/RandomAccess;", "byteStrings", "", "trie", "", "([Lokio/ByteString;[I)V", "getByteStrings$okio", "()[Lokio/ByteString;", "[Lokio/ByteString;", "size", "", "getSize", "()I", "getTrie$okio", "()[I", "get", "index", "Companion", "okio"}, k = 1, mv = {1, 4, 0})
|
||
|
|
/* loaded from: classes3.dex */
|
||
|
|
public final class Options extends AbstractList<ByteString> implements RandomAccess {
|
||
|
|
|
||
|
|
/* renamed from: Companion, reason: from kotlin metadata */
|
||
|
|
public static final Companion INSTANCE = new Companion(null);
|
||
|
|
private final ByteString[] byteStrings;
|
||
|
|
private final int[] trie;
|
||
|
|
|
||
|
|
@JvmStatic
|
||
|
|
public static final Options of(ByteString... byteStringArr) {
|
||
|
|
return INSTANCE.of(byteStringArr);
|
||
|
|
}
|
||
|
|
|
||
|
|
/* renamed from: getByteStrings$okio, reason: from getter */
|
||
|
|
public final ByteString[] getByteStrings() {
|
||
|
|
return this.byteStrings;
|
||
|
|
}
|
||
|
|
|
||
|
|
/* renamed from: getTrie$okio, reason: from getter */
|
||
|
|
public final int[] getTrie() {
|
||
|
|
return this.trie;
|
||
|
|
}
|
||
|
|
|
||
|
|
public /* synthetic */ Options(ByteString[] byteStringArr, int[] iArr, DefaultConstructorMarker defaultConstructorMarker) {
|
||
|
|
this(byteStringArr, iArr);
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // kotlin.collections.AbstractCollection, java.util.Collection, java.util.List
|
||
|
|
public final /* bridge */ boolean contains(Object obj) {
|
||
|
|
if (obj instanceof ByteString) {
|
||
|
|
return contains((ByteString) obj);
|
||
|
|
}
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
public /* bridge */ boolean contains(ByteString byteString) {
|
||
|
|
return super.contains((Options) byteString);
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // kotlin.collections.AbstractList, java.util.List
|
||
|
|
public final /* bridge */ int indexOf(Object obj) {
|
||
|
|
if (obj instanceof ByteString) {
|
||
|
|
return indexOf((ByteString) obj);
|
||
|
|
}
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public /* bridge */ int indexOf(ByteString byteString) {
|
||
|
|
return super.indexOf((Options) byteString);
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // kotlin.collections.AbstractList, java.util.List
|
||
|
|
public final /* bridge */ int lastIndexOf(Object obj) {
|
||
|
|
if (obj instanceof ByteString) {
|
||
|
|
return lastIndexOf((ByteString) obj);
|
||
|
|
}
|
||
|
|
return -1;
|
||
|
|
}
|
||
|
|
|
||
|
|
public /* bridge */ int lastIndexOf(ByteString byteString) {
|
||
|
|
return super.lastIndexOf((Options) byteString);
|
||
|
|
}
|
||
|
|
|
||
|
|
private Options(ByteString[] byteStringArr, int[] iArr) {
|
||
|
|
this.byteStrings = byteStringArr;
|
||
|
|
this.trie = iArr;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // kotlin.collections.AbstractList, kotlin.collections.AbstractCollection
|
||
|
|
public int getSize() {
|
||
|
|
return this.byteStrings.length;
|
||
|
|
}
|
||
|
|
|
||
|
|
@Override // kotlin.collections.AbstractList, java.util.List
|
||
|
|
public ByteString get(int index) {
|
||
|
|
return this.byteStrings[index];
|
||
|
|
}
|
||
|
|
|
||
|
|
/* compiled from: Options.kt */
|
||
|
|
@Metadata(bv = {1, 0, 3}, d1 = {"\u0000>\n\u0002\u0018\u0002\n\u0002\u0010\u0000\n\u0002\b\u0002\n\u0002\u0010\t\n\u0002\u0018\u0002\n\u0002\b\u0003\n\u0002\u0010\u0002\n\u0002\b\u0003\n\u0002\u0010\b\n\u0000\n\u0002\u0010 \n\u0002\u0018\u0002\n\u0002\b\u0004\n\u0002\u0018\u0002\n\u0002\u0010\u0011\n\u0002\b\u0002\b\u0086\u0003\u0018\u00002\u00020\u0001B\u0007\b\u0002¢\u0006\u0002\u0010\u0002JT\u0010\b\u001a\u00020\t2\b\b\u0002\u0010\n\u001a\u00020\u00042\u0006\u0010\u000b\u001a\u00020\u00052\b\b\u0002\u0010\f\u001a\u00020\r2\f\u0010\u000e\u001a\b\u0012\u0004\u0012\u00020\u00100\u000f2\b\b\u0002\u0010\u0011\u001a\u00020\r2\b\b\u0002\u0010\u0012\u001a\u00020\r2\f\u0010\u0013\u001a\b\u0012\u0004\u0012\u00020\r0\u000fH\u0002J!\u0010\u0014\u001a\u00020\u00152\u0012\u0010\u000e\u001a\n\u0012\u0006\b\u0001\u0012\u00020\u00100\u0016\"\u00020\u0010H\u0007¢\u0006\u0002\u0010\u0017R\u0018\u0010\u0003\u001a\u00020\u0004*\u00020\u00058BX\u0082\u0004¢\u0006\u0006\u001a\u0004\b\u0006\u0010\u0007¨\u0006\u0018"}, d2 = {"Lokio/Options$Companion;", "", "()V", "intCount", "", "Lokio/Buffer;", "getIntCount", "(Lokio/Buffer;)J", "buildTrieRecursive", "", "nodeOffset", "node", "byteStringOffset", "", "byteStrings", "", "Lokio/ByteString;", "fromIndex", "toIndex", "indexes", "of", "Lokio/Options;", "", "([Lokio/ByteString;)Lokio/Options;", "okio"}, k = 1, mv = {1, 4, 0})
|
||
|
|
/* loaded from: classes3.dex */
|
||
|
|
public static final class Companion {
|
||
|
|
private Companion() {
|
||
|
|
}
|
||
|
|
|
||
|
|
public /* synthetic */ Companion(DefaultConstructorMarker defaultConstructorMarker) {
|
||
|
|
this();
|
||
|
|
}
|
||
|
|
|
||
|
|
/* JADX WARN: Code restructure failed: missing block: B:45:0x00f2, code lost:
|
||
|
|
|
||
|
|
continue;
|
||
|
|
*/
|
||
|
|
@kotlin.jvm.JvmStatic
|
||
|
|
/*
|
||
|
|
Code decompiled incorrectly, please refer to instructions dump.
|
||
|
|
To view partially-correct add '--show-bad-code' argument
|
||
|
|
*/
|
||
|
|
public final okio.Options of(okio.ByteString... r19) {
|
||
|
|
/*
|
||
|
|
Method dump skipped, instructions count: 336
|
||
|
|
To view this dump add '--comments-level debug' option
|
||
|
|
*/
|
||
|
|
throw new UnsupportedOperationException("Method not decompiled: okio.Options.Companion.of(okio.ByteString[]):okio.Options");
|
||
|
|
}
|
||
|
|
|
||
|
|
static /* synthetic */ void buildTrieRecursive$default(Companion companion, long j, Buffer buffer, int i, List list, int i2, int i3, List list2, int i4, Object obj) {
|
||
|
|
companion.buildTrieRecursive((i4 & 1) != 0 ? 0L : j, buffer, (i4 & 4) != 0 ? 0 : i, list, (i4 & 16) != 0 ? 0 : i2, (i4 & 32) != 0 ? list.size() : i3, list2);
|
||
|
|
}
|
||
|
|
|
||
|
|
private final void buildTrieRecursive(long nodeOffset, Buffer node, int byteStringOffset, List<? extends ByteString> byteStrings, int fromIndex, int toIndex, List<Integer> indexes) {
|
||
|
|
int i;
|
||
|
|
int i2;
|
||
|
|
int i3;
|
||
|
|
int i4;
|
||
|
|
Buffer buffer;
|
||
|
|
int i5 = byteStringOffset;
|
||
|
|
if (!(fromIndex < toIndex)) {
|
||
|
|
throw new IllegalArgumentException("Failed requirement.".toString());
|
||
|
|
}
|
||
|
|
for (int i6 = fromIndex; i6 < toIndex; i6++) {
|
||
|
|
if (!(byteStrings.get(i6).size() >= i5)) {
|
||
|
|
throw new IllegalArgumentException("Failed requirement.".toString());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
ByteString byteString = byteStrings.get(fromIndex);
|
||
|
|
ByteString byteString2 = byteStrings.get(toIndex - 1);
|
||
|
|
if (i5 == byteString.size()) {
|
||
|
|
int intValue = indexes.get(fromIndex).intValue();
|
||
|
|
int i7 = fromIndex + 1;
|
||
|
|
ByteString byteString3 = byteStrings.get(i7);
|
||
|
|
i = i7;
|
||
|
|
i2 = intValue;
|
||
|
|
byteString = byteString3;
|
||
|
|
} else {
|
||
|
|
i = fromIndex;
|
||
|
|
i2 = -1;
|
||
|
|
}
|
||
|
|
if (byteString.getByte(i5) != byteString2.getByte(i5)) {
|
||
|
|
int i8 = 1;
|
||
|
|
for (int i9 = i + 1; i9 < toIndex; i9++) {
|
||
|
|
if (byteStrings.get(i9 - 1).getByte(i5) != byteStrings.get(i9).getByte(i5)) {
|
||
|
|
i8++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
long intCount = nodeOffset + getIntCount(node) + 2 + (i8 * 2);
|
||
|
|
node.writeInt(i8);
|
||
|
|
node.writeInt(i2);
|
||
|
|
for (int i10 = i; i10 < toIndex; i10++) {
|
||
|
|
byte b = byteStrings.get(i10).getByte(i5);
|
||
|
|
if (i10 == i || b != byteStrings.get(i10 - 1).getByte(i5)) {
|
||
|
|
node.writeInt(b & 255);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
Buffer buffer2 = new Buffer();
|
||
|
|
while (i < toIndex) {
|
||
|
|
byte b2 = byteStrings.get(i).getByte(i5);
|
||
|
|
int i11 = i + 1;
|
||
|
|
int i12 = i11;
|
||
|
|
while (true) {
|
||
|
|
if (i12 >= toIndex) {
|
||
|
|
i3 = toIndex;
|
||
|
|
break;
|
||
|
|
} else {
|
||
|
|
if (b2 != byteStrings.get(i12).getByte(i5)) {
|
||
|
|
i3 = i12;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
i12++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if (i11 == i3 && i5 + 1 == byteStrings.get(i).size()) {
|
||
|
|
node.writeInt(indexes.get(i).intValue());
|
||
|
|
i4 = i3;
|
||
|
|
buffer = buffer2;
|
||
|
|
} else {
|
||
|
|
node.writeInt(((int) (intCount + getIntCount(buffer2))) * (-1));
|
||
|
|
i4 = i3;
|
||
|
|
buffer = buffer2;
|
||
|
|
buildTrieRecursive(intCount, buffer2, i5 + 1, byteStrings, i, i3, indexes);
|
||
|
|
}
|
||
|
|
i = i4;
|
||
|
|
buffer2 = buffer;
|
||
|
|
}
|
||
|
|
node.writeAll(buffer2);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int min = Math.min(byteString.size(), byteString2.size());
|
||
|
|
int i13 = 0;
|
||
|
|
for (int i14 = i5; i14 < min && byteString.getByte(i14) == byteString2.getByte(i14); i14++) {
|
||
|
|
i13++;
|
||
|
|
}
|
||
|
|
long intCount2 = nodeOffset + getIntCount(node) + 2 + i13 + 1;
|
||
|
|
node.writeInt(-i13);
|
||
|
|
node.writeInt(i2);
|
||
|
|
int i15 = i5 + i13;
|
||
|
|
while (i5 < i15) {
|
||
|
|
node.writeInt(byteString.getByte(i5) & 255);
|
||
|
|
i5++;
|
||
|
|
}
|
||
|
|
if (i + 1 == toIndex) {
|
||
|
|
if (!(i15 == byteStrings.get(i).size())) {
|
||
|
|
throw new IllegalStateException("Check failed.".toString());
|
||
|
|
}
|
||
|
|
node.writeInt(indexes.get(i).intValue());
|
||
|
|
} else {
|
||
|
|
Buffer buffer3 = new Buffer();
|
||
|
|
node.writeInt(((int) (getIntCount(buffer3) + intCount2)) * (-1));
|
||
|
|
buildTrieRecursive(intCount2, buffer3, i15, byteStrings, i, toIndex, indexes);
|
||
|
|
node.writeAll(buffer3);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
private final long getIntCount(Buffer buffer) {
|
||
|
|
return buffer.size() / 4;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|