12.12 使用生成器代替线程.pdfVIP

12.12 使⽤⽣成器代替线程 问题 You want to implement concurrency using generators (coroutines) as an alternative tosystem threads. This is sometimes known as user-level threading or green threading . 解决⽅案 To implement your own concurrency using generators, you first need a fundamentalinsight concerning generator functions and the yield statement . Specifically , the fun-damental behavior of yield is that it causes a generator to suspend its e ecution . Bysuspending e ecution , it is possible to write a scheduler that treats generators as a kindof “task” and alternates their e ecution using a kind of cooperative task switching .To illustrate this idea, consider the following two generator functions using a simpleyield: Two simple generator functionsdef countdown(n): while n 0:print(‘T-minus, n)yieldn -= 1 print(‘Blastoff !) def countup(n): = 0while n: print(‘Counting up, )yield += 1 These functions probably look a bit funny using yield all by itself . However , considerthe following code that implements a simple task scheduler: from collections import deque class TaskScheduler:def init(self):self ._task_queue = deque()def new_task(self , task): ‘Admit a newly started task to the scheduler ‘self ._task_queue .append(task) def run(self): ‘Run until there are no more tasks‘while self ._task_queue: task = self ._task_queue .popleft()try: Run until the next yield statementnext(task)self._task_ ueue.append(task) e cept StopIteration:# Generator is no longer e ecutingpass Example usesched = TaskScheduler()sched.new_task(countdown(10))sched.new_ta In this code , the TaskScheduler class runs a collection of generators in a round-robinmanner —each one running until they reach a yield statement . For the sample , theoutput will be as follows: T-minus 10T-minus 5Counting up 0T-minus 9T-minus 4Counting up 1T-minus 8T-minus 3Coun