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 200 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
211 void attachChildren(const AttachContext& = AttachContext()); | 211 void attachChildren(const AttachContext& = AttachContext()); |
212 void detachChildren(const AttachContext& = AttachContext()); | 212 void detachChildren(const AttachContext& = AttachContext()); |
213 | 213 |
214 bool getUpperLeftCorner(FloatPoint&) const; | 214 bool getUpperLeftCorner(FloatPoint&) const; |
215 bool getLowerRightCorner(FloatPoint&) const; | 215 bool getLowerRightCorner(FloatPoint&) const; |
216 | 216 |
217 RawPtrWillBeMember<Node> m_firstChild; | 217 RawPtrWillBeMember<Node> m_firstChild; |
218 RawPtrWillBeMember<Node> m_lastChild; | 218 RawPtrWillBeMember<Node> m_lastChild; |
219 }; | 219 }; |
220 | 220 |
221 #ifndef NDEBUG | 221 #if ENABLE(ASSERT) |
222 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); | 222 bool childAttachedAllowedWhenAttachingChildren(ContainerNode*); |
223 #endif | 223 #endif |
224 | 224 |
225 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); | 225 DEFINE_NODE_TYPE_CASTS(ContainerNode, isContainerNode()); |
226 | 226 |
227 inline bool ContainerNode::hasChildCount(unsigned count) const | 227 inline bool ContainerNode::hasChildCount(unsigned count) const |
228 { | 228 { |
229 Node* child = m_firstChild; | 229 Node* child = m_firstChild; |
230 while (count && child) { | 230 while (count && child) { |
231 child = child->nextSibling(); | 231 child = child->nextSibling(); |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
319 inline void getChildNodes(Node& node, NodeVector& nodes) | 319 inline void getChildNodes(Node& node, NodeVector& nodes) |
320 { | 320 { |
321 ASSERT(!nodes.size()); | 321 ASSERT(!nodes.size()); |
322 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 322 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
323 nodes.append(child); | 323 nodes.append(child); |
324 } | 324 } |
325 | 325 |
326 } // namespace WebCore | 326 } // namespace WebCore |
327 | 327 |
328 #endif // ContainerNode_h | 328 #endif // ContainerNode_h |
OLD | NEW |