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 357 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
368 String Node::nodeValue() const | 368 String Node::nodeValue() const |
369 { | 369 { |
370 return String(); | 370 return String(); |
371 } | 371 } |
372 | 372 |
373 void Node::setNodeValue(const String&) | 373 void Node::setNodeValue(const String&) |
374 { | 374 { |
375 // By default, setting nodeValue has no effect. | 375 // By default, setting nodeValue has no effect. |
376 } | 376 } |
377 | 377 |
378 PassRefPtr<NodeList> Node::childNodes() | 378 PassRefPtrWillBeRawPtr<NodeList> Node::childNodes() |
379 { | 379 { |
380 if (isContainerNode()) | 380 if (isContainerNode()) |
381 return ensureRareData().ensureNodeLists().ensureChildNodeList(toContaine
rNode(*this)); | 381 return ensureRareData().ensureNodeLists().ensureChildNodeList(toContaine
rNode(*this)); |
382 return ensureRareData().ensureNodeLists().ensureEmptyChildNodeList(*this); | 382 return ensureRareData().ensureNodeLists().ensureEmptyChildNodeList(*this); |
383 } | 383 } |
384 | 384 |
385 Node& Node::lastDescendantOrSelf() const | 385 Node& Node::lastDescendantOrSelf() const |
386 { | 386 { |
387 Node* n = const_cast<Node*>(this); | 387 Node* n = const_cast<Node*>(this); |
388 while (n && n->lastChild()) | 388 while (n && n->lastChild()) |
(...skipping 2053 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2442 { | 2442 { |
2443 unsigned count = connectedSubframeCount(); | 2443 unsigned count = connectedSubframeCount(); |
2444 | 2444 |
2445 if (!count) | 2445 if (!count) |
2446 return; | 2446 return; |
2447 | 2447 |
2448 for (Node* node = parentOrShadowHostNode(); node; node = node->parentOrShado
wHostNode()) | 2448 for (Node* node = parentOrShadowHostNode(); node; node = node->parentOrShado
wHostNode()) |
2449 node->incrementConnectedSubframeCount(count); | 2449 node->incrementConnectedSubframeCount(count); |
2450 } | 2450 } |
2451 | 2451 |
2452 PassRefPtr<NodeList> Node::getDestinationInsertionPoints() | 2452 PassRefPtrWillBeRawPtr<NodeList> Node::getDestinationInsertionPoints() |
2453 { | 2453 { |
2454 document().updateDistributionForNodeIfNeeded(this); | 2454 document().updateDistributionForNodeIfNeeded(this); |
2455 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; | 2455 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; |
2456 collectDestinationInsertionPoints(*this, insertionPoints); | 2456 collectDestinationInsertionPoints(*this, insertionPoints); |
2457 Vector<RefPtr<Node> > filteredInsertionPoints; | 2457 Vector<RefPtr<Node> > filteredInsertionPoints; |
2458 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 2458 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
2459 InsertionPoint* insertionPoint = insertionPoints[i]; | 2459 InsertionPoint* insertionPoint = insertionPoints[i]; |
2460 ASSERT(insertionPoint->containingShadowRoot()); | 2460 ASSERT(insertionPoint->containingShadowRoot()); |
2461 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) | 2461 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) |
2462 filteredInsertionPoints.append(insertionPoint); | 2462 filteredInsertionPoints.append(insertionPoint); |
(...skipping 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2578 node->showTreeForThis(); | 2578 node->showTreeForThis(); |
2579 } | 2579 } |
2580 | 2580 |
2581 void showNodePath(const WebCore::Node* node) | 2581 void showNodePath(const WebCore::Node* node) |
2582 { | 2582 { |
2583 if (node) | 2583 if (node) |
2584 node->showNodePathForThis(); | 2584 node->showNodePathForThis(); |
2585 } | 2585 } |
2586 | 2586 |
2587 #endif | 2587 #endif |
OLD | NEW |