Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(6)

Issues Search
    My Issues | Starred     Open | Closed | All

Side by Side Diff: LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html

Issue 21123005: Node.contains should return true for nodes in Shadow DOM. (Closed) Base URL: svn://svn.chromium.org/blink/trunk
Patch Set: Ready for another look Created 7 years, 4 months 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 | Annotate | Revision Log
« no previous file with comments | « no previous file | LayoutTests/fast/dom/shadow/contains-with-shadow-dom-expected.txt » ('j') | Source/core/dom/Node.cpp » ('J')
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 <!doctype html> 1 <!doctype html>
2 <html> 2 <html>
3 <head> 3 <head>
4 <script src="../../js/resources/js-test-pre.js"></script> 4 <script src="../../js/resources/js-test-pre.js"></script>
5 <script src="resources/shadow-dom.js"></script> 5 <script src="resources/shadow-dom.js"></script>
6 </head> 6 </head>
7 <body> 7 <body>
8 <div id="sandbox"></div> 8 <div id="sandbox"></div>
9 <script> 9 <script>
10 description("Tests for node's contains()."); 10 description("Tests for node's contains().");
11 11
12 document.getElementById('sandbox').appendChild( 12 document.getElementById('sandbox').appendChild(
13 createDOM('div', {'id': 'shadowHostA'}, 13 createDOM('div', {'id': 'shadowHostA'},
14 createShadowRoot( 14 createShadowRoot(
15 createDOM('div', {'id': 'divA'}), 15 createDOM('div', {'id': 'divA'}),
16 createDOM('div', {'id': 'shadowHostB'}, 16 createDOM('div', {'id': 'shadowHostB'},
17 createShadowRoot( 17 createShadowRoot(
18 createDOM('div', {'id': 'divB'}))), 18 createDOM('div', {'id': 'divB'}))),
19 createDOM('div', {'id': 'shadowHostC'}, 19 createDOM('div', {'id': 'shadowHostC'},
20 createShadowRoot( 20 createShadowRoot(
21 createDOM('div', {'id': 'divC'})))))); 21 createDOM('div', {'id': 'divC'}))))));
22 22
23 23
24 // Comparing a document with a node in a shadow tree. 24 // Comparing a document with a node in a shadow tree.
25 shouldBeFalse('document.contains(getNodeInShadowTreeStack("shadowHostA/"))'); 25 shouldBeTrue('document.contains(getNodeInShadowTreeStack("shadowHostA/"))');
26 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/").contains(document)'); 26 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/").contains(document)');
27 shouldBeFalse('document.contains(getNodeInShadowTreeStack("shadowHostA/divA"))') ; 27 shouldBeTrue('document.contains(getNodeInShadowTreeStack("shadowHostA/divA"))');
28 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(document)') ; 28 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(document)') ;
29 29
30 // Comparing a node in document with a node in a shadow tree. 30 // Comparing a node in document with a node in a shadow tree.
31 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/").contains(getNodeInShadowT reeStack("shadowHostA/divA"))'); 31 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/").contains(getNodeInShadowT reeStack("shadowHostA/divA"))');
32 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(getNodeInSh adowTreeStack("shadowHostA/"))'); 32 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(getNodeInSh adowTreeStack("shadowHostA/"))');
33 33
34 // Comparing a node in a shadow tree with a node in a shadow tree enclosing the first tree. 34 // Comparing a node in a shadow tree with a node in a shadow tree enclosing the first tree.
35 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/").contains(getNodeInShadow TreeStack("shadowHostA/shadowHostB/"))'); 35 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/").contains(getNodeInShadowT reeStack("shadowHostA/shadowHostB/"))');
36 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(get NodeInShadowTreeStack("shadowHostA/"))'); 36 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(get NodeInShadowTreeStack("shadowHostA/"))');
37 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(getNodeInSh adowTreeStack("shadowHostA/shadowHostB/divB"))'); 37 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/divA").contains(getNodeInSh adowTreeStack("shadowHostA/shadowHostB/divB"))');
38 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB").contains (getNodeInShadowTreeStack("shadowHostA/divA"))'); 38 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB").contains (getNodeInShadowTreeStack("shadowHostA/divA"))');
39 39
40 // Comparing a node in a shadow tree with a node in a sibling shadow tree. 40 // Comparing a node in a shadow tree with a node in a sibling shadow tree.
41 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(get NodeInShadowTreeStack("shadowHostA/shadowHostC/"))'); 41 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(get NodeInShadowTreeStack("shadowHostA/shadowHostC/"))');
42 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostC/").contains(get NodeInShadowTreeStack("shadowHostA/shadowHostB/"))'); 42 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostC/").contains(get NodeInShadowTreeStack("shadowHostA/shadowHostB/"))');
43 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB").contains (getNodeInShadowTreeStack("shadowHostA/shadowHostC/divC"))'); 43 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB").contains (getNodeInShadowTreeStack("shadowHostA/shadowHostC/divC"))');
44 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostC/divC").contains (getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB"))'); 44 shouldBeFalse('getNodeInShadowTreeStack("shadowHostA/shadowHostC/divC").contains (getNodeInShadowTreeStack("shadowHostA/shadowHostB/divB"))');
45 45
46 // Self-comparing a node in a shadow tree. 46 // Self-comparing a node in a shadow tree.
47 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/shadowHostB").contains(getNo deInShadowTreeStack("shadowHostA/shadowHostB"))'); 47 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/shadowHostB").contains(getNo deInShadowTreeStack("shadowHostA/shadowHostB"))');
48 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(getN odeInShadowTreeStack("shadowHostA/shadowHostB/"))'); 48 shouldBeTrue('getNodeInShadowTreeStack("shadowHostA/shadowHostB/").contains(getN odeInShadowTreeStack("shadowHostA/shadowHostB/"))');
49 </script> 49 </script>
50 <script src="../../js/resources/js-test-post.js"></script> 50 <script src="../../js/resources/js-test-post.js"></script>
51 </body> 51 </body>
OLDNEW
« no previous file with comments | « no previous file | LayoutTests/fast/dom/shadow/contains-with-shadow-dom-expected.txt » ('j') | Source/core/dom/Node.cpp » ('J')

Powered by Google App Engine
This is Rietveld 408576698