| OLD | NEW |
|---|
| (Empty) | |
| 1 <!DOCTYPE html> |
| 2 <script src='../../../resources/testharness.js'></script> |
| 3 <script src='../../../resources/testharnessreport.js'></script> |
| 4 <script src='resources/shadow-dom.js'></script> |
| 5 <div id='d1'> |
| 6 <template data-mode='open'> |
| 7 <div id='d1-1'> |
| 8 <template data-mode='open'> |
| 9 <div id='d1-1-1'></div> |
| 10 <slot name='d1-1-s1'></slot> |
| 11 <slot name='d1-1-s2'></slot> |
| 12 <div id='d1-1-2'></div> |
| 13 </template> |
| 14 <div id='d1-2'></div> |
| 15 <slot id='d1-s0'></slot> |
| 16 <slot name='d1-s1' slot='d1-1-s1'></slot> |
| 17 <slot name='d1-s2'></slot> |
| 18 <div id='d1-3'></div> |
| 19 <div id='d1-4' slot='d1-1-s1'></div> |
| 20 </div> |
| 21 </template> |
| 22 <div id='d2' slot='d1-s1'></div> |
| 23 <div id='d3' slot='d1-s2'></div> |
| 24 <div id='d4' slot='non-existent'></div> |
| 25 <div id='d5'></div> |
| 26 </div><div id='d6'></div> |
| 27 <script> |
| 28 convertTemplatesToShadowRootsWithin(d1); |
| 29 removeWhiteSpaceOnlyTextNodes(d1); |
| 30 document.body.offsetLeft; |
| 31 |
| 32 const d1_shadow = d1.shadowRoot; |
| 33 const d1_1 = d1_shadow.querySelector('#d1-1'); |
| 34 const d1_2 = d1_shadow.querySelector('#d1-2'); |
| 35 const d1_3 = d1_shadow.querySelector('#d1-3'); |
| 36 const d1_4 = d1_shadow.querySelector('#d1-4'); |
| 37 const d1_s0= d1_shadow.querySelector('#d1-s0'); |
| 38 const d1_s1 = d1_shadow.querySelector('[name=d1-s1]'); |
| 39 const d1_s2 = d1_shadow.querySelector('[name=d1-s2]'); |
| 40 |
| 41 const d1_1_shadow = d1_1.shadowRoot; |
| 42 const d1_1_1 = d1_1_shadow.querySelector('#d1-1-1'); |
| 43 const d1_1_2 = d1_1_shadow.querySelector('#d1-1-2'); |
| 44 const d1_1_s1 = d1_1_shadow.querySelector('[name=d1-1-s1]'); |
| 45 const d1_1_s2 = d1_1_shadow.querySelector('[name=d1-1-s2]'); |
| 46 |
| 47 test(() => { |
| 48 assert_equals(internals.nextInComposedTree(d1), d1_1); |
| 49 assert_equals(internals.nextInComposedTree(d1_1), d1_1_1); |
| 50 assert_equals(internals.nextInComposedTree(d1_1_1), d2); |
| 51 assert_equals(internals.nextInComposedTree(d2), d1_4); |
| 52 assert_equals(internals.nextInComposedTree(d1_4), d1_1_2); |
| 53 assert_equals(internals.nextInComposedTree(d1_1_2), d6); |
| 54 }, "composed tree traversal's next in v1"); |
| 55 |
| 56 test(() => { |
| 57 assert_equals(internals.previousInComposedTree(d6), d1_1_2); |
| 58 }, "composed tree traversal's previous in v1"); |
| 59 |
| 60 test(() => { |
| 61 assert_equals(internals.parentInComposedTree(d1_1_1), d1_1); |
| 62 assert_equals(internals.parentInComposedTree(d1_1_2), d1_1); |
| 63 assert_equals(internals.parentInComposedTree(d2), d1_1); |
| 64 assert_equals(internals.parentInComposedTree(d1_4), d1_1); |
| 65 |
| 66 assert_equals(internals.parentInComposedTree(d3), null); |
| 67 assert_equals(internals.parentInComposedTree(d4), null); |
| 68 }, "composed tree traversal's parent in v1"); |
| 69 </script> |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 1489433002:
Support the essential part of Shadow DOM v1 (Closed)
Base URL: https://chromium.googlesource.com/chromium/src.git@master