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