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 2442 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2453 WillBeHeapVector<RefPtrWillBeMember<Node> > filteredInsertionPoints; | 2453 WillBeHeapVector<RefPtrWillBeMember<Node> > filteredInsertionPoints; |
2454 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 2454 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
2455 InsertionPoint* insertionPoint = insertionPoints[i]; | 2455 InsertionPoint* insertionPoint = insertionPoints[i]; |
2456 ASSERT(insertionPoint->containingShadowRoot()); | 2456 ASSERT(insertionPoint->containingShadowRoot()); |
2457 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) | 2457 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) |
2458 filteredInsertionPoints.append(insertionPoint); | 2458 filteredInsertionPoints.append(insertionPoint); |
2459 } | 2459 } |
2460 return StaticNodeList::adopt(filteredInsertionPoints); | 2460 return StaticNodeList::adopt(filteredInsertionPoints); |
2461 } | 2461 } |
2462 | 2462 |
2463 void Node::registerScopedHTMLStyleChild() | |
2464 { | |
2465 setHasScopedHTMLStyleChild(true); | |
2466 } | |
2467 | |
2468 void Node::unregisterScopedHTMLStyleChild() | |
2469 { | |
2470 ASSERT(hasScopedHTMLStyleChild()); | |
2471 setHasScopedHTMLStyleChild(numberOfScopedHTMLStyleChildren()); | |
2472 } | |
2473 | |
2474 size_t Node::numberOfScopedHTMLStyleChildren() const | |
2475 { | |
2476 size_t count = 0; | |
2477 for (HTMLStyleElement* style = Traversal<HTMLStyleElement>::firstChild(*this
); style; style = Traversal<HTMLStyleElement>::nextSibling(*style)) { | |
2478 if (style->isRegisteredAsScoped()) | |
2479 ++count; | |
2480 } | |
2481 | |
2482 return count; | |
2483 } | |
2484 | |
2485 void Node::setFocus(bool flag) | 2463 void Node::setFocus(bool flag) |
2486 { | 2464 { |
2487 document().userActionElements().setFocused(this, flag); | 2465 document().userActionElements().setFocused(this, flag); |
2488 } | 2466 } |
2489 | 2467 |
2490 void Node::setActive(bool flag) | 2468 void Node::setActive(bool flag) |
2491 { | 2469 { |
2492 document().userActionElements().setActive(this, flag); | 2470 document().userActionElements().setActive(this, flag); |
2493 } | 2471 } |
2494 | 2472 |
(...skipping 101 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2596 node->showTreeForThis(); | 2574 node->showTreeForThis(); |
2597 } | 2575 } |
2598 | 2576 |
2599 void showNodePath(const WebCore::Node* node) | 2577 void showNodePath(const WebCore::Node* node) |
2600 { | 2578 { |
2601 if (node) | 2579 if (node) |
2602 node->showNodePathForThis(); | 2580 node->showNodePathForThis(); |
2603 } | 2581 } |
2604 | 2582 |
2605 #endif | 2583 #endif |
OLD | NEW |