| # | Line 271 | Line 271 | public class LinkedTransferQueue<E> exte | |
|---|---|---|
| 271 | * attempt advances head by two (if applicable), we ensure that | |
| 272 | * the slack does not grow without bound. Traversals also check | |
| 273 | * if the initial head is now off-list, in which case they | |
| 274 | < | * start at the new head. |
| 274 | > | * restart at the new head. |
| 275 | * | |
| 276 | * If no candidates are found and the call was untimed | |
| 277 | < | * poll/offer, (argument "how" is NOW) return. |
| 277 | > | * poll/offer (argument "how" is NOW), return. |
| 278 | * | |
| 279 | * 2. Try to append a new node (method tryAppend) | |
| 280 | * | |
| – | Removed lines |
| + | Added lines |
| < | Changed lines |
| > | Changed lines |