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 301 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
312 { | 312 { |
313 ContainerNode* parent = parentNode(); | 313 ContainerNode* parent = parentNode(); |
314 return parent && (parent->isElementNode() || parent->isDocumentFragment()) ?
parent : 0; | 314 return parent && (parent->isElementNode() || parent->isDocumentFragment()) ?
parent : 0; |
315 } | 315 } |
316 | 316 |
317 inline bool Node::isTreeScope() const | 317 inline bool Node::isTreeScope() const |
318 { | 318 { |
319 return &treeScope().rootNode() == this; | 319 return &treeScope().rootNode() == this; |
320 } | 320 } |
321 | 321 |
322 inline void getChildNodes(Node& node, NodeVector& nodes) | 322 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
323 { | 323 { |
324 ASSERT(!nodes.size()); | 324 ASSERT(!nodes.size()); |
325 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 325 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
326 nodes.append(child); | 326 nodes.append(child); |
327 } | 327 } |
328 | 328 |
329 } // namespace blink | 329 } // namespace blink |
330 | 330 |
331 #endif // ContainerNode_h | 331 #endif // ContainerNode_h |
OLD | NEW |