@Test
void getPriorityQueue()
{

    Queue<Double> result = this.tool.getPriorityQueue();
    assertNotNull(result, "Returned null instead of a queue");
    assertTrue(result.isEmpty(), "Returned queue wasn't initially empty");
    // Check that the queue is indeed prioritized
    Random r = new Random();
    for (int i = 0; i < 100; ++i) {
        result.add(r.nextDouble());
    }
    Double d = 0.0;
    while (!result.isEmpty()) {
        Double e = result.poll();
        assertTrue(e >= d, "Queue doesn't preserve the natural order of the elements");
        d = e;
    }
}