442 |
|
} |
443 |
|
|
444 |
|
/** |
445 |
< |
* push succeeds if not full; throws ISE if full |
445 |
> |
* push succeeds if not full; throws IllegalStateException if full |
446 |
|
*/ |
447 |
|
public void testPush() { |
448 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
492 |
|
} |
493 |
|
|
494 |
|
/** |
495 |
< |
* add succeeds if not full; throws ISE if full |
495 |
> |
* add succeeds if not full; throws IllegalStateException if full |
496 |
|
*/ |
497 |
|
public void testAdd() { |
498 |
|
LinkedBlockingDeque q = new LinkedBlockingDeque(SIZE); |
506 |
|
} |
507 |
|
|
508 |
|
/** |
509 |
< |
* addAll(this) throws IAE |
509 |
> |
* addAll(this) throws IllegalArgumentException |
510 |
|
*/ |
511 |
|
public void testAddAllSelf() { |
512 |
|
LinkedBlockingDeque q = populatedDeque(SIZE); |
1773 |
|
} |
1774 |
|
|
1775 |
|
/** |
1776 |
< |
* A deserialized serialized deque has same elements in same order |
1776 |
> |
* A deserialized/reserialized deque has same elements in same order |
1777 |
|
*/ |
1778 |
|
public void testSerialization() throws Exception { |
1779 |
|
Queue x = populatedDeque(SIZE); |