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

Side by Side Diff: third_party/WebKit/PerformanceTests/Events/EventsDispatchingInDeeplyNestedShadowTrees.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 unified diff | Download patch
OLDNEW
1 <!DOCTYPE html> 1 <!DOCTYPE html>
2 <html> 2 <html>
3 <head> 3 <head>
4 <script type="text/javascript" src="../resources/runner.js"></script> 4 <script type="text/javascript" src="../resources/runner.js"></script>
5 </head> 5 </head>
6 <body> 6 <body>
7 <div id="root"><div id="child1"></div><div id="child2"></div></div> 7 <div id="root"><div id="child1"></div><div id="child2"></div></div>
8 <script> 8 <script>
9 function createTreeOfTrees(root, depth, eachTreeHeight) 9 function createComposedTree(root, depth, eachTreeHeight)
10 { 10 {
11 var node = root; 11 var node = root;
12 var i; 12 var i;
13 for (i = 0; i < eachTreeHeight; ++i) { 13 for (i = 0; i < eachTreeHeight; ++i) {
14 var child = document.createElement('div'); 14 var child = document.createElement('div');
15 node.appendChild(child); 15 node.appendChild(child);
16 node = child; 16 node = child;
17 } 17 }
18 if (depth == 1) 18 if (depth == 1)
19 return; 19 return;
20 var child = document.createElement('div'); 20 var child = document.createElement('div');
21 node.appendChild(child); 21 node.appendChild(child);
22 var shadowRoot = child.createShadowRoot(); 22 var shadowRoot = child.createShadowRoot();
23 createTreeOfTrees(shadowRoot, depth - 1, eachTreeHeight); 23 createComposedTree(shadowRoot, depth - 1, eachTreeHeight);
24 } 24 }
25 25
26 function leftMostLeaf(root) 26 function leftMostLeaf(root)
27 { 27 {
28 var node = root; 28 var node = root;
29 while (node.firstChild) 29 while (node.firstChild)
30 node = node.firstChild 30 node = node.firstChild
31 if (!node.shadowRoot) 31 if (!node.shadowRoot)
32 return node; 32 return node;
33 return leftMostLeaf(node.shadowRoot) 33 return leftMostLeaf(node.shadowRoot)
34 } 34 }
35 35
36 function rightMostLeaf(root) 36 function rightMostLeaf(root)
37 { 37 {
38 var node = root; 38 var node = root;
39 while (node.lastChild) 39 while (node.lastChild)
40 node = node.lastChild 40 node = node.lastChild
41 if (!node.shadowRoot) 41 if (!node.shadowRoot)
42 return node; 42 return node;
43 return rightMostLeaf(node.shadowRoot) 43 return rightMostLeaf(node.shadowRoot)
44 } 44 }
45 45
46 var root = document.getElementById('root'); 46 var root = document.getElementById('root');
47 createTreeOfTrees(document.getElementById('child1'), 50, 20); 47 createComposedTree(document.getElementById('child1'), 50, 20);
48 createTreeOfTrees(document.getElementById('child2'), 50, 20); 48 createComposedTree(document.getElementById('child2'), 50, 20);
49 var leaf1 = leftMostLeaf(root); 49 var leaf1 = leftMostLeaf(root);
50 var leaf2 = rightMostLeaf(root); 50 var leaf2 = rightMostLeaf(root);
51 51
52 function run() 52 function run()
53 { 53 {
54 leaf1.dispatchEvent(new MouseEvent('mousemove', { 54 leaf1.dispatchEvent(new MouseEvent('mousemove', {
55 relatedTarget: leaf2 55 relatedTarget: leaf2
56 })); 56 }));
57 } 57 }
58 58
59 PerfTestRunner.measureRunsPerSecond({ 59 PerfTestRunner.measureRunsPerSecond({
60 description: "Measure mousemove events dispatching in shadow trees", 60 description: "Measure mousemove events dispatching in shadow trees",
61 run: run 61 run: run
62 }); 62 });
63 </script> 63 </script>
64 </body> 64 </body>
65 </html> 65 </html>
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698