(self, task_ids, timeout=None, interval=0.5, no_ack=True,
on_message=None, on_interval=None, max_iterations=None,
READY_STATES=states.READY_STATES)
| 1300 | } |
| 1301 | |
| 1302 | def get_many(self, task_ids, timeout=None, interval=0.5, no_ack=True, |
| 1303 | on_message=None, on_interval=None, max_iterations=None, |
| 1304 | READY_STATES=states.READY_STATES): |
| 1305 | interval = 0.5 if interval is None else interval |
| 1306 | ids = task_ids if isinstance(task_ids, set) else set(task_ids) |
| 1307 | cached_ids = set() |
| 1308 | cache = self._cache |
| 1309 | for task_id in ids: |
| 1310 | try: |
| 1311 | cached = cache[task_id] |
| 1312 | except KeyError: |
| 1313 | pass |
| 1314 | else: |
| 1315 | if cached['status'] in READY_STATES: |
| 1316 | yield bytes_to_str(task_id), cached |
| 1317 | cached_ids.add(task_id) |
| 1318 | |
| 1319 | ids.difference_update(cached_ids) |
| 1320 | iterations = 0 |
| 1321 | time_elapsed = 0.0 |
| 1322 | while ids: |
| 1323 | keys = list(ids) |
| 1324 | r = self._mget_to_results(self.mget([self.get_key_for_task(k) |
| 1325 | for k in keys]), keys, READY_STATES) |
| 1326 | cache.update(r) |
| 1327 | ids.difference_update({bytes_to_str(v) for v in r}) |
| 1328 | for key, value in r.items(): |
| 1329 | if on_message is not None: |
| 1330 | on_message(value) |
| 1331 | yield bytes_to_str(key), value |
| 1332 | if not ids: |
| 1333 | # everything asked for has been handed back, so there is |
| 1334 | # nothing left to time out on. wait_for checks the same way, |
| 1335 | # returning a ready result before it looks at the deadline. |
| 1336 | break |
| 1337 | if timeout is not None and time_elapsed >= timeout: |
| 1338 | raise TimeoutError(f'Operation timed out ({timeout})') |
| 1339 | if on_interval: |
| 1340 | on_interval() |
| 1341 | # don't busy loop, and never sleep past the deadline: with the |
| 1342 | # deadline counted in whole intervals, timeout=0 waited forever |
| 1343 | # and any timeout below interval overshot to interval. |
| 1344 | nap = interval if timeout is None else min(interval, |
| 1345 | timeout - time_elapsed) |
| 1346 | time.sleep(nap) |
| 1347 | time_elapsed += nap |
| 1348 | iterations += 1 |
| 1349 | if max_iterations and iterations >= max_iterations: |
| 1350 | break |
| 1351 | |
| 1352 | def _forget(self, task_id): |
| 1353 | self.delete(self.get_key_for_task(task_id)) |
no test coverage detected