# | Line 780 | Line 780 | public class ConcurrentLinkedDeque<E> | |
---|---|---|
780 | if (h == null) | |
781 | h = t = newNode; | |
782 | else { | |
783 | < | t.next = newNode; |
784 | < | newNode.prev = t; |
783 | > | t.lazySetNext(newNode); |
784 | > | newNode.lazySetPrev(t); |
785 | t = newNode; | |
786 | } | |
787 | } | |
# | Line 1062 | Line 1062 | public class ConcurrentLinkedDeque<E> | |
1062 | if (splice == null) | |
1063 | splice = last = newNode; | |
1064 | else { | |
1065 | < | last.next = newNode; |
1066 | < | newNode.prev = last; |
1065 | > | last.lazySetNext(newNode); |
1066 | > | newNode.lazySetPrev(last); |
1067 | last = newNode; | |
1068 | } | |
1069 | } | |
# | Line 1327 | Line 1327 | public class ConcurrentLinkedDeque<E> | |
1327 | if (h == null) | |
1328 | h = t = newNode; | |
1329 | else { | |
1330 | < | t.next = newNode; |
1331 | < | newNode.prev = t; |
1330 | > | t.lazySetNext(newNode); |
1331 | > | newNode.lazySetPrev(t); |
1332 | t = newNode; | |
1333 | } | |
1334 | } |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |