21222324252627282930
void fillQueue(int nb) { for (int i = 0; i < nb; i++) { Node node = new Node(Math.abs(_random.nextLong())); _queue.offer(node); } assertEquals(nb, _queue.getSize()); }
40414243444546474849
void checkPriority() { long value = -1; while (_queue.getSize() > 0) { Node node = _queue.poll(); assertTrue(value <= node.getValue()); value = node.getValue(); } }
49505152535455565758
} @Test public void testFailed() { Node node = new Node(1); _queue.offer(node); _queue.remove(node); }
6768697071727374757677
Node[] nodes = _queue.toArray(); for (int i = 0; i < 500; i++) { int j = _random.nextInt(nodes.length); Node node = nodes[j]; nodes[j] = null; if (node != null) _queue.remove(node); }