... |
... |
@@ -632,24 +632,25 @@
|
632 |
632 |
}
|
633 |
633 |
|
634 |
634 |
// Iterable bool map
|
635 |
635 |
{
|
636 |
636 |
typedef SmartGraph Graph;
|
637 |
637 |
typedef SmartGraph::Node Item;
|
638 |
638 |
|
639 |
639 |
typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm;
|
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 |
}
|
648 |
649 |
|
649 |
650 |
Ibm map1(g, true);
|
650 |
651 |
int n = 0;
|
651 |
652 |
for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
|
652 |
653 |
check(map1[static_cast<Item>(it)], "Wrong TrueIt");
|
653 |
654 |
++n;
|
654 |
655 |
}
|
655 |
656 |
check(n == num, "Wrong number");
|
... |
... |
@@ -713,24 +714,25 @@
|
713 |
714 |
}
|
714 |
715 |
|
715 |
716 |
// Iterable int map
|
716 |
717 |
{
|
717 |
718 |
typedef SmartGraph Graph;
|
718 |
719 |
typedef SmartGraph::Node Item;
|
719 |
720 |
typedef IterableIntMap<SmartGraph, SmartGraph::Node> Iim;
|
720 |
721 |
|
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 |
}
|
729 |
731 |
|
730 |
732 |
Iim map1(g);
|
731 |
733 |
check(map1.size() == 0, "Wrong size");
|
732 |
734 |
|
733 |
735 |
for (int i = 0; i < num; ++i) {
|
734 |
736 |
map1[items[i]] = i;
|
735 |
737 |
}
|
736 |
738 |
check(map1.size() == num, "Wrong size");
|
... |
... |
@@ -763,24 +765,25 @@
|
763 |
765 |
}
|
764 |
766 |
|
765 |
767 |
// Iterable value map
|
766 |
768 |
{
|
767 |
769 |
typedef SmartGraph Graph;
|
768 |
770 |
typedef SmartGraph::Node Item;
|
769 |
771 |
typedef IterableValueMap<SmartGraph, SmartGraph::Node, double> Ivm;
|
770 |
772 |
|
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 |
}
|
779 |
782 |
|
780 |
783 |
Ivm map1(g, 0.0);
|
781 |
784 |
check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size");
|
782 |
785 |
check(*map1.beginValue() == 0.0, "Wrong value");
|
783 |
786 |
|
784 |
787 |
for (int i = 0; i < num; ++i) {
|
785 |
788 |
map1.set(items[i], static_cast<double>(i));
|
786 |
789 |
}
|