You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Instead of each poll call being O(N) in time, it should be O(1) in time, by tracking which futures have been woken on each iteration, and only waking those.
This acts as a guard against faulty manually implemented futures which don't have a fast return path in the case the wake is a no-op. #8 is a first attempt at such a patch, but needs more work to finish up.
Instead of each
poll
call beingO(N)
in time, it should beO(1)
in time, by tracking which futures have been woken on each iteration, and only waking those.This acts as a guard against faulty manually implemented futures which don't have a fast return path in the case the wake is a no-op. #8 is a first attempt at such a patch, but needs more work to finish up.
Tasks
Priority
Merge for Vec
Implement "perfect" waking forimpl Merge for Vec
(1/2) #50, Implement "perfect" waking forimpl Merge for Vec
(2/2) #57Merge for Array
perfect waker forarray::Merge
#75Merge for tuple
Implement "perfect" waking fortuple::merge
#96Secondary
Join for Vec
Join for Array
Join for tuple
Race for Vec
Race for Array
Race for tuple
Eventually
TryJoin for Vec
TryJoin for Array
TryRace for Vec
TryRace for Array
The text was updated successfully, but these errors were encountered: