| 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, 2009, 2010, 2011, 2013 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All r
ights reserved. |
| 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 160 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 171 void disconnectDescendantFrames(); | 171 void disconnectDescendantFrames(); |
| 172 | 172 |
| 173 virtual void trace(Visitor*) OVERRIDE; | 173 virtual void trace(Visitor*) OVERRIDE; |
| 174 | 174 |
| 175 void notifyNodeInserted(Node&); | 175 void notifyNodeInserted(Node&); |
| 176 void notifyNodeRemoved(Node&); | 176 void notifyNodeRemoved(Node&); |
| 177 | 177 |
| 178 protected: | 178 protected: |
| 179 ContainerNode(TreeScope*, ConstructionType = CreateContainer); | 179 ContainerNode(TreeScope*, ConstructionType = CreateContainer); |
| 180 | 180 |
| 181 void invalidateNodeListCachesInAncestors(const QualifiedName* attrName = 0,
Element* attributeOwnerElement = 0); |
| 182 |
| 181 #if !ENABLE(OILPAN) | 183 #if !ENABLE(OILPAN) |
| 182 void removeDetachedChildren(); | 184 void removeDetachedChildren(); |
| 183 #endif | 185 #endif |
| 184 | 186 |
| 185 void setFirstChild(Node* child) { m_firstChild = child; } | 187 void setFirstChild(Node* child) { m_firstChild = child; } |
| 186 void setLastChild(Node* child) { m_lastChild = child; } | 188 void setLastChild(Node* child) { m_lastChild = child; } |
| 187 | 189 |
| 188 private: | 190 private: |
| 189 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); | 191 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); |
| 190 void insertBeforeCommon(Node& nextChild, Node& oldChild); | 192 void insertBeforeCommon(Node& nextChild, Node& oldChild); |
| (...skipping 128 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 319 inline void getChildNodes(Node& node, NodeVector& nodes) | 321 inline void getChildNodes(Node& node, NodeVector& nodes) |
| 320 { | 322 { |
| 321 ASSERT(!nodes.size()); | 323 ASSERT(!nodes.size()); |
| 322 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 324 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 323 nodes.append(child); | 325 nodes.append(child); |
| 324 } | 326 } |
| 325 | 327 |
| 326 } // namespace blink | 328 } // namespace blink |
| 327 | 329 |
| 328 #endif // ContainerNode_h | 330 #endif // ContainerNode_h |
| OLD | NEW |