package n;

import o.AbstractC2628a;
import x4.AbstractC3250p;

/* JADX INFO: renamed from: n.D, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes.dex */
public final class C2569D {

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public long[] f21319a = Y.f21386a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public long[] f21320b = AbstractC2591s.f21473a;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public Object[] f21321c = AbstractC2628a.f21782c;

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    public int f21322d;

    /* JADX INFO: renamed from: e, reason: collision with root package name */
    public int f21323e;

    /* JADX INFO: renamed from: f, reason: collision with root package name */
    public int f21324f;

    public C2569D(int i6) {
        if (i6 >= 0) {
            e(Y.d(i6));
        } else {
            AbstractC2628a.c("Capacity must be a positive value.");
            throw null;
        }
    }

    public final void a() {
        this.f21323e = 0;
        long[] jArr = this.f21319a;
        if (jArr != Y.f21386a) {
            AbstractC3250p.I(jArr, -9187201950435737472L);
            long[] jArr2 = this.f21319a;
            int i6 = this.f21322d;
            int i7 = i6 >> 3;
            long j4 = 255 << ((i6 & 7) << 3);
            jArr2[i7] = (jArr2[i7] & (~j4)) | j4;
        }
        AbstractC3250p.H(this.f21321c, null, 0, this.f21322d);
        this.f21324f = Y.a(this.f21322d) - this.f21323e;
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x0066, code lost:
    
        if (((r6 & ((~r6) << 6)) & (-9187201950435737472L)) == 0) goto L16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0068, code lost:
    
        r10 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean b(long j4) {
        int iNumberOfTrailingZeros;
        int iHashCode = Long.hashCode(j4) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21322d;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21319a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j6 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j7 = (((long) i7) * 72340172838076673L) ^ j6;
            long j8 = (~j7) & (j7 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j8 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i9) & i8;
                if (this.f21320b[iNumberOfTrailingZeros] == j4) {
                    break loop0;
                }
                j8 &= j8 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        return iNumberOfTrailingZeros >= 0;
    }

    public final int c(int i6) {
        int i7 = this.f21322d;
        int i8 = i6 & i7;
        int i9 = 0;
        while (true) {
            long[] jArr = this.f21319a;
            int i10 = i8 >> 3;
            int i11 = (i8 & 7) << 3;
            long j4 = ((jArr[i10 + 1] << (64 - i11)) & ((-i11) >> 63)) | (jArr[i10] >>> i11);
            long j6 = j4 & ((~j4) << 7) & (-9187201950435737472L);
            if (j6 != 0) {
                return (i8 + (Long.numberOfTrailingZeros(j6) >> 3)) & i7;
            }
            i9 += 8;
            i8 = (i8 + i9) & i7;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x0063, code lost:
    
        if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0065, code lost:
    
        r10 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final Object d(long j4) {
        int iNumberOfTrailingZeros;
        int iHashCode = Long.hashCode(j4) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21322d;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21319a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j6 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j7 = (((long) i7) * 72340172838076673L) ^ j6;
            long j8 = (~j7) & (j7 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j8 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i9) & i8;
                if (this.f21320b[iNumberOfTrailingZeros] == j4) {
                    break loop0;
                }
                j8 &= j8 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        if (iNumberOfTrailingZeros >= 0) {
            return this.f21321c[iNumberOfTrailingZeros];
        }
        return null;
    }

    public final void e(int i6) {
        long[] jArr;
        int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0;
        this.f21322d = iMax;
        if (iMax == 0) {
            jArr = Y.f21386a;
        } else {
            jArr = new long[((iMax + 15) & (-8)) >> 3];
            AbstractC3250p.I(jArr, -9187201950435737472L);
        }
        this.f21319a = jArr;
        int i7 = iMax >> 3;
        long j4 = 255 << ((iMax & 7) << 3);
        jArr[i7] = (jArr[i7] & (~j4)) | j4;
        this.f21324f = Y.a(this.f21322d) - this.f21323e;
        this.f21320b = new long[iMax];
        this.f21321c = new Object[iMax];
    }

    /* JADX WARN: Code restructure failed: missing block: B:26:0x0060, code lost:
    
        return false;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean equals(Object obj) {
        boolean z6;
        long[] jArr;
        boolean z7;
        long[] jArr2;
        boolean z8 = true;
        if (obj == this) {
            return true;
        }
        if (!(obj instanceof C2569D)) {
            return false;
        }
        C2569D c2569d = (C2569D) obj;
        if (c2569d.f21323e != this.f21323e) {
            return false;
        }
        long[] jArr3 = this.f21320b;
        Object[] objArr = this.f21321c;
        long[] jArr4 = this.f21319a;
        int length = jArr4.length - 2;
        if (length < 0) {
            return true;
        }
        int i6 = 0;
        loop0: while (true) {
            long j4 = jArr4[i6];
            if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                int i7 = 8 - ((~(i6 - length)) >>> 31);
                int i8 = 0;
                while (i8 < i7) {
                    if ((255 & j4) < 128) {
                        int i9 = (i6 << 3) + i8;
                        z7 = z8;
                        jArr2 = jArr3;
                        long j6 = jArr2[i9];
                        Object obj2 = objArr[i9];
                        if (obj2 == null) {
                            if (c2569d.d(j6) != null || !c2569d.b(j6)) {
                                break loop0;
                            }
                        } else if (!obj2.equals(c2569d.d(j6))) {
                            return false;
                        }
                    } else {
                        z7 = z8;
                        jArr2 = jArr3;
                    }
                    j4 >>= 8;
                    i8++;
                    z8 = z7;
                    jArr3 = jArr2;
                }
                z6 = z8;
                jArr = jArr3;
                if (i7 != 8) {
                    return z6;
                }
            } else {
                z6 = z8;
                jArr = jArr3;
            }
            if (i6 == length) {
                return z6;
            }
            i6++;
            z8 = z6;
            jArr3 = jArr;
        }
    }

    /* JADX WARN: Code restructure failed: missing block: B:11:0x0063, code lost:
    
        if (((r4 & ((~r4) << 6)) & (-9187201950435737472L)) == 0) goto L18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0065, code lost:
    
        r10 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final Object f(long j4) {
        int iNumberOfTrailingZeros;
        int iHashCode = Long.hashCode(j4) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21322d;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21319a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j6 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j7 = (((long) i7) * 72340172838076673L) ^ j6;
            long j8 = (~j7) & (j7 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j8 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j8) >> 3) + i9) & i8;
                if (this.f21320b[iNumberOfTrailingZeros] == j4) {
                    break loop0;
                }
                j8 &= j8 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        if (iNumberOfTrailingZeros < 0) {
            return null;
        }
        this.f21323e--;
        long[] jArr2 = this.f21319a;
        int i13 = this.f21322d;
        int i14 = iNumberOfTrailingZeros >> 3;
        int i15 = (iNumberOfTrailingZeros & 7) << 3;
        long j9 = (jArr2[i14] & (~(255 << i15))) | (254 << i15);
        jArr2[i14] = j9;
        jArr2[(((iNumberOfTrailingZeros - 7) & i13) + (i13 & 7)) >> 3] = j9;
        Object[] objArr = this.f21321c;
        Object obj = objArr[iNumberOfTrailingZeros];
        objArr[iNumberOfTrailingZeros] = null;
        return obj;
    }

    /* JADX WARN: Code restructure failed: missing block: B:10:0x006c, code lost:
    
        r19 = r2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:11:0x0077, code lost:
    
        if (((((~r8) << 6) & r8) & (-9187201950435737472L)) == 0) goto L58;
     */
    /* JADX WARN: Code restructure failed: missing block: B:12:0x0079, code lost:
    
        r1 = c(r3);
     */
    /* JADX WARN: Code restructure failed: missing block: B:13:0x0081, code lost:
    
        if (r38.f21324f != 0) goto L16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:15:0x0095, code lost:
    
        if (((r38.f21319a[r1 >> 3] >> ((r1 & 7) << 3)) & 255) != 254) goto L17;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0097, code lost:
    
        r31 = r10;
        r29 = 0;
        r18 = 1;
        r27 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:17:0x00a3, code lost:
    
        r1 = r38.f21322d;
     */
    /* JADX WARN: Code restructure failed: missing block: B:18:0x00a5, code lost:
    
        if (r1 <= 8) goto L43;
     */
    /* JADX WARN: Code restructure failed: missing block: B:19:0x00a7, code lost:
    
        r9 = 7;
     */
    /* JADX WARN: Code restructure failed: missing block: B:20:0x00be, code lost:
    
        if (java.lang.Long.compare((((long) r38.f21323e) * 32) ^ Long.MIN_VALUE, (((long) r1) * 25) ^ Long.MIN_VALUE) > 0) goto L41;
     */
    /* JADX WARN: Code restructure failed: missing block: B:21:0x00c0, code lost:
    
        r1 = r38.f21319a;
        r2 = r38.f21322d;
        r4 = r38.f21320b;
        r5 = r38.f21321c;
        r6 = (r2 + 7) >> 3;
        r7 = 0;
        r27 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:22:0x00d1, code lost:
    
        if (r7 >= r6) goto L62;
     */
    /* JADX WARN: Code restructure failed: missing block: B:23:0x00d3, code lost:
    
        r8 = r9;
        r9 = r1[r7] & (-9187201950435737472L);
        r1[r7] = (-72340172838076674L) & ((~r9) + (r9 >>> r8));
        r7 = r7 + 1;
        r9 = r8;
        r13 = r13;
        r12 = r12;
        r10 = r10;
     */
    /* JADX WARN: Code restructure failed: missing block: B:24:0x00f1, code lost:
    
        r8 = r9;
        r31 = r10;
        r29 = r12;
        r11 = r13;
        r6 = x4.AbstractC3250p.N(r1);
        r7 = r6 - 1;
        r12 = 72057594037927935L;
        r1[r7] = (r1[r7] & 72057594037927935L) | (-72057594037927936L);
        r1[r6] = r1[r29];
        r6 = r29;
     */
    /* JADX WARN: Code restructure failed: missing block: B:25:0x0110, code lost:
    
        if (r6 == r2) goto L63;
     */
    /* JADX WARN: Code restructure failed: missing block: B:26:0x0112, code lost:
    
        r7 = r6 >> 3;
        r14 = (r6 & 7) << 3;
        r9 = (r1[r7] >> r14) & 255;
     */
    /* JADX WARN: Code restructure failed: missing block: B:27:0x011f, code lost:
    
        if (r9 != 128) goto L29;
     */
    /* JADX WARN: Code restructure failed: missing block: B:28:0x0121, code lost:
    
        r6 = r6 + 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:30:0x0126, code lost:
    
        if (r9 == 254) goto L64;
     */
    /* JADX WARN: Code restructure failed: missing block: B:32:0x0129, code lost:
    
        r9 = java.lang.Long.hashCode(r4[r6]) * r19;
        r9 = r9 ^ (r9 << 16);
        r10 = r9 >>> 7;
        r15 = c(r10);
        r10 = r10 & r2;
        r30 = r8;
     */
    /* JADX WARN: Code restructure failed: missing block: B:33:0x0148, code lost:
    
        if ((((r15 - r10) & r2) / 8) != (((r6 - r10) & r2) / 8)) goto L65;
     */
    /* JADX WARN: Code restructure failed: missing block: B:34:0x014a, code lost:
    
        r10 = r11;
        r35 = r12;
        r1[r7] = (((long) (r9 & 127)) << r14) | (r1[r7] & (~(255 << r14)));
        r1[r1.length - r10] = (r1[r29] & r35) | Long.MIN_VALUE;
        r6 = r6 + 1;
        r11 = r10;
        r8 = r30;
        r12 = r35;
     */
    /* JADX WARN: Code restructure failed: missing block: B:35:0x016d, code lost:
    
        r10 = r11;
        r35 = r12;
        r8 = r15 >> 3;
        r11 = r1[r8];
        r13 = (r15 & 7) << 3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:36:0x017e, code lost:
    
        if (((r11 >> r13) & 255) != 128) goto L38;
     */
    /* JADX WARN: Code restructure failed: missing block: B:37:0x0180, code lost:
    
        r18 = r10;
        r12 = r4;
        r37 = r5;
        r1[r8] = (r11 & (~(255 << r13))) | (((long) (r9 & 127)) << r13);
        r1[r7] = (r1[r7] & (~(255 << r14))) | (128 << r14);
        r12[r15] = r12[r6];
        r12[r6] = 0;
        r37[r15] = r37[r6];
        r37[r6] = null;
     */
    /* JADX WARN: Code restructure failed: missing block: B:38:0x01ad, code lost:
    
        r37 = r5;
        r18 = r10;
        r12 = r4;
        r1[r8] = (((long) (r9 & 127)) << r13) | (r11 & (~(255 << r13)));
        r4 = r12[r15];
        r12[r15] = r12[r6];
        r12[r6] = r4;
        r4 = r37[r15];
        r37[r15] = r37[r6];
        r37[r6] = r4;
        r6 = r6 - 1;
     */
    /* JADX WARN: Code restructure failed: missing block: B:39:0x01d2, code lost:
    
        r1[r1.length - 1] = (r1[r29] & r35) | Long.MIN_VALUE;
        r6 = r6 + 1;
        r4 = r12;
        r11 = r18;
        r8 = r30;
        r12 = r35;
        r5 = r37;
     */
    /* JADX WARN: Code restructure failed: missing block: B:40:0x01ea, code lost:
    
        r18 = r11;
        r38.f21324f = n.Y.a(r38.f21322d) - r38.f21323e;
     */
    /* JADX WARN: Code restructure failed: missing block: B:42:0x01fd, code lost:
    
        r31 = r10;
        r29 = 0;
        r18 = 1;
        r27 = 128;
     */
    /* JADX WARN: Code restructure failed: missing block: B:44:0x0209, code lost:
    
        r1 = n.Y.b(r38.f21322d);
        r2 = r38.f21319a;
        r4 = r38.f21320b;
        r5 = r38.f21321c;
        r6 = r38.f21322d;
        e(r1);
        r1 = r38.f21319a;
        r7 = r38.f21320b;
        r8 = r38.f21321c;
        r9 = r38.f21322d;
        r10 = 0;
     */
    /* JADX WARN: Code restructure failed: missing block: B:45:0x0224, code lost:
    
        if (r10 >= r6) goto L73;
     */
    /* JADX WARN: Code restructure failed: missing block: B:47:0x0233, code lost:
    
        if (((r2[r10 >> 3] >> ((r10 & 7) << 3)) & 255) >= 128) goto L49;
     */
    /* JADX WARN: Code restructure failed: missing block: B:48:0x0235, code lost:
    
        r11 = r4[r10];
        r13 = java.lang.Long.hashCode(r11) * r19;
        r13 = r13 ^ (r13 << 16);
        r14 = c(r13 >>> 7);
        r16 = r1;
        r15 = r2;
        r1 = r13 & 127;
        r13 = r14 >> 3;
        r17 = (r14 & 7) << 3;
        r1 = (r16[r13] & (~(255 << r17))) | (r1 << r17);
        r16[r13] = r1;
        r16[(((r14 - 7) & r9) + (r9 & 7)) >> 3] = r1;
        r7[r14] = r11;
        r8[r14] = r5[r10];
     */
    /* JADX WARN: Code restructure failed: missing block: B:49:0x0273, code lost:
    
        r16 = r1;
        r15 = r2;
     */
    /* JADX WARN: Code restructure failed: missing block: B:50:0x0276, code lost:
    
        r10 = r10 + 1;
        r2 = r15;
        r1 = r16;
     */
    /* JADX WARN: Code restructure failed: missing block: B:51:0x027c, code lost:
    
        r1 = c(r3);
     */
    /* JADX WARN: Code restructure failed: missing block: B:52:0x0280, code lost:
    
        r16 = r1;
        r38.f21323e++;
        r1 = r38.f21324f;
        r2 = r38.f21319a;
        r3 = r16 >> 3;
        r4 = r2[r3];
        r6 = (r16 & 7) << 3;
     */
    /* JADX WARN: Code restructure failed: missing block: B:53:0x029a, code lost:
    
        if (((r4 >> r6) & 255) != r27) goto L55;
     */
    /* JADX WARN: Code restructure failed: missing block: B:54:0x029c, code lost:
    
        r29 = r18;
     */
    /* JADX WARN: Code restructure failed: missing block: B:55:0x029e, code lost:
    
        r38.f21324f = r1 - r29;
        r1 = r38.f21322d;
        r4 = (r4 & (~(255 << r6))) | (r31 << r6);
        r2[r3] = r4;
        r2[(((r16 - 7) & r1) + (r1 & 7)) >> 3] = r4;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final void g(long j4, Object obj) {
        int i6;
        int iNumberOfTrailingZeros;
        int i7 = -862048943;
        int iHashCode = Long.hashCode(j4) * (-862048943);
        int i8 = iHashCode ^ (iHashCode << 16);
        int i9 = i8 >>> 7;
        int i10 = i8 & 127;
        int i11 = this.f21322d;
        int i12 = i9 & i11;
        int i13 = 0;
        loop0: while (true) {
            long[] jArr = this.f21319a;
            int i14 = i12 >> 3;
            int i15 = (i12 & 7) << 3;
            int i16 = 1;
            long j6 = ((jArr[i14 + 1] << (64 - i15)) & ((-i15) >> 63)) | (jArr[i14] >>> i15);
            long j7 = i10;
            int i17 = i13;
            int i18 = 0;
            long j8 = j6 ^ (j7 * 72340172838076673L);
            long j9 = (~j8) & (j8 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j9 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = (i12 + (Long.numberOfTrailingZeros(j9) >> 3)) & i11;
                int i19 = i7;
                if (this.f21320b[iNumberOfTrailingZeros] == j4) {
                    break loop0;
                }
                j9 &= j9 - 1;
                i7 = i19;
            }
            i13 = i17 + 8;
            i12 = (i12 + i13) & i11;
            i7 = i6;
        }
        this.f21320b[iNumberOfTrailingZeros] = j4;
        this.f21321c[iNumberOfTrailingZeros] = obj;
    }

    public final int hashCode() {
        long[] jArr = this.f21320b;
        Object[] objArr = this.f21321c;
        long[] jArr2 = this.f21319a;
        int length = jArr2.length - 2;
        if (length < 0) {
            return 0;
        }
        int i6 = 0;
        int iHashCode = 0;
        while (true) {
            long j4 = jArr2[i6];
            if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                int i7 = 8 - ((~(i6 - length)) >>> 31);
                for (int i8 = 0; i8 < i7; i8++) {
                    if ((255 & j4) < 128) {
                        int i9 = (i6 << 3) + i8;
                        long j6 = jArr[i9];
                        Object obj = objArr[i9];
                        iHashCode += (obj != null ? obj.hashCode() : 0) ^ Long.hashCode(j6);
                    }
                    j4 >>= 8;
                }
                if (i7 != 8) {
                    return iHashCode;
                }
            }
            if (i6 == length) {
                return iHashCode;
            }
            i6++;
        }
    }

    public final String toString() {
        int i6;
        int i7;
        if (this.f21323e == 0) {
            return "{}";
        }
        StringBuilder sb = new StringBuilder("{");
        long[] jArr = this.f21320b;
        Object[] objArr = this.f21321c;
        long[] jArr2 = this.f21319a;
        int length = jArr2.length - 2;
        if (length >= 0) {
            int i8 = 0;
            int i9 = 0;
            while (true) {
                long j4 = jArr2[i8];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i10 = 8 - ((~(i8 - length)) >>> 31);
                    int i11 = 0;
                    while (i11 < i10) {
                        if ((255 & j4) < 128) {
                            int i12 = (i8 << 3) + i11;
                            i7 = i8;
                            long j6 = jArr[i12];
                            Object obj = objArr[i12];
                            sb.append(j6);
                            sb.append("=");
                            if (obj == this) {
                                obj = "(this)";
                            }
                            sb.append(obj);
                            i9++;
                            if (i9 < this.f21323e) {
                                sb.append(", ");
                            }
                        } else {
                            i7 = i8;
                        }
                        j4 >>= 8;
                        i11++;
                        i8 = i7;
                    }
                    int i13 = i8;
                    if (i10 != 8) {
                        break;
                    }
                    i6 = i13;
                } else {
                    i6 = i8;
                }
                if (i6 == length) {
                    break;
                }
                i8 = i6 + 1;
            }
        }
        sb.append('}');
        String string = sb.toString();
        kotlin.jvm.internal.o.g(string, "toString(...)");
        return string;
    }
}
