Lines Matching defs:done
262 'DoneAndNotDoneFutures', 'done not_done')
282 A named 2-tuple of sets. The first set, named 'done', contains the
290 done = {f for f in fs
292 not_done = fs - done
293 if (return_when == FIRST_COMPLETED) and done:
294 return DoneAndNotDoneFutures(done, not_done)
295 elif (return_when == FIRST_EXCEPTION) and done:
296 if any(f for f in done
298 return DoneAndNotDoneFutures(done, not_done)
300 if len(done) == len(fs):
301 return DoneAndNotDoneFutures(done, not_done)
310 done.update(waiter.finished_futures)
311 return DoneAndNotDoneFutures(done, fs - done)
393 def done(self):
433 isn't done. If None, then there is no limit on the wait time.
468 future isn't done. If None, then there is no limit on the wait