... | ... |
@@ -295,17 +295,17 @@ |
295 | 295 |
|
296 | 296 |
class Red : public Node { |
297 | 297 |
friend class BidirBpGraphExtender; |
298 | 298 |
public: |
299 | 299 |
Red() {} |
300 | 300 |
Red(const Node& node) : Node(node) { |
301 |
|
|
301 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
302 | 302 |
typename Parent::NodeSetError()); |
303 | 303 |
} |
304 | 304 |
Red& operator=(const Node& node) { |
305 |
|
|
305 |
LEMON_DEBUG(Parent::red(node) || node == INVALID, |
|
306 | 306 |
typename Parent::NodeSetError()); |
307 | 307 |
Node::operator=(node); |
308 | 308 |
return *this; |
309 | 309 |
} |
310 | 310 |
Red(Invalid) : Node(INVALID) {} |
311 | 311 |
Red& operator=(Invalid) { |
... | ... |
@@ -327,17 +327,17 @@ |
327 | 327 |
|
328 | 328 |
class Blue : public Node { |
329 | 329 |
friend class BidirBpGraphExtender; |
330 | 330 |
public: |
331 | 331 |
Blue() {} |
332 | 332 |
Blue(const Node& node) : Node(node) { |
333 |
|
|
333 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
334 | 334 |
typename Parent::NodeSetError()); |
335 | 335 |
} |
336 | 336 |
Blue& operator=(const Node& node) { |
337 |
|
|
337 |
LEMON_DEBUG(Parent::blue(node) || node == INVALID, |
|
338 | 338 |
typename Parent::NodeSetError()); |
339 | 339 |
Node::operator=(node); |
340 | 340 |
return *this; |
341 | 341 |
} |
342 | 342 |
Blue(Invalid) : Node(INVALID) {} |
343 | 343 |
Blue& operator=(Invalid) { |
0 comments (0 inline)