package c.i.e.s.b;
/* compiled from: DataMask */
public enum c {
    DATA_MASK_000 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return ((i + i2) & 1) == 0;
        }
    },
    DATA_MASK_001 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return (i & 1) == 0;
        }
    },
    DATA_MASK_010 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return i2 % 3 == 0;
        }
    },
    DATA_MASK_011 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return (i + i2) % 3 == 0;
        }
    },
    DATA_MASK_100 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return (((i2 / 3) + (i / 2)) & 1) == 0;
        }
    },
    DATA_MASK_101 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return (i * i2) % 6 == 0;
        }
    },
    DATA_MASK_110 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return (i * i2) % 6 < 3;
        }
    },
    DATA_MASK_111 {
        @Override // c.i.e.s.b.c
        public boolean f(int i, int i2) {
            return ((((i * i2) % 3) + (i + i2)) & 1) == 0;
        }
    };

    public c(a aVar) {
    }

    public abstract boolean f(int i, int i2);

    public final void g(c.i.e.n.b bVar, int i) {
        for (int i2 = 0; i2 < i; i2++) {
            for (int i3 = 0; i3 < i; i3++) {
                if (f(i2, i3)) {
                    bVar.b(i3, i2);
                }
            }
        }
    }
}