| 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 2271 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2282 | 2282 |
| 2283 PassRefPtrWillBeRawPtr<StaticNodeList> Node::getDestinationInsertionPoints() | 2283 PassRefPtrWillBeRawPtr<StaticNodeList> Node::getDestinationInsertionPoints() |
| 2284 { | 2284 { |
| 2285 document().updateDistributionForNodeIfNeeded(this); | 2285 document().updateDistributionForNodeIfNeeded(this); |
| 2286 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; | 2286 WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8> insertionPoints; |
| 2287 collectDestinationInsertionPoints(*this, insertionPoints); | 2287 collectDestinationInsertionPoints(*this, insertionPoints); |
| 2288 WillBeHeapVector<RefPtrWillBeMember<Node>> filteredInsertionPoints; | 2288 WillBeHeapVector<RefPtrWillBeMember<Node>> filteredInsertionPoints; |
| 2289 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 2289 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
| 2290 InsertionPoint* insertionPoint = insertionPoints[i]; | 2290 InsertionPoint* insertionPoint = insertionPoints[i]; |
| 2291 ASSERT(insertionPoint->containingShadowRoot()); | 2291 ASSERT(insertionPoint->containingShadowRoot()); |
| 2292 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) | 2292 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::Closed
ShadowRoot) |
| 2293 filteredInsertionPoints.append(insertionPoint); | 2293 filteredInsertionPoints.append(insertionPoint); |
| 2294 } | 2294 } |
| 2295 return StaticNodeList::adopt(filteredInsertionPoints); | 2295 return StaticNodeList::adopt(filteredInsertionPoints); |
| 2296 } | 2296 } |
| 2297 | 2297 |
| 2298 void Node::setFocus(bool flag) | 2298 void Node::setFocus(bool flag) |
| 2299 { | 2299 { |
| 2300 document().userActionElements().setFocused(this, flag); | 2300 document().userActionElements().setFocused(this, flag); |
| 2301 } | 2301 } |
| 2302 | 2302 |
| (...skipping 135 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2438 node->showTreeForThis(); | 2438 node->showTreeForThis(); |
| 2439 } | 2439 } |
| 2440 | 2440 |
| 2441 void showNodePath(const blink::Node* node) | 2441 void showNodePath(const blink::Node* node) |
| 2442 { | 2442 { |
| 2443 if (node) | 2443 if (node) |
| 2444 node->showNodePathForThis(); | 2444 node->showNodePathForThis(); |
| 2445 } | 2445 } |
| 2446 | 2446 |
| 2447 #endif | 2447 #endif |
| OLD | NEW |