discord-jadx/app/src/main/java/c/i/e/n/a.java

package c.i.e.n;

import java.util.Arrays;
/* compiled from: BitArray */
public final class a implements Cloneable {
    public int[] i;
    public int j;

    public a() {
        this.j = 0;
        this.i = new int[1];
    }

    public a(int i) {
        this.j = i;
        this.i = new int[((i + 31) / 32)];
    }

    public a(int[] iArr, int i) {
        this.i = iArr;
        this.j = i;
    }

    public boolean b(int i) {
        return ((1 << (i & 31)) & this.i[i / 32]) != 0;
    }

    @Override // java.lang.Object
    public Object clone() throws CloneNotSupportedException {
        return new a((int[]) this.i.clone(), this.j);
    }

    @Override // java.lang.Object
    public boolean equals(Object obj) {
        if (!(obj instanceof a)) {
            return false;
        }
        a aVar = (a) obj;
        return this.j == aVar.j && Arrays.equals(this.i, aVar.i);
    }

    public int f(int i) {
        int i2 = this.j;
        if (i >= i2) {
            return i2;
        }
        int i3 = i / 32;
        int i4 = (~((1 << (i & 31)) - 1)) & this.i[i3];
        while (i4 == 0) {
            i3++;
            int[] iArr = this.i;
            if (i3 == iArr.length) {
                return this.j;
            }
            i4 = iArr[i3];
        }
        int numberOfTrailingZeros = Integer.numberOfTrailingZeros(i4) + (i3 << 5);
        int i5 = this.j;
        return numberOfTrailingZeros > i5 ? i5 : numberOfTrailingZeros;
    }

    public int g(int i) {
        int i2 = this.j;
        if (i >= i2) {
            return i2;
        }
        int i3 = i / 32;
        int i4 = (~((1 << (i & 31)) - 1)) & (~this.i[i3]);
        while (i4 == 0) {
            i3++;
            int[] iArr = this.i;
            if (i3 == iArr.length) {
                return this.j;
            }
            i4 = ~iArr[i3];
        }
        int numberOfTrailingZeros = Integer.numberOfTrailingZeros(i4) + (i3 << 5);
        int i5 = this.j;
        return numberOfTrailingZeros > i5 ? i5 : numberOfTrailingZeros;
    }

    public boolean h(int i, int i2, boolean z2) {
        if (i2 < i || i < 0 || i2 > this.j) {
            throw new IllegalArgumentException();
        } else if (i2 == i) {
            return true;
        } else {
            int i3 = i2 - 1;
            int i4 = i / 32;
            int i5 = i3 / 32;
            int i6 = i4;
            while (i6 <= i5) {
                int i7 = 31;
                int i8 = i6 > i4 ? 0 : i & 31;
                if (i6 >= i5) {
                    i7 = 31 & i3;
                }
                int i9 = (2 << i7) - (1 << i8);
                int i10 = this.i[i6] & i9;
                if (!z2) {
                    i9 = 0;
                }
                if (i10 != i9) {
                    return false;
                }
                i6++;
            }
            return true;
        }
    }

    @Override // java.lang.Object
    public int hashCode() {
        return Arrays.hashCode(this.i) + (this.j * 31);
    }

    public void i() {
        int[] iArr = new int[this.i.length];
        int i = (this.j - 1) / 32;
        int i2 = i + 1;
        for (int i3 = 0; i3 < i2; i3++) {
            long j = (long) this.i[i3];
            long j2 = ((j & 1431655765) << 1) | ((j >> 1) & 1431655765);
            long j3 = ((j2 & 858993459) << 2) | ((j2 >> 2) & 858993459);
            long j4 = ((j3 & 252645135) << 4) | ((j3 >> 4) & 252645135);
            long j5 = ((j4 & 16711935) << 8) | ((j4 >> 8) & 16711935);
            iArr[i - i3] = (int) (((j5 & 65535) << 16) | ((j5 >> 16) & 65535));
        }
        int i4 = this.j;
        int i5 = i2 << 5;
        if (i4 != i5) {
            int i6 = i5 - i4;
            int i7 = iArr[0] >>> i6;
            for (int i8 = 1; i8 < i2; i8++) {
                int i9 = iArr[i8];
                iArr[i8 - 1] = i7 | (i9 << (32 - i6));
                i7 = i9 >>> i6;
            }
            iArr[i2 - 1] = i7;
        }
        this.i = iArr;
    }

    public void j(int i) {
        int[] iArr = this.i;
        int i2 = i / 32;
        iArr[i2] = (1 << (i & 31)) | iArr[i2];
    }

    @Override // java.lang.Object
    public String toString() {
        int i = this.j;
        StringBuilder sb = new StringBuilder((i / 8) + i + 1);
        for (int i2 = 0; i2 < this.j; i2++) {
            if ((i2 & 7) == 0) {
                sb.append(' ');
            }
            sb.append(b(i2) ? 'X' : '.');
        }
        return sb.toString();
    }
}