I3.13
State-machine completeness and illegal states
Cards in this group · 4
- I3.13.1Every legal transition must have a defined outcome
- I3.13.2If the data model can hold an illegal combination, it will
- I3.13.3Independent booleans mint illegal states that a single enum would forbid
- I3.13.4The UI must be a projection of the state machine, not a visual guess