207 lines
7.5 KiB
Java
207 lines
7.5 KiB
Java
package c.i.a.f.h.l;
|
|
|
|
import c.i.a.f.e.o.f;
|
|
import com.google.android.gms.internal.measurement.zzij;
|
|
/* compiled from: com.google.android.gms:play-services-measurement-base@@18.0.0 */
|
|
public final class l7 extends m7 {
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final int a(int i, byte[] bArr, int i2, int i3) {
|
|
while (i2 < i3 && bArr[i2] >= 0) {
|
|
i2++;
|
|
}
|
|
if (i2 >= i3) {
|
|
return 0;
|
|
}
|
|
while (i2 < i3) {
|
|
int i4 = i2 + 1;
|
|
byte b = bArr[i2];
|
|
if (b < 0) {
|
|
if (b < -32) {
|
|
if (i4 >= i3) {
|
|
return b;
|
|
}
|
|
if (b >= -62) {
|
|
i2 = i4 + 1;
|
|
if (bArr[i4] > -65) {
|
|
}
|
|
}
|
|
return -1;
|
|
} else if (b < -16) {
|
|
if (i4 >= i3 - 1) {
|
|
return k7.d(bArr, i4, i3);
|
|
}
|
|
int i5 = i4 + 1;
|
|
byte b2 = bArr[i4];
|
|
if (b2 <= -65 && ((b != -32 || b2 >= -96) && (b != -19 || b2 < -96))) {
|
|
i2 = i5 + 1;
|
|
if (bArr[i5] > -65) {
|
|
}
|
|
}
|
|
return -1;
|
|
} else if (i4 >= i3 - 2) {
|
|
return k7.d(bArr, i4, i3);
|
|
} else {
|
|
int i6 = i4 + 1;
|
|
byte b3 = bArr[i4];
|
|
if (b3 <= -65) {
|
|
if ((((b3 + 112) + (b << 28)) >> 30) == 0) {
|
|
int i7 = i6 + 1;
|
|
if (bArr[i6] <= -65) {
|
|
i4 = i7 + 1;
|
|
if (bArr[i7] > -65) {
|
|
}
|
|
}
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
}
|
|
i2 = i4;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final int b(CharSequence charSequence, byte[] bArr, int i, int i2) {
|
|
int i3;
|
|
int i4;
|
|
int i5;
|
|
char charAt;
|
|
int length = charSequence.length();
|
|
int i6 = i2 + i;
|
|
int i7 = 0;
|
|
while (i7 < length && (i5 = i7 + i) < i6 && (charAt = charSequence.charAt(i7)) < 128) {
|
|
bArr[i5] = (byte) charAt;
|
|
i7++;
|
|
}
|
|
if (i7 == length) {
|
|
return i + length;
|
|
}
|
|
int i8 = i + i7;
|
|
while (i7 < length) {
|
|
char charAt2 = charSequence.charAt(i7);
|
|
if (charAt2 < 128 && i8 < i6) {
|
|
i4 = i8 + 1;
|
|
bArr[i8] = (byte) charAt2;
|
|
} else if (charAt2 < 2048 && i8 <= i6 - 2) {
|
|
int i9 = i8 + 1;
|
|
bArr[i8] = (byte) ((charAt2 >>> 6) | 960);
|
|
i8 = i9 + 1;
|
|
bArr[i9] = (byte) ((charAt2 & '?') | 128);
|
|
i7++;
|
|
} else if ((charAt2 < 55296 || 57343 < charAt2) && i8 <= i6 - 3) {
|
|
int i10 = i8 + 1;
|
|
bArr[i8] = (byte) ((charAt2 >>> '\f') | 480);
|
|
int i11 = i10 + 1;
|
|
bArr[i10] = (byte) (((charAt2 >>> 6) & 63) | 128);
|
|
i4 = i11 + 1;
|
|
bArr[i11] = (byte) ((charAt2 & '?') | 128);
|
|
} else if (i8 <= i6 - 4) {
|
|
int i12 = i7 + 1;
|
|
if (i12 != charSequence.length()) {
|
|
char charAt3 = charSequence.charAt(i12);
|
|
if (Character.isSurrogatePair(charAt2, charAt3)) {
|
|
int codePoint = Character.toCodePoint(charAt2, charAt3);
|
|
int i13 = i8 + 1;
|
|
bArr[i8] = (byte) ((codePoint >>> 18) | 240);
|
|
int i14 = i13 + 1;
|
|
bArr[i13] = (byte) (((codePoint >>> 12) & 63) | 128);
|
|
int i15 = i14 + 1;
|
|
bArr[i14] = (byte) (((codePoint >>> 6) & 63) | 128);
|
|
i8 = i15 + 1;
|
|
bArr[i15] = (byte) ((codePoint & 63) | 128);
|
|
i7 = i12;
|
|
i7++;
|
|
} else {
|
|
i7 = i12;
|
|
}
|
|
}
|
|
throw new o7(i7 - 1, length);
|
|
} else if (55296 > charAt2 || charAt2 > 57343 || ((i3 = i7 + 1) != charSequence.length() && Character.isSurrogatePair(charAt2, charSequence.charAt(i3)))) {
|
|
StringBuilder sb = new StringBuilder(37);
|
|
sb.append("Failed writing ");
|
|
sb.append(charAt2);
|
|
sb.append(" at index ");
|
|
sb.append(i8);
|
|
throw new ArrayIndexOutOfBoundsException(sb.toString());
|
|
} else {
|
|
throw new o7(i7, length);
|
|
}
|
|
i8 = i4;
|
|
i7++;
|
|
}
|
|
return i8;
|
|
}
|
|
|
|
@Override // c.i.a.f.h.l.m7
|
|
public final String c(byte[] bArr, int i, int i2) throws zzij {
|
|
if ((i | i2 | ((bArr.length - i) - i2)) >= 0) {
|
|
int i3 = i + i2;
|
|
char[] cArr = new char[i2];
|
|
int i4 = 0;
|
|
while (i < i3) {
|
|
byte b = bArr[i];
|
|
if (!f.R1(b)) {
|
|
break;
|
|
}
|
|
i++;
|
|
cArr[i4] = (char) b;
|
|
i4++;
|
|
}
|
|
int i5 = i4;
|
|
while (i < i3) {
|
|
int i6 = i + 1;
|
|
byte b2 = bArr[i];
|
|
if (f.R1(b2)) {
|
|
int i7 = i5 + 1;
|
|
cArr[i5] = (char) b2;
|
|
i = i6;
|
|
while (true) {
|
|
i5 = i7;
|
|
if (i >= i3) {
|
|
break;
|
|
}
|
|
byte b3 = bArr[i];
|
|
if (!f.R1(b3)) {
|
|
break;
|
|
}
|
|
i++;
|
|
i7 = i5 + 1;
|
|
cArr[i5] = (char) b3;
|
|
}
|
|
} else {
|
|
if (!(b2 < -32)) {
|
|
if (b2 < -16) {
|
|
if (i6 < i3 - 1) {
|
|
int i8 = i6 + 1;
|
|
f.J1(b2, bArr[i6], bArr[i8], cArr, i5);
|
|
i = i8 + 1;
|
|
i5++;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
} else if (i6 < i3 - 2) {
|
|
int i9 = i6 + 1;
|
|
byte b4 = bArr[i6];
|
|
int i10 = i9 + 1;
|
|
f.I1(b2, b4, bArr[i9], bArr[i10], cArr, i5);
|
|
i5 = i5 + 1 + 1;
|
|
i = i10 + 1;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
} else if (i6 < i3) {
|
|
f.K1(b2, bArr[i6], cArr, i5);
|
|
i = i6 + 1;
|
|
i5++;
|
|
} else {
|
|
throw zzij.e();
|
|
}
|
|
}
|
|
}
|
|
return new String(cArr, 0, i5);
|
|
}
|
|
throw new ArrayIndexOutOfBoundsException(String.format("buffer length=%d, index=%d, size=%d", Integer.valueOf(bArr.length), Integer.valueOf(i), Integer.valueOf(i2)));
|
|
}
|
|
}
|