75 lines
2.1 KiB
Java
75 lines
2.1 KiB
Java
package z7;
|
|
public final class h0 {
|
|
public final byte[] a;
|
|
public final int b;
|
|
public final int c;
|
|
|
|
public h0(byte[] p4, int p5, int p6)
|
|
{
|
|
if ((p6 & 4) != 0) {
|
|
p5 = 20;
|
|
}
|
|
kotlin.jvm.internal.s.f(p4, "rawBytes");
|
|
int v0_2 = 0;
|
|
int v1_1 = 0;
|
|
while (v0_2 < p4.length) {
|
|
v1_1 ^= (p4[v0_2] & 255);
|
|
v0_2++;
|
|
}
|
|
int v6_2 = ((byte) v1_1);
|
|
int v0_0 = p4.length;
|
|
byte[] v4_1 = java.util.Arrays.copyOf(p4, (v0_0 + 1));
|
|
v4_1[v0_0] = v6_2;
|
|
this.a = v4_1;
|
|
int v6_4 = Math.max(240, p5);
|
|
if (v6_4 > v4_1.length) {
|
|
v6_4 = v4_1.length;
|
|
}
|
|
if (p5 > v6_4) {
|
|
p5 = v6_4;
|
|
}
|
|
this.c = p5;
|
|
this.b = v6_4;
|
|
return;
|
|
}
|
|
|
|
public final java.util.ArrayList a(int p5)
|
|
{
|
|
java.util.ArrayList v0_0 = this.b;
|
|
byte[] v5_1 = (p5 * v0_0);
|
|
int v1_2 = this.a;
|
|
byte[] v5_2 = q6.n.k0(v1_2, v5_1, Math.min((v0_0 + v5_1), v1_2.length));
|
|
java.util.ArrayList v0_1 = new java.util.ArrayList();
|
|
int v1_0 = 0;
|
|
while (v1_0 < v5_2.length) {
|
|
int v2_2 = (this.c + v1_0);
|
|
v0_1.add(q6.n.k0(v5_2, v1_0, Math.min(v2_2, v5_2.length)));
|
|
v1_0 = v2_2;
|
|
}
|
|
return v0_1;
|
|
}
|
|
|
|
public final String b()
|
|
{
|
|
String v1_0 = this.a;
|
|
kotlin.jvm.internal.s.f(v1_0, "<this>");
|
|
if (v1_0.length == 0) {
|
|
throw new java.util.NoSuchElementException("Array is empty.");
|
|
} else {
|
|
java.util.NoSuchElementException v0_3 = (v1_0[(v1_0.length - 1)] & 255);
|
|
c7.a.l(16);
|
|
java.util.NoSuchElementException v0_4 = Integer.toString(v0_3, 16);
|
|
kotlin.jvm.internal.s.e(v0_4, "toString(...)");
|
|
java.util.NoSuchElementException v0_5 = v0_4.toUpperCase(java.util.Locale.ROOT);
|
|
kotlin.jvm.internal.s.e(v0_5, "toUpperCase(...)");
|
|
return p.p1.j("0x", i7.i.B0(2, v0_5));
|
|
}
|
|
}
|
|
|
|
public final int c()
|
|
{
|
|
int v1 = this.b;
|
|
return (((this.a.length + v1) - 1) / v1);
|
|
}
|
|
}
|