1.1 --- a/test/heap_test.cc	Thu Jul 09 02:38:01 2009 +0200
     1.2 +++ b/test/heap_test.cc	Thu Jul 09 02:39:47 2009 +0200
     1.3 @@ -222,16 +222,16 @@
     1.4    }
     1.5  
     1.6    // PairingHeap
     1.7 -//  {
     1.8 -//    typedef PairingHeap<Prio, ItemIntMap> IntHeap;
     1.9 -//    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
    1.10 -//    heapSortTest<IntHeap>();
    1.11 -//    heapIncreaseTest<IntHeap>();
    1.12 -//
    1.13 -//    typedef PairingHeap<Prio, IntNodeMap > NodeHeap;
    1.14 -//    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
    1.15 -//    dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.16 -//  }
    1.17 +  {
    1.18 +    typedef PairingHeap<Prio, ItemIntMap> IntHeap;
    1.19 +    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
    1.20 +    heapSortTest<IntHeap>();
    1.21 +    heapIncreaseTest<IntHeap>();
    1.22 +
    1.23 +    typedef PairingHeap<Prio, IntNodeMap > NodeHeap;
    1.24 +    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
    1.25 +    dijkstraHeapTest<NodeHeap>(digraph, length, source);
    1.26 +  }
    1.27  
    1.28    // RadixHeap
    1.29    {