193 lines
4.7 KiB
Java
193 lines
4.7 KiB
Java
package com.google.android.gms.internal.measurement;
|
|
|
|
/* loaded from: classes.dex */
|
|
public final class zzye implements Cloneable {
|
|
private static final zzyf d = new zzyf();
|
|
private int[] a;
|
|
private zzyf[] b;
|
|
private int c;
|
|
|
|
zzye() {
|
|
this(10);
|
|
}
|
|
|
|
private static int c(int i) {
|
|
int i2 = i << 2;
|
|
int i3 = 4;
|
|
while (true) {
|
|
if (i3 >= 32) {
|
|
break;
|
|
}
|
|
int i4 = (1 << i3) - 12;
|
|
if (i2 <= i4) {
|
|
i2 = i4;
|
|
break;
|
|
}
|
|
i3++;
|
|
}
|
|
return i2 / 4;
|
|
}
|
|
|
|
private final int d(int i) {
|
|
int i2 = this.c - 1;
|
|
int i3 = 0;
|
|
while (i3 <= i2) {
|
|
int i4 = (i3 + i2) >>> 1;
|
|
int i5 = this.a[i4];
|
|
if (i5 < i) {
|
|
i3 = i4 + 1;
|
|
} else {
|
|
if (i5 <= i) {
|
|
return i4;
|
|
}
|
|
i2 = i4 - 1;
|
|
}
|
|
}
|
|
return ~i3;
|
|
}
|
|
|
|
final zzyf a(int i) {
|
|
int d2 = d(i);
|
|
if (d2 < 0) {
|
|
return null;
|
|
}
|
|
zzyf[] zzyfVarArr = this.b;
|
|
if (zzyfVarArr[d2] == d) {
|
|
return null;
|
|
}
|
|
return zzyfVarArr[d2];
|
|
}
|
|
|
|
final int b() {
|
|
return this.c;
|
|
}
|
|
|
|
public final /* synthetic */ Object clone() throws CloneNotSupportedException {
|
|
int i = this.c;
|
|
zzye zzyeVar = new zzye(i);
|
|
System.arraycopy(this.a, 0, zzyeVar.a, 0, i);
|
|
for (int i2 = 0; i2 < i; i2++) {
|
|
zzyf[] zzyfVarArr = this.b;
|
|
if (zzyfVarArr[i2] != null) {
|
|
zzyeVar.b[i2] = (zzyf) zzyfVarArr[i2].clone();
|
|
}
|
|
}
|
|
zzyeVar.c = i;
|
|
return zzyeVar;
|
|
}
|
|
|
|
public final boolean equals(Object obj) {
|
|
boolean z;
|
|
boolean z2;
|
|
if (obj == this) {
|
|
return true;
|
|
}
|
|
if (!(obj instanceof zzye)) {
|
|
return false;
|
|
}
|
|
zzye zzyeVar = (zzye) obj;
|
|
int i = this.c;
|
|
if (i != zzyeVar.c) {
|
|
return false;
|
|
}
|
|
int[] iArr = this.a;
|
|
int[] iArr2 = zzyeVar.a;
|
|
int i2 = 0;
|
|
while (true) {
|
|
if (i2 >= i) {
|
|
z = true;
|
|
break;
|
|
}
|
|
if (iArr[i2] != iArr2[i2]) {
|
|
z = false;
|
|
break;
|
|
}
|
|
i2++;
|
|
}
|
|
if (z) {
|
|
zzyf[] zzyfVarArr = this.b;
|
|
zzyf[] zzyfVarArr2 = zzyeVar.b;
|
|
int i3 = this.c;
|
|
int i4 = 0;
|
|
while (true) {
|
|
if (i4 >= i3) {
|
|
z2 = true;
|
|
break;
|
|
}
|
|
if (!zzyfVarArr[i4].equals(zzyfVarArr2[i4])) {
|
|
z2 = false;
|
|
break;
|
|
}
|
|
i4++;
|
|
}
|
|
if (z2) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
public final int hashCode() {
|
|
int i = 17;
|
|
for (int i2 = 0; i2 < this.c; i2++) {
|
|
i = (((i * 31) + this.a[i2]) * 31) + this.b[i2].hashCode();
|
|
}
|
|
return i;
|
|
}
|
|
|
|
private zzye(int i) {
|
|
int c = c(i);
|
|
this.a = new int[c];
|
|
this.b = new zzyf[c];
|
|
this.c = 0;
|
|
}
|
|
|
|
final zzyf b(int i) {
|
|
return this.b[i];
|
|
}
|
|
|
|
final void a(int i, zzyf zzyfVar) {
|
|
int d2 = d(i);
|
|
if (d2 >= 0) {
|
|
this.b[d2] = zzyfVar;
|
|
return;
|
|
}
|
|
int i2 = ~d2;
|
|
if (i2 < this.c) {
|
|
zzyf[] zzyfVarArr = this.b;
|
|
if (zzyfVarArr[i2] == d) {
|
|
this.a[i2] = i;
|
|
zzyfVarArr[i2] = zzyfVar;
|
|
return;
|
|
}
|
|
}
|
|
int i3 = this.c;
|
|
if (i3 >= this.a.length) {
|
|
int c = c(i3 + 1);
|
|
int[] iArr = new int[c];
|
|
zzyf[] zzyfVarArr2 = new zzyf[c];
|
|
int[] iArr2 = this.a;
|
|
System.arraycopy(iArr2, 0, iArr, 0, iArr2.length);
|
|
zzyf[] zzyfVarArr3 = this.b;
|
|
System.arraycopy(zzyfVarArr3, 0, zzyfVarArr2, 0, zzyfVarArr3.length);
|
|
this.a = iArr;
|
|
this.b = zzyfVarArr2;
|
|
}
|
|
int i4 = this.c;
|
|
if (i4 - i2 != 0) {
|
|
int[] iArr3 = this.a;
|
|
int i5 = i2 + 1;
|
|
System.arraycopy(iArr3, i2, iArr3, i5, i4 - i2);
|
|
zzyf[] zzyfVarArr4 = this.b;
|
|
System.arraycopy(zzyfVarArr4, i2, zzyfVarArr4, i5, this.c - i2);
|
|
}
|
|
this.a[i2] = i;
|
|
this.b[i2] = zzyfVar;
|
|
this.c++;
|
|
}
|
|
|
|
public final boolean a() {
|
|
return this.c == 0;
|
|
}
|
|
}
|