# | Line 1398 | Line 1398 | public class ConcurrentLinkedDeque<E> | |
---|---|---|
1398 | if (p.item == null && p == (p = p.next)) | |
1399 | current = p = q.first(); | |
1400 | if (p != null && p.next != null) { | |
1401 | < | Object[] a; |
1402 | < | try { |
1403 | < | a = new Object[n]; |
1404 | < | } catch (OutOfMemoryError oome) { |
1405 | < | return null; |
1406 | < | } |
1401 | > | Object[] a = new Object[n]; |
1402 | int i = 0; | |
1403 | do { | |
1404 | if ((a[i] = p.item) != null) |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |