| 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 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 94 } | 94 } |
| 95 bool hasChildCount(unsigned) const; | 95 bool hasChildCount(unsigned) const; |
| 96 | 96 |
| 97 HTMLCollection* children(); | 97 HTMLCollection* children(); |
| 98 | 98 |
| 99 unsigned countChildren() const; | 99 unsigned countChildren() const; |
| 100 | 100 |
| 101 Element* querySelector(const AtomicString& selectors, | 101 Element* querySelector(const AtomicString& selectors, |
| 102 ExceptionState& = ASSERT_NO_EXCEPTION); | 102 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 103 StaticElementList* querySelectorAll(const AtomicString& selectors, | 103 StaticElementList* querySelectorAll(const AtomicString& selectors, |
| 104 ExceptionState&); | 104 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 105 | 105 |
| 106 Node* insertBefore(Node* newChild, | 106 Node* insertBefore(Node* newChild, |
| 107 Node* refChild, | 107 Node* refChild, |
| 108 ExceptionState& = ASSERT_NO_EXCEPTION); | 108 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 109 Node* replaceChild(Node* newChild, | 109 Node* replaceChild(Node* newChild, |
| 110 Node* oldChild, | 110 Node* oldChild, |
| 111 ExceptionState& = ASSERT_NO_EXCEPTION); | 111 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 112 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); | 112 Node* removeChild(Node* child, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 113 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); | 113 Node* appendChild(Node* newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 114 | 114 |
| (...skipping 356 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 471 | 471 |
| 472 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) { | 472 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) { |
| 473 DCHECK(!nodes.size()); | 473 DCHECK(!nodes.size()); |
| 474 for (Node* child = node.firstChild(); child; child = child->nextSibling()) | 474 for (Node* child = node.firstChild(); child; child = child->nextSibling()) |
| 475 nodes.push_back(child); | 475 nodes.push_back(child); |
| 476 } | 476 } |
| 477 | 477 |
| 478 } // namespace blink | 478 } // namespace blink |
| 479 | 479 |
| 480 #endif // ContainerNode_h | 480 #endif // ContainerNode_h |
| OLD | NEW |