package t9;

import java.util.Arrays;

/* loaded from: classes2.dex */
public final class m {

    /* renamed from: a, reason: collision with root package name */
    private int f14633a;

    /* renamed from: b, reason: collision with root package name */
    private final int[] f14634b = new int[10];

    void a() {
        this.f14633a = 0;
        Arrays.fill(this.f14634b, 0);
    }

    int b(int i10) {
        return this.f14634b[i10];
    }

    int c() {
        if ((this.f14633a & 2) != 0) {
            return this.f14634b[1];
        }
        return -1;
    }

    int d() {
        if ((this.f14633a & 128) != 0) {
            return this.f14634b[7];
        }
        return 65535;
    }

    int e(int i10) {
        return (this.f14633a & 16) != 0 ? this.f14634b[4] : i10;
    }

    int f(int i10) {
        return (this.f14633a & 32) != 0 ? this.f14634b[5] : i10;
    }

    boolean g(int i10) {
        return ((1 << i10) & this.f14633a) != 0;
    }

    void h(m mVar) {
        for (int i10 = 0; i10 < 10; i10++) {
            if (mVar.g(i10)) {
                i(i10, mVar.b(i10));
            }
        }
    }

    m i(int i10, int i11) {
        if (i10 >= 0) {
            int[] iArr = this.f14634b;
            if (i10 < iArr.length) {
                this.f14633a = (1 << i10) | this.f14633a;
                iArr[i10] = i11;
            }
        }
        return this;
    }

    int j() {
        return Integer.bitCount(this.f14633a);
    }
}