1.1 --- a/test/maps_test.cc Sat Sep 26 07:16:22 2009 +0200
1.2 +++ b/test/maps_test.cc Sat Sep 26 07:21:54 2009 +0200
1.3 @@ -22,7 +22,10 @@
1.4 #include <lemon/concept_check.h>
1.5 #include <lemon/concepts/maps.h>
1.6 #include <lemon/maps.h>
1.7 +#include <lemon/list_graph.h>
1.8 #include <lemon/smart_graph.h>
1.9 +#include <lemon/adaptors.h>
1.10 +#include <lemon/dfs.h>
1.11
1.12 #include "test_tools.h"
1.13
1.14 @@ -61,6 +64,12 @@
1.15 typedef ReadWriteMap<A, bool> BoolWriteMap;
1.16 typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;
1.17
1.18 +template<typename Map1, typename Map2, typename ItemIt>
1.19 +void compareMap(const Map1& map1, const Map2& map2, ItemIt it) {
1.20 + for (; it != INVALID; ++it)
1.21 + check(map1[it] == map2[it], "The maps are not equal");
1.22 +}
1.23 +
1.24 int main()
1.25 {
1.26 // Map concepts
1.27 @@ -329,6 +338,10 @@
1.28 // LoggerBoolMap
1.29 {
1.30 typedef std::vector<int> vec;
1.31 + checkConcept<WriteMap<int, bool>, LoggerBoolMap<vec::iterator> >();
1.32 + checkConcept<WriteMap<int, bool>,
1.33 + LoggerBoolMap<std::back_insert_iterator<vec> > >();
1.34 +
1.35 vec v1;
1.36 vec v2(10);
1.37 LoggerBoolMap<std::back_insert_iterator<vec> >
1.38 @@ -348,6 +361,222 @@
1.39 for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();
1.40 it != map2.end(); ++it )
1.41 check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
1.42 +
1.43 + typedef ListDigraph Graph;
1.44 + DIGRAPH_TYPEDEFS(Graph);
1.45 + Graph gr;
1.46 +
1.47 + Node n0 = gr.addNode();
1.48 + Node n1 = gr.addNode();
1.49 + Node n2 = gr.addNode();
1.50 + Node n3 = gr.addNode();
1.51 +
1.52 + gr.addArc(n3, n0);
1.53 + gr.addArc(n3, n2);
1.54 + gr.addArc(n0, n2);
1.55 + gr.addArc(n2, n1);
1.56 + gr.addArc(n0, n1);
1.57 +
1.58 + {
1.59 + std::vector<Node> v;
1.60 + dfs(gr).processedMap(loggerBoolMap(std::back_inserter(v))).run();
1.61 +
1.62 + check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
1.63 + "Something is wrong with LoggerBoolMap");
1.64 + }
1.65 + {
1.66 + std::vector<Node> v(countNodes(gr));
1.67 + dfs(gr).processedMap(loggerBoolMap(v.begin())).run();
1.68 +
1.69 + check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
1.70 + "Something is wrong with LoggerBoolMap");
1.71 + }
1.72 + }
1.73 +
1.74 + // IdMap, RangeIdMap
1.75 + {
1.76 + typedef ListDigraph Graph;
1.77 + DIGRAPH_TYPEDEFS(Graph);
1.78 +
1.79 + checkConcept<ReadMap<Node, int>, IdMap<Graph, Node> >();
1.80 + checkConcept<ReadMap<Arc, int>, IdMap<Graph, Arc> >();
1.81 + checkConcept<ReadMap<Node, int>, RangeIdMap<Graph, Node> >();
1.82 + checkConcept<ReadMap<Arc, int>, RangeIdMap<Graph, Arc> >();
1.83 +
1.84 + Graph gr;
1.85 + IdMap<Graph, Node> nmap(gr);
1.86 + IdMap<Graph, Arc> amap(gr);
1.87 + RangeIdMap<Graph, Node> nrmap(gr);
1.88 + RangeIdMap<Graph, Arc> armap(gr);
1.89 +
1.90 + Node n0 = gr.addNode();
1.91 + Node n1 = gr.addNode();
1.92 + Node n2 = gr.addNode();
1.93 +
1.94 + Arc a0 = gr.addArc(n0, n1);
1.95 + Arc a1 = gr.addArc(n0, n2);
1.96 + Arc a2 = gr.addArc(n2, n1);
1.97 + Arc a3 = gr.addArc(n2, n0);
1.98 +
1.99 + check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap");
1.100 + check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap");
1.101 + check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap");
1.102 +
1.103 + check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap");
1.104 + check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap");
1.105 + check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap");
1.106 + check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap");
1.107 +
1.108 + check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap");
1.109 + check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap");
1.110 +
1.111 + check(nrmap.size() == 3 && armap.size() == 4,
1.112 + "Wrong RangeIdMap::size()");
1.113 +
1.114 + check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap");
1.115 + check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap");
1.116 + check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap");
1.117 +
1.118 + check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap");
1.119 + check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
1.120 + check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap");
1.121 + check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap");
1.122 +
1.123 + check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap");
1.124 + check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap");
1.125 +
1.126 + gr.erase(n1);
1.127 +
1.128 + if (nrmap[n0] == 1) nrmap.swap(n0, n2);
1.129 + nrmap.swap(n2, n0);
1.130 + if (armap[a1] == 1) armap.swap(a1, a3);
1.131 + armap.swap(a3, a1);
1.132 +
1.133 + check(nrmap.size() == 2 && armap.size() == 2,
1.134 + "Wrong RangeIdMap::size()");
1.135 +
1.136 + check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap");
1.137 + check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap");
1.138 +
1.139 + check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
1.140 + check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap");
1.141 +
1.142 + check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap");
1.143 + check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap");
1.144 + }
1.145 +
1.146 + // SourceMap, TargetMap, ForwardMap, BackwardMap, InDegMap, OutDegMap
1.147 + {
1.148 + typedef ListGraph Graph;
1.149 + GRAPH_TYPEDEFS(Graph);
1.150 +
1.151 + checkConcept<ReadMap<Arc, Node>, SourceMap<Graph> >();
1.152 + checkConcept<ReadMap<Arc, Node>, TargetMap<Graph> >();
1.153 + checkConcept<ReadMap<Edge, Arc>, ForwardMap<Graph> >();
1.154 + checkConcept<ReadMap<Edge, Arc>, BackwardMap<Graph> >();
1.155 + checkConcept<ReadMap<Node, int>, InDegMap<Graph> >();
1.156 + checkConcept<ReadMap<Node, int>, OutDegMap<Graph> >();
1.157 +
1.158 + Graph gr;
1.159 + Node n0 = gr.addNode();
1.160 + Node n1 = gr.addNode();
1.161 + Node n2 = gr.addNode();
1.162 +
1.163 + gr.addEdge(n0,n1);
1.164 + gr.addEdge(n1,n2);
1.165 + gr.addEdge(n0,n2);
1.166 + gr.addEdge(n2,n1);
1.167 + gr.addEdge(n1,n2);
1.168 + gr.addEdge(n0,n1);
1.169 +
1.170 + for (EdgeIt e(gr); e != INVALID; ++e) {
1.171 + check(forwardMap(gr)[e] == gr.direct(e, true), "Wrong ForwardMap");
1.172 + check(backwardMap(gr)[e] == gr.direct(e, false), "Wrong BackwardMap");
1.173 + }
1.174 +
1.175 + compareMap(sourceMap(orienter(gr, constMap<Edge, bool>(true))),
1.176 + targetMap(orienter(gr, constMap<Edge, bool>(false))),
1.177 + EdgeIt(gr));
1.178 +
1.179 + typedef Orienter<Graph, const ConstMap<Edge, bool> > Digraph;
1.180 + Digraph dgr(gr, constMap<Edge, bool>(true));
1.181 + OutDegMap<Digraph> odm(dgr);
1.182 + InDegMap<Digraph> idm(dgr);
1.183 +
1.184 + check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 1, "Wrong OutDegMap");
1.185 + check(idm[n0] == 0 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
1.186 +
1.187 + gr.addEdge(n2, n0);
1.188 +
1.189 + check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 2, "Wrong OutDegMap");
1.190 + check(idm[n0] == 1 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
1.191 + }
1.192 +
1.193 + // CrossRefMap
1.194 + {
1.195 + typedef ListDigraph Graph;
1.196 + DIGRAPH_TYPEDEFS(Graph);
1.197 +
1.198 + checkConcept<ReadWriteMap<Node, int>,
1.199 + CrossRefMap<Graph, Node, int> >();
1.200 + checkConcept<ReadWriteMap<Node, bool>,
1.201 + CrossRefMap<Graph, Node, bool> >();
1.202 + checkConcept<ReadWriteMap<Node, double>,
1.203 + CrossRefMap<Graph, Node, double> >();
1.204 +
1.205 + Graph gr;
1.206 + typedef CrossRefMap<Graph, Node, char> CRMap;
1.207 + CRMap map(gr);
1.208 +
1.209 + Node n0 = gr.addNode();
1.210 + Node n1 = gr.addNode();
1.211 + Node n2 = gr.addNode();
1.212 +
1.213 + map.set(n0, 'A');
1.214 + map.set(n1, 'B');
1.215 + map.set(n2, 'C');
1.216 +
1.217 + check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0,
1.218 + "Wrong CrossRefMap");
1.219 + check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1,
1.220 + "Wrong CrossRefMap");
1.221 + check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2,
1.222 + "Wrong CrossRefMap");
1.223 + check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
1.224 + "Wrong CrossRefMap::count()");
1.225 +
1.226 + CRMap::ValueIt it = map.beginValue();
1.227 + check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
1.228 + it == map.endValue(), "Wrong value iterator");
1.229 +
1.230 + map.set(n2, 'A');
1.231 +
1.232 + check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A',
1.233 + "Wrong CrossRefMap");
1.234 + check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap");
1.235 + check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
1.236 + check(map('C') == INVALID && map.inverse()['C'] == INVALID,
1.237 + "Wrong CrossRefMap");
1.238 + check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0,
1.239 + "Wrong CrossRefMap::count()");
1.240 +
1.241 + it = map.beginValue();
1.242 + check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' &&
1.243 + it == map.endValue(), "Wrong value iterator");
1.244 +
1.245 + map.set(n0, 'C');
1.246 +
1.247 + check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
1.248 + "Wrong CrossRefMap");
1.249 + check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
1.250 + check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
1.251 + check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
1.252 + check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
1.253 + "Wrong CrossRefMap::count()");
1.254 +
1.255 + it = map.beginValue();
1.256 + check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
1.257 + it == map.endValue(), "Wrong value iterator");
1.258 }
1.259
1.260 // CrossRefMap
1.261 @@ -546,10 +775,10 @@
1.262 check(static_cast<Item>(it) == INVALID, "Wrong value");
1.263 }
1.264
1.265 - for (Ivm::ValueIterator vit = map1.beginValue();
1.266 + for (Ivm::ValueIt vit = map1.beginValue();
1.267 vit != map1.endValue(); ++vit) {
1.268 check(map1[static_cast<Item>(Ivm::ItemIt(map1, *vit))] == *vit,
1.269 - "Wrong ValueIterator");
1.270 + "Wrong ValueIt");
1.271 }
1.272
1.273 for (int i = 0; i < num; ++i) {