1.1 --- a/test/maps_test.cc Thu Jul 23 18:13:59 2009 +0200
1.2 +++ b/test/maps_test.cc Sun Aug 02 13:44:45 2009 +0200
1.3 @@ -23,6 +23,7 @@
1.4 #include <lemon/concepts/maps.h>
1.5 #include <lemon/maps.h>
1.6 #include <lemon/list_graph.h>
1.7 +#include <lemon/smart_graph.h>
1.8
1.9 #include "test_tools.h"
1.10
1.11 @@ -494,5 +495,192 @@
1.12 it == map.endValue(), "Wrong value iterator");
1.13 }
1.14
1.15 + // Iterable bool map
1.16 + {
1.17 + typedef SmartGraph Graph;
1.18 + typedef SmartGraph::Node Item;
1.19 +
1.20 + typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm;
1.21 + checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>();
1.22 +
1.23 + const int num = 10;
1.24 + Graph g;
1.25 + std::vector<Item> items;
1.26 + for (int i = 0; i < num; ++i) {
1.27 + items.push_back(g.addNode());
1.28 + }
1.29 +
1.30 + Ibm map1(g, true);
1.31 + int n = 0;
1.32 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.33 + check(map1[static_cast<Item>(it)], "Wrong TrueIt");
1.34 + ++n;
1.35 + }
1.36 + check(n == num, "Wrong number");
1.37 +
1.38 + n = 0;
1.39 + for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
1.40 + check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
1.41 + ++n;
1.42 + }
1.43 + check(n == num, "Wrong number");
1.44 + check(Ibm::FalseIt(map1) == INVALID, "Wrong FalseIt");
1.45 + check(Ibm::ItemIt(map1, false) == INVALID, "Wrong ItemIt for false");
1.46 +
1.47 + map1[items[5]] = true;
1.48 +
1.49 + n = 0;
1.50 + for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
1.51 + check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
1.52 + ++n;
1.53 + }
1.54 + check(n == num, "Wrong number");
1.55 +
1.56 + map1[items[num / 2]] = false;
1.57 + check(map1[items[num / 2]] == false, "Wrong map value");
1.58 +
1.59 + n = 0;
1.60 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.61 + check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
1.62 + ++n;
1.63 + }
1.64 + check(n == num - 1, "Wrong number");
1.65 +
1.66 + n = 0;
1.67 + for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
1.68 + check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
1.69 + ++n;
1.70 + }
1.71 + check(n == 1, "Wrong number");
1.72 +
1.73 + map1[items[0]] = false;
1.74 + check(map1[items[0]] == false, "Wrong map value");
1.75 +
1.76 + map1[items[num - 1]] = false;
1.77 + check(map1[items[num - 1]] == false, "Wrong map value");
1.78 +
1.79 + n = 0;
1.80 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.81 + check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
1.82 + ++n;
1.83 + }
1.84 + check(n == num - 3, "Wrong number");
1.85 + check(map1.trueNum() == num - 3, "Wrong number");
1.86 +
1.87 + n = 0;
1.88 + for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
1.89 + check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
1.90 + ++n;
1.91 + }
1.92 + check(n == 3, "Wrong number");
1.93 + check(map1.falseNum() == 3, "Wrong number");
1.94 + }
1.95 +
1.96 + // Iterable int map
1.97 + {
1.98 + typedef SmartGraph Graph;
1.99 + typedef SmartGraph::Node Item;
1.100 + typedef IterableIntMap<SmartGraph, SmartGraph::Node> Iim;
1.101 +
1.102 + checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>();
1.103 +
1.104 + const int num = 10;
1.105 + Graph g;
1.106 + std::vector<Item> items;
1.107 + for (int i = 0; i < num; ++i) {
1.108 + items.push_back(g.addNode());
1.109 + }
1.110 +
1.111 + Iim map1(g);
1.112 + check(map1.size() == 0, "Wrong size");
1.113 +
1.114 + for (int i = 0; i < num; ++i) {
1.115 + map1[items[i]] = i;
1.116 + }
1.117 + check(map1.size() == num, "Wrong size");
1.118 +
1.119 + for (int i = 0; i < num; ++i) {
1.120 + Iim::ItemIt it(map1, i);
1.121 + check(static_cast<Item>(it) == items[i], "Wrong value");
1.122 + ++it;
1.123 + check(static_cast<Item>(it) == INVALID, "Wrong value");
1.124 + }
1.125 +
1.126 + for (int i = 0; i < num; ++i) {
1.127 + map1[items[i]] = i % 2;
1.128 + }
1.129 + check(map1.size() == 2, "Wrong size");
1.130 +
1.131 + int n = 0;
1.132 + for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) {
1.133 + check(map1[static_cast<Item>(it)] == 0, "Wrong value");
1.134 + ++n;
1.135 + }
1.136 + check(n == (num + 1) / 2, "Wrong number");
1.137 +
1.138 + for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) {
1.139 + check(map1[static_cast<Item>(it)] == 1, "Wrong value");
1.140 + ++n;
1.141 + }
1.142 + check(n == num, "Wrong number");
1.143 +
1.144 + }
1.145 +
1.146 + // Iterable value map
1.147 + {
1.148 + typedef SmartGraph Graph;
1.149 + typedef SmartGraph::Node Item;
1.150 + typedef IterableValueMap<SmartGraph, SmartGraph::Node, double> Ivm;
1.151 +
1.152 + checkConcept<ReadWriteMap<Item, double>, Ivm>();
1.153 +
1.154 + const int num = 10;
1.155 + Graph g;
1.156 + std::vector<Item> items;
1.157 + for (int i = 0; i < num; ++i) {
1.158 + items.push_back(g.addNode());
1.159 + }
1.160 +
1.161 + Ivm map1(g, 0.0);
1.162 + check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size");
1.163 + check(*map1.beginValue() == 0.0, "Wrong value");
1.164 +
1.165 + for (int i = 0; i < num; ++i) {
1.166 + map1.set(items[i], static_cast<double>(i));
1.167 + }
1.168 + check(distance(map1.beginValue(), map1.endValue()) == num, "Wrong size");
1.169 +
1.170 + for (int i = 0; i < num; ++i) {
1.171 + Ivm::ItemIt it(map1, static_cast<double>(i));
1.172 + check(static_cast<Item>(it) == items[i], "Wrong value");
1.173 + ++it;
1.174 + check(static_cast<Item>(it) == INVALID, "Wrong value");
1.175 + }
1.176 +
1.177 + for (Ivm::ValueIterator vit = map1.beginValue();
1.178 + vit != map1.endValue(); ++vit) {
1.179 + check(map1[static_cast<Item>(Ivm::ItemIt(map1, *vit))] == *vit,
1.180 + "Wrong ValueIterator");
1.181 + }
1.182 +
1.183 + for (int i = 0; i < num; ++i) {
1.184 + map1.set(items[i], static_cast<double>(i % 2));
1.185 + }
1.186 + check(distance(map1.beginValue(), map1.endValue()) == 2, "Wrong size");
1.187 +
1.188 + int n = 0;
1.189 + for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) {
1.190 + check(map1[static_cast<Item>(it)] == 0.0, "Wrong value");
1.191 + ++n;
1.192 + }
1.193 + check(n == (num + 1) / 2, "Wrong number");
1.194 +
1.195 + for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) {
1.196 + check(map1[static_cast<Item>(it)] == 1.0, "Wrong value");
1.197 + ++n;
1.198 + }
1.199 + check(n == num, "Wrong number");
1.200 +
1.201 + }
1.202 return 0;
1.203 }