Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(373)

Side by Side Diff: Source/core/dom/Node.cpp

Issue 778003003: List marker pseudo elements. (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Created 5 years, 10 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
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 1646 matching lines...) Expand 10 before | Expand all | Expand 10 after
1657 if (node.isElementNode()) { 1657 if (node.isElementNode()) {
1658 const Element& element = toElement(node); 1658 const Element& element = toElement(node);
1659 if (Element* pseudo = element.pseudoElement(BEFORE)) 1659 if (Element* pseudo = element.pseudoElement(BEFORE))
1660 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1660 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1661 if (Element* pseudo = element.pseudoElement(AFTER)) 1661 if (Element* pseudo = element.pseudoElement(AFTER))
1662 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1662 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1663 if (Element* pseudo = element.pseudoElement(FIRST_LETTER)) 1663 if (Element* pseudo = element.pseudoElement(FIRST_LETTER))
1664 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1664 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1665 if (Element* pseudo = element.pseudoElement(BACKDROP)) 1665 if (Element* pseudo = element.pseudoElement(BACKDROP))
1666 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1666 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1667 if (Element* pseudo = element.pseudoElement(MARKER))
1668 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1667 } 1669 }
1668 1670
1669 if (node.isShadowRoot()) { 1671 if (node.isShadowRoot()) {
1670 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root()) 1672 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root())
1671 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2); 1673 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2);
1672 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node)) 1674 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node))
1673 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2); 1675 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2);
1674 } 1676 }
1675 } 1677 }
1676 1678
(...skipping 758 matching lines...) Expand 10 before | Expand all | Expand 10 after
2435 node->showTreeForThis(); 2437 node->showTreeForThis();
2436 } 2438 }
2437 2439
2438 void showNodePath(const blink::Node* node) 2440 void showNodePath(const blink::Node* node)
2439 { 2441 {
2440 if (node) 2442 if (node)
2441 node->showNodePathForThis(); 2443 node->showNodePathForThis();
2442 } 2444 }
2443 2445
2444 #endif 2446 #endif
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698