本文整理匯總了Java中java.util.ArrayDeque.remove方法的典型用法代碼示例。如果您正苦於以下問題：Java ArrayDeque.remove方法的具體用法？Java ArrayDeque.remove怎麽用？Java ArrayDeque.remove使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類java.util.ArrayDeque的用法示例。
在下文中一共展示了ArrayDeque.remove方法的6個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Java代碼示例。
示例1: findDistances
import java.util.ArrayDeque; //導入方法依賴的package包/類
private static void findDistances(Node start) {
if (start == null) {
return;
}
ArrayDeque<Node> deque = new ArrayDeque<>(); // use deque as a queue
start.distance = 0;
deque.add(start);
while (!deque.isEmpty()) {
Node curr = deque.remove();
for (Node neighbor : curr.neighbors) {
if (neighbor.distance == -1) { // meaning it's unvisited
neighbor.distance = curr.distance + EDGE_WEIGHT;
deque.add(neighbor);
}
}
}
}
示例2: testIteratorRemove
import java.util.ArrayDeque; //導入方法依賴的package包/類
/**
* iterator.remove() removes current element
*/
public void testIteratorRemove() {
final ArrayDeque q = new ArrayDeque();
final Random rng = new Random();
for (int iters = 0; iters < 100; ++iters) {
int max = rng.nextInt(5) + 2;
int split = rng.nextInt(max - 1) + 1;
for (int j = 1; j <= max; ++j)
q.add(new Integer(j));
Iterator it = q.iterator();
for (int j = 1; j <= split; ++j)
assertEquals(it.next(), new Integer(j));
it.remove();
assertEquals(it.next(), new Integer(split + 1));
for (int j = 1; j <= split; ++j)
q.remove(new Integer(j));
it = q.iterator();
for (int j = split + 1; j <= max; ++j) {
assertEquals(it.next(), new Integer(j));
it.remove();
}
assertFalse(it.hasNext());
assertTrue(q.isEmpty());
}
}
示例3: testDescendingIteratorOrdering
import java.util.ArrayDeque; //導入方法依賴的package包/類
/**
* Descending iterator ordering is reverse FIFO
*/
public void testDescendingIteratorOrdering() {
final ArrayDeque q = new ArrayDeque();
for (int iters = 0; iters < 100; ++iters) {
q.add(new Integer(3));
q.add(new Integer(2));
q.add(new Integer(1));
int k = 0;
for (Iterator it = q.descendingIterator(); it.hasNext();) {
assertEquals(++k, it.next());
}
assertEquals(3, k);
q.remove();
q.remove();
q.remove();
}
}
示例4: testDescendingIteratorRemove
import java.util.ArrayDeque; //導入方法依賴的package包/類
/**
* descendingIterator.remove() removes current element
*/
public void testDescendingIteratorRemove() {
final ArrayDeque q = new ArrayDeque();
final Random rng = new Random();
for (int iters = 0; iters < 100; ++iters) {
int max = rng.nextInt(5) + 2;
int split = rng.nextInt(max - 1) + 1;
for (int j = max; j >= 1; --j)
q.add(new Integer(j));
Iterator it = q.descendingIterator();
for (int j = 1; j <= split; ++j)
assertEquals(it.next(), new Integer(j));
it.remove();
assertEquals(it.next(), new Integer(split + 1));
for (int j = 1; j <= split; ++j)
q.remove(new Integer(j));
it = q.descendingIterator();
for (int j = split + 1; j <= max; ++j) {
assertEquals(it.next(), new Integer(j));
it.remove();
}
assertFalse(it.hasNext());
assertTrue(q.isEmpty());
}
}
示例5: testRemove
import java.util.ArrayDeque; //導入方法依賴的package包/類
/**
* remove() removes next element, or throws NSEE if empty
*/
public void testRemove() {
ArrayDeque q = populatedDeque(SIZE);
for (int i = 0; i < SIZE; ++i) {
assertEquals(i, q.remove());
}
try {
q.remove();
shouldThrow();
} catch (NoSuchElementException success) {}
}
示例6: LevelOrder
import java.util.ArrayDeque; //導入方法依賴的package包/類
static void LevelOrder(BSTNode root){
if(root==null) return;
ArrayDeque<BSTNode> q = new ArrayDeque<BSTNode>();
q.add(root);
while(!q.isEmpty()){
BSTNode n = q.remove();
System.out.print(n.data+" ");
if(n.left!=null) q.add(n.left);
if(n.right!=null) q.add(n.right);
}
System.out.println();
}