Given a condition (function from inps to boolean) and two state
machines, make a new machine. The condition is evaluated on every step,
and the selected machine is used to generate output and has its state
updated. If the condition is true, sm1 is used, and if it
is false, sm2 is used.
|
|
| __init__(self,
condition,
sm1,
sm2,
name=None) |
|
|
|
|
|
|
|
|
|
|
done(self,
state)
By default, machines don't terminate |
|
|
|
|
printDebugInfo(self,
depth,
state,
nextState,
inp,
out,
debugParams)
Default method for printing out all of the debugging information for
a primitive machine. |
|
|
|
Inherited from SM:
check,
doTraceTasks,
getStartState,
guaranteeName,
isDone,
run,
start,
step,
transduce,
transduceF
|