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, 2008, 2009, 2010 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010 Apple Inc. All rights
reserved. |
6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
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 367 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
378 // Like traverseNextNode, but visits parents after their children. | 378 // Like traverseNextNode, but visits parents after their children. |
379 Node* traverseNextNodePostOrder() const; | 379 Node* traverseNextNodePostOrder() const; |
380 | 380 |
381 // Like traversePreviousNode, but visits parents before their children. | 381 // Like traversePreviousNode, but visits parents before their children. |
382 Node* traversePreviousNodePostOrder(const Node* stayWithin = 0) const; | 382 Node* traversePreviousNodePostOrder(const Node* stayWithin = 0) const; |
383 Node* traversePreviousSiblingPostOrder(const Node* stayWithin = 0) const; | 383 Node* traversePreviousSiblingPostOrder(const Node* stayWithin = 0) const; |
384 | 384 |
385 void checkSetPrefix(const AtomicString& prefix, ExceptionCode&); | 385 void checkSetPrefix(const AtomicString& prefix, ExceptionCode&); |
386 bool isDescendantOf(const Node*) const; | 386 bool isDescendantOf(const Node*) const; |
387 bool contains(const Node*) const; | 387 bool contains(const Node*) const; |
| 388 bool containsIncludingShadowDOM(Node*); |
388 | 389 |
389 // This method is used to do strict error-checking when adding children via | 390 // This method is used to do strict error-checking when adding children via |
390 // the public DOM API (e.g., appendChild()). | 391 // the public DOM API (e.g., appendChild()). |
391 void checkAddChild(Node* newChild, ExceptionCode&); // Error-checking when a
dding via the DOM API | 392 void checkAddChild(Node* newChild, ExceptionCode&); // Error-checking when a
dding via the DOM API |
392 | 393 |
393 void checkReplaceChild(Node* newChild, Node* oldChild, ExceptionCode&); | 394 void checkReplaceChild(Node* newChild, Node* oldChild, ExceptionCode&); |
394 virtual bool canReplaceChild(Node* newChild, Node* oldChild); | 395 virtual bool canReplaceChild(Node* newChild, Node* oldChild); |
395 | 396 |
396 // Used to determine whether range offsets use characters or node indices. | 397 // Used to determine whether range offsets use characters or node indices. |
397 virtual bool offsetInCharacters() const; | 398 virtual bool offsetInCharacters() const; |
(...skipping 307 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
705 } | 706 } |
706 | 707 |
707 } //namespace | 708 } //namespace |
708 | 709 |
709 #ifndef NDEBUG | 710 #ifndef NDEBUG |
710 // Outside the WebCore namespace for ease of invocation from gdb. | 711 // Outside the WebCore namespace for ease of invocation from gdb. |
711 void showTree(const WebCore::Node*); | 712 void showTree(const WebCore::Node*); |
712 #endif | 713 #endif |
713 | 714 |
714 #endif | 715 #endif |
OLD | NEW |