1.1 --- a/test/maps_test.cc Fri Oct 16 10:21:37 2009 +0200
1.2 +++ b/test/maps_test.cc Thu Nov 05 15:50:01 2009 +0100
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2008
1.8 + * Copyright (C) 2003-2009
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -22,6 +22,10 @@
1.13 #include <lemon/concept_check.h>
1.14 #include <lemon/concepts/maps.h>
1.15 #include <lemon/maps.h>
1.16 +#include <lemon/list_graph.h>
1.17 +#include <lemon/smart_graph.h>
1.18 +#include <lemon/adaptors.h>
1.19 +#include <lemon/dfs.h>
1.20
1.21 #include "test_tools.h"
1.22
1.23 @@ -60,6 +64,12 @@
1.24 typedef ReadWriteMap<A, bool> BoolWriteMap;
1.25 typedef ReferenceMap<A, bool, bool&, const bool&> BoolRefMap;
1.26
1.27 +template<typename Map1, typename Map2, typename ItemIt>
1.28 +void compareMap(const Map1& map1, const Map2& map2, ItemIt it) {
1.29 + for (; it != INVALID; ++it)
1.30 + check(map1[it] == map2[it], "The maps are not equal");
1.31 +}
1.32 +
1.33 int main()
1.34 {
1.35 // Map concepts
1.36 @@ -170,7 +180,7 @@
1.37 {
1.38 typedef ComposeMap<DoubleMap, ReadMap<B,A> > CompMap;
1.39 checkConcept<ReadMap<B,double>, CompMap>();
1.40 - CompMap map1(DoubleMap(),ReadMap<B,A>());
1.41 + CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());
1.42 CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());
1.43
1.44 SparseMap<double, bool> m1(false); m1[3.14] = true;
1.45 @@ -183,7 +193,7 @@
1.46 {
1.47 typedef CombineMap<DoubleMap, DoubleMap, std::plus<double> > CombMap;
1.48 checkConcept<ReadMap<A,double>, CombMap>();
1.49 - CombMap map1(DoubleMap(), DoubleMap());
1.50 + CombMap map1 = CombMap(DoubleMap(), DoubleMap());
1.51 CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());
1.52
1.53 check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,
1.54 @@ -195,11 +205,11 @@
1.55 checkConcept<ReadMap<A,B>, FunctorToMap<F,A,B> >();
1.56 checkConcept<ReadMap<A,B>, FunctorToMap<F> >();
1.57 FunctorToMap<F> map1;
1.58 - FunctorToMap<F> map2(F());
1.59 + FunctorToMap<F> map2 = FunctorToMap<F>(F());
1.60 B b = functorToMap(F())[A()];
1.61
1.62 checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();
1.63 - MapToFunctor<ReadMap<A,B> > map(ReadMap<A,B>());
1.64 + MapToFunctor<ReadMap<A,B> > map = MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());
1.65
1.66 check(functorToMap(&func)[A()] == 3,
1.67 "Something is wrong with FunctorToMap");
1.68 @@ -328,6 +338,10 @@
1.69 // LoggerBoolMap
1.70 {
1.71 typedef std::vector<int> vec;
1.72 + checkConcept<WriteMap<int, bool>, LoggerBoolMap<vec::iterator> >();
1.73 + checkConcept<WriteMap<int, bool>,
1.74 + LoggerBoolMap<std::back_insert_iterator<vec> > >();
1.75 +
1.76 vec v1;
1.77 vec v2(10);
1.78 LoggerBoolMap<std::back_insert_iterator<vec> >
1.79 @@ -347,7 +361,444 @@
1.80 for ( LoggerBoolMap<vec::iterator>::Iterator it = map2.begin();
1.81 it != map2.end(); ++it )
1.82 check(v1[i++] == *it, "Something is wrong with LoggerBoolMap");
1.83 +
1.84 + typedef ListDigraph Graph;
1.85 + DIGRAPH_TYPEDEFS(Graph);
1.86 + Graph gr;
1.87 +
1.88 + Node n0 = gr.addNode();
1.89 + Node n1 = gr.addNode();
1.90 + Node n2 = gr.addNode();
1.91 + Node n3 = gr.addNode();
1.92 +
1.93 + gr.addArc(n3, n0);
1.94 + gr.addArc(n3, n2);
1.95 + gr.addArc(n0, n2);
1.96 + gr.addArc(n2, n1);
1.97 + gr.addArc(n0, n1);
1.98 +
1.99 + {
1.100 + std::vector<Node> v;
1.101 + dfs(gr).processedMap(loggerBoolMap(std::back_inserter(v))).run();
1.102 +
1.103 + check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
1.104 + "Something is wrong with LoggerBoolMap");
1.105 + }
1.106 + {
1.107 + std::vector<Node> v(countNodes(gr));
1.108 + dfs(gr).processedMap(loggerBoolMap(v.begin())).run();
1.109 +
1.110 + check(v.size()==4 && v[0]==n1 && v[1]==n2 && v[2]==n0 && v[3]==n3,
1.111 + "Something is wrong with LoggerBoolMap");
1.112 + }
1.113 + }
1.114 +
1.115 + // IdMap, RangeIdMap
1.116 + {
1.117 + typedef ListDigraph Graph;
1.118 + DIGRAPH_TYPEDEFS(Graph);
1.119 +
1.120 + checkConcept<ReadMap<Node, int>, IdMap<Graph, Node> >();
1.121 + checkConcept<ReadMap<Arc, int>, IdMap<Graph, Arc> >();
1.122 + checkConcept<ReadMap<Node, int>, RangeIdMap<Graph, Node> >();
1.123 + checkConcept<ReadMap<Arc, int>, RangeIdMap<Graph, Arc> >();
1.124 +
1.125 + Graph gr;
1.126 + IdMap<Graph, Node> nmap(gr);
1.127 + IdMap<Graph, Arc> amap(gr);
1.128 + RangeIdMap<Graph, Node> nrmap(gr);
1.129 + RangeIdMap<Graph, Arc> armap(gr);
1.130 +
1.131 + Node n0 = gr.addNode();
1.132 + Node n1 = gr.addNode();
1.133 + Node n2 = gr.addNode();
1.134 +
1.135 + Arc a0 = gr.addArc(n0, n1);
1.136 + Arc a1 = gr.addArc(n0, n2);
1.137 + Arc a2 = gr.addArc(n2, n1);
1.138 + Arc a3 = gr.addArc(n2, n0);
1.139 +
1.140 + check(nmap[n0] == gr.id(n0) && nmap(gr.id(n0)) == n0, "Wrong IdMap");
1.141 + check(nmap[n1] == gr.id(n1) && nmap(gr.id(n1)) == n1, "Wrong IdMap");
1.142 + check(nmap[n2] == gr.id(n2) && nmap(gr.id(n2)) == n2, "Wrong IdMap");
1.143 +
1.144 + check(amap[a0] == gr.id(a0) && amap(gr.id(a0)) == a0, "Wrong IdMap");
1.145 + check(amap[a1] == gr.id(a1) && amap(gr.id(a1)) == a1, "Wrong IdMap");
1.146 + check(amap[a2] == gr.id(a2) && amap(gr.id(a2)) == a2, "Wrong IdMap");
1.147 + check(amap[a3] == gr.id(a3) && amap(gr.id(a3)) == a3, "Wrong IdMap");
1.148 +
1.149 + check(nmap.inverse()[gr.id(n0)] == n0, "Wrong IdMap::InverseMap");
1.150 + check(amap.inverse()[gr.id(a0)] == a0, "Wrong IdMap::InverseMap");
1.151 +
1.152 + check(nrmap.size() == 3 && armap.size() == 4,
1.153 + "Wrong RangeIdMap::size()");
1.154 +
1.155 + check(nrmap[n0] == 0 && nrmap(0) == n0, "Wrong RangeIdMap");
1.156 + check(nrmap[n1] == 1 && nrmap(1) == n1, "Wrong RangeIdMap");
1.157 + check(nrmap[n2] == 2 && nrmap(2) == n2, "Wrong RangeIdMap");
1.158 +
1.159 + check(armap[a0] == 0 && armap(0) == a0, "Wrong RangeIdMap");
1.160 + check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
1.161 + check(armap[a2] == 2 && armap(2) == a2, "Wrong RangeIdMap");
1.162 + check(armap[a3] == 3 && armap(3) == a3, "Wrong RangeIdMap");
1.163 +
1.164 + check(nrmap.inverse()[0] == n0, "Wrong RangeIdMap::InverseMap");
1.165 + check(armap.inverse()[0] == a0, "Wrong RangeIdMap::InverseMap");
1.166 +
1.167 + gr.erase(n1);
1.168 +
1.169 + if (nrmap[n0] == 1) nrmap.swap(n0, n2);
1.170 + nrmap.swap(n2, n0);
1.171 + if (armap[a1] == 1) armap.swap(a1, a3);
1.172 + armap.swap(a3, a1);
1.173 +
1.174 + check(nrmap.size() == 2 && armap.size() == 2,
1.175 + "Wrong RangeIdMap::size()");
1.176 +
1.177 + check(nrmap[n0] == 1 && nrmap(1) == n0, "Wrong RangeIdMap");
1.178 + check(nrmap[n2] == 0 && nrmap(0) == n2, "Wrong RangeIdMap");
1.179 +
1.180 + check(armap[a1] == 1 && armap(1) == a1, "Wrong RangeIdMap");
1.181 + check(armap[a3] == 0 && armap(0) == a3, "Wrong RangeIdMap");
1.182 +
1.183 + check(nrmap.inverse()[0] == n2, "Wrong RangeIdMap::InverseMap");
1.184 + check(armap.inverse()[0] == a3, "Wrong RangeIdMap::InverseMap");
1.185 + }
1.186 +
1.187 + // SourceMap, TargetMap, ForwardMap, BackwardMap, InDegMap, OutDegMap
1.188 + {
1.189 + typedef ListGraph Graph;
1.190 + GRAPH_TYPEDEFS(Graph);
1.191 +
1.192 + checkConcept<ReadMap<Arc, Node>, SourceMap<Graph> >();
1.193 + checkConcept<ReadMap<Arc, Node>, TargetMap<Graph> >();
1.194 + checkConcept<ReadMap<Edge, Arc>, ForwardMap<Graph> >();
1.195 + checkConcept<ReadMap<Edge, Arc>, BackwardMap<Graph> >();
1.196 + checkConcept<ReadMap<Node, int>, InDegMap<Graph> >();
1.197 + checkConcept<ReadMap<Node, int>, OutDegMap<Graph> >();
1.198 +
1.199 + Graph gr;
1.200 + Node n0 = gr.addNode();
1.201 + Node n1 = gr.addNode();
1.202 + Node n2 = gr.addNode();
1.203 +
1.204 + gr.addEdge(n0,n1);
1.205 + gr.addEdge(n1,n2);
1.206 + gr.addEdge(n0,n2);
1.207 + gr.addEdge(n2,n1);
1.208 + gr.addEdge(n1,n2);
1.209 + gr.addEdge(n0,n1);
1.210 +
1.211 + for (EdgeIt e(gr); e != INVALID; ++e) {
1.212 + check(forwardMap(gr)[e] == gr.direct(e, true), "Wrong ForwardMap");
1.213 + check(backwardMap(gr)[e] == gr.direct(e, false), "Wrong BackwardMap");
1.214 + }
1.215 +
1.216 + compareMap(sourceMap(orienter(gr, constMap<Edge, bool>(true))),
1.217 + targetMap(orienter(gr, constMap<Edge, bool>(false))),
1.218 + EdgeIt(gr));
1.219 +
1.220 + typedef Orienter<Graph, const ConstMap<Edge, bool> > Digraph;
1.221 + Digraph dgr(gr, constMap<Edge, bool>(true));
1.222 + OutDegMap<Digraph> odm(dgr);
1.223 + InDegMap<Digraph> idm(dgr);
1.224 +
1.225 + check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 1, "Wrong OutDegMap");
1.226 + check(idm[n0] == 0 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
1.227 +
1.228 + gr.addEdge(n2, n0);
1.229 +
1.230 + check(odm[n0] == 3 && odm[n1] == 2 && odm[n2] == 2, "Wrong OutDegMap");
1.231 + check(idm[n0] == 1 && idm[n1] == 3 && idm[n2] == 3, "Wrong InDegMap");
1.232 + }
1.233 +
1.234 + // CrossRefMap
1.235 + {
1.236 + typedef ListDigraph Graph;
1.237 + DIGRAPH_TYPEDEFS(Graph);
1.238 +
1.239 + checkConcept<ReadWriteMap<Node, int>,
1.240 + CrossRefMap<Graph, Node, int> >();
1.241 + checkConcept<ReadWriteMap<Node, bool>,
1.242 + CrossRefMap<Graph, Node, bool> >();
1.243 + checkConcept<ReadWriteMap<Node, double>,
1.244 + CrossRefMap<Graph, Node, double> >();
1.245 +
1.246 + Graph gr;
1.247 + typedef CrossRefMap<Graph, Node, char> CRMap;
1.248 + CRMap map(gr);
1.249 +
1.250 + Node n0 = gr.addNode();
1.251 + Node n1 = gr.addNode();
1.252 + Node n2 = gr.addNode();
1.253 +
1.254 + map.set(n0, 'A');
1.255 + map.set(n1, 'B');
1.256 + map.set(n2, 'C');
1.257 +
1.258 + check(map[n0] == 'A' && map('A') == n0 && map.inverse()['A'] == n0,
1.259 + "Wrong CrossRefMap");
1.260 + check(map[n1] == 'B' && map('B') == n1 && map.inverse()['B'] == n1,
1.261 + "Wrong CrossRefMap");
1.262 + check(map[n2] == 'C' && map('C') == n2 && map.inverse()['C'] == n2,
1.263 + "Wrong CrossRefMap");
1.264 + check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
1.265 + "Wrong CrossRefMap::count()");
1.266 +
1.267 + CRMap::ValueIt it = map.beginValue();
1.268 + check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
1.269 + it == map.endValue(), "Wrong value iterator");
1.270 +
1.271 + map.set(n2, 'A');
1.272 +
1.273 + check(map[n0] == 'A' && map[n1] == 'B' && map[n2] == 'A',
1.274 + "Wrong CrossRefMap");
1.275 + check(map('A') == n0 && map.inverse()['A'] == n0, "Wrong CrossRefMap");
1.276 + check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
1.277 + check(map('C') == INVALID && map.inverse()['C'] == INVALID,
1.278 + "Wrong CrossRefMap");
1.279 + check(map.count('A') == 2 && map.count('B') == 1 && map.count('C') == 0,
1.280 + "Wrong CrossRefMap::count()");
1.281 +
1.282 + it = map.beginValue();
1.283 + check(*it++ == 'A' && *it++ == 'A' && *it++ == 'B' &&
1.284 + it == map.endValue(), "Wrong value iterator");
1.285 +
1.286 + map.set(n0, 'C');
1.287 +
1.288 + check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
1.289 + "Wrong CrossRefMap");
1.290 + check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
1.291 + check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
1.292 + check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
1.293 + check(map.count('A') == 1 && map.count('B') == 1 && map.count('C') == 1,
1.294 + "Wrong CrossRefMap::count()");
1.295 +
1.296 + it = map.beginValue();
1.297 + check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
1.298 + it == map.endValue(), "Wrong value iterator");
1.299 }
1.300
1.301 + // CrossRefMap
1.302 + {
1.303 + typedef SmartDigraph Graph;
1.304 + DIGRAPH_TYPEDEFS(Graph);
1.305 +
1.306 + checkConcept<ReadWriteMap<Node, int>,
1.307 + CrossRefMap<Graph, Node, int> >();
1.308 +
1.309 + Graph gr;
1.310 + typedef CrossRefMap<Graph, Node, char> CRMap;
1.311 + typedef CRMap::ValueIterator ValueIt;
1.312 + CRMap map(gr);
1.313 +
1.314 + Node n0 = gr.addNode();
1.315 + Node n1 = gr.addNode();
1.316 + Node n2 = gr.addNode();
1.317 +
1.318 + map.set(n0, 'A');
1.319 + map.set(n1, 'B');
1.320 + map.set(n2, 'C');
1.321 + map.set(n2, 'A');
1.322 + map.set(n0, 'C');
1.323 +
1.324 + check(map[n0] == 'C' && map[n1] == 'B' && map[n2] == 'A',
1.325 + "Wrong CrossRefMap");
1.326 + check(map('A') == n2 && map.inverse()['A'] == n2, "Wrong CrossRefMap");
1.327 + check(map('B') == n1 && map.inverse()['B'] == n1, "Wrong CrossRefMap");
1.328 + check(map('C') == n0 && map.inverse()['C'] == n0, "Wrong CrossRefMap");
1.329 +
1.330 + ValueIt it = map.beginValue();
1.331 + check(*it++ == 'A' && *it++ == 'B' && *it++ == 'C' &&
1.332 + it == map.endValue(), "Wrong value iterator");
1.333 + }
1.334 +
1.335 + // Iterable bool map
1.336 + {
1.337 + typedef SmartGraph Graph;
1.338 + typedef SmartGraph::Node Item;
1.339 +
1.340 + typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm;
1.341 + checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>();
1.342 +
1.343 + const int num = 10;
1.344 + Graph g;
1.345 + std::vector<Item> items;
1.346 + for (int i = 0; i < num; ++i) {
1.347 + items.push_back(g.addNode());
1.348 + }
1.349 +
1.350 + Ibm map1(g, true);
1.351 + int n = 0;
1.352 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.353 + check(map1[static_cast<Item>(it)], "Wrong TrueIt");
1.354 + ++n;
1.355 + }
1.356 + check(n == num, "Wrong number");
1.357 +
1.358 + n = 0;
1.359 + for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
1.360 + check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
1.361 + ++n;
1.362 + }
1.363 + check(n == num, "Wrong number");
1.364 + check(Ibm::FalseIt(map1) == INVALID, "Wrong FalseIt");
1.365 + check(Ibm::ItemIt(map1, false) == INVALID, "Wrong ItemIt for false");
1.366 +
1.367 + map1[items[5]] = true;
1.368 +
1.369 + n = 0;
1.370 + for (Ibm::ItemIt it(map1, true); it != INVALID; ++it) {
1.371 + check(map1[static_cast<Item>(it)], "Wrong ItemIt for true");
1.372 + ++n;
1.373 + }
1.374 + check(n == num, "Wrong number");
1.375 +
1.376 + map1[items[num / 2]] = false;
1.377 + check(map1[items[num / 2]] == false, "Wrong map value");
1.378 +
1.379 + n = 0;
1.380 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.381 + check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
1.382 + ++n;
1.383 + }
1.384 + check(n == num - 1, "Wrong number");
1.385 +
1.386 + n = 0;
1.387 + for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
1.388 + check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
1.389 + ++n;
1.390 + }
1.391 + check(n == 1, "Wrong number");
1.392 +
1.393 + map1[items[0]] = false;
1.394 + check(map1[items[0]] == false, "Wrong map value");
1.395 +
1.396 + map1[items[num - 1]] = false;
1.397 + check(map1[items[num - 1]] == false, "Wrong map value");
1.398 +
1.399 + n = 0;
1.400 + for (Ibm::TrueIt it(map1); it != INVALID; ++it) {
1.401 + check(map1[static_cast<Item>(it)], "Wrong TrueIt for true");
1.402 + ++n;
1.403 + }
1.404 + check(n == num - 3, "Wrong number");
1.405 + check(map1.trueNum() == num - 3, "Wrong number");
1.406 +
1.407 + n = 0;
1.408 + for (Ibm::FalseIt it(map1); it != INVALID; ++it) {
1.409 + check(!map1[static_cast<Item>(it)], "Wrong FalseIt for true");
1.410 + ++n;
1.411 + }
1.412 + check(n == 3, "Wrong number");
1.413 + check(map1.falseNum() == 3, "Wrong number");
1.414 + }
1.415 +
1.416 + // Iterable int map
1.417 + {
1.418 + typedef SmartGraph Graph;
1.419 + typedef SmartGraph::Node Item;
1.420 + typedef IterableIntMap<SmartGraph, SmartGraph::Node> Iim;
1.421 +
1.422 + checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>();
1.423 +
1.424 + const int num = 10;
1.425 + Graph g;
1.426 + std::vector<Item> items;
1.427 + for (int i = 0; i < num; ++i) {
1.428 + items.push_back(g.addNode());
1.429 + }
1.430 +
1.431 + Iim map1(g);
1.432 + check(map1.size() == 0, "Wrong size");
1.433 +
1.434 + for (int i = 0; i < num; ++i) {
1.435 + map1[items[i]] = i;
1.436 + }
1.437 + check(map1.size() == num, "Wrong size");
1.438 +
1.439 + for (int i = 0; i < num; ++i) {
1.440 + Iim::ItemIt it(map1, i);
1.441 + check(static_cast<Item>(it) == items[i], "Wrong value");
1.442 + ++it;
1.443 + check(static_cast<Item>(it) == INVALID, "Wrong value");
1.444 + }
1.445 +
1.446 + for (int i = 0; i < num; ++i) {
1.447 + map1[items[i]] = i % 2;
1.448 + }
1.449 + check(map1.size() == 2, "Wrong size");
1.450 +
1.451 + int n = 0;
1.452 + for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) {
1.453 + check(map1[static_cast<Item>(it)] == 0, "Wrong value");
1.454 + ++n;
1.455 + }
1.456 + check(n == (num + 1) / 2, "Wrong number");
1.457 +
1.458 + for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) {
1.459 + check(map1[static_cast<Item>(it)] == 1, "Wrong value");
1.460 + ++n;
1.461 + }
1.462 + check(n == num, "Wrong number");
1.463 +
1.464 + }
1.465 +
1.466 + // Iterable value map
1.467 + {
1.468 + typedef SmartGraph Graph;
1.469 + typedef SmartGraph::Node Item;
1.470 + typedef IterableValueMap<SmartGraph, SmartGraph::Node, double> Ivm;
1.471 +
1.472 + checkConcept<ReadWriteMap<Item, double>, Ivm>();
1.473 +
1.474 + const int num = 10;
1.475 + Graph g;
1.476 + std::vector<Item> items;
1.477 + for (int i = 0; i < num; ++i) {
1.478 + items.push_back(g.addNode());
1.479 + }
1.480 +
1.481 + Ivm map1(g, 0.0);
1.482 + check(distance(map1.beginValue(), map1.endValue()) == 1, "Wrong size");
1.483 + check(*map1.beginValue() == 0.0, "Wrong value");
1.484 +
1.485 + for (int i = 0; i < num; ++i) {
1.486 + map1.set(items[i], static_cast<double>(i));
1.487 + }
1.488 + check(distance(map1.beginValue(), map1.endValue()) == num, "Wrong size");
1.489 +
1.490 + for (int i = 0; i < num; ++i) {
1.491 + Ivm::ItemIt it(map1, static_cast<double>(i));
1.492 + check(static_cast<Item>(it) == items[i], "Wrong value");
1.493 + ++it;
1.494 + check(static_cast<Item>(it) == INVALID, "Wrong value");
1.495 + }
1.496 +
1.497 + for (Ivm::ValueIt vit = map1.beginValue();
1.498 + vit != map1.endValue(); ++vit) {
1.499 + check(map1[static_cast<Item>(Ivm::ItemIt(map1, *vit))] == *vit,
1.500 + "Wrong ValueIt");
1.501 + }
1.502 +
1.503 + for (int i = 0; i < num; ++i) {
1.504 + map1.set(items[i], static_cast<double>(i % 2));
1.505 + }
1.506 + check(distance(map1.beginValue(), map1.endValue()) == 2, "Wrong size");
1.507 +
1.508 + int n = 0;
1.509 + for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) {
1.510 + check(map1[static_cast<Item>(it)] == 0.0, "Wrong value");
1.511 + ++n;
1.512 + }
1.513 + check(n == (num + 1) / 2, "Wrong number");
1.514 +
1.515 + for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) {
1.516 + check(map1[static_cast<Item>(it)] == 1.0, "Wrong value");
1.517 + ++n;
1.518 + }
1.519 + check(n == num, "Wrong number");
1.520 +
1.521 + }
1.522 return 0;
1.523 }