Lines Matching +full:remove +full:- +full:item
26 queue reaches maxsize, until an item is removed by get().
29 with qsize(), since your single-threaded asyncio application won't be
53 def _put(self, item): argument
54 self._queue.append(item)
110 async def put(self, item): argument
111 """Put an item into the queue.
113 Put an item into the queue. If the queue is full, wait until a free
114 slot is available before adding item.
125 self._putters.remove(putter)
135 return self.put_nowait(item)
137 def put_nowait(self, item): argument
138 """Put an item into the queue without blocking.
144 self._put(item)
150 """Remove and return an item from the queue.
152 If queue is empty, wait until an item is available.
163 self._getters.remove(getter)
176 """Remove and return an item from the queue.
178 Return an item if one is immediately available, else raise QueueEmpty.
182 item = self._get()
184 return item
195 item that had been put() into the queue).
202 self._unfinished_tasks -= 1
209 The count of unfinished tasks goes up whenever an item is added to the
211 indicate that the item was retrieved and all work on it is complete.
227 def _put(self, item, heappush=heapq.heappush): argument
228 heappush(self._queue, item)
240 def _put(self, item): argument
241 self._queue.append(item)