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 439 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
450 last = currentElement->pseudoElement(PseudoIdBefore); | 450 last = currentElement->pseudoElement(PseudoIdBefore); |
451 return last; | 451 return last; |
452 } | 452 } |
453 | 453 |
454 return lastChild(); | 454 return lastChild(); |
455 } | 455 } |
456 | 456 |
457 Node& Node::treeRoot() const | 457 Node& Node::treeRoot() const |
458 { | 458 { |
459 if (isInTreeScope()) | 459 if (isInTreeScope()) |
460 return treeScope().rootNode(); | 460 return rootTreeScope().rootNode(); |
461 const Node* node = this; | 461 const Node* node = this; |
462 while (node->parentNode()) | 462 while (node->parentNode()) |
463 node = node->parentNode(); | 463 node = node->parentNode(); |
464 return const_cast<Node&>(*node); | 464 return const_cast<Node&>(*node); |
465 } | 465 } |
466 | 466 |
467 Node* Node::insertBefore(Node* newChild, Node* refChild, ExceptionState& excepti
onState) | 467 Node* Node::insertBefore(Node* newChild, Node* refChild, ExceptionState& excepti
onState) |
468 { | 468 { |
469 if (isContainerNode()) | 469 if (isContainerNode()) |
470 return toContainerNode(this)->insertBefore(newChild, refChild, exception
State); | 470 return toContainerNode(this)->insertBefore(newChild, refChild, exception
State); |
(...skipping 1997 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2468 | 2468 |
2469 void showNodePath(const blink::Node* node) | 2469 void showNodePath(const blink::Node* node) |
2470 { | 2470 { |
2471 if (node) | 2471 if (node) |
2472 node->showNodePathForThis(); | 2472 node->showNodePathForThis(); |
2473 else | 2473 else |
2474 fprintf(stderr, "Cannot showNodePath for (nil)\n"); | 2474 fprintf(stderr, "Cannot showNodePath for (nil)\n"); |
2475 } | 2475 } |
2476 | 2476 |
2477 #endif | 2477 #endif |
OLD | NEW |