test/maps_test.cc
author Alpar Juttner <alpar@cs.elte.hu>
Fri, 22 May 2015 17:44:29 +0200
changeset 1356 138714057145
parent 1261 97f1760dcd13
child 1337 4add05447ca0
permissions -rw-r--r--
Merge
alpar@209
     1
/* -*- mode: C++; indent-tabs-mode: nil; -*-
alpar@25
     2
 *
alpar@209
     3
 * This file is a part of LEMON, a generic C++ optimization library.
alpar@25
     4
 *
alpar@1270
     5
 * Copyright (C) 2003-2013
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>
kpeter@731
    25
#include <lemon/list_graph.h>
kpeter@741
    26
#include <lemon/smart_graph.h>
kpeter@770
    27
#include <lemon/adaptors.h>
kpeter@770
    28
#include <lemon/dfs.h>
kpeter@836
    29
#include <algorithm>
alpar@25
    30
alpar@25
    31
#include "test_tools.h"
alpar@25
    32
alpar@25
    33
using namespace lemon;
alpar@25
    34
using namespace lemon::concepts;
alpar@25
    35
alpar@25
    36
struct A {};
alpar@25
    37
inline bool operator<(A, A) { return true; }
alpar@25
    38
struct B {};
alpar@25
    39
kpeter@94
    40
class C {
kpeter@836
    41
  int _x;
kpeter@94
    42
public:
kpeter@836
    43
  C(int x) : _x(x) {}
kpeter@836
    44
  int get() const { return _x; }
kpeter@836
    45
};
kpeter@836
    46
inline bool operator<(C c1, C c2) { return c1.get() < c2.get(); }
kpeter@836
    47
inline bool operator==(C c1, C c2) { return c1.get() == c2.get(); }
kpeter@836
    48
kpeter@836
    49
C createC(int x) { return C(x); }
kpeter@836
    50
kpeter@836
    51
template <typename T>
kpeter@836
    52
class Less {
kpeter@836
    53
  T _t;
kpeter@836
    54
public:
kpeter@836
    55
  Less(T t): _t(t) {}
kpeter@836
    56
  bool operator()(const T& t) const { return t < _t; }
kpeter@94
    57
};
kpeter@94
    58
alpar@25
    59
class F {
alpar@25
    60
public:
alpar@25
    61
  typedef A argument_type;
alpar@25
    62
  typedef B result_type;
alpar@25
    63
kpeter@80
    64
  B operator()(const A&) const { return B(); }
kpeter@80
    65
private:
kpeter@80
    66
  F& operator=(const F&);
alpar@25
    67
};
alpar@25
    68
kpeter@80
    69
int func(A) { return 3; }
alpar@25
    70
kpeter@80
    71
int binc(int a, B) { return a+1; }
alpar@25
    72
kpeter@836
    73
template <typename T>
kpeter@836
    74
class Sum {
kpeter@836
    75
  T& _sum;
kpeter@836
    76
public:
kpeter@836
    77
  Sum(T& sum) : _sum(sum) {}
kpeter@836
    78
  void operator()(const T& t) { _sum += t; }
kpeter@836
    79
};
kpeter@836
    80
kpeter@80
    81
typedef ReadMap<A, double> DoubleMap;
kpeter@80
    82
typedef ReadWriteMap<A, double> DoubleWriteMap;
kpeter@80
    83
typedef ReferenceMap<A, double, double&, const double&> DoubleRefMap;
alpar@25
    84
kpeter@80
    85
typedef ReadMap<A, bool> BoolMap;
alpar@25
    86
typedef ReadWriteMap<A, bool> BoolWriteMap;
kpeter@80
    87
typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;
alpar@25
    88
alpar@25
    89
int main()
kpeter@80
    90
{
kpeter@80
    91
  // Map concepts
alpar@25
    92
  checkConcept<ReadMap<A,B>, ReadMap<A,B> >();
kpeter@94
    93
  checkConcept<ReadMap<A,C>, ReadMap<A,C> >();
alpar@25
    94
  checkConcept<WriteMap<A,B>, WriteMap<A,B> >();
kpeter@94
    95
  checkConcept<WriteMap<A,C>, WriteMap<A,C> >();
alpar@25
    96
  checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >();
kpeter@94
    97
  checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >();
alpar@25
    98
  checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >();
kpeter@94
    99
  checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >();
alpar@25
   100
kpeter@80
   101
  // NullMap
kpeter@80
   102
  {
kpeter@80
   103
    checkConcept<ReadWriteMap<A,B>, NullMap<A,B> >();
kpeter@80
   104
    NullMap<A,B> map1;
kpeter@80
   105
    NullMap<A,B> map2 = map1;
alpar@1257
   106
    ::lemon::ignore_unused_variable_warning(map2);
kpeter@80
   107
    map1 = nullMap<A,B>();
kpeter@80
   108
  }
kpeter@80
   109
kpeter@80
   110
  // ConstMap
kpeter@80
   111
  {
kpeter@80
   112
    checkConcept<ReadWriteMap<A,B>, ConstMap<A,B> >();
kpeter@123
   113
    checkConcept<ReadWriteMap<A,C>, ConstMap<A,C> >();
kpeter@80
   114
    ConstMap<A,B> map1;
deba@136
   115
    ConstMap<A,B> map2 = B();
kpeter@80
   116
    ConstMap<A,B> map3 = map1;
alpar@1257
   117
    ::lemon::ignore_unused_variable_warning(map2,map3);
alpar@1157
   118
kpeter@80
   119
    map1 = constMap<A>(B());
kpeter@123
   120
    map1 = constMap<A,B>();
kpeter@80
   121
    map1.setAll(B());
kpeter@123
   122
    ConstMap<A,C> map4(C(1));
kpeter@123
   123
    ConstMap<A,C> map5 = map4;
alpar@1257
   124
    ::lemon::ignore_unused_variable_warning(map5);
alpar@1157
   125
kpeter@123
   126
    map4 = constMap<A>(C(2));
kpeter@123
   127
    map4.setAll(C(3));
kpeter@82
   128
kpeter@80
   129
    checkConcept<ReadWriteMap<A,int>, ConstMap<A,int> >();
kpeter@80
   130
    check(constMap<A>(10)[A()] == 10, "Something is wrong with ConstMap");
kpeter@80
   131
kpeter@80
   132
    checkConcept<ReadWriteMap<A,int>, ConstMap<A,Const<int,10> > >();
kpeter@123
   133
    ConstMap<A,Const<int,10> > map6;
kpeter@123
   134
    ConstMap<A,Const<int,10> > map7 = map6;
kpeter@123
   135
    map6 = constMap<A,int,10>();
kpeter@123
   136
    map7 = constMap<A,Const<int,10> >();
alpar@210
   137
    check(map6[A()] == 10 && map7[A()] == 10,
alpar@210
   138
          "Something is wrong with ConstMap");
kpeter@80
   139
  }
kpeter@80
   140
kpeter@80
   141
  // IdentityMap
kpeter@80
   142
  {
kpeter@80
   143
    checkConcept<ReadMap<A,A>, IdentityMap<A> >();
kpeter@80
   144
    IdentityMap<A> map1;
kpeter@80
   145
    IdentityMap<A> map2 = map1;
alpar@1257
   146
    ::lemon::ignore_unused_variable_warning(map2);
alpar@1157
   147
kpeter@80
   148
    map1 = identityMap<A>();
kpeter@82
   149
kpeter@80
   150
    checkConcept<ReadMap<double,double>, IdentityMap<double> >();
alpar@210
   151
    check(identityMap<double>()[1.0] == 1.0 &&
alpar@210
   152
          identityMap<double>()[3.14] == 3.14,
kpeter@80
   153
          "Something is wrong with IdentityMap");
kpeter@80
   154
  }
kpeter@80
   155
kpeter@80
   156
  // RangeMap
kpeter@80
   157
  {
kpeter@80
   158
    checkConcept<ReferenceMap<int,B,B&,const B&>, RangeMap<B> >();
kpeter@80
   159
    RangeMap<B> map1;
kpeter@80
   160
    RangeMap<B> map2(10);
kpeter@80
   161
    RangeMap<B> map3(10,B());
kpeter@80
   162
    RangeMap<B> map4 = map1;
kpeter@80
   163
    RangeMap<B> map5 = rangeMap<B>();
kpeter@80
   164
    RangeMap<B> map6 = rangeMap<B>(10);
kpeter@80
   165
    RangeMap<B> map7 = rangeMap(10,B());
kpeter@80
   166
kpeter@80
   167
    checkConcept< ReferenceMap<int, double, double&, const double&>,
kpeter@80
   168
                  RangeMap<double> >();
kpeter@80
   169
    std::vector<double> v(10, 0);
kpeter@80
   170
    v[5] = 100;
kpeter@80
   171
    RangeMap<double> map8(v);
kpeter@80
   172
    RangeMap<double> map9 = rangeMap(v);
kpeter@80
   173
    check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100,
kpeter@80
   174
          "Something is wrong with RangeMap");
kpeter@80
   175
  }
kpeter@80
   176
kpeter@80
   177
  // SparseMap
kpeter@80
   178
  {
kpeter@80
   179
    checkConcept<ReferenceMap<A,B,B&,const B&>, SparseMap<A,B> >();
kpeter@80
   180
    SparseMap<A,B> map1;
deba@136
   181
    SparseMap<A,B> map2 = B();
kpeter@80
   182
    SparseMap<A,B> map3 = sparseMap<A,B>();
kpeter@80
   183
    SparseMap<A,B> map4 = sparseMap<A>(B());
kpeter@80
   184
kpeter@80
   185
    checkConcept< ReferenceMap<double, int, int&, const int&>,
kpeter@80
   186
                  SparseMap<double, int> >();
kpeter@80
   187
    std::map<double, int> m;
kpeter@80
   188
    SparseMap<double, int> map5(m);
kpeter@80
   189
    SparseMap<double, int> map6(m,10);
kpeter@80
   190
    SparseMap<double, int> map7 = sparseMap(m);
kpeter@80
   191
    SparseMap<double, int> map8 = sparseMap(m,10);
kpeter@80
   192
alpar@210
   193
    check(map5[1.0] == 0 && map5[3.14] == 0 &&
alpar@210
   194
          map6[1.0] == 10 && map6[3.14] == 10,
kpeter@80
   195
          "Something is wrong with SparseMap");
kpeter@80
   196
    map5[1.0] = map6[3.14] = 100;
alpar@210
   197
    check(map5[1.0] == 100 && map5[3.14] == 0 &&
alpar@210
   198
          map6[1.0] == 10 && map6[3.14] == 100,
kpeter@80
   199
          "Something is wrong with SparseMap");
kpeter@80
   200
  }
kpeter@80
   201
kpeter@80
   202
  // ComposeMap
kpeter@80
   203
  {
kpeter@80
   204
    typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap;
kpeter@80
   205
    checkConcept<ReadMap<B,double>, CompMap>();
alpar@554
   206
    CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());
alpar@1257
   207
    ::lemon::ignore_unused_variable_warning(map1);
kpeter@80
   208
    CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());
alpar@1257
   209
    ::lemon::ignore_unused_variable_warning(map2);
kpeter@82
   210
kpeter@80
   211
    SparseMap<double, bool> m1(false); m1[3.14] = true;
kpeter@80
   212
    RangeMap<double> m2(2); m2[0] = 3.0; m2[1] = 3.14;
alpar@210
   213
    check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1],
alpar@210
   214
          "Something is wrong with ComposeMap")
kpeter@80
   215
  }
kpeter@80
   216
kpeter@80
   217
  // CombineMap
kpeter@80
   218
  {
kpeter@80
   219
    typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap;
kpeter@80
   220
    checkConcept<ReadMap<A,double>, CombMap>();
alpar@554
   221
    CombMap map1 = CombMap(DoubleMap(), DoubleMap());
alpar@1257
   222
    ::lemon::ignore_unused_variable_warning(map1);
kpeter@80
   223
    CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());
alpar@1257
   224
    ::lemon::ignore_unused_variable_warning(map2);
kpeter@80
   225
kpeter@80
   226
    check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,
kpeter@80
   227
          "Something is wrong with CombineMap");
kpeter@80
   228
  }
kpeter@80
   229
kpeter@80
   230
  // FunctorToMap, MapToFunctor
kpeter@80
   231
  {
kpeter@80
   232
    checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >();
kpeter@80
   233
    checkConcept<ReadMap<A,B>, FunctorToMap<F> >();
kpeter@80
   234
    FunctorToMap<F> map1;
alpar@554
   235
    FunctorToMap<F> map2 = FunctorToMap<F>(F());
alpar@1257
   236
    ::lemon::ignore_unused_variable_warning(map2);
alpar@1157
   237
kpeter@80
   238
    B b = functorToMap(F())[A()];
alpar@1257
   239
    ::lemon::ignore_unused_variable_warning(b);
kpeter@80
   240
kpeter@80
   241
    checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();
alpar@1157
   242
    MapToFunctor<ReadMap<A,B> > map =
alpar@1157
   243
      MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());
alpar@1257
   244
    ::lemon::ignore_unused_variable_warning(map);
kpeter@80
   245
alpar@210
   246
    check(functorToMap(&func)[A()] == 3,
alpar@210
   247
          "Something is wrong with FunctorToMap");
alpar@210
   248
    check(mapToFunctor(constMap<A,int>(2))(A()) == 2,
alpar@210
   249
          "Something is wrong with MapToFunctor");
alpar@210
   250
    check(mapToFunctor(functorToMap(&func))(A()) == 3 &&
alpar@210
   251
          mapToFunctor(functorToMap(&func))[A()] == 3,
kpeter@80
   252
          "Something is wrong with FunctorToMap or MapToFunctor");
kpeter@80
   253
    check(functorToMap(mapToFunctor(constMap<A,int>(2)))[A()] == 2,
kpeter@80
   254
          "Something is wrong with FunctorToMap or MapToFunctor");
kpeter@80
   255
  }
kpeter@80
   256
kpeter@80
   257
  // ConvertMap
kpeter@80
   258
  {
alpar@210
   259
    checkConcept<ReadMap<double,double>,
alpar@210
   260
      ConvertMap<ReadMap<double, int>, double> >();
kpeter@80
   261
    ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true));
alpar@1257
   262
    ::lemon::ignore_unused_variable_warning(map1);
kpeter@80
   263
    ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false));
alpar@1257
   264
    ::lemon::ignore_unused_variable_warning(map2);
alpar@1157
   265
kpeter@80
   266
  }
kpeter@80
   267
kpeter@80
   268
  // ForkMap
kpeter@80
   269
  {
kpeter@80
   270
    checkConcept<DoubleWriteMap, ForkMap<DoubleWriteMap, DoubleWriteMap> >();
kpeter@82
   271
kpeter@80
   272
    typedef RangeMap<double> RM;
kpeter@80
   273
    typedef SparseMap<int, double> SM;
kpeter@80
   274
    RM m1(10, -1);
kpeter@80
   275
    SM m2(-1);
kpeter@80
   276
    checkConcept<ReadWriteMap<int, double>, ForkMap<RM, SM> >();
kpeter@80
   277
    checkConcept<ReadWriteMap<int, double>, ForkMap<SM, RM> >();
kpeter@80
   278
    ForkMap<RM, SM> map1(m1,m2);
kpeter@80
   279
    ForkMap<SM, RM> map2 = forkMap(m2,m1);
kpeter@80
   280
    map2.set(5, 10);
alpar@210
   281
    check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 &&
alpar@210
   282
          m2[5] == 10 && map2[1] == -1 && map2[5] == 10,
kpeter@80
   283
          "Something is wrong with ForkMap");
kpeter@80
   284
  }
kpeter@82
   285
kpeter@80
   286
  // Arithmetic maps:
kpeter@80
   287
  // - AddMap, SubMap, MulMap, DivMap
kpeter@80
   288
  // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap
kpeter@80
   289
  // - NegMap, NegWriteMap, AbsMap
kpeter@80
   290
  {
kpeter@80
   291
    checkConcept<DoubleMap, AddMap<DoubleMap,DoubleMap> >();
kpeter@80
   292
    checkConcept<DoubleMap, SubMap<DoubleMap,DoubleMap> >();
kpeter@80
   293
    checkConcept<DoubleMap, MulMap<DoubleMap,DoubleMap> >();
kpeter@80
   294
    checkConcept<DoubleMap, DivMap<DoubleMap,DoubleMap> >();
kpeter@82
   295
kpeter@80
   296
    ConstMap<int, double> c1(1.0), c2(3.14);
kpeter@80
   297
    IdentityMap<int> im;
kpeter@80
   298
    ConvertMap<IdentityMap<int>, double> id(im);
alpar@210
   299
    check(addMap(c1,id)[0] == 1.0  && addMap(c1,id)[10] == 11.0,
alpar@210
   300
          "Something is wrong with AddMap");
alpar@210
   301
    check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0,
alpar@210
   302
          "Something is wrong with SubMap");
alpar@210
   303
    check(mulMap(id,c2)[0] == 0    && mulMap(id,c2)[2]  == 6.28,
alpar@210
   304
          "Something is wrong with MulMap");
alpar@210
   305
    check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2]  == 1.57,
alpar@210
   306
          "Something is wrong with DivMap");
kpeter@82
   307
kpeter@80
   308
    checkConcept<DoubleMap, ShiftMap<DoubleMap> >();
kpeter@80
   309
    checkConcept<DoubleWriteMap, ShiftWriteMap<DoubleWriteMap> >();
kpeter@80
   310
    checkConcept<DoubleMap, ScaleMap<DoubleMap> >();
kpeter@80
   311
    checkConcept<DoubleWriteMap, ScaleWriteMap<DoubleWriteMap> >();
kpeter@80
   312
    checkConcept<DoubleMap, NegMap<DoubleMap> >();
kpeter@80
   313
    checkConcept<DoubleWriteMap, NegWriteMap<DoubleWriteMap> >();
kpeter@80
   314
    checkConcept<DoubleMap, AbsMap<DoubleMap> >();
alpar@25
   315
kpeter@80
   316
    check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0,
kpeter@80
   317
          "Something is wrong with ShiftMap");
alpar@210
   318
    check(shiftWriteMap(id, 2.0)[1] == 3.0 &&
alpar@210
   319
          shiftWriteMap(id, 2.0)[10] == 12.0,
kpeter@80
   320
          "Something is wrong with ShiftWriteMap");
kpeter@80
   321
    check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0,
kpeter@80
   322
          "Something is wrong with ScaleMap");
alpar@210
   323
    check(scaleWriteMap(id, 2.0)[1] == 2.0 &&
alpar@210
   324
          scaleWriteMap(id, 2.0)[10] == 20.0,
kpeter@80
   325
          "Something is wrong with ScaleWriteMap");
kpeter@80
   326
    check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0,
kpeter@80
   327
          "Something is wrong with NegMap");
kpeter@80
   328
    check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0,
kpeter@80
   329
          "Something is wrong with NegWriteMap");
kpeter@80
   330
    check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0,
kpeter@80
   331
          "Something is wrong with AbsMap");
kpeter@80
   332
  }
kpeter@82
   333
kpeter@82
   334
  // Logical maps:
kpeter@82
   335
  // - TrueMap, FalseMap
kpeter@82
   336
  // - AndMap, OrMap
kpeter@82
   337
  // - NotMap, NotWriteMap
kpeter@82
   338
  // - EqualMap, LessMap
kpeter@80
   339
  {
kpeter@82
   340
    checkConcept<BoolMap, TrueMap<A> >();
kpeter@82
   341
    checkConcept<BoolMap, FalseMap<A> >();
kpeter@82
   342
    checkConcept<BoolMap, AndMap<BoolMap,BoolMap> >();
kpeter@82
   343
    checkConcept<BoolMap, OrMap<BoolMap,BoolMap> >();
kpeter@80
   344
    checkConcept<BoolMap, NotMap<BoolMap> >();
kpeter@80
   345
    checkConcept<BoolWriteMap, NotWriteMap<BoolWriteMap> >();
kpeter@82
   346
    checkConcept<BoolMap, EqualMap<DoubleMap,DoubleMap> >();
kpeter@82
   347
    checkConcept<BoolMap, LessMap<DoubleMap,DoubleMap> >();
kpeter@82
   348
kpeter@82
   349
    TrueMap<int> tm;
kpeter@82
   350
    FalseMap<int> fm;
kpeter@80
   351
    RangeMap<bool> rm(2);
kpeter@80
   352
    rm[0] = true; rm[1] = false;
alpar@210
   353
    check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] &&
alpar@210
   354
          !andMap(fm,rm)[0] && !andMap(fm,rm)[1],
kpeter@82
   355
          "Something is wrong with AndMap");
alpar@210
   356
    check(orMap(tm,rm)[0] && orMap(tm,rm)[1] &&
alpar@210
   357
          orMap(fm,rm)[0] && !orMap(fm,rm)[1],
kpeter@82
   358
          "Something is wrong with OrMap");
alpar@210
   359
    check(!notMap(rm)[0] && notMap(rm)[1],
alpar@210
   360
          "Something is wrong with NotMap");
alpar@210
   361
    check(!notWriteMap(rm)[0] && notWriteMap(rm)[1],
alpar@210
   362
          "Something is wrong with NotWriteMap");
kpeter@82
   363
kpeter@82
   364
    ConstMap<int, double> cm(2.0);
kpeter@82
   365
    IdentityMap<int> im;
kpeter@82
   366
    ConvertMap<IdentityMap<int>, double> id(im);
kpeter@82
   367
    check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3],
kpeter@82
   368
          "Something is wrong with LessMap");
kpeter@82
   369
    check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3],
kpeter@82
   370
          "Something is wrong with EqualMap");
kpeter@80
   371
  }
alpar@209
   372
kpeter@167
   373
  // LoggerBoolMap
kpeter@159
   374
  {
kpeter@159
   375
    typedef std::vector<int> vec;
kpeter@767
   376
    checkConcept<WriteMap<int, bool>, LoggerBoolMap<vec::iterator> >();
kpeter@767
   377
    checkConcept<WriteMap<int, bool>,
kpeter@767
   378
                 LoggerBoolMap<std::back_insert_iterator<vec> > >();
kpeter@767
   379
kpeter@159
   380
    vec v1;
kpeter@159
   381
    vec v2(10);
alpar@210
   382
    LoggerBoolMap<std::back_insert_iterator<vec> >
alpar@210
   383
      map1(std::back_inserter(v1));
kpeter@167
   384
    LoggerBoolMap<vec::iterator> map2(v2.begin());
kpeter@159
   385
    map1.set(10, false);
kpeter@159
   386
    map1.set(20, true);   map2.set(20, true);
kpeter@159
   387
    map1.set(30, false);  map2.set(40, false);
kpeter@159
   388
    map1.set(50, true);   map2.set(50, true);
kpeter@159
   389
    map1.set(60, true);   map2.set(60, true);
kpeter@159
   390
    check(v1.size() == 3 && v2.size() == 10 &&
alpar@210
   391
          v1[0]==20 && v1[1]==50 && v1[2]==60 &&
alpar@210
   392
          v2[0]==20 && v2[1]==50 && v2[2]==60,
kpeter@167
   393
          "Something is wrong with LoggerBoolMap");
alpar@209
   394
kpeter@159
   395
    int i = 0;
kpeter@167
   396
    for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();
kpeter@159
   397
          it != map2.end(); ++it )
kpeter@167
   398
      check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
alpar@956
   399
kpeter@770
   400
    typedef ListDigraph Graph;
kpeter@770
   401
    DIGRAPH_TYPEDEFS(Graph);
kpeter@770
   402
    Graph gr;
kpeter@770
   403
kpeter@770
   404
    Node n0 = gr.addNode();
kpeter@770
   405
    Node n1 = gr.addNode();
kpeter@770
   406
    Node n2 = gr.addNode();
kpeter@770
   407
    Node n3 = gr.addNode();
alpar@956
   408
kpeter@770
   409
    gr.addArc(n3, n0);
kpeter@770
   410
    gr.addArc(n3, n2);
kpeter@770
   411
    gr.addArc(n0, n2);
kpeter@770
   412
    gr.addArc(n2, n1);
kpeter@770
   413
    gr.addArc(n0, n1);
alpar@956
   414
kpeter@770
   415
    {
kpeter@770
   416
      std::vector<Node> v;
kpeter@770
   417
      dfs(gr).processedMap(loggerBoolMap(std::back_inserter(v))).run();
kpeter@770
   418
kpeter@770
   419
      check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
kpeter@770
   420
            "Something is wrong with LoggerBoolMap");
kpeter@770
   421
    }
kpeter@770
   422
    {
kpeter@770
   423
      std::vector<Node> v(countNodes(gr));
kpeter@770
   424
      dfs(gr).processedMap(loggerBoolMap(v.begin())).run();
alpar@956
   425
kpeter@770
   426
      check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
kpeter@770
   427
            "Something is wrong with LoggerBoolMap");
kpeter@770
   428
    }
kpeter@159
   429
  }
alpar@956
   430
kpeter@767
   431
  // IdMap, RangeIdMap
kpeter@767
   432
  {
kpeter@767
   433
    typedef ListDigraph Graph;
kpeter@767
   434
    DIGRAPH_TYPEDEFS(Graph);
kpeter@767
   435
kpeter@767
   436
    checkConcept<ReadMap<Node, int>, IdMap<Graph, Node> >();
kpeter@767
   437
    checkConcept<ReadMap<Arc, int>, IdMap<Graph, Arc> >();
kpeter@767
   438
    checkConcept<ReadMap<Node, int>, RangeIdMap<Graph, Node> >();
kpeter@767
   439
    checkConcept<ReadMap<Arc, int>, RangeIdMap<Graph, Arc> >();
alpar@956
   440
kpeter@767
   441
    Graph gr;
kpeter@767
   442
    IdMap<Graph, Node> nmap(gr);
kpeter@767
   443
    IdMap<Graph, Arc> amap(gr);
kpeter@767
   444
    RangeIdMap<Graph, Node> nrmap(gr);
kpeter@767
   445
    RangeIdMap<Graph, Arc> armap(gr);
alpar@956
   446
kpeter@767
   447
    Node n0 = gr.addNode();
kpeter@767
   448
    Node n1 = gr.addNode();
kpeter@767
   449
    Node n2 = gr.addNode();
alpar@956
   450
kpeter@767
   451
    Arc a0 = gr.addArc(n0, n1);
kpeter@767
   452
    Arc a1 = gr.addArc(n0, n2);
kpeter@767
   453
    Arc a2 = gr.addArc(n2, n1);
kpeter@767
   454
    Arc a3 = gr.addArc(n2, n0);
alpar@956
   455
kpeter@767
   456
    check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap");
kpeter@767
   457
    check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap");
kpeter@767
   458
    check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap");
kpeter@767
   459
kpeter@767
   460
    check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap");
kpeter@767
   461
    check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap");
kpeter@767
   462
    check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap");
kpeter@767
   463
    check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap");
kpeter@767
   464
kpeter@767
   465
    check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap");
kpeter@767
   466
    check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap");
alpar@956
   467
kpeter@767
   468
    check(nrmap.size() == 3 && armap.size() == 4,
kpeter@767
   469
          "Wrong RangeIdMap::size()");
kpeter@767
   470
kpeter@767
   471
    check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap");
kpeter@767
   472
    check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap");
kpeter@767
   473
    check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap");
alpar@956
   474
kpeter@767
   475
    check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap");
kpeter@767
   476
    check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
kpeter@767
   477
    check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap");
kpeter@767
   478
    check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap");
kpeter@767
   479
kpeter@767
   480
    check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap");
kpeter@767
   481
    check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap");
alpar@956
   482
kpeter@767
   483
    gr.erase(n1);
alpar@956
   484
kpeter@767
   485
    if (nrmap[n0] == 1) nrmap.swap(n0, n2);
kpeter@767
   486
    nrmap.swap(n2, n0);
kpeter@767
   487
    if (armap[a1] == 1) armap.swap(a1, a3);
kpeter@767
   488
    armap.swap(a3, a1);
alpar@956
   489
kpeter@767
   490
    check(nrmap.size() == 2 && armap.size() == 2,
kpeter@767
   491
          "Wrong RangeIdMap::size()");
kpeter@767
   492
kpeter@767
   493
    check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap");
kpeter@767
   494
    check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap");
alpar@956
   495
kpeter@767
   496
    check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
kpeter@767
   497
    check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap");
kpeter@767
   498
kpeter@767
   499
    check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap");
kpeter@767
   500
    check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap");
kpeter@767
   501
  }
alpar@956
   502
kpeter@770
   503
  // SourceMap, TargetMap, ForwardMap, BackwardMap, InDegMap, OutDegMap
kpeter@770
   504
  {
kpeter@770
   505
    typedef ListGraph Graph;
kpeter@770
   506
    GRAPH_TYPEDEFS(Graph);
alpar@956
   507
kpeter@770
   508
    checkConcept<ReadMap<Arc, Node>, SourceMap<Graph> >();
kpeter@770
   509
    checkConcept<ReadMap<Arc, Node>, TargetMap<Graph> >();
kpeter@770
   510
    checkConcept<ReadMap<Edge, Arc>, ForwardMap<Graph> >();
kpeter@770
   511
    checkConcept<ReadMap<Edge, Arc>, BackwardMap<Graph> >();
kpeter@770
   512
    checkConcept<ReadMap<Node, int>, InDegMap<Graph> >();
kpeter@770
   513
    checkConcept<ReadMap<Node, int>, OutDegMap<Graph> >();
kpeter@770
   514
kpeter@770
   515
    Graph gr;
kpeter@770
   516
    Node n0 = gr.addNode();
kpeter@770
   517
    Node n1 = gr.addNode();
kpeter@770
   518
    Node n2 = gr.addNode();
alpar@956
   519
kpeter@770
   520
    gr.addEdge(n0,n1);
kpeter@770
   521
    gr.addEdge(n1,n2);
kpeter@770
   522
    gr.addEdge(n0,n2);
kpeter@770
   523
    gr.addEdge(n2,n1);
kpeter@770
   524
    gr.addEdge(n1,n2);
kpeter@770
   525
    gr.addEdge(n0,n1);
alpar@956
   526
kpeter@770
   527
    for (EdgeIt e(gr); e != INVALID; ++e) {
kpeter@770
   528
      check(forwardMap(gr)[e] == gr.direct(e, true), "Wrong ForwardMap");
kpeter@770
   529
      check(backwardMap(gr)[e] == gr.direct(e, false), "Wrong BackwardMap");
kpeter@770
   530
    }
alpar@956
   531
kpeter@836
   532
    check(mapCompare(gr,
kpeter@836
   533
          sourceMap(orienter(gr, constMap<Edge, bool>(true))),
kpeter@836
   534
          targetMap(orienter(gr, constMap<Edge, bool>(false)))),
kpeter@836
   535
          "Wrong SourceMap or TargetMap");
kpeter@770
   536
kpeter@770
   537
    typedef Orienter<Graph, const ConstMap<Edge, bool> > Digraph;
alpar@1235
   538
    ConstMap<Edge, bool> true_edge_map(true);
alpar@1235
   539
    Digraph dgr(gr, true_edge_map);
kpeter@770
   540
    OutDegMap<Digraph> odm(dgr);
kpeter@770
   541
    InDegMap<Digraph> idm(dgr);
alpar@956
   542
kpeter@770
   543
    check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 1, "Wrong OutDegMap");
kpeter@770
   544
    check(idm[n0] == 0 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
alpar@956
   545
kpeter@770
   546
    gr.addEdge(n2, n0);
kpeter@770
   547
kpeter@770
   548
    check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 2, "Wrong OutDegMap");
kpeter@770
   549
    check(idm[n0] == 1 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
kpeter@770
   550
  }
alpar@956
   551
kpeter@731
   552
  // CrossRefMap
kpeter@731
   553
  {
kpeter@731
   554
    typedef ListDigraph Graph;
kpeter@731
   555
    DIGRAPH_TYPEDEFS(Graph);
kpeter@731
   556
kpeter@731
   557
    checkConcept<ReadWriteMap<Node, int>,
kpeter@731
   558
                 CrossRefMap<Graph, Node, int> >();
kpeter@767
   559
    checkConcept<ReadWriteMap<Node, bool>,
kpeter@767
   560
                 CrossRefMap<Graph, Node, bool> >();
kpeter@767
   561
    checkConcept<ReadWriteMap<Node, double>,
kpeter@767
   562
                 CrossRefMap<Graph, Node, double> >();
alpar@956
   563
kpeter@731
   564
    Graph gr;
kpeter@731
   565
    typedef CrossRefMap<Graph, Node, char> CRMap;
kpeter@731
   566
    CRMap map(gr);
alpar@956
   567
kpeter@731
   568
    Node n0 = gr.addNode();
kpeter@731
   569
    Node n1 = gr.addNode();
kpeter@731
   570
    Node n2 = gr.addNode();
alpar@956
   571
kpeter@731
   572
    map.set(n0, 'A');
kpeter@731
   573
    map.set(n1, 'B');
kpeter@731
   574
    map.set(n2, 'C');
alpar@956
   575
kpeter@767
   576
    check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0,
kpeter@767
   577
          "Wrong CrossRefMap");
kpeter@767
   578
    check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1,
kpeter@767
   579
          "Wrong CrossRefMap");
kpeter@767
   580
    check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2,
kpeter@767
   581
          "Wrong CrossRefMap");
kpeter@767
   582
    check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
kpeter@767
   583
          "Wrong CrossRefMap::count()");
alpar@956
   584
kpeter@771
   585
    CRMap::ValueIt it = map.beginValue();
kpeter@767
   586
    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
kpeter@767
   587
          it == map.endValue(), "Wrong value iterator");
alpar@956
   588
kpeter@731
   589
    map.set(n2, 'A');
kpeter@767
   590
kpeter@767
   591
    check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A',
kpeter@767
   592
          "Wrong CrossRefMap");
kpeter@767
   593
    check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap");
kpeter@767
   594
    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
kpeter@767
   595
    check(map('C') == INVALID && map.inverse()['C'] == INVALID,
kpeter@767
   596
          "Wrong CrossRefMap");
kpeter@767
   597
    check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0,
kpeter@767
   598
          "Wrong CrossRefMap::count()");
kpeter@767
   599
kpeter@767
   600
    it = map.beginValue();
kpeter@767
   601
    check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' &&
kpeter@767
   602
          it == map.endValue(), "Wrong value iterator");
kpeter@767
   603
kpeter@731
   604
    map.set(n0, 'C');
kpeter@731
   605
kpeter@731
   606
    check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
kpeter@731
   607
          "Wrong CrossRefMap");
kpeter@731
   608
    check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
kpeter@731
   609
    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
kpeter@731
   610
    check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
kpeter@767
   611
    check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
kpeter@767
   612
          "Wrong CrossRefMap::count()");
kpeter@731
   613
kpeter@767
   614
    it = map.beginValue();
kpeter@731
   615
    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
kpeter@731
   616
          it == map.endValue(), "Wrong value iterator");
alpar@554
   617
  }
alpar@554
   618
kpeter@731
   619
  // CrossRefMap
kpeter@731
   620
  {
alpar@742
   621
    typedef SmartDigraph Graph;
kpeter@731
   622
    DIGRAPH_TYPEDEFS(Graph);
kpeter@731
   623
kpeter@731
   624
    checkConcept<ReadWriteMap<Node, int>,
kpeter@731
   625
                 CrossRefMap<Graph, Node, int> >();
alpar@956
   626
kpeter@731
   627
    Graph gr;
kpeter@731
   628
    typedef CrossRefMap<Graph, Node, char> CRMap;
kpeter@731
   629
    typedef CRMap::ValueIterator ValueIt;
kpeter@731
   630
    CRMap map(gr);
alpar@956
   631
kpeter@731
   632
    Node n0 = gr.addNode();
kpeter@731
   633
    Node n1 = gr.addNode();
kpeter@731
   634
    Node n2 = gr.addNode();
alpar@956
   635
kpeter@731
   636
    map.set(n0, 'A');
kpeter@731
   637
    map.set(n1, 'B');
kpeter@731
   638
    map.set(n2, 'C');
kpeter@731
   639
    map.set(n2, 'A');
kpeter@731
   640
    map.set(n0, 'C');
kpeter@731
   641
kpeter@731
   642
    check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
kpeter@731
   643
          "Wrong CrossRefMap");
kpeter@731
   644
    check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
kpeter@731
   645
    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
kpeter@731
   646
    check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
kpeter@731
   647
kpeter@731
   648
    ValueIt it = map.beginValue();
kpeter@731
   649
    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
kpeter@731
   650
          it == map.endValue(), "Wrong value iterator");
kpeter@731
   651
  }
alpar@25
   652
deba@740
   653
  // Iterable bool map
deba@740
   654
  {
deba@740
   655
    typedef SmartGraph Graph;
deba@740
   656
    typedef SmartGraph::Node Item;
deba@740
   657
deba@740
   658
    typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm;
kpeter@741
   659
    checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>();
deba@740
   660
deba@740
   661
    const int num = 10;
deba@740
   662
    Graph g;
deba@1057
   663
    Ibm map0(g, true);
deba@740
   664
    std::vector<Item> items;
deba@740
   665
    for (int i = 0; i < num; ++i) {
deba@740
   666
      items.push_back(g.addNode());
deba@740
   667
    }
deba@740
   668
deba@740
   669
    Ibm map1(g, true);
deba@740
   670
    int n = 0;
deba@740
   671
    for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
deba@740
   672
      check(map1[static_cast<Item>(it)], "Wrong TrueIt");
deba@740
   673
      ++n;
deba@740
   674
    }
deba@740
   675
    check(n == num, "Wrong number");
deba@740
   676
deba@740
   677
    n = 0;
deba@740
   678
    for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
deba@740
   679
        check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
deba@740
   680
        ++n;
deba@740
   681
    }
deba@740
   682
    check(n == num, "Wrong number");
deba@740
   683
    check(Ibm::FalseIt(map1) == INVALID, "Wrong FalseIt");
deba@740
   684
    check(Ibm::ItemIt(map1, false) == INVALID, "Wrong ItemIt for false");
deba@740
   685
deba@740
   686
    map1[items[5]] = true;
deba@740
   687
deba@740
   688
    n = 0;
deba@740
   689
    for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
deba@740
   690
        check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
deba@740
   691
        ++n;
deba@740
   692
    }
deba@740
   693
    check(n == num, "Wrong number");
deba@740
   694
deba@740
   695
    map1[items[num / 2]] = false;
deba@740
   696
    check(map1[items[num / 2]] == false, "Wrong map value");
deba@740
   697
deba@740
   698
    n = 0;
deba@740
   699
    for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
deba@740
   700
        check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
deba@740
   701
        ++n;
deba@740
   702
    }
deba@740
   703
    check(n == num - 1, "Wrong number");
deba@740
   704
deba@740
   705
    n = 0;
deba@740
   706
    for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
deba@740
   707
        check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
deba@740
   708
        ++n;
deba@740
   709
    }
deba@740
   710
    check(n == 1, "Wrong number");
deba@740
   711
deba@740
   712
    map1[items[0]] = false;
deba@740
   713
    check(map1[items[0]] == false, "Wrong map value");
deba@740
   714
deba@740
   715
    map1[items[num - 1]] = false;
deba@740
   716
    check(map1[items[num - 1]] == false, "Wrong map value");
deba@740
   717
deba@740
   718
    n = 0;
deba@740
   719
    for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
deba@740
   720
        check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
deba@740
   721
        ++n;
deba@740
   722
    }
deba@740
   723
    check(n == num - 3, "Wrong number");
deba@740
   724
    check(map1.trueNum() == num - 3, "Wrong number");
deba@740
   725
deba@740
   726
    n = 0;
deba@740
   727
    for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
deba@740
   728
        check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
deba@740
   729
        ++n;
deba@740
   730
    }
deba@740
   731
    check(n == 3, "Wrong number");
deba@740
   732
    check(map1.falseNum() == 3, "Wrong number");
deba@740
   733
  }
deba@740
   734
deba@740
   735
  // Iterable int map
deba@740
   736
  {
deba@740
   737
    typedef SmartGraph Graph;
deba@740
   738
    typedef SmartGraph::Node Item;
deba@740
   739
    typedef IterableIntMap<SmartGraph, SmartGraph::Node> Iim;
deba@740
   740
kpeter@741
   741
    checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>();
deba@740
   742
deba@740
   743
    const int num = 10;
deba@740
   744
    Graph g;
deba@1057
   745
    Iim map0(g, 0);
deba@740
   746
    std::vector<Item> items;
deba@740
   747
    for (int i = 0; i < num; ++i) {
deba@740
   748
      items.push_back(g.addNode());
deba@740
   749
    }
deba@740
   750
deba@740
   751
    Iim map1(g);
deba@740
   752
    check(map1.size() == 0, "Wrong size");
deba@740
   753
deba@740
   754
    for (int i = 0; i < num; ++i) {
deba@740
   755
      map1[items[i]] = i;
deba@740
   756
    }
deba@740
   757
    check(map1.size() == num, "Wrong size");
deba@740
   758
deba@740
   759
    for (int i = 0; i < num; ++i) {
deba@740
   760
      Iim::ItemIt it(map1, i);
deba@740
   761
      check(static_cast<Item>(it) == items[i], "Wrong value");
deba@740
   762
      ++it;
deba@740
   763
      check(static_cast<Item>(it) == INVALID, "Wrong value");
deba@740
   764
    }
deba@740
   765
deba@740
   766
    for (int i = 0; i < num; ++i) {
deba@740
   767
      map1[items[i]] = i % 2;
deba@740
   768
    }
deba@740
   769
    check(map1.size() == 2, "Wrong size");
deba@740
   770
deba@740
   771
    int n = 0;
deba@740
   772
    for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) {
kpeter@741
   773
      check(map1[static_cast<Item>(it)] == 0, "Wrong value");
deba@740
   774
      ++n;
deba@740
   775
    }
deba@740
   776
    check(n == (num + 1) / 2, "Wrong number");
deba@740
   777
deba@740
   778
    for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) {
kpeter@741
   779
      check(map1[static_cast<Item>(it)] == 1, "Wrong value");
deba@740
   780
      ++n;
deba@740
   781
    }
deba@740
   782
    check(n == num, "Wrong number");
deba@740
   783
deba@740
   784
  }
deba@740
   785
deba@740
   786
  // Iterable value map
deba@740
   787
  {
deba@740
   788
    typedef SmartGraph Graph;
deba@740
   789
    typedef SmartGraph::Node Item;
deba@740
   790
    typedef IterableValueMap<SmartGraph, SmartGraph::Node, double> Ivm;
deba@740
   791
deba@740
   792
    checkConcept<ReadWriteMap<Item, double>, Ivm>();
deba@740
   793
deba@740
   794
    const int num = 10;
deba@740
   795
    Graph g;
deba@1057
   796
    Ivm map0(g, 0.0);
deba@740
   797
    std::vector<Item> items;
deba@740
   798
    for (int i = 0; i < num; ++i) {
deba@740
   799
      items.push_back(g.addNode());
deba@740
   800
    }
deba@740
   801
deba@740
   802
    Ivm map1(g, 0.0);
deba@740
   803
    check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size");
deba@740
   804
    check(*map1.beginValue() == 0.0, "Wrong value");
deba@740
   805
deba@740
   806
    for (int i = 0; i < num; ++i) {
deba@740
   807
      map1.set(items[i], static_cast<double>(i));
deba@740
   808
    }
deba@740
   809
    check(distance(map1.beginValue(), map1.endValue()) == num, "Wrong size");
deba@740
   810
deba@740
   811
    for (int i = 0; i < num; ++i) {
deba@740
   812
      Ivm::ItemIt it(map1, static_cast<double>(i));
deba@740
   813
      check(static_cast<Item>(it) == items[i], "Wrong value");
deba@740
   814
      ++it;
deba@740
   815
      check(static_cast<Item>(it) == INVALID, "Wrong value");
deba@740
   816
    }
deba@740
   817
kpeter@771
   818
    for (Ivm::ValueIt vit = map1.beginValue();
deba@740
   819
         vit != map1.endValue(); ++vit) {
deba@740
   820
      check(map1[static_cast<Item>(Ivm::ItemIt(map1, *vit))] == *vit,
kpeter@771
   821
            "Wrong ValueIt");
deba@740
   822
    }
deba@740
   823
deba@740
   824
    for (int i = 0; i < num; ++i) {
deba@740
   825
      map1.set(items[i], static_cast<double>(i % 2));
deba@740
   826
    }
deba@740
   827
    check(distance(map1.beginValue(), map1.endValue()) == 2, "Wrong size");
deba@740
   828
deba@740
   829
    int n = 0;
deba@740
   830
    for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) {
kpeter@741
   831
      check(map1[static_cast<Item>(it)] == 0.0, "Wrong value");
deba@740
   832
      ++n;
deba@740
   833
    }
deba@740
   834
    check(n == (num + 1) / 2, "Wrong number");
deba@740
   835
deba@740
   836
    for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) {
kpeter@741
   837
      check(map1[static_cast<Item>(it)] == 1.0, "Wrong value");
deba@740
   838
      ++n;
deba@740
   839
    }
deba@740
   840
    check(n == num, "Wrong number");
deba@740
   841
deba@740
   842
  }
alpar@956
   843
kpeter@836
   844
  // Graph map utilities:
kpeter@836
   845
  // mapMin(), mapMax(), mapMinValue(), mapMaxValue()
kpeter@836
   846
  // mapFind(), mapFindIf(), mapCount(), mapCountIf()
kpeter@836
   847
  // mapCopy(), mapCompare(), mapFill()
kpeter@836
   848
  {
kpeter@836
   849
    DIGRAPH_TYPEDEFS(SmartDigraph);
kpeter@836
   850
kpeter@836
   851
    SmartDigraph g;
kpeter@836
   852
    Node n1 = g.addNode();
kpeter@836
   853
    Node n2 = g.addNode();
kpeter@836
   854
    Node n3 = g.addNode();
alpar@956
   855
kpeter@836
   856
    SmartDigraph::NodeMap<int> map1(g);
kpeter@836
   857
    SmartDigraph::ArcMap<char> map2(g);
kpeter@836
   858
    ConstMap<Node, A> cmap1 = A();
kpeter@836
   859
    ConstMap<Arc, C> cmap2 = C(0);
alpar@956
   860
kpeter@836
   861
    map1[n1] = 10;
kpeter@836
   862
    map1[n2] = 5;
kpeter@836
   863
    map1[n3] = 12;
alpar@956
   864
kpeter@836
   865
    // mapMin(), mapMax(), mapMinValue(), mapMaxValue()
kpeter@836
   866
    check(mapMin(g, map1) == n2, "Wrong mapMin()");
kpeter@836
   867
    check(mapMax(g, map1) == n3, "Wrong mapMax()");
kpeter@836
   868
    check(mapMin(g, map1, std::greater<int>()) == n3, "Wrong mapMin()");
kpeter@836
   869
    check(mapMax(g, map1, std::greater<int>()) == n2, "Wrong mapMax()");
kpeter@836
   870
    check(mapMinValue(g, map1) == 5, "Wrong mapMinValue()");
kpeter@836
   871
    check(mapMaxValue(g, map1) == 12, "Wrong mapMaxValue()");
kpeter@836
   872
kpeter@836
   873
    check(mapMin(g, map2) == INVALID, "Wrong mapMin()");
kpeter@836
   874
    check(mapMax(g, map2) == INVALID, "Wrong mapMax()");
kpeter@836
   875
kpeter@836
   876
    check(mapMin(g, cmap1) != INVALID, "Wrong mapMin()");
kpeter@836
   877
    check(mapMax(g, cmap2) == INVALID, "Wrong mapMax()");
kpeter@836
   878
kpeter@836
   879
    Arc a1 = g.addArc(n1, n2);
kpeter@836
   880
    Arc a2 = g.addArc(n1, n3);
kpeter@836
   881
    Arc a3 = g.addArc(n2, n3);
kpeter@836
   882
    Arc a4 = g.addArc(n3, n1);
alpar@956
   883
kpeter@836
   884
    map2[a1] = 'b';
kpeter@836
   885
    map2[a2] = 'a';
kpeter@836
   886
    map2[a3] = 'b';
kpeter@836
   887
    map2[a4] = 'c';
kpeter@836
   888
kpeter@836
   889
    // mapMin(), mapMax(), mapMinValue(), mapMaxValue()
kpeter@836
   890
    check(mapMin(g, map2) == a2, "Wrong mapMin()");
kpeter@836
   891
    check(mapMax(g, map2) == a4, "Wrong mapMax()");
kpeter@836
   892
    check(mapMin(g, map2, std::greater<int>()) == a4, "Wrong mapMin()");
kpeter@836
   893
    check(mapMax(g, map2, std::greater<int>()) == a2, "Wrong mapMax()");
kpeter@836
   894
    check(mapMinValue(g, map2, std::greater<int>()) == 'c',
kpeter@836
   895
          "Wrong mapMinValue()");
kpeter@836
   896
    check(mapMaxValue(g, map2, std::greater<int>()) == 'a',
kpeter@836
   897
          "Wrong mapMaxValue()");
kpeter@836
   898
kpeter@836
   899
    check(mapMin(g, cmap1) != INVALID, "Wrong mapMin()");
kpeter@836
   900
    check(mapMax(g, cmap2) != INVALID, "Wrong mapMax()");
kpeter@836
   901
    check(mapMaxValue(g, cmap2) == C(0), "Wrong mapMaxValue()");
kpeter@836
   902
kpeter@836
   903
    check(mapMin(g, composeMap(functorToMap(&createC), map2)) == a2,
kpeter@836
   904
          "Wrong mapMin()");
kpeter@836
   905
    check(mapMax(g, composeMap(functorToMap(&createC), map2)) == a4,
kpeter@836
   906
          "Wrong mapMax()");
kpeter@836
   907
    check(mapMinValue(g, composeMap(functorToMap(&createC), map2)) == C('a'),
kpeter@836
   908
          "Wrong mapMinValue()");
kpeter@836
   909
    check(mapMaxValue(g, composeMap(functorToMap(&createC), map2)) == C('c'),
kpeter@836
   910
          "Wrong mapMaxValue()");
kpeter@836
   911
kpeter@836
   912
    // mapFind(), mapFindIf()
kpeter@836
   913
    check(mapFind(g, map1, 5) == n2, "Wrong mapFind()");
kpeter@836
   914
    check(mapFind(g, map1, 6) == INVALID, "Wrong mapFind()");
kpeter@836
   915
    check(mapFind(g, map2, 'a') == a2, "Wrong mapFind()");
kpeter@836
   916
    check(mapFind(g, map2, 'e') == INVALID, "Wrong mapFind()");
kpeter@836
   917
    check(mapFind(g, cmap2, C(0)) == ArcIt(g), "Wrong mapFind()");
kpeter@836
   918
    check(mapFind(g, cmap2, C(1)) == INVALID, "Wrong mapFind()");
kpeter@836
   919
kpeter@836
   920
    check(mapFindIf(g, map1, Less<int>(7)) == n2,
kpeter@836
   921
          "Wrong mapFindIf()");
kpeter@836
   922
    check(mapFindIf(g, map1, Less<int>(5)) == INVALID,
kpeter@836
   923
          "Wrong mapFindIf()");
kpeter@836
   924
    check(mapFindIf(g, map2, Less<char>('d')) == ArcIt(g),
kpeter@836
   925
          "Wrong mapFindIf()");
kpeter@836
   926
    check(mapFindIf(g, map2, Less<char>('a')) == INVALID,
kpeter@836
   927
          "Wrong mapFindIf()");
kpeter@836
   928
kpeter@836
   929
    // mapCount(), mapCountIf()
kpeter@836
   930
    check(mapCount(g, map1, 5) == 1, "Wrong mapCount()");
kpeter@836
   931
    check(mapCount(g, map1, 6) == 0, "Wrong mapCount()");
kpeter@836
   932
    check(mapCount(g, map2, 'a') == 1, "Wrong mapCount()");
kpeter@836
   933
    check(mapCount(g, map2, 'b') == 2, "Wrong mapCount()");
kpeter@836
   934
    check(mapCount(g, map2, 'e') == 0, "Wrong mapCount()");
kpeter@836
   935
    check(mapCount(g, cmap2, C(0)) == 4, "Wrong mapCount()");
kpeter@836
   936
    check(mapCount(g, cmap2, C(1)) == 0, "Wrong mapCount()");
kpeter@836
   937
kpeter@836
   938
    check(mapCountIf(g, map1, Less<int>(11)) == 2,
kpeter@836
   939
          "Wrong mapCountIf()");
kpeter@836
   940
    check(mapCountIf(g, map1, Less<int>(13)) == 3,
kpeter@836
   941
          "Wrong mapCountIf()");
kpeter@836
   942
    check(mapCountIf(g, map1, Less<int>(5)) == 0,
kpeter@836
   943
          "Wrong mapCountIf()");
kpeter@836
   944
    check(mapCountIf(g, map2, Less<char>('d')) == 4,
kpeter@836
   945
          "Wrong mapCountIf()");
kpeter@836
   946
    check(mapCountIf(g, map2, Less<char>('c')) == 3,
kpeter@836
   947
          "Wrong mapCountIf()");
kpeter@836
   948
    check(mapCountIf(g, map2, Less<char>('a')) == 0,
kpeter@836
   949
          "Wrong mapCountIf()");
alpar@956
   950
kpeter@836
   951
    // MapIt, ConstMapIt
kpeter@836
   952
/*
kpeter@836
   953
These tests can be used after applying bugfix #330
kpeter@836
   954
    typedef SmartDigraph::NodeMap<int>::MapIt MapIt;
kpeter@836
   955
    typedef SmartDigraph::NodeMap<int>::ConstMapIt ConstMapIt;
kpeter@836
   956
    check(*std::min_element(MapIt(map1), MapIt(INVALID)) == 5,
kpeter@836
   957
          "Wrong NodeMap<>::MapIt");
kpeter@836
   958
    check(*std::max_element(ConstMapIt(map1), ConstMapIt(INVALID)) == 12,
kpeter@836
   959
          "Wrong NodeMap<>::MapIt");
alpar@956
   960
kpeter@836
   961
    int sum = 0;
kpeter@836
   962
    std::for_each(MapIt(map1), MapIt(INVALID), Sum<int>(sum));
kpeter@836
   963
    check(sum == 27, "Wrong NodeMap<>::MapIt");
kpeter@836
   964
    std::for_each(ConstMapIt(map1), ConstMapIt(INVALID), Sum<int>(sum));
kpeter@836
   965
    check(sum == 54, "Wrong NodeMap<>::ConstMapIt");
kpeter@836
   966
*/
kpeter@836
   967
kpeter@836
   968
    // mapCopy(), mapCompare(), mapFill()
kpeter@836
   969
    check(mapCompare(g, map1, map1), "Wrong mapCompare()");
kpeter@836
   970
    check(mapCompare(g, cmap2, cmap2), "Wrong mapCompare()");
kpeter@836
   971
    check(mapCompare(g, map1, shiftMap(map1, 0)), "Wrong mapCompare()");
kpeter@836
   972
    check(mapCompare(g, map2, scaleMap(map2, 1)), "Wrong mapCompare()");
kpeter@836
   973
    check(!mapCompare(g, map1, shiftMap(map1, 1)), "Wrong mapCompare()");
kpeter@836
   974
kpeter@836
   975
    SmartDigraph::NodeMap<int> map3(g, 0);
kpeter@836
   976
    SmartDigraph::ArcMap<char> map4(g, 'a');
alpar@956
   977
kpeter@836
   978
    check(!mapCompare(g, map1, map3), "Wrong mapCompare()");
alpar@956
   979
    check(!mapCompare(g, map2, map4), "Wrong mapCompare()");
alpar@956
   980
kpeter@836
   981
    mapCopy(g, map1, map3);
kpeter@836
   982
    mapCopy(g, map2, map4);
kpeter@836
   983
kpeter@836
   984
    check(mapCompare(g, map1, map3), "Wrong mapCompare() or mapCopy()");
alpar@956
   985
    check(mapCompare(g, map2, map4), "Wrong mapCompare() or mapCopy()");
alpar@956
   986
kpeter@836
   987
    Undirector<SmartDigraph> ug(g);
kpeter@836
   988
    Undirector<SmartDigraph>::EdgeMap<char> umap1(ug, 'x');
kpeter@836
   989
    Undirector<SmartDigraph>::ArcMap<double> umap2(ug, 3.14);
alpar@956
   990
kpeter@836
   991
    check(!mapCompare(g, map2, umap1), "Wrong mapCompare() or mapCopy()");
kpeter@836
   992
    check(!mapCompare(g, umap1, map2), "Wrong mapCompare() or mapCopy()");
kpeter@836
   993
    check(!mapCompare(ug, map2, umap1), "Wrong mapCompare() or mapCopy()");
kpeter@836
   994
    check(!mapCompare(ug, umap1, map2), "Wrong mapCompare() or mapCopy()");
alpar@956
   995
kpeter@836
   996
    mapCopy(g, map2, umap1);
kpeter@836
   997
kpeter@836
   998
    check(mapCompare(g, map2, umap1), "Wrong mapCompare() or mapCopy()");
kpeter@836
   999
    check(mapCompare(g, umap1, map2), "Wrong mapCompare() or mapCopy()");
kpeter@836
  1000
    check(mapCompare(ug, map2, umap1), "Wrong mapCompare() or mapCopy()");
kpeter@836
  1001
    check(mapCompare(ug, umap1, map2), "Wrong mapCompare() or mapCopy()");
alpar@956
  1002
kpeter@836
  1003
    mapCopy(g, map2, umap1);
kpeter@836
  1004
    mapCopy(g, umap1, map2);
kpeter@836
  1005
    mapCopy(ug, map2, umap1);
kpeter@836
  1006
    mapCopy(ug, umap1, map2);
alpar@956
  1007
kpeter@836
  1008
    check(!mapCompare(ug, umap1, umap2), "Wrong mapCompare() or mapCopy()");
kpeter@836
  1009
    mapCopy(ug, umap1, umap2);
kpeter@836
  1010
    check(mapCompare(ug, umap1, umap2), "Wrong mapCompare() or mapCopy()");
alpar@956
  1011
kpeter@836
  1012
    check(!mapCompare(g, map1, constMap<Node>(2)), "Wrong mapCompare()");
kpeter@836
  1013
    mapFill(g, map1, 2);
kpeter@836
  1014
    check(mapCompare(g, constMap<Node>(2), map1), "Wrong mapFill()");
kpeter@836
  1015
kpeter@836
  1016
    check(!mapCompare(g, map2, constMap<Arc>('z')), "Wrong mapCompare()");
kpeter@836
  1017
    mapCopy(g, constMap<Arc>('z'), map2);
kpeter@836
  1018
    check(mapCompare(g, constMap<Arc>('z'), map2), "Wrong mapCopy()");
kpeter@836
  1019
  }
alpar@956
  1020
alpar@25
  1021
  return 0;
alpar@25
  1022
}