... | ... |
@@ -640,8 +640,9 @@ |
640 | 640 |
checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>(); |
641 | 641 |
|
642 | 642 |
const int num = 10; |
643 | 643 |
Graph g; |
644 |
Ibm map0(g, true); |
|
644 | 645 |
std::vector<Item> items; |
645 | 646 |
for (int i = 0; i < num; ++i) { |
646 | 647 |
items.push_back(g.addNode()); |
647 | 648 |
} |
... | ... |
@@ -721,8 +722,9 @@ |
721 | 722 |
checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>(); |
722 | 723 |
|
723 | 724 |
const int num = 10; |
724 | 725 |
Graph g; |
726 |
Iim map0(g, 0); |
|
725 | 727 |
std::vector<Item> items; |
726 | 728 |
for (int i = 0; i < num; ++i) { |
727 | 729 |
items.push_back(g.addNode()); |
728 | 730 |
} |
... | ... |
@@ -771,8 +773,9 @@ |
771 | 773 |
checkConcept<ReadWriteMap<Item, double>, Ivm>(); |
772 | 774 |
|
773 | 775 |
const int num = 10; |
774 | 776 |
Graph g; |
777 |
Ivm map0(g, 0.0); |
|
775 | 778 |
std::vector<Item> items; |
776 | 779 |
for (int i = 0; i < num; ++i) { |
777 | 780 |
items.push_back(g.addNode()); |
778 | 781 |
} |
0 comments (0 inline)