package com.google.android.gms.internal.measurement; import androidx.media3.exoplayer.rtsp.SessionDescription; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Iterator; import java.util.List; import java.util.Map; import java.util.TreeMap; /* JADX INFO: loaded from: classes2.dex */ public final class e implements i, n, Iterable { /* JADX INFO: renamed from: a, reason: collision with root package name */ public final TreeMap f20168a; /* JADX INFO: renamed from: b, reason: collision with root package name */ public final TreeMap f20169b; public e() { this.f20168a = new TreeMap(); this.f20169b = new TreeMap(); } @Override // com.google.android.gms.internal.measurement.i public final void c(String str, n nVar) { TreeMap treeMap = this.f20169b; if (nVar == null) { treeMap.remove(str); } else { treeMap.put(str, nVar); } } public final boolean equals(Object obj) { if (obj == this) { return true; } if (!(obj instanceof e)) { return false; } e eVar = (e) obj; if (j() != eVar.j()) { return false; } TreeMap treeMap = this.f20168a; if (treeMap.isEmpty()) { return eVar.f20168a.isEmpty(); } for (int iIntValue = ((Integer) treeMap.firstKey()).intValue(); iIntValue <= ((Integer) treeMap.lastKey()).intValue(); iIntValue++) { if (!h(iIntValue).equals(eVar.h(iIntValue))) { return false; } } return true; } @Override // com.google.android.gms.internal.measurement.i public final boolean f(String str) { return SessionDescription.ATTR_LENGTH.equals(str) || this.f20169b.containsKey(str); } /* JADX WARN: Can't fix incorrect switch cases order, some code will duplicate */ /* JADX WARN: Code restructure failed: missing block: B:202:0x03dc, code lost: if (com.google.android.gms.internal.measurement.y5.f(r27, r29, (com.google.android.gms.internal.measurement.o) r0, java.lang.Boolean.FALSE, java.lang.Boolean.TRUE).j() != j()) goto L203; */ /* JADX WARN: Multi-variable type inference failed */ /* JADX WARN: Removed duplicated region for block: B:102:0x019c */ /* JADX WARN: Removed duplicated region for block: B:106:0x01a8 */ /* JADX WARN: Removed duplicated region for block: B:110:0x01b4 */ /* JADX WARN: Removed duplicated region for block: B:113:0x01be A[PHI: r3 r4 r23 0x01be: PHI (r3v9 java.lang.String) = (r3v5 java.lang.String), (r3v6 java.lang.String), (r3v10 java.lang.String) binds: [B:128:0x01ff, B:124:0x01ed, B:112:0x01bc] A[DONT_GENERATE, DONT_INLINE] 0x01be: PHI (r4v8 java.lang.String) = (r4v3 java.lang.String), (r4v4 java.lang.String), (r4v9 java.lang.String) binds: [B:128:0x01ff, B:124:0x01ed, B:112:0x01bc] A[DONT_GENERATE, DONT_INLINE] 0x01be: PHI (r23v6 byte) = (r23v0 byte), (r23v0 byte), (r23v7 byte) binds: [B:128:0x01ff, B:124:0x01ed, B:112:0x01bc] A[DONT_GENERATE, DONT_INLINE]] */ /* JADX WARN: Removed duplicated region for block: B:115:0x01c5 */ /* JADX WARN: Removed duplicated region for block: B:119:0x01d3 */ /* JADX WARN: Removed duplicated region for block: B:123:0x01e5 */ /* JADX WARN: Removed duplicated region for block: B:127:0x01f5 */ /* JADX WARN: Removed duplicated region for block: B:131:0x0207 */ /* JADX WARN: Removed duplicated region for block: B:137:0x0235 */ /* JADX WARN: Removed duplicated region for block: B:139:0x023d */ /* JADX WARN: Removed duplicated region for block: B:161:0x02d1 */ /* JADX WARN: Removed duplicated region for block: B:174:0x0309 */ /* JADX WARN: Removed duplicated region for block: B:175:0x0314 */ /* JADX WARN: Removed duplicated region for block: B:192:0x0393 */ /* JADX WARN: Removed duplicated region for block: B:197:0x03ad */ /* JADX WARN: Removed duplicated region for block: B:207:0x03ec */ /* JADX WARN: Removed duplicated region for block: B:221:0x0444 */ /* JADX WARN: Removed duplicated region for block: B:236:0x04b5 */ /* JADX WARN: Removed duplicated region for block: B:243:0x04e7 */ /* JADX WARN: Removed duplicated region for block: B:257:0x0528 */ /* JADX WARN: Removed duplicated region for block: B:261:0x0541 */ /* JADX WARN: Removed duplicated region for block: B:269:0x0574 */ /* JADX WARN: Removed duplicated region for block: B:288:0x05ff */ /* JADX WARN: Removed duplicated region for block: B:314:0x06a4 */ /* JADX WARN: Removed duplicated region for block: B:322:0x06d1 */ /* JADX WARN: Removed duplicated region for block: B:366:0x07d3 */ /* JADX WARN: Removed duplicated region for block: B:367:0x07de */ /* JADX WARN: Removed duplicated region for block: B:379:0x083d */ /* JADX WARN: Removed duplicated region for block: B:395:0x089c */ /* JADX WARN: Removed duplicated region for block: B:53:0x011c A[PHI: r23 0x011c: PHI (r23v24 byte) = (r23v0 byte) (r23v0 byte) (r23v9 byte) (r23v0 byte) (r23v10 byte) (r23v0 byte) (r23v11 byte) (r23v0 byte) (r23v12 byte) (r23v0 byte) (r23v13 byte) (r23v0 byte) (r23v14 byte) (r23v0 byte) (r23v15 byte) (r23v0 byte) (r23v16 byte) (r23v0 byte) (r23v17 byte) (r23v0 byte) (r23v18 byte) (r23v0 byte) (r23v19 byte) (r23v0 byte) (r23v20 byte) (r23v0 byte) (r23v21 byte) (r23v0 byte) (r23v22 byte) binds: [B:52:0x0119, B:107:0x01ac, B:109:0x01b0, B:103:0x01a0, B:105:0x01a4, B:99:0x0196, B:101:0x0199, B:95:0x018c, B:97:0x018f, B:91:0x0182, B:93:0x0185, B:87:0x0178, B:89:0x017b, B:83:0x016e, B:85:0x0171, B:79:0x0164, B:81:0x0167, B:75:0x015a, B:77:0x015d, B:71:0x0150, B:73:0x0153, B:67:0x0146, B:69:0x0149, B:63:0x013c, B:65:0x013f, B:59:0x0132, B:61:0x0135, B:55:0x0128, B:57:0x012b] A[DONT_GENERATE, DONT_INLINE]] */ /* JADX WARN: Removed duplicated region for block: B:54:0x0124 */ /* JADX WARN: Removed duplicated region for block: B:58:0x012e */ /* JADX WARN: Removed duplicated region for block: B:62:0x0138 */ /* JADX WARN: Removed duplicated region for block: B:66:0x0142 */ /* JADX WARN: Removed duplicated region for block: B:70:0x014c */ /* JADX WARN: Removed duplicated region for block: B:74:0x0156 */ /* JADX WARN: Removed duplicated region for block: B:78:0x0160 */ /* JADX WARN: Removed duplicated region for block: B:82:0x016a */ /* JADX WARN: Removed duplicated region for block: B:86:0x0174 */ /* JADX WARN: Removed duplicated region for block: B:90:0x017e */ /* JADX WARN: Removed duplicated region for block: B:94:0x0188 */ /* JADX WARN: Removed duplicated region for block: B:98:0x0192 */ /* JADX WARN: Type inference failed for: r0v91, types: [com.google.android.gms.internal.measurement.n] */ /* JADX WARN: Type inference failed for: r28v0, types: [java.lang.Object, java.lang.String] */ /* JADX WARN: Type inference failed for: r2v104 */ /* JADX WARN: Type inference failed for: r2v106, types: [com.google.android.gms.internal.measurement.n] */ /* JADX WARN: Type inference failed for: r2v72, types: [com.google.android.gms.internal.measurement.n] */ /* JADX WARN: Type inference failed for: r2v8, types: [com.google.android.gms.internal.measurement.e] */ @Override // com.google.android.gms.internal.measurement.n /* Code decompiled incorrectly, please refer to instructions dump. */ public final n g(String str, u.e eVar, ArrayList arrayList) { String str2; String str3; String str4; Object obj; Object obj2; String str5; String str6; String str7; String str8; byte b10; String str9; String str10; String str11; ?? H; String strZzf; j jVar; u.e eVar2; n nVarQ; String str12 = "toString"; if (!"concat".equals(str) && !"every".equals(str) && !"filter".equals(str) && !"forEach".equals(str) && !"indexOf".equals(str) && !"join".equals(str) && !"lastIndexOf".equals(str) && !"map".equals(str) && !"pop".equals(str) && !"push".equals(str) && !"reduce".equals(str) && !"reduceRight".equals(str) && !"reverse".equals(str) && !"shift".equals(str) && !"slice".equals(str)) { str2 = "some"; if (!str2.equals(str)) { str4 = "sort"; if (str4.equals(str)) { obj = "splice"; obj2 = "reduce"; str5 = "map"; } else if ("splice".equals(str)) { obj2 = "reduce"; str5 = "map"; obj = "splice"; } else { if (str12.equals(str)) { str12 = str12; str7 = "unshift"; } else { str12 = str12; str7 = "unshift"; if (!str7.equals(str)) { return y5.h(this, new p(str), eVar, arrayList); } } str8 = "filter"; str3 = "pop"; obj = "splice"; str6 = "lastIndexOf"; obj2 = "reduce"; str5 = "map"; } str6 = "lastIndexOf"; str7 = "unshift"; str8 = "filter"; str3 = "pop"; } b10 = -1; switch (str.hashCode()) { case -1776922004: str9 = str8; str10 = str12; str11 = "forEach"; if (str.equals(str10)) { b10 = 0; } break; case -1354795244: str9 = str8; str11 = "forEach"; if (str.equals("concat")) { str10 = str12; b10 = 1; } else { str10 = str12; } break; case -1274492040: str9 = str8; str11 = "forEach"; if (str.equals(str9)) { str10 = str12; b10 = 2; break; } break; case -934873754: str11 = "forEach"; if (str.equals(obj2)) { str9 = str8; str10 = str12; b10 = 3; } str9 = str8; str10 = str12; break; case -895859076: str11 = "forEach"; if (str.equals(obj)) { b10 = 4; } str9 = str8; str10 = str12; break; case -678635926: str11 = "forEach"; if (str.equals(str11)) { b10 = 5; } str9 = str8; str10 = str12; break; case -467511597: if (str.equals(str6)) { b10 = 6; } str9 = str8; str10 = str12; str11 = "forEach"; break; case -277637751: if (str.equals(str7)) { b10 = 7; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 107868: if (str.equals(str5)) { b10 = 8; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 111185: if (str.equals(str3)) { b10 = 9; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 3267882: if (str.equals("join")) { b10 = 10; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 3452698: if (str.equals("push")) { b10 = 11; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 3536116: if (str.equals(str2)) { b10 = 12; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 3536286: if (str.equals(str4)) { b10 = 13; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 96891675: if (str.equals("every")) { b10 = 14; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 109407362: if (str.equals("shift")) { b10 = 15; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 109526418: if (str.equals("slice")) { b10 = 16; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 965561430: if (str.equals("reduceRight")) { b10 = 17; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 1099846370: if (str.equals("reverse")) { b10 = 18; } str9 = str8; str10 = str12; str11 = "forEach"; break; case 1943291465: if (str.equals("indexOf")) { b10 = 19; } str9 = str8; str10 = str12; str11 = "forEach"; break; default: str9 = str8; str10 = str12; str11 = "forEach"; break; } t tVar = n.f20321v; f fVar = n.A; f fVar2 = n.B; TreeMap treeMap = this.f20168a; String str13 = str10; String str14 = str9; String str15 = str2; double dJ = 0.0d; switch (b10) { case 0: y5.p(0, arrayList, str13); return new p(k(",")); case 1: H = (e) zzc(); if (!arrayList.isEmpty()) { Iterator it = arrayList.iterator(); while (it.hasNext()) { n nVarQ2 = eVar.q((n) it.next()); if (nVarQ2 instanceof h) { throw new IllegalStateException("Failed evaluation of arguments"); } int iJ = H.j(); if (nVarQ2 instanceof e) { e eVar3 = (e) nVarQ2; Iterator itP = eVar3.p(); while (itP.hasNext()) { Integer num = (Integer) itP.next(); H.m(num.intValue() + iJ, eVar3.h(num.intValue())); } } else { H.m(iJ, nVarQ2); } } } return H; case 2: y5.p(1, arrayList, str14); n nVarQ3 = eVar.q((n) arrayList.get(0)); if (!(nVarQ3 instanceof o)) { throw new IllegalArgumentException("Callback should be a method"); } if (treeMap.size() == 0) { return new e(); } e eVar4 = (e) zzc(); e eVarF = y5.f(this, eVar, (o) nVarQ3, null, Boolean.TRUE); e eVar5 = new e(); Iterator itP2 = eVarF.p(); while (itP2.hasNext()) { eVar5.i(eVar4.h(((Integer) itP2.next()).intValue())); } return eVar5; case 3: return y5.g(this, eVar, arrayList, true); case 4: if (arrayList.isEmpty()) { return new e(); } int iA = (int) y5.a(eVar.q((n) arrayList.get(0)).zze().doubleValue()); if (iA < 0) { iA = Math.max(0, j() + iA); } else if (iA > j()) { iA = j(); } int iJ2 = j(); e eVar6 = new e(); if (arrayList.size() > 1) { int iMax = Math.max(0, (int) y5.a(eVar.q((n) arrayList.get(1)).zze().doubleValue())); if (iMax > 0) { for (int i10 = iA; i10 < Math.min(iJ2, iA + iMax); i10++) { eVar6.i(h(iA)); l(iA); } } if (arrayList.size() > 2) { for (int i11 = 2; i11 < arrayList.size(); i11++) { n nVarQ4 = eVar.q((n) arrayList.get(i11)); if (nVarQ4 instanceof h) { throw new IllegalArgumentException("Failed to parse elements to add"); } int i12 = (iA + i11) - 2; if (i12 < 0) { throw new IllegalArgumentException(com.google.android.gms.measurement.internal.u1.g("Invalid value index: ", i12)); } if (i12 >= j()) { m(i12, nVarQ4); } else { for (int iIntValue = ((Integer) treeMap.lastKey()).intValue(); iIntValue >= i12; iIntValue--) { n nVar = (n) treeMap.get(Integer.valueOf(iIntValue)); if (nVar != null) { m(iIntValue + 1, nVar); treeMap.remove(Integer.valueOf(iIntValue)); } } m(i12, nVarQ4); } } } } else { while (iA < iJ2) { eVar6.i(h(iA)); m(iA, null); iA++; } } return eVar6; case 5: y5.p(1, arrayList, str11); n nVarQ5 = eVar.q((n) arrayList.get(0)); if (!(nVarQ5 instanceof o)) { throw new IllegalArgumentException("Callback should be a method"); } if (treeMap.size() != 0) { y5.f(this, eVar, (o) nVarQ5, null, null); } return tVar; case 6: y5.O(2, arrayList, str6); n nVarQ6 = !arrayList.isEmpty() ? eVar.q((n) arrayList.get(0)) : tVar; double dJ2 = j() - 1; if (arrayList.size() > 1) { n nVarQ7 = eVar.q((n) arrayList.get(1)); dJ2 = Double.isNaN(nVarQ7.zze().doubleValue()) ? j() - 1 : y5.a(nVarQ7.zze().doubleValue()); if (dJ2 < 0.0d) { dJ2 += (double) j(); } } if (dJ2 < 0.0d) { return new g(Double.valueOf(-1.0d)); } for (int iMin = (int) Math.min(j(), dJ2); iMin >= 0; iMin--) { if (o(iMin) && y5.y(h(iMin), nVarQ6)) { return new g(Double.valueOf(iMin)); } } return new g(Double.valueOf(-1.0d)); case 7: if (!arrayList.isEmpty()) { e eVar7 = new e(); Iterator it2 = arrayList.iterator(); while (it2.hasNext()) { n nVarQ8 = eVar.q((n) it2.next()); if (nVarQ8 instanceof h) { throw new IllegalStateException("Argument evaluation failed"); } eVar7.i(nVarQ8); } int iJ3 = eVar7.j(); Iterator itP3 = p(); while (itP3.hasNext()) { Integer num2 = (Integer) itP3.next(); eVar7.m(num2.intValue() + iJ3, h(num2.intValue())); } treeMap.clear(); Iterator itP4 = eVar7.p(); while (itP4.hasNext()) { Integer num3 = (Integer) itP4.next(); m(num3.intValue(), eVar7.h(num3.intValue())); } } return new g(Double.valueOf(j())); case 8: y5.p(1, arrayList, str5); n nVarQ9 = eVar.q((n) arrayList.get(0)); if (nVarQ9 instanceof o) { return j() == 0 ? new e() : y5.f(this, eVar, (o) nVarQ9, null, null); } throw new IllegalArgumentException("Callback should be a method"); case 9: y5.p(0, arrayList, str3); int iJ4 = j(); if (iJ4 != 0) { int i13 = iJ4 - 1; H = h(i13); l(i13); return H; } return tVar; case 10: y5.O(1, arrayList, "join"); if (j() == 0) { return n.C; } if (arrayList.isEmpty()) { strZzf = ","; } else { n nVarQ10 = eVar.q((n) arrayList.get(0)); strZzf = ((nVarQ10 instanceof l) || (nVarQ10 instanceof t)) ? "" : nVarQ10.zzf(); } return new p(k(strZzf)); case 11: if (!arrayList.isEmpty()) { Iterator it3 = arrayList.iterator(); while (it3.hasNext()) { i(eVar.q((n) it3.next())); } } return new g(Double.valueOf(j())); case 12: y5.p(1, arrayList, str15); n nVarQ11 = eVar.q((n) arrayList.get(0)); if (!(nVarQ11 instanceof j)) { throw new IllegalArgumentException("Callback should be a method"); } if (j() != 0) { j jVar2 = (j) nVarQ11; Iterator itP5 = p(); while (itP5.hasNext()) { int iIntValue2 = ((Integer) itP5.next()).intValue(); if (o(iIntValue2) && jVar2.a(eVar, Arrays.asList(h(iIntValue2), new g(Double.valueOf(iIntValue2)), this)).zzd().booleanValue()) { return fVar; } } } return fVar2; case 13: y5.O(1, arrayList, str4); if (j() >= 2) { ArrayList arrayListQ = q(); if (arrayList.isEmpty()) { jVar = null; } else { n nVarQ12 = eVar.q((n) arrayList.get(0)); if (!(nVarQ12 instanceof j)) { throw new IllegalArgumentException("Comparator should be a method"); } jVar = (j) nVarQ12; } Collections.sort(arrayListQ, new z(jVar, eVar)); treeMap.clear(); Iterator it4 = arrayListQ.iterator(); int i14 = 0; while (it4.hasNext()) { m(i14, (n) it4.next()); i14++; } } return this; case 14: y5.p(1, arrayList, "every"); n nVarQ13 = eVar.q((n) arrayList.get(0)); if (!(nVarQ13 instanceof o)) { throw new IllegalArgumentException("Callback should be a method"); } if (j() != 0) { break; } return fVar; case 15: y5.p(0, arrayList, "shift"); if (j() != 0) { H = h(0); l(0); return H; } return tVar; case 16: y5.O(2, arrayList, "slice"); if (arrayList.isEmpty()) { return zzc(); } double dJ3 = j(); double dA = y5.a(eVar.q((n) arrayList.get(0)).zze().doubleValue()); double dMax = dA < 0.0d ? Math.max(dA + dJ3, 0.0d) : Math.min(dA, dJ3); if (arrayList.size() == 2) { double dA2 = y5.a(eVar.q((n) arrayList.get(1)).zze().doubleValue()); dJ3 = dA2 < 0.0d ? Math.max(dJ3 + dA2, 0.0d) : Math.min(dJ3, dA2); } e eVar8 = new e(); for (int i15 = (int) dMax; i15 < dJ3; i15++) { eVar8.i(h(i15)); } return eVar8; case 17: return y5.g(this, eVar, arrayList, false); case 18: y5.p(0, arrayList, "reverse"); int iJ5 = j(); if (iJ5 != 0) { for (int i16 = 0; i16 < iJ5 / 2; i16++) { if (o(i16)) { n nVarH = h(i16); m(i16, null); int i17 = (iJ5 - 1) - i16; if (o(i17)) { m(i16, h(i17)); } m(i17, nVarH); } } } return this; case 19: y5.O(2, arrayList, "indexOf"); if (arrayList.isEmpty()) { eVar2 = eVar; nVarQ = tVar; } else { eVar2 = eVar; nVarQ = eVar2.q((n) arrayList.get(0)); } if (arrayList.size() > 1) { double dA3 = y5.a(eVar2.q((n) arrayList.get(1)).zze().doubleValue()); if (dA3 >= j()) { return new g(Double.valueOf(-1.0d)); } dJ = dA3 < 0.0d ? ((double) j()) + dA3 : dA3; } Iterator itP6 = p(); while (itP6.hasNext()) { int iIntValue3 = ((Integer) itP6.next()).intValue(); double d10 = iIntValue3; if (d10 >= dJ && y5.y(h(iIntValue3), nVarQ)) { return new g(Double.valueOf(d10)); } } return new g(Double.valueOf(-1.0d)); default: throw new IllegalArgumentException("Command not supported"); } } str2 = "some"; str3 = "pop"; str4 = "sort"; obj = "splice"; obj2 = "reduce"; str5 = "map"; str6 = "lastIndexOf"; str7 = "unshift"; str8 = "filter"; b10 = -1; switch (str.hashCode()) { case -1776922004: break; case -1354795244: break; case -1274492040: break; case -934873754: break; case -895859076: break; case -678635926: break; case -467511597: break; case -277637751: break; case 107868: break; case 111185: break; case 3267882: break; case 3452698: break; case 3536116: break; case 3536286: break; case 96891675: break; case 109407362: break; case 109526418: break; case 965561430: break; case 1099846370: break; case 1943291465: break; } t tVar2 = n.f20321v; f fVar3 = n.A; f fVar22 = n.B; TreeMap treeMap2 = this.f20168a; String str132 = str10; String str142 = str9; String str152 = str2; double dJ4 = 0.0d; switch (b10) { } } public final n h(int i10) { n nVar; if (i10 < j()) { return (!o(i10) || (nVar = (n) this.f20168a.get(Integer.valueOf(i10))) == null) ? n.f20321v : nVar; } throw new IndexOutOfBoundsException("Attempting to get element outside of current array"); } public final int hashCode() { return this.f20168a.hashCode() * 31; } public final void i(n nVar) { m(j(), nVar); } @Override // java.lang.Iterable public final Iterator iterator() { return new r(this, 2); } public final int j() { TreeMap treeMap = this.f20168a; if (treeMap.isEmpty()) { return 0; } return ((Integer) treeMap.lastKey()).intValue() + 1; } public final String k(String str) { if (str == null) { str = ""; } StringBuilder sb = new StringBuilder(); if (!this.f20168a.isEmpty()) { for (int i10 = 0; i10 < j(); i10++) { n nVarH = h(i10); sb.append(str); if (!(nVarH instanceof t) && !(nVarH instanceof l)) { sb.append(nVarH.zzf()); } } sb.delete(0, str.length()); } return sb.toString(); } public final void l(int i10) { TreeMap treeMap = this.f20168a; int iIntValue = ((Integer) treeMap.lastKey()).intValue(); if (i10 > iIntValue || i10 < 0) { return; } treeMap.remove(Integer.valueOf(i10)); if (i10 == iIntValue) { int i11 = i10 - 1; if (treeMap.containsKey(Integer.valueOf(i11)) || i11 < 0) { return; } treeMap.put(Integer.valueOf(i11), n.f20321v); return; } while (true) { i10++; if (i10 > ((Integer) treeMap.lastKey()).intValue()) { return; } n nVar = (n) treeMap.get(Integer.valueOf(i10)); if (nVar != null) { treeMap.put(Integer.valueOf(i10 - 1), nVar); treeMap.remove(Integer.valueOf(i10)); } } } public final void m(int i10, n nVar) { if (i10 > 32468) { throw new IllegalStateException("Array too large"); } if (i10 < 0) { throw new IndexOutOfBoundsException(com.google.android.gms.measurement.internal.u1.g("Out of bounds index: ", i10)); } TreeMap treeMap = this.f20168a; if (nVar == null) { treeMap.remove(Integer.valueOf(i10)); } else { treeMap.put(Integer.valueOf(i10), nVar); } } public final boolean o(int i10) { if (i10 >= 0) { TreeMap treeMap = this.f20168a; if (i10 <= ((Integer) treeMap.lastKey()).intValue()) { return treeMap.containsKey(Integer.valueOf(i10)); } } throw new IndexOutOfBoundsException(com.google.android.gms.measurement.internal.u1.g("Out of bounds index: ", i10)); } public final Iterator p() { return this.f20168a.keySet().iterator(); } public final ArrayList q() { ArrayList arrayList = new ArrayList(j()); for (int i10 = 0; i10 < j(); i10++) { arrayList.add(h(i10)); } return arrayList; } public final String toString() { return k(","); } @Override // com.google.android.gms.internal.measurement.i public final n zza(String str) { n nVar; return SessionDescription.ATTR_LENGTH.equals(str) ? new g(Double.valueOf(j())) : (!f(str) || (nVar = (n) this.f20169b.get(str)) == null) ? n.f20321v : nVar; } @Override // com.google.android.gms.internal.measurement.n public final n zzc() { e eVar = new e(); for (Map.Entry entry : this.f20168a.entrySet()) { boolean z10 = entry.getValue() instanceof i; TreeMap treeMap = eVar.f20168a; if (z10) { treeMap.put((Integer) entry.getKey(), (n) entry.getValue()); } else { treeMap.put((Integer) entry.getKey(), ((n) entry.getValue()).zzc()); } } return eVar; } @Override // com.google.android.gms.internal.measurement.n public final Boolean zzd() { return Boolean.TRUE; } @Override // com.google.android.gms.internal.measurement.n public final Double zze() { TreeMap treeMap = this.f20168a; return treeMap.size() == 1 ? h(0).zze() : treeMap.size() <= 0 ? Double.valueOf(0.0d) : Double.valueOf(Double.NaN); } @Override // com.google.android.gms.internal.measurement.n public final String zzf() { return k(","); } @Override // com.google.android.gms.internal.measurement.n public final Iterator zzh() { return new d(this.f20168a.keySet().iterator(), this.f20169b.keySet().iterator()); } public e(List list) { this(); if (list != null) { for (int i10 = 0; i10 < list.size(); i10++) { m(i10, (n) list.get(i10)); } } } public e(n... nVarArr) { this(Arrays.asList(nVarArr)); } }