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