| 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 2446 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2457 WillBeHeapVector<RefPtrWillBeMember<Node> > filteredInsertionPoints; | 2457 WillBeHeapVector<RefPtrWillBeMember<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); |
| 2463 } | 2463 } |
| 2464 return StaticNodeList::adopt(filteredInsertionPoints); | 2464 return StaticNodeList::adopt(filteredInsertionPoints); |
| 2465 } | 2465 } |
| 2466 | 2466 |
| 2467 void Node::registerScopedHTMLStyleChild() |
| 2468 { |
| 2469 setHasScopedHTMLStyleChild(true); |
| 2470 } |
| 2471 |
| 2472 void Node::unregisterScopedHTMLStyleChild() |
| 2473 { |
| 2474 ASSERT(hasScopedHTMLStyleChild()); |
| 2475 setHasScopedHTMLStyleChild(numberOfScopedHTMLStyleChildren()); |
| 2476 } |
| 2477 |
| 2478 size_t Node::numberOfScopedHTMLStyleChildren() const |
| 2479 { |
| 2480 size_t count = 0; |
| 2481 for (HTMLStyleElement* style = Traversal<HTMLStyleElement>::firstChild(*this
); style; style = Traversal<HTMLStyleElement>::nextSibling(*style)) { |
| 2482 if (style->isRegisteredAsScoped()) |
| 2483 ++count; |
| 2484 } |
| 2485 |
| 2486 return count; |
| 2487 } |
| 2488 |
| 2467 void Node::setFocus(bool flag) | 2489 void Node::setFocus(bool flag) |
| 2468 { | 2490 { |
| 2469 document().userActionElements().setFocused(this, flag); | 2491 document().userActionElements().setFocused(this, flag); |
| 2470 } | 2492 } |
| 2471 | 2493 |
| 2472 void Node::setActive(bool flag) | 2494 void Node::setActive(bool flag) |
| 2473 { | 2495 { |
| 2474 document().userActionElements().setActive(this, flag); | 2496 document().userActionElements().setActive(this, flag); |
| 2475 } | 2497 } |
| 2476 | 2498 |
| (...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2556 node->showTreeForThis(); | 2578 node->showTreeForThis(); |
| 2557 } | 2579 } |
| 2558 | 2580 |
| 2559 void showNodePath(const WebCore::Node* node) | 2581 void showNodePath(const WebCore::Node* node) |
| 2560 { | 2582 { |
| 2561 if (node) | 2583 if (node) |
| 2562 node->showNodePathForThis(); | 2584 node->showNodePathForThis(); |
| 2563 } | 2585 } |
| 2564 | 2586 |
| 2565 #endif | 2587 #endif |
| OLD | NEW |