test/heap_test.cc
changeset 843 81f7e910060b
parent 701 d1a9224f1e30
child 855 65a0521e744e
equal deleted inserted replaced
9:7da03c10ec62 10:187f5622bad7
   220     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
   220     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
   221     dijkstraHeapTest<NodeHeap>(digraph, length, source);
   221     dijkstraHeapTest<NodeHeap>(digraph, length, source);
   222   }
   222   }
   223 
   223 
   224   // PairingHeap
   224   // PairingHeap
   225 //  {
   225   {
   226 //    typedef PairingHeap<Prio, ItemIntMap> IntHeap;
   226     typedef PairingHeap<Prio, ItemIntMap> IntHeap;
   227 //    checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
   227     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
   228 //    heapSortTest<IntHeap>();
   228     heapSortTest<IntHeap>();
   229 //    heapIncreaseTest<IntHeap>();
   229     heapIncreaseTest<IntHeap>();
   230 //
   230 
   231 //    typedef PairingHeap<Prio, IntNodeMap > NodeHeap;
   231     typedef PairingHeap<Prio, IntNodeMap > NodeHeap;
   232 //    checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
   232     checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
   233 //    dijkstraHeapTest<NodeHeap>(digraph, length, source);
   233     dijkstraHeapTest<NodeHeap>(digraph, length, source);
   234 //  }
   234   }
   235 
   235 
   236   // RadixHeap
   236   // RadixHeap
   237   {
   237   {
   238     typedef RadixHeap<ItemIntMap> IntHeap;
   238     typedef RadixHeap<ItemIntMap> IntHeap;
   239     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
   239     checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();