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 255 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
266 bool getLowerRightCorner(FloatPoint&) const; | 266 bool getLowerRightCorner(FloatPoint&) const; |
267 | 267 |
268 RawPtrWillBeMember<Node> m_firstChild; | 268 RawPtrWillBeMember<Node> m_firstChild; |
269 RawPtrWillBeMember<Node> m_lastChild; | 269 RawPtrWillBeMember<Node> m_lastChild; |
270 }; | 270 }; |
271 | 271 |
272 #if ENABLE(ASSERT) | 272 #if ENABLE(ASSERT) |
273 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); | 273 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); |
274 #endif | 274 #endif |
275 | 275 |
| 276 WILL_NOT_BE_EAGERLY_TRACED_CLASS(ContainerNode); |
| 277 |
276 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); | 278 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); |
277 | 279 |
278 inline bool ContainerNode::hasChildCount(unsigned count) const | 280 inline bool ContainerNode::hasChildCount(unsigned count) const |
279 { | 281 { |
280 Node* child = m_firstChild; | 282 Node* child = m_firstChild; |
281 while (count && child) { | 283 while (count && child) { |
282 child = child->nextSibling(); | 284 child = child->nextSibling(); |
283 --count; | 285 --count; |
284 } | 286 } |
285 return !count && !child; | 287 return !count && !child; |
(...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
354 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 356 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
355 { | 357 { |
356 ASSERT(!nodes.size()); | 358 ASSERT(!nodes.size()); |
357 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 359 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
358 nodes.append(child); | 360 nodes.append(child); |
359 } | 361 } |
360 | 362 |
361 } // namespace blink | 363 } // namespace blink |
362 | 364 |
363 #endif // ContainerNode_h | 365 #endif // ContainerNode_h |
OLD | NEW |