| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| 11 * contributors may be used to endorse or promote products derived from | 11 * contributors may be used to endorse or promote products derived from |
| 12 * this software without specific prior written permission. | 12 * this software without specific prior written permission. |
| 13 * | 13 * |
| 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 14 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 15 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 16 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 17 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 18 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 19 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 20 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 25 */ | 25 */ |
| 26 | 26 |
| 27 #include "sky/engine/config.h" | 27 #include "sky/engine/config.h" |
| 28 #include "sky/engine/core/dom/shadow/ShadowRoot.h" | 28 #include "sky/engine/core/dom/shadow/ShadowRoot.h" |
| 29 | 29 |
| 30 #include "sky/engine/bindings/core/v8/ExceptionState.h" | 30 #include "sky/engine/bindings2/exception_state.h" |
| 31 #include "sky/engine/core/css/resolver/StyleResolver.h" | 31 #include "sky/engine/core/css/resolver/StyleResolver.h" |
| 32 #include "sky/engine/core/dom/Document.h" | 32 #include "sky/engine/core/dom/Document.h" |
| 33 #include "sky/engine/core/dom/ElementTraversal.h" | 33 #include "sky/engine/core/dom/ElementTraversal.h" |
| 34 #include "sky/engine/core/dom/StyleEngine.h" | 34 #include "sky/engine/core/dom/StyleEngine.h" |
| 35 #include "sky/engine/core/dom/Text.h" | 35 #include "sky/engine/core/dom/Text.h" |
| 36 #include "sky/engine/core/dom/shadow/ElementShadow.h" | 36 #include "sky/engine/core/dom/shadow/ElementShadow.h" |
| 37 #include "sky/engine/core/dom/shadow/InsertionPoint.h" | 37 #include "sky/engine/core/dom/shadow/InsertionPoint.h" |
| 38 #include "sky/engine/public/platform/Platform.h" | 38 #include "sky/engine/public/platform/Platform.h" |
| 39 | 39 |
| 40 namespace blink { | 40 namespace blink { |
| (...skipping 34 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 75 } | 75 } |
| 76 | 76 |
| 77 void ShadowRoot::dispose() | 77 void ShadowRoot::dispose() |
| 78 { | 78 { |
| 79 invalidateDescendantInsertionPoints(); | 79 invalidateDescendantInsertionPoints(); |
| 80 removeDetachedChildren(); | 80 removeDetachedChildren(); |
| 81 } | 81 } |
| 82 | 82 |
| 83 PassRefPtr<Node> ShadowRoot::cloneNode(bool, ExceptionState& exceptionState) | 83 PassRefPtr<Node> ShadowRoot::cloneNode(bool, ExceptionState& exceptionState) |
| 84 { | 84 { |
| 85 exceptionState.throwDOMException(DataCloneError, "ShadowRoot nodes are not c
lonable."); | 85 exceptionState.ThrowDOMException(DataCloneError, "ShadowRoot nodes are not c
lonable."); |
| 86 return nullptr; | 86 return nullptr; |
| 87 } | 87 } |
| 88 | 88 |
| 89 PassRefPtr<Node> ShadowRoot::cloneNode(ExceptionState& exceptionState) | 89 PassRefPtr<Node> ShadowRoot::cloneNode(ExceptionState& exceptionState) |
| 90 { | 90 { |
| 91 return cloneNode(exceptionState); | 91 return cloneNode(exceptionState); |
| 92 } | 92 } |
| 93 | 93 |
| 94 PassRefPtr<Node> ShadowRoot::cloneNode(bool deep) | 94 PassRefPtr<Node> ShadowRoot::cloneNode(bool deep) |
| 95 { | 95 { |
| (...skipping 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 195 Vector<RefPtr<InsertionPoint> > insertionPoints; | 195 Vector<RefPtr<InsertionPoint> > insertionPoints; |
| 196 for (InsertionPoint* insertionPoint = Traversal<InsertionPoint>::firstWithin
(*this); insertionPoint; insertionPoint = Traversal<InsertionPoint>::next(*inser
tionPoint, this)) | 196 for (InsertionPoint* insertionPoint = Traversal<InsertionPoint>::firstWithin
(*this); insertionPoint; insertionPoint = Traversal<InsertionPoint>::next(*inser
tionPoint, this)) |
| 197 insertionPoints.append(insertionPoint); | 197 insertionPoints.append(insertionPoint); |
| 198 | 198 |
| 199 m_descendantInsertionPoints.swap(insertionPoints); | 199 m_descendantInsertionPoints.swap(insertionPoints); |
| 200 | 200 |
| 201 return m_descendantInsertionPoints; | 201 return m_descendantInsertionPoints; |
| 202 } | 202 } |
| 203 | 203 |
| 204 } | 204 } |
| OLD | NEW |