| Methods Summary |
|---|
| public static void | main(java.lang.String[] args)
junit.textui.TestRunner.run (suite());
|
| private java.util.concurrent.ConcurrentLinkedQueue | populatedQueue(int n)Create a queue of given size containing consecutive
Integers 0 ... n.
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
assertTrue(q.isEmpty());
for(int i = 0; i < n; ++i)
assertTrue(q.offer(new Integer(i)));
assertFalse(q.isEmpty());
assertEquals(n, q.size());
return q;
|
| public static junit.framework.Test | suite()
return new TestSuite(ConcurrentLinkedQueueTest.class);
|
| public void | testAdd()add returns true
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, q.size());
assertTrue(q.add(new Integer(i)));
}
|
| public void | testAddAll1()addAll(null) throws NPE
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.addAll(null);
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testAddAll2()addAll of a collection with null elements throws NPE
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
Integer[] ints = new Integer[SIZE];
q.addAll(Arrays.asList(ints));
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testAddAll3()addAll of a collection with any null elements throws NPE after
possibly adding some elements
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE-1; ++i)
ints[i] = new Integer(i);
q.addAll(Arrays.asList(ints));
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testAddAll5()Queue contains all elements, in traversal order, of successful addAll
try {
Integer[] empty = new Integer[0];
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE; ++i)
ints[i] = new Integer(i);
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
assertFalse(q.addAll(Arrays.asList(empty)));
assertTrue(q.addAll(Arrays.asList(ints)));
for (int i = 0; i < SIZE; ++i)
assertEquals(ints[i], q.poll());
}
finally {}
|
| public void | testAddAllSelf()addAll(this) throws IAE
try {
ConcurrentLinkedQueue q = populatedQueue(SIZE);
q.addAll(q);
shouldThrow();
}
catch (IllegalArgumentException success) {}
|
| public void | testAddNull()add(null) throws NPE
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.add(null);
shouldThrow();
} catch (NullPointerException success) { }
|
| public void | testClear()clear removes all elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
q.clear();
assertTrue(q.isEmpty());
assertEquals(0, q.size());
q.add(one);
assertFalse(q.isEmpty());
q.clear();
assertTrue(q.isEmpty());
|
| public void | testConstructor1()new queue is empty
assertEquals(0, new ConcurrentLinkedQueue().size());
|
| public void | testConstructor3()Initializing from null Collection throws NPE
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null);
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testConstructor4()Initializing from Collection of null elements throws NPE
try {
Integer[] ints = new Integer[SIZE];
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testConstructor5()Initializing from Collection with some null elements throws NPE
try {
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE-1; ++i)
ints[i] = new Integer(i);
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
shouldThrow();
}
catch (NullPointerException success) {}
|
| public void | testConstructor6()Queue contains all elements of collection used to initialize
try {
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE; ++i)
ints[i] = new Integer(i);
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints));
for (int i = 0; i < SIZE; ++i)
assertEquals(ints[i], q.poll());
}
finally {}
|
| public void | testContains()contains(x) reports true when elements added but not yet removed
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertTrue(q.contains(new Integer(i)));
q.poll();
assertFalse(q.contains(new Integer(i)));
}
|
| public void | testContainsAll()containsAll(c) is true when c contains a subset of elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
ConcurrentLinkedQueue p = new ConcurrentLinkedQueue();
for (int i = 0; i < SIZE; ++i) {
assertTrue(q.containsAll(p));
assertFalse(p.containsAll(q));
p.add(new Integer(i));
}
assertTrue(p.containsAll(q));
|
| public void | testElement()element returns next element, or throws NSEE if empty
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, ((Integer)q.element()).intValue());
q.poll();
}
try {
q.element();
shouldThrow();
}
catch (NoSuchElementException success) {}
|
| public void | testEmpty()isEmpty is true before add, false after
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
assertTrue(q.isEmpty());
q.add(one);
assertFalse(q.isEmpty());
q.add(two);
q.remove();
q.remove();
assertTrue(q.isEmpty());
|
| public void | testIterator()iterator iterates through all elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
int i = 0;
Iterator it = q.iterator();
while(it.hasNext()) {
assertTrue(q.contains(it.next()));
++i;
}
assertEquals(i, SIZE);
|
| public void | testIteratorOrdering()iterator ordering is FIFO
final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.add(one);
q.add(two);
q.add(three);
int k = 0;
for (Iterator it = q.iterator(); it.hasNext();) {
int i = ((Integer)(it.next())).intValue();
assertEquals(++k, i);
}
assertEquals(3, k);
|
| public void | testIteratorRemove()iterator.remove removes current element
final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.add(one);
q.add(two);
q.add(three);
Iterator it = q.iterator();
it.next();
it.remove();
it = q.iterator();
assertEquals(it.next(), two);
assertEquals(it.next(), three);
assertFalse(it.hasNext());
|
| public void | testOffer()Offer returns true
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
assertTrue(q.offer(zero));
assertTrue(q.offer(one));
|
| public void | testOfferNull()offer(null) throws NPE
try {
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.offer(null);
shouldThrow();
} catch (NullPointerException success) { }
|
| public void | testPeek()peek returns next element, or null if empty
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, ((Integer)q.peek()).intValue());
q.poll();
assertTrue(q.peek() == null ||
i != ((Integer)q.peek()).intValue());
}
assertNull(q.peek());
|
| public void | testPoll()poll succeeds unless empty
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, ((Integer)q.poll()).intValue());
}
assertNull(q.poll());
|
| public void | testRemove()remove removes next element, or throws NSEE if empty
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, ((Integer)q.remove()).intValue());
}
try {
q.remove();
shouldThrow();
} catch (NoSuchElementException success){
}
|
| public void | testRemoveAll()removeAll(c) removes only those elements of c and reports true if changed
for (int i = 1; i < SIZE; ++i) {
ConcurrentLinkedQueue q = populatedQueue(SIZE);
ConcurrentLinkedQueue p = populatedQueue(i);
assertTrue(q.removeAll(p));
assertEquals(SIZE-i, q.size());
for (int j = 0; j < i; ++j) {
Integer I = (Integer)(p.remove());
assertFalse(q.contains(I));
}
}
|
| public void | testRemoveElement()remove(x) removes x and returns true if present
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 1; i < SIZE; i+=2) {
assertTrue(q.remove(new Integer(i)));
}
for (int i = 0; i < SIZE; i+=2) {
assertTrue(q.remove(new Integer(i)));
assertFalse(q.remove(new Integer(i+1)));
}
assertTrue(q.isEmpty());
|
| public void | testRetainAll()retainAll(c) retains only those elements of c and reports true if change
ConcurrentLinkedQueue q = populatedQueue(SIZE);
ConcurrentLinkedQueue p = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
boolean changed = q.retainAll(p);
if (i == 0)
assertFalse(changed);
else
assertTrue(changed);
assertTrue(q.containsAll(p));
assertEquals(SIZE-i, q.size());
p.remove();
}
|
| public void | testSerialization()A deserialized serialized queue has same elements in same order
ConcurrentLinkedQueue q = populatedQueue(SIZE);
try {
ByteArrayOutputStream bout = new ByteArrayOutputStream(10000);
ObjectOutputStream out = new ObjectOutputStream(new BufferedOutputStream(bout));
out.writeObject(q);
out.close();
ByteArrayInputStream bin = new ByteArrayInputStream(bout.toByteArray());
ObjectInputStream in = new ObjectInputStream(new BufferedInputStream(bin));
ConcurrentLinkedQueue r = (ConcurrentLinkedQueue)in.readObject();
assertEquals(q.size(), r.size());
while (!q.isEmpty())
assertEquals(q.remove(), r.remove());
} catch(Exception e){
unexpectedException();
}
|
| public void | testSize()size changes when elements added and removed
ConcurrentLinkedQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(SIZE-i, q.size());
q.remove();
}
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, q.size());
q.add(new Integer(i));
}
|
| public void | testToArray()toArray contains all elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
Object[] o = q.toArray();
Arrays.sort(o);
for(int i = 0; i < o.length; i++)
assertEquals(o[i], q.poll());
|
| public void | testToArray1_BadArg()toArray with incompatible array type throws CCE
try {
ConcurrentLinkedQueue q = populatedQueue(SIZE);
Object o[] = q.toArray(new String[10] );
shouldThrow();
} catch(ArrayStoreException success){}
|
| public void | testToArray2()toArray(a) contains all elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
Integer[] ints = new Integer[SIZE];
ints = (Integer[])q.toArray(ints);
Arrays.sort(ints);
for(int i = 0; i < ints.length; i++)
assertEquals(ints[i], q.poll());
|
| public void | testToArray_BadArg()toArray(null) throws NPE
try {
ConcurrentLinkedQueue q = populatedQueue(SIZE);
Object o[] = q.toArray(null);
shouldThrow();
} catch(NullPointerException success){}
|
| public void | testToString()toString contains toStrings of elements
ConcurrentLinkedQueue q = populatedQueue(SIZE);
String s = q.toString();
for (int i = 0; i < SIZE; ++i) {
assertTrue(s.indexOf(String.valueOf(i)) >= 0);
}
|
| public void | testWeaklyConsistentIteration()Modifications do not cause iterators to fail
final ConcurrentLinkedQueue q = new ConcurrentLinkedQueue();
q.add(one);
q.add(two);
q.add(three);
try {
for (Iterator it = q.iterator(); it.hasNext();) {
q.remove();
it.next();
}
}
catch (ConcurrentModificationException e) {
shouldThrow();
}
assertEquals("queue should be empty again", 0, q.size());
|
