| OLD | NEW |
| 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 14 matching lines...) Expand all Loading... |
| 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/dom/shadow/ShadowRoot.h" |
| 32 | 32 |
| 33 namespace WebCore { | 33 namespace WebCore { |
| 34 | 34 |
| 35 class ShadowRootVector : public Vector<RefPtr<ShadowRoot> > { | 35 class ShadowRootVector : public WillBeHeapVector<RefPtrWillBeMember<ShadowRoot>
> { |
| 36 public: | 36 public: |
| 37 explicit ShadowRootVector(ElementShadow* tree) | 37 explicit ShadowRootVector(ElementShadow* tree) |
| 38 { | 38 { |
| 39 for (ShadowRoot* root = tree->youngestShadowRoot(); root; root = root->o
lderShadowRoot()) | 39 for (ShadowRoot* root = tree->youngestShadowRoot(); root; root = root->o
lderShadowRoot()) |
| 40 append(root); | 40 append(root); |
| 41 } | 41 } |
| 42 }; | 42 }; |
| 43 | 43 |
| 44 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN
ode& node) | 44 void ChildNodeInsertionNotifier::notifyDescendantInsertedIntoDocument(ContainerN
ode& node) |
| 45 { | 45 { |
| (...skipping 103 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 149 // If we overcount it's safe, but not optimal because it means we'll travers
e | 149 // If we overcount it's safe, but not optimal because it means we'll travers
e |
| 150 // through the document in ChildFrameDisconnector looking for frames that ha
ve | 150 // through the document in ChildFrameDisconnector looking for frames that ha
ve |
| 151 // already been disconnected. | 151 // already been disconnected. |
| 152 ASSERT(node.connectedSubframeCount() == count); | 152 ASSERT(node.connectedSubframeCount() == count); |
| 153 | 153 |
| 154 return count; | 154 return count; |
| 155 } | 155 } |
| 156 #endif | 156 #endif |
| 157 | 157 |
| 158 } | 158 } |
| OLD | NEW |