| 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 134 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 145 void setFirstChild(Node* child) { m_firstChild = child; } | 145 void setFirstChild(Node* child) { m_firstChild = child; } |
| 146 void setLastChild(Node* child) { m_lastChild = child; } | 146 void setLastChild(Node* child) { m_lastChild = child; } |
| 147 | 147 |
| 148 private: | 148 private: |
| 149 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); | 149 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); |
| 150 void insertBeforeCommon(Node& nextChild, Node& oldChild); | 150 void insertBeforeCommon(Node& nextChild, Node& oldChild); |
| 151 void updateTreeAfterInsertion(Node& child); | 151 void updateTreeAfterInsertion(Node& child); |
| 152 void willRemoveChildren(); | 152 void willRemoveChildren(); |
| 153 void willRemoveChild(Node& child); | 153 void willRemoveChild(Node& child); |
| 154 | 154 |
| 155 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const
char* method, ExceptionState&) const; | 155 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, Except
ionState&) const; |
| 156 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, con
st char* method, ExceptionState&) const; | 156 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; |
| 157 inline bool containsConsideringHostElements(const Node&) const; | 157 inline bool containsConsideringHostElements(const Node&) const; |
| 158 inline bool isChildTypeAllowed(const Node& child) const; | 158 inline bool isChildTypeAllowed(const Node& child) const; |
| 159 | 159 |
| 160 void attachChildren(const AttachContext& = AttachContext()); | 160 void attachChildren(const AttachContext& = AttachContext()); |
| 161 void detachChildren(const AttachContext& = AttachContext()); | 161 void detachChildren(const AttachContext& = AttachContext()); |
| 162 | 162 |
| 163 bool getUpperLeftCorner(FloatPoint&) const; | 163 bool getUpperLeftCorner(FloatPoint&) const; |
| 164 bool getLowerRightCorner(FloatPoint&) const; | 164 bool getLowerRightCorner(FloatPoint&) const; |
| 165 | 165 |
| 166 Node* m_firstChild; | 166 Node* m_firstChild; |
| (...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 312 | 312 |
| 313 RefPtr<Node> m_currentNode; | 313 RefPtr<Node> m_currentNode; |
| 314 unsigned m_currentIndex; | 314 unsigned m_currentIndex; |
| 315 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated. | 315 OwnPtr<Vector<RefPtr<Node> > > m_childNodes; // Lazily instantiated. |
| 316 ChildNodesLazySnapshot* m_nextSnapshot; | 316 ChildNodesLazySnapshot* m_nextSnapshot; |
| 317 }; | 317 }; |
| 318 | 318 |
| 319 } // namespace WebCore | 319 } // namespace WebCore |
| 320 | 320 |
| 321 #endif // ContainerNode_h | 321 #endif // ContainerNode_h |
| OLD | NEW |