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

Unified Diff: third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html

Issue 1684533002: Rename "tree of trees" to "composed tree". (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Created 4 years, 10 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 side-by-side diff with in-line comments
Download patch
Index: third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html
diff --git a/third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html b/third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html
index 57730c5050b6992d1494263b3a09c5b5eac1feaa..d39ea19669943435a5d9aa7a46cfdc58fe2b5a78 100644
--- a/third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html
+++ b/third_party/WebKit/LayoutTests/fast/dom/shadow/contains-with-shadow-dom.html
@@ -22,29 +22,29 @@ document.getElementById('sandbox').appendChild(
// Comparing a document with a node in a shadow tree.
-shouldBeFalse('document.contains(getNodeInTreeOfTrees("shadowHostA/"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/").contains(document)');
-shouldBeFalse('document.contains(getNodeInTreeOfTrees("shadowHostA/divA"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/divA").contains(document)');
+shouldBeFalse('document.contains(getNodeInComposedTree("shadowHostA/"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/").contains(document)');
+shouldBeFalse('document.contains(getNodeInComposedTree("shadowHostA/divA"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/divA").contains(document)');
// Comparing a node in document with a node in a shadow tree.
-shouldBeTrue('getNodeInTreeOfTrees("shadowHostA/").contains(getNodeInTreeOfTrees("shadowHostA/divA"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/divA").contains(getNodeInTreeOfTrees("shadowHostA/"))');
+shouldBeTrue('getNodeInComposedTree("shadowHostA/").contains(getNodeInComposedTree("shadowHostA/divA"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/divA").contains(getNodeInComposedTree("shadowHostA/"))');
// Comparing a node in a shadow tree with a node in a shadow tree enclosing the first tree.
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB/"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostB/").contains(getNodeInTreeOfTrees("shadowHostA/"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/divA").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB/divB"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostB/divB").contains(getNodeInTreeOfTrees("shadowHostA/divA"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/").contains(getNodeInComposedTree("shadowHostA/shadowHostB/"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostB/").contains(getNodeInComposedTree("shadowHostA/"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/divA").contains(getNodeInComposedTree("shadowHostA/shadowHostB/divB"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostB/divB").contains(getNodeInComposedTree("shadowHostA/divA"))');
// Comparing a node in a shadow tree with a node in a sibling shadow tree.
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostB/").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostC/"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostC/").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB/"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostB/divB").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostC/divC"))');
-shouldBeFalse('getNodeInTreeOfTrees("shadowHostA/shadowHostC/divC").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB/divB"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostB/").contains(getNodeInComposedTree("shadowHostA/shadowHostC/"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostC/").contains(getNodeInComposedTree("shadowHostA/shadowHostB/"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostB/divB").contains(getNodeInComposedTree("shadowHostA/shadowHostC/divC"))');
+shouldBeFalse('getNodeInComposedTree("shadowHostA/shadowHostC/divC").contains(getNodeInComposedTree("shadowHostA/shadowHostB/divB"))');
// Self-comparing a node in a shadow tree.
-shouldBeTrue('getNodeInTreeOfTrees("shadowHostA/shadowHostB").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB"))');
-shouldBeTrue('getNodeInTreeOfTrees("shadowHostA/shadowHostB/").contains(getNodeInTreeOfTrees("shadowHostA/shadowHostB/"))');
+shouldBeTrue('getNodeInComposedTree("shadowHostA/shadowHostB").contains(getNodeInComposedTree("shadowHostA/shadowHostB"))');
+shouldBeTrue('getNodeInComposedTree("shadowHostA/shadowHostB/").contains(getNodeInComposedTree("shadowHostA/shadowHostB/"))');
</script>
</body>

Powered by Google App Engine
This is Rietveld 408576698