C语言实现简单状态机

  1. 使用switch
enum State {
    STATE_A,
    STATE_B,
    STATE_C
};

enum Event {
    EVENT_1,
    EVENT_2,
    EVENT_3
};

void state_machine(enum State* state, enum Event event) {
    switch (*state) {
        case STATE_A:
            if (event == EVENT_1) {
                *state = STATE_B;
            } else if (event == EVENT_2) {
                *state = STATE_C;
            }
            break;
        case STATE_B:
            if (event == EVENT_3) {
                *state = STATE_A;
            }
            break;
        case STATE_C:
            if (event == EVENT_1) {
                *state = STATE_A;
            } else if (event == EVENT_3) {
                *state = STATE_B;
            }
            break;
    }
}
  1. 表方法
enum State {
    STATE_A,
    STATE_B,
    STATE_C
};

enum Event {
    EVENT_1,
    EVENT_2,
    EVENT_3
};

struct Transition {
    enum State current_state;
    enum Event event;
    enum State next_state;
};

struct Transition state_transitions[] = {
    {STATE_A, EVENT_1, STATE_B},
    {STATE_A, EVENT_2, STATE_C},
    {STATE_B, EVENT_3, STATE_A},
    {STATE_C, EVENT_1, STATE_A},
    {STATE_C, EVENT_3, STATE_B}
};

enum State state_machine(enum State current_state, enum Event event) {
    for (int i = 0; i < sizeof(state_transitions) / sizeof(state_transitions[0]); i++) {
        if (state_transitions[i].current_state == current_state &&
            state_transitions[i].event == event) {
            return state_transitions[i].next_state;
        }
    }
    return current_state;
}
  1. 函数指针
enum State {
    STATE_A,
    STATE_B,
    STATE_C
};

enum Event {
    EVENT_1,
    EVENT_2,
    EVENT_3
};

struct StateMachine {
    enum State current_state;
    void (*state_handlers[3])(enum Event);
};

void state_a_handler(enum Event event) {
    if (event == EVENT_1) {
        state_machine.current_state = STATE_B;
    } else if (event == EVENT_2) {
        state_machine.current_state = STATE_C;
    }
}

void state_b_handler(enum Event event) {
    if (event == EVENT_3) {
        state_machine.current_state = STATE_A;
    }
}

void state_c_handler(enum Event event) {
    if (event == EVENT_1) {
        state_machine.current_state = STATE_A;
    } else if (event == EVENT_3) {
        state_machine.current_state = STATE_B;
    }
}

struct StateMachine state_machine = {
    .current_state = STATE_A,
    .state_handlers = {
        state_a_handler,
        state_b_handler,
        state_c_handler
    }
};

void state_machine_handle_event(enum Event event) {
    state_machine.state_handlers[state_machine.current_state](event);
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值