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 356 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
367 last = currentElement->pseudoElement(PseudoIdBefore); | 367 last = currentElement->pseudoElement(PseudoIdBefore); |
368 return last; | 368 return last; |
369 } | 369 } |
370 | 370 |
371 return lastChild(); | 371 return lastChild(); |
372 } | 372 } |
373 | 373 |
374 Node& Node::treeRoot() const | 374 Node& Node::treeRoot() const |
375 { | 375 { |
376 if (isInTreeScope()) | 376 if (isInTreeScope()) |
377 return treeScope().rootNode(); | 377 return containingTreeScope().rootNode(); |
378 const Node* node = this; | 378 const Node* node = this; |
379 while (node->parentNode()) | 379 while (node->parentNode()) |
380 node = node->parentNode(); | 380 node = node->parentNode(); |
381 return const_cast<Node&>(*node); | 381 return const_cast<Node&>(*node); |
382 } | 382 } |
383 | 383 |
384 Node* Node::insertBefore(Node* newChild, Node* refChild, ExceptionState& excepti
onState) | 384 Node* Node::insertBefore(Node* newChild, Node* refChild, ExceptionState& excepti
onState) |
385 { | 385 { |
386 if (isContainerNode()) | 386 if (isContainerNode()) |
387 return toContainerNode(this)->insertBefore(newChild, refChild, exception
State); | 387 return toContainerNode(this)->insertBefore(newChild, refChild, exception
State); |
(...skipping 2109 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2497 | 2497 |
2498 void showNodePath(const blink::Node* node) | 2498 void showNodePath(const blink::Node* node) |
2499 { | 2499 { |
2500 if (node) | 2500 if (node) |
2501 node->showNodePathForThis(); | 2501 node->showNodePathForThis(); |
2502 else | 2502 else |
2503 fprintf(stderr, "Cannot showNodePath for (nil)\n"); | 2503 fprintf(stderr, "Cannot showNodePath for (nil)\n"); |
2504 } | 2504 } |
2505 | 2505 |
2506 #endif | 2506 #endif |
OLD | NEW |