| 125 |
|
* } |
| 126 |
|
* |
| 127 |
|
* double distanceFromOriginV2() { // combines code paths |
| 128 |
+ |
* double currentX = 0.0, currentY = 0.0; |
| 129 |
|
* for (long stamp = sl.tryOptimisticRead(); ; stamp = sl.readLock()) { |
| 129 |
– |
* double currentX = 0.0, currentY = 0.0; |
| 130 |
|
* try { |
| 131 |
|
* currentX = x; |
| 132 |
|
* currentY = y; |
| 133 |
|
* } finally { |
| 134 |
|
* if (sl.tryConvertToOptimisticRead(stamp) != 0L) // unlock or validate |
| 135 |
< |
* return Math.sqrt(currentX * currentX + currentY * currentY); |
| 135 |
> |
* break; |
| 136 |
|
* } |
| 137 |
|
* } |
| 138 |
+ |
* return Math.sqrt(currentX * currentX + currentY * currentY); |
| 139 |
|
* } |
| 140 |
|
* |
| 141 |
|
* void moveIfAtOrigin(double newX, double newY) { // upgrade |
| 1008 |
|
/** |
| 1009 |
|
* If node non-null, forces cancel status and unsplices from queue |
| 1010 |
|
* if possible. This is a variant of cancellation methods in |
| 1011 |
< |
* AbstractQueuedSynchronizer (see its detailed explanation in |
| 1011 |
> |
* AbstractQueuedSynchronizer (see its detailed explanation in AQS |
| 1012 |
|
* internal documentation) that more conservatively wakes up other |
| 1013 |
< |
* threads that may have had their links changed so as to preserve |
| 1013 |
> |
* threads that may have had their links changed, so as to preserve |
| 1014 |
|
* liveness in the main signalling methods. |
| 1015 |
|
*/ |
| 1016 |
|
private long cancelWriter(WNode node, boolean interrupted) { |
