[英]Python threading: What am I missing? (task_done() called too many times)
[英]Queue.asyncio ValueError: task_done() called too many times - Coding error or a bug detected?
我实现了一段代码,它从一个队列中获取一个元素,并将相同的对象从队列列表中放入每个队列中。 问题是,当我运行特定测试时,我收到ValueError: task_done() called too many times
异常。 这个错误发生在测试代码中,而不是在被测试的代码中。
我正在使用asyncio.Queue
并使用协程进行编程。 我将每个Queue.get
与一个Queue.task_done
调用相匹配。 我正在用pytest测试代码。
我正在使用以下库:
我有两个文件: middleware.py
包含我类的实现和test_middleware.py
实现了pytest测试。
文件middlware.py
:
import asyncio
class DistributorMiddleware:
def __init__(self, in_queue, out_list_queue):
self._in = in_queue
self._out = out_list_queue
async def distribute(self):
while True:
ele = await self._in.get()
count=0
for queue in self._out:
await queue.put(ele)
count+=1
print(f'inserted ele in {count}')
queue.task_done()
if ele == None:
break
for queue in self._out:
await queue.join()
文件test_middleware.py
:
import pytest
import asyncio
from asyncio import Queue
from middleware import DistributorMiddleware
import random
import os
@pytest.mark.asyncio
async def test_distribution(request, event_loop):
q_list = [ Queue() for _ in range(10) ]
_in = Queue()
distrib = DistributorMiddleware(_in, q_list)
event_loop.create_task(distrib.distribute())
num_ele = random.randint(1, 10)
ele_set = set()
for _ in range(num_ele):
ele = os.urandom(4)
ele_set.add(ele)
await _in.put(ele)
await _in.put(None)
await asyncio.sleep(1)
for i,q in enumerate(q_list):
assert q.qsize() == num_ele + 1
c_set = ele_set.copy()
count= 0
while True:
e = await q.get()
count+=1
print(f'Queue {i}: element: "{e}" number {count} extracted of {q.qsize()}!')
q.task_done()
if e == None:
break
assert e in c_set
c_set.remove(e)
在测试中,中间件应该从输入队列中获取元素并将它们放入列表中的 10 个队列中。 它可以正确地完成工作。
测试代码从 10 个队列中的每一个中获取所有元素,并检查它们是否存在于原始队列中。 对于第 9 个队列,一切顺利,没有错误,但是当测试尝试从第十个列表中获取第一个元素时,会引发ValueError
:
request = <FixtureRequest for <Function 'test_distribution'>>, event_loop = <_UnixSelectorEventLoop running=False closed=False debug=False>
@pytest.mark.asyncio
async def test_distribution(request, event_loop):
q_list = [ Queue() for _ in range(10) ]
_in = Queue()
distrib = DistributorMiddleware(_in, q_list)
event_loop.create_task(distrib.distribute())
num_ele = random.randint(1, 10)
ele_set = set()
for _ in range(num_ele):
ele = os.urandom(4)
ele_set.add(ele)
await _in.put(ele)
await _in.put(None)
await asyncio.sleep(1)
for i,q in enumerate(q_list):
assert q.qsize() == num_ele + 1
c_set = ele_set.copy()
count= 0
while True:
e = await q.get()
count+=1
print(f'Queue {i}: element: "{e}" number {count} extracted of {q.qsize()}!')
> q.task_done()
test_middlewares.py:34:
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _
self = <Queue at 0x7f7af5b9d828 maxsize=0 _queue=[b'\x15\xad\t\xaf', b'\x8b\xa2M=', None]>
def task_done(self):
"""Indicate that a formerly enqueued task is complete.
Used by queue consumers. For each get() used to fetch a task,
a subsequent call to task_done() tells the queue that the processing
on the task is complete.
If a join() is currently blocking, it will resume when all items have
been processed (meaning that a task_done() call was received for every
item that had been put() into the queue).
Raises ValueError if called more times than there were items placed in
the queue.
"""
if self._unfinished_tasks <= 0:
> raise ValueError('task_done() called too many times')
E ValueError: task_done() called too many times
/usr/lib/python3.7/asyncio/queues.py:202: ValueError
每个get
匹配一个task_done
。 我可以验证对test_middlware.py
文件进行以下修改:
- q.task_done()
+ try:
+ q.task_done()
+ except ValueError as err:
+ print(f'Value Error: {err}')
+ print(q.qsize())
这样做我可以看到,即使引发了许多ValueError
,元素也会继续从队列中检索。 测试成功:
platform linux -- Python 3.7.1, pytest-3.10.0, py-1.7.0, pluggy-0.8.0
rootdir: /tmp/stack, inifile:
plugins: asyncio-0.9.0
collected 1 item
test_middlewares.py . [100%]
============================================================================================ 1 passed in 1.04 seconds =============================================================================================
为了确保测试消耗了所有列表中的所有元素,我在测试结束时强制添加了一个错误断言:
assert e in c_set
c_set.remove(e)
+ assert False == True
+
结果输出显示从所有列表中检索了所有元素,但最后一个队列上的每个 task_done 都会生成一个ValueError
。
Queue 7: element: "b'\x9b\xf8m\x02'" number 1 extracted of 3!
Queue 7: element: "b'\x15\xad\t\xaf'" number 2 extracted of 2!
Queue 7: element: "b'\x8b\xa2M='" number 3 extracted of 1!
Queue 7: element: "None" number 4 extracted of 0!
Queue 8: element: "b'\x9b\xf8m\x02'" number 1 extracted of 3!
Queue 8: element: "b'\x15\xad\t\xaf'" number 2 extracted of 2!
Queue 8: element: "b'\x8b\xa2M='" number 3 extracted of 1!
Queue 8: element: "None" number 4 extracted of 0!
Queue 9: element: "b'\x9b\xf8m\x02'" number 1 extracted of 3!
============================================================================================ 1 failed in 1.06 seconds ==
问题是,我是否遗漏了什么,我的代码有错误还是我发现了一个错误?
您的代码中有错误。 实际上, queue.task_done()
应该只在从队列中取出元素时调用,而不是在将它们放入队列时调用。
但是你的中间件类正在一个队列上调用它,它刚刚使用了.put()
,用于self._out
列表中的最后一个队列; 从DistributorMiddleware.distribute()
删除queue.task_done()
调用:
async def distribute(self):
while True:
ele = await self._in.get()
count=0
for queue in self._out:
await queue.put(ele)
count+=1
print(f'inserted ele in {count}')
queue.task_done()
# ^^^^^ you didn't take anything from the queue here!
当您删除该行时,您的测试就通过了。
您在测试中看到异常的原因是因为只有这样队列才知道task_done()
被调用得太频繁了。 所述queue.task_done()
在调用DistributorMiddleware.distribute()
减1,未完成的任务计数器,但只有当该计数器下降到零以下可以在异常被检测到。 只有当最后一个任务从test_distribution()
中的队列中取出时,您才会到达那个点,此时未完成的任务计数器至少提前一步达到 0。
也许这意味着调用self._in.task_done()
代替? 你只是在那个while
循环中从队列中取出一个元素:
async def distribute(self):
while True:
ele = await self._in.get()
# getting an element from self._in
count=0
for queue in self._out:
await queue.put(ele)
count+=1
print(f'inserted ele in {count}')
self._in.task_done()
# done with ele, so decrement the self._in unfinished tasks counter
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.