equal
deleted
inserted
replaced
1475 Parent::clear(); |
1475 Parent::clear(); |
1476 } |
1476 } |
1477 |
1477 |
1478 void erase(const Node& node) { |
1478 void erase(const Node& node) { |
1479 UEdge uedge; |
1479 UEdge uedge; |
1480 bool dir; |
1480 if (Parent::aNode(node)) { |
1481 Parent::firstInc(uedge, dir, node); |
1481 Parent::firstFromANode(uedge, node); |
1482 while (uedge != INVALID ) { |
1482 while (uedge != INVALID) { |
1483 erase(uedge); |
1483 erase(uedge); |
1484 Parent::firstInc(uedge, dir, node); |
1484 Parent::firstFromANode(uedge, node); |
1485 } |
1485 } |
|
1486 } else { |
|
1487 Parent::firstFromBNode(uedge, node); |
|
1488 while (uedge != INVALID) { |
|
1489 erase(uedge); |
|
1490 Parent::firstFromBNode(uedge, node); |
|
1491 } |
|
1492 } |
1486 |
1493 |
1487 getNotifier(Node()).erase(node); |
1494 getNotifier(Node()).erase(node); |
1488 Parent::erase(node); |
1495 Parent::erase(node); |
1489 } |
1496 } |
1490 |
1497 |