| 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, 2010, 2011 Apple Inc. All r
ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r
ights reserved. |
| 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 7 * | 7 * |
| 8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
| 9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
| 10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
| (...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 107 protected: | 107 protected: |
| 108 NodeRareDataBase(RenderObject* renderer) | 108 NodeRareDataBase(RenderObject* renderer) |
| 109 : m_renderer(renderer) | 109 : m_renderer(renderer) |
| 110 { } | 110 { } |
| 111 | 111 |
| 112 private: | 112 private: |
| 113 RenderObject* m_renderer; | 113 RenderObject* m_renderer; |
| 114 }; | 114 }; |
| 115 | 115 |
| 116 enum AttachBehavior { | 116 enum AttachBehavior { |
| 117 AttachNow, | 117 DeprecatedAttachNow, |
| 118 AttachLazily, | 118 AttachLazily, |
| 119 }; | 119 }; |
| 120 | 120 |
| 121 class Node : public EventTarget, public ScriptWrappable, public TreeShared<Node>
{ | 121 class Node : public EventTarget, public ScriptWrappable, public TreeShared<Node>
{ |
| 122 friend class Document; | 122 friend class Document; |
| 123 friend class TreeScope; | 123 friend class TreeScope; |
| 124 friend class TreeScopeAdopter; | 124 friend class TreeScopeAdopter; |
| 125 | 125 |
| 126 public: | 126 public: |
| 127 enum NodeType { | 127 enum NodeType { |
| (...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 197 Node* pseudoAwareNextSibling() const; | 197 Node* pseudoAwareNextSibling() const; |
| 198 Node* pseudoAwarePreviousSibling() const; | 198 Node* pseudoAwarePreviousSibling() const; |
| 199 Node* pseudoAwareFirstChild() const; | 199 Node* pseudoAwareFirstChild() const; |
| 200 Node* pseudoAwareLastChild() const; | 200 Node* pseudoAwareLastChild() const; |
| 201 | 201 |
| 202 virtual KURL baseURI() const; | 202 virtual KURL baseURI() const; |
| 203 | 203 |
| 204 // These should all actually return a node, but this is only important for l
anguage bindings, | 204 // These should all actually return a node, but this is only important for l
anguage bindings, |
| 205 // which will already know and hold a ref on the right node to return. Retur
ning bool allows | 205 // which will already know and hold a ref on the right node to return. Retur
ning bool allows |
| 206 // these methods to be more efficient since they don't need to return a ref | 206 // these methods to be more efficient since they don't need to return a ref |
| 207 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState&
, AttachBehavior = AttachNow); | 207 void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState&
, AttachBehavior); |
| 208 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState&
, AttachBehavior = AttachNow); | 208 void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState&
, AttachBehavior); |
| 209 void removeChild(Node* child, ExceptionState&); | 209 void removeChild(Node* child, ExceptionState&); |
| 210 void appendChild(PassRefPtr<Node> newChild, ExceptionState&, AttachBehavior
= AttachNow); | 210 void appendChild(PassRefPtr<Node> newChild, ExceptionState&, AttachBehavior)
; |
| 211 | 211 |
| 212 bool hasChildNodes() const { return firstChild(); } | 212 bool hasChildNodes() const { return firstChild(); } |
| 213 virtual PassRefPtr<Node> cloneNode(bool deep = true) = 0; | 213 virtual PassRefPtr<Node> cloneNode(bool deep = true) = 0; |
| 214 virtual const AtomicString& localName() const; | 214 virtual const AtomicString& localName() const; |
| 215 virtual const AtomicString& namespaceURI() const; | 215 virtual const AtomicString& namespaceURI() const; |
| 216 virtual const AtomicString& prefix() const; | 216 virtual const AtomicString& prefix() const; |
| 217 virtual void setPrefix(const AtomicString&, ExceptionState&); | 217 virtual void setPrefix(const AtomicString&, ExceptionState&); |
| 218 void normalize(); | 218 void normalize(); |
| 219 | 219 |
| 220 bool isSameNode(Node* other) const { return this == other; } | 220 bool isSameNode(Node* other) const { return this == other; } |
| (...skipping 714 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 935 | 935 |
| 936 } //namespace | 936 } //namespace |
| 937 | 937 |
| 938 #ifndef NDEBUG | 938 #ifndef NDEBUG |
| 939 // Outside the WebCore namespace for ease of invocation from gdb. | 939 // Outside the WebCore namespace for ease of invocation from gdb. |
| 940 void showTree(const WebCore::Node*); | 940 void showTree(const WebCore::Node*); |
| 941 void showNodePath(const WebCore::Node*); | 941 void showNodePath(const WebCore::Node*); |
| 942 #endif | 942 #endif |
| 943 | 943 |
| 944 #endif | 944 #endif |
| OLD | NEW |