1.1 --- a/test/heap_test.cc Tue Apr 26 17:24:31 2011 +0200
1.2 +++ b/test/heap_test.cc Wed Jul 13 14:52:22 2011 +0200
1.3 @@ -272,5 +272,39 @@
1.4 heapSortTest<SimpleIntHeap>();
1.5 }
1.6
1.7 + {
1.8 + typedef FibHeap<Prio, ItemIntMap> IntHeap;
1.9 + checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
1.10 + heapSortTest<IntHeap>();
1.11 + heapIncreaseTest<IntHeap>();
1.12 +
1.13 + typedef FibHeap<Prio, IntNodeMap > NodeHeap;
1.14 + checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
1.15 + dijkstraHeapTest<NodeHeap>(digraph, length, source);
1.16 + }
1.17 +
1.18 + {
1.19 + typedef RadixHeap<ItemIntMap> IntHeap;
1.20 + checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
1.21 + heapSortTest<IntHeap>();
1.22 + heapIncreaseTest<IntHeap>();
1.23 +
1.24 + typedef RadixHeap<IntNodeMap > NodeHeap;
1.25 + checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
1.26 + dijkstraHeapTest<NodeHeap>(digraph, length, source);
1.27 + }
1.28 +
1.29 + {
1.30 + typedef BucketHeap<ItemIntMap> IntHeap;
1.31 + checkConcept<Heap<Prio, ItemIntMap>, IntHeap>();
1.32 + heapSortTest<IntHeap>();
1.33 + heapIncreaseTest<IntHeap>();
1.34 +
1.35 + typedef BucketHeap<IntNodeMap > NodeHeap;
1.36 + checkConcept<Heap<Prio, IntNodeMap >, NodeHeap>();
1.37 + dijkstraHeapTest<NodeHeap>(digraph, length, source);
1.38 + }
1.39 +
1.40 +
1.41 return 0;
1.42 }