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

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

Issue 672953002: Convert first letter into a pseudo element. (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Created 6 years, 1 month 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/Position.cpp » ('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 1666 matching lines...) Expand 10 before | Expand all | Expand 10 after
1677 fprintf(stderr, "%s", indent.toString().utf8().data()); 1677 fprintf(stderr, "%s", indent.toString().utf8().data());
1678 node.showNode(); 1678 node.showNode();
1679 indent.append('\t'); 1679 indent.append('\t');
1680 1680
1681 if (node.isElementNode()) { 1681 if (node.isElementNode()) {
1682 const Element& element = toElement(node); 1682 const Element& element = toElement(node);
1683 if (Element* pseudo = element.pseudoElement(BEFORE)) 1683 if (Element* pseudo = element.pseudoElement(BEFORE))
1684 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1684 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1685 if (Element* pseudo = element.pseudoElement(AFTER)) 1685 if (Element* pseudo = element.pseudoElement(AFTER))
1686 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1686 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1687 if (Element* pseudo = element.pseudoElement(FIRST_LETTER))
1688 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1687 if (Element* pseudo = element.pseudoElement(BACKDROP)) 1689 if (Element* pseudo = element.pseudoElement(BACKDROP))
1688 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1690 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1689 } 1691 }
1690 1692
1691 if (node.isShadowRoot()) { 1693 if (node.isShadowRoot()) {
1692 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root()) 1694 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node).youngerShadow Root())
1693 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2); 1695 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2);
1694 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node)) 1696 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(&node))
1695 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2); 1697 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2);
1696 } 1698 }
(...skipping 760 matching lines...) Expand 10 before | Expand all | Expand 10 after
2457 node->showTreeForThis(); 2459 node->showTreeForThis();
2458 } 2460 }
2459 2461
2460 void showNodePath(const blink::Node* node) 2462 void showNodePath(const blink::Node* node)
2461 { 2463 {
2462 if (node) 2464 if (node)
2463 node->showNodePathForThis(); 2465 node->showNodePathForThis();
2464 } 2466 }
2465 2467
2466 #endif 2468 #endif
OLDNEW
« no previous file with comments | « Source/core/dom/Node.h ('k') | Source/core/dom/Position.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698