Python实现简单状态框架的方法
admin
2023-07-31 02:16:56
0

本文实例讲述了Python实现简单状态框架的方法。分享给大家供大家参考。具体分析如下:

这里使用Python实现一个简单的状态框架,代码需要在python3.2环境下运行

复制代码 代码如下:from time import sleep
from random import randint, shuffle
class StateMachine(object):
    \’\’\’ Usage:  Create an instance of StateMachine, use set_starting_state(state) to give it an
        initial state to work with, then call tick() on each second (or whatever your desired
        time interval might be. \’\’\’
    def set_starting_state(self, state):
        \’\’\’ The entry state for the state machine. \’\’\’
        state.enter()
        self.state = state
    def tick(self):
        \’\’\’ Calls the current state\’s do_work() and checks for a transition \’\’\’
        next_state = self.state.check_transitions()
        if next_state is None:
            # Stick with this state
            self.state.do_work()
        else:
            # Next state found, transition to it
            self.state.exit()
            next_state.enter()
            self.state = next_state
class BaseState(object):
    \’\’\’ Usage: Subclass BaseState and override the enter(), do_work(), and exit() methods.
            enter()    — Setup for your state should occur here.  This likely includes adding
                          transitions or initializing member variables.
            do_work()  — Meat and potatoes of your state.  There may be some logic here that will
                          cause a transition to trigger.
            exit()     — Any cleanup or final actions should occur here.  This is called just
                          before transition to the next state.
    \’\’\’
    def add_transition(self, condition, next_state):
        \’\’\’ Adds a new transition to the state.  The \”condition\” param must contain a callable
            object.  When the \”condition\” evaluates to True, the \”next_state\” param is set as
            the active state. \’\’\’
        # Enforce transition validity
        assert(callable(condition))
        assert(hasattr(next_state, \”enter\”))
        assert(callable(next_state.enter))
        assert(hasattr(next_state, \”do_work\”))
        assert(callable(next_state.do_work))
        assert(hasattr(next_state, \”exit\”))
        assert(callable(next_state.exit))
        # Add transition
        if not hasattr(self, \”transitions\”):
            self.transitions = []
        self.transitions.append((condition, next_state))
    def check_transitions(self):
        \’\’\’ Returns the first State thats condition evaluates true (condition order is randomized) \’\’\’
        if hasattr(self, \”transitions\”):
            shuffle(self.transitions)
            for transition in self.transitions:
                condition, state = transition
                if condition():
                    return state
    def enter(self):
        pass
    def do_work(self):
        pass
    def exit(self):
        pass
##################################################################################################
############################### EXAMPLE USAGE OF STATE MACHINE ###################################
##################################################################################################
class WalkingState(BaseState):
    def enter(self):
        print(\”WalkingState: enter()\”)
        def condition(): return randint(1, 5) == 5
        self.add_transition(condition, JoggingState())
        self.add_transition(condition, RunningState())
    def do_work(self):
        print(\”Walking…\”)
    def exit(self):
        print(\”WalkingState: exit()\”)
class JoggingState(BaseState):
    def enter(self):
        print(\”JoggingState: enter()\”)
        self.stamina = randint(5, 15)
        def condition(): return self.stamina <= 0
        self.add_transition(condition, WalkingState())
    def do_work(self):
        self.stamina -= 1
        print(\”Jogging ({0})…\”.format(self.stamina))
    def exit(self):
        print(\”JoggingState: exit()\”)
class RunningState(BaseState):
    def enter(self):
        print(\”RunningState: enter()\”)
        self.stamina = randint(5, 15)
        def walk_condition(): return self.stamina <= 0
        self.add_transition(walk_condition, WalkingState())
        def trip_condition(): return randint(1, 10) == 10
        self.add_transition(trip_condition, TrippingState())
    def do_work(self):
        self.stamina -= 2
        print(\”Running ({0})…\”.format(self.stamina))
    def exit(self):
        print(\”RunningState: exit()\”)
class TrippingState(BaseState):
    def enter(self):
        print(\”TrippingState: enter()\”)
        self.tripped = False
        def condition(): return self.tripped
        self.add_transition(condition, WalkingState())
    def do_work(self):
        print(\”Tripped!\”)
        self.tripped = True
    def exit(self):
        print(\”TrippingState: exit()\”)
if __name__ == \”__main__\”:
    state = WalkingState()
    state_machine = StateMachine()
    state_machine.set_starting_state(state)
    while True:
        state_machine.tick()
        sleep(1)

希望本文所述对大家的Python程序设计有所帮助。

相关内容

热门资讯

500 行 Python 代码... 语法分析器描述了一个句子的语法结构,用来帮助其他的应用进行推理。自然语言引入了很多意外的歧义,以我们...
定时清理删除C:\Progra... C:\Program Files (x86)下面很多scoped_dir开头的文件夹 写个批处理 定...
65536是2的几次方 计算2... 65536是2的16次方:65536=2⁶ 65536是256的2次方:65536=256 6553...
Mobi、epub格式电子书如... 在wps里全局设置里有一个文件关联,打开,勾选电子书文件选项就可以了。
scoped_dir32_70... 一台虚拟机C盘总是莫名奇妙的空间用完,导致很多软件没法再运行。经过仔细检查发现是C:\Program...
小程序支付时提示:appid和... [Q]小程序支付时提示:appid和mch_id不匹配 [A]小程序和微信支付没有进行关联,访问“小...
pycparser 是一个用... `pycparser` 是一个用 Python 编写的 C 语言解析器。它可以用来解析 C 代码并构...
微信小程序使用slider实现... 众所周知哈,微信小程序里面的音频播放是没有进度条的,但最近有个项目呢,客户要求音频要有进度条控制,所...
python查找阿姆斯特朗数 题目解释 如果一个n位正整数等于其各位数字的n次方之和,则称该数为阿姆斯特朗数。 例如1^3 + 5...
Apache Doris 2.... 亲爱的社区小伙伴们,我们很高兴地向大家宣布,Apache Doris 2.0.0 版本已于...