r265:983d8c23aff8
Wed, 17 Sep 2008 16:04:38
[Not Reviewed]
0 comments (0 inline)
0
8
0
| ... | ... |
@@ -228,4 +228,5 @@ |
| 228 | 228 |
: Parent(digraph, value) {}
|
| 229 | 229 |
|
| 230 |
private: |
|
| 230 | 231 |
NodeMap& operator=(const NodeMap& cmap) {
|
| 231 | 232 |
return operator=<NodeMap>(cmap); |
| ... | ... |
@@ -252,4 +253,5 @@ |
| 252 | 253 |
: Parent(digraph, value) {}
|
| 253 | 254 |
|
| 255 |
private: |
|
| 254 | 256 |
ArcMap& operator=(const ArcMap& cmap) {
|
| 255 | 257 |
return operator=<ArcMap>(cmap); |
| ... | ... |
@@ -609,4 +611,5 @@ |
| 609 | 611 |
: Parent(graph, value) {}
|
| 610 | 612 |
|
| 613 |
private: |
|
| 611 | 614 |
NodeMap& operator=(const NodeMap& cmap) {
|
| 612 | 615 |
return operator=<NodeMap>(cmap); |
| ... | ... |
@@ -633,4 +636,5 @@ |
| 633 | 636 |
: Parent(graph, value) {}
|
| 634 | 637 |
|
| 638 |
private: |
|
| 635 | 639 |
ArcMap& operator=(const ArcMap& cmap) {
|
| 636 | 640 |
return operator=<ArcMap>(cmap); |
| ... | ... |
@@ -658,4 +662,5 @@ |
| 658 | 662 |
: Parent(graph, value) {}
|
| 659 | 663 |
|
| 664 |
private: |
|
| 660 | 665 |
EdgeMap& operator=(const EdgeMap& cmap) {
|
| 661 | 666 |
return operator=<EdgeMap>(cmap); |
| ... | ... |
@@ -63,4 +63,5 @@ |
| 63 | 63 |
: Parent(graph, value) {}
|
| 64 | 64 |
|
| 65 |
private: |
|
| 65 | 66 |
MapExtender& operator=(const MapExtender& cmap) {
|
| 66 | 67 |
return operator=<MapExtender>(cmap); |
| ... | ... |
@@ -73,4 +74,5 @@ |
| 73 | 74 |
} |
| 74 | 75 |
|
| 76 |
public: |
|
| 75 | 77 |
class MapIt : public Item {
|
| 76 | 78 |
public: |
| ... | ... |
@@ -201,4 +203,5 @@ |
| 201 | 203 |
: Parent(_graph, _value), graph(_graph) {}
|
| 202 | 204 |
|
| 205 |
private: |
|
| 203 | 206 |
SubMapExtender& operator=(const SubMapExtender& cmap) {
|
| 204 | 207 |
return operator=<MapExtender>(cmap); |
| ... | ... |
@@ -215,4 +218,5 @@ |
| 215 | 218 |
} |
| 216 | 219 |
|
| 220 |
public: |
|
| 217 | 221 |
class MapIt : public Item {
|
| 218 | 222 |
public: |
| ... | ... |
@@ -435,4 +435,5 @@ |
| 435 | 435 |
NodeMap(const Digraph&, T) { }
|
| 436 | 436 |
|
| 437 |
private: |
|
| 437 | 438 |
///Copy constructor |
| 438 | 439 |
NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
|
| ... | ... |
@@ -457,4 +458,5 @@ |
| 457 | 458 |
///\e |
| 458 | 459 |
ArcMap(const Digraph&, T) { }
|
| 460 |
private: |
|
| 459 | 461 |
///Copy constructor |
| 460 | 462 |
ArcMap(const ArcMap& em) : ReadWriteMap<Arc,T>(em) { }
|
| ... | ... |
@@ -513,4 +513,5 @@ |
| 513 | 513 |
NodeMap(const Graph&, T) { }
|
| 514 | 514 |
|
| 515 |
private: |
|
| 515 | 516 |
///Copy constructor |
| 516 | 517 |
NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
|
| ... | ... |
@@ -536,4 +537,5 @@ |
| 536 | 537 |
///\e |
| 537 | 538 |
ArcMap(const Graph&, T) { }
|
| 539 |
private: |
|
| 538 | 540 |
///Copy constructor |
| 539 | 541 |
ArcMap(const ArcMap& em) : ReadWriteMap<Arc,T>(em) { }
|
| ... | ... |
@@ -559,4 +561,5 @@ |
| 559 | 561 |
///\e |
| 560 | 562 |
EdgeMap(const Graph&, T) { }
|
| 563 |
private: |
|
| 561 | 564 |
///Copy constructor |
| 562 | 565 |
EdgeMap(const EdgeMap& em) : ReadWriteMap<Edge,T>(em) {}
|
| ... | ... |
@@ -1006,4 +1006,6 @@ |
| 1006 | 1006 |
/// Construct a new map for the graph and initalise the values. |
| 1007 | 1007 |
GraphMap(const Graph&, const Value&) {}
|
| 1008 |
|
|
| 1009 |
private: |
|
| 1008 | 1010 |
/// \brief Copy constructor. |
| 1009 | 1011 |
/// |
| ... | ... |
@@ -1022,4 +1024,5 @@ |
| 1022 | 1024 |
} |
| 1023 | 1025 |
|
| 1026 |
public: |
|
| 1024 | 1027 |
template<typename _Map> |
| 1025 | 1028 |
struct Constraints {
|
| ... | ... |
@@ -1031,11 +1034,12 @@ |
| 1031 | 1034 |
_Map a2(g,t); |
| 1032 | 1035 |
// Copy constructor. |
| 1033 |
_Map b(c); |
|
| 1036 |
// _Map b(c); |
|
| 1034 | 1037 |
|
| 1035 |
ReadMap<Key, Value> cmap; |
|
| 1036 |
b = cmap; |
|
| 1038 |
// ReadMap<Key, Value> cmap; |
|
| 1039 |
// b = cmap; |
|
| 1037 | 1040 |
|
| 1041 |
ignore_unused_variable_warning(a); |
|
| 1038 | 1042 |
ignore_unused_variable_warning(a2); |
| 1039 |
ignore_unused_variable_warning(b); |
|
| 1043 |
// ignore_unused_variable_warning(b); |
|
| 1040 | 1044 |
} |
| 1041 | 1045 |
|
| ... | ... |
@@ -1083,4 +1087,5 @@ |
| 1083 | 1087 |
: Parent(digraph, value) {}
|
| 1084 | 1088 |
|
| 1089 |
private: |
|
| 1085 | 1090 |
/// \brief Copy constructor. |
| 1086 | 1091 |
/// |
| ... | ... |
@@ -1120,4 +1125,5 @@ |
| 1120 | 1125 |
: Parent(digraph, value) {}
|
| 1121 | 1126 |
|
| 1127 |
private: |
|
| 1122 | 1128 |
/// \brief Copy constructor. |
| 1123 | 1129 |
/// |
| ... | ... |
@@ -1216,4 +1222,5 @@ |
| 1216 | 1222 |
: Parent(graph, value) {}
|
| 1217 | 1223 |
|
| 1224 |
private: |
|
| 1218 | 1225 |
/// \brief Copy constructor. |
| 1219 | 1226 |
/// |
| ... | ... |
@@ -213,8 +213,8 @@ |
| 213 | 213 |
check(s == 0, "Wrong sum."); |
| 214 | 214 |
|
| 215 |
map = constMap<Node>(12); |
|
| 216 |
for (NodeIt it(G); it != INVALID; ++it) {
|
|
| 217 |
check(map[it] == 12, "Wrong operator[]."); |
|
| 218 |
} |
|
| 215 |
// map = constMap<Node>(12); |
|
| 216 |
// for (NodeIt it(G); it != INVALID; ++it) {
|
|
| 217 |
// check(map[it] == 12, "Wrong operator[]."); |
|
| 218 |
// } |
|
| 219 | 219 |
} |
| 220 | 220 |
|
| ... | ... |
@@ -243,8 +243,8 @@ |
| 243 | 243 |
check(s == 0, "Wrong sum."); |
| 244 | 244 |
|
| 245 |
map = constMap<Arc>(12); |
|
| 246 |
for (ArcIt it(G); it != INVALID; ++it) {
|
|
| 247 |
check(map[it] == 12, "Wrong operator[]."); |
|
| 248 |
} |
|
| 245 |
// map = constMap<Arc>(12); |
|
| 246 |
// for (ArcIt it(G); it != INVALID; ++it) {
|
|
| 247 |
// check(map[it] == 12, "Wrong operator[]."); |
|
| 248 |
// } |
|
| 249 | 249 |
} |
| 250 | 250 |
|
| ... | ... |
@@ -273,8 +273,8 @@ |
| 273 | 273 |
check(s == 0, "Wrong sum."); |
| 274 | 274 |
|
| 275 |
map = constMap<Edge>(12); |
|
| 276 |
for (EdgeIt it(G); it != INVALID; ++it) {
|
|
| 277 |
check(map[it] == 12, "Wrong operator[]."); |
|
| 278 |
} |
|
| 275 |
// map = constMap<Edge>(12); |
|
| 276 |
// for (EdgeIt it(G); it != INVALID; ++it) {
|
|
| 277 |
// check(map[it] == 12, "Wrong operator[]."); |
|
| 278 |
// } |
|
| 279 | 279 |
} |
| 280 | 280 |
|
0 comments (0 inline)