equal
deleted
inserted
replaced
1481 Parent::firstFromANode(uedge, node); |
1481 Parent::firstFromANode(uedge, node); |
1482 while (uedge != INVALID) { |
1482 while (uedge != INVALID) { |
1483 erase(uedge); |
1483 erase(uedge); |
1484 Parent::firstFromANode(uedge, node); |
1484 Parent::firstFromANode(uedge, node); |
1485 } |
1485 } |
|
1486 getNotifier(ANode()).erase(node); |
1486 } else { |
1487 } else { |
1487 Parent::firstFromBNode(uedge, node); |
1488 Parent::firstFromBNode(uedge, node); |
1488 while (uedge != INVALID) { |
1489 while (uedge != INVALID) { |
1489 erase(uedge); |
1490 erase(uedge); |
1490 Parent::firstFromBNode(uedge, node); |
1491 Parent::firstFromBNode(uedge, node); |
1491 } |
1492 } |
|
1493 getNotifier(BNode()).erase(node); |
1492 } |
1494 } |
1493 |
1495 |
1494 getNotifier(Node()).erase(node); |
1496 getNotifier(Node()).erase(node); |
1495 Parent::erase(node); |
1497 Parent::erase(node); |
1496 } |
1498 } |