equal
deleted
inserted
replaced
639 typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm; |
639 typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm; |
640 checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>(); |
640 checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>(); |
641 |
641 |
642 const int num = 10; |
642 const int num = 10; |
643 Graph g; |
643 Graph g; |
|
644 Ibm map0(g, true); |
644 std::vector<Item> items; |
645 std::vector<Item> items; |
645 for (int i = 0; i < num; ++i) { |
646 for (int i = 0; i < num; ++i) { |
646 items.push_back(g.addNode()); |
647 items.push_back(g.addNode()); |
647 } |
648 } |
648 |
649 |
720 |
721 |
721 checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>(); |
722 checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>(); |
722 |
723 |
723 const int num = 10; |
724 const int num = 10; |
724 Graph g; |
725 Graph g; |
|
726 Iim map0(g, 0); |
725 std::vector<Item> items; |
727 std::vector<Item> items; |
726 for (int i = 0; i < num; ++i) { |
728 for (int i = 0; i < num; ++i) { |
727 items.push_back(g.addNode()); |
729 items.push_back(g.addNode()); |
728 } |
730 } |
729 |
731 |
770 |
772 |
771 checkConcept<ReadWriteMap<Item, double>, Ivm>(); |
773 checkConcept<ReadWriteMap<Item, double>, Ivm>(); |
772 |
774 |
773 const int num = 10; |
775 const int num = 10; |
774 Graph g; |
776 Graph g; |
|
777 Ivm map0(g, 0.0); |
775 std::vector<Item> items; |
778 std::vector<Item> items; |
776 for (int i = 0; i < num; ++i) { |
779 for (int i = 0; i < num; ++i) { |
777 items.push_back(g.addNode()); |
780 items.push_back(g.addNode()); |
778 } |
781 } |
779 |
782 |