OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
(...skipping 468 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
479 | 479 |
480 ASSERT(oldChild.parentNode() == this); | 480 ASSERT(oldChild.parentNode() == this); |
481 | 481 |
482 if (!oldChild.needsAttach()) | 482 if (!oldChild.needsAttach()) |
483 oldChild.detach(); | 483 oldChild.detach(); |
484 | 484 |
485 if (nextChild) | 485 if (nextChild) |
486 nextChild->setPreviousSibling(previousChild); | 486 nextChild->setPreviousSibling(previousChild); |
487 if (previousChild) | 487 if (previousChild) |
488 previousChild->setNextSibling(nextChild); | 488 previousChild->setNextSibling(nextChild); |
489 if (m_firstChild == &oldChild) | 489 if (m_firstChild == oldChild) |
490 m_firstChild = nextChild; | 490 m_firstChild = nextChild; |
491 if (m_lastChild == &oldChild) | 491 if (m_lastChild == oldChild) |
492 m_lastChild = previousChild; | 492 m_lastChild = previousChild; |
493 | 493 |
494 oldChild.setPreviousSibling(0); | 494 oldChild.setPreviousSibling(0); |
495 oldChild.setNextSibling(0); | 495 oldChild.setNextSibling(0); |
496 oldChild.setParentOrShadowHostNode(0); | 496 oldChild.setParentOrShadowHostNode(0); |
497 | 497 |
498 document().adoptIfNeeded(oldChild); | 498 document().adoptIfNeeded(oldChild); |
499 } | 499 } |
500 | 500 |
501 void ContainerNode::parserRemoveChild(Node& oldChild) | 501 void ContainerNode::parserRemoveChild(Node& oldChild) |
(...skipping 710 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1212 return true; | 1212 return true; |
1213 | 1213 |
1214 if (node->isElementNode() && toElement(node)->shadow()) | 1214 if (node->isElementNode() && toElement(node)->shadow()) |
1215 return true; | 1215 return true; |
1216 | 1216 |
1217 return false; | 1217 return false; |
1218 } | 1218 } |
1219 #endif | 1219 #endif |
1220 | 1220 |
1221 } // namespace WebCore | 1221 } // namespace WebCore |
OLD | NEW |