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 2464 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2475 Vector<RefPtr<Node> > filteredInsertionPoints; | 2475 Vector<RefPtr<Node> > filteredInsertionPoints; |
2476 for (size_t i = 0; i < insertionPoints.size(); ++i) { | 2476 for (size_t i = 0; i < insertionPoints.size(); ++i) { |
2477 InsertionPoint* insertionPoint = insertionPoints[i]; | 2477 InsertionPoint* insertionPoint = insertionPoints[i]; |
2478 ASSERT(insertionPoint->containingShadowRoot()); | 2478 ASSERT(insertionPoint->containingShadowRoot()); |
2479 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) | 2479 if (insertionPoint->containingShadowRoot()->type() != ShadowRoot::UserAg
entShadowRoot) |
2480 filteredInsertionPoints.append(insertionPoint); | 2480 filteredInsertionPoints.append(insertionPoint); |
2481 } | 2481 } |
2482 return StaticNodeList::adopt(filteredInsertionPoints); | 2482 return StaticNodeList::adopt(filteredInsertionPoints); |
2483 } | 2483 } |
2484 | 2484 |
2485 void Node::registerScopedHTMLStyleChild() | |
2486 { | |
2487 setHasScopedHTMLStyleChild(true); | |
2488 } | |
2489 | |
2490 void Node::unregisterScopedHTMLStyleChild() | |
2491 { | |
2492 ASSERT(hasScopedHTMLStyleChild()); | |
2493 setHasScopedHTMLStyleChild(numberOfScopedHTMLStyleChildren()); | |
2494 } | |
2495 | |
2496 size_t Node::numberOfScopedHTMLStyleChildren() const | |
2497 { | |
2498 size_t count = 0; | |
2499 for (HTMLStyleElement* style = Traversal<HTMLStyleElement>::firstChild(*this
); style; style = Traversal<HTMLStyleElement>::nextSibling(*style)) { | |
2500 if (style->isRegisteredAsScoped()) | |
2501 ++count; | |
2502 } | |
2503 | |
2504 return count; | |
2505 } | |
2506 | |
2507 void Node::setFocus(bool flag) | 2485 void Node::setFocus(bool flag) |
2508 { | 2486 { |
2509 document().userActionElements().setFocused(this, flag); | 2487 document().userActionElements().setFocused(this, flag); |
2510 } | 2488 } |
2511 | 2489 |
2512 void Node::setActive(bool flag) | 2490 void Node::setActive(bool flag) |
2513 { | 2491 { |
2514 document().userActionElements().setActive(this, flag); | 2492 document().userActionElements().setActive(this, flag); |
2515 } | 2493 } |
2516 | 2494 |
(...skipping 79 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 |