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

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

Issue 23133006: Merge ContentDistributor into ElementShadow (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Don't find git copies Created 7 years, 4 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 * Copyright (C) 2012 Google Inc. All rights reserved. 8 * Copyright (C) 2012 Google Inc. All rights reserved.
9 * 9 *
10 * This library is free software; you can redistribute it and/or 10 * This library is free software; you can redistribute it and/or
(...skipping 10 matching lines...) Expand all
21 * along with this library; see the file COPYING.LIB. If not, write to 21 * along with this library; see the file COPYING.LIB. If not, write to
22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, 22 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
23 * Boston, MA 02110-1301, USA. 23 * Boston, MA 02110-1301, USA.
24 */ 24 */
25 25
26 #include "config.h" 26 #include "config.h"
27 #include "core/dom/ContainerNodeAlgorithms.h" 27 #include "core/dom/ContainerNodeAlgorithms.h"
28 28
29 #include "core/dom/Element.h" 29 #include "core/dom/Element.h"
30 #include "core/dom/shadow/ElementShadow.h" 30 #include "core/dom/shadow/ElementShadow.h"
31 #include "core/dom/shadow/ShadowRoot.h"
31 #include "core/html/HTMLFrameOwnerElement.h" 32 #include "core/html/HTMLFrameOwnerElement.h"
32 33
33 namespace WebCore { 34 namespace WebCore {
34 35
36 class ShadowRootVector : public Vector<RefPtr<ShadowRoot> > {
37 public:
38 explicit ShadowRootVector(ElementShadow* tree)
39 {
40 for (ShadowRoot* root = tree->youngestShadowRoot(); root; root = root->o lderShadowRoot())
41 append(root);
42 }
43 };
44
35 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN ode* node) 45 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN ode* node)
36 { 46 {
37 ChildNodesLazySnapshot snapshot(node); 47 ChildNodesLazySnapshot snapshot(node);
38 while (RefPtr<Node> child = snapshot.nextNode()) { 48 while (RefPtr<Node> child = snapshot.nextNode()) {
39 // If we have been removed from the document during this loop, then 49 // If we have been removed from the document during this loop, then
40 // we don't want to tell the rest of our children that they've been 50 // we don't want to tell the rest of our children that they've been
41 // inserted into the document because they haven't. 51 // inserted into the document because they haven't.
42 if (node->inDocument() && child->parentNode() == node) 52 if (node->inDocument() && child->parentNode() == node)
43 notifyNodeInsertedIntoDocument(child.get()); 53 notifyNodeInsertedIntoDocument(child.get());
44 } 54 }
(...skipping 95 matching lines...) Expand 10 before | Expand all | Expand 10 after
140 // If we overcount it's safe, but not optimal because it means we'll travers e 150 // If we overcount it's safe, but not optimal because it means we'll travers e
141 // through the document in ChildFrameDisconnector looking for frames that ha ve 151 // through the document in ChildFrameDisconnector looking for frames that ha ve
142 // already been disconnected. 152 // already been disconnected.
143 ASSERT(node->connectedSubframeCount() == count); 153 ASSERT(node->connectedSubframeCount() == count);
144 154
145 return count; 155 return count;
146 } 156 }
147 #endif 157 #endif
148 158
149 } 159 }
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698