1.1 --- a/test/maps_test.cc Sat Jun 27 13:07:26 2009 +0200
1.2 +++ b/test/maps_test.cc Tue Jul 21 22:43:31 2009 +0200
1.3 @@ -22,6 +22,7 @@
1.4 #include <lemon/concept_check.h>
1.5 #include <lemon/concepts/maps.h>
1.6 #include <lemon/maps.h>
1.7 +#include <lemon/smart_graph.h>
1.8
1.9 #include "test_tools.h"
1.10
1.11 @@ -355,7 +356,7 @@
1.12 typedef SmartGraph::Node Item;
1.13
1.14 typedef IterableBoolMap<SmartGraph, SmartGraph::Node> Ibm;
1.15 - checkConcept<ReadWriteMap<Item, int>, Ibm>();
1.16 + checkConcept<ReferenceMap<Item, bool, bool&, const bool&>, Ibm>();
1.17
1.18 const int num = 10;
1.19 Graph g;
1.20 @@ -436,7 +437,7 @@
1.21 typedef SmartGraph::Node Item;
1.22 typedef IterableIntMap<SmartGraph, SmartGraph::Node> Iim;
1.23
1.24 - checkConcept<ReadWriteMap<Item, int>, Iim>();
1.25 + checkConcept<ReferenceMap<Item, int, int&, const int&>, Iim>();
1.26
1.27 const int num = 10;
1.28 Graph g;
1.29 @@ -467,13 +468,13 @@
1.30
1.31 int n = 0;
1.32 for (Iim::ItemIt it(map1, 0); it != INVALID; ++it) {
1.33 - check(map1[static_cast<Item>(it)] == 0, "Wrong Value");
1.34 + check(map1[static_cast<Item>(it)] == 0, "Wrong value");
1.35 ++n;
1.36 }
1.37 check(n == (num + 1) / 2, "Wrong number");
1.38
1.39 for (Iim::ItemIt it(map1, 1); it != INVALID; ++it) {
1.40 - check(map1[static_cast<Item>(it)] == 1, "Wrong Value");
1.41 + check(map1[static_cast<Item>(it)] == 1, "Wrong value");
1.42 ++n;
1.43 }
1.44 check(n == num, "Wrong number");
1.45 @@ -524,13 +525,13 @@
1.46
1.47 int n = 0;
1.48 for (Ivm::ItemIt it(map1, 0.0); it != INVALID; ++it) {
1.49 - check(map1[static_cast<Item>(it)] == 0.0, "Wrong Value");
1.50 + check(map1[static_cast<Item>(it)] == 0.0, "Wrong value");
1.51 ++n;
1.52 }
1.53 check(n == (num + 1) / 2, "Wrong number");
1.54
1.55 for (Ivm::ItemIt it(map1, 1.0); it != INVALID; ++it) {
1.56 - check(map1[static_cast<Item>(it)] == 1.0, "Wrong Value");
1.57 + check(map1[static_cast<Item>(it)] == 1.0, "Wrong value");
1.58 ++n;
1.59 }
1.60 check(n == num, "Wrong number");