Acme::FSM - pseudo Finite State Machine.
my $bb = Acme::FSM->connect( { %options }, { %fst } ); $bb->process; exit 0;
(disclaimer) Acme::FSM is currently in proof-of-concept state. There's a plan to accompany it with Acme::FSM::Simple with all diagnostics avoided and run time checks in place. And then with Acme::FSM::Tiny with run time checks stripped. Also, see BUGS AND CAVEATS later in this POD.
Through out code only methods are used to access internal state. Supposedly, that will enable scaling some day later. The only exception is connect() for obvious reasons.
Through out code neither internal state nor FST records are cached ever. The only one seamingly inconsistent fragment is inside main loop when next $state is already found but not yet entered. $action is processed when the next $state is set (though, in some sense, not yet entered). (If it doesn't make sense it's fine, refer to process() method description later in this POD.)
This notice seems to be useles. Instead, it might come handy someday.
There're some weird loaded words in this POD, most probably, poorly choosen (but those are going to stay anyway). So here comes disambiguation list.
Special flag associated with next {state} in a [turn] (covered in details in process() method description). (note) It may be applied to a [turn] of {fst} or {state}.
Shamelesly stolen from DMA::FSM. Originally, it meant some opaque HASH passed around in DMA::FSM::FSM() where user-code could store it's own ideas and such. Now it's an object blessed into Acme::FSM (for user-code still, {fsm} has nothing to do with it).
Layout of state records (see below) isn't particularly complicated. However it's far from being uniform. entry is a placeholder name for any component of (unspecified) state record when any semantics is irrelevant. See also [turn] and switch() below.
Acme::FSM.
Collection of state records.
Acronym for Finite State Machine. See above.
Acronym for Finite State Table. See above.
Some open-ended set of parameters dictating FSM's behaviour.
Something that makes sense for user-code. Acme::FSM treats it as scalar with no internals (mostly; one exception is covered in diag() method description).
A::F uses elaborate schema to reach various callbacks (three of them, at the time of writing). This optional parameter is in use by this schema. query() method has more.
A scalar identifing a [turn]. One of opaque scalars returned by switch() callback (the other is processed (modified or not) $item). process() method description has more.
Special piece of user-code (it's required at construction (connect() method), query_source() method describes how FSM reaches it). Whatever it returns (in explicit scalar context) becomes $item.
A scalar identifing a {state} (see below) or parameter of {fsm} (see above).
Just like control flow but for $states.
One record in {fst}. The record consists of entries (see above). process() method description has more. Should be noted, in most cases "{state}" should be read as "$state {state}" instead, but that starts to smell bufallo.
A mandatory callback associated with every {state}. process() method and query_switch() method descriptions have more.
No such thing. It's $rule instead (see above).
Specially crafted entry in {state} (covered in details in process() method description). Such entry describes what next $state should be picked in state flow and what to do with $item.
This idiom is used in place of "turns $rule of [turn]".
turns
$bb1 = Acme::FSM->connect( { %options1 }, %fst1 ); $bb2 = Acme::FSM->connect( { %options2 }, { %fst2 } ); $bb3 = $bb2->connect( { %options3 } );
Creates a blackboard object. Blackboard isa HASH, it's free to use except special _ key; that key is for {fsm} exclusively. First parameter isa %$options, it's required (pass empty HASH if nothing to say). Defined keys are:
_
(positive integer) Sets a diagnostic threshold. It's meaning is covered in diag() method documentation. If undef then set to 1 (0 is defined).
undef
1
0
(scalar or CODE) A::F operates on arbitrary items and there's a diagnostic service that sometimes insists on somehow showing those arbitrary items. It's up to user's code to process that arbitrary data and yield some scalar represantation. Refer to query_dumper() method documentation for details. Optional. Simple stringifier is provided by query_dumper() method itself.
CODE
(scalar or object(!) ref) Sets a context for various parts of {fsm} and services would be resolved. No defaults. Refer to query() method documentation for details.
(scalar or CODE) Sets a source of items to process to be queried. Required. Refer to query_source() method documentation for details.
Second is FST (Finite State Table). It's required for class construction and ignored (if any) for object construction. Difference between list and HASH is the former is copied into HASH internally; the latter HASH is just saved as reference. The FST is just borrowed from source object during object construction. Thus, in the synopsis, $bb3 and $bb2 use references to HASH %$fst2. An idea behind this is to minimize memory footprint. OTOH, maninpulations with one HASH are effectevely manipulations with FST of any other copy-object that borrowed that FST.
IOW, anything behind FST HASH of class construction or options HASH of object construction isa trailer and carped. Obviously, there's no trailer in class construction with list FST.
$bb = Acme::FSM->connect( { }, \%fst ); $rc = $bb->process;
This is heart, brains, liver, and so on of Acme::FSM. process() is what does actual state flow. That state flow is steered by records in %fst. Each record consists of:
This is some user supplied code that always consumes whatever source() callback returns (at some point in past), (optionally) regurgitates said input, and decides what [turn] to go next. Except when in special {state} (see below) it's supplied with one argument: $item. In special states $item is missing. switch() returns two controls: $rule and processed $item. What to do with returned $item is determined by $action (see below).
Each [turn] spec is an ARRAY with two elements (trailing elements are ignored). First element is $state to change to. Second is $action that sets what to do with $item upon changing to named $state. Here are known [turn]s in order of logical treating decreasing.
eturn
That [turn] will be choosen by FSM itself when $item at hands is undef (as returned by source()). switch() isn't invoked -- $item is void, there's nothing to call switch() with. However, $action may change $item.
uturn
That [turn] will be choosen by FSM if $rule is undef (as returned by switch()). Idea behind this is to give an FST an option to bailout. In original DMA::FSM that's not possible (except croaking, you know). Also, see BUGS AND CAVEATS.
tturn
fturn
If any (hence 'or') is present then $rule returned by switch() is treated as Perl boolean, except undef it's handled by uturn. That's how it is in original DMA::FSM. If switch() always returns TRUE (or FALSE) then fturn (or tturn) can be missing. Also, see BUGS AND CAVEATS.
If neither tturn nor fturn is present then whatever $rule would be returned by switch() is treated as string. That string is supposed to be a key in %$turns. $rule returned is forced to be string (so if you dare to return objects, such objects should have "" overloaded). Also, see BUGS AND CAEATS.
""
$state is treated as a key in FST hash, except when that's a special state. Special states (in alphabetical order):
BREAK
Basically, it's just like STOP $state. All comments there (see below) apply. It's added to enable break out from loop, do something, then get back in loop. $state is changed to CONTINUE just before returning to caller (switch() is called in BREAK state). The choice where to implicitly change state to CONTINUE has been completely arbitrary; probably wrong.
STOP
CONTINUE
Just like START state (see below, all comments apply). While BREAK is turned to CONTINUE implicitly no other handling is made.
START
It's $state set by connect(). $action (it's also set by connect()) is ignored (if $action is undef then silently replaces with empty string), switch() is invoked with no arguments (there's not anything to process yet). Whatever $item could be returned is ignored. $rule is followed. Thus eturn can't be followed. See also BUGS AND CAVEATS.
It's last state in the state flow. $action is retained (that's what process() will return) (however, because it's processed before STOP state is acknowledged it must not be undef) but otherwise ignored. switch() is invoked with no arguments (switch() of previous {state} should have took care). Whatever $item could be returned is ignored. Whatever $rule could be returned is reported (at (basic trace) level) but otherwise ignored. Then $action is returned and state flow terminates.
Supported $actions (in alphabetical order):
NEXT
Drop whatever $item at hands. Request another.
If FST has such record:
somestate => { eturn => [ somestate => 'NEXT' ] }
then FSM will stay in somestate as long as source() callback returns undef. Thus consuming all resources available. No options provided to limit that consumption.
somestate
SAME
Retains $item uncoditionally. That is, even if $item isn't defined it's kept anyway.
Beware, if FST has such record:
somestate => { eturn => [ somestate => 'SAME' ] }
then FSM will cycle here forever. That is, since source() isn't queried for other $item (what's the purpose of this action is anyway) there's no way to get out.
TSTL
Check if $item is defined, then go as with SAME or NEXT otherwise. That actually makes sense.
(note) This action name is legacy of DMA::Misc::FSM; Possibly, that's TeST something; Someone can just speculate what L could mean.
TeST
L
Access and utility methods to deal with various moves while doing The State Flow. These aren't forbidden for use from outside, while being quite internal nevertheles.
$rc = $self->query_rc( @args ); $rc = $self->verify( $rc, $state, $tag, $subject, $test );
Here comes rationale. Writing (or should I say "composing"?) correct {fst} A::F style is hard (I know what I'm talking about, I've made a dozen already). The purpose of verify() is to check if the {fst} at hands isn't fubar. Nothing more, nothing less. query_rc() is a placeholder for one of query_.*() methods, $test will be matched against ref $rc. Other arguments are to fill diagnostic output (if any). $state hints from what {state} $rc has been queried. $subject and $tag are short descriptive name and actual value of $rc. Yup, dealing with verify() might be fubar too.
ref $rc
$rc is passed through (or not). This croaks if $rc isn't defined or ref $rc doesn't match $test.
$bb->state eq 'something' and die; $state = $bb->state( $new_state );
Queries and sets state of A::F instance. Modes:
Returns state of instance. Note, Perl FALSE isa parameter.
Sets $state of instance. Returns previous $state.
%state = %{ $bb->fst( $state ) }; %state = %{ $bb->fst( $state => \%new_state ) }; $value = $bb->fst( $state => $entry ); $value = $bb->fst( $state => $entry => $new_value );
Queries and sets records and entries in {fst}. That is, not only entire {state}s but components of {state} are reachable too. Modes:
Executed if one scalar is passed in. Returns a {state} reference with whatever entries are set. Silently returns undef if $state is missing from {fst}.
Executed if one scalar and HASH are passed in. Sets a {state} with key/value pairs from HASH, creating one if necessary. Created record isa copy of HASH, not a reference (not a true deep copy though) (empty \%new_state is fine too) (copying isn't by design, it's implementation's quirk). Returns record as it was before setting (undef is returned if there were no such $state before).
Executed if two scalars are passed in. Returns an entry from named state record.
Executed if two scalars and anything else are passed in (no implicit intelligence about third parameter). Sets an entry in named state record, creating one (entry) if necessary. State record must exist beforehand. Entry isa exact value of least argument, not a copy. Returns whatever value $entry just had (undef is returned if there were none such $entry before).
None checks are made, except record must exist (for two latter uses).
$bb->turn( $state ) eq '' or die; $bb->turn( $state => 'uturn' )->[1] eq 'NEXT' or die;
Queries [turn]s of arbitrary {state}s. turn() doesn't manipulate entries, use fst() method instead if you can. Modes:
This mode is entered if there is lone scalar. Such scalar is believed to be $state. Returns something that describes what kind of least special states are present. Namely:
undef is returned if $state isn't present in the {fst} (also carps). Also see below.
Empty string is returned if there're tturn and/or fturn turns. turns hash is ignored in that case.
HASH is returned if there's turn map (and neither tturn nor fturn is present). (note) In that case, turn() checks for turns is indeed a HASH, nothing more (however croaks if that's not the case); It may as well be empty; Design legacy.
HASH
Returns HASH for STOP and BREAK $states without any further processing (For those $states any $rule is ignored and HASH enables switch() callbacks to give more informative logs (while that information is mangled anyway); Probably bad idea).
undef is returned if there's nothing to say -- neither tturn, nor fturn, nor turn map -- this record is kind of void. The record should be studied to find out why. carps in that case.
Two scalars are $state and specially encoded $rule (refer to query_switch() method about encoding). If $rule can't be decoded then croaks. Returns (after verification) requested $rule as ARRAY. While straightforward [turn]s (such as tturn, fturn, and such) could be in fact queried through fst() method turn map needs bit more sophisticated handling; and that's what turn() does; in fact asking for turns will result in croak. $action of START and CONTINUE special states suffer implicit defaulting to empty string.
No arguments or more then two is an non-fatal error. Returns undef (with carp).
$bb->action eq $action and die; $action = $bb->action( $new_action );
Queries and sets $action of A::F instance. Modes:
No arguments -- returns current $action of the instance. Note, Perl FALSE isa parameter.
One scalar -- sets action of the instance. Returns previous $action.
( $alpha, $bravo ) = $self->query( $what, $name, @items );
Internal method, then it becomes complicated. Resolves $what (some callback, there multiple of them) against $namespace, if necessary. Then invokes resolved code appropriately passing @items in, if any; Product of the callback over @items is returned back to the caller. $name is used for disgnostics only. Trust me, it all makes perfect sense.
$what must be either CODE or scalar, or else.
Strategy is like this
$what is invoked with $self and @items as arguments. Important, in this case $self is passed as first argument, OO isn't involved like at all.
Trade $namespace for $self (see below) and continue.
Treat $what as a name of function in $namespace namespace.
Treat $name as a name of method of object referred by $namespace.
It really works.
( $rule, $item ) = $self->query_switch( $item );
Internal multitool. That's the point where decisions about turns are made. (note) query_switch() converts $rule (as returned by switch()) to specially encoded scalar; it's caller's responcibility pick correct [turn] later. Strategy:
Special-state mode: invoke switch() with no arguments; ignore whatever $item has been possibly returned; return $rule alone.
EOF mode: ignore switch() completely; return eturn and undef.
King-size mode: invoke switch(), pass $item as single argument. return $rule and $item (whatever it became after going through switch()).
$rule, as it was returned by switch(), is encoded like this:
Return uturn. (note) Don't verify if uturn [turn] exists.
Return tturn (note) Don't verify if tturn [turn] exists.
Return fturn (note) Don't verify if fturn [turn] exists.
Encode $rule like this 'turn%' . $rule and return that. B((note)> Don't verify if turn map exists. (note) Don't verify if "turn%$rule" exists in turn map.
'turn%' . $rule
"turn%$rule"
switch() is always invoked in list context even if $item would be ignored. If $rule shouldn't be paired with $item it won't be (it's safe to call query_switch() in scalar context then and there won't be any trailing undefs).
( $item, $dump ) = $self->query_source;
Seeks source() callback and acquires whatever it returns. The callback is called in scalar context. As useful feature, also feeds $item to dumper callback. query() method has detailed description how source() callback is acquired. Returns $item and result of dumper callback.
$dump = $self->query_dumper( $item );
Seeks dumper callback (configured at construction time). If the callback wasn't configured uses simple hopefully informative and undef proof substitution. Whatever the callback returns is checked to be defined (undef is changed to "(unclear)") and then returned.
"(unclear)"
$bb->diag( 3, 'going to die at %i.', __LINE__ );
Internal. Provides unified and single-point-of-failure way to output diagnostics. Intensity is under control of diag_level configuration parameter. Each object has it's own, however it's inherited when objects are copied.
Defined levels are:
Nothing at all. Even error reporting is suppressed.
Default. Errors of here-be-dragons type.
2
Basic diagnostics for callbacks.
3
Basic trace. Construction, starting and leaving runs.
4
Extended diagnostics for callbacks.
5
Deep trace. By the way diagnostics of switch entry resolving.
$bb->carp( 'something wrong...' );
Internal. carps consistently if {_}{diag_level} is gt 0.
(missing feature) It's not hard to imagine application of rather limited turn map that should default on anything else deemed irrelevant. Right now to achieve logic like this such defaulting ought to be merged into switch(). That's insane.
(misdesign) Mechanics behind diagnostics isa failure. It's messy, fragile, misguided, and (honestly) premature. At the moment it's useless.
(messy, probably bug) connect() method description _declares_ that list is copied. Of course, it's not true deep copy ({fst} might contain CODE, it's not clear how to copy it). It's possible, one day list trailer variant of initialization may be put to sleep. See also linter below.
(missing feature) It might be hard to imagine, but FST might get out of hands (ie check t/process/quadratic.t). Indeed, some kind of (limited!) linter would be much desired. It's missing.
(caveat) Back then DMA::FSM treated undef as any other Perl FALSE. uturn $rule mech has made undef special (if switch() returns undef and uturn {turn} isn't present then it's a croak). Thus, at the moment, undef isn't FALSE (for A::F). This is counter-intuitive, actually.
(bug) Why A::F screws with caller, in case of API violations (by returning undef), is beyond my understanding now.
(bug) (also see switch() and $item) By design and legacy, there is single point of input -- source(). IRL, multiple sources are normal. Implementation wise that leads to source() that on the fly figures out current $state and then somehow branches (sometimes branches out). Such source()s look horrible because they are.
(bug) In contrary with STOP and BREAK special states, special treatement of START and CONTINUE is a side effect of process() method entry sequence. That's why routinely enter START or CONTINUE by state flow is of there-be-dragons type. Totally should be rewritten.
(bug) It might be surprising, but, from experience, the state flow mostly doesn't care about $item. Mostly, {state} entered with $action NEXT processes input and just wonders ahead. Still those pesky $items *must* be passed around (by design). Still every switch() *must* return $item too (even if it's just a placeholder). Something must be done about it.
(misdesign) First, by design and legacy switch() must report what turn the control flow must make (that's why it *must* return $rule). OTOH, there's some value in keeping switch()es as simple as possible what results in {state} with alone tturn {turn} and switch() that always returns TRUE. Changes are coming.
(misdesign) Encoding (so to speak) in use by turn() (in prediction mode) is plain stupid. undef signals two distinct conditions (granted, both are manifest of broken {fst}). Empty string doesn't distinguish safe (both tturn and fturn are present) and risky (tturn or fturn is missing) {state}. HASH doesn't say if there's anything in turn map. All that needs loads of workout.
[action]: changing action: (%s) (%s)
(deep trace), action() method. Exposes change of $action from previous (former %s) to current (latter %s).
[action]: too many args (%i)
(warning), action() method. Obvious. None or one argument is supposed.
[connect]: (%s): unknow option, ignored
(warning), connect() method. Each option that's not known to A::F is ignored and carped. There're no means for child class to force A::F (as a parent class) to accept something. Child classes should process their options by itself.
[connect]: clean init with (%i) items in FST
(basic trace), connect() method. During class construction FST has been found. That FST consists of %i items. Those items are number of $states and not $states plus {state}s.
[connect]: FST has no {START} state
(warning), connect() method. START {state} is required. It's missing. This situation will definetely result in devastating failure later.
[connect]: FST has no {STOP} state
(warning), connect() method. STOP {state} is required. It's missing. If FST is such that STOP $state can't be reached (for whatever reasons) this may be cosmetic.
[connect]: ignoring (%i) FST items in trailer
(warning), connect() method. A trailer has been found and was ignored. Beware, %i could be misleading. For HASH in trailer that HASH is considered and key number is reported. For list in trailer an item number in list is reported, even if it's twice as many in FST (what isa hash). Just because.
[connect]: (source): unset
(warning), connect() method. $source option isa unset, it should be. There's no other way to feed items in. This situation will definetely result in devastating failure later.
[connect]: stealing (%i) items in FST
(basic trace), connect() method. During object construction FST has been found. That FST consists of %i items. Those items are {state}s, not $states plus {state}s.
[fst]: creating {%s} record
(basic trace), fst() method. New state record has been created, named %s.
[fst]: creating {%s}{%s} entry
(basic trace), fst() method. New entry named %s (the latter) has been created in record named %s (the former).
[fst]: no args
(warning), fst() method. No arguments, it's an error. However, instead of promptly dieing, undef is returned in blind hope this will be devastating enough.
[fst]: (%s): no such {fst} record
(warning), fst() method. Requested entry %s is missing. State record ought to exist beforehand for any usecase except record creation.
[fst]: too many args (%i)
(warning), fst() method. Too many args have been passed in. And again, instead of prompt dieing undef is returned.
[fst]: updating {%s} record
(basic trace), fst() method. Named record (%s) has been updated.
[fst]: updating {%s}{%s} entry
(basic trace), fst() method. Named entry (%s, the latter) in record %s (the former) has been updated.
[process]: {%s}(%s): changing state: (CONTINUE)
(basic trace), process() method. Implicit change of state from BREAK to CONTINUE is about to happen.
[process]: {%s}(%s): entering
(basic trace), process() method. Entering state flow from $state %s (the former) with $action %s (the latter).
[process]: {%s}(%s): going for
(deep trace), process() method. Trying to enter $state %s (the former) with $action %s (the latter).
[process]: {%s}(%s): %s: going with
(basic trace), process() method. While in $state %s (1st) doing $action %s (2nd) the $item happens to be %s (3rd). undef will look like this: ((undef)).
((undef))
[process]: {%s}(%s): %s: turning with
(basic trace), process() method. switch() (of $state %s, the 1st) has returned $rule %s (2nd) and $item %s. Now dealing with this.
[process]: {%s}(%s): leaving
(basic trace), process() method. Leaving state flow with $state %s (the former) and $action %s (the latter).
[process]: {%s}(%s): switch returned: (%s)
(basic trace), process() method. switch() (of $state %s, the 1st, with $action %s, the 2nd) has been invoked and returned something that was interpreted as $rule %s, the 3rd.
[process]: {%s}(%s): unknown action
(croak), process() method. Attempt to enter $state %s (the former) has been made. However, it has failed because $action %s (the latter) isn't known.
[query]: [$caller]: <%s> package can't [%s] subroutine
(croak), query() method. $namespace and $what has been resolved as package %s (the former) and subroutine %s (the latter). However, the package can't do such subroutine.
[query]: [query_dumper]: %s !isa defined
[query]: [query_source]: %s !isa defined
[query]: [query_switch]: %s !isa defined
(croak), query() method. $what (%s is $name) should have some meaningful value. It doesn't.
[query]: [query_dumper]: %s isa (%s): no way to resolve this
[query]: [query_source]: %s isa (%s): no way to resolve this
[query]: [query_switch]: %s isa (%s): no way to resolve this
(croak), query() method. ref $what (the former %s) is %s (the latter). $what is neither CODE nor scalar.
ref $what
[query]: [query_dumper]: %s isa (%s)
[query]: [query_source]: %s isa (%s)
[query]: [query_switch]: %s isa (%s)
(deep trace), query() method. ref $what (the former %s) is %s (the latter).
[query]: [query_dumper]: {namespace} !isa defined
[query]: [query_source]: {namespace} !isa defined
[query]: [query_switch]: {namespace} !isa defined
(croak), query() method. $what isn't CODE, now to resolve it $namespace is required. Apparently, it was missing all along.
[query]: [query_dumper]: {namespace} isa (%s)
[query]: [query_source]: {namespace} isa (%s)
[query]: [query_switch]: {namespace} isa (%s)
(deep trace), query() method. ref $namespace is %s.
ref $namespace
[query]: [query_dumper]: defaulting %s to $self
[query]: [query_source]: defaulting %s to $self
[query]: [query_switch]: defaulting %s to $self
(deep trace), query() method. $namespace is an empty string. The blackboard object will be used to resolve the callback.
[query]: [query_dumper]: going for <%s>->[%s]
[query]: [query_source]: going for <%s>->[%s]
[query]: [query_switch]: going for <%s>->[%s]
(deep trace), query() method. Attempting to call %s (the latter) method on object of %s (the former) class.
[query]: [query_dumper]: going for <%s>::[%s]
[query]: [query_source]: going for <%s>::[%s]
[query]: [query_switch]: going for <%s>::[%s]
(deep trace), query() method. Attempting to call %s (the latter) subrouting of package %s (the former).
[query]: [query_dumper]: object of <%s> can't [%s] method
[query]: [query_source]: object of <%s> can't [%s] method
[query]: [query_switch]: object of <%s> can't [%s] method
(croak), query() method. The object of %s (the former) class can't do %s (the latter) method.
[state]: changing state: (%s) (%s)
(deep trace), state() method. Exposes change of state from previous (former %s) to current (latter %s).
[state]: too many args (%i)
(warning), state() method. Obvious. None or one argument is supposed. state() has returned undef in this case, most probably will bring havoc in a moment.
[turn]: (%s): no such {fst} record
(warning), turn() method. Peeking for [turn]s of %s $state yeilds nothing, there's no such state.
[turn]: {%s}: none supported turn
(warning), turn() method. Whatever content of %s entry is FSM doesn't know how to handle it.
[turn]: {%s}(%s): unknown turn
(croak), turn() method. There was request for [turn] %s (the latter) of $state %s (the former). While {state} record has been found and is OK, there is no such $rule.
[turn]: no args
(warning), turn() method. No argumets, it's an error.
[turn]: too many args (%i)
(warning), turn() method. There's no way to handle that many (namely: %i) arguments.
[verify]: {%s}{%s}: %s !isa defined
(croak), verify() method. $rc queried from something in {fst} related to %s (3rd) (value of which is %s (2nd)) while in $state %s (1st) isn't defined.
[verify]: {%s}{%s}: %s isa (%s), should be (%s)
(croak), verify() method. ref of $rc queried from something in {fst} related to %s (3rd) (value of which is %s (2nd)) while in $state %s (1st) is %s (4th). While it should be %s (5th) (the last one is literally $test).
Here are example records. Whole {fst}, honestly, might become enormous, thus are skipped for brewity.
alpha => { switch => sub { shift % 42, '' }, tturn => [ qw/ alpha NEXT / ], fturn => [ qw/ STOP horay! / ] }
source() supposedly produces some numbers. Then, if $item doesn't devide mod 42 then go for another number. If $item devides then break out. Also, please note, STOP (and BREAK) is special -- it needs defined $action but it can be literally anything.
mod 42
bravo => { switch => sub { my $item = shift; $item % 15 ? 'charlie' : $item % 5 ? 'delta' : $item % 3 ? 'echo' : undef, $item }, uturn => [ qw/ bravo NEXT / ], turns => { charlie => [ qw/ charlie SAME / ], delta => [ qw/ delta SAME / ], echo => [ qw/ echo SAME / ] } }
Again, source() supposedly produces some numbers. Then some kind of FizBuzz happens. Also, returning undef as default raises questions. However, it's acceptable for example.
Now, quick demonstration, that's how this FizzBuzz would look using DMA::FSM capabilities (and A::F of v2.2.7 syntax).
bravo_foo => { switch => sub { my $item = shift; $item % 15 ? !0 : !1, $item }, tturn => [ qw/ charlie SAME / ], fturn => [ qw/ bravo_bar SAME / ] }, bravo_bar => { switch => sub { my $item = shift; $item % 5 ? !0 : !1, $item }, tturn => [ qw/ delta SAME / ], fturn => [ qw/ bravo_baz SAME / ] }, bravo_baz => { switch => sub { my $item = shift; $item % 3 ? !0 : !1, $item }, tturn => [ qw/ echo SAME / ], fturn => [ qw/ bravo NEXT / ] }
World of a difference. Furthermore, if you dare, take a look at t/process/quadratic.t and t/process/sort.t. But better don't, those are horrible.
Now, illustration what $namespace configuration parameter opens.
Classics:
my $bb = Acme::FSM->connect( { }, alpha => { switch => sub { shift % 42, '' } } );
Illustrations below are heavily stripped for brevity (Perlwise and A::Fwise).
Separate namespace:
package Secret::Namespace; sub bravo_sn { shift; shift % 42, '' } package Regular::Namespace; use Acme::FSM; my $bb = Acme::FSM->connect( { namespace => 'Secret::Namespace' }, alpha => { switch => 'bravo_sn' } );
Separate class:
package Secret::Class; sub new { bless { }, shift } sub bravo_sc { shift; shift % 42, '' } package Regular::Class; use Secret::Class; use Acme::FSM; my $not_bb = Secret::Class->new; my $bb = Acme::FSM->connect( { namespace => $not_bb }, alpha => { switch => 'bravo_sc' } );
And, finally, A::F implodes upon itself:
package Secret::FSM; use parent qw/ Acme::FSM /; sub connect { my $class = shift; my $bb = $class->SUPER::connect( @_ ); } # or just skip constructor, if not needed sub bravo_sf { shift; shift % 42, '' } package main; my $bb = Secret::FSM->connect( { namespace => '' }, alpha => { switch => 'bravo_sf' } );
Original Copyright: 2008 Dale M Amon. All rights reserved. Original License: LGPL-2.1 Artistic BSD Original Code Acquired from: http://www.cpan.org/authors/id/D/DA/DALEAMON/DMAMisc-1.01-3.tar.gz Copyright 2012, 2013, 2022 Eric Pozharski <whynto@pozharski.name> GNU LGPLv3 AS-IS, NO-WARRANTY, HOPE-TO-BE-USEFUL
To install Acme::FSM, copy and paste the appropriate command in to your terminal.
cpanm
cpanm Acme::FSM
CPAN shell
perl -MCPAN -e shell install Acme::FSM
For more information on module installation, please visit the detailed CPAN module installation guide.