| 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 | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All |
| 6 * rights reserved. | 6 * rights reserved. |
| 7 * | 7 * |
| 8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
| 9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
| 10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
| (...skipping 442 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 453 : nullptr; | 453 : nullptr; |
| 454 } | 454 } |
| 455 | 455 |
| 456 inline bool Node::isTreeScope() const { | 456 inline bool Node::isTreeScope() const { |
| 457 return &treeScope().rootNode() == this; | 457 return &treeScope().rootNode() == this; |
| 458 } | 458 } |
| 459 | 459 |
| 460 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) { | 460 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) { |
| 461 DCHECK(!nodes.size()); | 461 DCHECK(!nodes.size()); |
| 462 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 462 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 463 nodes.append(child); | 463 nodes.push_back(child); |
| 464 } | 464 } |
| 465 | 465 |
| 466 } // namespace blink | 466 } // namespace blink |
| 467 | 467 |
| 468 #endif // ContainerNode_h | 468 #endif // ContainerNode_h |
| OLD | NEW |