Created
September 7, 2025 04:20
-
-
Save 0riginaln0/5f1417369bece80b4a1346c060e0954c to your computer and use it in GitHub Desktop.
Odin FSM example via Enumerated arrays
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import "core:fmt" | |
| States :: enum { | |
| initial, | |
| state_1, | |
| state_final, | |
| } | |
| Signals :: enum { | |
| sign0, | |
| sign1, | |
| sign_N, | |
| } | |
| FSM_table := [States][Signals]States { | |
| States.initial = { | |
| Signals.sign0 = States.state_1, | |
| Signals.sign1 = States.initial, | |
| Signals.sign_N = States.state_1, | |
| }, | |
| States.state_1 = { | |
| Signals.sign0 = States.initial, | |
| Signals.sign1 = States.state_1, | |
| Signals.sign_N = States.state_final, | |
| }, | |
| States.state_final = { | |
| Signals.sign0 = States.initial, | |
| Signals.sign1 = States.initial, | |
| Signals.sign_N = States.initial, | |
| }, | |
| } | |
| main :: proc() { | |
| // Function to transition states | |
| transition :: proc(state: States, signal: Signals) -> States { | |
| return FSM_table[state][signal] | |
| } | |
| // Example usage | |
| current_state := States.initial | |
| input_signal := Signals.sign0 | |
| next_state := transition(current_state, input_signal) | |
| fmt.printf("Transition from %v with %v leads to %v\n", current_state, input_signal, next_state) | |
| } |
Author
0riginaln0
commented
Sep 7, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment