# | Line 12 | Line 12 | package java.util.concurrent; | |
---|---|---|
12 | * locks may display lower overall throughput (i.e., are slower) than | |
13 | * those using default locks, but have but smaller variances in times | |
14 | * to obtain locks. | |
15 | + | * @since 1.5 |
16 | + | * @author Doug Lea |
17 | */ | |
18 | ||
19 | public class FairReentrantLock extends ReentrantLock { | |
# | Line 23 | Line 25 | public class FairReentrantLock extends R | |
25 | /** | |
26 | * Return true if it is OK to take fast path to lock. For fair | |
27 | * locks, we allow barging only when there are no waiters. | |
28 | + | * @return true if queue empty |
29 | */ | |
30 | boolean canBarge() { | |
31 | return queueEmpty(); |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |