本文整理了Java中com.badlogic.gdx.utils.Queue.removeFirst
方法的一些代码示例,展示了Queue.removeFirst
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Queue.removeFirst
方法的具体详情如下:
包路径:com.badlogic.gdx.utils.Queue
类名称:Queue
方法名:removeFirst
[英]Remove the first item from the queue. (dequeue from head) Always O(1).
[中]从队列中删除第一项。(从头部出列)始终为O(1)。
代码示例来源:origin: libgdx/libgdx
@Test
public void iteratorRemoveEdgeCaseTest() {//See #4300
Queue<Integer> queue = new Queue<Integer>();
//Simulate normal usage
for(int i = 0; i < 100; i++) {
queue.addLast(i);
if(i > 50)
queue.removeFirst();
}
Iterator<Integer> it = queue.iterator();
while(it.hasNext()) {
it.next();
it.remove();
}
queue.addLast(1337);
Integer i = queue.first();
assertEquals(1337, (int)i);
}
代码示例来源:origin: libgdx/libgdx
@Test
public void removeFirstTest() {
Queue<Integer> queue = new Queue<Integer>();
queue.addLast(1);
queue.addLast(2);
queue.addLast(3);
queue.addLast(4);
assertEquals(4, queue.size);
assertEquals(0, queue.indexOf(1, true));
assertEquals(1, (Object)queue.removeFirst());
assertEquals(3, queue.size);
assertEquals(0, queue.indexOf(2, true));
assertEquals(2, (Object)queue.removeFirst());
assertEquals(2, queue.size);
assertEquals(0, queue.indexOf(3, true));
assertEquals(3, (Object)queue.removeFirst());
assertEquals(1, queue.size);
assertEquals(0, queue.indexOf(4, true));
assertEquals(4, (Object)queue.removeFirst());
assertEquals(0, queue.size);
}
代码示例来源:origin: libgdx/libgdx
@Test
public void getTest () {
final Queue<Integer> q = new Queue<Integer>(7);
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 4; j++) {
q.addLast(j);
}
assertEquals("get(0) is not equal to peek (" + i + ")", q.get(0), q.first());
assertEquals("get(size-1) is not equal to peekLast (" + i + ")", q.get(q.size - 1), q.last());
for (int j = 0; j < 4; j++) {
assertTrue(q.get(j) == j);
}
for (int j = 0; j < 4 - 1; j++) {
q.removeFirst();
assertEquals("get(0) is not equal to peek (" + i + ")", q.get(0), q.first());
}
q.removeFirst();
assert q.size == 0; // Failing this means broken test
try {
q.get(0);
fail("get() on empty queue did not throw");
} catch (IndexOutOfBoundsException ignore) {
// Expected
}
}
}
代码示例来源:origin: libgdx/libgdx
@Test
public void hashEqualsTest () {
Queue<Integer> q1 = new Queue<Integer>();
Queue<Integer> q2 = new Queue<Integer>();
assertEqualsAndHash(q1, q2);
q1.addFirst(1);
assertNotEquals(q1, q2);
q2.addFirst(1);
assertEqualsAndHash(q1, q2);
q1.clear();
q1.addLast(1);
q1.addLast(2);
q2.addLast(2);
assertEqualsAndHash(q1, q2);
for (int i = 0; i < 100; i++) {
q1.addLast(i);
q1.addLast(i);
q1.removeFirst();
assertNotEquals(q1, q2);
q2.addLast(i);
q2.addLast(i);
q2.removeFirst();
assertEqualsAndHash(q1, q2);
}
}
代码示例来源:origin: libgdx/libgdx
final Integer pop = q.removeFirst();
assertTrue("Popped should be " + j + " but is " + pop + " (" + i + ")", pop == j);
代码示例来源:origin: de.golfgl.gdxgameanalytics/gdx-gameanalytics-core
private void addToWaitingQueue(AnnotatedEvent event) {
while (waitingQueue.size > MAX_EVENTS_CACHED)
waitingQueue.removeFirst();
waitingQueue.addLast(event);
}
代码示例来源:origin: org.mini2Dx/mini2Dx-core
public void mark(long value) {
if (queue.size < size) {
queue.addLast(value);
long sum = 0;
for (long i : queue) {
sum += i;
}
average = (double) sum / queue.size;
} else {
long head = queue.removeFirst();
double minus = (double) head / size;
queue.addLast(value);
double add = (double) value / size;
average = average + add - minus;
}
}
代码示例来源:origin: mbrlabs/Mundus
@Override
public GameObject next() {
GameObject first = queue.removeFirst();
if (first.getChildren() != null) {
for (GameObject go : first.getChildren()) {
queue.addLast(go);
}
}
return first;
}
代码示例来源:origin: de.golfgl.gdxgameanalytics/gdx-gameanalytics-core
sendingQueue.addLast(waitingQueue.removeFirst());
内容来源于网络,如有侵权,请联系作者删除!