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 468 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
479 RefPtrWillBeRawPtr<Element> child1 = body->querySelector("#child1", ASSERT_N
O_EXCEPTION); | 479 RefPtrWillBeRawPtr<Element> child1 = body->querySelector("#child1", ASSERT_N
O_EXCEPTION); |
480 RefPtrWillBeRawPtr<Element> child2 = body->querySelector("#child2", ASSERT_N
O_EXCEPTION); | 480 RefPtrWillBeRawPtr<Element> child2 = body->querySelector("#child2", ASSERT_N
O_EXCEPTION); |
481 | 481 |
482 attachOpenShadowRoot(*host, shadowHTML); | 482 attachOpenShadowRoot(*host, shadowHTML); |
483 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot = host->openShadowRoot(); | 483 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot = host->openShadowRoot(); |
484 RefPtrWillBeRawPtr<Element> slot1 = shadowRoot->querySelector("[name=slot1]"
, ASSERT_NO_EXCEPTION); | 484 RefPtrWillBeRawPtr<Element> slot1 = shadowRoot->querySelector("[name=slot1]"
, ASSERT_NO_EXCEPTION); |
485 RefPtrWillBeRawPtr<Element> slot2 = shadowRoot->querySelector("[name=slot2]"
, ASSERT_NO_EXCEPTION); | 485 RefPtrWillBeRawPtr<Element> slot2 = shadowRoot->querySelector("[name=slot2]"
, ASSERT_NO_EXCEPTION); |
486 RefPtrWillBeRawPtr<Element> shadowChild1 = shadowRoot->querySelector("#shado
w-child1", ASSERT_NO_EXCEPTION); | 486 RefPtrWillBeRawPtr<Element> shadowChild1 = shadowRoot->querySelector("#shado
w-child1", ASSERT_NO_EXCEPTION); |
487 RefPtrWillBeRawPtr<Element> shadowChild2 = shadowRoot->querySelector("#shado
w-child2", ASSERT_NO_EXCEPTION); | 487 RefPtrWillBeRawPtr<Element> shadowChild2 = shadowRoot->querySelector("#shado
w-child2", ASSERT_NO_EXCEPTION); |
488 | 488 |
| 489 ASSERT(slot1); |
| 490 ASSERT(slot2); |
489 EXPECT_EQ(shadowChild1.get(), ComposedTreeTraversal::firstChild(*host)); | 491 EXPECT_EQ(shadowChild1.get(), ComposedTreeTraversal::firstChild(*host)); |
490 EXPECT_EQ(child1.get(), ComposedTreeTraversal::nextSibling(*shadowChild1)); | 492 EXPECT_EQ(child1.get(), ComposedTreeTraversal::nextSibling(*shadowChild1)); |
491 EXPECT_EQ(child2.get(), ComposedTreeTraversal::nextSibling(*child1)); | 493 EXPECT_EQ(child2.get(), ComposedTreeTraversal::nextSibling(*child1)); |
492 EXPECT_EQ(shadowChild2.get(), ComposedTreeTraversal::nextSibling(*child2)); | 494 EXPECT_EQ(shadowChild2.get(), ComposedTreeTraversal::nextSibling(*child2)); |
493 } | 495 } |
494 | 496 |
495 TEST_F(ComposedTreeTraversalTest, v1Redistribution) | 497 TEST_F(ComposedTreeTraversalTest, v1Redistribution) |
496 { | 498 { |
497 const char* mainHTML = | 499 const char* mainHTML = |
498 "<div id='d1'>" | 500 "<div id='d1'>" |
(...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
537 RefPtrWillBeRawPtr<Element> d1s1 = shadowRoot1->querySelector("[name=d1-s1]"
, ASSERT_NO_EXCEPTION); | 539 RefPtrWillBeRawPtr<Element> d1s1 = shadowRoot1->querySelector("[name=d1-s1]"
, ASSERT_NO_EXCEPTION); |
538 RefPtrWillBeRawPtr<Element> d1s2 = shadowRoot1->querySelector("[name=d1-s2]"
, ASSERT_NO_EXCEPTION); | 540 RefPtrWillBeRawPtr<Element> d1s2 = shadowRoot1->querySelector("[name=d1-s2]"
, ASSERT_NO_EXCEPTION); |
539 | 541 |
540 attachOpenShadowRoot(*d11, shadowHTML2); | 542 attachOpenShadowRoot(*d11, shadowHTML2); |
541 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot2 = d11->openShadowRoot(); | 543 RefPtrWillBeRawPtr<ShadowRoot> shadowRoot2 = d11->openShadowRoot(); |
542 RefPtrWillBeRawPtr<Element> d111 = shadowRoot2->querySelector("#d1-1-1", ASS
ERT_NO_EXCEPTION); | 544 RefPtrWillBeRawPtr<Element> d111 = shadowRoot2->querySelector("#d1-1-1", ASS
ERT_NO_EXCEPTION); |
543 RefPtrWillBeRawPtr<Element> d112 = shadowRoot2->querySelector("#d1-1-2", ASS
ERT_NO_EXCEPTION); | 545 RefPtrWillBeRawPtr<Element> d112 = shadowRoot2->querySelector("#d1-1-2", ASS
ERT_NO_EXCEPTION); |
544 RefPtrWillBeRawPtr<Element> d11s1 = shadowRoot2->querySelector("[name=d1-1-s
1]", ASSERT_NO_EXCEPTION); | 546 RefPtrWillBeRawPtr<Element> d11s1 = shadowRoot2->querySelector("[name=d1-1-s
1]", ASSERT_NO_EXCEPTION); |
545 RefPtrWillBeRawPtr<Element> d11s2 = shadowRoot2->querySelector("[name=d1-1-s
2]", ASSERT_NO_EXCEPTION); | 547 RefPtrWillBeRawPtr<Element> d11s2 = shadowRoot2->querySelector("[name=d1-1-s
2]", ASSERT_NO_EXCEPTION); |
546 | 548 |
| 549 ASSERT(d5); |
| 550 ASSERT(d12); |
| 551 ASSERT(d13); |
| 552 ASSERT(d1s0); |
| 553 ASSERT(d1s1); |
| 554 ASSERT(d1s2); |
| 555 ASSERT(d11s1); |
| 556 ASSERT(d11s2); |
547 EXPECT_EQ(d11.get(), ComposedTreeTraversal::next(*d1)); | 557 EXPECT_EQ(d11.get(), ComposedTreeTraversal::next(*d1)); |
548 EXPECT_EQ(d111.get(), ComposedTreeTraversal::next(*d11)); | 558 EXPECT_EQ(d111.get(), ComposedTreeTraversal::next(*d11)); |
549 EXPECT_EQ(d2.get(), ComposedTreeTraversal::next(*d111)); | 559 EXPECT_EQ(d2.get(), ComposedTreeTraversal::next(*d111)); |
550 EXPECT_EQ(d14.get(), ComposedTreeTraversal::next(*d2)); | 560 EXPECT_EQ(d14.get(), ComposedTreeTraversal::next(*d2)); |
551 EXPECT_EQ(d112.get(), ComposedTreeTraversal::next(*d14)); | 561 EXPECT_EQ(d112.get(), ComposedTreeTraversal::next(*d14)); |
552 EXPECT_EQ(d6.get(), ComposedTreeTraversal::next(*d112)); | 562 EXPECT_EQ(d6.get(), ComposedTreeTraversal::next(*d112)); |
553 | 563 |
554 EXPECT_EQ(d112.get(), ComposedTreeTraversal::previous(*d6)); | 564 EXPECT_EQ(d112.get(), ComposedTreeTraversal::previous(*d6)); |
555 | 565 |
556 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d111)); | 566 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d111)); |
557 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d112)); | 567 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d112)); |
558 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d2)); | 568 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d2)); |
559 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d14)); | 569 EXPECT_EQ(d11.get(), ComposedTreeTraversal::parent(*d14)); |
560 EXPECT_EQ(nullptr, ComposedTreeTraversal::parent(*d3)); | 570 EXPECT_EQ(nullptr, ComposedTreeTraversal::parent(*d3)); |
561 EXPECT_EQ(nullptr, ComposedTreeTraversal::parent(*d4)); | 571 EXPECT_EQ(nullptr, ComposedTreeTraversal::parent(*d4)); |
562 } | 572 } |
563 | 573 |
564 } // namespace blink | 574 } // namespace blink |
OLD | NEW |