利用1248码解决状态问题

    //状态集合
    private int STATUS = 0X0000;//初始状态

    //1248码组成1-15任意数字
    private final int STATUS_1 = 0X0001;
    private final int STATUS_2 = 0X0002;
    private final int STATUS_3 = 0X0004;
    private final int STATUS_4 = 0X0008;
    private final int STATUS_5 = 0X0010;
    private final int STATUS_6 = 0X0020;
    private final int STATUS_7 = 0X0040;
    private final int STATUS_8 = 0X0080;

    private final int MODE_A = STATUS_1;
    private final int MODE_B = STATUS_1 | STATUS_2;
    private final int MODE_C = STATUS_1 | STATUS_2 | STATUS_3;

    private void addStatus(int STATUS_M) {
        STATUS = STATUS | STATUS_M;
    }

    private void removeStatus(int STATUS_M) {
        STATUS = STATUS & ~STATUS_M;
    }

    public boolean isStatusEnabled(int status) {
        return (STATUS & status) != 0;
    }

    private boolean isModeEnabled(int MODE) {
        return MODE == STATUS;
    }


    //测试
    addStatus(STATUS_1);
    Log.e("status", "状态：" + STATUS);
    addStatus(STATUS_2);
    Log.e("status", "状态：" + STATUS);
    addStatus(STATUS_3);
    Log.e("status", "状态：" + STATUS);
    Log.e("status", "状态是否存在：" + isStatusEnabled(STATUS_4));

    Log.e("status", "mode：" + isModeEnabled(MODE_B));