Let last_deadline be the last idle period deadline associated with the current event loop, or 0 if no previous deadline exists.
If last_deadline is less than the current time:
Wait until current time is equal to last_deadline.
The first time this is executed, there will be no last idle period deadline, so last_deadline will be 0. It will always be the case that 0 < performance.now(), thus we take the branch at step 2 and wait for the current time to equal last_deadline, which will never happen.
The Processing Model says the following:
The first time this is executed, there will be no last idle period deadline, so
last_deadline
will be 0. It will always be the case that0 < performance.now()
, thus we take the branch at step 2 and wait for the current time to equallast_deadline
, which will never happen.