예제 #1
0
  @Test
  public void testClear() {
    BinHeapWrapper<Number, Integer> binHeap = createHeap(100);
    binHeap.insert(20, 1);
    binHeap.insert(123, 2);
    assertEquals(2, binHeap.getSize());
    binHeap.clear();

    assertEquals(0, binHeap.getSize());
    binHeap.insert(123, 2);
    assertEquals(1, binHeap.getSize());
    assertEquals(2, (int) binHeap.pollElement());
  }
예제 #2
0
  @Test
  public void testSize() {
    PriorityQueue<EdgeEntry> juQueue = new PriorityQueue<EdgeEntry>(100);
    BinHeapWrapper<Number, Integer> binHeap = createHeap(100);

    Random rand = new Random(1);
    int N = 1000;
    for (int i = 0; i < N; i++) {
      int val = rand.nextInt();
      binHeap.insert(val, i);
      juQueue.add(new EdgeEntry(EdgeIterator.NO_EDGE, i, val));
    }

    assertEquals(juQueue.size(), binHeap.getSize());

    for (int i = 0; i < N; i++) {
      assertEquals(juQueue.poll().adjNode, binHeap.pollElement(), 1e-5);
    }

    assertEquals(binHeap.getSize(), 0);
  }
예제 #3
0
  @Test
  public void test0() {
    BinHeapWrapper<Number, Integer> binHeap = createHeap(100);
    binHeap.insert(123, 0);
    assertEquals(123, binHeap.peekKey().intValue());
    assertEquals(1, binHeap.getSize());

    binHeap.update(12, 0);
    assertEquals(12, binHeap.peekKey().intValue());
    assertEquals(1, binHeap.getSize());
  }
예제 #4
0
  @Test
  public void testBasic() {
    BinHeapWrapper<Number, Integer> binHeap = createHeap(100);
    binHeap.insert(20, 1);
    binHeap.insert(123, 2);
    binHeap.insert(120, 3);
    binHeap.insert(130, 4);

    assertEquals(1, (int) binHeap.pollElement());
    assertEquals(3, (int) binHeap.pollElement());
    assertEquals(2, (int) binHeap.pollElement());
    assertEquals(1, (int) binHeap.getSize());
  }
예제 #5
0
  @Test
  public void testSpreading() {
    BinHeapWrapper<Number, Integer> binHeap = createHeap(100);
    binHeap.insert(100, 101);
    binHeap.insert(49, 51);
    binHeap.insert(71, 71);
    binHeap.insert(29, 31);
    for (int i = 0; i < 20; i++) {
      binHeap.insert(i * 10, i * 11);
    }
    binHeap.insert(59, 61);
    binHeap.insert(160, 161);

    assertEquals(26, binHeap.getSize());
    assertEquals(0, binHeap.pollElement().intValue());
    assertEquals(11, binHeap.pollElement().intValue());
    assertEquals(22, binHeap.pollElement().intValue());
    assertEquals(31, binHeap.pollElement().intValue());
    assertEquals(33, binHeap.pollElement().intValue());
    assertEquals(44, binHeap.pollElement().intValue());
    assertEquals(51, binHeap.pollElement().intValue());
    assertEquals(55, binHeap.pollElement().intValue());
    assertEquals(61, binHeap.pollElement().intValue());
    assertEquals(66, binHeap.pollElement().intValue());
    assertEquals(77, binHeap.pollElement().intValue());
    assertEquals(15, binHeap.getSize());
  }