Chromium Code Reviews| 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, 2011 Apple Inc. All r ights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All r ights reserved. |
| 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) | 6 * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies) |
| 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo bile.com/) | 7 * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmo bile.com/) |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 765 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 776 | 776 |
| 777 unsigned Node::nodeIndex() const | 777 unsigned Node::nodeIndex() const |
| 778 { | 778 { |
| 779 const Node* tempNode = previousSibling(); | 779 const Node* tempNode = previousSibling(); |
| 780 unsigned count = 0; | 780 unsigned count = 0; |
| 781 for (count = 0; tempNode; count++) | 781 for (count = 0; tempNode; count++) |
| 782 tempNode = tempNode->previousSibling(); | 782 tempNode = tempNode->previousSibling(); |
| 783 return count; | 783 return count; |
| 784 } | 784 } |
| 785 | 785 |
| 786 bool Node::isConnected() const | |
|
hayato
2016/04/04 05:32:52
I think we can use Node::inDocument() for Node.isC
yuzuchan
2016/04/04 07:09:30
Acknowledged.
I will start another CL to rename in
| |
| 787 { | |
| 788 return isInShadowTree() ? shadowHost()->treeRoot().isSameNode(ownerDocument( )) : treeRoot().isSameNode(ownerDocument()); | |
| 789 } | |
| 790 | |
| 786 NodeListsNodeData* Node::nodeLists() | 791 NodeListsNodeData* Node::nodeLists() |
| 787 { | 792 { |
| 788 return hasRareData() ? rareData()->nodeLists() : nullptr; | 793 return hasRareData() ? rareData()->nodeLists() : nullptr; |
| 789 } | 794 } |
| 790 | 795 |
| 791 void Node::clearNodeLists() | 796 void Node::clearNodeLists() |
| 792 { | 797 { |
| 793 rareData()->clearNodeLists(); | 798 rareData()->clearNodeLists(); |
| 794 } | 799 } |
| 795 | 800 |
| (...skipping 1653 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2449 | 2454 |
| 2450 void showNodePath(const blink::Node* node) | 2455 void showNodePath(const blink::Node* node) |
| 2451 { | 2456 { |
| 2452 if (node) | 2457 if (node) |
| 2453 node->showNodePathForThis(); | 2458 node->showNodePathForThis(); |
| 2454 else | 2459 else |
| 2455 fprintf(stderr, "Cannot showNodePath for (nil)\n"); | 2460 fprintf(stderr, "Cannot showNodePath for (nil)\n"); |
| 2456 } | 2461 } |
| 2457 | 2462 |
| 2458 #endif | 2463 #endif |
| OLD | NEW |