package p5;

import java.io.Serializable;
import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.Arrays;
import x4.AbstractC3250p;

/* JADX INFO: renamed from: p5.m, reason: case insensitive filesystem */
/* JADX INFO: loaded from: classes3.dex */
public class C2743m implements Serializable, Comparable {

    /* JADX INFO: renamed from: d, reason: collision with root package name */
    public static final C2743m f23101d = new C2743m(new byte[0]);

    /* JADX INFO: renamed from: a, reason: collision with root package name */
    public final byte[] f23102a;

    /* JADX INFO: renamed from: b, reason: collision with root package name */
    public transient int f23103b;

    /* JADX INFO: renamed from: c, reason: collision with root package name */
    public transient String f23104c;

    public C2743m(byte[] data) {
        kotlin.jvm.internal.o.h(data, "data");
        this.f23102a = data;
    }

    public static int g(C2743m c2743m, C2743m other) {
        c2743m.getClass();
        kotlin.jvm.internal.o.h(other, "other");
        return c2743m.f(other.f23102a, 0);
    }

    public static int k(C2743m c2743m, C2743m other) {
        c2743m.getClass();
        kotlin.jvm.internal.o.h(other, "other");
        return c2743m.j(other.f23102a);
    }

    public static final C2743m l(byte... data) {
        kotlin.jvm.internal.o.h(data, "data");
        byte[] bArrCopyOf = Arrays.copyOf(data, data.length);
        kotlin.jvm.internal.o.g(bArrCopyOf, "copyOf(...)");
        return new C2743m(bArrCopyOf);
    }

    public static /* synthetic */ C2743m q(C2743m c2743m, int i6, int i7, int i8) {
        if ((i8 & 1) != 0) {
            i6 = 0;
        }
        if ((i8 & 2) != 0) {
            i7 = -1234567890;
        }
        return c2743m.p(i6, i7);
    }

    public String a() {
        byte[] map = AbstractC2731a.f23082a;
        byte[] bArr = this.f23102a;
        kotlin.jvm.internal.o.h(bArr, "<this>");
        kotlin.jvm.internal.o.h(map, "map");
        byte[] bArr2 = new byte[((bArr.length + 2) / 3) * 4];
        int length = bArr.length - (bArr.length % 3);
        int i6 = 0;
        int i7 = 0;
        while (i6 < length) {
            byte b5 = bArr[i6];
            int i8 = i6 + 2;
            byte b6 = bArr[i6 + 1];
            i6 += 3;
            byte b7 = bArr[i8];
            bArr2[i7] = map[(b5 & 255) >> 2];
            bArr2[i7 + 1] = map[((b5 & 3) << 4) | ((b6 & 255) >> 4)];
            int i9 = i7 + 3;
            bArr2[i7 + 2] = map[((b6 & 15) << 2) | ((b7 & 255) >> 6)];
            i7 += 4;
            bArr2[i9] = map[b7 & 63];
        }
        int length2 = bArr.length - length;
        if (length2 == 1) {
            byte b8 = bArr[i6];
            bArr2[i7] = map[(b8 & 255) >> 2];
            bArr2[i7 + 1] = map[(b8 & 3) << 4];
            bArr2[i7 + 2] = 61;
            bArr2[i7 + 3] = 61;
        } else if (length2 == 2) {
            int i10 = i6 + 1;
            byte b9 = bArr[i6];
            byte b10 = bArr[i10];
            bArr2[i7] = map[(b9 & 255) >> 2];
            bArr2[i7 + 1] = map[((b9 & 3) << 4) | ((b10 & 255) >> 4)];
            bArr2[i7 + 2] = map[(b10 & 15) << 2];
            bArr2[i7 + 3] = 61;
        }
        return new String(bArr2, S4.a.f6257a);
    }

    @Override // java.lang.Comparable
    /* JADX INFO: renamed from: b, reason: merged with bridge method [inline-methods] */
    public final int compareTo(C2743m other) {
        kotlin.jvm.internal.o.h(other, "other");
        int iD = d();
        int iD2 = other.d();
        int iMin = Math.min(iD, iD2);
        for (int i6 = 0; i6 < iMin; i6++) {
            int i7 = i(i6) & 255;
            int i8 = other.i(i6) & 255;
            if (i7 != i8) {
                return i7 < i8 ? -1 : 1;
            }
        }
        if (iD == iD2) {
            return 0;
        }
        return iD < iD2 ? -1 : 1;
    }

    public C2743m c(String str) throws NoSuchAlgorithmException {
        MessageDigest messageDigest = MessageDigest.getInstance(str);
        messageDigest.update(this.f23102a, 0, d());
        byte[] bArrDigest = messageDigest.digest();
        kotlin.jvm.internal.o.e(bArrDigest);
        return new C2743m(bArrDigest);
    }

    public int d() {
        return this.f23102a.length;
    }

    public String e() {
        byte[] bArr = this.f23102a;
        char[] cArr = new char[bArr.length * 2];
        int i6 = 0;
        for (byte b5 : bArr) {
            int i7 = i6 + 1;
            char[] cArr2 = q5.b.f23734a;
            cArr[i6] = cArr2[(b5 >> 4) & 15];
            i6 += 2;
            cArr[i7] = cArr2[b5 & 15];
        }
        return new String(cArr);
    }

    public boolean equals(Object obj) {
        if (obj == this) {
            return true;
        }
        if (obj instanceof C2743m) {
            C2743m c2743m = (C2743m) obj;
            int iD = c2743m.d();
            byte[] bArr = this.f23102a;
            if (iD == bArr.length && c2743m.m(0, 0, bArr.length, bArr)) {
                return true;
            }
        }
        return false;
    }

    public int f(byte[] other, int i6) {
        kotlin.jvm.internal.o.h(other, "other");
        byte[] bArr = this.f23102a;
        int length = bArr.length - other.length;
        int iMax = Math.max(i6, 0);
        if (iMax > length) {
            return -1;
        }
        while (!AbstractC2732b.a(bArr, iMax, 0, other, other.length)) {
            if (iMax == length) {
                return -1;
            }
            iMax++;
        }
        return iMax;
    }

    public byte[] h() {
        return this.f23102a;
    }

    public int hashCode() {
        int i6 = this.f23103b;
        if (i6 != 0) {
            return i6;
        }
        int iHashCode = Arrays.hashCode(this.f23102a);
        this.f23103b = iHashCode;
        return iHashCode;
    }

    public byte i(int i6) {
        return this.f23102a[i6];
    }

    public int j(byte[] other) {
        kotlin.jvm.internal.o.h(other, "other");
        int iD = d();
        byte[] bArr = this.f23102a;
        for (int iMin = Math.min(iD, bArr.length - other.length); -1 < iMin; iMin--) {
            if (AbstractC2732b.a(bArr, iMin, 0, other, other.length)) {
                return iMin;
            }
        }
        return -1;
    }

    public boolean m(int i6, int i7, int i8, byte[] other) {
        kotlin.jvm.internal.o.h(other, "other");
        if (i6 < 0) {
            return false;
        }
        byte[] bArr = this.f23102a;
        return i6 <= bArr.length - i8 && i7 >= 0 && i7 <= other.length - i8 && AbstractC2732b.a(bArr, i6, i7, other, i8);
    }

    public boolean n(int i6, C2743m other, int i7) {
        kotlin.jvm.internal.o.h(other, "other");
        return other.m(0, i6, i7, this.f23102a);
    }

    public final boolean o(C2743m prefix) {
        kotlin.jvm.internal.o.h(prefix, "prefix");
        return n(0, prefix, prefix.d());
    }

    public C2743m p(int i6, int i7) {
        if (i7 == -1234567890) {
            i7 = d();
        }
        if (i6 < 0) {
            throw new IllegalArgumentException("beginIndex < 0");
        }
        byte[] bArr = this.f23102a;
        if (i7 > bArr.length) {
            throw new IllegalArgumentException(com.google.android.recaptcha.internal.a.m(new StringBuilder("endIndex > length("), bArr.length, ')').toString());
        }
        if (i7 - i6 >= 0) {
            return (i6 == 0 && i7 == bArr.length) ? this : new C2743m(AbstractC3250p.F(bArr, i6, i7));
        }
        throw new IllegalArgumentException("endIndex < beginIndex");
    }

    public C2743m r() {
        int i6 = 0;
        while (true) {
            byte[] bArr = this.f23102a;
            if (i6 >= bArr.length) {
                return this;
            }
            byte b5 = bArr[i6];
            if (b5 >= 65 && b5 <= 90) {
                byte[] bArrCopyOf = Arrays.copyOf(bArr, bArr.length);
                kotlin.jvm.internal.o.g(bArrCopyOf, "copyOf(...)");
                bArrCopyOf[i6] = (byte) (b5 + 32);
                for (int i7 = i6 + 1; i7 < bArrCopyOf.length; i7++) {
                    byte b6 = bArrCopyOf[i7];
                    if (b6 >= 65 && b6 <= 90) {
                        bArrCopyOf[i7] = (byte) (b6 + 32);
                    }
                }
                return new C2743m(bArrCopyOf);
            }
            i6++;
        }
    }

    public byte[] s() {
        byte[] bArr = this.f23102a;
        byte[] bArrCopyOf = Arrays.copyOf(bArr, bArr.length);
        kotlin.jvm.internal.o.g(bArrCopyOf, "copyOf(...)");
        return bArrCopyOf;
    }

    public final String t() {
        String str = this.f23104c;
        if (str != null) {
            return str;
        }
        byte[] bArrH = h();
        kotlin.jvm.internal.o.h(bArrH, "<this>");
        String str2 = new String(bArrH, S4.a.f6257a);
        this.f23104c = str2;
        return str2;
    }

    public String toString() {
        byte b5;
        int i6;
        byte[] bArr = this.f23102a;
        if (bArr.length == 0) {
            return "[size=0]";
        }
        int length = bArr.length;
        int i7 = 0;
        int i8 = 0;
        int i9 = 0;
        loop0: while (true) {
            if (i7 >= length) {
                break;
            }
            byte b6 = bArr[i7];
            if (b6 >= 0) {
                int i10 = i9 + 1;
                if (i9 == 64) {
                    break;
                }
                if ((b6 != 10 && b6 != 13 && ((b6 >= 0 && b6 < 32) || (127 <= b6 && b6 < 160))) || b6 == 65533) {
                    break;
                }
                i8 += b6 < 65536 ? 1 : 2;
                i7++;
                while (true) {
                    i9 = i10;
                    if (i7 < length && (b5 = bArr[i7]) >= 0) {
                        i7++;
                        i10 = i9 + 1;
                        if (i9 == 64) {
                            break loop0;
                        }
                        if ((b5 != 10 && b5 != 13 && ((b5 >= 0 && b5 < 32) || (127 <= b5 && b5 < 160))) || b5 == 65533) {
                            break loop0;
                        }
                        i8 += b5 < 65536 ? 1 : 2;
                    } else {
                        break;
                    }
                }
            } else if ((b6 >> 5) == -2) {
                int i11 = i7 + 1;
                if (length > i11) {
                    byte b7 = bArr[i11];
                    if ((b7 & 192) == 128) {
                        int i12 = (b7 ^ 3968) ^ (b6 << 6);
                        if (i12 >= 128) {
                            i6 = i9 + 1;
                            if (i9 == 64) {
                                break;
                            }
                            if ((i12 != 10 && i12 != 13 && ((i12 >= 0 && i12 < 32) || (127 <= i12 && i12 < 160))) || i12 == 65533) {
                                break;
                            }
                            i8 += i12 < 65536 ? 1 : 2;
                            i7 += 2;
                            i9 = i6;
                        } else if (i9 != 64) {
                            break;
                        }
                    } else if (i9 != 64) {
                        break;
                    }
                } else if (i9 != 64) {
                    break;
                }
            } else if ((b6 >> 4) == -2) {
                int i13 = i7 + 2;
                if (length > i13) {
                    byte b8 = bArr[i7 + 1];
                    if ((b8 & 192) == 128) {
                        byte b9 = bArr[i13];
                        if ((b9 & 192) == 128) {
                            int i14 = ((b9 ^ (-123008)) ^ (b8 << 6)) ^ (b6 << 12);
                            if (i14 < 2048) {
                                if (i9 != 64) {
                                    break;
                                }
                            } else if (55296 > i14 || i14 >= 57344) {
                                i6 = i9 + 1;
                                if (i9 == 64) {
                                    break;
                                }
                                if ((i14 != 10 && i14 != 13 && ((i14 >= 0 && i14 < 32) || (127 <= i14 && i14 < 160))) || i14 == 65533) {
                                    break;
                                }
                                i8 += i14 < 65536 ? 1 : 2;
                                i7 += 3;
                                i9 = i6;
                            } else if (i9 != 64) {
                                break;
                            }
                        } else if (i9 != 64) {
                            break;
                        }
                    } else if (i9 != 64) {
                        break;
                    }
                } else if (i9 != 64) {
                    break;
                }
            } else if ((b6 >> 3) == -2) {
                int i15 = i7 + 3;
                if (length > i15) {
                    byte b10 = bArr[i7 + 1];
                    if ((b10 & 192) == 128) {
                        byte b11 = bArr[i7 + 2];
                        if ((b11 & 192) == 128) {
                            byte b12 = bArr[i15];
                            if ((b12 & 192) == 128) {
                                int i16 = (((b12 ^ 3678080) ^ (b11 << 6)) ^ (b10 << 12)) ^ (b6 << 18);
                                if (i16 > 1114111) {
                                    if (i9 != 64) {
                                        break;
                                    }
                                } else if (55296 > i16 || i16 >= 57344) {
                                    if (i16 >= 65536) {
                                        i6 = i9 + 1;
                                        if (i9 == 64) {
                                            break;
                                        }
                                        if ((i16 != 10 && i16 != 13 && ((i16 >= 0 && i16 < 32) || (127 <= i16 && i16 < 160))) || i16 == 65533) {
                                            break;
                                        }
                                        i8 += i16 < 65536 ? 1 : 2;
                                        i7 += 4;
                                        i9 = i6;
                                    } else if (i9 != 64) {
                                        break;
                                    }
                                } else if (i9 != 64) {
                                    break;
                                }
                            } else if (i9 != 64) {
                                break;
                            }
                        } else if (i9 != 64) {
                            break;
                        }
                    } else if (i9 != 64) {
                        break;
                    }
                } else if (i9 != 64) {
                    break;
                }
            } else if (i9 != 64) {
                break;
            }
        }
        i8 = -1;
        if (i8 != -1) {
            String strT = t();
            String strSubstring = strT.substring(0, i8);
            kotlin.jvm.internal.o.g(strSubstring, "substring(...)");
            String strY0 = S4.w.y0(S4.w.y0(S4.w.y0(strSubstring, "\\", "\\\\"), "\n", "\\n"), "\r", "\\r");
            if (i8 >= strT.length()) {
                return A0.a.k(']', "[text=", strY0);
            }
            return "[size=" + bArr.length + " text=" + strY0 + "…]";
        }
        if (bArr.length <= 64) {
            return "[hex=" + e() + ']';
        }
        StringBuilder sb = new StringBuilder("[size=");
        sb.append(bArr.length);
        sb.append(" hex=");
        if (64 > bArr.length) {
            throw new IllegalArgumentException(com.google.android.recaptcha.internal.a.m(new StringBuilder("endIndex > length("), bArr.length, ')').toString());
        }
        sb.append((64 == bArr.length ? this : new C2743m(AbstractC3250p.F(bArr, 0, 64))).e());
        sb.append("…]");
        return sb.toString();
    }

    public void u(C2740j buffer, int i6) {
        kotlin.jvm.internal.o.h(buffer, "buffer");
        buffer.P(this.f23102a, 0, i6);
    }
}