test/maps_test.cc
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 23 Jul 2009 18:13:59 +0200
changeset 767 6e8c27ee9079
parent 731 7b1a6e963018
child 768 99124ea4f048
permissions -rw-r--r--
Improvements for graph maps (#302)

- Add a count() function to CrossRefMap.
- Add tests for IdMap and RangeIdMap.
- Extend tests for CrossRefMap.
- Improve the doc.
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@463
     5
 * Copyright (C) 2003-2009
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>
alpar@25
    26
alpar@25
    27
#include "test_tools.h"
alpar@25
    28
alpar@25
    29
using namespace lemon;
alpar@25
    30
using namespace lemon::concepts;
alpar@25
    31
alpar@25
    32
struct A {};
alpar@25
    33
inline bool operator<(A, A) { return true; }
alpar@25
    34
struct B {};
alpar@25
    35
kpeter@94
    36
class C {
kpeter@94
    37
  int x;
kpeter@94
    38
public:
kpeter@94
    39
  C(int _x) : x(_x) {}
kpeter@94
    40
};
kpeter@94
    41
alpar@25
    42
class F {
alpar@25
    43
public:
alpar@25
    44
  typedef A argument_type;
alpar@25
    45
  typedef B result_type;
alpar@25
    46
kpeter@80
    47
  B operator()(const A&) const { return B(); }
kpeter@80
    48
private:
kpeter@80
    49
  F& operator=(const F&);
alpar@25
    50
};
alpar@25
    51
kpeter@80
    52
int func(A) { return 3; }
alpar@25
    53
kpeter@80
    54
int binc(int a, B) { return a+1; }
alpar@25
    55
kpeter@80
    56
typedef ReadMap<A, double> DoubleMap;
kpeter@80
    57
typedef ReadWriteMap<A, double> DoubleWriteMap;
kpeter@80
    58
typedef ReferenceMap<A, double, double&, const double&> DoubleRefMap;
alpar@25
    59
kpeter@80
    60
typedef ReadMap<A, bool> BoolMap;
alpar@25
    61
typedef ReadWriteMap<A, bool> BoolWriteMap;
kpeter@80
    62
typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;
alpar@25
    63
alpar@25
    64
int main()
kpeter@80
    65
{
kpeter@80
    66
  // Map concepts
alpar@25
    67
  checkConcept<ReadMap<A,B>, ReadMap<A,B> >();
kpeter@94
    68
  checkConcept<ReadMap<A,C>, ReadMap<A,C> >();
alpar@25
    69
  checkConcept<WriteMap<A,B>, WriteMap<A,B> >();
kpeter@94
    70
  checkConcept<WriteMap<A,C>, WriteMap<A,C> >();
alpar@25
    71
  checkConcept<ReadWriteMap<A,B>, ReadWriteMap<A,B> >();
kpeter@94
    72
  checkConcept<ReadWriteMap<A,C>, ReadWriteMap<A,C> >();
alpar@25
    73
  checkConcept<ReferenceMap<A,B,B&,const B&>, ReferenceMap<A,B,B&,const B&> >();
kpeter@94
    74
  checkConcept<ReferenceMap<A,C,C&,const C&>, ReferenceMap<A,C,C&,const C&> >();
alpar@25
    75
kpeter@80
    76
  // NullMap
kpeter@80
    77
  {
kpeter@80
    78
    checkConcept<ReadWriteMap<A,B>, NullMap<A,B> >();
kpeter@80
    79
    NullMap<A,B> map1;
kpeter@80
    80
    NullMap<A,B> map2 = map1;
kpeter@80
    81
    map1 = nullMap<A,B>();
kpeter@80
    82
  }
kpeter@80
    83
kpeter@80
    84
  // ConstMap
kpeter@80
    85
  {
kpeter@80
    86
    checkConcept<ReadWriteMap<A,B>, ConstMap<A,B> >();
kpeter@123
    87
    checkConcept<ReadWriteMap<A,C>, ConstMap<A,C> >();
kpeter@80
    88
    ConstMap<A,B> map1;
deba@136
    89
    ConstMap<A,B> map2 = B();
kpeter@80
    90
    ConstMap<A,B> map3 = map1;
kpeter@80
    91
    map1 = constMap<A>(B());
kpeter@123
    92
    map1 = constMap<A,B>();
kpeter@80
    93
    map1.setAll(B());
kpeter@123
    94
    ConstMap<A,C> map4(C(1));
kpeter@123
    95
    ConstMap<A,C> map5 = map4;
kpeter@123
    96
    map4 = constMap<A>(C(2));
kpeter@123
    97
    map4.setAll(C(3));
kpeter@82
    98
kpeter@80
    99
    checkConcept<ReadWriteMap<A,int>, ConstMap<A,int> >();
kpeter@80
   100
    check(constMap<A>(10)[A()] == 10, "Something is wrong with ConstMap");
kpeter@80
   101
kpeter@80
   102
    checkConcept<ReadWriteMap<A,int>, ConstMap<A,Const<int,10> > >();
kpeter@123
   103
    ConstMap<A,Const<int,10> > map6;
kpeter@123
   104
    ConstMap<A,Const<int,10> > map7 = map6;
kpeter@123
   105
    map6 = constMap<A,int,10>();
kpeter@123
   106
    map7 = constMap<A,Const<int,10> >();
alpar@210
   107
    check(map6[A()] == 10 && map7[A()] == 10,
alpar@210
   108
          "Something is wrong with ConstMap");
kpeter@80
   109
  }
kpeter@80
   110
kpeter@80
   111
  // IdentityMap
kpeter@80
   112
  {
kpeter@80
   113
    checkConcept<ReadMap<A,A>, IdentityMap<A> >();
kpeter@80
   114
    IdentityMap<A> map1;
kpeter@80
   115
    IdentityMap<A> map2 = map1;
kpeter@80
   116
    map1 = identityMap<A>();
kpeter@82
   117
kpeter@80
   118
    checkConcept<ReadMap<double,double>, IdentityMap<double> >();
alpar@210
   119
    check(identityMap<double>()[1.0] == 1.0 &&
alpar@210
   120
          identityMap<double>()[3.14] == 3.14,
kpeter@80
   121
          "Something is wrong with IdentityMap");
kpeter@80
   122
  }
kpeter@80
   123
kpeter@80
   124
  // RangeMap
kpeter@80
   125
  {
kpeter@80
   126
    checkConcept<ReferenceMap<int,B,B&,const B&>, RangeMap<B> >();
kpeter@80
   127
    RangeMap<B> map1;
kpeter@80
   128
    RangeMap<B> map2(10);
kpeter@80
   129
    RangeMap<B> map3(10,B());
kpeter@80
   130
    RangeMap<B> map4 = map1;
kpeter@80
   131
    RangeMap<B> map5 = rangeMap<B>();
kpeter@80
   132
    RangeMap<B> map6 = rangeMap<B>(10);
kpeter@80
   133
    RangeMap<B> map7 = rangeMap(10,B());
kpeter@80
   134
kpeter@80
   135
    checkConcept< ReferenceMap<int, double, double&, const double&>,
kpeter@80
   136
                  RangeMap<double> >();
kpeter@80
   137
    std::vector<double> v(10, 0);
kpeter@80
   138
    v[5] = 100;
kpeter@80
   139
    RangeMap<double> map8(v);
kpeter@80
   140
    RangeMap<double> map9 = rangeMap(v);
kpeter@80
   141
    check(map9.size() == 10 && map9[2] == 0 && map9[5] == 100,
kpeter@80
   142
          "Something is wrong with RangeMap");
kpeter@80
   143
  }
kpeter@80
   144
kpeter@80
   145
  // SparseMap
kpeter@80
   146
  {
kpeter@80
   147
    checkConcept<ReferenceMap<A,B,B&,const B&>, SparseMap<A,B> >();
kpeter@80
   148
    SparseMap<A,B> map1;
deba@136
   149
    SparseMap<A,B> map2 = B();
kpeter@80
   150
    SparseMap<A,B> map3 = sparseMap<A,B>();
kpeter@80
   151
    SparseMap<A,B> map4 = sparseMap<A>(B());
kpeter@80
   152
kpeter@80
   153
    checkConcept< ReferenceMap<double, int, int&, const int&>,
kpeter@80
   154
                  SparseMap<double, int> >();
kpeter@80
   155
    std::map<double, int> m;
kpeter@80
   156
    SparseMap<double, int> map5(m);
kpeter@80
   157
    SparseMap<double, int> map6(m,10);
kpeter@80
   158
    SparseMap<double, int> map7 = sparseMap(m);
kpeter@80
   159
    SparseMap<double, int> map8 = sparseMap(m,10);
kpeter@80
   160
alpar@210
   161
    check(map5[1.0] == 0 && map5[3.14] == 0 &&
alpar@210
   162
          map6[1.0] == 10 && map6[3.14] == 10,
kpeter@80
   163
          "Something is wrong with SparseMap");
kpeter@80
   164
    map5[1.0] = map6[3.14] = 100;
alpar@210
   165
    check(map5[1.0] == 100 && map5[3.14] == 0 &&
alpar@210
   166
          map6[1.0] == 10 && map6[3.14] == 100,
kpeter@80
   167
          "Something is wrong with SparseMap");
kpeter@80
   168
  }
kpeter@80
   169
kpeter@80
   170
  // ComposeMap
kpeter@80
   171
  {
kpeter@80
   172
    typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap;
kpeter@80
   173
    checkConcept<ReadMap<B,double>, CompMap>();
alpar@554
   174
    CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());
kpeter@80
   175
    CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());
kpeter@82
   176
kpeter@80
   177
    SparseMap<double, bool> m1(false); m1[3.14] = true;
kpeter@80
   178
    RangeMap<double> m2(2); m2[0] = 3.0; m2[1] = 3.14;
alpar@210
   179
    check(!composeMap(m1,m2)[0] && composeMap(m1,m2)[1],
alpar@210
   180
          "Something is wrong with ComposeMap")
kpeter@80
   181
  }
kpeter@80
   182
kpeter@80
   183
  // CombineMap
kpeter@80
   184
  {
kpeter@80
   185
    typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap;
kpeter@80
   186
    checkConcept<ReadMap<A,double>, CombMap>();
alpar@554
   187
    CombMap map1 = CombMap(DoubleMap(), DoubleMap());
kpeter@80
   188
    CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());
kpeter@80
   189
kpeter@80
   190
    check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,
kpeter@80
   191
          "Something is wrong with CombineMap");
kpeter@80
   192
  }
kpeter@80
   193
kpeter@80
   194
  // FunctorToMap, MapToFunctor
kpeter@80
   195
  {
kpeter@80
   196
    checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >();
kpeter@80
   197
    checkConcept<ReadMap<A,B>, FunctorToMap<F> >();
kpeter@80
   198
    FunctorToMap<F> map1;
alpar@554
   199
    FunctorToMap<F> map2 = FunctorToMap<F>(F());
kpeter@80
   200
    B b = functorToMap(F())[A()];
kpeter@80
   201
kpeter@80
   202
    checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();
alpar@554
   203
    MapToFunctor<ReadMap<A,B> > map = MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());
kpeter@80
   204
alpar@210
   205
    check(functorToMap(&func)[A()] == 3,
alpar@210
   206
          "Something is wrong with FunctorToMap");
alpar@210
   207
    check(mapToFunctor(constMap<A,int>(2))(A()) == 2,
alpar@210
   208
          "Something is wrong with MapToFunctor");
alpar@210
   209
    check(mapToFunctor(functorToMap(&func))(A()) == 3 &&
alpar@210
   210
          mapToFunctor(functorToMap(&func))[A()] == 3,
kpeter@80
   211
          "Something is wrong with FunctorToMap or MapToFunctor");
kpeter@80
   212
    check(functorToMap(mapToFunctor(constMap<A,int>(2)))[A()] == 2,
kpeter@80
   213
          "Something is wrong with FunctorToMap or MapToFunctor");
kpeter@80
   214
  }
kpeter@80
   215
kpeter@80
   216
  // ConvertMap
kpeter@80
   217
  {
alpar@210
   218
    checkConcept<ReadMap<double,double>,
alpar@210
   219
      ConvertMap<ReadMap<double, int>, double> >();
kpeter@80
   220
    ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true));
kpeter@80
   221
    ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false));
kpeter@80
   222
  }
kpeter@80
   223
kpeter@80
   224
  // ForkMap
kpeter@80
   225
  {
kpeter@80
   226
    checkConcept<DoubleWriteMap, ForkMap<DoubleWriteMap, DoubleWriteMap> >();
kpeter@82
   227
kpeter@80
   228
    typedef RangeMap<double> RM;
kpeter@80
   229
    typedef SparseMap<int, double> SM;
kpeter@80
   230
    RM m1(10, -1);
kpeter@80
   231
    SM m2(-1);
kpeter@80
   232
    checkConcept<ReadWriteMap<int, double>, ForkMap<RM, SM> >();
kpeter@80
   233
    checkConcept<ReadWriteMap<int, double>, ForkMap<SM, RM> >();
kpeter@80
   234
    ForkMap<RM, SM> map1(m1,m2);
kpeter@80
   235
    ForkMap<SM, RM> map2 = forkMap(m2,m1);
kpeter@80
   236
    map2.set(5, 10);
alpar@210
   237
    check(m1[1] == -1 && m1[5] == 10 && m2[1] == -1 &&
alpar@210
   238
          m2[5] == 10 && map2[1] == -1 && map2[5] == 10,
kpeter@80
   239
          "Something is wrong with ForkMap");
kpeter@80
   240
  }
kpeter@82
   241
kpeter@80
   242
  // Arithmetic maps:
kpeter@80
   243
  // - AddMap, SubMap, MulMap, DivMap
kpeter@80
   244
  // - ShiftMap, ShiftWriteMap, ScaleMap, ScaleWriteMap
kpeter@80
   245
  // - NegMap, NegWriteMap, AbsMap
kpeter@80
   246
  {
kpeter@80
   247
    checkConcept<DoubleMap, AddMap<DoubleMap,DoubleMap> >();
kpeter@80
   248
    checkConcept<DoubleMap, SubMap<DoubleMap,DoubleMap> >();
kpeter@80
   249
    checkConcept<DoubleMap, MulMap<DoubleMap,DoubleMap> >();
kpeter@80
   250
    checkConcept<DoubleMap, DivMap<DoubleMap,DoubleMap> >();
kpeter@82
   251
kpeter@80
   252
    ConstMap<int, double> c1(1.0), c2(3.14);
kpeter@80
   253
    IdentityMap<int> im;
kpeter@80
   254
    ConvertMap<IdentityMap<int>, double> id(im);
alpar@210
   255
    check(addMap(c1,id)[0] == 1.0  && addMap(c1,id)[10] == 11.0,
alpar@210
   256
          "Something is wrong with AddMap");
alpar@210
   257
    check(subMap(id,c1)[0] == -1.0 && subMap(id,c1)[10] == 9.0,
alpar@210
   258
          "Something is wrong with SubMap");
alpar@210
   259
    check(mulMap(id,c2)[0] == 0    && mulMap(id,c2)[2]  == 6.28,
alpar@210
   260
          "Something is wrong with MulMap");
alpar@210
   261
    check(divMap(c2,id)[1] == 3.14 && divMap(c2,id)[2]  == 1.57,
alpar@210
   262
          "Something is wrong with DivMap");
kpeter@82
   263
kpeter@80
   264
    checkConcept<DoubleMap, ShiftMap<DoubleMap> >();
kpeter@80
   265
    checkConcept<DoubleWriteMap, ShiftWriteMap<DoubleWriteMap> >();
kpeter@80
   266
    checkConcept<DoubleMap, ScaleMap<DoubleMap> >();
kpeter@80
   267
    checkConcept<DoubleWriteMap, ScaleWriteMap<DoubleWriteMap> >();
kpeter@80
   268
    checkConcept<DoubleMap, NegMap<DoubleMap> >();
kpeter@80
   269
    checkConcept<DoubleWriteMap, NegWriteMap<DoubleWriteMap> >();
kpeter@80
   270
    checkConcept<DoubleMap, AbsMap<DoubleMap> >();
alpar@25
   271
kpeter@80
   272
    check(shiftMap(id, 2.0)[1] == 3.0 && shiftMap(id, 2.0)[10] == 12.0,
kpeter@80
   273
          "Something is wrong with ShiftMap");
alpar@210
   274
    check(shiftWriteMap(id, 2.0)[1] == 3.0 &&
alpar@210
   275
          shiftWriteMap(id, 2.0)[10] == 12.0,
kpeter@80
   276
          "Something is wrong with ShiftWriteMap");
kpeter@80
   277
    check(scaleMap(id, 2.0)[1] == 2.0 && scaleMap(id, 2.0)[10] == 20.0,
kpeter@80
   278
          "Something is wrong with ScaleMap");
alpar@210
   279
    check(scaleWriteMap(id, 2.0)[1] == 2.0 &&
alpar@210
   280
          scaleWriteMap(id, 2.0)[10] == 20.0,
kpeter@80
   281
          "Something is wrong with ScaleWriteMap");
kpeter@80
   282
    check(negMap(id)[1] == -1.0 && negMap(id)[-10] == 10.0,
kpeter@80
   283
          "Something is wrong with NegMap");
kpeter@80
   284
    check(negWriteMap(id)[1] == -1.0 && negWriteMap(id)[-10] == 10.0,
kpeter@80
   285
          "Something is wrong with NegWriteMap");
kpeter@80
   286
    check(absMap(id)[1] == 1.0 && absMap(id)[-10] == 10.0,
kpeter@80
   287
          "Something is wrong with AbsMap");
kpeter@80
   288
  }
kpeter@82
   289
kpeter@82
   290
  // Logical maps:
kpeter@82
   291
  // - TrueMap, FalseMap
kpeter@82
   292
  // - AndMap, OrMap
kpeter@82
   293
  // - NotMap, NotWriteMap
kpeter@82
   294
  // - EqualMap, LessMap
kpeter@80
   295
  {
kpeter@82
   296
    checkConcept<BoolMap, TrueMap<A> >();
kpeter@82
   297
    checkConcept<BoolMap, FalseMap<A> >();
kpeter@82
   298
    checkConcept<BoolMap, AndMap<BoolMap,BoolMap> >();
kpeter@82
   299
    checkConcept<BoolMap, OrMap<BoolMap,BoolMap> >();
kpeter@80
   300
    checkConcept<BoolMap, NotMap<BoolMap> >();
kpeter@80
   301
    checkConcept<BoolWriteMap, NotWriteMap<BoolWriteMap> >();
kpeter@82
   302
    checkConcept<BoolMap, EqualMap<DoubleMap,DoubleMap> >();
kpeter@82
   303
    checkConcept<BoolMap, LessMap<DoubleMap,DoubleMap> >();
kpeter@82
   304
kpeter@82
   305
    TrueMap<int> tm;
kpeter@82
   306
    FalseMap<int> fm;
kpeter@80
   307
    RangeMap<bool> rm(2);
kpeter@80
   308
    rm[0] = true; rm[1] = false;
alpar@210
   309
    check(andMap(tm,rm)[0] && !andMap(tm,rm)[1] &&
alpar@210
   310
          !andMap(fm,rm)[0] && !andMap(fm,rm)[1],
kpeter@82
   311
          "Something is wrong with AndMap");
alpar@210
   312
    check(orMap(tm,rm)[0] && orMap(tm,rm)[1] &&
alpar@210
   313
          orMap(fm,rm)[0] && !orMap(fm,rm)[1],
kpeter@82
   314
          "Something is wrong with OrMap");
alpar@210
   315
    check(!notMap(rm)[0] && notMap(rm)[1],
alpar@210
   316
          "Something is wrong with NotMap");
alpar@210
   317
    check(!notWriteMap(rm)[0] && notWriteMap(rm)[1],
alpar@210
   318
          "Something is wrong with NotWriteMap");
kpeter@82
   319
kpeter@82
   320
    ConstMap<int, double> cm(2.0);
kpeter@82
   321
    IdentityMap<int> im;
kpeter@82
   322
    ConvertMap<IdentityMap<int>, double> id(im);
kpeter@82
   323
    check(lessMap(id,cm)[1] && !lessMap(id,cm)[2] && !lessMap(id,cm)[3],
kpeter@82
   324
          "Something is wrong with LessMap");
kpeter@82
   325
    check(!equalMap(id,cm)[1] && equalMap(id,cm)[2] && !equalMap(id,cm)[3],
kpeter@82
   326
          "Something is wrong with EqualMap");
kpeter@80
   327
  }
alpar@209
   328
kpeter@167
   329
  // LoggerBoolMap
kpeter@159
   330
  {
kpeter@159
   331
    typedef std::vector<int> vec;
kpeter@767
   332
    checkConcept<WriteMap<int, bool>, LoggerBoolMap<vec::iterator> >();
kpeter@767
   333
    checkConcept<WriteMap<int, bool>,
kpeter@767
   334
                 LoggerBoolMap<std::back_insert_iterator<vec> > >();
kpeter@767
   335
kpeter@159
   336
    vec v1;
kpeter@159
   337
    vec v2(10);
alpar@210
   338
    LoggerBoolMap<std::back_insert_iterator<vec> >
alpar@210
   339
      map1(std::back_inserter(v1));
kpeter@167
   340
    LoggerBoolMap<vec::iterator> map2(v2.begin());
kpeter@159
   341
    map1.set(10, false);
kpeter@159
   342
    map1.set(20, true);   map2.set(20, true);
kpeter@159
   343
    map1.set(30, false);  map2.set(40, false);
kpeter@159
   344
    map1.set(50, true);   map2.set(50, true);
kpeter@159
   345
    map1.set(60, true);   map2.set(60, true);
kpeter@159
   346
    check(v1.size() == 3 && v2.size() == 10 &&
alpar@210
   347
          v1[0]==20 && v1[1]==50 && v1[2]==60 &&
alpar@210
   348
          v2[0]==20 && v2[1]==50 && v2[2]==60,
kpeter@167
   349
          "Something is wrong with LoggerBoolMap");
alpar@209
   350
kpeter@159
   351
    int i = 0;
kpeter@167
   352
    for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();
kpeter@159
   353
          it != map2.end(); ++it )
kpeter@167
   354
      check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
kpeter@159
   355
  }
kpeter@731
   356
  
kpeter@767
   357
  // IdMap, RangeIdMap
kpeter@767
   358
  {
kpeter@767
   359
    typedef ListDigraph Graph;
kpeter@767
   360
    DIGRAPH_TYPEDEFS(Graph);
kpeter@767
   361
kpeter@767
   362
    checkConcept<ReadMap<Node, int>, IdMap<Graph, Node> >();
kpeter@767
   363
    checkConcept<ReadMap<Arc, int>, IdMap<Graph, Arc> >();
kpeter@767
   364
    checkConcept<ReadMap<Node, int>, RangeIdMap<Graph, Node> >();
kpeter@767
   365
    checkConcept<ReadMap<Arc, int>, RangeIdMap<Graph, Arc> >();
kpeter@767
   366
    
kpeter@767
   367
    Graph gr;
kpeter@767
   368
    IdMap<Graph, Node> nmap(gr);
kpeter@767
   369
    IdMap<Graph, Arc> amap(gr);
kpeter@767
   370
    RangeIdMap<Graph, Node> nrmap(gr);
kpeter@767
   371
    RangeIdMap<Graph, Arc> armap(gr);
kpeter@767
   372
    
kpeter@767
   373
    Node n0 = gr.addNode();
kpeter@767
   374
    Node n1 = gr.addNode();
kpeter@767
   375
    Node n2 = gr.addNode();
kpeter@767
   376
    
kpeter@767
   377
    Arc a0 = gr.addArc(n0, n1);
kpeter@767
   378
    Arc a1 = gr.addArc(n0, n2);
kpeter@767
   379
    Arc a2 = gr.addArc(n2, n1);
kpeter@767
   380
    Arc a3 = gr.addArc(n2, n0);
kpeter@767
   381
    
kpeter@767
   382
    check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap");
kpeter@767
   383
    check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap");
kpeter@767
   384
    check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap");
kpeter@767
   385
kpeter@767
   386
    check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap");
kpeter@767
   387
    check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap");
kpeter@767
   388
    check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap");
kpeter@767
   389
    check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap");
kpeter@767
   390
kpeter@767
   391
    check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap");
kpeter@767
   392
    check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap");
kpeter@767
   393
    
kpeter@767
   394
    check(nrmap.size() == 3 && armap.size() == 4,
kpeter@767
   395
          "Wrong RangeIdMap::size()");
kpeter@767
   396
kpeter@767
   397
    check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap");
kpeter@767
   398
    check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap");
kpeter@767
   399
    check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap");
kpeter@767
   400
    
kpeter@767
   401
    check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap");
kpeter@767
   402
    check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
kpeter@767
   403
    check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap");
kpeter@767
   404
    check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap");
kpeter@767
   405
kpeter@767
   406
    check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap");
kpeter@767
   407
    check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap");
kpeter@767
   408
    
kpeter@767
   409
    gr.erase(n1);
kpeter@767
   410
    
kpeter@767
   411
    if (nrmap[n0] == 1) nrmap.swap(n0, n2);
kpeter@767
   412
    nrmap.swap(n2, n0);
kpeter@767
   413
    if (armap[a1] == 1) armap.swap(a1, a3);
kpeter@767
   414
    armap.swap(a3, a1);
kpeter@767
   415
    
kpeter@767
   416
    check(nrmap.size() == 2 && armap.size() == 2,
kpeter@767
   417
          "Wrong RangeIdMap::size()");
kpeter@767
   418
kpeter@767
   419
    check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap");
kpeter@767
   420
    check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap");
kpeter@767
   421
    
kpeter@767
   422
    check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
kpeter@767
   423
    check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap");
kpeter@767
   424
kpeter@767
   425
    check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap");
kpeter@767
   426
    check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap");
kpeter@767
   427
  }
kpeter@767
   428
  
kpeter@731
   429
  // CrossRefMap
kpeter@731
   430
  {
kpeter@731
   431
    typedef ListDigraph Graph;
kpeter@731
   432
    DIGRAPH_TYPEDEFS(Graph);
kpeter@731
   433
kpeter@731
   434
    checkConcept<ReadWriteMap<Node, int>,
kpeter@731
   435
                 CrossRefMap<Graph, Node, int> >();
kpeter@767
   436
    checkConcept<ReadWriteMap<Node, bool>,
kpeter@767
   437
                 CrossRefMap<Graph, Node, bool> >();
kpeter@767
   438
    checkConcept<ReadWriteMap<Node, double>,
kpeter@767
   439
                 CrossRefMap<Graph, Node, double> >();
kpeter@731
   440
    
kpeter@731
   441
    Graph gr;
kpeter@731
   442
    typedef CrossRefMap<Graph, Node, char> CRMap;
kpeter@731
   443
    typedef CRMap::ValueIterator ValueIt;
kpeter@731
   444
    CRMap map(gr);
kpeter@731
   445
    
kpeter@731
   446
    Node n0 = gr.addNode();
kpeter@731
   447
    Node n1 = gr.addNode();
kpeter@731
   448
    Node n2 = gr.addNode();
kpeter@731
   449
    
kpeter@731
   450
    map.set(n0, 'A');
kpeter@731
   451
    map.set(n1, 'B');
kpeter@731
   452
    map.set(n2, 'C');
kpeter@767
   453
    
kpeter@767
   454
    check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0,
kpeter@767
   455
          "Wrong CrossRefMap");
kpeter@767
   456
    check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1,
kpeter@767
   457
          "Wrong CrossRefMap");
kpeter@767
   458
    check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2,
kpeter@767
   459
          "Wrong CrossRefMap");
kpeter@767
   460
    check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
kpeter@767
   461
          "Wrong CrossRefMap::count()");
kpeter@767
   462
    
kpeter@767
   463
    ValueIt it = map.beginValue();
kpeter@767
   464
    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
kpeter@767
   465
          it == map.endValue(), "Wrong value iterator");
kpeter@767
   466
    
kpeter@731
   467
    map.set(n2, 'A');
kpeter@767
   468
kpeter@767
   469
    check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A',
kpeter@767
   470
          "Wrong CrossRefMap");
kpeter@767
   471
    check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap");
kpeter@767
   472
    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
kpeter@767
   473
    check(map('C') == INVALID && map.inverse()['C'] == INVALID,
kpeter@767
   474
          "Wrong CrossRefMap");
kpeter@767
   475
    check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0,
kpeter@767
   476
          "Wrong CrossRefMap::count()");
kpeter@767
   477
kpeter@767
   478
    it = map.beginValue();
kpeter@767
   479
    check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' &&
kpeter@767
   480
          it == map.endValue(), "Wrong value iterator");
kpeter@767
   481
kpeter@731
   482
    map.set(n0, 'C');
kpeter@731
   483
kpeter@731
   484
    check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
kpeter@731
   485
          "Wrong CrossRefMap");
kpeter@731
   486
    check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
kpeter@731
   487
    check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
kpeter@731
   488
    check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
kpeter@767
   489
    check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
kpeter@767
   490
          "Wrong CrossRefMap::count()");
kpeter@731
   491
kpeter@767
   492
    it = map.beginValue();
kpeter@731
   493
    check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
kpeter@731
   494
          it == map.endValue(), "Wrong value iterator");
kpeter@731
   495
  }
alpar@25
   496
alpar@25
   497
  return 0;
alpar@25
   498
}