| 332 |
|
* |
| 333 |
|
* Without taking these into account, it would be possible for an |
| 334 |
|
* unbounded number of supposedly removed nodes to remain reachable. |
| 335 |
< |
* Situations leading to such buildup are uncommon but can occur in |
| 336 |
< |
* practice; for example when a series of short timed calls to poll |
| 337 |
< |
* repeatedly time out but never otherwise fall off the list because |
| 338 |
< |
* of an untimed call to take() at the front of the queue. |
| 335 |
> |
* Situations leading to such buildup are uncommon but can occur |
| 336 |
> |
* in practice; for example when a series of short timed calls to |
| 337 |
> |
* poll repeatedly time out at the trailing node but otherwise |
| 338 |
> |
* never fall off the list because of an untimed call to take() at |
| 339 |
> |
* the front of the queue. |
| 340 |
|
* |
| 341 |
|
* When these cases arise, rather than always retraversing the |
| 342 |
|
* entire list to find an actual predecessor to unlink (which |
