本文整理匯總了Java中java.util.concurrent.LinkedBlockingQueue.remove方法的典型用法代碼示例。如果您正苦於以下問題:Java LinkedBlockingQueue.remove方法的具體用法?Java LinkedBlockingQueue.remove怎麽用?Java LinkedBlockingQueue.remove使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類java.util.concurrent.LinkedBlockingQueue
的用法示例。
在下文中一共展示了LinkedBlockingQueue.remove方法的5個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的Java代碼示例。
示例1: testRetainAll
import java.util.concurrent.LinkedBlockingQueue; //導入方法依賴的package包/類
/**
* retainAll(c) retains only those elements of c and reports true if changed
*/
public void testRetainAll() {
LinkedBlockingQueue q = populatedQueue(SIZE);
LinkedBlockingQueue 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();
}
}
示例2: test_queue_copy
import java.util.concurrent.LinkedBlockingQueue; //導入方法依賴的package包/類
@Test
public void test_queue_copy() {
LinkedBlockingQueue<String> queue = new LinkedBlockingQueue<String>();
queue.add("abc");
LinkedBlockingQueue<String> queueMileage = new LinkedBlockingQueue<String>(queue);
// String trucknum = queueMileage.poll();
queueMileage.remove();
// System.out.println(trucknum);
System.out.println(queue);
}
示例3: testRemove
import java.util.concurrent.LinkedBlockingQueue; //導入方法依賴的package包/類
/**
* remove removes next element, or throws NSEE if empty
*/
public void testRemove() {
LinkedBlockingQueue q = populatedQueue(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, q.remove());
}
try {
q.remove();
shouldThrow();
} catch (NoSuchElementException success) {}
}
示例4: testRemoveAll
import java.util.concurrent.LinkedBlockingQueue; //導入方法依賴的package包/類
/**
* removeAll(c) removes only those elements of c and reports true if changed
*/
public void testRemoveAll() {
for (int i = 1; i < SIZE; ++i) {
LinkedBlockingQueue q = populatedQueue(SIZE);
LinkedBlockingQueue p = populatedQueue(i);
assertTrue(q.removeAll(p));
assertEquals(SIZE - i, q.size());
for (int j = 0; j < i; ++j) {
Integer x = (Integer)(p.remove());
assertFalse(q.contains(x));
}
}
}
示例5: testWeaklyConsistentIteration
import java.util.concurrent.LinkedBlockingQueue; //導入方法依賴的package包/類
/**
* Modifications do not cause iterators to fail
*/
public void testWeaklyConsistentIteration() {
final LinkedBlockingQueue q = new LinkedBlockingQueue(3);
q.add(one);
q.add(two);
q.add(three);
for (Iterator it = q.iterator(); it.hasNext();) {
q.remove();
it.next();
}
assertEquals(0, q.size());
}