151 lines
4.0 KiB
Java
151 lines
4.0 KiB
Java
|
package o;
|
||
|
|
|
||
|
|
/* loaded from: classes.dex */
|
||
|
|
public final class gjL {
|
||
|
|
public final int d = 37;
|
||
|
|
public int e = 17;
|
||
|
|
|
||
|
|
public gjL() {
|
||
|
|
}
|
||
|
|
|
||
|
|
public gjL(byte b) {
|
||
|
|
int i = 17 % 2;
|
||
|
|
int i2 = 37 % 2;
|
||
|
|
}
|
||
|
|
|
||
|
|
public final gjL c(Object obj) {
|
||
|
|
if (obj == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
} else if (obj.getClass().isArray()) {
|
||
|
|
b(obj);
|
||
|
|
} else {
|
||
|
|
this.e = (this.e * this.d) + obj.hashCode();
|
||
|
|
}
|
||
|
|
return this;
|
||
|
|
}
|
||
|
|
|
||
|
|
private void b(Object obj) {
|
||
|
|
int i = 0;
|
||
|
|
if (obj instanceof long[]) {
|
||
|
|
long[] jArr = (long[]) obj;
|
||
|
|
if (jArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length = jArr.length;
|
||
|
|
while (i < length) {
|
||
|
|
long j = jArr[i];
|
||
|
|
this.e = (this.e * this.d) + ((int) (j ^ (j >> 32)));
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof int[]) {
|
||
|
|
int[] iArr = (int[]) obj;
|
||
|
|
if (iArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length2 = iArr.length;
|
||
|
|
while (i < length2) {
|
||
|
|
this.e = (this.e * this.d) + iArr[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof short[]) {
|
||
|
|
short[] sArr = (short[]) obj;
|
||
|
|
if (sArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length3 = sArr.length;
|
||
|
|
while (i < length3) {
|
||
|
|
this.e = (this.e * this.d) + sArr[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof char[]) {
|
||
|
|
char[] cArr = (char[]) obj;
|
||
|
|
if (cArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length4 = cArr.length;
|
||
|
|
while (i < length4) {
|
||
|
|
this.e = (this.e * this.d) + cArr[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof byte[]) {
|
||
|
|
byte[] bArr = (byte[]) obj;
|
||
|
|
if (bArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length5 = bArr.length;
|
||
|
|
while (i < length5) {
|
||
|
|
this.e = (this.e * this.d) + bArr[i];
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof double[]) {
|
||
|
|
double[] dArr = (double[]) obj;
|
||
|
|
if (dArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length6 = dArr.length;
|
||
|
|
while (i < length6) {
|
||
|
|
long doubleToLongBits = Double.doubleToLongBits(dArr[i]);
|
||
|
|
this.e = (this.e * this.d) + ((int) (doubleToLongBits ^ (doubleToLongBits >> 32)));
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof float[]) {
|
||
|
|
float[] fArr = (float[]) obj;
|
||
|
|
if (fArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length7 = fArr.length;
|
||
|
|
while (i < length7) {
|
||
|
|
this.e = (this.e * this.d) + Float.floatToIntBits(fArr[i]);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
if (obj instanceof boolean[]) {
|
||
|
|
boolean[] zArr = (boolean[]) obj;
|
||
|
|
if (zArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length8 = zArr.length;
|
||
|
|
while (i < length8) {
|
||
|
|
this.e = (this.e * this.d) + (!zArr[i] ? 1 : 0);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
Object[] objArr = (Object[]) obj;
|
||
|
|
if (objArr == null) {
|
||
|
|
this.e *= this.d;
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
int length9 = objArr.length;
|
||
|
|
while (i < length9) {
|
||
|
|
c(objArr[i]);
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
public final int hashCode() {
|
||
|
|
return this.e;
|
||
|
|
}
|
||
|
|
}
|