third_party/WebKit/LayoutTests/fast/dom/shadow/v1-composed-tree-traversal-2.html - Issue 1489433002: Support the essential part of Shadow DOM v1

Side by Side Diff

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Side by Side Diff: third_party/WebKit/LayoutTests/fast/dom/shadow/v1-composed-tree-traversal-2.html

Issue 1489433002: Support the essential part of Shadow DOM v1 (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master

Patch Set: Remove one TODO Created 5 years ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« third_party/WebKit/LayoutTests/fast/dom/shadow/v1-composed-tree-traversal-1.html ('K') | « third_party/WebKit/LayoutTests/fast/dom/shadow/v1-composed-tree-traversal-1.html ('k') | third_party/WebKit/LayoutTests/fast/dom/shadow/v1-slots-1.html » ('j') | third_party/WebKit/LayoutTests/fast/dom/shadow/v1-slots-api-1.html » ('J')
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

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 'use strict';

	29 convertTemplatesToShadowRootsWithin(d1);

	30 removeWhiteSpaceOnlyTextNodes(d1);

	31 document.body.offsetLeft;

	32

	33 const d1_shadow = d1.shadowRoot;

	34 const d1_1 = d1_shadow.querySelector('#d1-1');

	35 const d1_2 = d1_shadow.querySelector('#d1-2');

	36 const d1_3 = d1_shadow.querySelector('#d1-3');

	37 const d1_4 = d1_shadow.querySelector('#d1-4');

	38 const d1_s0= d1_shadow.querySelector('#d1-s0');

	39 const d1_s1 = d1_shadow.querySelector('[name=d1-s1]');

	40 const d1_s2 = d1_shadow.querySelector('[name=d1-s2]');

	41

	42 const d1_1_shadow = d1_1.shadowRoot;

	43 const d1_1_1 = d1_1_shadow.querySelector('#d1-1-1');

	44 const d1_1_2 = d1_1_shadow.querySelector('#d1-1-2');

	45 const d1_1_s1 = d1_1_shadow.querySelector('[name=d1-1-s1]');

	46 const d1_1_s2 = d1_1_shadow.querySelector('[name=d1-1-s2]');

	47

	48 test(() => {

	49 assert_equals(internals.nextInComposedTree(d1), d1_1);
	tkent 2015/12/10 04:23:02 C++ unit test is more suitable. C++ unit test is more suitable.
	50 assert_equals(internals.nextInComposedTree(d1_1), d1_1_1);

	51 assert_equals(internals.nextInComposedTree(d1_1_1), d2);

	52 assert_equals(internals.nextInComposedTree(d2), d1_4);

	53 assert_equals(internals.nextInComposedTree(d1_4), d1_1_2);

	54 assert_equals(internals.nextInComposedTree(d1_1_2), d6);

	55 }, "composed tree traversal's next in v1");

	56

	57 test(() => {

	58 assert_equals(internals.previousInComposedTree(d6), d1_1_2);

	59 }, "composed tree traversal's previous in v1");

	60

	61 test(() => {

	62 assert_equals(internals.parentInComposedTree(d1_1_1), d1_1);

	63 assert_equals(internals.parentInComposedTree(d1_1_2), d1_1);

	64 assert_equals(internals.parentInComposedTree(d2), d1_1);

	65 assert_equals(internals.parentInComposedTree(d1_4), d1_1);

	66

	67 assert_equals(internals.parentInComposedTree(d3), null);

	68 assert_equals(internals.parentInComposedTree(d4), null);

	69 }, "composed tree traversal's parent in v1");

	70 </script>

OLD	NEW