| 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 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011 Apple Inc. All rights
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 133 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 144 template<class GenericNode, class GenericNodeContainer> | 144 template<class GenericNode, class GenericNodeContainer> |
| 145 friend void appendChildToContainer(GenericNode* child, GenericNodeContainer*
); | 145 friend void appendChildToContainer(GenericNode* child, GenericNodeContainer*
); |
| 146 | 146 |
| 147 template<class GenericNode, class GenericNodeContainer> | 147 template<class GenericNode, class GenericNodeContainer> |
| 148 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, Generi
cNode*& tail, GenericNodeContainer*); | 148 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, Generi
cNode*& tail, GenericNodeContainer*); |
| 149 | 149 |
| 150 void removeDetachedChildren(); | 150 void removeDetachedChildren(); |
| 151 void setFirstChild(Node* child) { m_firstChild = child; } | 151 void setFirstChild(Node* child) { m_firstChild = child; } |
| 152 void setLastChild(Node* child) { m_lastChild = child; } | 152 void setLastChild(Node* child) { m_lastChild = child; } |
| 153 | 153 |
| 154 virtual void acceptHeapVisitor(Visitor*) const OVERRIDE; |
| 155 |
| 154 private: | 156 private: |
| 155 void removeBetween(Node* previousChild, Node* nextChild, Node* oldChild); | 157 void removeBetween(Node* previousChild, Node* nextChild, Node* oldChild); |
| 156 void insertBeforeCommon(Node* nextChild, Node* oldChild); | 158 void insertBeforeCommon(Node* nextChild, Node* oldChild); |
| 157 | 159 |
| 158 static void dispatchPostAttachCallbacks(); | 160 static void dispatchPostAttachCallbacks(); |
| 159 void suspendPostAttachCallbacks(); | 161 void suspendPostAttachCallbacks(); |
| 160 void resumePostAttachCallbacks(); | 162 void resumePostAttachCallbacks(); |
| 161 | 163 |
| 162 Node* m_firstChild; | 164 Node* m_firstChild; |
| 163 Node* m_lastChild; | 165 Node* m_lastChild; |
| (...skipping 198 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 362 m_node->resumePostAttachCallbacks(); | 364 m_node->resumePostAttachCallbacks(); |
| 363 } | 365 } |
| 364 | 366 |
| 365 private: | 367 private: |
| 366 ContainerNode* m_node; | 368 ContainerNode* m_node; |
| 367 }; | 369 }; |
| 368 | 370 |
| 369 } // namespace WebCore | 371 } // namespace WebCore |
| 370 | 372 |
| 371 #endif // ContainerNode_h | 373 #endif // ContainerNode_h |
| OLD | NEW |