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 241 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
252 | 252 |
253 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const
Node* oldChild, ExceptionState&) const; | 253 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const
Node* oldChild, ExceptionState&) const; |
254 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; | 254 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc
eptionState&) const; |
255 inline bool checkParserAcceptChild(const Node& newChild) const; | 255 inline bool checkParserAcceptChild(const Node& newChild) const; |
256 inline bool containsConsideringHostElements(const Node&) const; | 256 inline bool containsConsideringHostElements(const Node&) const; |
257 inline bool isChildTypeAllowed(const Node& child) const; | 257 inline bool isChildTypeAllowed(const Node& child) const; |
258 | 258 |
259 bool getUpperLeftCorner(FloatPoint&) const; | 259 bool getUpperLeftCorner(FloatPoint&) const; |
260 bool getLowerRightCorner(FloatPoint&) const; | 260 bool getLowerRightCorner(FloatPoint&) const; |
261 | 261 |
| 262 static bool shouldNotUpdateRangesAfterChildrenChanged(const ChildrenChange&)
; |
| 263 |
262 Member<Node> m_firstChild; | 264 Member<Node> m_firstChild; |
263 Member<Node> m_lastChild; | 265 Member<Node> m_lastChild; |
264 }; | 266 }; |
265 | 267 |
266 #if DCHECK_IS_ON() | 268 #if DCHECK_IS_ON() |
267 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); | 269 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); |
268 #endif | 270 #endif |
269 | 271 |
270 WILL_NOT_BE_EAGERLY_TRACED_CLASS(ContainerNode); | 272 WILL_NOT_BE_EAGERLY_TRACED_CLASS(ContainerNode); |
271 | 273 |
(...skipping 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
336 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 338 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
337 { | 339 { |
338 DCHECK(!nodes.size()); | 340 DCHECK(!nodes.size()); |
339 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 341 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
340 nodes.append(child); | 342 nodes.append(child); |
341 } | 343 } |
342 | 344 |
343 } // namespace blink | 345 } // namespace blink |
344 | 346 |
345 #endif // ContainerNode_h | 347 #endif // ContainerNode_h |
OLD | NEW |