diff --git a/Lib/asyncio/queues.py b/Lib/asyncio/queues.py index a9656a6df561ba..825728b460478b 100644 --- a/Lib/asyncio/queues.py +++ b/Lib/asyncio/queues.py @@ -40,11 +40,11 @@ def __init__(self, maxsize=0): self._unfinished_tasks = 0 self._finished = locks.Event() self._finished.set() - self._init(maxsize) + self._init() # These three are overridable in subclasses. - def _init(self, maxsize): + def _init(self): self._queue = collections.deque() def _get(self): @@ -221,7 +221,7 @@ class PriorityQueue(Queue): Entries are typically tuples of the form: (priority number, data). """ - def _init(self, maxsize): + def _init(self): self._queue = [] def _put(self, item, heappush=heapq.heappush): @@ -234,7 +234,7 @@ def _get(self, heappop=heapq.heappop): class LifoQueue(Queue): """A subclass of Queue that retrieves most recently added entries first.""" - def _init(self, maxsize): + def _init(self): self._queue = [] def _put(self, item): diff --git a/Lib/queue.py b/Lib/queue.py index 55f50088460f9e..a9aa01663a1cde 100644 --- a/Lib/queue.py +++ b/Lib/queue.py @@ -33,7 +33,7 @@ class Queue: def __init__(self, maxsize=0): self.maxsize = maxsize - self._init(maxsize) + self._init() # mutex must be held whenever the queue is mutating. All methods # that acquire mutex must release it before returning. mutex @@ -203,7 +203,7 @@ def get_nowait(self): # These will only be called with appropriate locks held # Initialize the queue representation - def _init(self, maxsize): + def _init(self): self.queue = deque() def _qsize(self): @@ -226,7 +226,7 @@ class PriorityQueue(Queue): Entries are typically tuples of the form: (priority number, data). ''' - def _init(self, maxsize): + def _init(self): self.queue = [] def _qsize(self): @@ -242,7 +242,7 @@ def _get(self): class LifoQueue(Queue): '''Variant of Queue that retrieves most recently added entries first.''' - def _init(self, maxsize): + def _init(self): self.queue = [] def _qsize(self):