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

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, 7 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
« no previous file with comments | « Source/core/dom/Node.h ('k') | Source/core/dom/PseudoElement.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
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 1690 matching lines...) Expand 10 before | Expand all | Expand 10 after
1701 if (node.isElementNode()) { 1701 if (node.isElementNode()) {
1702 const Element& element = toElement(node); 1702 const Element& element = toElement(node);
1703 if (Element* pseudo = element.pseudoElement(BEFORE)) 1703 if (Element* pseudo = element.pseudoElement(BEFORE))
1704 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1704 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1705 if (Element* pseudo = element.pseudoElement(AFTER)) 1705 if (Element* pseudo = element.pseudoElement(AFTER))
1706 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1706 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1707 if (Element* pseudo = element.pseudoElement(FIRST_LETTER)) 1707 if (Element* pseudo = element.pseudoElement(FIRST_LETTER))
1708 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1708 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1709 if (Element* pseudo = element.pseudoElement(BACKDROP)) 1709 if (Element* pseudo = element.pseudoElement(BACKDROP))
1710 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1710 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1711 if (Element* pseudo = element.pseudoElement(MARKER))
1712 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1711 } 1713 }
1712 1714
1713 if (node.isShadowRoot()) { 1715 if (node.isShadowRoot()) {
1714 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root()) 1716 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root())
1715 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2); 1717 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2);
1716 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node)) 1718 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node))
1717 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2); 1719 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2);
1718 } 1720 }
1719 } 1721 }
1720 1722
(...skipping 780 matching lines...) Expand 10 before | Expand all | Expand 10 after
2501 node->showTreeForThis(); 2503 node->showTreeForThis();
2502 } 2504 }
2503 2505
2504 void showNodePath(const blink::Node* node) 2506 void showNodePath(const blink::Node* node)
2505 { 2507 {
2506 if (node) 2508 if (node)
2507 node->showNodePathForThis(); 2509 node->showNodePathForThis();
2508 } 2510 }
2509 2511
2510 #endif 2512 #endif
OLDNEW
« no previous file with comments | « Source/core/dom/Node.h ('k') | Source/core/dom/PseudoElement.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698