{"added":null,"apiVersion":1,"behindSince":null,"buildDepends":[],"categories":["devel","perl5"],"comment":"Build simple rules-based state machines in Perl","compare":null,"dependentCount":null,"description":"This class implements a simple state machine pattern, allowing you to\nquickly build rules-based state machines in Perl. As a simple\nimplementation of a powerful concept, it differs slightly from an ideal\nDFA model in that it does not enforce a single possible switch from one\nstate to another. Rather, it short circuits the evaluation of the rules\nfor such switches, so that the first rule to return a true value will\ntrigger its switch and no other switch rules will be checked. (But see the\nstrict attribute and parameter to new().) It differs from an NFA model in\nthat it offers no back-tracking. But in truth, you can use it to build a\nstate machine that adheres to either model--hence the more generic FSA\nmoniker.","flavors":[],"html":"https://daemonports.org/dragonfly/devel/p5-FSA-Rules/","kind":"port","lastUpdate":null,"license":["ART10","GPLv1+"],"maintainer":"perl@FreeBSD.org","name":"p5-FSA-Rules","newest":true,"newestVersion":"0.35","noVulnData":false,"origin":"devel/p5-FSA-Rules","otherSystems":[{"maintainer":"perl@FreeBSD.org","newest":true,"origin":"devel/p5-FSA-Rules","path":"/devel/p5-FSA-Rules/","system":"FreeBSD","version":"0.35"},{"maintainer":"perl@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/p5-FSA-Rules","path":"","system":"HardenedBSD","version":"0.35"},{"maintainer":"perl@FreeBSD.org","newest":true,"noVulnData":true,"origin":"devel/p5-FSA-Rules","path":"","system":"GhostBSD","version":"0.35"}],"packages":null,"pkgName":"p5-FSA-Rules-0.35","related":null,"repository":"DPorts","requiredBy":[],"requiredByCount":0,"runDepends":["graphics/p5-GraphViz","lang/perl5.36","textproc/p5-Text-Tabs+Wrap"],"status":null,"system":"dragonfly","systemLabel":"DragonFly","version":"0.35","versions":null,"vulnerabilities":null,"www":"https://metacpan.org/release/FSA-Rules"}