package n;

import java.util.Arrays;
import java.util.Collection;
import o.AbstractC2628a;
import x4.AbstractC3250p;
import x4.AbstractC3251q;

/* JADX INFO: loaded from: classes.dex */
public final class K {

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

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

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public long[] f21340c = AbstractC2593u.f21479b;

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    public int f21341d = Integer.MAX_VALUE;

    /* JADX INFO: renamed from: e, reason: collision with root package name */
    public int f21342e = Integer.MAX_VALUE;

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

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

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

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

    public final boolean a(Object obj) {
        int i6 = this.f21344g;
        int iD = d(obj);
        this.f21339b[iD] = obj;
        long[] jArr = this.f21340c;
        int i7 = this.f21341d;
        jArr[iD] = (((long) i7) & 2147483647L) | 4611686016279904256L;
        if (i7 != Integer.MAX_VALUE) {
            jArr[i7] = ((((long) iD) & 2147483647L) << 31) | (jArr[i7] & (-4611686016279904257L));
        }
        this.f21341d = iD;
        if (this.f21342e == Integer.MAX_VALUE) {
            this.f21342e = iD;
        }
        return this.f21344g != i6;
    }

    public final void b() {
        this.f21344g = 0;
        long[] jArr = this.f21338a;
        if (jArr != Y.f21386a) {
            AbstractC3250p.I(jArr, -9187201950435737472L);
            long[] jArr2 = this.f21338a;
            int i6 = this.f21343f;
            int i7 = i6 >> 3;
            long j4 = 255 << ((i6 & 7) << 3);
            jArr2[i7] = (jArr2[i7] & (~j4)) | j4;
        }
        AbstractC3250p.H(this.f21339b, null, 0, this.f21343f);
        AbstractC3250p.I(this.f21340c, 4611686018427387903L);
        this.f21341d = Integer.MAX_VALUE;
        this.f21342e = Integer.MAX_VALUE;
        this.f21345h = Y.a(this.f21343f) - this.f21344g;
    }

    /* JADX WARN: Code restructure failed: missing block: B:15:0x006e, code lost:
    
        if (((r7 & ((~r7) << 6)) & (-9187201950435737472L)) == 0) goto L20;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0070, code lost:
    
        r11 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean c(Object obj) {
        int iNumberOfTrailingZeros;
        int iHashCode = (obj != null ? obj.hashCode() : 0) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21343f;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21338a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j4 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j6 = (((long) i7) * 72340172838076673L) ^ j4;
            long j7 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j7 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j7) >> 3) + i9) & i8;
                if (kotlin.jvm.internal.o.c(this.f21339b[iNumberOfTrailingZeros], obj)) {
                    break loop0;
                }
                j7 &= j7 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        return iNumberOfTrailingZeros >= 0;
    }

    public final int d(Object obj) {
        int i6;
        long j4;
        long j6;
        long j7;
        char c6;
        long[] jArr;
        long[] jArr2;
        long j8;
        int i7 = -862048943;
        int iHashCode = (obj != null ? obj.hashCode() : 0) * (-862048943);
        int i8 = iHashCode ^ (iHashCode << 16);
        int i9 = i8 >>> 7;
        int i10 = i8 & 127;
        int i11 = this.f21343f;
        int i12 = i9 & i11;
        int i13 = 0;
        while (true) {
            long[] jArr3 = this.f21338a;
            int i14 = i12 >> 3;
            int i15 = (i12 & 7) << 3;
            long j9 = ((jArr3[i14 + 1] << (64 - i15)) & ((-i15) >> 63)) | (jArr3[i14] >>> i15);
            long j10 = i10;
            long j11 = j9 ^ (j10 * 72340172838076673L);
            long j12 = (j11 - 72340172838076673L) & (~j11) & (-9187201950435737472L);
            while (j12 != 0) {
                int iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j12) >> 3) + i12) & i11;
                int i16 = i7;
                if (kotlin.jvm.internal.o.c(this.f21339b[iNumberOfTrailingZeros], obj)) {
                    return iNumberOfTrailingZeros;
                }
                j12 &= j12 - 1;
                i7 = i16;
            }
            int i17 = i7;
            if ((j9 & ((~j9) << 6) & (-9187201950435737472L)) != 0) {
                int iE = e(i9);
                long j13 = 255;
                if (this.f21345h != 0 || ((this.f21338a[iE >> 3] >> ((iE & 7) << 3)) & 255) == 254) {
                    i6 = 0;
                    j4 = j10;
                    j6 = 255;
                    j7 = 128;
                } else {
                    int i18 = this.f21343f;
                    if (i18 > 8) {
                        c6 = 31;
                        j7 = 128;
                        if (Long.compare((((long) this.f21344g) * 32) ^ Long.MIN_VALUE, (((long) i18) * 25) ^ Long.MIN_VALUE) <= 0) {
                            long[] jArr4 = this.f21338a;
                            if (jArr4 == null) {
                                i6 = 0;
                                j4 = j10;
                                j6 = 255;
                            } else {
                                int i19 = this.f21343f;
                                Object[] objArr = this.f21339b;
                                long[] jArr5 = this.f21340c;
                                long[] jArr6 = new long[i19];
                                Arrays.fill(jArr6, 0, i19, 9223372034707292159L);
                                i6 = 0;
                                int i20 = (i19 + 7) >> 3;
                                int i21 = 0;
                                while (i21 < i20) {
                                    long j14 = j13;
                                    long j15 = jArr4[i21] & (-9187201950435737472L);
                                    int i22 = i21;
                                    jArr4[i22] = ((~j15) + (j15 >>> 7)) & (-72340172838076674L);
                                    i21 = i22 + 1;
                                    j13 = j14;
                                }
                                j6 = j13;
                                int length = jArr4.length;
                                int i23 = length - 1;
                                int i24 = length - 2;
                                jArr4[i24] = (jArr4[i24] & 72057594037927935L) | (-72057594037927936L);
                                jArr4[i23] = jArr4[0];
                                int i25 = 0;
                                while (i25 != i19) {
                                    int i26 = i25 >> 3;
                                    int i27 = (i25 & 7) << 3;
                                    long j16 = (jArr4[i26] >> i27) & j6;
                                    if (j16 != 128 && j16 == 254) {
                                        Object obj2 = objArr[i25];
                                        int iHashCode2 = (obj2 != null ? obj2.hashCode() : 0) * i17;
                                        int i28 = iHashCode2 ^ (iHashCode2 << 16);
                                        int i29 = i28 >>> 7;
                                        int iE2 = e(i29);
                                        int i30 = i29 & i19;
                                        if (((iE2 - i30) & i19) / 8 == ((i25 - i30) & i19) / 8) {
                                            int i31 = i19;
                                            Object[] objArr2 = objArr;
                                            jArr4[i26] = (jArr4[i26] & (~(j6 << i27))) | (((long) (i28 & 127)) << i27);
                                            if (jArr6[i25] == 9223372034707292159L) {
                                                long j17 = i25;
                                                jArr6[i25] = j17 | (j17 << 32);
                                            }
                                            jArr4[jArr4.length - 1] = jArr4[0];
                                            i25++;
                                            i19 = i31;
                                            objArr = objArr2;
                                        } else {
                                            int i32 = i19;
                                            Object[] objArr3 = objArr;
                                            int i33 = iE2 >> 3;
                                            long j18 = jArr4[i33];
                                            int i34 = (iE2 & 7) << 3;
                                            if (((j18 >> i34) & j6) == 128) {
                                                jArr4[i33] = (j18 & (~(j6 << i34))) | (((long) (i28 & 127)) << i34);
                                                jArr4[i26] = (jArr4[i26] & (~(j6 << i27))) | (128 << i27);
                                                objArr3[iE2] = objArr3[i25];
                                                objArr3[i25] = null;
                                                jArr5[iE2] = jArr5[i25];
                                                jArr5[i25] = 4611686018427387903L;
                                                int i35 = (int) ((jArr6[i25] >> 32) & 4294967295L);
                                                int i36 = Integer.MAX_VALUE;
                                                if (i35 != Integer.MAX_VALUE) {
                                                    j8 = j10;
                                                    jArr6[i35] = ((long) iE2) | (jArr6[i35] & (-4294967296L));
                                                    jArr6[i25] = (jArr6[i25] & 4294967295L) | (-4294967296L);
                                                    i36 = Integer.MAX_VALUE;
                                                } else {
                                                    j8 = j10;
                                                    jArr6[i25] = (((long) Integer.MAX_VALUE) << 32) | ((long) iE2);
                                                }
                                                jArr6[iE2] = (((long) i25) << 32) | ((long) i36);
                                            } else {
                                                j8 = j10;
                                                jArr4[i33] = (((long) (i28 & 127)) << i34) | (j18 & (~(j6 << i34)));
                                                Object obj3 = objArr3[iE2];
                                                objArr3[iE2] = objArr3[i25];
                                                objArr3[i25] = obj3;
                                                long j19 = jArr5[iE2];
                                                jArr5[iE2] = jArr5[i25];
                                                jArr5[i25] = j19;
                                                int i37 = (int) ((jArr6[i25] >> 32) & 4294967295L);
                                                if (i37 != Integer.MAX_VALUE) {
                                                    long j20 = iE2;
                                                    jArr6[i37] = (jArr6[i37] & (-4294967296L)) | j20;
                                                    jArr6[i25] = (jArr6[i25] & 4294967295L) | (j20 << 32);
                                                } else {
                                                    long j21 = iE2;
                                                    jArr6[i25] = j21 | (j21 << 32);
                                                    i37 = i25;
                                                }
                                                jArr6[iE2] = (((long) i37) << 32) | ((long) i25);
                                                i25--;
                                            }
                                            jArr4[jArr4.length - 1] = jArr4[0];
                                            i25++;
                                            i19 = i32;
                                            objArr = objArr3;
                                            j10 = j8;
                                        }
                                    } else {
                                        i25++;
                                    }
                                }
                                j4 = j10;
                                this.f21345h = Y.a(this.f21343f) - this.f21344g;
                                long[] jArr7 = this.f21340c;
                                int length2 = jArr7.length;
                                for (int i38 = 0; i38 < length2; i38++) {
                                    long j22 = jArr7[i38];
                                    int i39 = (int) ((j22 >> 31) & 2147483647L);
                                    int i40 = (int) (j22 & 2147483647L);
                                    jArr7[i38] = (((j22 & (-4611686018427387904L)) | ((long) (i39 == Integer.MAX_VALUE ? Integer.MAX_VALUE : (int) (jArr6[i39] & 4294967295L)))) << 31) | ((long) (i40 == Integer.MAX_VALUE ? Integer.MAX_VALUE : (int) (jArr6[i40] & 4294967295L)));
                                }
                                int i41 = this.f21341d;
                                if (i41 != Integer.MAX_VALUE) {
                                    this.f21341d = (int) (jArr6[i41] & 4294967295L);
                                }
                                int i42 = this.f21342e;
                                if (i42 != Integer.MAX_VALUE) {
                                    this.f21342e = (int) (jArr6[i42] & 4294967295L);
                                }
                            }
                        }
                        iE = e(i9);
                    } else {
                        c6 = 31;
                        j7 = 128;
                    }
                    i6 = 0;
                    j4 = j10;
                    j6 = 255;
                    int iB = Y.b(this.f21343f);
                    long[] jArr8 = this.f21338a;
                    Object[] objArr4 = this.f21339b;
                    long[] jArr9 = this.f21340c;
                    int i43 = this.f21343f;
                    int[] iArr = new int[i43];
                    f(iB);
                    long[] jArr10 = this.f21338a;
                    Object[] objArr5 = this.f21339b;
                    long[] jArr11 = this.f21340c;
                    int i44 = this.f21343f;
                    int i45 = 0;
                    while (i45 < i43) {
                        if (((jArr8[i45 >> 3] >> ((i45 & 7) << 3)) & 255) < j7) {
                            Object obj4 = objArr4[i45];
                            int iHashCode3 = (obj4 != null ? obj4.hashCode() : 0) * i17;
                            int i46 = iHashCode3 ^ (iHashCode3 << 16);
                            int iE3 = e(i46 >>> 7);
                            jArr = jArr10;
                            jArr2 = jArr8;
                            long j23 = i46 & 127;
                            int i47 = iE3 >> 3;
                            int i48 = (iE3 & 7) << 3;
                            long j24 = (jArr[i47] & (~(255 << i48))) | (j23 << i48);
                            jArr[i47] = j24;
                            jArr[(((iE3 - 7) & i44) + (i44 & 7)) >> 3] = j24;
                            objArr5[iE3] = obj4;
                            jArr11[iE3] = jArr9[i45];
                            iArr[i45] = iE3;
                        } else {
                            jArr = jArr10;
                            jArr2 = jArr8;
                        }
                        i45++;
                        jArr8 = jArr2;
                        jArr10 = jArr;
                    }
                    long[] jArr12 = this.f21340c;
                    int length3 = jArr12.length;
                    for (int i49 = 0; i49 < length3; i49++) {
                        long j25 = jArr12[i49];
                        int i50 = (int) ((j25 >> c6) & 2147483647L);
                        int i51 = (int) (j25 & 2147483647L);
                        jArr12[i49] = (((j25 & (-4611686018427387904L)) | ((long) (i50 == Integer.MAX_VALUE ? Integer.MAX_VALUE : iArr[i50]))) << c6) | ((long) (i51 == Integer.MAX_VALUE ? Integer.MAX_VALUE : iArr[i51]));
                    }
                    int i52 = this.f21341d;
                    if (i52 != Integer.MAX_VALUE) {
                        this.f21341d = iArr[i52];
                    }
                    int i53 = this.f21342e;
                    if (i53 != Integer.MAX_VALUE) {
                        this.f21342e = iArr[i53];
                    }
                    iE = e(i9);
                }
                this.f21344g++;
                int i54 = this.f21345h;
                long[] jArr13 = this.f21338a;
                int i55 = iE >> 3;
                long j26 = jArr13[i55];
                int i56 = (iE & 7) << 3;
                if (((j26 >> i56) & j6) == j7) {
                    i6 = 1;
                }
                this.f21345h = i54 - i6;
                int i57 = this.f21343f;
                long j27 = (j26 & (~(j6 << i56))) | (j4 << i56);
                jArr13[i55] = j27;
                jArr13[(((iE - 7) & i57) + (i57 & 7)) >> 3] = j27;
                return iE;
            }
            i13 += 8;
            i12 = (i12 + i13) & i11;
            i7 = i17;
        }
    }

    public final int e(int i6) {
        int i7 = this.f21343f;
        int i8 = i6 & i7;
        int i9 = 0;
        while (true) {
            long[] jArr = this.f21338a;
            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: Removed duplicated region for block: B:25:0x0058  */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (!(obj instanceof K)) {
            return false;
        }
        K k6 = (K) obj;
        if (k6.f21344g != this.f21344g) {
            return false;
        }
        Object[] objArr = this.f21339b;
        long[] jArr = this.f21338a;
        int length = jArr.length - 2;
        if (length >= 0) {
            int i6 = 0;
            while (true) {
                long j4 = jArr[i6];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i7 = 8 - ((~(i6 - length)) >>> 31);
                    for (int i8 = 0; i8 < i7; i8++) {
                        if ((255 & j4) < 128 && !k6.c(objArr[(i6 << 3) + i8])) {
                            return false;
                        }
                        j4 >>= 8;
                    }
                    if (i7 != 8) {
                        break;
                    }
                    if (i6 == length) {
                        break;
                    }
                    i6++;
                }
            }
        }
        return true;
    }

    public final void f(int i6) {
        long[] jArr;
        long[] jArr2;
        int iMax = i6 > 0 ? Math.max(7, Y.c(i6)) : 0;
        this.f21343f = iMax;
        if (iMax == 0) {
            jArr = Y.f21386a;
        } else {
            jArr = new long[((iMax + 15) & (-8)) >> 3];
            AbstractC3250p.I(jArr, -9187201950435737472L);
        }
        this.f21338a = jArr;
        int i7 = iMax >> 3;
        long j4 = 255 << ((iMax & 7) << 3);
        jArr[i7] = (jArr[i7] & (~j4)) | j4;
        this.f21345h = Y.a(this.f21343f) - this.f21344g;
        this.f21339b = iMax == 0 ? AbstractC2628a.f21782c : new Object[iMax];
        if (iMax == 0) {
            jArr2 = AbstractC2593u.f21479b;
        } else {
            jArr2 = new long[iMax];
            AbstractC3250p.I(jArr2, 4611686018427387903L);
        }
        this.f21340c = jArr2;
    }

    /* JADX WARN: Code restructure failed: missing block: B:15:0x006e, code lost:
    
        if (((r7 & ((~r7) << 6)) & (-9187201950435737472L)) == 0) goto L22;
     */
    /* JADX WARN: Code restructure failed: missing block: B:16:0x0070, code lost:
    
        r11 = -1;
     */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean g(Object obj) {
        int iNumberOfTrailingZeros;
        int iHashCode = (obj != null ? obj.hashCode() : 0) * (-862048943);
        int i6 = iHashCode ^ (iHashCode << 16);
        int i7 = i6 & 127;
        int i8 = this.f21343f;
        int i9 = (i6 >>> 7) & i8;
        int i10 = 0;
        loop0: while (true) {
            long[] jArr = this.f21338a;
            int i11 = i9 >> 3;
            int i12 = (i9 & 7) << 3;
            long j4 = ((jArr[i11 + 1] << (64 - i12)) & ((-i12) >> 63)) | (jArr[i11] >>> i12);
            long j6 = (((long) i7) * 72340172838076673L) ^ j4;
            long j7 = (~j6) & (j6 - 72340172838076673L) & (-9187201950435737472L);
            while (true) {
                if (j7 == 0) {
                    break;
                }
                iNumberOfTrailingZeros = ((Long.numberOfTrailingZeros(j7) >> 3) + i9) & i8;
                if (kotlin.jvm.internal.o.c(this.f21339b[iNumberOfTrailingZeros], obj)) {
                    break loop0;
                }
                j7 &= j7 - 1;
            }
            i10 += 8;
            i9 = (i9 + i10) & i8;
        }
        boolean z6 = iNumberOfTrailingZeros >= 0;
        if (z6) {
            h(iNumberOfTrailingZeros);
        }
        return z6;
    }

    public final void h(int i6) {
        this.f21344g--;
        long[] jArr = this.f21338a;
        int i7 = this.f21343f;
        int i8 = i6 >> 3;
        int i9 = (i6 & 7) << 3;
        long j4 = (jArr[i8] & (~(255 << i9))) | (254 << i9);
        jArr[i8] = j4;
        jArr[(((i6 - 7) & i7) + (i7 & 7)) >> 3] = j4;
        this.f21339b[i6] = null;
        long[] jArr2 = this.f21340c;
        long j6 = jArr2[i6];
        int i10 = (int) ((j6 >> 31) & 2147483647L);
        int i11 = (int) (j6 & 2147483647L);
        if (i10 != Integer.MAX_VALUE) {
            jArr2[i10] = (jArr2[i10] & (-2147483648L)) | (((long) i11) & 2147483647L);
        } else {
            this.f21341d = i11;
        }
        if (i11 != Integer.MAX_VALUE) {
            jArr2[i11] = ((((long) i10) & 2147483647L) << 31) | (jArr2[i11] & (-4611686016279904257L));
        } else {
            this.f21342e = i10;
        }
        jArr2[i6] = 4611686018427387903L;
    }

    public final int hashCode() {
        int iHashCode = (this.f21343f * 31) + this.f21344g;
        Object[] objArr = this.f21339b;
        long[] jArr = this.f21338a;
        int length = jArr.length - 2;
        if (length >= 0) {
            int i6 = 0;
            while (true) {
                long j4 = jArr[i6];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i7 = 8 - ((~(i6 - length)) >>> 31);
                    for (int i8 = 0; i8 < i7; i8++) {
                        if ((255 & j4) < 128) {
                            Object obj = objArr[(i6 << 3) + i8];
                            if (!kotlin.jvm.internal.o.c(obj, this)) {
                                iHashCode += obj != null ? obj.hashCode() : 0;
                            }
                        }
                        j4 >>= 8;
                    }
                    if (i7 != 8) {
                        return iHashCode;
                    }
                }
                if (i6 == length) {
                    break;
                }
                i6++;
            }
        }
        return iHashCode;
    }

    /* JADX WARN: Removed duplicated region for block: B:16:0x0052  */
    /*
        Code decompiled incorrectly, please refer to instructions dump.
    */
    public final boolean i(Collection elements) {
        kotlin.jvm.internal.o.h(elements, "elements");
        Object[] objArr = this.f21339b;
        int i6 = this.f21344g;
        long[] jArr = this.f21338a;
        int length = jArr.length - 2;
        if (length >= 0) {
            int i7 = 0;
            while (true) {
                long j4 = jArr[i7];
                if ((((~j4) << 7) & j4 & (-9187201950435737472L)) != -9187201950435737472L) {
                    int i8 = 8 - ((~(i7 - length)) >>> 31);
                    for (int i9 = 0; i9 < i8; i9++) {
                        if ((255 & j4) < 128) {
                            int i10 = (i7 << 3) + i9;
                            if (!AbstractC3251q.Y(elements, objArr[i10])) {
                                h(i10);
                            }
                        }
                        j4 >>= 8;
                    }
                    if (i8 != 8) {
                        break;
                    }
                    if (i7 == length) {
                        break;
                    }
                    i7++;
                }
            }
        }
        return i6 != this.f21344g;
    }

    public final String toString() {
        C0.Z z6 = new C0.Z(this, 25);
        StringBuilder sb = new StringBuilder("[");
        Object[] objArr = this.f21339b;
        long[] jArr = this.f21340c;
        int i6 = this.f21342e;
        int i7 = 0;
        while (true) {
            if (i6 == Integer.MAX_VALUE) {
                sb.append((CharSequence) "]");
                break;
            }
            int i8 = (int) ((jArr[i6] >> 31) & 2147483647L);
            Object obj = objArr[i6];
            if (i7 == -1) {
                sb.append((CharSequence) "...");
                break;
            }
            if (i7 != 0) {
                sb.append((CharSequence) ", ");
            }
            sb.append((CharSequence) z6.invoke(obj));
            i7++;
            i6 = i8;
        }
        String string = sb.toString();
        kotlin.jvm.internal.o.g(string, "toString(...)");
        return string;
    }
}