OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "config.h" | 5 #include "config.h" |
6 #include "core/dom/shadow/ComposedTreeTraversal.h" | 6 #include "core/dom/shadow/ComposedTreeTraversal.h" |
7 | 7 |
8 #include "bindings/core/v8/ExceptionStatePlaceholder.h" | 8 #include "bindings/core/v8/ExceptionStatePlaceholder.h" |
9 #include "core/dom/Document.h" | 9 #include "core/dom/Document.h" |
10 #include "core/dom/Element.h" | 10 #include "core/dom/Element.h" |
(...skipping 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
52 HTMLDocument& ComposedTreeTraversalTest::document() const | 52 HTMLDocument& ComposedTreeTraversalTest::document() const |
53 { | 53 { |
54 return *m_document; | 54 return *m_document; |
55 } | 55 } |
56 | 56 |
57 void ComposedTreeTraversalTest::setupSampleHTML(const char* mainHTML, const char
* shadowHTML, unsigned index) | 57 void ComposedTreeTraversalTest::setupSampleHTML(const char* mainHTML, const char
* shadowHTML, unsigned index) |
58 { | 58 { |
59 RefPtrWillBeRawPtr<Element> body = document().body(); | 59 RefPtrWillBeRawPtr<Element> body = document().body(); |
60 body->setInnerHTML(String::fromUTF8(mainHTML), ASSERT_NO_EXCEPTION); | 60 body->setInnerHTML(String::fromUTF8(mainHTML), ASSERT_NO_EXCEPTION); |
61 RefPtrWillBeRawPtr<Element> shadowHost = toElement(NodeTraversal::childAt(*b
ody, index)); | 61 RefPtrWillBeRawPtr<Element> shadowHost = toElement(NodeTraversal::childAt(*b
ody, index)); |
62 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot = shadowHost->createShadowRootInte
rnal(ShadowRootType::OpenByDefault, ASSERT_NO_EXCEPTION); | 62 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot = shadowHost->createShadowRootInte
rnal(ShadowRootType::V0, ASSERT_NO_EXCEPTION); |
63 shadowRoot->setInnerHTML(String::fromUTF8(shadowHTML), ASSERT_NO_EXCEPTION); | 63 shadowRoot->setInnerHTML(String::fromUTF8(shadowHTML), ASSERT_NO_EXCEPTION); |
64 body->updateDistribution(); | 64 body->updateDistribution(); |
65 } | 65 } |
66 | 66 |
67 void testCommonAncestor(Node* expectedResult, const Node& nodeA, const Node& nod
eB) | 67 void testCommonAncestor(Node* expectedResult, const Node& nodeA, const Node& nod
eB) |
68 { | 68 { |
69 Node* result1 = ComposedTreeTraversal::commonAncestor(nodeA, nodeB); | 69 Node* result1 = ComposedTreeTraversal::commonAncestor(nodeA, nodeB); |
70 EXPECT_EQ(expectedResult, result1) << "commonAncestor(" << nodeA.textContent
() << "," << nodeB.textContent() << ")"; | 70 EXPECT_EQ(expectedResult, result1) << "commonAncestor(" << nodeA.textContent
() << "," << nodeB.textContent() << ")"; |
71 Node* result2 = ComposedTreeTraversal::commonAncestor(nodeB, nodeA); | 71 Node* result2 = ComposedTreeTraversal::commonAncestor(nodeB, nodeA); |
72 EXPECT_EQ(expectedResult, result2) << "commonAncestor(" << nodeB.textContent
() << "," << nodeA.textContent() << ")"; | 72 EXPECT_EQ(expectedResult, result2) << "commonAncestor(" << nodeB.textContent
() << "," << nodeA.textContent() << ")"; |
(...skipping 293 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
366 EXPECT_EQ(*m2->firstChild(), ComposedTreeTraversal::previousPostOrder(*m2)); | 366 EXPECT_EQ(*m2->firstChild(), ComposedTreeTraversal::previousPostOrder(*m2)); |
367 | 367 |
368 EXPECT_EQ(*s11->firstChild(), ComposedTreeTraversal::previousPostOrder(*s11)
); | 368 EXPECT_EQ(*s11->firstChild(), ComposedTreeTraversal::previousPostOrder(*s11)
); |
369 EXPECT_EQ(*m10, ComposedTreeTraversal::previousPostOrder(*s12)); | 369 EXPECT_EQ(*m10, ComposedTreeTraversal::previousPostOrder(*s12)); |
370 EXPECT_EQ(*s120->firstChild(), ComposedTreeTraversal::previousPostOrder(*s12
0)); | 370 EXPECT_EQ(*s120->firstChild(), ComposedTreeTraversal::previousPostOrder(*s12
0)); |
371 EXPECT_EQ(*s11, ComposedTreeTraversal::previousPostOrder(*s120->firstChild()
)); | 371 EXPECT_EQ(*s11, ComposedTreeTraversal::previousPostOrder(*s120->firstChild()
)); |
372 EXPECT_EQ(nullptr, ComposedTreeTraversal::previousPostOrder(*s120->firstChil
d(), s12.get())); | 372 EXPECT_EQ(nullptr, ComposedTreeTraversal::previousPostOrder(*s120->firstChil
d(), s12.get())); |
373 } | 373 } |
374 | 374 |
375 } // namespace blink | 375 } // namespace blink |
OLD | NEW |