| [25] | 1 | /* -*- C++ -*- | 
|---|
 | 2 |  * | 
|---|
 | 3 |  * This file is a part of LEMON, a generic C++ optimization library | 
|---|
 | 4 |  * | 
|---|
| [39] | 5 |  * Copyright (C) 2003-2008 | 
|---|
| [25] | 6 |  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport | 
|---|
 | 7 |  * (Egervary Research Group on Combinatorial Optimization, EGRES). | 
|---|
 | 8 |  * | 
|---|
 | 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. | 
|---|
 | 12 |  * | 
|---|
 | 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 | 
|---|
 | 15 |  * purpose. | 
|---|
 | 16 |  * | 
|---|
 | 17 |  */ | 
|---|
 | 18 |  | 
|---|
 | 19 | #include <deque> | 
|---|
 | 20 | #include <set> | 
|---|
 | 21 |  | 
|---|
 | 22 | #include <lemon/concept_check.h> | 
|---|
 | 23 | #include <lemon/concepts/maps.h> | 
|---|
 | 24 | #include <lemon/maps.h> | 
|---|
 | 25 |  | 
|---|
 | 26 | #include "test_tools.h" | 
|---|
 | 27 |  | 
|---|
 | 28 | using namespace lemon; | 
|---|
 | 29 | using namespace lemon::concepts; | 
|---|
 | 30 |  | 
|---|
 | 31 | struct A {}; | 
|---|
 | 32 | inline bool operator<(A, A) { return true; } | 
|---|
 | 33 | struct B {}; | 
|---|
 | 34 |  | 
|---|
| [94] | 35 | class C { | 
|---|
 | 36 |   int x; | 
|---|
 | 37 | public: | 
|---|
 | 38 |   C(int _x) : x(_x) {} | 
|---|
 | 39 | }; | 
|---|
 | 40 |  | 
|---|
| [25] | 41 | class F { | 
|---|
 | 42 | public: | 
|---|
 | 43 |   typedef A argument_type; | 
|---|
 | 44 |   typedef B result_type; | 
|---|
 | 45 |  | 
|---|
| [80] | 46 |   B operator()(const A&) const { return B(); } | 
|---|
 | 47 | private: | 
|---|
 | 48 |   F& operator=(const F&); | 
|---|
| [25] | 49 | }; | 
|---|
 | 50 |  | 
|---|
| [80] | 51 | int func(A) { return 3; } | 
|---|
| [25] | 52 |  | 
|---|
| [80] | 53 | int binc(int a, B) { return a+1; } | 
|---|
| [25] | 54 |  | 
|---|
| [80] | 55 | typedef ReadMap<A, double> DoubleMap; | 
|---|
 | 56 | typedef ReadWriteMap<A, double> DoubleWriteMap; | 
|---|
 | 57 | typedef ReferenceMap<A, double, double&, const double&> DoubleRefMap; | 
|---|
| [25] | 58 |  | 
|---|
| [80] | 59 | typedef ReadMap<A, bool> BoolMap; | 
|---|
| [25] | 60 | typedef ReadWriteMap<A, bool> BoolWriteMap; | 
|---|
| [80] | 61 | typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap; | 
|---|
| [25] | 62 |  | 
|---|
 | 63 | int main() | 
|---|
| [80] | 64 | { | 
|---|
 | 65 |   // Map concepts | 
|---|
| [25] | 66 |   checkConcept<ReadMap<A,B>, ReadMap<A,B> >(); | 
|---|
| [94] | 67 |   checkConcept<ReadMap<A,C>, ReadMap<A,C> >(); | 
|---|
| [25] | 68 |   checkConcept<WriteMap<A,B>, WriteMap<A,B> >(); | 
|---|
| [94] | 69 |   checkConcept<WriteMap<A,C>, WriteMap<A,C> >(); | 
|---|
| [25] | 70 |   checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >(); | 
|---|
| [94] | 71 |   checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >(); | 
|---|
| [25] | 72 |   checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >(); | 
|---|
| [94] | 73 |   checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >(); | 
|---|
| [25] | 74 |  | 
|---|
| [80] | 75 |   // NullMap | 
|---|
 | 76 |   { | 
|---|
 | 77 |     checkConcept<ReadWriteMap<A,B>, NullMap<A,B> >(); | 
|---|
 | 78 |     NullMap<A,B> map1; | 
|---|
 | 79 |     NullMap<A,B> map2 = map1; | 
|---|
 | 80 |     map1 = nullMap<A,B>(); | 
|---|
 | 81 |   } | 
|---|
 | 82 |  | 
|---|
 | 83 |   // ConstMap | 
|---|
 | 84 |   { | 
|---|
 | 85 |     checkConcept<ReadWriteMap<A,B>, ConstMap<A,B> >(); | 
|---|
 | 86 |     ConstMap<A,B> map1; | 
|---|
 | 87 |     ConstMap<A,B> map2(B()); | 
|---|
 | 88 |     ConstMap<A,B> map3 = map1; | 
|---|
 | 89 |     map1 = constMap<A>(B()); | 
|---|
 | 90 |     map1.setAll(B()); | 
|---|
| [82] | 91 |  | 
|---|
| [80] | 92 |     checkConcept<ReadWriteMap<A,int>, ConstMap<A,int> >(); | 
|---|
 | 93 |     check(constMap<A>(10)[A()] == 10, "Something is wrong with ConstMap"); | 
|---|
 | 94 |  | 
|---|
 | 95 |     checkConcept<ReadWriteMap<A,int>, ConstMap<A,Const<int,10> > >(); | 
|---|
 | 96 |     ConstMap<A,Const<int,10> > map4; | 
|---|
 | 97 |     ConstMap<A,Const<int,10> > map5 = map4; | 
|---|
 | 98 |     map4 = map5; | 
|---|
 | 99 |     check(map4[A()] == 10 && map5[A()] == 10, "Something is wrong with ConstMap"); | 
|---|
 | 100 |   } | 
|---|
 | 101 |  | 
|---|
 | 102 |   // IdentityMap | 
|---|
 | 103 |   { | 
|---|
 | 104 |     checkConcept<ReadMap<A,A>, IdentityMap<A> >(); | 
|---|
 | 105 |     IdentityMap<A> map1; | 
|---|
 | 106 |     IdentityMap<A> map2 = map1; | 
|---|
 | 107 |     map1 = identityMap<A>(); | 
|---|
| [82] | 108 |  | 
|---|
| [80] | 109 |     checkConcept<ReadMap<double,double>, IdentityMap<double> >(); | 
|---|
 | 110 |     check(identityMap<double>()[1.0] == 1.0 && identityMap<double>()[3.14] == 3.14, | 
|---|
 | 111 |           "Something is wrong with IdentityMap"); | 
|---|
 | 112 |   } | 
|---|
 | 113 |  | 
|---|
 | 114 |   // RangeMap | 
|---|
 | 115 |   { | 
|---|
 | 116 |     checkConcept<ReferenceMap<int,B,B&,const B&>, RangeMap<B> >(); | 
|---|
 | 117 |     RangeMap<B> map1; | 
|---|
 | 118 |     RangeMap<B> map2(10); | 
|---|
 | 119 |     RangeMap<B> map3(10,B()); | 
|---|
 | 120 |     RangeMap<B> map4 = map1; | 
|---|
 | 121 |     RangeMap<B> map5 = rangeMap<B>(); | 
|---|
 | 122 |     RangeMap<B> map6 = rangeMap<B>(10); | 
|---|
 | 123 |     RangeMap<B> map7 = rangeMap(10,B()); | 
|---|
 | 124 |  | 
|---|
 | 125 |     checkConcept< ReferenceMap<int, double, double&, const double&>, | 
|---|
 | 126 |                   RangeMap<double> >(); | 
|---|
 | 127 |     std::vector<double> v(10, 0); | 
|---|
 | 128 |     v[5] = 100; | 
|---|
 | 129 |     RangeMap<double> map8(v); | 
|---|
 | 130 |     RangeMap<double> map9 = rangeMap(v); | 
|---|
 | 131 |     check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100, | 
|---|
 | 132 |           "Something is wrong with RangeMap"); | 
|---|
 | 133 |   } | 
|---|
 | 134 |  | 
|---|
 | 135 |   // SparseMap | 
|---|
 | 136 |   { | 
|---|
 | 137 |     checkConcept<ReferenceMap<A,B,B&,const B&>, SparseMap<A,B> >(); | 
|---|
 | 138 |     SparseMap<A,B> map1; | 
|---|
 | 139 |     SparseMap<A,B> map2(B()); | 
|---|
 | 140 |     SparseMap<A,B> map3 = sparseMap<A,B>(); | 
|---|
 | 141 |     SparseMap<A,B> map4 = sparseMap<A>(B()); | 
|---|
 | 142 |  | 
|---|
 | 143 |     checkConcept< ReferenceMap<double, int, int&, const int&>, | 
|---|
 | 144 |                   SparseMap<double, int> >(); | 
|---|
 | 145 |     std::map<double, int> m; | 
|---|
 | 146 |     SparseMap<double, int> map5(m); | 
|---|
 | 147 |     SparseMap<double, int> map6(m,10); | 
|---|
 | 148 |     SparseMap<double, int> map7 = sparseMap(m); | 
|---|
 | 149 |     SparseMap<double, int> map8 = sparseMap(m,10); | 
|---|
 | 150 |  | 
|---|
 | 151 |     check(map5[1.0] == 0 && map5[3.14] == 0 && map6[1.0] == 10 && map6[3.14] == 10, | 
|---|
 | 152 |           "Something is wrong with SparseMap"); | 
|---|
 | 153 |     map5[1.0] = map6[3.14] = 100; | 
|---|
 | 154 |     check(map5[1.0] == 100 && map5[3.14] == 0 && map6[1.0] == 10 && map6[3.14] == 100, | 
|---|
 | 155 |           "Something is wrong with SparseMap"); | 
|---|
 | 156 |   } | 
|---|
 | 157 |  | 
|---|
 | 158 |   // ComposeMap | 
|---|
 | 159 |   { | 
|---|
 | 160 |     typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap; | 
|---|
 | 161 |     checkConcept<ReadMap<B,double>, CompMap>(); | 
|---|
 | 162 |     CompMap map1(DoubleMap(),ReadMap<B,A>()); | 
|---|
 | 163 |     CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>()); | 
|---|
| [82] | 164 |  | 
|---|
| [80] | 165 |     SparseMap<double, bool> m1(false); m1[3.14] = true; | 
|---|
 | 166 |     RangeMap<double> m2(2); m2[0] = 3.0; m2[1] = 3.14; | 
|---|
 | 167 |     check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1], "Something is wrong with ComposeMap") | 
|---|
 | 168 |   } | 
|---|
 | 169 |  | 
|---|
 | 170 |   // CombineMap | 
|---|
 | 171 |   { | 
|---|
 | 172 |     typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap; | 
|---|
 | 173 |     checkConcept<ReadMap<A,double>, CombMap>(); | 
|---|
 | 174 |     CombMap map1(DoubleMap(), DoubleMap()); | 
|---|
 | 175 |     CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>()); | 
|---|
 | 176 |  | 
|---|
 | 177 |     check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3, | 
|---|
 | 178 |           "Something is wrong with CombineMap"); | 
|---|
 | 179 |   } | 
|---|
 | 180 |  | 
|---|
 | 181 |   // FunctorToMap, MapToFunctor | 
|---|
 | 182 |   { | 
|---|
 | 183 |     checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >(); | 
|---|
 | 184 |     checkConcept<ReadMap<A,B>, FunctorToMap<F> >(); | 
|---|
 | 185 |     FunctorToMap<F> map1; | 
|---|
 | 186 |     FunctorToMap<F> map2(F()); | 
|---|
 | 187 |     B b = functorToMap(F())[A()]; | 
|---|
 | 188 |  | 
|---|
 | 189 |     checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >(); | 
|---|
 | 190 |     MapToFunctor<ReadMap<A,B> > map(ReadMap<A,B>()); | 
|---|
 | 191 |  | 
|---|
 | 192 |     check(functorToMap(&func)[A()] == 3, "Something is wrong with FunctorToMap"); | 
|---|
 | 193 |     check(mapToFunctor(constMap<A,int>(2))(A()) == 2, "Something is wrong with MapToFunctor"); | 
|---|
 | 194 |     check(mapToFunctor(functorToMap(&func))(A()) == 3 && mapToFunctor(functorToMap(&func))[A()] == 3, | 
|---|
 | 195 |           "Something is wrong with FunctorToMap or MapToFunctor"); | 
|---|
 | 196 |     check(functorToMap(mapToFunctor(constMap<A,int>(2)))[A()] == 2, | 
|---|
 | 197 |           "Something is wrong with FunctorToMap or MapToFunctor"); | 
|---|
 | 198 |   } | 
|---|
 | 199 |  | 
|---|
 | 200 |   // ConvertMap | 
|---|
 | 201 |   { | 
|---|
 | 202 |     checkConcept<ReadMap<double,double>, ConvertMap<ReadMap<double, int>, double> >(); | 
|---|
 | 203 |     ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true)); | 
|---|
 | 204 |     ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false)); | 
|---|
 | 205 |   } | 
|---|
 | 206 |  | 
|---|
 | 207 |   // ForkMap | 
|---|
 | 208 |   { | 
|---|
 | 209 |     checkConcept<DoubleWriteMap, ForkMap<DoubleWriteMap, DoubleWriteMap> >(); | 
|---|
| [82] | 210 |  | 
|---|
| [80] | 211 |     typedef RangeMap<double> RM; | 
|---|
 | 212 |     typedef SparseMap<int, double> SM; | 
|---|
 | 213 |     RM m1(10, -1); | 
|---|
 | 214 |     SM m2(-1); | 
|---|
 | 215 |     checkConcept<ReadWriteMap<int, double>, ForkMap<RM, SM> >(); | 
|---|
 | 216 |     checkConcept<ReadWriteMap<int, double>, ForkMap<SM, RM> >(); | 
|---|
 | 217 |     ForkMap<RM, SM> map1(m1,m2); | 
|---|
 | 218 |     ForkMap<SM, RM> map2 = forkMap(m2,m1); | 
|---|
 | 219 |     map2.set(5, 10); | 
|---|
 | 220 |     check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 && m2[5] == 10 && map2[1] == -1 && map2[5] == 10, | 
|---|
 | 221 |           "Something is wrong with ForkMap"); | 
|---|
 | 222 |   } | 
|---|
| [82] | 223 |  | 
|---|
| [80] | 224 |   // Arithmetic maps: | 
|---|
 | 225 |   // - AddMap, SubMap, MulMap, DivMap | 
|---|
 | 226 |   // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap | 
|---|
 | 227 |   // - NegMap, NegWriteMap, AbsMap | 
|---|
 | 228 |   { | 
|---|
 | 229 |     checkConcept<DoubleMap, AddMap<DoubleMap,DoubleMap> >(); | 
|---|
 | 230 |     checkConcept<DoubleMap, SubMap<DoubleMap,DoubleMap> >(); | 
|---|
 | 231 |     checkConcept<DoubleMap, MulMap<DoubleMap,DoubleMap> >(); | 
|---|
 | 232 |     checkConcept<DoubleMap, DivMap<DoubleMap,DoubleMap> >(); | 
|---|
| [82] | 233 |  | 
|---|
| [80] | 234 |     ConstMap<int, double> c1(1.0), c2(3.14); | 
|---|
 | 235 |     IdentityMap<int> im; | 
|---|
 | 236 |     ConvertMap<IdentityMap<int>, double> id(im); | 
|---|
 | 237 |     check(addMap(c1,id)[0] == 1.0  && addMap(c1,id)[10] == 11.0, "Something is wrong with AddMap"); | 
|---|
 | 238 |     check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0,  "Something is wrong with SubMap"); | 
|---|
 | 239 |     check(mulMap(id,c2)[0] == 0    && mulMap(id,c2)[2]  == 6.28, "Something is wrong with MulMap"); | 
|---|
 | 240 |     check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2]  == 1.57, "Something is wrong with DivMap"); | 
|---|
| [82] | 241 |  | 
|---|
| [80] | 242 |     checkConcept<DoubleMap, ShiftMap<DoubleMap> >(); | 
|---|
 | 243 |     checkConcept<DoubleWriteMap, ShiftWriteMap<DoubleWriteMap> >(); | 
|---|
 | 244 |     checkConcept<DoubleMap, ScaleMap<DoubleMap> >(); | 
|---|
 | 245 |     checkConcept<DoubleWriteMap, ScaleWriteMap<DoubleWriteMap> >(); | 
|---|
 | 246 |     checkConcept<DoubleMap, NegMap<DoubleMap> >(); | 
|---|
 | 247 |     checkConcept<DoubleWriteMap, NegWriteMap<DoubleWriteMap> >(); | 
|---|
 | 248 |     checkConcept<DoubleMap, AbsMap<DoubleMap> >(); | 
|---|
| [25] | 249 |  | 
|---|
| [80] | 250 |     check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0, | 
|---|
 | 251 |           "Something is wrong with ShiftMap"); | 
|---|
 | 252 |     check(shiftWriteMap(id, 2.0)[1] == 3.0 && shiftWriteMap(id, 2.0)[10] == 12.0, | 
|---|
 | 253 |           "Something is wrong with ShiftWriteMap"); | 
|---|
 | 254 |     check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0, | 
|---|
 | 255 |           "Something is wrong with ScaleMap"); | 
|---|
 | 256 |     check(scaleWriteMap(id, 2.0)[1] == 2.0 && scaleWriteMap(id, 2.0)[10] == 20.0, | 
|---|
 | 257 |           "Something is wrong with ScaleWriteMap"); | 
|---|
 | 258 |     check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0, | 
|---|
 | 259 |           "Something is wrong with NegMap"); | 
|---|
 | 260 |     check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0, | 
|---|
 | 261 |           "Something is wrong with NegWriteMap"); | 
|---|
 | 262 |     check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0, | 
|---|
 | 263 |           "Something is wrong with AbsMap"); | 
|---|
 | 264 |   } | 
|---|
| [82] | 265 |  | 
|---|
 | 266 |   // Logical maps: | 
|---|
 | 267 |   // - TrueMap, FalseMap | 
|---|
 | 268 |   // - AndMap, OrMap | 
|---|
 | 269 |   // - NotMap, NotWriteMap | 
|---|
 | 270 |   // - EqualMap, LessMap | 
|---|
| [80] | 271 |   { | 
|---|
| [82] | 272 |     checkConcept<BoolMap, TrueMap<A> >(); | 
|---|
 | 273 |     checkConcept<BoolMap, FalseMap<A> >(); | 
|---|
 | 274 |     checkConcept<BoolMap, AndMap<BoolMap,BoolMap> >(); | 
|---|
 | 275 |     checkConcept<BoolMap, OrMap<BoolMap,BoolMap> >(); | 
|---|
| [80] | 276 |     checkConcept<BoolMap, NotMap<BoolMap> >(); | 
|---|
 | 277 |     checkConcept<BoolWriteMap, NotWriteMap<BoolWriteMap> >(); | 
|---|
| [82] | 278 |     checkConcept<BoolMap, EqualMap<DoubleMap,DoubleMap> >(); | 
|---|
 | 279 |     checkConcept<BoolMap, LessMap<DoubleMap,DoubleMap> >(); | 
|---|
 | 280 |  | 
|---|
 | 281 |     TrueMap<int> tm; | 
|---|
 | 282 |     FalseMap<int> fm; | 
|---|
| [80] | 283 |     RangeMap<bool> rm(2); | 
|---|
 | 284 |     rm[0] = true; rm[1] = false; | 
|---|
| [82] | 285 |     check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] && !andMap(fm,rm)[0] && !andMap(fm,rm)[1], | 
|---|
 | 286 |           "Something is wrong with AndMap"); | 
|---|
 | 287 |     check(orMap(tm,rm)[0] && orMap(tm,rm)[1] && orMap(fm,rm)[0] && !orMap(fm,rm)[1], | 
|---|
 | 288 |           "Something is wrong with OrMap"); | 
|---|
 | 289 |     check(!notMap(rm)[0] && notMap(rm)[1], "Something is wrong with NotMap"); | 
|---|
 | 290 |     check(!notWriteMap(rm)[0] && notWriteMap(rm)[1], "Something is wrong with NotWriteMap"); | 
|---|
 | 291 |  | 
|---|
 | 292 |     ConstMap<int, double> cm(2.0); | 
|---|
 | 293 |     IdentityMap<int> im; | 
|---|
 | 294 |     ConvertMap<IdentityMap<int>, double> id(im); | 
|---|
 | 295 |     check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3], | 
|---|
 | 296 |           "Something is wrong with LessMap"); | 
|---|
 | 297 |     check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3], | 
|---|
 | 298 |           "Something is wrong with EqualMap"); | 
|---|
| [80] | 299 |   } | 
|---|
| [25] | 300 |  | 
|---|
 | 301 |   return 0; | 
|---|
 | 302 | } | 
|---|