408 lines
12 KiB
Java
408 lines
12 KiB
Java
package ra;
|
|
|
|
import java.util.AbstractMap;
|
|
import java.util.Arrays;
|
|
import java.util.Map;
|
|
import qa.h;
|
|
/* compiled from: RegularImmutableMap.java */
|
|
/* loaded from: classes4.dex */
|
|
final class m0<K, V> extends u<K, V> {
|
|
|
|
/* renamed from: q reason: collision with root package name */
|
|
static final u<Object, Object> f21731q = new m0(null, new Object[0], 0);
|
|
|
|
/* renamed from: n reason: collision with root package name */
|
|
private final transient Object f21732n;
|
|
|
|
/* renamed from: o reason: collision with root package name */
|
|
final transient Object[] f21733o;
|
|
|
|
/* renamed from: p reason: collision with root package name */
|
|
private final transient int f21734p;
|
|
|
|
/* compiled from: RegularImmutableMap.java */
|
|
/* loaded from: classes4.dex */
|
|
static class a<K, V> extends w<Map.Entry<K, V>> {
|
|
|
|
/* renamed from: l reason: collision with root package name */
|
|
private final transient u<K, V> f21735l;
|
|
|
|
/* renamed from: m reason: collision with root package name */
|
|
private final transient Object[] f21736m;
|
|
|
|
/* renamed from: n reason: collision with root package name */
|
|
private final transient int f21737n;
|
|
|
|
/* renamed from: o reason: collision with root package name */
|
|
private final transient int f21738o;
|
|
|
|
/* compiled from: RegularImmutableMap.java */
|
|
/* renamed from: ra.m0$a$a reason: collision with other inner class name */
|
|
/* loaded from: classes4.dex */
|
|
class C0378a extends s<Map.Entry<K, V>> {
|
|
C0378a() {
|
|
}
|
|
|
|
/* renamed from: C */
|
|
public Map.Entry<K, V> get(int i10) {
|
|
h.h(i10, a.z(a.this));
|
|
int i11 = i10 * 2;
|
|
return new AbstractMap.SimpleImmutableEntry(a.A(a.this)[a.B(a.this) + i11], a.A(a.this)[i11 + (a.B(a.this) ^ 1)]);
|
|
}
|
|
|
|
@Override // ra.q
|
|
public boolean i() {
|
|
return true;
|
|
}
|
|
|
|
@Override // java.util.AbstractCollection, java.util.Collection, java.util.List
|
|
public int size() {
|
|
return a.z(a.this);
|
|
}
|
|
}
|
|
|
|
a(u<K, V> uVar, Object[] objArr, int i10, int i11) {
|
|
this.f21735l = uVar;
|
|
this.f21736m = objArr;
|
|
this.f21737n = i10;
|
|
this.f21738o = i11;
|
|
}
|
|
|
|
static /* synthetic */ Object[] A(a aVar) {
|
|
return aVar.f21736m;
|
|
}
|
|
|
|
static /* synthetic */ int B(a aVar) {
|
|
return aVar.f21737n;
|
|
}
|
|
|
|
static /* synthetic */ int z(a aVar) {
|
|
return aVar.f21738o;
|
|
}
|
|
|
|
@Override // ra.q
|
|
int c(Object[] objArr, int i10) {
|
|
return a().c(objArr, i10);
|
|
}
|
|
|
|
@Override // ra.q, java.util.AbstractCollection, java.util.Collection, java.util.Set
|
|
public boolean contains(Object obj) {
|
|
if (!(obj instanceof Map.Entry)) {
|
|
return false;
|
|
}
|
|
Map.Entry entry = (Map.Entry) obj;
|
|
Object key = entry.getKey();
|
|
Object value = entry.getValue();
|
|
return value != null && value.equals(this.f21735l.get(key));
|
|
}
|
|
|
|
@Override // ra.q
|
|
boolean i() {
|
|
return true;
|
|
}
|
|
|
|
@Override // ra.w, ra.q
|
|
/* renamed from: k */
|
|
public u0<Map.Entry<K, V>> iterator() {
|
|
return a().iterator();
|
|
}
|
|
|
|
@Override // ra.w
|
|
s<Map.Entry<K, V>> s() {
|
|
return new C0378a();
|
|
}
|
|
|
|
@Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
|
|
public int size() {
|
|
return this.f21738o;
|
|
}
|
|
}
|
|
|
|
/* compiled from: RegularImmutableMap.java */
|
|
/* loaded from: classes4.dex */
|
|
static final class b<K> extends w<K> {
|
|
|
|
/* renamed from: l reason: collision with root package name */
|
|
private final transient u<K, ?> f21740l;
|
|
|
|
/* renamed from: m reason: collision with root package name */
|
|
private final transient s<K> f21741m;
|
|
|
|
b(u<K, ?> uVar, s<K> sVar) {
|
|
this.f21740l = uVar;
|
|
this.f21741m = sVar;
|
|
}
|
|
|
|
@Override // ra.w, ra.q
|
|
public s<K> a() {
|
|
return this.f21741m;
|
|
}
|
|
|
|
@Override // ra.q
|
|
int c(Object[] objArr, int i10) {
|
|
return a().c(objArr, i10);
|
|
}
|
|
|
|
@Override // ra.q, java.util.AbstractCollection, java.util.Collection, java.util.Set
|
|
public boolean contains(Object obj) {
|
|
return this.f21740l.get(obj) != null;
|
|
}
|
|
|
|
@Override // ra.q
|
|
boolean i() {
|
|
return true;
|
|
}
|
|
|
|
@Override // ra.w, ra.q
|
|
/* renamed from: k */
|
|
public u0<K> iterator() {
|
|
return a().iterator();
|
|
}
|
|
|
|
@Override // java.util.AbstractCollection, java.util.Collection, java.util.Set
|
|
public int size() {
|
|
return this.f21740l.size();
|
|
}
|
|
}
|
|
|
|
/* compiled from: RegularImmutableMap.java */
|
|
/* loaded from: classes4.dex */
|
|
static final class c extends s<Object> {
|
|
|
|
/* renamed from: l reason: collision with root package name */
|
|
private final transient Object[] f21742l;
|
|
|
|
/* renamed from: m reason: collision with root package name */
|
|
private final transient int f21743m;
|
|
|
|
/* renamed from: n reason: collision with root package name */
|
|
private final transient int f21744n;
|
|
|
|
c(Object[] objArr, int i10, int i11) {
|
|
this.f21742l = objArr;
|
|
this.f21743m = i10;
|
|
this.f21744n = i11;
|
|
}
|
|
|
|
@Override // java.util.List
|
|
public Object get(int i10) {
|
|
h.h(i10, this.f21744n);
|
|
return this.f21742l[(i10 * 2) + this.f21743m];
|
|
}
|
|
|
|
@Override // ra.q
|
|
boolean i() {
|
|
return true;
|
|
}
|
|
|
|
@Override // java.util.AbstractCollection, java.util.Collection, java.util.List
|
|
public int size() {
|
|
return this.f21744n;
|
|
}
|
|
}
|
|
|
|
private m0(Object obj, Object[] objArr, int i10) {
|
|
this.f21732n = obj;
|
|
this.f21733o = objArr;
|
|
this.f21734p = i10;
|
|
}
|
|
|
|
static <K, V> m0<K, V> m(int i10, Object[] objArr) {
|
|
if (i10 == 0) {
|
|
return (m0) f21731q;
|
|
}
|
|
if (i10 == 1) {
|
|
i.a(objArr[0], objArr[1]);
|
|
return new m0<>(null, objArr, 1);
|
|
}
|
|
h.l(i10, objArr.length >> 1);
|
|
return new m0<>(n(objArr, i10, w.m(i10), 0), objArr, i10);
|
|
}
|
|
|
|
/* JADX WARN: Code restructure failed: missing block: B:13:0x0039, code lost:
|
|
r11[r5] = (byte) r1;
|
|
r2 = r2 + 1;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:27:0x0079, code lost:
|
|
r11[r5] = (short) r1;
|
|
r2 = r2 + 1;
|
|
*/
|
|
/* JADX WARN: Code restructure failed: missing block: B:39:0x00b0, code lost:
|
|
r11[r6] = r1;
|
|
r2 = r2 + 1;
|
|
*/
|
|
/*
|
|
Code decompiled incorrectly, please refer to instructions dump.
|
|
*/
|
|
static Object n(Object[] objArr, int i10, int i11, int i12) {
|
|
if (i10 == 1) {
|
|
i.a(objArr[i12], objArr[i12 ^ 1]);
|
|
return null;
|
|
}
|
|
int i13 = i11 - 1;
|
|
int i14 = 0;
|
|
if (i11 <= 128) {
|
|
byte[] bArr = new byte[i11];
|
|
Arrays.fill(bArr, (byte) -1);
|
|
while (i14 < i10) {
|
|
int i15 = (i14 * 2) + i12;
|
|
Object obj = objArr[i15];
|
|
Object obj2 = objArr[i15 ^ 1];
|
|
i.a(obj, obj2);
|
|
int b10 = p.b(obj.hashCode());
|
|
while (true) {
|
|
int i16 = b10 & i13;
|
|
int i17 = bArr[i16] & 255;
|
|
if (i17 == 255) {
|
|
break;
|
|
} else if (!objArr[i17].equals(obj)) {
|
|
b10 = i16 + 1;
|
|
} else {
|
|
throw o(obj, obj2, objArr, i17);
|
|
}
|
|
}
|
|
}
|
|
return bArr;
|
|
} else if (i11 <= 32768) {
|
|
short[] sArr = new short[i11];
|
|
Arrays.fill(sArr, (short) -1);
|
|
while (i14 < i10) {
|
|
int i18 = (i14 * 2) + i12;
|
|
Object obj3 = objArr[i18];
|
|
Object obj4 = objArr[i18 ^ 1];
|
|
i.a(obj3, obj4);
|
|
int b11 = p.b(obj3.hashCode());
|
|
while (true) {
|
|
int i19 = b11 & i13;
|
|
int i20 = sArr[i19] & 65535;
|
|
if (i20 == 65535) {
|
|
break;
|
|
} else if (!objArr[i20].equals(obj3)) {
|
|
b11 = i19 + 1;
|
|
} else {
|
|
throw o(obj3, obj4, objArr, i20);
|
|
}
|
|
}
|
|
}
|
|
return sArr;
|
|
} else {
|
|
int[] iArr = new int[i11];
|
|
Arrays.fill(iArr, -1);
|
|
while (i14 < i10) {
|
|
int i21 = (i14 * 2) + i12;
|
|
Object obj5 = objArr[i21];
|
|
Object obj6 = objArr[i21 ^ 1];
|
|
i.a(obj5, obj6);
|
|
int b12 = p.b(obj5.hashCode());
|
|
while (true) {
|
|
int i22 = b12 & i13;
|
|
int i23 = iArr[i22];
|
|
if (i23 == -1) {
|
|
break;
|
|
} else if (!objArr[i23].equals(obj5)) {
|
|
b12 = i22 + 1;
|
|
} else {
|
|
throw o(obj5, obj6, objArr, i23);
|
|
}
|
|
}
|
|
}
|
|
return iArr;
|
|
}
|
|
}
|
|
|
|
private static IllegalArgumentException o(Object obj, Object obj2, Object[] objArr, int i10) {
|
|
return new IllegalArgumentException("Multiple entries with same key: " + obj + "=" + obj2 + " and " + objArr[i10] + "=" + objArr[i10 ^ 1]);
|
|
}
|
|
|
|
static Object p(Object obj, Object[] objArr, int i10, int i11, Object obj2) {
|
|
if (obj2 == null) {
|
|
return null;
|
|
}
|
|
if (i10 == 1) {
|
|
if (objArr[i11].equals(obj2)) {
|
|
return objArr[i11 ^ 1];
|
|
}
|
|
return null;
|
|
} else if (obj == null) {
|
|
return null;
|
|
} else {
|
|
if (obj instanceof byte[]) {
|
|
byte[] bArr = (byte[]) obj;
|
|
int length = bArr.length - 1;
|
|
int b10 = p.b(obj2.hashCode());
|
|
while (true) {
|
|
int i12 = b10 & length;
|
|
int i13 = bArr[i12] & 255;
|
|
if (i13 == 255) {
|
|
return null;
|
|
}
|
|
if (objArr[i13].equals(obj2)) {
|
|
return objArr[i13 ^ 1];
|
|
}
|
|
b10 = i12 + 1;
|
|
}
|
|
} else if (obj instanceof short[]) {
|
|
short[] sArr = (short[]) obj;
|
|
int length2 = sArr.length - 1;
|
|
int b11 = p.b(obj2.hashCode());
|
|
while (true) {
|
|
int i14 = b11 & length2;
|
|
int i15 = sArr[i14] & 65535;
|
|
if (i15 == 65535) {
|
|
return null;
|
|
}
|
|
if (objArr[i15].equals(obj2)) {
|
|
return objArr[i15 ^ 1];
|
|
}
|
|
b11 = i14 + 1;
|
|
}
|
|
} else {
|
|
int[] iArr = (int[]) obj;
|
|
int length3 = iArr.length - 1;
|
|
int b12 = p.b(obj2.hashCode());
|
|
while (true) {
|
|
int i16 = b12 & length3;
|
|
int i17 = iArr[i16];
|
|
if (i17 == -1) {
|
|
return null;
|
|
}
|
|
if (objArr[i17].equals(obj2)) {
|
|
return objArr[i17 ^ 1];
|
|
}
|
|
b12 = i16 + 1;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
@Override // ra.u
|
|
w<Map.Entry<K, V>> d() {
|
|
return new a(this, this.f21733o, 0, this.f21734p);
|
|
}
|
|
|
|
@Override // ra.u
|
|
w<K> e() {
|
|
return new b(this, new c(this.f21733o, 0, this.f21734p));
|
|
}
|
|
|
|
@Override // ra.u
|
|
q<V> f() {
|
|
return new c(this.f21733o, 1, this.f21734p);
|
|
}
|
|
|
|
@Override // ra.u, java.util.Map
|
|
public V get(Object obj) {
|
|
return (V) p(this.f21732n, this.f21733o, this.f21734p, 0, obj);
|
|
}
|
|
|
|
@Override // ra.u
|
|
boolean i() {
|
|
return false;
|
|
}
|
|
|
|
@Override // java.util.Map
|
|
public int size() {
|
|
return this.f21734p;
|
|
}
|
|
}
|