0
8
0
| ... | ... |
@@ -103,6 +103,7 @@ |
| 103 | 103 |
} |
| 104 | 104 |
} |
| 105 | 105 |
|
| 106 |
private: |
|
| 106 | 107 |
/// \brief Constructor to copy a map of the same map type. |
| 107 | 108 |
/// |
| 108 | 109 |
/// Constructor to copy a map of the same map type. |
| ... | ... |
@@ -150,6 +151,7 @@ |
| 150 | 151 |
return *this; |
| 151 | 152 |
} |
| 152 | 153 |
|
| 154 |
public: |
|
| 153 | 155 |
/// \brief The destructor of the map. |
| 154 | 156 |
/// |
| 155 | 157 |
/// The destructor of the map. |
| ... | ... |
@@ -227,6 +227,7 @@ |
| 227 | 227 |
NodeMap(const Digraph& digraph, const _Value& value) |
| 228 | 228 |
: Parent(digraph, value) {}
|
| 229 | 229 |
|
| 230 |
private: |
|
| 230 | 231 |
NodeMap& operator=(const NodeMap& cmap) {
|
| 231 | 232 |
return operator=<NodeMap>(cmap); |
| 232 | 233 |
} |
| ... | ... |
@@ -251,6 +252,7 @@ |
| 251 | 252 |
ArcMap(const Digraph& digraph, const _Value& value) |
| 252 | 253 |
: Parent(digraph, value) {}
|
| 253 | 254 |
|
| 255 |
private: |
|
| 254 | 256 |
ArcMap& operator=(const ArcMap& cmap) {
|
| 255 | 257 |
return operator=<ArcMap>(cmap); |
| 256 | 258 |
} |
| ... | ... |
@@ -608,6 +610,7 @@ |
| 608 | 610 |
NodeMap(const Graph& graph, const _Value& value) |
| 609 | 611 |
: Parent(graph, value) {}
|
| 610 | 612 |
|
| 613 |
private: |
|
| 611 | 614 |
NodeMap& operator=(const NodeMap& cmap) {
|
| 612 | 615 |
return operator=<NodeMap>(cmap); |
| 613 | 616 |
} |
| ... | ... |
@@ -632,6 +635,7 @@ |
| 632 | 635 |
ArcMap(const Graph& graph, const _Value& value) |
| 633 | 636 |
: Parent(graph, value) {}
|
| 634 | 637 |
|
| 638 |
private: |
|
| 635 | 639 |
ArcMap& operator=(const ArcMap& cmap) {
|
| 636 | 640 |
return operator=<ArcMap>(cmap); |
| 637 | 641 |
} |
| ... | ... |
@@ -657,6 +661,7 @@ |
| 657 | 661 |
EdgeMap(const Graph& graph, const _Value& value) |
| 658 | 662 |
: Parent(graph, value) {}
|
| 659 | 663 |
|
| 664 |
private: |
|
| 660 | 665 |
EdgeMap& operator=(const EdgeMap& cmap) {
|
| 661 | 666 |
return operator=<EdgeMap>(cmap); |
| 662 | 667 |
} |
| ... | ... |
@@ -62,6 +62,7 @@ |
| 62 | 62 |
MapExtender(const Graph& graph, const Value& value) |
| 63 | 63 |
: Parent(graph, value) {}
|
| 64 | 64 |
|
| 65 |
private: |
|
| 65 | 66 |
MapExtender& operator=(const MapExtender& cmap) {
|
| 66 | 67 |
return operator=<MapExtender>(cmap); |
| 67 | 68 |
} |
| ... | ... |
@@ -72,6 +73,7 @@ |
| 72 | 73 |
return *this; |
| 73 | 74 |
} |
| 74 | 75 |
|
| 76 |
public: |
|
| 75 | 77 |
class MapIt : public Item {
|
| 76 | 78 |
public: |
| 77 | 79 |
|
| ... | ... |
@@ -200,6 +202,7 @@ |
| 200 | 202 |
SubMapExtender(const Graph& _graph, const Value& _value) |
| 201 | 203 |
: Parent(_graph, _value), graph(_graph) {}
|
| 202 | 204 |
|
| 205 |
private: |
|
| 203 | 206 |
SubMapExtender& operator=(const SubMapExtender& cmap) {
|
| 204 | 207 |
return operator=<MapExtender>(cmap); |
| 205 | 208 |
} |
| ... | ... |
@@ -214,6 +217,7 @@ |
| 214 | 217 |
return *this; |
| 215 | 218 |
} |
| 216 | 219 |
|
| 220 |
public: |
|
| 217 | 221 |
class MapIt : public Item {
|
| 218 | 222 |
public: |
| 219 | 223 |
| ... | ... |
@@ -434,6 +434,7 @@ |
| 434 | 434 |
///\e |
| 435 | 435 |
NodeMap(const Digraph&, T) { }
|
| 436 | 436 |
|
| 437 |
private: |
|
| 437 | 438 |
///Copy constructor |
| 438 | 439 |
NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
|
| 439 | 440 |
///Assignment operator |
| ... | ... |
@@ -456,6 +457,7 @@ |
| 456 | 457 |
ArcMap(const Digraph&) { }
|
| 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) { }
|
| 461 | 463 |
///Assignment operator |
| ... | ... |
@@ -512,6 +512,7 @@ |
| 512 | 512 |
///\e |
| 513 | 513 |
NodeMap(const Graph&, T) { }
|
| 514 | 514 |
|
| 515 |
private: |
|
| 515 | 516 |
///Copy constructor |
| 516 | 517 |
NodeMap(const NodeMap& nm) : ReadWriteMap< Node, T >(nm) { }
|
| 517 | 518 |
///Assignment operator |
| ... | ... |
@@ -535,6 +536,7 @@ |
| 535 | 536 |
ArcMap(const Graph&) { }
|
| 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) { }
|
| 540 | 542 |
///Assignment operator |
| ... | ... |
@@ -558,6 +560,7 @@ |
| 558 | 560 |
EdgeMap(const Graph&) { }
|
| 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) {}
|
| 563 | 566 |
///Assignment operator |
| ... | ... |
@@ -1005,6 +1005,8 @@ |
| 1005 | 1005 |
/// |
| 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 |
/// |
| 1010 | 1012 |
/// Copy Constructor. |
| ... | ... |
@@ -1021,6 +1023,7 @@ |
| 1021 | 1023 |
return *this; |
| 1022 | 1024 |
} |
| 1023 | 1025 |
|
| 1026 |
public: |
|
| 1024 | 1027 |
template<typename _Map> |
| 1025 | 1028 |
struct Constraints {
|
| 1026 | 1029 |
void constraints() {
|
| ... | ... |
@@ -1030,13 +1033,14 @@ |
| 1030 | 1033 |
// Constructor with a graph and a default value parameter |
| 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 |
|
| 1042 | 1046 |
const _Map &c; |
| ... | ... |
@@ -1082,6 +1086,7 @@ |
| 1082 | 1086 |
NodeMap(const MappableDigraphComponent& digraph, const _Value& value) |
| 1083 | 1087 |
: Parent(digraph, value) {}
|
| 1084 | 1088 |
|
| 1089 |
private: |
|
| 1085 | 1090 |
/// \brief Copy constructor. |
| 1086 | 1091 |
/// |
| 1087 | 1092 |
/// Copy Constructor. |
| ... | ... |
@@ -1119,6 +1124,7 @@ |
| 1119 | 1124 |
ArcMap(const MappableDigraphComponent& digraph, const _Value& value) |
| 1120 | 1125 |
: Parent(digraph, value) {}
|
| 1121 | 1126 |
|
| 1127 |
private: |
|
| 1122 | 1128 |
/// \brief Copy constructor. |
| 1123 | 1129 |
/// |
| 1124 | 1130 |
/// Copy Constructor. |
| ... | ... |
@@ -1215,6 +1221,7 @@ |
| 1215 | 1221 |
EdgeMap(const MappableGraphComponent& graph, const _Value& value) |
| 1216 | 1222 |
: Parent(graph, value) {}
|
| 1217 | 1223 |
|
| 1224 |
private: |
|
| 1218 | 1225 |
/// \brief Copy constructor. |
| 1219 | 1226 |
/// |
| 1220 | 1227 |
/// Copy Constructor. |
| ... | ... |
@@ -212,10 +212,10 @@ |
| 212 | 212 |
} |
| 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 |
|
| 221 | 221 |
template <typename Graph> |
| ... | ... |
@@ -242,10 +242,10 @@ |
| 242 | 242 |
} |
| 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 |
|
| 251 | 251 |
template <typename Graph> |
| ... | ... |
@@ -272,10 +272,10 @@ |
| 272 | 272 |
} |
| 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 |
|
| 281 | 281 |
|
0 comments (0 inline)