# | Line 521 | Line 521 | public class LinkedBlockingQueue<E> exte | |
---|---|---|
521 | } | |
522 | // Transfer the elements outside of locks | |
523 | int n = 0; | |
524 | < | for (Node p = first; p != null; p = p.next) { |
525 | < | c.add((E)p.item); |
524 | > | for (Node<E> p = first; p != null; p = p.next) { |
525 | > | c.add(p.item); |
526 | p.item = null; | |
527 | ++n; | |
528 | } | |
# | Line 539 | Line 539 | public class LinkedBlockingQueue<E> exte | |
539 | fullyLock(); | |
540 | try { | |
541 | int n = 0; | |
542 | < | Node p = head.next; |
542 | > | Node<E> p = head.next; |
543 | while (p != null && n < maxElements) { | |
544 | < | c.add((E)p.item); |
544 | > | c.add(p.item); |
545 | p.item = null; | |
546 | p = p.next; | |
547 | ++n; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |