| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2007, 2008 Nikolas Zimmermann <zimmermann@kde.org> | 2 * Copyright (C) 2007, 2008 Nikolas Zimmermann <zimmermann@kde.org> |
| 3 * Copyright (C) 2011 Torch Mobile (Beijing) Co. Ltd. All rights reserved. | 3 * Copyright (C) 2011 Torch Mobile (Beijing) Co. Ltd. All rights reserved. |
| 4 * | 4 * |
| 5 * This library is free software; you can redistribute it and/or | 5 * This library is free software; you can redistribute it and/or |
| 6 * modify it under the terms of the GNU Library General Public | 6 * modify it under the terms of the GNU Library General Public |
| 7 * License as published by the Free Software Foundation; either | 7 * License as published by the Free Software Foundation; either |
| 8 * version 2 of the License, or (at your option) any later version. | 8 * version 2 of the License, or (at your option) any later version. |
| 9 * | 9 * |
| 10 * This library is distributed in the hope that it will be useful, | 10 * This library is distributed in the hope that it will be useful, |
| (...skipping 156 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 167 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, Generi
cNode*& tail, GenericNodeContainer* container); | 167 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, Generi
cNode*& tail, GenericNodeContainer* container); |
| 168 | 168 |
| 169 bool hasChildNodes() const { return m_firstChild; } | 169 bool hasChildNodes() const { return m_firstChild; } |
| 170 | 170 |
| 171 void setFirstChild(SVGElementInstance* child) { m_firstChild = child; } | 171 void setFirstChild(SVGElementInstance* child) { m_firstChild = child; } |
| 172 void setLastChild(SVGElementInstance* child) { m_lastChild = child; } | 172 void setLastChild(SVGElementInstance* child) { m_lastChild = child; } |
| 173 | 173 |
| 174 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling;
} | 174 void setNextSibling(SVGElementInstance* sibling) { m_nextSibling = sibling;
} |
| 175 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = s
ibling; } | 175 void setPreviousSibling(SVGElementInstance* sibling) { m_previousSibling = s
ibling; } |
| 176 | 176 |
| 177 virtual void refEventTarget() { ref(); } | 177 virtual void refEventTarget() OVERRIDE { ref(); } |
| 178 virtual void derefEventTarget() { deref(); } | 178 virtual void derefEventTarget() OVERRIDE { deref(); } |
| 179 virtual EventTargetData* eventTargetData(); | 179 virtual EventTargetData* eventTargetData() OVERRIDE; |
| 180 virtual EventTargetData* ensureEventTargetData(); | 180 virtual EventTargetData& ensureEventTargetData() OVERRIDE; |
| 181 | 181 |
| 182 SVGElementInstance* m_parentInstance; | 182 SVGElementInstance* m_parentInstance; |
| 183 | 183 |
| 184 SVGUseElement* m_correspondingUseElement; | 184 SVGUseElement* m_correspondingUseElement; |
| 185 SVGUseElement* m_directUseElement; | 185 SVGUseElement* m_directUseElement; |
| 186 RefPtr<SVGElement> m_element; | 186 RefPtr<SVGElement> m_element; |
| 187 RefPtr<SVGElement> m_shadowTreeElement; | 187 RefPtr<SVGElement> m_shadowTreeElement; |
| 188 | 188 |
| 189 SVGElementInstance* m_previousSibling; | 189 SVGElementInstance* m_previousSibling; |
| 190 SVGElementInstance* m_nextSibling; | 190 SVGElementInstance* m_nextSibling; |
| 191 | 191 |
| 192 SVGElementInstance* m_firstChild; | 192 SVGElementInstance* m_firstChild; |
| 193 SVGElementInstance* m_lastChild; | 193 SVGElementInstance* m_lastChild; |
| 194 }; | 194 }; |
| 195 | 195 |
| 196 } // namespace WebCore | 196 } // namespace WebCore |
| 197 | 197 |
| 198 #endif | 198 #endif |
| OLD | NEW |