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 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
101 willBeDeletedFromDocument(); | 101 willBeDeletedFromDocument(); |
102 removeDetachedChildren(); | 102 removeDetachedChildren(); |
103 #endif | 103 #endif |
104 } | 104 } |
105 | 105 |
106 bool ContainerNode::isChildTypeAllowed(const Node& child) const | 106 bool ContainerNode::isChildTypeAllowed(const Node& child) const |
107 { | 107 { |
108 if (!child.isDocumentFragment()) | 108 if (!child.isDocumentFragment()) |
109 return childTypeAllowed(child.nodeType()); | 109 return childTypeAllowed(child.nodeType()); |
110 | 110 |
111 for (Node* node = child.firstChild(); node; node = node->nextSibling()) { | 111 for (Node* node = toDocumentFragment(child).firstChild(); node; node = node-
>nextSibling()) { |
112 if (!childTypeAllowed(node->nodeType())) | 112 if (!childTypeAllowed(node->nodeType())) |
113 return false; | 113 return false; |
114 } | 114 } |
115 return true; | 115 return true; |
116 } | 116 } |
117 | 117 |
118 bool ContainerNode::containsConsideringHostElements(const Node& newChild) const | 118 bool ContainerNode::containsConsideringHostElements(const Node& newChild) const |
119 { | 119 { |
120 if (isInShadowTree() || document().isTemplateDocument()) | 120 if (isInShadowTree() || document().isTemplateDocument()) |
121 return newChild.containsIncludingHostElements(*this); | 121 return newChild.containsIncludingHostElements(*this); |
(...skipping 1156 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1278 return true; | 1278 return true; |
1279 | 1279 |
1280 if (node->isElementNode() && toElement(node)->shadow()) | 1280 if (node->isElementNode() && toElement(node)->shadow()) |
1281 return true; | 1281 return true; |
1282 | 1282 |
1283 return false; | 1283 return false; |
1284 } | 1284 } |
1285 #endif | 1285 #endif |
1286 | 1286 |
1287 } // namespace WebCore | 1287 } // namespace WebCore |
OLD | NEW |