| 1 |
/* |
| 2 |
* Written by Doug Lea with assistance from members of JCP JSR-166 |
| 3 |
* Expert Group and released to the public domain, as explained at |
| 4 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 5 |
* Other contributors include Andrew Wright, Jeffrey Hayes, |
| 6 |
* Pat Fisher, Mike Judd. |
| 7 |
*/ |
| 8 |
|
| 9 |
import java.util.AbstractQueue; |
| 10 |
import java.util.Arrays; |
| 11 |
import java.util.Iterator; |
| 12 |
import java.util.NoSuchElementException; |
| 13 |
|
| 14 |
import junit.framework.Test; |
| 15 |
import junit.framework.TestSuite; |
| 16 |
|
| 17 |
public class AbstractQueueTest extends JSR166TestCase { |
| 18 |
public static void main(String[] args) { |
| 19 |
junit.textui.TestRunner.run(suite()); |
| 20 |
} |
| 21 |
public static Test suite() { |
| 22 |
return new TestSuite(AbstractQueueTest.class); |
| 23 |
} |
| 24 |
|
| 25 |
static class Succeed extends AbstractQueue<Integer> { |
| 26 |
public boolean offer(Integer x) { |
| 27 |
if (x == null) throw new NullPointerException(); |
| 28 |
return true; |
| 29 |
} |
| 30 |
public Integer peek() { return one; } |
| 31 |
public Integer poll() { return one; } |
| 32 |
public int size() { return 0; } |
| 33 |
public Iterator iterator() { return null; } // not needed |
| 34 |
} |
| 35 |
|
| 36 |
static class Fail extends AbstractQueue<Integer> { |
| 37 |
public boolean offer(Integer x) { |
| 38 |
if (x == null) throw new NullPointerException(); |
| 39 |
return false; |
| 40 |
} |
| 41 |
public Integer peek() { return null; } |
| 42 |
public Integer poll() { return null; } |
| 43 |
public int size() { return 0; } |
| 44 |
public Iterator iterator() { return null; } // not needed |
| 45 |
} |
| 46 |
|
| 47 |
/** |
| 48 |
* add returns true if offer succeeds |
| 49 |
*/ |
| 50 |
public void testAddS() { |
| 51 |
Succeed q = new Succeed(); |
| 52 |
assertTrue(q.add(two)); |
| 53 |
} |
| 54 |
|
| 55 |
/** |
| 56 |
* add throws ISE true if offer fails |
| 57 |
*/ |
| 58 |
public void testAddF() { |
| 59 |
Fail q = new Fail(); |
| 60 |
try { |
| 61 |
q.add(one); |
| 62 |
shouldThrow(); |
| 63 |
} catch (IllegalStateException success) {} |
| 64 |
} |
| 65 |
|
| 66 |
/** |
| 67 |
* add throws NPE if offer does |
| 68 |
*/ |
| 69 |
public void testAddNPE() { |
| 70 |
Succeed q = new Succeed(); |
| 71 |
try { |
| 72 |
q.add(null); |
| 73 |
shouldThrow(); |
| 74 |
} catch (NullPointerException success) {} |
| 75 |
} |
| 76 |
|
| 77 |
/** |
| 78 |
* remove returns normally if poll succeeds |
| 79 |
*/ |
| 80 |
public void testRemoveS() { |
| 81 |
Succeed q = new Succeed(); |
| 82 |
q.remove(); |
| 83 |
} |
| 84 |
|
| 85 |
/** |
| 86 |
* remove throws NSEE if poll returns null |
| 87 |
*/ |
| 88 |
public void testRemoveF() { |
| 89 |
Fail q = new Fail(); |
| 90 |
try { |
| 91 |
q.remove(); |
| 92 |
shouldThrow(); |
| 93 |
} catch (NoSuchElementException success) {} |
| 94 |
} |
| 95 |
|
| 96 |
/** |
| 97 |
* element returns normally if peek succeeds |
| 98 |
*/ |
| 99 |
public void testElementS() { |
| 100 |
Succeed q = new Succeed(); |
| 101 |
q.element(); |
| 102 |
} |
| 103 |
|
| 104 |
/** |
| 105 |
* element throws NSEE if peek returns null |
| 106 |
*/ |
| 107 |
public void testElementF() { |
| 108 |
Fail q = new Fail(); |
| 109 |
try { |
| 110 |
q.element(); |
| 111 |
shouldThrow(); |
| 112 |
} catch (NoSuchElementException success) {} |
| 113 |
} |
| 114 |
|
| 115 |
/** |
| 116 |
* addAll(null) throws NPE |
| 117 |
*/ |
| 118 |
public void testAddAll1() { |
| 119 |
Succeed q = new Succeed(); |
| 120 |
try { |
| 121 |
q.addAll(null); |
| 122 |
shouldThrow(); |
| 123 |
} catch (NullPointerException success) {} |
| 124 |
} |
| 125 |
|
| 126 |
/** |
| 127 |
* addAll(this) throws IAE |
| 128 |
*/ |
| 129 |
public void testAddAllSelf() { |
| 130 |
Succeed q = new Succeed(); |
| 131 |
try { |
| 132 |
q.addAll(q); |
| 133 |
shouldThrow(); |
| 134 |
} catch (IllegalArgumentException success) {} |
| 135 |
} |
| 136 |
|
| 137 |
/** |
| 138 |
* addAll of a collection with null elements throws NPE |
| 139 |
*/ |
| 140 |
public void testAddAll2() { |
| 141 |
Succeed q = new Succeed(); |
| 142 |
Integer[] ints = new Integer[SIZE]; |
| 143 |
try { |
| 144 |
q.addAll(Arrays.asList(ints)); |
| 145 |
shouldThrow(); |
| 146 |
} catch (NullPointerException success) {} |
| 147 |
} |
| 148 |
|
| 149 |
/** |
| 150 |
* addAll of a collection with any null elements throws NPE after |
| 151 |
* possibly adding some elements |
| 152 |
*/ |
| 153 |
public void testAddAll3() { |
| 154 |
Succeed q = new Succeed(); |
| 155 |
Integer[] ints = new Integer[SIZE]; |
| 156 |
for (int i = 0; i < SIZE-1; ++i) |
| 157 |
ints[i] = new Integer(i); |
| 158 |
try { |
| 159 |
q.addAll(Arrays.asList(ints)); |
| 160 |
shouldThrow(); |
| 161 |
} catch (NullPointerException success) {} |
| 162 |
} |
| 163 |
|
| 164 |
/** |
| 165 |
* addAll throws ISE if an add fails |
| 166 |
*/ |
| 167 |
public void testAddAll4() { |
| 168 |
try { |
| 169 |
Fail q = new Fail(); |
| 170 |
Integer[] ints = new Integer[SIZE]; |
| 171 |
for (int i = 0; i < SIZE; ++i) |
| 172 |
ints[i] = new Integer(i); |
| 173 |
q.addAll(Arrays.asList(ints)); |
| 174 |
shouldThrow(); |
| 175 |
} catch (IllegalStateException success) {} |
| 176 |
} |
| 177 |
|
| 178 |
} |
