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

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

Issue 571603003: Convert first letter into a pseudo element. (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Created 6 years, 2 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 1670 matching lines...) Expand 10 before | Expand all | Expand 10 after
1681 fprintf(stderr, "%s", indent.toString().utf8().data()); 1681 fprintf(stderr, "%s", indent.toString().utf8().data());
1682 node->showNode(); 1682 node->showNode();
1683 indent.append('\t'); 1683 indent.append('\t');
1684 1684
1685 if (node->isElementNode()) { 1685 if (node->isElementNode()) {
1686 const Element* element = toElement(node); 1686 const Element* element = toElement(node);
1687 if (Element* pseudo = element->pseudoElement(BEFORE)) 1687 if (Element* pseudo = element->pseudoElement(BEFORE))
1688 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1688 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1689 if (Element* pseudo = element->pseudoElement(AFTER)) 1689 if (Element* pseudo = element->pseudoElement(AFTER))
1690 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1690 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1691 if (Element* pseudo = element->pseudoElement(FIRST_LETTER))
1692 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1691 if (Element* pseudo = element->pseudoElement(BACKDROP)) 1693 if (Element* pseudo = element->pseudoElement(BACKDROP))
1692 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2); 1694 traverseTreeAndMark(indent.toString(), pseudo, markedNode1, mark edLabel1, markedNode2, markedLabel2);
1693 } 1695 }
1694 1696
1695 if (node->isShadowRoot()) { 1697 if (node->isShadowRoot()) {
1696 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node)->youngerShado wRoot()) 1698 if (ShadowRoot* youngerShadowRoot = toShadowRoot(node)->youngerShado wRoot())
1697 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2); 1699 traverseTreeAndMark(indent.toString(), youngerShadowRoot, marked Node1, markedLabel1, markedNode2, markedLabel2);
1698 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(node)) 1700 } else if (ShadowRoot* oldestShadowRoot = oldestShadowRootFor(node))
1699 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2); 1701 traverseTreeAndMark(indent.toString(), oldestShadowRoot, markedNode1 , markedLabel1, markedNode2, markedLabel2);
1700 } 1702 }
(...skipping 762 matching lines...) Expand 10 before | Expand all | Expand 10 after
2463 node->showTreeForThis(); 2465 node->showTreeForThis();
2464 } 2466 }
2465 2467
2466 void showNodePath(const blink::Node* node) 2468 void showNodePath(const blink::Node* node)
2467 { 2469 {
2468 if (node) 2470 if (node)
2469 node->showNodePathForThis(); 2471 node->showNodePathForThis();
2470 } 2472 }
2471 2473
2472 #endif 2474 #endif
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698