| 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 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 // They don't send DOM mutation events or accept DocumentFragments. | 102 // They don't send DOM mutation events or accept DocumentFragments. |
| 103 void parserAppendChild(Node*); | 103 void parserAppendChild(Node*); |
| 104 void parserRemoveChild(Node&); | 104 void parserRemoveChild(Node&); |
| 105 void parserInsertBefore(Node* newChild, Node& refChild); | 105 void parserInsertBefore(Node* newChild, Node& refChild); |
| 106 void parserTakeAllChildrenFrom(ContainerNode&); | 106 void parserTakeAllChildrenFrom(ContainerNode&); |
| 107 | 107 |
| 108 void removeChildren(SubtreeModificationAction = DispatchSubtreeModifiedEvent
); | 108 void removeChildren(SubtreeModificationAction = DispatchSubtreeModifiedEvent
); |
| 109 | 109 |
| 110 void cloneChildNodes(ContainerNode* clone); | 110 void cloneChildNodes(ContainerNode* clone); |
| 111 | 111 |
| 112 void attach(const AttachContext& = AttachContext()) override; | 112 void attachLayoutTree(const AttachContext& = AttachContext()) override; |
| 113 void detach(const AttachContext& = AttachContext()) override; | 113 void detach(const AttachContext& = AttachContext()) override; |
| 114 LayoutRect boundingBox() const final; | 114 LayoutRect boundingBox() const final; |
| 115 void setFocus(bool) override; | 115 void setFocus(bool) override; |
| 116 void focusStateChanged(); | 116 void focusStateChanged(); |
| 117 void setActive(bool = true) override; | 117 void setActive(bool = true) override; |
| 118 void setHovered(bool = true) override; | 118 void setHovered(bool = true) override; |
| 119 | 119 |
| 120 bool childrenOrSiblingsAffectedByFocus() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByFocus); } | 120 bool childrenOrSiblingsAffectedByFocus() const { return hasRestyleFlag(Child
renOrSiblingsAffectedByFocus); } |
| 121 void setChildrenOrSiblingsAffectedByFocus() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByFocus); } | 121 void setChildrenOrSiblingsAffectedByFocus() { setRestyleFlag(ChildrenOrSibli
ngsAffectedByFocus); } |
| 122 | 122 |
| (...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 338 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 338 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
| 339 { | 339 { |
| 340 DCHECK(!nodes.size()); | 340 DCHECK(!nodes.size()); |
| 341 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 341 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 342 nodes.append(child); | 342 nodes.append(child); |
| 343 } | 343 } |
| 344 | 344 |
| 345 } // namespace blink | 345 } // namespace blink |
| 346 | 346 |
| 347 #endif // ContainerNode_h | 347 #endif // ContainerNode_h |
| OLD | NEW |