| 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 314 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 325 } | 325 } |
| 326 | 326 |
| 327 inline ContainerNode* Node::parentElementOrDocumentFragment() const | 327 inline ContainerNode* Node::parentElementOrDocumentFragment() const |
| 328 { | 328 { |
| 329 ContainerNode* parent = parentNode(); | 329 ContainerNode* parent = parentNode(); |
| 330 return parent && (parent->isElementNode() || parent->isDocumentFragment()) ?
parent : nullptr; | 330 return parent && (parent->isElementNode() || parent->isDocumentFragment()) ?
parent : nullptr; |
| 331 } | 331 } |
| 332 | 332 |
| 333 inline bool Node::isTreeScope() const | 333 inline bool Node::isTreeScope() const |
| 334 { | 334 { |
| 335 return &treeScope().rootNode() == this; | 335 return &treeScopeOrDocument().rootNode() == this; |
| 336 } | 336 } |
| 337 | 337 |
| 338 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) | 338 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) |
| 339 { | 339 { |
| 340 DCHECK(!nodes.size()); | 340 DCHECK(!nodes.size()); |
| 341 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 341 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 342 nodes.append(child); | 342 nodes.append(child); |
| 343 } | 343 } |
| 344 | 344 |
| 345 } // namespace blink | 345 } // namespace blink |
| 346 | 346 |
| 347 #endif // ContainerNode_h | 347 #endif // ContainerNode_h |
| OLD | NEW |