| 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 239 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 250 void notifyNodeInserted(Node&, ChildrenChangeSource = ChildrenChangeSourceAP
I); | 250 void notifyNodeInserted(Node&, ChildrenChangeSource = ChildrenChangeSourceAP
I); |
| 251 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification
Targets); | 251 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification
Targets); |
| 252 void notifyNodeRemoved(Node&); | 252 void notifyNodeRemoved(Node&); |
| 253 | 253 |
| 254 bool hasRestyleFlag(DynamicRestyleFlags mask) const { return hasRareData() &
& hasRestyleFlagInternal(mask); } | 254 bool hasRestyleFlag(DynamicRestyleFlags mask) const { return hasRareData() &
& hasRestyleFlagInternal(mask); } |
| 255 bool hasRestyleFlags() const { return hasRareData() && hasRestyleFlagsIntern
al(); } | 255 bool hasRestyleFlags() const { return hasRareData() && hasRestyleFlagsIntern
al(); } |
| 256 void setRestyleFlag(DynamicRestyleFlags); | 256 void setRestyleFlag(DynamicRestyleFlags); |
| 257 bool hasRestyleFlagInternal(DynamicRestyleFlags) const; | 257 bool hasRestyleFlagInternal(DynamicRestyleFlags) const; |
| 258 bool hasRestyleFlagsInternal() const; | 258 bool hasRestyleFlagsInternal() const; |
| 259 | 259 |
| 260 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, Except
ionState&) const; | 260 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const
Node* oldChild, ExceptionState&) const; |
| 261 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; | 261 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; |
| 262 inline bool checkParserAcceptChild(const Node& newChild) const; | 262 inline bool checkParserAcceptChild(const Node& newChild) const; |
| 263 inline bool containsConsideringHostElements(const Node&) const; | 263 inline bool containsConsideringHostElements(const Node&) const; |
| 264 inline bool isChildTypeAllowed(const Node& child) const; | 264 inline bool isChildTypeAllowed(const Node& child) const; |
| 265 | 265 |
| 266 void attachChildren(const AttachContext& = AttachContext()); | 266 void attachChildren(const AttachContext& = AttachContext()); |
| 267 void detachChildren(const AttachContext& = AttachContext()); | 267 void detachChildren(const AttachContext& = AttachContext()); |
| 268 | 268 |
| 269 bool getUpperLeftCorner(FloatPoint&) const; | 269 bool getUpperLeftCorner(FloatPoint&) const; |
| 270 bool getLowerRightCorner(FloatPoint&) const; | 270 bool getLowerRightCorner(FloatPoint&) const; |
| (...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 367 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 367 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
| 368 { | 368 { |
| 369 ASSERT(!nodes.size()); | 369 ASSERT(!nodes.size()); |
| 370 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 370 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 371 nodes.append(child); | 371 nodes.append(child); |
| 372 } | 372 } |
| 373 | 373 |
| 374 } // namespace blink | 374 } // namespace blink |
| 375 | 375 |
| 376 #endif // ContainerNode_h | 376 #endif // ContainerNode_h |
| OLD | NEW |