61 |
|
* @author Martin Buchholz |
62 |
|
* @param <E> the type of elements held in this collection |
63 |
|
*/ |
64 |
– |
|
64 |
|
public class ConcurrentLinkedDeque<E> |
65 |
|
extends AbstractCollection<E> |
66 |
|
implements Deque<E>, java.io.Serializable { |
305 |
|
static { |
306 |
|
try { |
307 |
|
UNSAFE = getUnsafe(); |
308 |
< |
Class k = Node.class; |
308 |
> |
Class<?> k = Node.class; |
309 |
|
prevOffset = UNSAFE.objectFieldOffset |
310 |
|
(k.getDeclaredField("prev")); |
311 |
|
itemOffset = UNSAFE.objectFieldOffset |
1220 |
|
* The following code can be used to dump the deque into a newly |
1221 |
|
* allocated array of {@code String}: |
1222 |
|
* |
1223 |
< |
* <pre> |
1225 |
< |
* String[] y = x.toArray(new String[0]);</pre> |
1223 |
> |
* <pre> {@code String[] y = x.toArray(new String[0]);}</pre> |
1224 |
|
* |
1225 |
|
* Note that {@code toArray(new Object[0])} is identical in function to |
1226 |
|
* {@code toArray()}. |
1426 |
|
NEXT_TERMINATOR.prev = NEXT_TERMINATOR; |
1427 |
|
try { |
1428 |
|
UNSAFE = getUnsafe(); |
1429 |
< |
Class k = ConcurrentLinkedDeque.class; |
1429 |
> |
Class<?> k = ConcurrentLinkedDeque.class; |
1430 |
|
headOffset = UNSAFE.objectFieldOffset |
1431 |
|
(k.getDeclaredField("head")); |
1432 |
|
tailOffset = UNSAFE.objectFieldOffset |