1 /* -*- mode: C++; indent-tabs-mode: nil; -*-
3 * This file is a part of LEMON, a generic C++ optimization library.
5 * Copyright (C) 2003-2009
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7 * (Egervary Research Group on Combinatorial Optimization, EGRES).
9 * Permission to use, modify and distribute this software is granted
10 * provided that this copyright notice appears in all copies. For
11 * precise terms see the accompanying LICENSE file.
13 * This software is provided "AS IS" with no warranty of any kind,
14 * express or implied, and with no claim as to its suitability for any
22 #include <lemon/concept_check.h>
23 #include <lemon/concepts/maps.h>
24 #include <lemon/maps.h>
25 #include <lemon/list_graph.h>
27 #include "test_tools.h"
29 using namespace lemon;
30 using namespace lemon::concepts;
33 inline bool operator<(A, A) { return true; }
44 typedef A argument_type;
45 typedef B result_type;
47 B operator()(const A&) const { return B(); }
49 F& operator=(const F&);
52 int func(A) { return 3; }
54 int binc(int a, B) { return a+1; }
56 typedef ReadMap<A, double> DoubleMap;
57 typedef ReadWriteMap<A, double> DoubleWriteMap;
58 typedef ReferenceMap<A, double, double&, const double&> DoubleRefMap;
60 typedef ReadMap<A, bool> BoolMap;
61 typedef ReadWriteMap<A, bool> BoolWriteMap;
62 typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;
67 checkConcept<ReadMap<A,B>, ReadMap<A,B> >();
68 checkConcept<ReadMap<A,C>, ReadMap<A,C> >();
69 checkConcept<WriteMap<A,B>, WriteMap<A,B> >();
70 checkConcept<WriteMap<A,C>, WriteMap<A,C> >();
71 checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >();
72 checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >();
73 checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >();
74 checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >();
78 checkConcept<ReadWriteMap<A,B>, NullMap<A,B> >();
80 NullMap<A,B> map2 = map1;
81 map1 = nullMap<A,B>();
86 checkConcept<ReadWriteMap<A,B>, ConstMap<A,B> >();
87 checkConcept<ReadWriteMap<A,C>, ConstMap<A,C> >();
89 ConstMap<A,B> map2 = B();
90 ConstMap<A,B> map3 = map1;
91 map1 = constMap<A>(B());
92 map1 = constMap<A,B>();
94 ConstMap<A,C> map4(C(1));
95 ConstMap<A,C> map5 = map4;
96 map4 = constMap<A>(C(2));
99 checkConcept<ReadWriteMap<A,int>, ConstMap<A,int> >();
100 check(constMap<A>(10)[A()] == 10, "Something is wrong with ConstMap");
102 checkConcept<ReadWriteMap<A,int>, ConstMap<A,Const<int,10> > >();
103 ConstMap<A,Const<int,10> > map6;
104 ConstMap<A,Const<int,10> > map7 = map6;
105 map6 = constMap<A,int,10>();
106 map7 = constMap<A,Const<int,10> >();
107 check(map6[A()] == 10 && map7[A()] == 10,
108 "Something is wrong with ConstMap");
113 checkConcept<ReadMap<A,A>, IdentityMap<A> >();
115 IdentityMap<A> map2 = map1;
116 map1 = identityMap<A>();
118 checkConcept<ReadMap<double,double>, IdentityMap<double> >();
119 check(identityMap<double>()[1.0] == 1.0 &&
120 identityMap<double>()[3.14] == 3.14,
121 "Something is wrong with IdentityMap");
126 checkConcept<ReferenceMap<int,B,B&,const B&>, RangeMap<B> >();
128 RangeMap<B> map2(10);
129 RangeMap<B> map3(10,B());
130 RangeMap<B> map4 = map1;
131 RangeMap<B> map5 = rangeMap<B>();
132 RangeMap<B> map6 = rangeMap<B>(10);
133 RangeMap<B> map7 = rangeMap(10,B());
135 checkConcept< ReferenceMap<int, double, double&, const double&>,
136 RangeMap<double> >();
137 std::vector<double> v(10, 0);
139 RangeMap<double> map8(v);
140 RangeMap<double> map9 = rangeMap(v);
141 check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100,
142 "Something is wrong with RangeMap");
147 checkConcept<ReferenceMap<A,B,B&,const B&>, SparseMap<A,B> >();
149 SparseMap<A,B> map2 = B();
150 SparseMap<A,B> map3 = sparseMap<A,B>();
151 SparseMap<A,B> map4 = sparseMap<A>(B());
153 checkConcept< ReferenceMap<double, int, int&, const int&>,
154 SparseMap<double, int> >();
155 std::map<double, int> m;
156 SparseMap<double, int> map5(m);
157 SparseMap<double, int> map6(m,10);
158 SparseMap<double, int> map7 = sparseMap(m);
159 SparseMap<double, int> map8 = sparseMap(m,10);
161 check(map5[1.0] == 0 && map5[3.14] == 0 &&
162 map6[1.0] == 10 && map6[3.14] == 10,
163 "Something is wrong with SparseMap");
164 map5[1.0] = map6[3.14] = 100;
165 check(map5[1.0] == 100 && map5[3.14] == 0 &&
166 map6[1.0] == 10 && map6[3.14] == 100,
167 "Something is wrong with SparseMap");
172 typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap;
173 checkConcept<ReadMap<B,double>, CompMap>();
174 CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());
175 CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());
177 SparseMap<double, bool> m1(false); m1[3.14] = true;
178 RangeMap<double> m2(2); m2[0] = 3.0; m2[1] = 3.14;
179 check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1],
180 "Something is wrong with ComposeMap")
185 typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap;
186 checkConcept<ReadMap<A,double>, CombMap>();
187 CombMap map1 = CombMap(DoubleMap(), DoubleMap());
188 CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());
190 check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,
191 "Something is wrong with CombineMap");
194 // FunctorToMap, MapToFunctor
196 checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >();
197 checkConcept<ReadMap<A,B>, FunctorToMap<F> >();
198 FunctorToMap<F> map1;
199 FunctorToMap<F> map2 = FunctorToMap<F>(F());
200 B b = functorToMap(F())[A()];
202 checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();
203 MapToFunctor<ReadMap<A,B> > map = MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());
205 check(functorToMap(&func)[A()] == 3,
206 "Something is wrong with FunctorToMap");
207 check(mapToFunctor(constMap<A,int>(2))(A()) == 2,
208 "Something is wrong with MapToFunctor");
209 check(mapToFunctor(functorToMap(&func))(A()) == 3 &&
210 mapToFunctor(functorToMap(&func))[A()] == 3,
211 "Something is wrong with FunctorToMap or MapToFunctor");
212 check(functorToMap(mapToFunctor(constMap<A,int>(2)))[A()] == 2,
213 "Something is wrong with FunctorToMap or MapToFunctor");
218 checkConcept<ReadMap<double,double>,
219 ConvertMap<ReadMap<double, int>, double> >();
220 ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true));
221 ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false));
226 checkConcept<DoubleWriteMap, ForkMap<DoubleWriteMap, DoubleWriteMap> >();
228 typedef RangeMap<double> RM;
229 typedef SparseMap<int, double> SM;
232 checkConcept<ReadWriteMap<int, double>, ForkMap<RM, SM> >();
233 checkConcept<ReadWriteMap<int, double>, ForkMap<SM, RM> >();
234 ForkMap<RM, SM> map1(m1,m2);
235 ForkMap<SM, RM> map2 = forkMap(m2,m1);
237 check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 &&
238 m2[5] == 10 && map2[1] == -1 && map2[5] == 10,
239 "Something is wrong with ForkMap");
243 // - AddMap, SubMap, MulMap, DivMap
244 // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap
245 // - NegMap, NegWriteMap, AbsMap
247 checkConcept<DoubleMap, AddMap<DoubleMap,DoubleMap> >();
248 checkConcept<DoubleMap, SubMap<DoubleMap,DoubleMap> >();
249 checkConcept<DoubleMap, MulMap<DoubleMap,DoubleMap> >();
250 checkConcept<DoubleMap, DivMap<DoubleMap,DoubleMap> >();
252 ConstMap<int, double> c1(1.0), c2(3.14);
254 ConvertMap<IdentityMap<int>, double> id(im);
255 check(addMap(c1,id)[0] == 1.0 && addMap(c1,id)[10] == 11.0,
256 "Something is wrong with AddMap");
257 check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0,
258 "Something is wrong with SubMap");
259 check(mulMap(id,c2)[0] == 0 && mulMap(id,c2)[2] == 6.28,
260 "Something is wrong with MulMap");
261 check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2] == 1.57,
262 "Something is wrong with DivMap");
264 checkConcept<DoubleMap, ShiftMap<DoubleMap> >();
265 checkConcept<DoubleWriteMap, ShiftWriteMap<DoubleWriteMap> >();
266 checkConcept<DoubleMap, ScaleMap<DoubleMap> >();
267 checkConcept<DoubleWriteMap, ScaleWriteMap<DoubleWriteMap> >();
268 checkConcept<DoubleMap, NegMap<DoubleMap> >();
269 checkConcept<DoubleWriteMap, NegWriteMap<DoubleWriteMap> >();
270 checkConcept<DoubleMap, AbsMap<DoubleMap> >();
272 check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0,
273 "Something is wrong with ShiftMap");
274 check(shiftWriteMap(id, 2.0)[1] == 3.0 &&
275 shiftWriteMap(id, 2.0)[10] == 12.0,
276 "Something is wrong with ShiftWriteMap");
277 check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0,
278 "Something is wrong with ScaleMap");
279 check(scaleWriteMap(id, 2.0)[1] == 2.0 &&
280 scaleWriteMap(id, 2.0)[10] == 20.0,
281 "Something is wrong with ScaleWriteMap");
282 check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0,
283 "Something is wrong with NegMap");
284 check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0,
285 "Something is wrong with NegWriteMap");
286 check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0,
287 "Something is wrong with AbsMap");
291 // - TrueMap, FalseMap
293 // - NotMap, NotWriteMap
294 // - EqualMap, LessMap
296 checkConcept<BoolMap, TrueMap<A> >();
297 checkConcept<BoolMap, FalseMap<A> >();
298 checkConcept<BoolMap, AndMap<BoolMap,BoolMap> >();
299 checkConcept<BoolMap, OrMap<BoolMap,BoolMap> >();
300 checkConcept<BoolMap, NotMap<BoolMap> >();
301 checkConcept<BoolWriteMap, NotWriteMap<BoolWriteMap> >();
302 checkConcept<BoolMap, EqualMap<DoubleMap,DoubleMap> >();
303 checkConcept<BoolMap, LessMap<DoubleMap,DoubleMap> >();
307 RangeMap<bool> rm(2);
308 rm[0] = true; rm[1] = false;
309 check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] &&
310 !andMap(fm,rm)[0] && !andMap(fm,rm)[1],
311 "Something is wrong with AndMap");
312 check(orMap(tm,rm)[0] && orMap(tm,rm)[1] &&
313 orMap(fm,rm)[0] && !orMap(fm,rm)[1],
314 "Something is wrong with OrMap");
315 check(!notMap(rm)[0] && notMap(rm)[1],
316 "Something is wrong with NotMap");
317 check(!notWriteMap(rm)[0] && notWriteMap(rm)[1],
318 "Something is wrong with NotWriteMap");
320 ConstMap<int, double> cm(2.0);
322 ConvertMap<IdentityMap<int>, double> id(im);
323 check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3],
324 "Something is wrong with LessMap");
325 check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3],
326 "Something is wrong with EqualMap");
331 typedef std::vector<int> vec;
332 checkConcept<WriteMap<int, bool>, LoggerBoolMap<vec::iterator> >();
333 checkConcept<WriteMap<int, bool>,
334 LoggerBoolMap<std::back_insert_iterator<vec> > >();
338 LoggerBoolMap<std::back_insert_iterator<vec> >
339 map1(std::back_inserter(v1));
340 LoggerBoolMap<vec::iterator> map2(v2.begin());
342 map1.set(20, true); map2.set(20, true);
343 map1.set(30, false); map2.set(40, false);
344 map1.set(50, true); map2.set(50, true);
345 map1.set(60, true); map2.set(60, true);
346 check(v1.size() == 3 && v2.size() == 10 &&
347 v1[0]==20 && v1[1]==50 && v1[2]==60 &&
348 v2[0]==20 && v2[1]==50 && v2[2]==60,
349 "Something is wrong with LoggerBoolMap");
352 for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();
353 it != map2.end(); ++it )
354 check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
359 typedef ListDigraph Graph;
360 DIGRAPH_TYPEDEFS(Graph);
362 checkConcept<ReadMap<Node, int>, IdMap<Graph, Node> >();
363 checkConcept<ReadMap<Arc, int>, IdMap<Graph, Arc> >();
364 checkConcept<ReadMap<Node, int>, RangeIdMap<Graph, Node> >();
365 checkConcept<ReadMap<Arc, int>, RangeIdMap<Graph, Arc> >();
368 IdMap<Graph, Node> nmap(gr);
369 IdMap<Graph, Arc> amap(gr);
370 RangeIdMap<Graph, Node> nrmap(gr);
371 RangeIdMap<Graph, Arc> armap(gr);
373 Node n0 = gr.addNode();
374 Node n1 = gr.addNode();
375 Node n2 = gr.addNode();
377 Arc a0 = gr.addArc(n0, n1);
378 Arc a1 = gr.addArc(n0, n2);
379 Arc a2 = gr.addArc(n2, n1);
380 Arc a3 = gr.addArc(n2, n0);
382 check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap");
383 check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap");
384 check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap");
386 check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap");
387 check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap");
388 check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap");
389 check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap");
391 check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap");
392 check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap");
394 check(nrmap.size() == 3 && armap.size() == 4,
395 "Wrong RangeIdMap::size()");
397 check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap");
398 check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap");
399 check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap");
401 check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap");
402 check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
403 check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap");
404 check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap");
406 check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap");
407 check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap");
411 if (nrmap[n0] == 1) nrmap.swap(n0, n2);
413 if (armap[a1] == 1) armap.swap(a1, a3);
416 check(nrmap.size() == 2 && armap.size() == 2,
417 "Wrong RangeIdMap::size()");
419 check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap");
420 check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap");
422 check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
423 check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap");
425 check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap");
426 check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap");
431 typedef ListDigraph Graph;
432 DIGRAPH_TYPEDEFS(Graph);
434 checkConcept<ReadWriteMap<Node, int>,
435 CrossRefMap<Graph, Node, int> >();
436 checkConcept<ReadWriteMap<Node, bool>,
437 CrossRefMap<Graph, Node, bool> >();
438 checkConcept<ReadWriteMap<Node, double>,
439 CrossRefMap<Graph, Node, double> >();
442 typedef CrossRefMap<Graph, Node, char> CRMap;
443 typedef CRMap::ValueIterator ValueIt;
446 Node n0 = gr.addNode();
447 Node n1 = gr.addNode();
448 Node n2 = gr.addNode();
454 check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0,
455 "Wrong CrossRefMap");
456 check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1,
457 "Wrong CrossRefMap");
458 check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2,
459 "Wrong CrossRefMap");
460 check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
461 "Wrong CrossRefMap::count()");
463 ValueIt it = map.beginValue();
464 check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
465 it == map.endValue(), "Wrong value iterator");
469 check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A',
470 "Wrong CrossRefMap");
471 check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap");
472 check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
473 check(map('C') == INVALID && map.inverse()['C'] == INVALID,
474 "Wrong CrossRefMap");
475 check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0,
476 "Wrong CrossRefMap::count()");
478 it = map.beginValue();
479 check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' &&
480 it == map.endValue(), "Wrong value iterator");
484 check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
485 "Wrong CrossRefMap");
486 check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
487 check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
488 check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
489 check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
490 "Wrong CrossRefMap::count()");
492 it = map.beginValue();
493 check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
494 it == map.endValue(), "Wrong value iterator");