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 85 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
96 // They don't send DOM mutation events or handle reparenting. | 96 // They don't send DOM mutation events or handle reparenting. |
97 void parserAppendChild(PassRefPtrWillBeRawPtr<Node>); | 97 void parserAppendChild(PassRefPtrWillBeRawPtr<Node>); |
98 void parserRemoveChild(Node&); | 98 void parserRemoveChild(Node&); |
99 void parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node& refChil
d); | 99 void parserInsertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node& refChil
d); |
100 void parserTakeAllChildrenFrom(ContainerNode&); | 100 void parserTakeAllChildrenFrom(ContainerNode&); |
101 | 101 |
102 void removeChildren(); | 102 void removeChildren(); |
103 | 103 |
104 void cloneChildNodes(ContainerNode* clone); | 104 void cloneChildNodes(ContainerNode* clone); |
105 | 105 |
106 virtual void attach(const AttachContext& = AttachContext()) OVERRIDE; | 106 virtual void attach(const AttachContext& = AttachContext()) override; |
107 virtual void detach(const AttachContext& = AttachContext()) OVERRIDE; | 107 virtual void detach(const AttachContext& = AttachContext()) override; |
108 virtual LayoutRect boundingBox() const OVERRIDE FINAL; | 108 virtual LayoutRect boundingBox() const override final; |
109 virtual void setFocus(bool) OVERRIDE; | 109 virtual void setFocus(bool) override; |
110 void focusStateChanged(); | 110 void focusStateChanged(); |
111 virtual void setActive(bool = true) OVERRIDE; | 111 virtual void setActive(bool = true) override; |
112 virtual void setHovered(bool = true) OVERRIDE; | 112 virtual void setHovered(bool = true) override; |
113 | 113 |
114 bool childrenOrSiblingsAffectedByFocus() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByFocus); } | 114 bool childrenOrSiblingsAffectedByFocus() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByFocus); } |
115 void setChildrenOrSiblingsAffectedByFocus() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByFocus); } | 115 void setChildrenOrSiblingsAffectedByFocus() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByFocus); } |
116 | 116 |
117 bool childrenOrSiblingsAffectedByHover() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByHover); } | 117 bool childrenOrSiblingsAffectedByHover() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByHover); } |
118 void setChildrenOrSiblingsAffectedByHover() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByHover); } | 118 void setChildrenOrSiblingsAffectedByHover() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByHover); } |
119 | 119 |
120 bool childrenOrSiblingsAffectedByActive() const { return hasRestyleFlag(Chil
drenOrSiblingsAffectedByActive); } | 120 bool childrenOrSiblingsAffectedByActive() const { return hasRestyleFlag(Chil
drenOrSiblingsAffectedByActive); } |
121 void setChildrenOrSiblingsAffectedByActive() { setRestyleFlag(ChildrenOrSibl
ingsAffectedByActive); } | 121 void setChildrenOrSiblingsAffectedByActive() { setRestyleFlag(ChildrenOrSibl
ingsAffectedByActive); } |
122 | 122 |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
191 RawPtrWillBeMember<Node> siblingAfterChange; | 191 RawPtrWillBeMember<Node> siblingAfterChange; |
192 ChildrenChangeSource byParser; | 192 ChildrenChangeSource byParser; |
193 }; | 193 }; |
194 | 194 |
195 // Notifies the node that it's list of children have changed (either by addi
ng or removing child nodes), or a child | 195 // Notifies the node that it's list of children have changed (either by addi
ng or removing child nodes), or a child |
196 // node that is of the type CDATA_SECTION_NODE, TEXT_NODE or COMMENT_NODE ha
s changed its value. | 196 // node that is of the type CDATA_SECTION_NODE, TEXT_NODE or COMMENT_NODE ha
s changed its value. |
197 virtual void childrenChanged(const ChildrenChange&); | 197 virtual void childrenChanged(const ChildrenChange&); |
198 | 198 |
199 void disconnectDescendantFrames(); | 199 void disconnectDescendantFrames(); |
200 | 200 |
201 virtual void trace(Visitor*) OVERRIDE; | 201 virtual void trace(Visitor*) override; |
202 | 202 |
203 protected: | 203 protected: |
204 ContainerNode(TreeScope*, ConstructionType = CreateContainer); | 204 ContainerNode(TreeScope*, ConstructionType = CreateContainer); |
205 | 205 |
206 void invalidateNodeListCachesInAncestors(const QualifiedName* attrName = 0,
Element* attributeOwnerElement = 0); | 206 void invalidateNodeListCachesInAncestors(const QualifiedName* attrName = 0,
Element* attributeOwnerElement = 0); |
207 | 207 |
208 #if !ENABLE(OILPAN) | 208 #if !ENABLE(OILPAN) |
209 void removeDetachedChildren(); | 209 void removeDetachedChildren(); |
210 #endif | 210 #endif |
211 | 211 |
(...skipping 130 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
342 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 342 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
343 { | 343 { |
344 ASSERT(!nodes.size()); | 344 ASSERT(!nodes.size()); |
345 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 345 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
346 nodes.append(child); | 346 nodes.append(child); |
347 } | 347 } |
348 | 348 |
349 } // namespace blink | 349 } // namespace blink |
350 | 350 |
351 #endif // ContainerNode_h | 351 #endif // ContainerNode_h |
OLD | NEW |